Edge Computing is one of the radically evolving systems through generations as it is able to effectively meet the data saving standards of consumers, providers and the workers. Requisition for Edge Computing based items have been increasing tremendously. Apart from the advantages it holds, there remain lots of objections and restrictions, which hinders it from accomplishing the need of consumers all around the world. Some of the limitations are constraints on computing and hardware, functions and accessibility, remote administration and connectivity. There is also a backlog in security due to its inability to create a trust between devices involved in encryption and decryption. This is because security of data greatly depends upon faster encryption and decryption in order to transfer it. In addition, its devices are considerably exposed to side channel attacks, including Power Analysis attacks that are capable of overturning the process. Constrained space and the ability of it is one of the most challenging tasks. To prevail over from this issue we are proposing a Cryptographic Lightweight Encryption Algorithm with Dimensionality Reduction in Edge Computing. The t-Distributed Stochastic Neighbor Embedding is one of the efficient dimensionality reduction technique that greatly decreases the size of the non-linear data. The three dimensional image data obtained from the system, which are connected with it, are dimensionally reduced, and then lightweight encryption algorithm is employed. Hence, the security backlog can be solved effectively using this method. 相似文献
Discretization of continuous time autoregressive (AR) processes driven by a Brownian motion and embedding of discrete time AR sequences driven by a Gaussian white noise are classical issues. The article aims at establishing and using such discretization and embedding formulae between extended AR continuous time processes and discrete time sequences. The continuous-time processes are driven by either Brownian or jump processes, and may have random coefficients depending on time; Lévy-driven processes are also considered. The innovation of the discrete time processes may be of many types – including Gaussian. In one way, observing the continuous time AR process at discrete times leads the AR dynamics of the discretized process to be characterized. The other way round, AR sequences can be embedded, in the almost sure sense, into continuous time AR processes with the same dynamics. Illustration is provided through many examples and simulation. 相似文献
Heterogeneous information networks, which consist of multi-typed vertices representing objects and multi-typed edges representing relations between objects, are ubiquitous in the real world. In this paper, we study the problem of entity matching for heterogeneous information networks based on distributed network embedding and multi-layer perceptron with a highway network, and we propose a new method named DEM short for Deep Entity Matching. In contrast to the traditional entity matching methods, DEM utilizes the multi-layer perceptron with a highway network to explore the hidden relations to improve the performance of matching. Importantly, we incorporate DEM with the network embedding methodology, enabling highly efficient computing in a vectorized manner. DEM’s generic modeling of both the network structure and the entity attributes enables it to model various heterogeneous information networks flexibly. To illustrate its functionality, we apply the DEM algorithm to two real-world entity matching applications: user linkage under the social network analysis scenario that predicts the same or matched users in different social platforms and record linkage that predicts the same or matched records in different citation networks. Extensive experiments on real-world datasets demonstrate DEM’s effectiveness and rationality.
ABSTRACTIn recent years, information security over the internet has gained enormous immersion due to a technological escalation in communication via digital media. Nowadays, videos are the most common form of media over the internet, and they have gained the attention of video steganography research community for the security of the communication. This paper implemented video steganography using a widely-known transform technique, discrete wavelet transform (DWT) which consists of different orthogonal and biorthogonal filters used for the decomposition of a frame/image. The aim of this paper is to provide a comparative evaluation for orthogonal and biorthogonal DWT filters with different matrices such as MSE, PSNR. The performance of the different filters has been evaluated both quantitatively and qualitatively to investigate the best among them. Also, the best of orthogonal and biorthogonal filters have been further evaluated with other metrics such as SSIM, BER and histogram analysis. Further, the embedding algorithm has been compared with the existing video steganography techniques. The experimental results illustrate that bior 6.8 (biorthogonal filter) outperforms the other orthogonal and biorthogonal filters in terms of visual distortion. 相似文献