Search

Providing a structured approach for complex product development (PD) is a challenging issue that necessitates utilizing sophisticated modeling tools and analysis techniques. One effective approach for optimizing the complex engineering system development is the cross application of modularization and sequencing analyses on the design structure matrix (DSM), which leads to a cost-effective and time-efficient PD process. In this regard, the current study presents an application-specific method for the simultaneous implementation of modularization and sequencing analyses on DSMs to find the most independent and excluded modules with the minimum feedback loops among them. To this end, we first formulate the total feedback length among the modules by introducing two new modules’ feedback criteria. Second, we propose a novel objective function combining these feedback criteria with the modularity index metric to simultaneously fulfill the sequencing and modularization goals. This objective function makes the proposed method application specific in the sense that the expert is able to adjust the importance weight of each criterion based on the project's characteristics. Third, an efficient metaheuristic algorithm named discrete particle swarm optimization simulated annealing (DPSOSA) is developed to find the optimal solution by minimizing the introduced objective function. Eventually, to evaluate the DPSOSA performance in different applications, we conduct comprehensive experiments on a total of 21 well-known real-world DSMs. The obtained results demonstrate the superiority of the proposed method over previous approaches proving its effectiveness in each of modularization, sequencing, and modularization-sequencing experiments.

In this work, we consider transferring the structure information from large networks to compact ones for dense prediction tasks in computer vision. Previous knowledge distillation strategies used for dense prediction tasks often directly borrow the distillation scheme for image classification and perform knowledge distillation for each pixel separately, leading to sub-optimal performance. Here we propose to distill structured knowledge from large networks to compact networks, taking into account the fact that dense prediction is a structured prediction problem. Specifically, we study two structured distillation schemes: i) pair-wise distillation that distills the pair-wise similarities by building a static graph; and ii) holistic distillation that uses adversarial training to distill holistic knowledge. The effectiveness of our knowledge distillation approaches is demonstrated by experiments on three dense prediction tasks: semantic segmentation, depth estimation and object detection. Code is available at: https://git.io/StructKD, Comment: v1:10 pages cvpr2019 accepted; v2:15 pages for a journal version; Code is available at: https://github.com/irfanICMLL/structure_knowledge_distillation; fix typos

With the dawn of 5G network, a new set of requirements for site spectrum monitoring, cellular planning are emerging, all of which are relying on fine-grained signal map. Although with significant importance, the traditional signal map construction could be time-consuming and labor-intensive. The state-of-the arts usually employ crowdsourcing scheme and matrix completion algorithm to solve the dilemma. However, the crowdsourcing scheme usually suffers from uneven distributed and inadequate participants. To this end, in this paper, we study how to effectively reconstruct and update the signal map in the case of partially measured signal maps with smaller cost and propose a GAN-based active signal map reconstruction method (GSMAC). Our method is mainly innovative in two parts: GSMC, GAN-based signal map construction, and ACS, an active crowdsourcing scheme. Specifically, GSMC can effectively update the signal map with only a small number of observations while updating the signal map online. ACS consists of a reinforce learning-based active query mechanism which quantitatively evaluates the most valuable measurement site for reconstruction. The simulation results and real implemented data-driven experiments demonstrate the advantages and effectiveness of our approach in both accuracy and cost.

In this article, we investigate the problem of social link inference in a target location-aware social network (LSN), which aims at predicting the unobserved links between users within the network. This problem is critical for downstream applications, including network completion and friend recommendation. In addition to the network structures commonly used in general link prediction, the studies tailored for social link inference in an LSN leverage user trajectories from the spatial aspect. However, the temporal factor lying in user trajectories is largely overlooked by most of the prior studies, limiting the capabilities of capturing the temporal relevance between users. Moreover, effective user matching by fusing different views, i.e., social, spatial, and temporal factors, remains unresolved, which hinders the potential improvement of link inference. To this end, this article devises a novel multiview matching network (MVMN) by regarding each of the three factors as one view of any target user pair. MVMN enjoys the flexibility and completeness of modeling each factor by developing its suitable matching module: 1) location matching module; 2) time-series matching module; and 3) relation matching module. Each module learns a view-specific representation for matching, and MVMN fuses them for final link inference. Extensive experiments on two real-world data sets demonstrate the superiority of our approach against several competitive baselines for link prediction and sequence matching, validating the contribution of its key components.

Missing data widely exist in the raw or processed data, implying information loss. In many cases, missing values have to be accurately imputed for further use. In this paper, an extreme case, consecutively missing data in large-length and mainly remaining data in small-length, is discussed for time series varying with operating conditions, very universal in industrial processes. Firstly, to fully utilize the information of remaining data, a similar conditions screening scheme is provided, efficient to improve imputation accuracy. Then, multiple receding imputation via Gaussian process regression (GPR) and long short term memory (LSTM) neural network are proposed, deducing generic multiple combination imputation and bidirectional imputation structures. At last, applied for data imputation of extremely missing wind power data, condition-dependent on wind speed, imputation effects of the proposed methods are carefully compared. Simulation results reveal effectiveness of these methods to impute missing data under the extreme case, laying very important foundation for data-driven applications.

In industry 4.0 and digital transformation scenarios, manufacturing companies face the challenges of the exponential growth in the volume of data. A considerable part of the data that enterprises generate in large quantities, at a high speed, and in different forms can be defined as dark data. Companies are not able to extract their potential value for data management, storage, and maintenance issues, and, due to their unstructured form, they become unknown together with their informative value. Some researchers and professionals have addressed the issue of dark data but none of them have focused on the specificity of the manufacturing industry or on the data generated in it. Based on a lack in the literature, in this article, we explore the dark data through a systematic literature review and three focus groups with manufacturing companies. This article fills the gap and provides a valuable support for manufacturing companies to be aware of the presence of dark data in their scenarios, to identify them, and to stimulate initiatives for dark data exploitation. Furthermore, the study provides for the academic audience a reference paper for addressing future exploration in the field of data management in the companies for improving their innovative and operative capabilities.

