In recent years, deep learning techniques have achieved tremendous successes in natural language processing, speech recognition and image processing. Collaborative filtering(CF) recommendation is one of widely used methods and has significant effects in implementing the new recommendation function, but it also has limitations in dealing with the problem of poor scalability, cold start and data sparsity, etc. Combining the traditional recommendation algorithm with the deep learning model has brought great opportunity for the construction of a new recommender system. In this paper, we propose a novel collaborative recommendation model based on auxiliary stacked denoising autoencoder(ASDAE), the model learns effective the preferences of users from auxiliary information. Firstly, we integrate auxiliary information with rating information. Then, we design a stacked denoising autoencoder based collaborative recommendation model to learn the preferences of users from auxiliary information and rating information. Finally, we conduct comprehensive experiments on three real datasets to compare our proposed model with state-of-the-art methods. Experimental results demonstrate that our proposed model is superior to other recommendation methods.

This paper proposes a novel data prioritization and transmission mechanism to minimize the number of packets transmitted and reduce network overload using the constrained application protocol (CoAP) in resource-constrained networks. The proposed scheme adopts four classification parameters to classify and prioritize data from a sensor. With the packet prioritization scheme, the sensed data having the lowest priority is only delivered using the proposed keep-alive message notification to decrease the number of packets transmitted. The performance evaluation demonstrates that the proposed scheme shows the improvement of resource utilization in energy consumption, and bandwidth usage compared with the existing CoAP methods. Furthermore, the proposed scheme supports quality-of-service (QoS) per packet by differentiating transmission delays regarding priorities.

SmartThings is one of the most popular open platforms for home automation IoT solutions that allows users to create their own applications called SmartApps for personal use or for public distribution. The nature of openness demands high standards on the quality of SmartApps, but there have been few studies that have evaluated this thoroughly yet. As part of software quality practice, code reviews are responsible for detecting violations of coding standards and ensuring that best practices are followed. The purpose of this research is to propose systematically designed quality metrics under the well-known Goal/Question/Metric methodology and to evaluate the quality of SmartApps through automatic code reviews using a static analysis. We first organize our static analysis rules by following the GQM methodology, and then we apply the rules to real-world SmartApps to analyze and evaluate them. A study of 105 officially published and 74 community-created real-world SmartApps found a high ratio of violations in both types of SmartApps, and of all violations, security violations were most common. Our static analysis tool can effectively inspect reliability, maintainability, and security violations. The results of the automatic code review indicate the common violations among SmartApps.

Human activity recognition is widely used in smart homes, health care and indoor monitor. Traditional approaches all need hardware installation or wearable sensors, which incurs additional costs and imposes many restrictions on usage. Therefore, this paper presents a novel device-free activities recognition system based on the advanced wireless technologies. The fine-grained information channel state information (CSI) in the wireless channel is employed as the indicator of human activities. To improve accuracy, both amplitude and phase information of CSI are extracted and shaped into feature vectors for activities recognition. In addition, we discuss the classification accuracy of different features and select the most stable features for feature matrix. Our experimental evaluation in two laboratories of different size demonstrates that the proposed scheme can achieve an average accuracy over 95% and 90% in different scenarios.

In third world countries like Pakistan, the production of electricity has been quickly reduced in past years due to rely on the fossil fuel. According to a survey conducted in 2017, the overall electrical energy capacity was 22,797MW, since the electrical grids have gone too old, therefore the efficiency of grids, goes down to nearly 17000MW. Significant addition of fossil fuel, hydro and nuclear is 64.2%, 29% and 5.8% respectively in the total electricity production in Pakistan. In 2018, the demand crossed 20,223MW, compared to peak generation of 15,400 to 15,700MW as by the Ministry of Water and Power. Country faces a deficit of almost 4000MW to 5000MW for the duration of 2019 hot summer term. Focus on one aspect considering Demand Side Management (DSM) cannot oversea the reduction of gap between power demand and customer supply, which eventually leads to the issue of load shedding. Hence, a scheduling scheme is proposed in this paper called RPSMDSM that is based on selection of those appliances that need to be only Turned-On, on priority during peak hours consuming minimum energy. The Home Energy Management (HEM) system is integrated between consumer and utility and bidirectional flow is presented in the scheme. During peak hours of electricity, the RPSMDSM is capable to persuade less power consumption and accomplish productivity in load management. Simulations show that RPSMDSM scheme helps in scheduling the electricity loads from peak price to off-peak price hours. As a result, minimization in electricity cost as well as (Peak-to-Average Ratio) PAR are accomplished with sensible waiting time.

