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

7th Asian Conference on Pattern Recognition, ACPR 2023

作者： Wang, Yangbo Zhou, Jie Lin, Qingshui Lu, Jianglin Gao, Can National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China Basic Teaching Department Liaoning Technical University Huludao125105 China College of Engineering Northeastern University BostonMA02115 United States

ISBN: (纸本)9783031476648

Self-expression learning methods often obtain a coefficient matrix to measure the similarity between pairs of samples. However, directly using all points to represent a fixed sample in a class under the self-expression framework may not be ideal, as points from other classes participate in the representing process. To alleviate this issue, this study attempts to achieve representation learning between points only coming from the same class. In practice, it is easier for data points from the same class to represent each other than that from different classes. So, when reconstructing a point, if the number of non-zero elements in the coefficient vector is limited, a model is more likely to select data points from the class where the reconstructed point lies to complete the reconstruction work. Based on this idea, we propose Sparse Subspace Clustering with the l0 inequality constraint (SSC- l0 ). In SSC- l0, the l0 inequality constraint determines the maximum number of non-zero elements in the coefficient vector, which helps SSC- l0 to conduct representation learning among the points in the same class. After introducing the simplex constraint to ensure the translation invariance of the model, an optimization method concerning l0 inequality constraint is formed to solve the proposed SSC- l0, and its convergence is theoretically analyzed. Extensive experiments on well-known datasets demonstrate the superiority of SSC- l0 compared to several state-of-the-art methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Sparsity Aware of TF-IDF Matrix to Accelerate Oblivious Document Ranking and Retrieval

Sparsity Aware of TF-IDF Matrix to Accelerate Oblivious Docu...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Zeshi Zhang Guangping Xu Hongzhang Yang Yulei Wu School of Computer Science and Engineering Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China Ministry of Education Key Laboratory of Computer Vision and System China Faculty of Engineering University of Bristol Bristol U.K.

ISBN: (数字)9798350381993

ISBN: (纸本)9798350382006

Due to cloud security concerns, there is an increasing interest in information retrieval systems that can support private queries over public documents. It is desirable for oblivious document ranking and retrieval in public cloud at lower cost and faster speed without revealing query-related information. Currently, the term frequency-inverse document frequency (TF-IDF) and private information retrieval (PIR) techniques are used to solve this problem, but the encryption operation time is over dominant. Motivated by the observation of the sparsity of the TF-IDF matrix, we propose an efficient approach for oblivious document ranking and retrieval, called E-Coeus. It takes advantage of the high sparsity of the TF-IDF matrix to rearrange the matrix. Our method accelerates the speed of PIR inadvertently retrieving documents and reduces the user retrieval delay time. In a stand-alone experiment for a TF-IDF matrix of 1.2M rows and 64K columns with the sparsity of 10%, E-Coeus improves the document ranking and retrieval performance by 23% over the state-of-the-art approach, Coeus. With cluster of 64 machines, E-Coeus improves the performance by 34% over Coeus when the TF-IDF matrix sparsity is 30%.

关键词： Time-frequency analysis Privacy Costs Cloud computing security Information retrieval Encryption Delays

来源：评论

学校读者我要写书评

暂无评论

Automatic web page data extraction through MD5 trigeminal tree and improved BIRCH

Automatic web page data extraction through MD5 trigeminal tr...

引用

2022 International Conference on Electronic Information engineering, Big Data, and computer Technology, EIBDCT 2022

作者： Gong, Jibing Kou, Xiaomeng Zhang, Hanyun Peng, Jiquan Gong, Shishan Wang, Shuli School of Information Science and Engineering Yanshan University Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao066004 China Key Laboratory for Software Engineering of Hebei Province Yanshan University Qinhuangdao066004 China School of Information Science Yanshan University Qinhuangdao066004 China

ISBN: (纸本)9781510655133