Radio frequency identification technology has been widely used to verify the presence of items in many applications such as warehouse management and supply chain logistics. In these applications, the challenge of how to timely identify the missing tags (namely tag searching or missing tag identification) is a key focus. Existing missing tag identification solutions have not achieved their full potentials because collision slots have not been well explored. In this paper, we propose an approach named collision resolving based missing tag identification (CR-MTI) to break through the performance bottleneck of existing missing tag identification protocols. In CR-MTI, multiple tags are allowed to respond with different binary strings in a collision slot. Then, the reader can verify them together by using the bit tracking technology and particularly designed string, thereby significantly improve the time efficiency. CR-MTI also reduces the number of messages transmitted by the reader using customized coding. We further explore the optimal parameter settings to maximize the performance of our proposed CR-MTI. Extensive simulation results show that our proposed CR-MTI outperforms prior art in terms of time efficiency, total executive time and communication complexity.

Varied edge bundling methods have been used to reduce visual clutter in parallel coordinates plots (PCP). However, existing edge-bundled PCP do not scale well for visual analysis of multidimensional big data and often overplot the bundles in the area near the axes. In this study, we propose a scalable lightweight bundling method to support visual analysis of multidimensional big data in PCP. It helps the users discover trends and detect outliers in the data by bundling the edges between each two adjacent axes independently. We integrate human judgments into the two-dimensional data binning by novel interactions to accelerate the clustering process of the data. We use the frequency-based representation to render the clusters as histogram-like bundles to reveal the distribution of the data and eliminate the overplotting of the bundles. Based on our method, we build a lightweight web-based visual analytics system for exploring multidimensional big data in PCP. The scalability analysis of our method shows that its clustering time increases linearly with the size of the data. Its rendering time is independent of the size of the data. We conduct two case studies and a user study to compare our method with classic PCP and two state-of-the-art edge-bundled PCP.

Continues field monitoring and searching sensor data remains an imminent element emphasizes the influence of the Internet of Things (IoT). Most of the existing systems are concede spatial coordinates or semantic keywords to retrieve the entail data, which are not comprehensive constraints because of sensor cohesion, unique localization haphazardness. To address this issue, we propose deep learning inspired sensor-rank consolidation (DLi-SRC) system that enables 3-set of algorithms. First, sensor cohesion algorithm based on Lyapunov approach to accelerate sensor stability. Second, sensor unique localization algorithm based on rank-inferior measurement index to avoid redundancy data and data loss. Third, a heuristic directive algorithm to improve entail data search efficiency, which returns appropriate ranked sensor results as per searching specifications. We examined thorough simulations to describe the DLi-SRC effectiveness. The outcomes reveal that our approach has significant performance gain, such as search efficiency, service quality, sensor existence rate enhancement by 91%, and sensor energy gain by 49% than benchmark standard approaches.

Projection techniques are often used to visualize high-dimensional data, allowing users to better understand the overall structure of multi-dimensional spaces on a 2D screen. Although many such methods exist, comparably little work has been done on generalizable methods of inverse-projection -- the process of mapping the projected points, or more generally, the projection space back to the original high-dimensional space. In this paper we present NNInv, a deep learning technique with the ability to approximate the inverse of any projection or mapping. NNInv learns to reconstruct high-dimensional data from any arbitrary point on a 2D projection space, giving users the ability to interact with the learned high-dimensional representation in a visual analytics system. We provide an analysis of the parameter space of NNInv, and offer guidance in selecting these parameters. We extend validation of the effectiveness of NNInv through a series of quantitative and qualitative analyses. We then demonstrate the method's utility by applying it to three visualization tasks: interactive instance interpolation, classifier agreement, and gradient visualization.

Evidence comparing additive 3-dimensional printing (3DP) with subtractive milling for implant-supported frameworks is lacking.The purpose of this systematic review and meta-analysis was to compare the marginal fit and accuracy of complete-arch implant-supported frameworks (CA), implant-retained fixed partial dentures (IRFPDs), single implant crowns (SICs), and interim implant-retained restorations (IIRRs) by using additive manufacturing (AM) and subtractive manufacturing (SM) methods.An electronic search was performed in PubMed, ScienceDirect, Google Scholar, and the Cochrane Library for articles published up to August 2020. The authors acquired the data and evaluated the articles, and the final selection of articles was made according to the inclusion and exclusion criteria. The Methodological Index for Non-Randomized Studies (MINORS) scale was used to evaluate the quality of the included studies. Heterogeneity was evaluated, and meta-analyses with subgroup analyses were performed in the selected studies.The database search resulted in 960 articles. After removing duplicate articles (410 studies), the titles and abstracts were screened in detail, and 10 in vitro studies were selected for qualitative analysis and 9 for quantitative analysis according to the eligibility criteria. Subgroup analyses were performed to compare the 3DP versus the SM technique for different types of implant-supported frameworks (IRFPDs, SICs, IIRRs, and CA). In the IRFPDs analysis, the marginal fit accuracy of the 3DP systems was higher than that with the subtractive manufacturing method (P.001). In the subgroup analysis of SIC frameworks (P=.55) and CA (P=.67) frameworks, no significant difference was observed in the assessed techniques.The marginal fit of implant-supported frameworks manufactured by AM or SM methods is in the clinically acceptable range.

