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

2022 2nd International Conference on Communication technology and Information technology, ICCTIT 2022

作者： Li, Shuang Zhang, Xin Zhou, Yue Zhang, Meng School of Computer Science Fudan University 200433 China Shanghai Key Laboratory of Computer Software Testing and Evaluating Shanghai Development Center of Computer Software Technology 201112 China

With the increasing requirement of people, the functions of in-vehicle infotainment systems are becoming more and more abundant, and their security also affects the safety of vehicles. Therefore, it is more and more important to evaluate the security of the IVI system. This paper proposes a security evaluation framework for in-vehicle infotainment systems based on threat analyses and penetration tests. By constructing the data flow diagram of application scenarios, analyzing threats, combing the attack link diagram, combining white-box audit and black-box test, we use the characteristics of high efficiency of automatic tools and high accuracy of manual methods to set factor sets, and then the whole IVI system is evaluated by Analytic Hierarchy Process and Fuzzy Comprehensive Evaluation. © Published under licence by IOP Publishing Ltd.

关键词： Data flow analysis

来源：评论

学校读者我要写书评

暂无评论

ICCG:low-cost and efficient consistency with adaptive synchronization for metadata replication

引用

Frontiers of computer Science 2025年第1期19卷 53-70页

作者： Chenhao ZHANG Liang WANG Jing SHANG Zhiwen XIAO Limin XIAO Meng HAN Bing WEI Runnan SHEN Jinquan WANG State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China School of Cyberspace Security Hainan UniversityHaikou 570228China China Mobile Information Technology Center Beijing 100033China

The rapid growth in the storage scale of wide-area distributed file systems (DFS) calls for fast and scalable metadata management. Metadata replication is the widely used technique for improving the performance and scalability of metadata management. Because of the POSIX requirement of file systems, many existing metadata management techniques utilize a costly design for the sake of metadata consistency, leading to unacceptable performance overhead. We propose a new metadata consistency maintenance method (ICCG), which includes an incremental consistency guaranteed directory tree synchronization (ICGDT) and a causal consistency guaranteed replica index synchronization (CCGRI), to ensure system performance without sacrificing metadata consistency. ICGDT uses a flexible consistency scheme based on the state of files and directories maintained through the conflict state tree to provide an incremental consistency for metadata, which satisfies both metadata consistency and performance requirements. CCGRI ensures low latency and consistent access to data by establishing a causal consistency for replica indexes through multi-version extent trees and logical time. Experimental results demonstrate the effectiveness of our methods. Compared with the strong consistency policies widely used in modern DFSes, our methods significantly improve the system performance. For example, in file creation, ICCG can improve the performance of directory tree operations by at least 36.4 times.

关键词： metadata management metadata replication consistency directory tree replica index

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Hallucination and Robustness for Large Language Models 23

Evaluation of Hallucination and Robustness for Large Languag...

引用

23rd IEEE International Conference on software Quality, Reliability, and Security Companion, QRS-C 2023

作者： Hu, Rui Zhong, Junhao Ding, Minjie Ma, Zeyu Chen, Mingang Shanghai Development Center of Computer Software Technology Shanghai Key Laboratory of Computer Software Testing and Evaluating Shanghai China Shanghai AI Industry Association Shanghai China

ISBN: (纸本)9798350359398

As large language models (LLMs) rapidly advance, rigorous testing and evaluation of these models grows increasingly crucial. To address this need, we have developed three types of questions: Chinese contextual, English contextual, and language context-independent. Testing in both Chinese and English probes the LLMs' hallucination tendencies. We investigate the impact of language on hallucinations from two perspectives: The type of language used in the input prompt and the cultural context underlying the prompt's content. Additionally, 52 multi-domain single-choice questions from C-EVAL are presented in original and randomized order to assess robustness to perturbations. Among the five LLMs, the tests demonstrate GPT-4 has the strongest anti-hallucination and robustness capabilities, answering with greater accuracy, consistency, and reliability. ChatGLM ranks second and outperforms GPT-4 on Chinese context-dependent questions. Emergent testing phenomena are analyzed from the user's perspective. Hallucinated responses are categorized and potential causal factors leading to hallucination and fragility are examined. Based on these findings, viable avenues for improvement are proposed. © 2023 IEEE.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Multi-scale Texture Network for Industrial Surface Defect Detection 1st

Multi-scale Texture Network for Industrial Surface Defect De...

引用

1st International Conference on Applied Intelligence, ICAI 2023

作者： Wang, Liqiong Huang, Yan Kong, Fanrong Hubei Tobacco Industry Co. Ltd. Hubei430040 China Shanghai Development Center of Computer Software Technology Shanghai201112 China

ISBN: (纸本)9789819708260

