Unwanted Users Research Articles

Bird feeding devices exclude unwelcome visitors. More-than-humans shaping the architecture and technology of birdfeeders in twentieth-century Finland

In this article, we investigate the evolution of the birdfeeder and analyze it as a multispecies technology, a technological artefact that has co-evolved between multispecies interactions of humans, the target species of the feeding, and unwanted visitors. We use close reading as a method to examine pictures, design descriptions, photos and text sources published in Finnish magazines and newspapers from the late nineteenth century, when birdfeeders were first discussed, until the late twentieth century, with the aim of analyzing how birdfeeder designs and models have changed in relation to various (and especially unwanted) visitor species. Birdfeeders are visited not only by species that humans want to feed but also by several unwanted visitors, such as birds, mammals, bacteria and the weather. Being inspired by posthumanism and Science and Technology Studies (STS), we ask what the role of unwanted visitors has been as co-designers of technological artefacts, here the birdfeeder. Our article discusses the broader subject of how people welcome or exclude other beings from shared environments. We argue that it is vital for environmental humanities scholars to study artefacts and technology and vice versa, for design studies and STS scholars to examine non-humans. We hope to encourage other researchers to ponder how animals, and unwanted users in general, participate in designing technology and artefacts.

ANALISIS KEAMANAN JARINGAN WIFI MAHASISWA UBD DARI SERANGAN PACKET SNIFFING

The wifi network of Bina Darma University is open to potential attacks by hackers, as they are unavoidably carried out. Network security is the act of recognizing and blocking unwanted users, or intruders, from computer networks. It serves as a safeguard for a network system against unauthorized and careless network users. In this study, the "Experiment Method" is employed. One approach that seeks to both test and explain an event is the experiment technique. Using the tools ettercap and wireshark, tests on network security were run and the findings analyzed for this study. The study's findings show that the network security encryption utilized at Bina and the security mechanism on the ubd student wifi network are both in good working order.

AN ENHANCED SOFTWARE AS A SERVICE (SAAS) ARCHITECTURAL MODEL FOR CLOUD BASED SECURITY USING HYBRID SYMMETRIC ALGORITHM

Protecting cloud data from security breaches, preventing and ensuring safe cloud data is concealed from unauthorized access or infiltration by unwanted users are all part of cloud infrastructure security. This proposed technique is based on ensuring data confidentiality by adding extra-layer of security from the client side, developing a framework that implements the AES 256-bit key and Fernet 128-bits algorithms, which encrypt and decrypt files via random algorithm selection during uploads and downloads. When a file is uploaded to the cloud, the decryption key is recorded in the local server's file log. The software use randomized algorithm selection to provide security to ensure that an attacker having a prior link cannot reset the user account since the attacker cannot guess the token. Furthermore, invalidating this token ensures that the link cannot be used more than once if it was previously logged anywhere. To propose and verify the efficiency of the model the results generated(in quantitative values) are frequency (monobit) testing, with a minimum bit size of 64, given the P-values derived from the above study (i.e., 0.8838, 0.6187, 0.3768, 0.2817, 0.5843, 0.4167). The findings reveal throughput for encryption of 0.91531 and for decryption of 0.4854, space complexity of 0.4854, and entropy of 7.942616667.This research work studies the design of a robust, adaptable, and non-deterministic SaaS application that can be secure for enterprises and subsequent research studies will be conducted in the development.

A review of enhanced image techniques using chaos encryption

Secured multimedia data has grown in importance over the last few decades to safeguard multimedia content from unwanted users. Generally speaking, a number of methods have been employed to hide important visual data from eavesdroppers, one of which is chaotic encryption. This review article will examine chaotic encryption methods currently in use, highlighting their benefits and drawbacks in terms of their applicability for picture security.

An Efficient Beamformer for Interference Suppression Using Rectangular Antenna Arrays

