检索结果-内蒙古大学图书馆

36th International Conference on Massive Storage systems and technology, MSST 2020

作者： Liu, Haikun Ye, Yuanyuan Liao, Xiaofei Jin, Hai Zhang, Yu Jiang, Wenbin He, Bingsheng National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China School of Computing National University of Singapore Singapore

Emerging Non-Volatile Main Memory (NVMM) technologies generally feature high density, low energy consumption and cost per bit compared to DRAM. However, the limited write endurance of NVMM poses a significant challenge of using NVMM as an substitute for DRAM. This paper proposes a space-oblivious compression and wear-leveling based memory architecture to improve the write endurance of NVMM. As memory blocks of many applications usually contain a large amount of zero bytes and frequent values, we propose a nonuniform compression encoding scheme that integrates Zero Deduplication with Frequent Value Compression (called ZD-FVC) to reduce bit-writes on NVMM. Moreover, we leverage the memory space available through compression to achieve an intra-block wear leveling policy. It rotates the writing positions of a compressed data block within the data’s initial memory space, and thus enhances write endurance by balancing the bit-writes per NVMM cell. ZD-FVC can be integrated into the NVMM module and implemented entirely by hardware, without any intervention of Operating systems. We implement ZD-FVC in Gem5 and NVMain simulators, and evaluate it with several programs from SPEC CPU2006. Experimental results shows that ZD-FVC is much better than several state-of-the-art approaches. Particularly, ZD-FVC can improve data compression ratio by 55% compared to Frequent Value Compression. Compared with the data Comparison Write, ZD-FVC is able to significantly improve the lifetime of NVMM by 3.3X on average, and also reduces NVMM write latency by 31% and energy consumption by 19% on average. © 2020 36th International Conference on Massive Storage systems and technology, MSST 2020. All Rights Reserved.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage Missing Value Imputation Method Based on Autoencoder Neural Network

A Two-Stage Missing Value Imputation Method Based on Autoenc...

引用

IEEE International Conference on big data

作者： Jiayin Yu Yulin He Joshua Zhexue Huang College of Computer Science & Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (纸本)9781665445993

Due to the ubiquitous presence of missing values in real-world datasets, an imputation algorithm can recover the missing values and provide users with a complete dataset that utilizes all the available observed information. However, most of the imputation methods still have several limitations, including cannot restore the original distribution, handling various data missing patterns, and high missing rate dataset. In this poster, a novel neural network-based two-stage missing value imputation (abbreviated as TS-MVI) method is proposed to fill an incomplete condition attribute with the optimized attribute values for the supervised learning task. By initializing the missing values with random numbers, the imputation values are iteratively adjusted based on the new updating rule by minimizing both the autoencoder-oriented objective function and neural network-based classification error. The persuasive experiments show that TS-MVl method significantly outperforms current state-of-the-art imputation methods and thus demonstrate TS-MVI is a viable approach to deal with the missing value imputation problem.

关键词： Conferences Supervised learning Neural networks big data Linear programming Task analysis

来源：评论

学校读者我要写书评

暂无评论

Continual Learning for Smart City: A Survey

arXiv

引用

arXiv 2024年

作者： Yang, Li Luo, Zhipeng Zhang, Shiming Teng, Fei Li, Tianrui School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Sichuan Chengdu611756 China

With the digitization of modern cities, large data volumes and powerful computational resources facilitate the rapid update of intelligent models deployed in smart cities. Continual learning (CL) is a novel machine learning paradigm that constantly updates models to adapt to changing environments, where the learning tasks, data, and distributions can vary over time. Our survey provides a comprehensive review of continual learning methods that are widely used in smart city development. The content consists of three parts: 1) Methodology-wise. We categorize a large number of basic CL methods and advanced CL frameworks in combination with other learning paradigms including graph learning, spatial-temporal learning, multi-modal learning, and federated learning. 2) Application-wise. We present numerous CL applications covering transportation, environment, public health, safety, networks, and associated datasets related to urban computing. 3) Challenges. We discuss current problems and challenges and envision several promising research directions. We believe this survey can help relevant researchers quickly familiarize themselves with the current state of continual learning research used in smart city development and direct them to future research trends. Copyright © 2024, The Authors. All rights reserved.