This paper proposes an automatic data extraction algorithm for web pages based on noise reduction and visualization blocks' construction. In this algorithm, we first build an MD5 trigeminal tree of the web page's source files using a Message-Digest Algorithm. And then we arrange some noise reduction. Finally, we construct visualization blocks by an optimized cluster algorithm named BIRCH A-CF which could create an area clustering feature forest and complete the clustering by dynamically changing the circle's radius according to the correction factor. We perform experiments on eight different datasets to compare our method with eight baseline methods. The experimental results show that our approach outperforms current methods by providing more accuracy and robustness, it also accelerates noise reduction and reduces the number of nodes effectively. © 2022 SPIE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Deep Q-learning Sampling Based on Advantages 5

Deep Q-learning Sampling Based on Advantages

引用

5th International Conference on Intelligent Robotics and Control engineering, IRCE 2022

作者： Xie, Ming Ren, Xinrui Yu, Jianbo Shu, Feng Shanghai Engineering Research Center of Ultra-Precision Motion Control and Measurement Academy for Engineering and Technology Fudan University Shanghai China School of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai China School of Microelectronics Fudan University State Key Laboratory of ASIC and System Shanghai200433 China

ISBN: (数字)9781665469951

ISBN: (纸本)9781665469951

Deep Q-learning (DQN) has shown recent success on a wide range of complicated sequential decision-making issues, especially in the classic control area. However, in most DQN training, the sampling policies, particularly the ϵ-greedy policy and its derivation rules, produce noise erroneously due to the unsteadiness and unreliability of Q values utilized for searching for optimum actions. We begin with a fundamental hypothesis: complete advantages-based exploitation may be employed to help in successful exploration, and the gap between advantages on outstanding and poor actions tends to extend during the early phases of training before stabilizing. We then present a novel DQN architecture with a superior sampling policy that is totally and directly based on advantage values. This new DQN is named A-sampling DQN, and it requires minor code changes based on the original DQN codes. In most cases, A-sampling DQN and its derivatives outperformed the traditional DQN method. © 2022 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Towards Survivable In-Memory Stores with Parity Coded NVRAM

Towards Survivable In-Memory Stores with Parity Coded NVRAM

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Zhixuan Wang Guangping Xu Hongzhang Yang Yulei Wu School of Computer Science and Engineering Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China Key Laboratory of Computer Vision and System Ministry of Education China Faculty of Engineering University of Bristol Bristol U.K.

ISBN: (数字)9798350381993

ISBN: (纸本)9798350382006

Erasure codes have been widely applied to in-memory key-value storage systems for high reliability and low redundancy. In distributed in-memory key-value storage systems, update operations are relatively frequent, especially the partial-stripe update, which makes data update more challenging. Recently, existing research has been based on appending logs to accelerate parity data write. However, its logs are stored on disks, which decreases the system performance significantly. Therefore, we propose a novel in-memory key-value storage architecture, DNVPL, which utilizes NVRAM to log parity data. Our main idea is to design an appending-only update scheme to tradeoff the memory cost and the update overhead. We implement DNVPL with an in-memory key-value storage prototype, called LogKV. We evaluate it with different workloads. The experiments show that our scheme achieves high update performance from different metrics. Our scheme can reduce update latency by up to 49% and save storage space by 48% compared to the state-of-the-art schemes.

关键词： Privacy Nonvolatile memory system performance Redundancy Random access memory Prototypes computer architecture

来源：评论

学校读者我要写书评

暂无评论

AdvSwap: Covert Adversarial Perturbation with High Frequency Info-swapping for Autonomous Driving Perception

arXiv

引用

arXiv 2025年

作者： Huang, Yuanhao Zhang, Qinfan Xing, Jiandong Cheng, Mengyue Yu, Haiyang Ren, Yilong Xiong, Xiao School of Transportation Science and Engineering Beihang University Beijing100191 China State Key Lab of Intelligent Transportation System Beijing100191 China Zhongguancun Laboratory Beijing100094 China Department of Electrical and Computer Engineering University of Alberta Edmonton Canada