Over the past ten years, the development of fifth-generation cellular network technology opens the door to the deployment of huge sensors inside the Internet of Things (IoT), challenging the technologies of communications. IoT establishes wireless communication between numerous physical things to connect them over the Internet, as a result, these things may seriously pollute the environment for electromagnetic propagation. This paper proposes an efficient beamformer based on binary bat algorithm for interference suppression in wireless technology applications. The proposed beamformer utilizes the technique of controlling only the phase of excitation weights in uniform rectangular arrays. This beamformer can produce optimal patterns with minimal distortions in sidelobe regions while maintaining the main lobe and placing nulls in the direction of interfering signals. To demonstrate this ability, the proposed beamformer is evaluated through several scenarios and compared to a beamformer based on Binary Particle Swarm Optimization (BPSO). The results show that the proposed beamformer maintains the main lobe toward the desired user direction while imposing nulls in unwanted user directions (interferences) and that it surpassed BPSO-based beamformers in terms of convergence speed and interference suppression ability.

Security During Transmission Of Data Using Web Steganography

The enormous improvements in communications and related technologies, such as the Internet of Things (IoT) and its web-based and mobile applications, have changed our way of life. We are also noticing a trend in which internet-connected electronic devices are using technology more frequently and providing customers with services of a higher standard. However, there are several complications and issues that arise when sending and receiving information via the internet. The security, privacy, and preservation of sent information are the most critical of them all. The security of information has grown to be a significant problem with the expansion of data transfer across computer networks. There are numerous ways to safeguard data and prevent unwanted users from accessing it. Steganography and cryptography are two different data hiding and protection techniques. Steganography conceals communications within some other digital media. On the other side, cryptography obscures the message's content and makes it challenging for readers to decipher. To safeguard data, steganography can be combined with cryptographic methods. Combining steganography and cryptography for hidden data transmission is the best suggested method for protecting data transferred over the internet. A data carrier that is an image can be used for the transmission. With regard to capacity, security, and robustness for secure data transmission over an open channel, this combinational methodology will be sufficient. The purpose of this paper is to explain the steganographic security measures used to protect data while it is being transmitted across a network. Key words: Security, Transmission, Data, Web Steganography

Modified Apriori Based Data Sanitization for Cloud Data Security: An Optimization Assisted Model

This study proposes a new approach to cloud data security, with two distinct processes: proposed data sanitization and restoration. By hiding it from unwanted users and access, the data sanitization procedure ensures the protection of sensitive data stored in massive databases. In this case, the Modified Apriori approach is used to clean the data. In this scenario, the central goal is to generate a key, which is done using an optimization algorithm. Recovery or retrieval of cleaned data is a reversible process in data recovery. The optimization key for both sanitization and restoration will be discovered using the proposed MFUWOA. The optimal key for both restorations as well as sanitization will be determined using the proposed MFUWOA. While resolving the optimization challenge, the targets stated include the data retention ratio, hidden ratio, and level of alteration. Moreover, the adopted MFUWOA model for dataset 1 attains the best fitness value (∼0.2) to extant schemes including WOA (∼0.3), MFO (∼0.7), PRO (∼0.34), SSO (∼0.8), CMBO (∼0.4), and ALO (∼1.0), correspondingly.

Modified Lamport Merkle Digital Signature blockchain framework for authentication of internet of things healthcare data

AbstractMedical internet of things (IoT) includes various devices, sensor, machines, equipment which exchange data over wide network. Industry 5.0 and 5G technology have ramped mIoT data and cost‐effective sensors. There is sudden upsurge in the medical IoT for enhancing the medical care. Integration of cloud server for data storage and cloud computing has led to the emergence of time and cost‐effective management of medical resources and improved patient lifestyle. However, cloud data is always at risk of data leak and malicious attack by unwanted users for their personal gains and agenda. With the increase of data exchange in the medical field, there is an urgency of keeping all the transaction safe and secure. There is a growing malicious data attacks and vulnerability. Therefore, to overcome such situations, the proposed model is a step towards sustainable technology. Keeping the focus on cost effective data security, the present work has developed a framework of modified Lamport Merkle Digital Signature method for signature generation and verification. It makes use of central healthcare controller (CHC) which determine the root of generated signature along with verification and authentication. For verification, the validation hash public key with generate key is required to validate the signature. This led to the efficient, cost effective and faster security when compared to the existing methods.