Automated surface defect detection is crucial for ensuring product quality in industrial settings. This paper presents a multi-scale texture network that addresses this challenge by effectively analyzing textures at various scales. The proposed network incorporates a "Multi-Scale Texture Feature Processing" module to generate multi-scale texture tokens for comprehensive surface analysis. Additionally, a "Multi-Head Feature Encoding" mechanism captures local details and global patterns, leading to improved accuracy. Besides, we introduce a multi-scale perceptual loss function that guides training by optimizing images at different scales while preserving perceptual similarity. Experimental results demonstrate the effectiveness of our approach, offering high accuracy in automated surface defect detection. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Surface analysis

来源：评论

学校读者我要写书评

暂无评论

A Zero-Knowledge Set Membership Proof Scheme Based on the SM2 Algorithm 24

A Zero-Knowledge Set Membership Proof Scheme Based on the SM...

引用

2024 Guangdong-Hong Kong-Macao Greater Bay Area International Conference on Digital Economy and Artificial Intelligence, DEAI 2024

作者： Zhou, Yin Dai, Bingrong Li, Chao School of Computer and Information Engineering Shanghai Polytechnic University My Street Shanghai201209 China Department of Computing Shanghai Development Center of Computer SoftWare Technology Shanghai201102 China

ISBN: (纸本)9798400717147

With the widespread application of blockchain technology, various range proof protocols based on zero-knowledge proofs have been proposed. However, existing range proof protocols suffer from issues such as high communication overhead and computational complexity. Therefore, this paper introduces an efficient and secure Zero-Knowledge Set Membership Proof Protocol (ZSMPP) to address these challenges. Building upon improvements to the proof structure of range proof protocols, the paper integrates the SM2 identity-based digital signature algorithm, effectively avoiding the time-consuming bilinear pairing operations and reducing computational costs. The proposed protocol offers an efficient and secure solution for the given problem. Experimental results demonstrate that, compared to protocols proposed by Bootle, Deng, Mao, and others, the protocol presented in this paper exhibits superior computational efficiency, providing an efficient and secure solution for data security and individual privacy protection in the digital age. © 2024 ACM.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Research on stream processing engine and benchmarking framework 19

Research on stream processing engine and benchmarking framew...

引用

19th IEEE International Conference on Networking, Sensing and Control, ICNSC 2022

作者： Le, Qionghua Chen, Mingang Chen, Wenjie Shanghai Development Center of Computer Software Technology Shanghai Key Laboratory of Computer Software Testing and Evaluating Shanghai China

ISBN: (纸本)9781665472432

Stream computing engine is an important part of big data system, and benchmarking is one of the main means to measure the engine's performance. In this paper, we compare the differences between two engines, Spark Streaming and Flink, in stream processing technologies. Then the open source benchmarking frameworks supporting stream processing and their respective characteristics are studied, and the HiBench testing framework is selected to test the two stream processing engines. The test results show that Flink is better than Spark Streaming in terms of performance in shuffle, stateful computation and windowed computation. © 2022 IEEE.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

KRLGI: Knowledge Representation Learning Based on Global Information for Reasoning 36

KRLGI: Knowledge Representation Learning Based on Global Inf...

引用

36th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2024

作者： Wu, Bo Mao, Yingchi Chi, Fudong Liu, Yingjie Ding, Silong Qi, Rongzhi Hohai University College of Computer Science and Software Engineering Nanjing China Huaneng Lancang River Hydropower Inc Technology Research and Development Center Kunming China

ISBN: (纸本)9798331527235

Knowledge Graph Reasoning based on Representation Learning maps the entities and relations into a vector space, assessing entity-pair similarities to deduce unknown facts. However, existing methods focus solely on the local importance of entities and ignore isolated entities, leading to the issue of missing feature information. To solve this, we propose Knowledge Representation Learning based on Global Information (KRLGI). KRLGI adopts an attention-based biased random walk algorithm to obtain global information and determine the importance of global entities. The global entity importance goes through a conversion into attention weights, and these weights are integrated with the local entity importance. Subsequently, the local and global entity importance can be used together to represent entity embeddings. Globally integrated representations can reveal richer semantics and enhance reasoning capabilities. Experimental results indicate that KRLGI outperforms other baselines in reasoning accuracy on four public datasets. Notably, on the FB15k-237 dataset, KRLGI shows significant improvements over the best baseline, with increases of 6.37% in MRR, 2.5% in HITS@1, and 5.5% in HITS@10. © 2024 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

LRIRL: Improving Knowledge Graph Reasoning through Representation Learning-Based Rule Induction 36

LRIRL: Improving Knowledge Graph Reasoning through Represent...

引用

36th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2024

