Efforts toward a comprehensive description of behavior have indeed facilitated the development of representation-based approaches that utilize deep learning to capture behavioral information. As behavior complexity in...
详细信息
The issues of both system security and safety can be dissected integrally from the perspective of behavioral appropriateness. That is, a system is secure or safe can be judged by whether the behavior of certain agent(...
详细信息
Anomalies are usually regarded as data errors or novel patterns previously unseen, which are quite different from most observed data. Accurate detection of anomalies is crucial in various application scenarios. This p...
详细信息
Deep neural networks (DNNs) have demonstrated exceptional performance, leading to diverse applications across various mobile devices (MDs). Considering factors like portability and environmental sustainability, an inc...
详细信息
ISBN:
(数字)9783982674100
ISBN:
(纸本)9798331534646
Deep neural networks (DNNs) have demonstrated exceptional performance, leading to diverse applications across various mobile devices (MDs). Considering factors like portability and environmental sustainability, an increasing number of MDs are adopting energy harvesting (EH) techniques for power supply. However, the computational intensity of DNNs presents significant challenges for their deployment on these resource-constrained devices. Existing approaches often employ DNN partition or offloading to mitigate the time and energy consumption associated with running DNNs on MDs. Nonetheless, existing methods frequently fall short in accurately modeling the execution time of DNNs, and do not consider to use thread allocation for further latency and energy consumption optimization. To solve these problems, we propose a dynamic DNN partition and thread allocation method to optimize the latency and energy consumption of running DNNs on EH-enabled MDs. Specifically, we first investigate the relationship between DNN inference latency and allocated threads and establish an accurate DNN latency prediction model. Based on the prediction model, a DRL-based DNN partition (DDP) algorithm is designed to find the optimal partitions for DNNs. A thread allocation (TA) algorithm is proposed to reduce the inference latency. Experimental results from our test-bed platform demonstrate that compared to four benchmarking methods, our scheme can reduce DNN inference latency and energy consumption by up to 37.3% and 38.5%.
The visual commonsense reasoning (VCR) task is to choose an answer and provide a justifying rationale based on the given image and textural question. Representative works first recognize objects in images and then ass...
详细信息
Stock price prediction is a challenging problem in the field of finance and receives widespread attention. In recent years, with the rapid development of technologies such as deep learning and graph neural networks, m...
详细信息
Money laundering is the process of legitimizing dirty money through complex transactions, posing a serious threat to a country’s financial stability and national security. Nowadays, with the prevalence of organized m...
Money laundering is the process of legitimizing dirty money through complex transactions, posing a serious threat to a country’s financial stability and national security. Nowadays, with the prevalence of organized money laundering, launderers prefer to use intricate multi-hop laundering chains to transfer dirty money. Moreover, they engage in normal financial activities to disrupt detection by auditors. In response to these trends and challenges, we propose a novel unsupervised money laundering structure detection framework for the anti-money laundering field, called structure incremental expansion (SIE). Our framework consists of two main modules: 1) Initialization of suspicious structures, which adopts a control-limit based method to identify suspicious accounts exhibiting anomalous transaction behavior. These accounts will serve as the starting points for suspicious structure expansion. 2) Dynamic structure expansion, where we design three dynamic membership functions according to the Financial Action Task Force’s definitions of the three stages of money laundering evolution. Newly-added incremental transactions in the network will be assigned to appropriate expanding suspicious structures. We conduct extensive experiments on simulated and public financial networks. SIE exhibits desirable performance and scalability. We also provide a detailed case study, visualizing a complete money laundering structure detection process, demonstrating our method’s strong interpretability.
To deal with the discrepancy between global and local objectives in the federated learning invoked by the non-independent, identically distributed (non-IID) data and mitigate the impact of catastrophic forgetting in t...
To deal with the discrepancy between global and local objectives in the federated learning invoked by the non-independent, identically distributed (non-IID) data and mitigate the impact of catastrophic forgetting in the training phase, we propose a federated learning framework with data distribution-wise reinforcement learning to perform node selection to accelerate the convergence process and alleviate the accuracy degradation. In this framework, the agent on the central server observes the number of samples every node owns, the derived distribution information of every dataset, and the current local and global accuracy. Then infer the selected node-set to participate in the current federated learning round through policy network in reinforcement learning. Finally, we conduct simulations with publicly data sets. Simulation results indicate that our FedWNS outperforms the existing FedAvg and CSFedAvg on the testing accuracy and the communication rounds to reach target accuracy under different settings.
Spread estimation is an essential issue in high-speed networks with wide applications, such as network billing, quality of service, anomaly detection, etc. As a promising technique, sketch can efficiently estimate per...
Spread estimation is an essential issue in high-speed networks with wide applications, such as network billing, quality of service, anomaly detection, etc. As a promising technique, sketch can efficiently estimate per-flow spread with only a small memory cost. Many studies focus on improving the performance of sketches. However, these works primarily focus on optimizing the counter level or sketch level without considering the scenario of multi-spread estimation, which is crucial for improving memory utilization and detecting anomalies. In this paper, we propose an efficient flow information compression algorithm based on the on-chip/off-chip hybrid framework to estimate multiple flow spreads. In the on-chip memory, we filter out non-duplicates and sample them to the off-chip space for recording. In the off-chip memory, we compress each sampled non-duplicate to a carefully designed bit-cube. When the measurement is finished, we separate corresponding KV-flows from a specific flow based on the user query. Then, we rebuild this flow to a subset group based on the duplicate number of each KV-flow. Finally, according to the Multi-set theory, we derive an accurate multi-spread estimate formula to solve this issue with a high throughput and small on-chip memory usage. Furthermore, we evaluate the performance of our proposed estimator using real Internet traffic traces downloaded from CAIDA. Experiments show that, compared to the state-of-the-art, our proposal achieves a 97.2% lower average relative error in per-destination source flow spread estimation with a tight on-chip memory, e.g., 320KB. And our proposed method achieves 31.86 higher processing throughput.
This paper addresses a special and imperceptible class of privacy,called implicit *** contrast to traditional(explicit)privacy,implicit privacy has two essential properties:(1)It is not initially de ned as a privacy a...
详细信息
This paper addresses a special and imperceptible class of privacy,called implicit *** contrast to traditional(explicit)privacy,implicit privacy has two essential properties:(1)It is not initially de ned as a privacy attribute;(2)it is strongly associated with privacy *** other words,attackers could utilize it to infer privacy attributes with a certain probability,indirectly resulting in the disclosure of private *** deal with the implicit privacy disclosure problem,we give a measurable de nition of implicit privacy,and propose an ex-ante implicit privacy-preserving framework based on data generation,called *** framework consists of an implicit privacy detection module and an implicit privacy protection *** former uses normalized mutual information to detect implicit privacy attributes that are strongly related to traditional privacy *** on the idea of data generation,the latter equips the Generative Adversarial Network(GAN)framework with an additional discriminator,which is used to eliminate the association between traditional privacy attributes and implicit *** elaborate a theoretical analysis for the convergence of the *** demonstrate that with the learned generator,IMPOSTER can alleviate the disclosure of implicit privacy while maintaining good data utility.
暂无评论