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

Community discovery method based on complex network of data fusion based on the super network perspective

International Journal of Computers and Applications 2021年第4期43卷 383-390页

作者： Pei, Li School of Computer Science & Technology Xi‘an University of Posts and Telecommunications Xi‘an China Shaanxi Key Laboratory of Network Data Intelligent Processing Xi‘an University of Posts and Telecommunications Xi‘an China Ministry of Education Key Lab For Intelligent Networks and Network Security Xi‘an Jiaotong University Xi‘an China

To enhance the computational efficiency and precision of community discovery, a community discovery algorithm with the mixed label based on the minimum description length (MDI) of information compression is proposed in this paper. Firstly, the community detection is converted to the information compression problem of seeking for an effective network structure and the quality evaluation function is constructed based on the MDL criterion. Secondly, the community discovery algorithm with heuristic mixed label movement is constructed based on the label node movement algorithm and Louvain community addition algorithm so as to reduce the quality evaluation function. Finally, the simulation experiment in the standard test set and API capture Sina microblog dataset shows that the proposed algorithm is superior to the selected comparison algorithm in computational efficiency and precision. © 2018 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

New results on quantum boomerang attacks

引用

Quantum Information Processing 2023年第4期22卷 1-27页

作者： Zou, Hongkai Zou, Jian Luo, Yiyuan College of Computer and Data Science Fuzhou University Fuzhou China Key Lab of Information Security of Network Systems Fuzhou University Fuzhou China School of Information Sciences and Technology Huizhou University Huizhou China

At SAC 2021, Frixons et al. proposed quantum boomerang attacks that can effectively recover the keys of block ciphers in the quantum setting. Based on their work, we further consider how to quantize the generic boomerang attacks proposed by Biham et al. at FSE 2002, so as to obtain more generic quantum boomerang attacks. Similar to Frixons et al.’s work, we only consider quantum key recovery attacks in the single-key setting. With the help of some famous quantum algorithms, this paper presents two methods to convert the attacks of Biham et al. into some new quantum key recovery attacks. In order to proof our methods, we apply our new ideas to attack Serpent-256 and ARIA-196. To sum up, for Serpent-256, we give valid 9-round and 10-round quantum key recovery attacks respectively. The quantum time complexity of 9-round and 10-round of Serpent-256 is 2 115.43 and 2 126.6 respectively. Furthermore, we show a valid quantum key attack on 6-round ARIA-196 which has a time complexity of 2 89.8 with negligible memory. The time complexity of the above quantum attacks are better than the corresponding classical attacks and quantum generic key recovery attack via Grover’s algorithm. © 2023, The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature.

关键词： Quantum theory

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of an Anomaly-Detection Algorithm for keystroke-Typing Based Insider Detection

引用

Tsinghua science and technology 2018年第5期23卷 513-525页

作者： Liang He Zhixiang Li Chao Shen National Key Laboratory of Science and Technology on Blind Signal Processing Chengdu 610041 China Ministry of Education Key Lab for Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an 710004 China

keystroke dynamics is the process to identify or authenticate individuals based on their typing rhythm behaviors. Several classifications have been proposed to verify a user＇s legitimacy, and the performances of these classifications should be confirmed to identify the most promising research direction. However, classification research contains several experiments with different conditions such as datasets and methodologies. This study aims to benchmark the algorithms to the same dataset and features to equally measure all performances. Using a dataset that contains the typing rhythm of 51 subjects, we implement and evaluate 15 classifiers measured by Fl-measure, which is the harmonic mean of a false-negative identification rate and false-positive identification rate. We also develop a methodology to process the typing data. By considering a case in which the model will reject the outsider, we tested the algorithms on an open set. Additionally, we tested different parameters in random forest and k nearest neighbors classifications to achieve better results and explore the cause of their high performance. We also tested the dataset on one-class classification and explained the results of the experiment. The top-performing classifier achieves an Fl-measure rate of 92% while using the normalized typing data of 50 subjects to train and the remaining data to test. The results, along with the normalization methodology, constitute a benchmark for comparing the classifiers and measuring the performance of keystroke dynamics for insider detection.

关键词： keystroke dynamics insider identification Fl-measure normalization one-class classification

来源：评论

学校读者我要写书评

暂无评论

Modeling topical relevance for multi-turn dialogue generation 29