Scientific simulations on high-performance computing (HPC) systems can generate large amounts of floating-point data per run. As compared to lossless compressors, lossy compressors, such as SZ and ZFP, can reduce data volume more aggressively while maintaining the usefulness of the data. However, a reduction ratio of more than two orders of magnitude is almost impossible without seriously distorting the data. In deep learning, the autoencoder has shown potential for data compression. Whether the autoencoder can deliver similar performance on scientific data, however, is unknown. In this paper, we for the first time conduct a comprehensive study on the use of autoencoders to compress real-world scientific data and illustrate several key findings on using autoencoders for scientific data reduction. We implement an autoencoder-based compression prototype to reduce floating-point data. Our study shows that the out-of-the-box implementation needs to be further tuned in order to achieve high compression ratios and satisfactory error bounds. Our evaluation results show that, for most test datasets, the tuned autoencoder outperforms SZ by 2 to 4X, and ZFP by 10 to 50X in compression ratios, respectively. Our practices and lessons learned in this work can direct future optimizations for using autoencoders to compress scientific data.

Testing is the fundamental activity intentional at detecting and solving technical issues in the software source code. In software development, test suite plays a major role. A test suite is a collection of test case which describes actual input, action and an expected response to verify whether a system under test satisfies requirements correctly or not. A huge number of test cases are required for testing the software. The test cases may be redundant. So, the execution of all these test cases entails lot of effort, time and cost. So, it is necessary to make enhancement in the test suite that outcome in good coverage with less effort, time and cost. This work proposes a hybrid technique for test suite enhancement using data mining techniques. The hybrid approach is performed in three ways i) Classification based Clustering ii) Classification based Association iii) Classification based RTM approach used to make enhancement in the test suite and to improve accuracy.

With vast usage of Spatio-temporal data usage in various domains and capturing data as remote sensing, GPS, and ST data. STDM is critical for various domains such as transportation, public safety, medical and environmental statistics. In this article, ST characteristics are explained in seven different types and followed by models for STDM in different domains including medical, mobile usage, sensors, industrial area, weather analysis, data querying, traffic control. Finally, the research and future direction.

Inferential modeling has been of significance for modern manufacturing in estimating the quality-related process variables. As an effective inferential model, probabilistic slow feature analysis (PSFA) has gained attention in regression tasks to interpret dynamic properties with a slowness preference. However, PSFA is often challenged by the nonlinear sequential data due to its linear state-space structure. In this study, a new nonlinear extension of PSFA is proposed under the deep learning framework to enhance the dynamic feature extraction with limited labels, incorporating variational inference and Monte Carlo inference to derive the objective function. The proposed model considers the relevance of inputs with outputs as the input weights to upgrade prediction performance. The proposed model is verified through an industrial hydrocracking process to predict diesel yield with missing labels ranged from 0% to 50%, and the root mean squared error is reduced by at least 8.78% compared to PSFA.

The rapid growth of GPS technology and mobile devices has led to a massive accumulation of location data, bringing considerable benefits to individuals and society. One of the major usages of such data is travel time prediction, a typical service provided by GPS navigation devices and apps. Meanwhile, the constant collection and analysis of the individual location data also pose unprecedented privacy threats. We leverage the notion of geo-indistinguishability, an extension of differential privacy to the location privacy setting, and propose a procedure for privacy-preserving travel time prediction without collecting actual individual GPS trace data. We propose new concepts to examine the impact of geo-indistinguishability-based sanitization on the usefulness of GPS traces and provide analytical and experimental utility analysis for privacy-preserving travel time prediction. We also propose new metrics to measure the adversary error in learning individual GPS traces from the collected sanitized data. Our experiment results suggest that the proposed procedure provides travel time prediction with satisfactory accuracy at reasonably small privacy costs.

Searchable Symmetric Encryption (SSE), which enables users to search over encrypted data without decryption, has gained increasing attention from both academic and industrial fields. However, existing SSE schemes either have low search efficiency or cannot support multi-keyword search, dynamic updates, and result verification simultaneously. To solve these problems, we propose a Verifiable and Dynamic Multi-keyword Search (VDMS) scheme over encrypted data by using the bitmap and RSA accumulator, which provides multi-keyword search over encrypted data in an efficient, verifiable and updated way. The bitmap is used as a data structure to build the indexes, which improves the search efficiency and reduces the storage space of the indexes. The RSA accumulator and bitmap are combined to verify the correctness of results. Formal security analysis proves that our VDMS is adaptively secure against Chosen-Keyword Attacks (CKA), and empirical experiments using a real-world dataset demonstrate that our VDMS is efficient and feasible in practical applications.

Searchable encryption (SE) is a powerful technology that enables keyword-based search over encrypted data becomes possible. However, most SE schemes focus on exact keyword search which can not tolerate misspellings and typos. Existing fuzzy keyword search schemes only support fuzzy search within a limited similarity threshold d, the storage cost will grow exponentially or the precision of search results will greatly decrease as $d$ increases. Moreover, the current fuzzy keyword ranked search schemes consider only the keyword weight, and disregard the influence of keyword morphology similarity on the ranking. In this paper, we propose a scalable fuzzy keyword ranked search scheme over encrypted data under hybrid clouds architecture. We use the edit distance to measure the similarity of keywords and design an edit distance algorithm over the encrypted database, in which our scheme achieves fuzzy keyword search for any similarity threshold d with constant storage size and accurate search results. Furthermore, we design a two-factor ranking function combining keyword weight with keyword morphology similarity, which is utilized to rank the search results and enhance system usability. Extensive experiments are performed to demonstrate the trade-off of efficiency and security of the proposed scheme.

In practical mechanical fault detection and diagnosis, it is difficult and expensive to collect enough large-scale supervised data to train deep networks. Transfer learning can reuse the knowledge obtained from the source task to improve the performance of the target task, which performs well on small data and reduces the demand for high computation power. However, the detection performance is significantly reduced by the direct transfer due to the domain difference. Domain adaptation (DA) can transfer the distribution information from the source domain to the target domain and solve a series of problems caused by the distribution difference of data. In this survey, we review various current DA strategies combined with deep learning (DL) and analyze the principles, advantages, and disadvantages of each method. We also summarize the application of DA combined with DL in the field of fault diagnosis. This paper provides a summary of the research results and proposes future work based on analysis of the key technologies.