Looking for Criminal Intents in JavaScript Obfuscated Code

The majority of websites incorporate JavaScript for client-side execution in a supposedly protected environment. Unfortunately, JavaScript has also proven to be a critical attack vector for both independent and state-sponsored groups of hackers. On the one hand, defenders need to analyze scripts to ensure that no threat is delivered and to respond to potential security incidents. On the other, attackers aim to obfuscate the source code in order to disorient the defenders or even to make code analysis practically impossible. Since code obfuscation may also be adopted by companies for legitimate intellectual-property protection, a dilemma remains on whether a script is harmless or malignant, if not criminal. To help analysts deal with such a dilemma, a methodology is proposed, called JACOB, which is based on five steps, namely: (1) source code parsing, (2) control flow graph recovery, (3) region identification, (4) code structuring, and (5) partial evaluation. These steps implement a sort of decompilation for control flow fattened code, which is progressively transformed into something that is close to the original JavaScript source, thereby making eventual code analysis possible. Most relevantly, JACOB has been successfully applied to uncover unwanted user tracking and fingerprinting in e-commerce websites operated by a well-known Chinese company.

Determining context of association rules by using machine learning

ABSTRACT Association rule mining is typically used to uncover the enthralling interdependencies between the set of variables and reveals the hidden pattern within the dataset. The associations are identified based on co-occurring variables with high frequencies. These associations can be positive (A→B) or negative (A→⌐B). The number of these association rules in larger databases are considerably higher which restricted the extraction of valuable insights from the dataset. Some rule pruning strategies are used to reduce the number of rules that can sometimes miss an important, or include an unimportant rule into the final rule set because of not considering the context of the rule. Context-based positive and negative association rule mining (CBPNARM) for the first time included context variable in the algorithms of association rule mining for selection/ de-selection of such rules. In CBPNARM, the selection of context variable and its range of values are done by the user/expert of the system which demands unwanted user interaction and may add some bias to the results. This paper proposes a method to automate the selection of context variable and selection of its value range. The context variable is chosen by using the diversity index and chi-square test, and the range of values for the context variable is set by using box plot analysis. The proposed method on top of it added conditional-probability increment ratio (CPIR) for further pruning uninteresting rules. Experiments show the system can select the context variable automatically and set the right range for the selected context variable. The performance of the proposed method is compared with CBPNARM and other state of the art methods.

MUTATION TESTING OF ACCESS CONTROL POLICIES

One of the most important and integral components of modern computer security are access control systems. The objective of an access control system (ACS) is often described in terms of protecting system resources against inappropriate or unwanted user access. However, a large degree of sharing can interfere with the protection of resources, so a sufficiently detailed AC policy should allow selective exchange of information when, in its absence, sharing can be considered too risky in general. Erroneous configurations, faulty policies, as well as flaws in the implementation of software can lead to global insecurity. Identifying the differences between policy specifications and their intended functions is crucial because the correct implementation and enforcement of the policies of a particular application is based on the premise that the specifications of this policy are correct. As a result of the policy, the specifications presented by the models must undergo rigorous validation and legalization through systematic checks and tests to ensure that the specifications of the policies really correspond to the wishes of the creators. Verifying that access control policies and models are consistent is not a trivial and critical task. And one of the important aspects of such a check is a formal check for inconsistency and incompleteness of the model, and the security requirements of the policy, because the access control model and its implementation do not necessarily express policies that can also be hidden, embedded by mixing with direct access restrictions or another access control model.

Byteless CTS for passive load balancing in 802.11 networks

Load balancing in 802.11 networks is aimed at distributing traffics among access points (APs) to avoid overloaded access. Existing works may be classified into passive and active algorithms depending on the Ethernet changes in the user side. Since Ethernet 802.11 has been installed in millions of computers, changes in these user premises are not preferred. Software intervention on manufactured access points should also be kept as minimum as possible. Therefore, this work proposes a passive load balancing algorithm that transmitting byteless clear to send (CTS) signal in response to a request to send (RTS) sent by unwanted users when AP experiences overloaded. This method causes excessive users will passively be encouraged to find an alternative AP. There is no Ethernet change on the user side. Minor improvement is required in AP software to determine whether overload or not, and to decide which node(s) receiving byteless CTS. Evaluations show that average throughput to all connected users decreases as unwanted users failed to transmit. However, the average throughput to prioritized users increases significantly.