This paper studies a single-user Mobile Edge Computing (MEC) system where mobile device (MD) includes an application consisting of multiple computation components or tasks with dependencies. MD can offload part of each computation-intensive latency-sensitive task to the AP integrated with MEC server. In order to accomplish the application faultlessly, we calculate out the optimal task offloading strategy in a time-division manner for a predetermined execution order under the constraints of limited computation and communication resources. The problem is formulated as an optimization problem that can minimize the energy consumption of mobile device while satisfying the constraints of computation tasks and mobile device resources. The optimization problem is equivalently transformed into solving a nonlinear equation with a linear inequality constraint by leveraging the Lagrange Multiplier method. And the proposed dual Bi-Section Search algorithm Bi-JOTD can efficiently solve the nonlinear equation. In the outer Bi-Section Search, the proposed algorithm searches for the optimal Lagrangian multiplier variable between the lower and upper boundaries. The inner Bi-Section Search achieves the Lagrangian multiplier vector corresponding to a given variable receiving from the outer layer. Numerical results demonstrate that the proposed algorithm has significant performance improvement than other baselines. The novel scheme not only reduces the difficulty of problem solving, but also obtains less energy consumption and better performance.

Significant detection of video can more rationally allocate computing resources and reduce the amount of computation to improve accuracy. Deep learning can extract the edge features of the image, providing technical support for video saliency. This paper proposes a new detection method. We combine the Convolutional Neural Network (CNN) and the Deep Bidirectional LSTM Network (DB-LSTM) to learn the spatio-temporal features by exploring the object motion information and object motion information to generate video. A continuous frame of significant images. We also analyzed the sample database and found that human attention and significant conversion are time-dependent, so we also considered the significance detection of video cross-frame. Finally, experiments show that our method is superior to other advanced methods.

This paper presents a detailed subjective quality assessment for the ultra-high definition (UHD) videos having frame rates of 30fps and 60 fps. The subjective assessment is based on the ITU-R BT-500 recommendations, where double stimulus continuous quality scale (DSCQS-type II) test is performed for the evaluation of the perceived quality of the user's in terms of differential mean opinion score (DMOS). Encoding of the UHD videos by opting encoders i.e. H.264/AVC, H.265/HEVC, and VP9 at five different quantization parameter (QP) levels is done to investigate the perceived user's quality of experience (QoE) given as DMOS. Moreover, the encoding efficiency as the encoding time for each encoder and qualitative performance by employing full-reference (FR) quality metrics are presented in this work.

Considering that high-dose X-ray radiation during CT scans may bring potential risks to patients, in the medical imaging industry there has been increasing emphasis on low-dose CT. Due to complex statistical characteristics of noise found in low-dose CT images, many traditional methods are difficult to preserve structural details effectively while suppressing noise and artifacts. Inspired by the deep learning techniques, we propose a densely connected residual network (DCRN) for low-dose CT image noise cancelation, which combines the ideas of dense connection with residual learning. On one hand, dense connection maximizes information flow between layers in the network, which is beneficial to maintain structural details when denoising images. On the other hand, residual learning paired with batch normalization would allow for decreased training speed and better noise reduction performance in images. The experiments are performed on the 100 CT images selected from a public medical dataset-TCIA(The Cancer Imaging Archive). Compared with the other three competitive denoising algorithms, both subjective visual effect and objective evaluation indexes which include PSNR, RMSE, MAE and SSIM show that the proposed network can improve LDCT images quality more effectively while maintaining a low computational cost. In the objective evaluation indexes, the highest PSNR 33.67, RMSE 5.659, MAE 1.965 and SSIM 0.9434 are achieved by the proposed method. Especially for RMSE, compare with the best performing algorithm in the comparison algorithms, the proposed network increases it by 7 percentage points.

For compressed sensing (CS) applications, it is significant to construct deterministic measurement matrices with good practical features, including good sensing performance, low memory cost, low computational complexity and easy hardware implementation. In this paper, a deterministic construction method of bipolar measurement matrices is presented based on binary sequence family (BSF). This method is of interest to be applied for sparse signal restore and image block CS. Coherence is an important tool to describe and compare the performance of various sensing matrices. Lower coherence implies higher reconstruction accuracy. The coherence of proposed measurement matrices is analyzed and derived to be smaller than the corresponding Gaussian and Bernoulli random matrices. Simulation experiments show that the proposed matrices outperform the corresponding Gaussian, Bernoulli, binary and chaotic bipolar matrices in reconstruction accuracy. Meanwhile, the proposed matrices can reduce the reconstruction time compared with their Gaussian counterpart. Moreover, the proposed matrices are very efficient for sensing performance, memory, complexity and hardware realization, which is beneficial to practical CS.