Perception module of Autonomous vehicles (AVs) are increasingly susceptible to be attacked, which exploit vulnerabilities in neural networks through adversarial inputs, thereby compromising the AI safety. Some researches focus on creating covert adversarial samples, but existing global noise techniques are detectable and difficult to deceive the human visual system. This paper introduces a novel adversarial attack method, AdvSwap, which creatively utilizes wavelet-based high-frequency information swapping to generate covert adversarial samples and fool the camera. AdvSwap employs invertible neural network for selective high-frequency information swapping, preserving both forward propagation and data integrity. The scheme effectively removes the original label data and incorporates the guidance image data, producing concealed and robust adversarial samples. Experimental evaluations and comparisons on the GTSRB and nuScenes datasets demonstrate that AdvSwap can make concealed attacks on common traffic targets. The generates adversarial samples are also difficult to perceive by humans and algorithms. Meanwhile, the method has strong attacking robustness and attacking transferability. © 2025, CC BY-NC-ND.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MBAPIS: Multi-Level Behavior Analysis Guided Program Interval Selection for Microarchitecture Studies

MBAPIS: Multi-Level Behavior Analysis Guided Program Interva...

引用

International Conference on Parallel Architecture and Compilation Techniques (PACT)

作者： Hongwei Cui Yujie Cui Honglan Zhan Shuhao Liang Xianhua Liu Chun Yang Xu Cheng Engineering Reserach Center of Microprocessor & System Ministry of Education School of Computer Science Peking University Beijing National Key Laboratory for Multimedia Information Processing School of Computer Science Peking University Beijing

Understanding program behavior is crucial in computer architecture research, but the growing size of benchmarks makes analyzing and simulating entire programs increasingly challenging. In practice, researchers often select representative program intervals for analysis and testing. These intervals are different sections of continuous execution of a program. SimPoint is a well-known method for selecting representative intervals using hardware-independent information. However, when focusing on a specific microarchitecture study, it is desirable to select intervals that are more relevant to that study. For instance, intervals with more branch mispredictions are more appropriate for branch prediction studies. We refer to these intervals as “tailored intervals” for branch prediction studies. This paper presents a Multi-level Behavior Analysis guided Program Interval Selection (MBAPIS) for selecting tailored intervals. For a given microarchitecture study, the first level of MBAPIS uses hardware performance counters to prioritize selecting the intervals that exhibit clearer microarchitectural characteristics relevant to that study. The second level analyzes the processor performance bottlenecks to further select the intervals where the concerned microarchitecture design more strongly impacts performance. Finally, MBAPIS performs clustering analysis with the basic block information of each interval selected by the first two levels, and selects the representative intervals among them while preserving the diverse software behavior. Additionally, we present a general and extensible interval-replaying design to accurately re-execute selected intervals. The SPEC CPU2006 and CPU2017 benchmarks are used for evaluation. The results demonstrate that MBAPIS can select representative and tailored intervals for two typical microarchi-tecture studies and deliver accurate estimates of the concerned hardware events for all tailored intervals in each benchmark, with an average error rate of

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Website Fingerprinting Attack Based on Parameter Prediction Model for Conceptual Drift

A Website Fingerprinting Attack Based on Parameter Predictio...

引用

Software system and Information Processing (ICSSIP), IEEE International Conference on

作者： Jian Cui Taizhong Xu Li Zhao Shuai Han College of Computer Science and Technology Harbin Engineering University Harbin China National Computer Network Emergency Response Technical Team Coordination Center of China Beijing China School of Electrical and Information Engineering Yunnan Minzu University Yunnan Key Laboratory of Unmanned Autonomous System Kunming China

ISBN: (数字)9798331506131

ISBN: (纸本)9798331506148

Website content updates and changes in the network environment can lead to concept drift, significantly impacting the performance of existing website fingerprinting methods. Recent research has focused on transfer learning-based approaches for concept drift adaptation to address this issue with limited samples. These methods involve pre-training a robust feature extractor and fine-tuning the classifier with a few samples. However, the effectiveness of these classifiers is highly dependent on the distributional gap between pre-training and fine-tuning datasets. As the divergence increases, more fine-tuning data is required to maintain classification performance. Consequently, existing methods struggle to achieve effective website identification tasks under severe concept drift with limited tuning data. To overcome these limitations, we propose a model parameter prediction approach, which adapts to new domains from data and model perspectives to enhance website identification performance. The proposed method predicts future model parameters to mitigate the effects of distributional changes, effectively adapting to evolving network environments. Experimental results demonstrate that our approach achieves significant improvements in accuracy, particularly under scenarios with limited tuning data and substantial concept drift.