In this article, we tackle the problem of predicting the “next” geographical position of a tourist, given her history (i.e., the prediction is done accordingly to the tourist’s current trail) by means of supervised learning techniques, namely Gradient Boosted Regression Trees and Ranking SVM. The learning is done on the basis of an object space represented by a 68-dimension feature vector specifically designed for tourism-related data. Furthermore, we propose a thorough comparison of several methods that are considered state-of-the-art in recommender and trail prediction systems for tourism, as well as a popularity baseline. Experiments show that the methods we propose consistently outperform the baselines and provide strong evidence of the performance and robustness of our solutions.

This paper presents a novel image encryption scheme based on extended large-scale randomization key-stream generator. The basic form of the key-stream generator is presented, and employed in digital image ciphering. The modification of the basic form also, presented, and gives encouraging results in image encryption as compared with classical non-linear stream cipher generators and the basic form. Pixel shuffling is performed via vertical and horizontal permutation. Shuffling is used to expand diffusion in the image and dissipate high correlation among image pixels the sequences generated from all presented generators are introduced to five well-known statistical tests of randomness to judge their randomness characteristic. The ciphered images are tested for their residual intelligibility subjectively. The measures applied to images ciphered by one of the classical key-stream cipher generators (Threshold generator) for the purpose of comparison with the presented key-stream algorithms. Experiments results show that the proposed algorithm achieves the image security. In order to evaluate performance, the proposed algorithm was measured through a series of tests. Experimental results illustrate that the proposed scheme shows a good resistance against brute-force and statistical attacks.

Extracting and analyzing crime patterns in big cities is a challenging spatiotemporal problem. The hardness of the problem is linked to two main factors, the sparse nature of the crime activity and its spread in large spatial areas. Sparseness hampers most time series (crime time series) comparison methods from working properly, while the handling of large urban areas tends to render the computational costs of such methods impractical. Visualizing different patterns hidden in crime time series data is another issue in this context, mainly due to the number of patterns that can show up in the time series analysis. In this article, we present a new methodology to deal with the issues above, enabling the analysis of spatiotemporal crime patterns in a street-level of detail. Our approach is made up of two main components designed to handle the spatial sparsity and spreading of crimes in large areas of the city. The first component relies on a stochastic mechanism from which one can visually analyze probable×intensive crime hotspots. Such analysis reveals important patterns that can not be observed in the typical intensity-based hotspot visualization. The second component builds upon a deep learning mechanism to embed crime time series in Cartesian space. From the embedding, one can identify spatial locations where the crime time series have similar behavior. The two components have been integrated into a web-based analytical tool called CriPAV (Crime Pattern Analysis and Visualization), which enables global as well as a street-level view of crime patterns. Developed in close collaboration with domain experts, CriPAV has been validated through a set of case studies with real crime data in São Paulo - Brazil. The provided experiments and case studies reveal the effectiveness of CriPAV in identifying patterns such as locations where crimes are not intense but highly probable to occur as well as locations that are far apart from each other but bear similar crime patterns.

Process mining aims at discovering behavioral knowledge of business processes from their event logs, which has received an increasing attention in the era of cloud computing and big data. Surprisingly, to date, discovering structural errors (e.g., deadlocks and lack of synchronization) from event logs has not been considered in state-of-the-art process mining techniques. Moreover, existing process discovery approaches cannot be directly applied to event logs of processes with structural errors due to erroneous event occurrences caused by unsynchronized activities. To address this problem, we first preprocess the event log to obtain two separate event logs that are used to discover deadlocks and lack of synchronization, respectively. Erroneous event occurrences caused by unsynchronized activities are discarded in the two processed event logs, from which our error mining algorithms can discover all process fragments involving structural errors, without the need to obtain the overall process first. We implement our approach in a ProM plugin and evaluate it on event logs of real-life business processes, the results of which demonstrate that our approach can effectively and efficiently discover deadlocks and lack of synchronization if event logs contain sufficient event sequences.

Co-location pattern mining refers to discovering neighboring relationships of spatial features distributed in geographic space. With the rapid growth of spatial datasets, the usefulness of co-location patterns is strongly limited by the large number of discovered patterns containing multiple redundancies. To address this problem, in this article, we propose a novel approach for discovering the super participation index-closed (SPI-closed) co-location patterns which are a newly proposed lossless condensed representation of co-location patterns by considering distributions of the spatial instances. In the proposed approach, first, a linear-time method is designed to generate complete and correct neighboring cliques using extended neighboring relationships. Based on these cliques, a hash structure is then constructed to store the distributions of the co-location patterns in a condensed way. Finally, using this hash structure, the SPI-closed co-location patterns (SCPs) are efficiently discovered even if the prevalence threshold is changed, while similar approaches have to restart their mining processes. To confirm the efficiency of the proposed method, we compared its performance with similar approaches in the literature on multiple real and synthetic spatial datasets. The experiments confirm that our new approach is more efficient, effective, and flexible than similar approaches.

Dynamic neural network is an emerging research topic in deep learning. Compared to static models which have fixed computational graphs and parameters at the inference stage, dynamic networks can adapt their structures or parameters to different inputs, leading to notable advantages in terms of accuracy, computational efficiency, adaptiveness, etc. In this survey, we comprehensively review this rapidly developing area by dividing dynamic networks into three main categories: 1) instance-wise dynamic models that process each instance with data-dependent architectures or parameters; 2) spatial-wise dynamic networks that conduct adaptive computation with respect to different spatial locations of image data and 3) temporal-wise dynamic models that perform adaptive inference along the temporal dimension for sequential data such as videos and texts. The important research problems of dynamic networks, e.g., architecture design, decision making scheme, optimization technique and applications, are reviewed systematically. Finally, we discuss the open problems in this field together with interesting future research directions.