Modeling topical relevance for multi-turn dialogue generatio...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Zhang, Hainan Lan, Yanyan Pang, Liang Chen, Hongshen Ding, Zhuoye Yin, Dawei CAS Key Lab of Network Data Science and Technology Institute of Computing Technology CAS China *** Beijing China University of Chinese Academy of Sciences China

ISBN: (纸本)9780999241165

Topic drift is a common phenomenon in multi-turn dialogue. Therefore, an ideal dialogue generation models should be able to capture the topic information of each context, detect the relevant context, and produce appropriate responses accordingly. However, existing models usually use word or sentence level similarities to detect the relevant contexts, which fail to well capture the topical level relevance. In this paper, we propose a new model, named STAR-BTM, to tackle this problem. Firstly, the Biterm Topic Model is pre-trained on the whole training dataset. Then, the topic level attention weights are computed based on the topic representation of each context. Finally, the attention weights and the topic distribution are utilized in the decoding process to generate the corresponding responses. Experimental results on both Chinese customer services data and English Ubuntu dialogue data show that STAR-BTM significantly outperforms several state-of-the-art methods, in terms of both metric-based and human evaluations. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Stars

来源：评论

学校读者我要写书评

暂无评论

Match-SRNN: Modeling the recursive matching structure with spatial RNN 25

Match-SRNN: Modeling the recursive matching structure with s...

引用

25th International Joint Conference on Artificial Intelligence, IJCAI 2016

作者： Wan, Shengxian Lan, Yanyan Xu, Jun Guo, Jiafeng Pang, Liang Xueqi, Cheng CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China

Semantic matching, which aims to determine the matching degree between two texts, is a fundamental problem for many NLP applications. Recently, deep learning approach has been applied to this problem and significant improvements have been achieved. In this paper, we propose to view the generation of the global interaction between two texts as a recursive process: i.e. the interaction of two texts at each position is a composition of the interactions between their prefixes as well as the word level interaction at the current position. Based on this idea, we propose a novel deep architecture, namely Match-SRNN, to model the recursive matching structure. Firstly, a tensor is constructed to capture the word level interactions. Then a spatial RNN is applied to integrate the local interactions recursively, with importance determined by four types of gates. Finally, the matching score is calculated based on the global interaction. We show that, after degenerated to the exact matching scenario, Match-SRNN can approximate the dynamic programming process of longest common subsequence. Thus, there exists a clear interpretation for Match-SRNN. Our experiments on two semantic matching tasks showed the effectiveness of Match-SRNN, and its ability of visualizing the learned matching structure.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Robust and Passive Motion Detection with COTS WiFi Devices

引用

Tsinghua science and technology 2017年第4期22卷 345-359页

作者： Hai Zhu Fu Xiao Lijuan Sun Xiaohui Xie Panlong Yang Ruchuan Wang the College of Computer Nanjing University of Posts and Telecommunications the Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Key Lab of Broadband Wireless Communication and Sensor Network Technology of Ministry of Education and College of Computer Nanjing University of Posts and Telecommunications the College of Computer Science and Technology University of Science and Technology of China

Device-free Passive（DfP） detection has received increasing attention for its ability to support various pervasive applications. Instead of relying on variable Received Signal Strength（RSS）, most recent studies rely on finer-grained Channel State Information（CSI）. However, existing methods have some limitations, in that they are effective only in the Line-Of-Sight（LOS） or for more than one moving individual. In this paper, we analyze the human motion effect on CSI and propose a novel scheme for Robust Passive Motion Detection（R-PMD）. Since traditional low-pass filtering has a number of limitations with respect to data denoising, we adopt a novel Principal Component Analysis（PCA）-based filtering technique to capture the representative signals of human motion and extract the variance profile as the sensitive metric for human detection. In addition, existing schemes simply aggregate CSI values over all the antennas in MIMO systems. Instead, we investigate the sensing quality of each antenna and aggregate the best combination of antennas to achieve more accurate and robust detection. The R-PMD prototype uses off-the-shelf WiFi devices and the experimental results demonstrate that R-PMD achieves an average detection rate of 96.33% with a false alarm rate of 3.67%.

关键词： device-free passive detection Received Signal Strength（RSS） channel state information MIMO

来源：评论

学校读者我要写书评

暂无评论

ICTNET at Trec 2019 Decision Track 28

