With the development of Internet communications, the security of message sending on the Internet has become very important. This article proposes a new adaptive data hiding method with a large data-embedding capacity for gray-scale images to raise the security of sending a message between sender and receiver in networks. At first, the image is divided into some blocks consisting of two consecutive pixels. If the values of both pixels are small, fewer secret bits will be embedded within the two pixels, otherwise, the difference value of two pixels is calculated, and according to the obtained difference value, the method will estimate the number of embedding bits into LSBs of two pixels. This number is adaptive and depends on the range to which the difference value belongs. A readjusting phase is presented to keep the difference of value pixels in the same range before and after embedding. Experimental results show that our method has increased the capacity of embedding bits in comparison with the several other methods.
1 January 2017 in Turkish Journal of Electrical Engineering and Computer Sciences
This paper presents an approach for optimizing the oil recovery factor by determining initial oil production rates. The proposed method utilizes the Q-learning method and the reservoir simulator (Eclipse 100) to achieve the desired objective. The system identifies the most efficient initial oil production rates by conducting a sufficient number of iterations for various initial oil production rates. To validate the effectiveness of the proposed approach, a case study is conducted using a numerical reservoir model (SPE9) with simplified configurations of two producer wells and one injection well. The simulation results highlight the capabilities of the Q-learning method in assisting reservoir engineers by enhancing the recommended initial rates.
8 February 2023 in IEEE Open Journal of Vehicular Technology
In today's world, everything is connected via the Internet. Smart cities are one application of the Internet of Things (IoT) that is aimed at making city management more efficient and effective. However, IoT devices within a smart city may collect sensitive information. Protecting sensitive information requires maintaining privacy. Existing smart city solutions have been shown not to offer effective privacy protection. We propose a novel continuous method called Differential Privacy-Preserving Smart City (DPSmartCity). When the IoT device produces sensitive data, it applies differential privacy techniques as a privacy-preserving method that uses Laplace distributions or exponential distributions. The controller receives the perturbed data and forwards it to the SDN. SDN controllers eventually send the data to the cloud for further analysis. Accordingly, if the data is not sensitive, it is directly uploaded to the cloud. In this way, DPSmartCity provides a dynamic environment from the point of view of privacy preservation. As a result, adversaries are unable to easily compromise the privacy of the devices. The solution incurs at most 10-18% overhead on IoT devices. Our solution can therefore be used for IoT devices that are capable of handling this overhead.
Purpose: Robot localization in dynamic, cluttered environments is a challenging problem because it is impractical to have enough knowledge to be able to accurately model the robot’s environment in such a manner. This study aims to develop a novel probabilistic method equipped with function approximation techniques which is able to appropriately model the data distribution in Markov localization by using the maximum statistical power, thereby making a sensibly accurate estimation of robot’s pose in extremely dynamic, cluttered indoors environments. Design/methodology/approach: The parameter vector of the statistical model is in the form of positions of easily detectable artificial landmarks in omnidirectional images. First, using probabilistic principal component analysis, the most likely set of parameters of the environmental model are extracted from the sensor data set consisting of missing values. Next, we use these parameters to approximate a probability density function, using support vector regression that is able to calculate the robot’s pose vector in each state of the Markov localization. At the end, using this density function, a good approximation of conditional density associated with the observation model is made which leads to a sensibly accurate estimation of robot’s pose in extremely dynamic, cluttered indoors environment. Findings: The authors validate their method in an indoor office environment with 34 unique artificial landmarks. Further, they show that the accuracy remains high, even when they significantly increase the dynamics of the environment. They also show that compared to those appearance-based localization methods that rely on image pixels, the proposed localization strategy is superior in terms of accuracy and speed of convergence to a global minima. Originality/value: By using easily detectable, and rotation, scale invariant artificial landmarks and the maximum statistical power which is provided through the concept of missing data, the authors have succeeded in determining precise pose updates without requiring too many computational resources to analyze the omnidirectional images. In addition, the proposed approach significantly reduces the risk of getting stuck in a local minimum by eliminating the possibility of having similar states.
Network‐on‐Chip (NoC) is a key component in chip multiprocessors (CMPs) as it supports communication between many cores. NoC is a network‐based communication subsystem on an integrated circuit, most typically between modules in a system on a chip (SoC). Designing a reliable NoC against failures that can prevent failure using some measures or preventing error or system failure while failure happens and proper performance became a significant concern. For a reliable design against failures, first, the system should be analysed to discover the critical points. Hence, in this research, it is tried first to investigate the scale of fault tolerance effect on the mechanism in the router on the network by injecting simulated errors, and then these errors are prevented. As the major novelty, the authors implemented a router on a synchronised network and calculated the network buffering fault tolerance by injecting error in the buffer. Specifically, a new method for improving fault tolerance is proposed, which uses the existing resources efficiently. So, it does not impose any overhead on hardware and improves the error tolerance scale. The authors also evaluate it from different perspectives to show its superior performance.