The proposed work aims to solve data sparsity problem in the recommendation system. It handles two-level pre-processing techniques to reduce the data size at the item level. Additional resources like items genre, tag, and time are added to learn and analyse the behaviour of the user preferences in-depth. The advantage of the proposed method is to recommend the item, based on user interest pattern and avoid recommending the outdated items. User information are grouped based on similar item genre and tag feature. This effectively handle overlapping conditions that exist on item’s genre, as it has more than one genre at initial level. Further, based on time, it analyses the user non-static interest. Overall it reduces the dimensions which is an initial way to prepare data, to analyse hidden pattern. To enhance the performance, the proposed method utilized Apache’s spark Mllib FP-Growth and association rule mining approach in a distributed environment. To reduce the computation cost of constructing tree in FP-Growth, the candidate data set is stored in matrix form. The experiments were conducted using MovieLens data set. The observed results shows that the proposed method achieves 4% increase in accuracy when compared to earlier methods.

People can infer the weather from clouds. Various weather phenomena are linked inextricably to clouds, which can be observed by meteorological satellites. Thus, cloud images obtained by meteorological satellites can be used to identify different weather phenomena to provide meteorological status and future projections. How to classify and recognize cloud images automatically, especially with deep learning, is an interesting topic. Generally speaking, large-scale training data are essential for deep learning. However, there is no such cloud images database to date. Thus, we propose a large-scale cloud image database for meteorological research (LSCIDMR). To the best of our knowledge, it is the first publicly available satellite cloud image benchmark database for meteorological research, in which weather systems are linked directly with the cloud images. LSCIDMR contains 104 390 high-resolution images, covering 11 classes with two different annotation methods: 1) single-label annotation and 2) multiple-label annotation, called LSCIDMR-S and LSCIDMR-M, respectively. The labels are annotated manually, and we obtain a total of 414 221 multiple labels and 40 625 single labels. Several representative deep learning methods are evaluated on the proposed LSCIDMR, and the results can serve as useful baselines for future research. Furthermore, experimental results demonstrate that it is possible to learn effective deep learning models from a sufficiently large image database for the cloud image classification.

In Website Fingerprinting (WF) attack, a local passive eavesdropper utilizes network flow information to identify which web pages a user is browsing. Previous researchers have demonstrated the effectiveness of WF attacks under a strong Single Page Assumption: the network flow extracted by the adversary belongs to a single web page. In reality, the assumption may not hold because users tend to open multiple tabs simultaneously (or within a short period of time) so that their network traffic is mixed. In this paper, we propose an automated multi-tab Website Fingerprinting attack that is able to accurately classify websites regardless of the number of simultaneously opened pages. Our design is powered by two innovative designs. First, we develop a split point classification method to dynamically identify the split point between the first page and its subsequent pages. As a result, the network traffic before the split point is solely generated for the first page. Then, we propose a new chunk-based WF classifier to infer the websites based on the initial chunk of clean traffic. For both classifiers, we apply automated feature selection to select a concise yet representative feature set. We perform extensive evaluations using SSH and Tor-based datasets to demonstrate the effectiveness of our system components and the integrated system.

Object detection is an essential task in computer vision and image processing. It has many applications in various domains like medical diagnosis, civil military, video surveillance, security, etc. In some vision-related approaches, object detection used as an integral part, such as semantic segmentation, instance segmentation, pose estimation, suspicious activity detection, etc. The first stage in the pipeline is to detect an object. The survey begins with significant highlights of deep learning for object detection. It provides a comprehensive study on object representation; Convolution Neural Network (CNN) and different Deep Convolution Neural Network architecture. It presents a concise review of renowned datasets and definitive measurement metrics, forming the primitive baseline to evaluate the detection framework. Then studies in detail on detection framework one-stage and two-stage detectors and evaluates each framework with standard datasets listing its vital significance. The study also explores different issues of object detection like multi-scale, intra-class variations, generalization & security. Moreover, lists the primitive steps for creating object detector for different conditions from the reviewed survey. Finally, it proposes promising research directions.

With the enhancement of location-acquisition technologies, GPS trajectories play an essential role in data-driven intelligent transportation applications, which requires an accurate approach to match raw GPS trajectories to road segments on a digital map. However, for complex urban roads containing elevated roads and surface roads, map matching for low-frequency GPS data is still challenging. This paper aims to address the biases and instability problem in existing approaches. To this end, we combine the spatial-temporal characteristics of GPS data in complex roads with driving behaviours and present a novel global map matching method including truncated density clustering algorithm, statistic features based spatial-temporal analysis, and driving-behaviour-based track modification. Additionally, a weighted-matrix based interactive voting algorithm is proposed to select the best results from a global perspective. The experiments are conducted with two real GPS trajectory datasets under three road conditions. The result shows that our approach outperforms state-of-art approaches for urban complex road networks in both accuracy and efficiency.

The present paper suggests a hybrid solution to address two key authentication challenges: data privacy and the limitations of mobile devices resources. The former is addressed using Partially Homomorphic Encryption based on Paillier Algorithm for the encryption. While the latter is handled using a combination of Deep Convolutional Neural Network and Local Ternary Pattern for face recognition. We compare the accuracy and performance of our proposed solution to others proposed by the literature on ORL dataset and Extended Yale data set. Our findings suggest our proposed methods return higher recognition rates including 98.75% on encrypted ORL data set and 98.78% on encrypted Extended Yale data. In contrast, the existing methods achieved lower recognition rates, which have achieved only 92.50% and 95.44% of recognition rates on encrypted ORL and Extended Yale data set, respectively.