关键词： Smart city

来源：评论

学校读者我要写书评

暂无评论

Random Sample Partition-Based Clustering Ensemble Algorithm for big data

Random Sample Partition-Based Clustering Ensemble Algorithm ...

引用

IEEE International Conference on big data

作者： Xueqin Du Yulin He Joshua Zhexue Huang College of Computer Science & Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (纸本)9781665445993

A novel random sample partition-based clustering ensemble (RSP-CE) algorithm is proposed in this paper to handle the big data clustering problems. There are three key components in RSP-CE algorithm, i.e., generating the base clustering results on RSP data blocks, harmonizing the based clustering results with maximum mean discrepancy (MMD) criterion, and refining the RSP clustering results. RSP data blocks have the consistent sample distributions with the whole big data and thus provide the possibility for using base clustering results on different data subsets to approximate the clustering result on whole big data. The experimental results in comparison with other 5 well-known clustering ensemble algorithms on 4 big data sets show that RSP-CE algorithm obtains the better normalized mutual information (NMI) values and Fowlkes-Mallows Index (FMI) values with the less training time consumptions and thus demonstrate that RSP-CE algorithm is a viable approach to deal with the big data clustering problems.

关键词： Training Conferences Refining Clustering algorithms big data Approximation algorithms Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Whale: Efficient One-to-Many data Partitioning in RDMA-Assisted Distributed Stream Processing systems

Whale: Efficient One-to-Many Data Partitioning in RDMA-Assis...

引用

Supercomputing Conference

作者： Jie Tan Hanhua Chen Yonghui Wang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computing Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9781450384421

ISBN: (纸本)9781665483902

To process large-scale real-time data streams, existing distributed stream processing systems (DSPSs) leverage different stream partitioning strategies. The one-to-many data partitioning strategy plays an important role in various applications. With one-to-many data partitioning, an upstream processing instance sends a generated tuple to a potentially large number of downstream processing instances. Existing DSPSs leverage an instance-oriented communication mechanism, where an upstream instance transmits a tuple to different downstream instances separately. However, in one-to-many data partitioning, multiple downstream instances typically run on the same machine to exploit multi-core resources. Therefore, a DSPS actually sends a data item to a machine multiple times, raising significant unnecessary costs for serialization and communication. We show that such a mechanism can lead to serious performance bottleneck due to CPU overload. To address the problem, we design and implement Whale, an efficient RDMA (Remote Direct Memory Access) assisted distributed stream processing system. Two factors contribute to the efficiency of this design. First, we propose a novel RDMA-assisted stream multicast scheme with a self-adjusting non-blocking tree structure to alleviate the CPU workloads of an upstream instance during one-to-many data partitioning. Second, we re-design the communication mechanism in existing DSPSs by replacing the instance-oriented communication with a new worker-oriented communication scheme, which saves significant costs for redundant serialization and communication. We implement Whale on top of Apache Storm and conduct comprehensive experiments to evaluate its performance with large-scale real world datasets. The results show that Whale achieves 56.6x improvement of system throughput and 97% reduction of processing latency compared to existing designs.

关键词： Costs Storms High performance computing Memory management Whales Distributed databases Throughput

来源：评论

学校读者我要写书评

暂无评论

Intra-Person Camera Adversarial for Intra-Camera Supervised Person Re-Identification

Intra-Person Camera Adversarial for Intra-Camera Supervised ...

引用

International Conference on Automatic Face and Gesture Recognition

作者： Ruochen Tang Xun Gong School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu China

ISBN: (数字)9798350394948

ISBN: (纸本)9798350394955