In wireless sensor networks, adversaries may physically capture sensor nodes on the fields, and use them to launch false positive attacks (FPAs). FPAs could be conducted by injecting forged or old sensing reports, which would represent non-existent events on the fields, with the goal of disorientating the base stations and/or reducing the limited energy resources of sensor nodes on the fields. Researchers have proposed various mitigation methods against FPAs, including the statistical en-route filtering scheme (SEF). Most of these methods are based on key pre-distribution schemes and can efficiently filter injected false reports out at relay nodes through the verification of in-transit reports using the pre-distributed keys. However, their filtering power may decrease as time goes by since adversaries would attempt to capture additional nodes as many as possible. In this paper, we propose an adaptive key distribution method that could maintain the security power of SEF in WSNs under such circumstances. The proposed method makes, if necessary, BS update or re-distribute keys, which are used to endorse and verify reports, with the consideration of the filtering power and energy efficiency. Our experimental results show that the proposed method is more effective, compared to SEF, against FPAs in terms of security level and energy saving.

Recently, numerous certificateless encryption (CLE) schemes have been introduced. The security proofs of most schemes are given under the random oracle model (ROM). In the standard model, the adversary is able to calculate the hash function instead of asking the challenger. Currently, there is only one scheme that was proved to be secure in SM. In this paper, we constructed a new CLE scheme and gave the security proofs in SM. In the new scheme, the size of the storage space required by the system is constant. The computation cost is lower than other CLE schemes due to it needs only two pairing operations.

Data hiding technology hides secret information into the carrier, so that when the carrier is transmitted over network, it will not attract any malicious attention. Using data compression, it is possible to reduce the data size into a small compressed code, which can effectively reduce the time when transmitting compressed code on the network. In this paper, the main objective is to effectively combine these two technologies. We designed a data hiding scheme based on two techniques which are turtle-shell information hiding scheme and absolute moment block truncation coding. The experimental results showed that the proposed scheme provided higher embedding capacity and better image quality than other hiding schemes which were based on absolute moment block truncation coding.

The fundamental reason why most SQL injection detection methods are difficult to use in practice is the low reusability of the implementation code. This paper presents a reusable SQL injection detection method for Java Web applications based on AOP (Aspect-Oriented Programming) and dynamic taint analysis, which encapsulates the dynamic taint analysis processes into different aspects and establishes aspect library to realize the large-grained reuse of the code for detecting SQL injection attacks. A metamodel of aspect library is proposed, and a management tool for the aspect library is implemented. Experiments show that this method can effectively detect 7 known types of SQL injection attack such as tautologies, logically incorrect queries, union query, piggy-backed queries, stored procedures, inference query, alternate encodings and so on, and support the large-grained reuse of the code for detecting SQL injection attacks.

Botnets have become one of the most significant threats to Internet-connected smartphones. A botnet is a combination of infected devices communicating through a command server under the control of botmaster for malicious purposes. Nowadays, the number and variety of botnets attacks have increased drastically, especially on the Android platform. Severe network disruptions through massive coordinated attacks result in large financial and ethical losses. The increase in the number of botnet attacks brings the challenges for detection of harmful software. This study proposes a smart framework for mobile botnet detection using static analysis. This technique combines permissions, activities, broadcast receivers, background services, API and uses the machine-learning algorithm to detect mobile botnets applications. The prototype was implemented and used to validate the performance, accuracy, and scalability of the proposed framework by evaluating 3000 android applications. The obtained results show the proposed framework obtained 98.20% accuracy with a low 0.1140 false-positive rate.

Due to the explosive growth of multimedia speech data, how to protect the privacy of speech data and how to efficiently retrieve speech data have become a hot spot for researchers in recent years. In this paper, we proposed an encrypted speech retrieval scheme based on long short-term memory (LSTM) neural network and deep hashing. This scheme not only achieves efficient retrieval of massive speech in cloud environment, but also effectively avoids the risk of sensitive information leakage. Firstly, a novel speech encryption algorithm based on 4D quadratic autonomous hyperchaotic system is proposed to realize the privacy and security of speech data in the cloud. Secondly, the integrated LSTM network model and deep hashing algorithm are used to extract high-level features of speech data. It is used to solve the high dimensional and temporality problems of speech data, and increase the retrieval efficiency and retrieval accuracy of the proposed scheme. Finally, the normalized Hamming distance algorithm is used to achieve matching. Compared with the existing algorithms, the proposed scheme has good discrimination and robustness and it has high recall, precision and retrieval efficiency under various content preserving operations. Meanwhile, the proposed speech encryption algorithm has high key space and can effectively resist exhaustive attacks.