Detach CTS for active load balancing in 802.11 networks

Transmit power reduction is the most common algorithm to achieve load balancing in either 802.11 or cellular networks. The method does not require changes in the user terminal; however, the method requires access point (AP) to have a multi-level front-end power amplifier so that transmission power can be adjusted accordingly. Transmit power reduction also removes the quality of services that may be applied to some users. Such flaws may contradict the value-added services offered by certain access points or cellular base stations. This paper proposes a simple method to avoid power reduction in 802.11 networks. Load balancing is achieved by ordering disconnection for unwanted users by sending a detach clear to send (CTS) signal in response to a request to transmit (CTS) sent by users. Although it violates the standard Ethernet algorithm, it may be applicable in the future standard. By receiving detect CTS, the user is simply disconnected to existing AP and finding the alternative AP. Simulation evaluations show that the method successfully maintains the average throughput as well as maintains the possible prioritized users.

A Random Walk Approach for Avoiding Unwanted Users in Competitive Social Network

How to detect influential customers to broadcast advertisements to the maximum range is a key issue in effective viral marketing. If multiple companies sell the same product in viral marketing campaigns, there was competition between them. There may exist some unwanted users who hold hostile opinions, and these users may have a negative effect upon receiving promotional information. The company does not want the advertising information to reach such unwanted users over a period of time. In such competitive advertising, how to propagate the positive influence of its product and avoid it reaching the unwanted users of competitors in the limited time is a critical problem for business product promotion. Motivated by the phenomenon, we study the influence maximization problem with limited unwanted users (IML) in the independent cascade (IC) model. To accelerate the process of the influence propagation simulation, we present a path sampling approach based on the random walk to simulate the process of influence propagation. To avoid the unwanted users, only the influences on the paths reaching the wanted users are calculated at each time step, and the influences reaching the unwanted users are ignored.To reduce the computation time, the paths of the random walk will be recorded to avoid repeated random walks in the subsequent seed selection. To find the optimal influential customers, we employ a greedy scheme to select the top-k most influential nodes as seed nodes. Experimental results over the real-world datasets show that the algorithm we presented can get wider effective influence spreading than other algorithms.

Performance Analysis of LMS, RLS, CMA Algorithms for Beamforming in Smart Antenna Systems

Smart antenna systems strengthen wireless mobile communication, with enhancement over conventional systems, by projecting the signal power in narrow beams towards the desired users and suppressing the signal power towards unwanted users or interferers. Different DOA estimation and beamforming algorithms play crucial role in smart antenna system. In beamforming algorithms, using different techniques complex weights are calculated and applied to the signals from the smart antenna array elements to enhance signals of interest and suppress signals not of interest. In this article Least Mean Square(LMS) technique, Recursive Least Square(RLS)technique and Constant Modulus (CMA)technique adaptive beamforming algorithms are implemented, analyzed and compared using MATLAB simulations to help users to choose amongst them as per the their need, ease and suitability.

Authentication Techniques and Methodologies used in Wireless Body Area Networks

Abstract Wireless body area network (WBAN), got the IEEE standard in February 2012, is the most significant and highly focused research area among researchers, academicians, and practitioners; applied to the patient's body for monitoring various physiological parameters and then the sensitive measured data is passed to the concerned medical doctor or server for taking the necessary actions. In order to pass the sensitive data securely, authentication is the first step towards it. The authentication schemes help network to reduce unwanted users and prevent from deceptions effectively since the authentication process identifies the user's identity that he or she claims to be. In connection to the safe communication, authentication is one of the key aspects. So, it is important to design novel authentication schemes; those offer secure authentication and prevent various security attacks in WBANs. A lot of methods and techniques have been proposed for authentication in WBANs. In this survey paper for improving the authentication process in WBANs, an overview of WBAN and their characteristics, various authentication types and classification of authentication schemes has been done. It further provides a complete comparison of different authentication schemes and highlights their pros, cons, limitations, challenges, performance evaluation and their robustness against different security attacks which open doors of new opportunities. This finally ends with the most significant open issues, future research directions and draw interesting conclusions.