Re-identification (ReID) of individuals across different cameras is a challenging task due to the high-quality large-scale datasets required for the model. Intra-camera supervised (ICS) person re-identification has been proposed to address the high cost of annotating large-scale datasets, but reducing the gap between camera domains remains a major challenge. Current approaches use intra- and inter-camera learning with contrastive learning performed separately in both phases. However, the effect of features from the same person under different cameras on the model during inter-camera learning, and the fine-grained characteristic where the same person can be classified into multiple classes based on the camera labels, still require further research. To address this issue, we propose a Camera-Based Contrastive Learning (CBCL) method that moves features away from their respective cameras and closer to other cameras to reduce domain gaps. We also introduce an Intra-Person Camera Adversarial (IPCA) loss that effectively utilizes fine-grained characteristics of person re-identification and improve IPCA by introducing camera labels to obtain IPCA_2 which achieves better model recognition performance than IPCA alone. Extensive experiments on multiple datasets demonstrate that our method outperforms existing methods and is comparable to fully-supervised methods.

关键词： Costs Scalability Face recognition Contrastive learning Gesture recognition Cameras Robustness

来源：评论

学校读者我要写书评

暂无评论

Low-Light Enhancement Effect on Classification and Detection: An Empirical Study

arXiv

引用

arXiv 2024年

作者： Wu, Xu Lai, Zhihui Jie, Zhou Gao, Can Hou, Xianxu Zhang, Ya-Nan Shen, Linlin The Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Shenzhen518060 China

Low-light images are commonly encountered in real-world scenarios, and numerous low-light image enhancement (LLIE) methods have been proposed to improve the visibility of these images. The primary goal of LLIE is to generate clearer images that are more visually pleasing to humans. However, the impact of LLIE methods in high-level vision tasks, such as image classification and object detection, which rely on high-quality image datasets, is not well explored. To explore the impact, we comprehensively evaluate LLIE methods on these high-level vision tasks by utilizing an empirical investigation comprising image classification and object detection experiments. The evaluation reveals a dichotomy: While Low-Light Image Enhancement (LLIE) methods enhance human visual interpretation, their effect on computer vision tasks is inconsistent and can sometimes be harmful. Our findings suggest a disconnect between image enhancement for human visual perception and for machine analysis, indicating a need for LLIE methods tailored to support high-level vision tasks effectively. This insight is crucial for the development of LLIE techniques that align with the needs of both human and machine vision. Copyright © 2024, The Authors. All rights reserved.

关键词： Machine vision

来源：评论

学校读者我要写书评

暂无评论

VG-Net: Sensor Time Series Anomaly Detection with Joint Variational Autoencoder and Graph Neural Network

VG-Net: Sensor Time Series Anomaly Detection with Joint Vari...

引用

Smart World Congress (SWC), IEEE

作者： Shuai Wang Shenghao Liu Xiaoxuan Fan Haijun Wang Yinxin Zhou Hanjun Gao Hongwei Lu Xianjun Deng Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Hunan Technical College of Railway High-speed China Nanjing University of Posts and Telecommunications China China National Nuclear Power Co Ltd China

ISBN: (数字)9798331520861

ISBN: (纸本)9798331520878

Intelligent Cyber-Physical systems typically utilize sensors to gather a significant amount of raw data which often possesses temporal and high-dimensional characteristics. Ensuring the data reliability is crucial for the normal operation of the system. While most existing methods are capable of identifying anomalies in high-dimensional time series data from sensors, they often lack adequate accuracy and fail to adequately consider the correlation between sensor nodes. To address these limitations, we propose an unsupervised framework which is a combination of variational autoencoder and graph neural network(VG-Net). By jointly optimizing the reconstruction module and the prediction module, VG-Net effectively models the correlation between sensor nodes while simultaneously detecting anomalies. The reconstruction module is responsible for modeling the latent representation space and reconstructing the time series data through variational autoencoder. The prediction module leverages bidirectional long short term memory networks and neural tensor network to learn the relationships between sensor nodes, and uses graph neural network to predict the future behavior of the data. Experiments on eight real and synthetic datasets demonstrate that, compared with existing methods, VG-Net can accurately model the relationship between sensor nodes and enhance the anomaly detection performance of high-dimensional time series data.