This paper investigates the stochastic optimization problem with a focus on developing scalable parallel algorithms for deep learning tasks. Our solution involves a reformation of the objective function for stochastic optimization in neural network models, along with a novel parallel strategy, coined weighted aggregating stochastic gradient descent (WASGD). Following a theoretical analysis on the characteristics of the new objective function, WASGD introduces a decentralized weighted aggregating scheme based on the performance of local workers. Without any center variable, the new method automatically assesses the importance of local workers and accepts them according to their contributions. Furthermore, we have developed an enhanced version of the method, WASGD+, by (1) considering a designed sample order and (2) applying a more advanced weight evaluating function. To validate the new method, we benchmark our schemes against several popular algorithms including the state-of-the-art techniques (e.g., elastic averaging SGD) in training deep neural networks for classification tasks. Comprehensive experiments have been conducted on four classic datasets, including the CIFAR-100, CIFAR-10, Fashion-MNIST, and MNIST. The subsequent results suggest the superiority of the WASGD scheme in accelerating the training of deep architecture. Better still, the enhanced version, WASGD+, has been shown to be a significant improvement over its basic version.

Differential privacy (DP) has gained popularity in truth discovery recently due to its strong privacy guarantee. However, existing DP mechanisms for streaming data publication are not suitable for truth discovery as they fail to consider the different reliabilities of individuals, while the DP-based approaches for truth discovery are not suitable for streaming data because they ignore the correlations between truths over time. To solve this problem, we propose an edge computing based privacy-preserving truth discovery mechanism, PrivSTD, for streaming crowdsourced data to realize high accuracy of discovered truth while protecting the privacy of workers. Specifically, edge servers are introduced between the untrusted cloud server and workers to securely calculate the local truths and workers reliabilities. A truth-dependent budget recycle mechanism is designed for each edge server to adaptively determine the perturbed timestamp and allocate the privacy budget according to the changing pattern of local truths. Besides, a reliability-based perturbation mechanism is proposed to reduce the perturbation magnitude based on worker's reliability. We theoretical analyze the data utility and computation cost of PrivSTD, and prove that PrivSTD can satisfy w-event (,)-differential privacy. Extensive experimental results on synthetic and real-world datasets demonstrate that PrivSTD achieves better utility than the state-of-the-art approaches.

Nowadays, many cities are suffering from air pollution problems, which endangered the health of the young and elderly for breathing problems. For supporting the government's policy-making and people's decision making, it is important to predict future fine-grained air quality. In this paper, we predict the air quality of the next 48 hours for each monitoring station and the daily average air quality of the next 7 days for a city, considering air quality data, meteorology data, and weather forecast data. Based on the domain knowledge about air pollution, we propose a deep neural network based approach, entitled DeepAir. Our approach consists of a deep distributed fusion network for station-level short-term prediction and a deep cascaded fusion network for the city-level long-term forecast. With the data transformation preprocessing, the former network adopts a neural distributed architecture to fuse heterogeneous urban data for simultaneously capturing the direct and indirect factors affecting air quality. The latter network takes a neural cascaded architecture to learn the dynamic influences from previously existing data and future predicted data on future air quality. We have deployed a real-time system on the cloud, providing fine-grained air quality forecasts for 300 $_+$ Chinese cities every hour. Our system mainly consists of three components: data crawler, task scheduler, and prediction model, which are implemented with a multi-task architecture to improve the system's efficiency and stability. Based on the datasets from three-year nine Chinese cities, experimental results demonstrate the advantages of our proposed method.

The advance of smart eHealthcare has greatly enabled patients to enjoy high-quality healthcare services, e.g., disease prediction. Meanwhile, to support the dramatic increase of healthcare data, healthcare centers often outsource the on-premises data to the cloud. However, since the healthcare data contain some sensitive information and the cloud server is not fully trusted, healthcare centers need to encrypt the data before outsourcing them. Unfortunately, data encryption inevitably hinders some advanced data applications like the similarity range query. Although many studies on similarity range queries over encrypted data have been reported, most of them still have some limitations in security, efficiency, accuracy, and practicality. Aiming at this challenge, in this paper, we propose an efficient, privacy-preserving, and practical similarity range query (EPSim) scheme. Specifically, we first present a modified asymmetric scalar-product-preserving encryption (ASPE) scheme and prove its security. Then, we introduce a Quadsector tree to represent the data and employ a filtration condition to design an algorithm for efficient similarity range queries over the Quadsector tree. Finally, we propose our EPSim scheme by integrating the modified ASPE scheme and Quadsector tree. Detailed security analysis and performance evaluations indicate our scheme is really secure and efficient in similarity range queries.

In recent days, social media, online services, smartphones, and the Internet of Things (IoT) produces large quantities of data every second. The generated data is structured, unstructured, or semi-structured and available in various formats. Therefore, traditional approaches are not sufficient to handle such kind of data effectively. High utility pattern mining is a famous study area of data analytics that incorporates utility measures to consider user-based constraints such as number of units and benefit, in addition to frequency statistics of datasets. It is also essential to make effective decisions, and their demand is increasing in the last decade. Several techniques have been suggested for utility-based frequent pattern extraction. However, these approaches are limited to data size and operate on standalone systems. We have proposed a parallel approach named distributed memory-optimized utility mining (DMOUM) for high utility-based frequent pattern mining to address this issue. A new pruning technique is implemented that greatly reduces processing time and memory use. The proposed approach can handle huge amounts of data, i.e., big data. DMOUM approach is implemented in cluster-node architecture using Spark. The results are validated on various real-time datasets and found proposed approach has better performance than cutting edge approaches in terms of run-time, memory consumption, and scalability measures. The proposed work will provide solutions to real-time issues such as health care, education, e-commerce, and so on.