An algorithm for influence maximization in competitive social networks with unwanted users

With the rapid development of online social networks, the problem of influence maximization (IM) has attracted tremendous attention motivated by widespread application scenarios. However, there is less research focusing on the information spreading with the existence of some unwanted users. Such problem has a wide range of applications since there always exist conflicts of interest between competing businesses. In this paper, we formally define the problem of influence maximization with limited unwanted users (IML) under the independent cascade model. In order to avoid the time-consuming process of simulating the propagation in the traditional method of influence maximization, we propose a propagation path based strategy to compute the activation probabilities between the node pairs. Based on the activation probability, we define a propagation increment function to avoid simulating the influence spreading process on the candidate seed nodes. To select the optimal seed set, we present a greedy algorithm to sequentially select the nodes which can maximize the influence increment to join the seed set. Experimental results in real social networks have shown that the algorithm proposed not only outperforms the existing methods but also consumes much less computation time.

A Provably Secure Group Key Agreement Scheme With Privacy Preservation for Online Social Networks Using Extended Chaotic Maps

With the rapid growth in the popularity of mobile devices and development of network technologies, various online social networking applications have grown in popularity. While these social networking sites provide benefits in terms of enhanced connectivity with people all around the world, they can also pose security threats and raise privacy concerns due to their vulnerability to be exploited by malicious agents. Such social networking sites where members can transmit or share their social information via public channels increase the risk that these information may be exposed to unwanted users. Therefore, it is important to enhance the security of these online social network services using group session keys. These group session keys also need to be updated in case a new member joins the group or an old member leaves the social group. To enhance the trustworthiness of the online social network systems, in this paper, we propose a secure chaotic maps-based group key agreement scheme. In this proposed scheme, we also provide member anonymity to ensure the privacy of the communication between the social networking platform and the members. The proposed solution does not rely on a centralized online key center or a trusted group chairman, thus ensuring fairness. We integrate the mechanisms of message encryption and member verification into the scheme to allow the members to anonymously interact with the services of the online social network. We verify the formal security of the proposed solution using the widely accepted BAN logic analysis and simulation verification with Proverif to prove that our scheme is secure against both passive and active attacks. We also demonstrate that the proposed scheme is efficient in its implementation and achieves greater functionality criteria in comparison with similar existing proposals.

Elman Recurrent Neural Network Application in Adaptive Beamforming of Smart Antenna System

In this paper an artificial Elman Recurrent Neural Network (ERNN) is used for smart antenna adaptive beamforming. Neural network is used to calculate the optimum weights of uniform linear array antenna that steer the radiation pattern of the antenna by directing multiple narrow beams toward the desired users and make nulling in the direction of unwanted users. Two different supervised training algorithms are used to train the ERNN , they are Levenberg Marquardt (LM) algorithm and Resilient Backpropagation (Rprop) algorithm. Uniform linear array is used with five element and the spacing between element equal to half wavelength .The results of ERNN training using LM and Rprop showed that the performance of Neural Network (NN) trained by LM training algorithm is better than Rprop training algorithm ,since it consider the fastest backpropagation training algorithm but it requires more memory than other algorithms.

Economics and Enviromental Resources: Review

We review the component elements of environmental resources in order to provide insights into their economic characteristics and properties. Environmental resources are the goods and services provided by the natural environment and are constituted into three categories: atmosphere; water; and land and soil. The economic literature emphasizes two points in regard to the economic characteristics of environmental resources. First, many environmental goods are renewable resources and have features of public goods-accessible to all in the community at no charge, so that excluding unwanted users is difficult, which lends them to over-exploitation to the point of extinction in many instances. Second, environmental resources constitute a kind of capital and so makes measurable contribution to output similar to the role played by physical and human capital, and so should be accounted for, invested in, and exploited efficiently.