关键词： Time series analysis Autoencoders Sensor phenomena and characterization Predictive models data models Graph neural networks Reliability Anomaly detection Intelligent sensors Synthetic data

来源：评论

学校读者我要写书评

暂无评论

Towards Demystifying Android Adware: dataset and Payload Location

Towards Demystifying Android Adware: Dataset and Payload Loc...

引用

IEEE/ACM International Conference on Automated Software engineering - Workshops (ASE Workshops)

作者： Chao Wang Tianming Liu Yanjie Zhao Lin Zhang Xiaoning Du Li Li Haoyu Wang Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Monash University Clayton Australia Huazhong University of Science and Technology Wuhan China The National Computer Emergency Response Team/Coordination Center of China (CNCERT/CC) Beijing China Beihang University Beijing China

ISBN: (数字)9798400712494

ISBN: (纸本)9798331523169

Adware represents a pervasive threat in the mobile ecosystem, yet its inherent characteristics have been largely overlooked by previous research. This work takes a crucial step towards demystifying Android adware. We present a comprehensive, well-annotated Android adware dataset AdwareZoo, which comprises 15,996 adware samples across 118 distinct adware families collected from both security reports and app repositories, providing a robust foundation for in-depth analysis and future research. We identify adware family payloads by isolating packages from adware samples for VirusTotal rescanning. Our analysis unveils critical insights into the adware ecosystem, highlighting distinctive patterns in family naming conventions and exposing the unexpected classification of widely-used ad networks as adware. We identify diverse payload location strategies, with a notable finding that over 30% of adware families employ payloads beyond conventional Java/Kotlin code. Furthermore, we reveal several evasion techniques utilized by ad-ware, including package name obfuscation and dynamic payload loading. This research not only offers a robust foundation for understanding and combating adware but also highlights the pressing need for increased scrutiny of mobile advertising practices.

关键词： Prevention and mitigation Ecosystems Loading Pressing Regulation Mobile security Security Advertising Payloads Software engineering

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Text Classification for Judicial Texts via Dual Graph and Label Feature Fusion

Multi-Label Text Classification for Judicial Texts via Dual ...

引用

Smart World Congress (SWC), IEEE

作者： Qiliang Gu Qin Lu Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798331520861

ISBN: (纸本)9798331520878

The legal judgement prediction (LJP) of judicial texts represents a multi-label text classification (MLTC) problem, which in turn involves three distinct tasks: the prediction of charges, legal articles, and terms of penalty. Nevertheless, extant multi-label text classification models tend to eschew the consideration of multiple correlations and semantic information between labels when predicting judicial texts, which may result in the loss of pertinent information. Furthermore, these models do not take full advantage of the local and overall information of the labels in the process of selecting appropriate labels for the text using the multi-head attention mechanism. To address these issues, we propose a new model, BGFLFF, which explores label correlation and semantics among the three tasks by employing Graph Convolutional Network (GCN) and multi-head attention mechanisms. In particular, we propose a Bi-Graph Fusion GCN (BGF-GCN), which fuses the co-occurrence matrix of labels with the cosine similarity matrix, thereby fully exploiting the multiple correlations between labels. Furthermore, prior to embedding the tags, the interpretations of the labels are obtained via Google in order to enhance the semantic information between the labels. To further reinforce the interconnections between labels and text and more effectively comprehend the interrelationships between the three tasks, we propose a Multi-Head Label Feature Fusion Attentional Mechanism (MH-LFFAtt), which assigns distinct weights to the pertinent label information in the text by fusing the local and overall features of the labels. The experimental results demonstrate that the F1 score exhibits an improvement of up to ${2. 2 8 \%}$ and a minimum of ${1. 2 9 \%}$ across the various tasks of the two datasets. This evidence substantiates the assertion that BGFLFF outperforms the existing baseline model.

关键词： Attention mechanisms Correlation Law Graph convolutional networks Fuses Text categorization Semantics Predictive models Multitasking Internet

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：