作者： Liu, Yingjie Mao, Yingchi Chit, Fudong Wu, Bo Ding, Silong Qi, Rongzhi College of Computer Science and Software Engineering Hohai University Nanjing China Huaneng Lancang River Hydropower Inc Technology Research and Development Center Kunming China

ISBN: (纸本)9798331527235

Rule induction is an important approach for reasoning over Knowledge Graphs. Existing works mainly rely on searching for rule instances within the Knowledge Graph to induce rules. However, this approach may generate a vast search space, leading to inefficiency and difficulty in discovering rules that lack instance support. We propose a Logical Rule Induction based on Representation Learning (LRIRL) method, which can mine rules at the pattern level. By computing rule scores through vector representations of the rules, LRIRL can avoid the inefficiency caused by directly searching for rule instances in a vast search space. Furthermore, by incorporating the deductive nature of logical rules into the rule induction process, LRIRL can mine and evaluate rules even in the absence of rule instances. The generated rules can be used to perform more efficient and accurate reasoning tasks on the Knowledge Graph. Experimental results demonstrate that LRIRL outperforms baselines in both reasoning accuracy and rule mining efficiency on public datasets. Compared to the best baseline, LRIRL can achieve an average accuracy improvement of 3.43% in MRR, 1.40% in HITS@1, and 1.80% in HITS@10. Moreover, LRIRL can reduce rule mining time by an average of approximately 35% compared to the best baseline. © 2024 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

DeepTD: Diversity-Guided Deep Neural Network Test Generation 9th

DeepTD: Diversity-Guided Deep Neural Network Test Generation

引用

9th International Symposium on Dependable software Engineering: Theories, Tools and Applications, SETTA 2023

作者： Zhu, Jin Tao, Chuanqi Guo, Hongjing Ju, Yue College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Ministry Key Laboratory for Safety-Critical Software Development and Verification Nanjing China State Key Laboratory for Novel Software Technology Nanjing China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing China

ISBN: (纸本)9789819986637

Coverage-guided Fuzz Testing (CGF) techniques have been applied to deep neural network (DNN) testing in recent years, generating a significant number of test samples to uncover inherent defects in DNN models. However, the effectiveness of CGF techniques that utilize structured coverage metrics as coverage criteria is currently being questioned. A few unstructured coverage metrics, such as surprise adequacy, only take into account the diversity of the test samples against the training set, while ignoring the diversity of the test samples themselves. In addition to this, the existing surprise adequacy metrics have some limitations in their applications. Therefore, this paper proposes DeepTD, a diversity-guided deep neural networks test generation method. Firstly, DeepTD selects high-loss test samples from each class on average, ensuring these test seeds possess a strong ability to reveal model errors. Then, DeepTD transforms these test seeds to enhance the diversity of the generated samples. Finally, Cluster-based Surprise Adequacy is designed to guide the generation of test samples. To evaluate the effectiveness of DeepTD, six DNN models are selected as subjects, covering two well-known image datasets. Experimental results demonstrate that the Cluster-based Surprise Adequacy outperforms the two existing metrics not only in computational efficiency but also in discovering more model defects. What’s more, the test samples generated by DeepTD are on average 6.04% and 3.24% more effective for model retraining in MNIST and CIFAR10 compared to baseline methods, respectively. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Coverage-guided fuzz testing Deep neural network Test generation Test samples diversity

来源：评论

学校读者我要写书评

暂无评论

Distributed Truss Computation in Dynamic Graphs

引用

Tsinghua Science and technology 2023年第5期28卷 873-887页

作者： Ziwei Mo Qi Luo Dongxiao Yu Hao Sheng Jiguo Yu Xiuzhen Cheng School of Computer Science and Technology Shandong UniversityQingdao 266200China State Key Laboratory of Software Development Environment School of Computer Science and Engineering and the Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang UniversityBeijing 100191China Big Data Institute Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China

Large-scale graphs usually exhibit global sparsity with local cohesiveness,and mining the representative cohesive subgraphs is a fundamental problem in graph *** k-truss is one of the most commonly studied cohesive subgraphs,in which each edge is formed in at least k 2 triangles.A critical issue in mining a k-truss lies in the computation of the trussness of each edge,which is the maximum value of k that an edge can be in a *** works mostly focus on truss computation in static graphs by sequential ***,the graphs are constantly changing dynamically in the real *** study distributed truss computation in dynamic graphs in this *** particular,we compute the trussness of edges based on the local nature of the k-truss in a synchronized node-centric distributed *** decomposing the trussness of edges by relying only on local topological information is possible with the proposed distributed decomposition ***,the distributed maintenance algorithm only needs to update a small amount of dynamic information to complete the *** experiments have been conducted to show the scalability and efficiency of the proposed algorithm.

关键词： distributed algorithm dynamic graph graph mining cohesive subgraph k-truss

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：