In industrial processes, data-driven soft sensors have played an important role for effective process control, optimization and monitoring. However, the shortcomings for deep learning technology seriously hinder the application of deep learning in industrial processes. For example, the knowledge cannot be added into the model and the model prediction could not be well explained. To solve those problems, the graph mining, convolution, and explanation (GMCE framework is proposed for knowledge automation in this work. Based on the equivalence analysis of the self-attention mechanism (SAM and graph convolution (GC operation, the spital SAM is adopted for knowledge discovery from data directly. After that, the GC layer considering the relationship between process variables can utilize the knowledge for constructing soft sensor models. Besides, to explain which knowledge contributes to the final model prediction, the graph neural network explainer (GNNExplainer is designed for explaining the model output. Finally, the effectiveness and feasibility of the framework are evaluated on an industrial process, in which the knowledge discovered from the data is of great consistence with the prior knowledge and the final explanation indicated that most of the knowledge consists with the prior knowledge contributed to the prediction.

The process operating performance assessment is critical for the smelting process of electro-fused magnesium furnaces to improve quality of the magnesia product and pursue optimal comprehensive economic benefit. This paper proposes a new method of multi-source heterogeneous information deep feature fusion (MSHIDFF) to achieve higher accuracy operating performance assessment in the electro-fused magnesium smelting process. Firstly, we utilize convolutional neural network, bidirectional long short-term memory network and stacked auto-encoder to extract deep features from raw image, sound and current of different performance grades. Furthermore, those multi-source deep features are fused and the softmax regression with attention mechanism is employed to train a neural network classifier for the fused deep features of different performance grades. The simulation results show that the proposed MSHIDFF method obtains the superior assessment accuracy.

Text has become one of the most extensively used digital media in Internet, which provides steganography an effective carrier to realize confidential message hiding. Nowadays, generation-based linguistic steganography has made a significant breakthrough due to the progress of deep learning. However, previous methods based on recurrent neural network have two deviations including exposure bias and embedding deviation, which seriously destroys the security of steganography. In this paper, we propose a novel linguistic steganographic model based on adaptive probability distribution and generative adversarial network, which achieves the goal of hiding secret messages in the generated text while guaranteeing high security performance. First, the steganographic generator is trained by using generative adversarial network to effectively tackle the exposure bias, and then the candidate pool is obtained by a probability similarity function at each time step, which alleviates the embedding deviation through dynamically maintaining the diversity of probability distribution. Third, to further improve the security, a novel strategy that conducts information embedding during model training is put forward. We design various experiments from different aspects to verify the performance of the proposed model, including imperceptibility, statistical distribution, anti-steganalysis ability. The experimental results demonstrate that our proposed model outperforms the current state-of-the-art steganographic schemes.

Network traffic classification is important to intrusion detection and network management. Most of existing methods are based on machine learning techniques and rely on the features extracted manually from flows or packets. However, with the rapid growth of network applications, it is difficult for these approaches to handle new complex applications. In this paper, we design a novel neural network, the Extended Byte Segment Neural Network (EBSNN), to classify network traffic. EBSNN first divides a packet into header segments and payload segments, which are then fed into encoders composed of the recurrent neural networks with the attention mechanism. Based on the outputs, another encoder learns the high-level representation of the whole packet. In particular, side-channel features are learned from header segments to improve the performance. Finally, the label of the packet is obtained by the softmax function. Furthermore, EBSNN can classify network flows by examining the first few packets. Thorough experiments on the real-world datasets show that EBSNN achieves better performance than the state-of-the-art methods in both the application identification task and the website identification task.

Congestion recognition is necessary for vehicle routing, traffic control, and many other applications in intelligent transportation systems. Besides, traffic facilities in the three-dimensional road network, which contains the fundamental spatiotemporal features for congestion recognition, provides multi-source traffic information. To exploit these traffic big data, in this paper, we propose an attention mechanism-based digraph convolution network (ADGCN) enabled framework to tackle the congestion recognition problem. It can be divided into two parts, spatial relevance modeling and temporal relevance modeling. At first, the representation incorporates spatiotemporal traffic information with the three-dimensional urban network, and partially decouples the global network topology to a single-knot digraph. Then a digraph-based convolution network is used to capture high-order spatial features. Finally, to proceed with time-series features, the multi-modal attention mechanism is introduced to catch the long-range temporal dependence and the congestion classifier is defined accordingly. This distinguishes the proposed model from the conventional congestion recognition methods. Comprehensive experiments are conducted based on real traffic data. The results demonstrate the advantages of the proposed framework over the existing spatiotemporal analysis methods.

State-of-the-art deep learning models remain data-intensive, requiring a large training dataset to ensure the generalization ability. However, it is quite expensive or impractical to obtain massive training samples for condition monitoring practitioners. This paper proposes a simulation-driven domain adaptation method to circumvent the data deficiency issue using physical-based simulations. A bearing phenomenological model is developed to generate simulated vibration signals. In the frame of domain adaptation transfer learning, a Domain Adversarial Neural Network (DANN) is proposed utilizing the simulated data as the source domain. The DANN can align the coarse supervised source domain data and the fine supervised target domain data to conduct adversarial training. Experimental results indicate that the proposed method can reach high classification accuracy using a small amount of real data. Compared to non-adapted and other transfer learning models, the proposed method demonstrates superior performance for bearing fault diagnosis, which is promising for the industry.

Deep learning has been fully verified and accepted in the field of electromagnetic signal classification. However, in many specific scenarios, such as radio resource management for aircraft communications, labeled data are difficult to obtain, which makes the best deep learning methods at present seem almost powerless, because these methods need a large amount of labeled data for training. When the training dataset is small, it is highly possible to fall into overfitting, which causes performance degradation of the deep neural network. For few-shot electromagnetic signal classification, data augmentation is one of the most intuitive countermeasures. In this work, a generative adversarial network based on the data augmentation method is proposed to achieve better classification performance for electromagnetic signals. Based on the similarity principle, a screening mechanism is established to obtain high-quality generated signals. Then, a data union augmentation algorithm is designed by introducing spatiotemporally flipped shapes of the signal. To verify the effectiveness of the proposed data augmentation algorithm, experiments are conducted on the RADIOML 2016.04C dataset and real-world ACARS dataset. The experimental results show that the proposed method significantly improves the performance of few-shot electromagnetic signal classification.

The healthcare industry has become increasingly challenging, requiring retrieval of knowledge from large amounts of complex data to find the best treatments. Several works have suggested the use of Data Mining tools to overcome the challenges; however, none of them has suggested the best tool to do so. To fill this gap, this paper presents a survey of popular open-source data mining tools in which data mining tool selection criteria based on healthcare application requirements is proposed and the best ones using the proposed selection criteria are identified. The following popular open-source data mining tools are assessed: KNIME, R, RapidMiner, Scikit-learn, and Spark. The study shows that KNIME and RapidMiner provide the largest coverage of healthcare data mining requirements.

Travel time prediction of a given trajectory plays an indispensable role in intelligent transportation systems. Although many prior researches have struggled for accurate prediction results, most of them achieve inferior performance due to insufficient feature extraction of travel speed and road network structure from the trajectory data, which confirms the challenges involved in this topic. To overcome those issues, we propose a novel neural Network for Travel Time Prediction based on tensor decomposition and graph embedding, named TTPNet, which can extract travel speed and representation of road network structure effectively from historical trajectories, as well as predict the travel time with better accuracy. Specifically, TTPNet consists of three components: the first module (Travel Speed Features Layer) leverages non-negative tensor decomposition to restore travel speed distributions on different roads in the previous hour, and integrates a CNN-RNN model to extract both long-term and short-term travel speed features of the query trajectory; the second module (Road Network Structure Features Layer) utilizes graph embedding to generate the representation of local and global road network structure; the last module (Deep LSTM Prediction Layer) completes the final predicting task. Empirical results over two real-world large-scale datasets show that our proposed TTPNet model can achieve significantly better performance and remarkable robustness.

This paper presents a new contribution to the recommendation system following E-commerce reviews. Here, it implements a dictionary-based sentiment analysis based on four main steps (i) Pre-processing (ii) Semantic word extraction (iii) Feature Extraction (iv) Classification. Initially, the tweets or reviews extracted from the database are subjected to pre-processing, which involves three processes: stop word removal, stemming, and blank space removal. In the semantic word extraction process, the semantic words from the dictionary will be extracted by matching with the extracted keywords. The next process is the feature extraction, which extracts joint holoentropy and cross holoentropy of all keywords, and further proceeds with conditional holoentropy-based feature selection process. Finally, the selected features are subjected to a classification process using Deep Belief Network (DBN), which is a well-performing deep learning algorithm. Moreover, the main contribution of the paper relies on the improvement of DBN architecture, where the number of hidden neurons and activation function is optimally tuned by a hybrid optimization algorithm termed as Grey linked Chick Update-based Chicken Swarm Optimization (GCU-CSO). At last, the comparative analysis of proposed and conventional algorithms in terms of various performance metrics proves the efficacy of the proposed E-commerce recommendation system.

Nowadays, increasing business applications running in the cloud are embracing the microservice architecture. This paper presents the challenges and implications of diagnosing root causes of anomalies in large-scale microservice architecture using real incidents in IBM Bluemix. We propose ServiceRank, a novel framework for anomaly detection and root cause identification in the microservice architecture to tackle these challenges. ServiceRank introduces an anomaly detector followed by a root cause analysis module, which detects the suspected abnormal service without pre-defined thresholds. To generalize our approach, we design a dynamic causal relationship extraction approach to construct impact graphs for root cause investigation according to specific anomalies. To eliminate cloud design-patterns' impact on anomaly diagnosis, we propose a mechanism called correlation calibration in ServiceRank and present a calibration algorithm for the circuit breaker - a typical protection pattern in the microservice architecture. Finally, we design a heuristic investigation algorithm based on the second-order random walk to identify the anomaly's root cause. Experimental results in a simulated environment and the IBM Bluemix platform show that ServiceRank outperforms selected approaches in accuracy and offers fast identification of root cause service when an anomaly occurs. Moreover, we can deploy ServiceRank rapidly and easily in various systems without any pre-defined knowledge.

Search engines are crucial for information gathering systems (IGS). New challenges face search engines concerning automatic learning from user requests. In this paper, a new hybrid intelligent system is proposed to enhance the search process. Based on a Multilayer Fuzzy Inference System (MFIS), the first step is to implement a scalable system to relay logical rules in order to produce three classifications for search behavior, user profiles, and query characteristics from analysis of navigation log files. These three outputs from the MFIS are used as inputs for the second step, an Adaptive Neuro-Fuzzy Inference System (ANFIS). The training process of the ANFIS replaced the rules by adjusting the weights in order to find the most relevant result for the search query. This proposed system, called MFIS-ANFIS, is implemented as an experimental system. The system performance is evaluated using quantitative and comparative analysis. MFIS-ANFIS aimed to be the core of intelligent and reliable search process.

Trajectory prediction for mobile phone users is a cornerstone component to support many higher-level applications in LBSs (Location-Based Services). Most existing methods are designed based on the assumption that the explicit location information of the trajectories is available (e.g., GPS trajectories). However, collecting such kind of trajectories lays a heavy burden on the mobile phones and incurs privacy concerns. In this paper, we study the problem of trajectory prediction based on cell-id trajectories without explicit location information and propose a deep learning framework (called DeepCTP) to solve this problem. Specifically, we use a multi-graph embedding method to learn the latent spatial correlations between cell towers by exploiting handoff patterns. Then, we design a novel spatial-aware loss function for the encoder-decoder network to generate cell-id trajectory predictions. We conducted extensive experiments on real datasets. The experiment results show that DeepCTP outperforms the state-of-the-art cell-id trajectory prediction methods in terms of prediction error.