ICTNET at Trec 2019 Decision Track

引用

28th Text REtrieval Conference, TREC 2019

作者： Cui, Wanqing Jiang, Yan Tao, Shuchang Guo, Hanzhang CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China

In this paper we report on our participation in the Trec 2019 Decision Track[1] which aims to provide a venue for research on retrieval methods that promote better decision making with search engines and develop new online and offline evaluation methods to predict the decision making quality induced by search results. We convert this task into a standard information retrieval task and use traditional IR model. Finally we give a summary for the solution of our work. © 2019 28th Text REtrieval Conference, TREC 2019 - Proceedings. All Rights Reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Predict anchor links across social networks via an embedding approach 25

Predict anchor links across social networks via an embedding...

引用

25th International Joint Conference on Artificial Intelligence, IJCAI 2016

作者： Man, Tong Shen, Huawei Liu, Shenghua Jin, Xiaolong Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China

Predicting anchor links across social networks has important implications to an array of applications, including cross-network information diffusion and cross-domain recommendation. One challenging problem is: whether and to what extent we can address the anchor link prediction problem, if only structural information of networks is available. Most existing methods, unsupervised or supervised, directly work on networks themselves rather than on their intrinsic structural regularities, and thus their effectiveness is sensitive to the high dimension and sparsity of networks. To offer a robust method, we propose a novel supervised model, called PALE, which employs network embedding with awareness of observed anchor links as supervised information to capture the major and specific structural regularities and further learns a stable cross-network mapping for predicting anchor links. Through extensive experiments on two realistic datasets, we demonstrate that PALE significantly outperforms the state-of-the-art methods.

关键词： network embeddings

来源：评论

学校读者我要写书评

暂无评论

Controlling Risk of Retrieval-augmented Generation: A Counterfactual Prompting Framework

Controlling Risk of Retrieval-augmented Generation: A Counte...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Chen, Lu Zhang, Ruqing Guo, Jiafeng Fan, Yixing Cheng, Xueqi CAS Key Lab of Network Data Science and Technology ICT CAS Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9798891761681

Retrieval-augmented generation (RAG) has emerged as a popular solution to mitigate the hallucination issues of large language models. However, existing studies on RAG seldom address the issue of predictive uncertainty, i.e., how likely it is that a RAG model's prediction is incorrect, resulting in uncontrollable risks in real-world applications. In this work, we emphasize the importance of risk control, ensuring that RAG models proactively refuse to answer questions with low confidence. Our research identifies two critical latent factors affecting RAG's confidence in its predictions: the quality of the retrieved results and the manner in which these results are utilized. To guide RAG models in assessing their own confidence based on these two latent factors, we develop a counterfactual prompting framework that induces the models to alter these factors and analyzes the effect on their answers. We also introduce a benchmarking procedure to collect answers with the option to abstain, facilitating a series of experiments. For evaluation, we introduce several risk-related metrics and the experimental results demonstrate the effectiveness of our approach. Our code and benchmark dataset are available at https://***/ictbigdatalab/RC-RAG. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Analysis and Measurement of the Displacement Sensor Based on an Up-tapered Mach-Zehnder Interferometer

引用

Chinese Physics Letters 2014年第3期31卷 65-68页

作者： WEN Xiao-Dong NING Ti-Gang YOU Hai-Dong KANG Ze-Xin LI Jing LI Chao FENG Ting YU Shao-Wei JIAN Wei Key Lab of All Optical Network and Advanced Telecommunication Network of Ministry of Education Institute of Lightwave Technology Beijing Jiaotong University Beijing 100044 Science and Information College Qingdao Agricultural University Qingdao 266109

A displacement sensor based on an up-tapered Mach–Zehnder interferometer （MZI） is proposed and demonstrated experimentally. For this purpose, a fiber MZI is fabricated by using a commercial fusion splicer. Then the transmission spectra of the sensors with different middle fiber lengths are measured by bending the MZIs with different movements of the moving stage. The maximum sensitivity of 2.457 nm/mm is achieved while the shifting of the moving stage changes from 3 mm to 3.5 mm. Note that this kind of up-taper configuration is strong in strength, easy to fabricate and low in cost.

关键词： INTERFEROMETERS RESEARCH DETECTORS OPTICAL fibers INTERFEROMETRY PHYSICS research

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：