关键词： Adaptation models Accuracy Concept drift Predictive models Fingerprint recognition Feature extraction Data models Robustness Long short term memory Tuning

来源：评论

学校读者我要写书评

暂无评论

Research on Fault Diagnosis Method Based on Structural Causal Model in Tennessee Eastman Process 7th

Research on Fault Diagnosis Method Based on Structural Causa...

引用

7th International Conference on Computing, Control and Industrial engineering, CCIE 2023

作者： Pu, Haoyuan Liu, Jie Chen, Zhi Yang, Xiaohua Ren, Changan Xu, Zhuoran Jian, Yifan School of Computer Science University of South China Hengyang China Science and Technology on Reactor System Design Technology Laboratory Nuclear Power Institute of China Chengdu China Intelligent Equipment Software Evaluation Engineering Technology Research Center of Hunan Hengyang China CNNC Key Laboratory on High Trusted Computing Hengyang China School of Nuclear Science and Technology University of South China Hengyang China

ISBN: (纸本)9789819927296

In the practical application of fault diagnosis in large-scale chemical systems, due to the danger of faults, the machine learning diagnosis methods used in current research often face the problem of scarcity of fault samples. This makes it difficult for the model to be trained effectively, thus affecting the fault detection rate of the model. Therefore, for the fault diagnosis of chemical system with small sample data, this paper proposes a diagnostic method that uses structural causal model to further combine the diagnostic results of the two machine learning methods, thereby improving global diagnostic performance. With the help of powerful system description ability of structural causal model, we can establish a causal graph for diagnostic process of the chemical system, and accurately construct the corresponding structural equations for the various diagnostic results of the two machine learning methods to combine them, thus improve the fault detection rate. The global results make up for the shortcomings of single machine learning method in small sample chemical system fault diagnosis. The verification on the chemical system simulation platform Tennessee Eastman process shows that, compared with the diagnosis results of the selected Gaussian Naive Bayes method and the K-nearest neighbour method, the results obtained by our method are effectively improved in fault detection rate of each fault in TEP. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Failure analysis

来源：评论

学校读者我要写书评

暂无评论

On the Outage of Far-Reach Communications via RIS-Empowered Satellites

On the Outage of Far-Reach Communications via RIS-Empowered ...

引用

IEEE Pacific Rim Conference on Communications, computers and Signal Processing

作者： Fan Wang Ruihong Jiang Yuan Liu Tingnan Bao Mugen Peng State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Zhejiang Laboratory Research Center for Space Computing System Hangzhou China School of Electrical Engineering and Computer Science University of Ottawa Ottawa ON Canada

ISBN: (数字)9798350362312

ISBN: (纸本)9798350362329

The rising demand for reliable, high-bandwidth satellite communications in far-reach areas drives the integration of low earth orbit (LEO) satellites into future 6G networks. In this paper, we investigate the deployment of reconfigurable intelligent surface (RIS) technology and rate splitting multiple access (RSMA) within LEO satellite systems to improve communication quality and system capacity. We derive closed-form expressions for outage probability (OP) and reliable throughput that validate the theoretical advantages of these technologies under various signal-to-noise ratio conditions. Numerical results demonstrate that, compared with traditional space division multiple access (SDMA) and non-orthogonal multiple access (NOMA) approaches, our RSMA and RIS-integrated framework significantly can reduce OP and enhance reliable throughput with an appropriate power-splitting factor, showcasing its superiority in RIS-enabled satellite communication scenarios.

关键词： NOMA Satellites Closed-form solutions computer network reliability Low earth orbit satellites Reconfigurable intelligent surfaces Reliability theory Throughput Multiaccess communication Satellite communications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：