In this paper, an adaptive sparse singular value decomposition (ASSVD) algorithm is proposed to estimate the signal matrix when only one data matrix is observed and there is high dimensional white noise, in which we assume that the signal matrix is low-rank and has sparse singular vectors, i.e. it is a simultaneously low-rank and sparse matrix. It is a structured matrix since the non-zero entries are confined on some small blocks. The proposed algorithm estimates the singular values and vectors separable by exploring the structure of singular vectors, in which the recent developments in Random Matrix Theory known as anisotropic Marchenko-Pastur law are used. And then we prove that when the signal is strong in the sense that the signal to noise ratio is above some threshold, our estimator is consistent and outperforms over many state-of-the-art algorithms. Moreover, our estimator is adaptive to the data set and does not require the variance of the noise to be known or estimated. Numerical simulations indicate that ASSVD still works well when the signal matrix is not very sparse.

In this paper, we analyze the secrecy performance of single-input multiple-output (SIMO) relay systems over κ-μ shadowed fading channels. Based on considering relay model employing decode-and-forward (DF) protocol, two security evaluation metrics, namely, secure outage probability (SOP) and probability of strictly positive secrecy capacity (SPSC) are studied, for which closed-form analytical expressions are derived. In addition, Monte Carlo results prove the validity of the theoretical derivation. The simulation results confirm that the factors that enhance the security include large ratio of (μ_D, μ_E), (m_D, m_E), (L_D, L_E) and small ratio of (k_D, k_E) under the high signal-to-noise ratio regime.

Flying ad-hoc networks (FANETs) is a vibrant research area nowadays. This type of network ranges from various military and civilian applications. FANET is formed by micro and macro UAVs. Among many other problems, there are two main issues in FANET. Limited energy and high mobility of FANET nodes effect the flight time and routing directly. Clustering is a remedy to handle these types of problems. In this paper, an efficient clustering technique is proposed to handle routing and energy problems. Transmission range of FANET nodes is dynamically tuned accordingly as per their operational requirement. By optimizing the transmission range packet loss ratio (PLR) is minimized and link quality is improved which leads towards reduced energy consumption. To elect optimal cluster heads (CHs) based on their fitness we use k-means. Selection of optimal CHs reduce the routing overhead and improves energy consumption. Our proposed scheme outclasses the existing state-of-the-art techniques, ACO based CACONET and PSO based CLPSO, in terms of energy consumption and cluster building time.

This paper investigates the energy efficiency of energy harvesting (EH) bidirectional cooperative sensor networks, in which the considered system model enables the uplink information transmission from the sensor (SN) to access point (AP) and the energy supply for the amplify-and-forward (AF) relay and SN using power-splitting (PS) or time-switching (TS) protocol. Considering the minimum EH activation constraint and quality of service (QoS) requirement, energy efficiency is maximized by jointly optimizing the resource division ratio and transmission power. To cope with the non-convexity of the optimizations, we propose the low complexity iterative algorithm based on fractional programming and alternative search method (FAS). The key idea of the proposed algorithm first transforms the objective function into the parameterized polynomial subtractive form. Then we decompose the optimization into two convex sub-problems, which can be solved by conventional convex programming. Simulation results validate that the proposed schemes have better output performance and the iterative algorithm has a fast convergence rate.

The growing demand to make wireless data services 5G compatible has necessitated the development of an energy-efficient approach for an effective new wireless environment. In this paper, we first propose a cognitive sensor node (CSN) based game theory for deriving energy via a primary user-transmitted radio frequency signal. Cognitive users' time was segmented into three phases based on a time switching protocol: energy harvest, spectrum sensing and data transmission. The proposed model chooses the optimal energy-harvesting phase as the effected factor. We further propose a distributed energy-harvesting model as a utility function via pricing techniques. The model is a non-cooperative game where players can increase their net benefit in a selfish manner. Here, the price is described as a function pertaining to transmit power, which proves that the proposed energy harvest game includes Nash Equilibrium and is also unique. The best response algorithm is used to achieve the green connection between players. As a result, the results obtained from the proposed model and algorithm show the advantages as well as the effectiveness of the proposed study. Moreover, energy consumption was reduced significantly (12%) compared to the benchmark algorithm because the proposed algorithm succeeded in delivering energy in micro which is much better compared to previous studies. Considering the reduction and improvement in power consumption, we could say the proposed model is suitable for the next wireless environment represented in 5G.

The emergence of Software Defined Networking (SDN) overcomes the limitations of traditional networking architectures. There are some advantages in SDN which are centralized global network view, programmability, and separation of the data plane and control plane. Due to the limitation of data plane storage capacity in SDN, it is necessary to process the redundancy rules of switch. In this paper, we propose a method for active detection and processing of redundant rules. We use the result generated by the customized probe package to detect redundant rules. And by checking the forwarding behavior of probe packets in the data plane, the redundancy rules are further processed. Furthermore, in order to quickly check the dynamic networks, we propose an incremental algorithms for rapidly evolve the network strategies. We conduct simulation experiments on Matlab to verify the feasibility of the algorithm. The influence of some parameters on the result are discussed.