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

5th International Conference in Electronic Engineering, Information technology and Education, EEITE 2024

作者： Kara, Mostefa Karampidis, Konstantinos Kenioua, Laid Karampidis, Manolis Alshaikh, Muath Papadourakis, Giorgos Laouid, Abdelkader National Higher School of Mathematics Scientific and Technology Hub of Sidi Abdellah Algiers16093 Algeria Hellenic Mediterranean University Department of Electrical and Computer Engineering Crete Greece El Oued University LIAP Laboratory PO Box 789 El Oued39000 Algeria College of Computing and Informatics Saudi Electronic University Computer Science Department Riyadh11673 Saudi Arabia

ISBN: (纸本)9798350372878

Despite their age, passwords are still widely used more than ever. In many cases, it is the solution that best fits the usage scenario. Researchers are proposing innovative designs and methods to support these scenarios. Many systems, especially sensitive ones, need to change the password. Classic systems rely on changing passwords in two stages, the first i s authentication, which usually consists of two or three rounds, and the second is creating a new password (PW), which also consists of two or three rounds. In this paper, a hidden transmission of a new random PW using the previous one is presented, we talk about an authenticated changing of PW. The verifier g enerates half of the new password and sends it to the prover, the prover authenticates the sent message using the old PW and then returns the authentication proof. After checking it, the verifier creates the second half of the PW. The proposed method combines the authentication and change PW processes into one process consisting of 3 rounds. Therefore, the proposal facilitates the process of automatic periodic change of PW between two entities (user, app, system, etc). Analysis and experiments show that our technique is robust, lightweight, and reduces many potential risks in the field. © 2024 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

SoVAR: Building Generalizable Scenarios from Accident Reports for Autonomous Driving Testing

SoVAR: Building Generalizable Scenarios from Accident Report...

引用

IEEE International Conference on Automated Software Engineering (ASE)

作者： An Guo Yuan Zhou Haoxiang Tian Chunrong Fang Yunjian Sun Weisong Sun Xinyu Gao Anh Tuan Luu Yang Liu Zhenyu Chen State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Computer Science and Technology Zhejiang Sci-Tech University Hangzhou China College of Computing and Data Science Nanyang Technological University Singapore

ISBN: (数字)9798400712487

ISBN: (纸本)9798331508241

Autonomous driving systems (ADSs) have undergone remarkable development and are increasingly employed in safety-critical applications. However, recently reported data on fatal accidents involving ADSs suggests that the desired level of safety has not yet been fully achieved. Consequently, there is a growing need for more comprehensive and targeted testing approaches to ensure safe driving. Scenarios from real-world accident reports provide valuable resources for ADS testing, including critical scenarios and high-quality seeds. However, existing scenario reconstruction methods from accident reports often exhibit limited accuracy in information extraction. Moreover, due to the diversity and complexity of road environments, matching current accident information with the simulation map data for reconstruction poses significant *** this paper, we design and implement SoVAR, a tool for automatically generating road-generalizable scenarios from accident reports. SoVAR utilizes well-designed prompts with linguistic patterns to guide the large language model (LLM) in extracting accident information from textual data. Subsequently, it formulates and solves accident-related constraints in conjunction with the extracted accident information to generate accident trajectories. Finally, SoVAR reconstructs accident scenarios on various map structures and converts them into test scenarios to evaluate its capability to detect defects in industrial ADSs. We experiment with SoVAR, using the accident reports from the National Highway Traffic Safety Administration’s (NHTSA) database to generate test scenarios for the industrial-grade ADS Apollo. The experimental findings demonstrate that SoVAR can effectively generate generalized accident scenarios across different road structures. Furthermore, the results confirm that SoVAR identified 5 distinct safety violation types that contributed to the crash of Baidu *** Concepts• Software and its engineering → Software testing an

关键词： Roads Web and internet services Linguistics Software computer crashes Safety Trajectory Data mining Autonomous vehicles Accidents

来源：评论

学校读者我要写书评

暂无评论

Using Lock-Free Design for Throughput-Optimized Cache Eviction 25

Using Lock-Free Design for Throughput-Optimized Cache Evicti...

引用

Abstracts of the 2025 ACM SIGMETRICS International Conference on Measurement and Modeling of computer systems

作者： Chao Dong Fang Wang Hong Jiang Dan Feng Key Laboratory of Information Storage System (Wuhan National Laboratory for Optoelectronics) Engineering Research Center of data storage systems and Technology (School of Computer Science and Technology) Ministry of Education of China Huazhong University of Science and Techonolgy Wuhan Hubei China Department of Computer Science and Engineering University of Texas at Arlington Arlington Texas USA

ISBN: (纸本)9798400715938

This paper presents a practical approach to cache eviction algorithm design, called Mobius, that optimizes the concurrent throughput of caches and reduces cache operation latency by utilizing lock-free data structures, while maintaining high cache hit ratios. Mobius includes two key designs. First, Mobius employs two lock-free FIFO queues to manage cache items, ensuring that all cache operations are executed efficiently in concurrency. Second, Mobius integrates a consecutive detection mechanism that merges multiple modifications during eviction into a single operation, thereby reducing data races. The implementation of Mobius in CacheLib and RocksDB highlights its high concurrency in both synthetic and real-world workloads.

关键词： cache eviction policy

来源：评论

学校读者我要写书评

暂无评论

Adaptive ELM-Based Time-Constrained Control of Uncertain Robotic Manipulators With Minimum Learning Computation

引用

IEEE Transactions on Emerging Topics in computing 2025年

作者： Jin, Xiaozheng Hou, Yuhan Wu, Xiaoming Chi, Jing Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Shandong Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Jinan250013 China Qilu Institute of Technology School of Intelligent Manufacturing and Control Engineering Shandong Jinan250200 China Shandong University of Finance and Economics School of Computing and Artificial Intelligence Shandong Jinan250014 China

This paper studies the extreme learning machine (ELM)-based time-constrained trajectory tracking control of a class of robotic manipulator systems with model/input uncertainties, matched and mismatched disturbances. A uniform robust exact differentiator (URED) is developed to construct a multi-layer virtual control framework of the robotic manipulator system. Under the control framework, adaptive ELM-based control strategies are proposed to suppress the influence of the uncertainties and disturbances layer-by-layer, combining with the minimum learning parameter (MLP) technique which is employed to reduce the calculation complexity of ELM parameters. The significance of this study is that general model/input uncertainties, matched and mismatched disturbances can be effectively compensated within a limited time, so that bounded trajectory tracking of the robotic manipulator can be achieved avoiding the complexity explosion issue. The time-constrained stability of the closed-loop robotic error systems is proved through Lyapunov stability theory. Finally, comparative simulations are employed to display the feasibility and superiority of the designed robust adaptive ELM-based control schemes of a robotic manipulator system. © 2013 IEEE.

关键词： Robust control

来源：评论

学校读者我要写书评

暂无评论

Signature Scheme Based on The SM2 Algorithm in Fabric

Signature Scheme Based on The SM2 Algorithm in Fabric

引用

2021 International Conference on Networking and Network Applications, NaNA 2021

作者： Zhang, Yaling Wang, Hongyun Wang, Yichuan Ji, Wenjiang Zhu, Lei Xi'an University of technology School of computer science and engineering Xi'an China Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an University of technology Xi'an China

ISBN: (纸本)9781665441582

Based on the analysis and research of the widely used Hyperledger Fabric alliance chain structure, this paper proposes a digital signature scheme based on the national cryptographic algorithm SM2 which can be applied to Hyperledger Fabric. Firstly, two elliptic curve public-key cryptography algorithms are analyzed, and the feasibility of the SM2 in Fabric system is studied. Secondly, the Fabric system using the SM2 algorithm is designed and implemented, and the generation process of the Fabric chain address using the SM2 algorithm is given. Finally, experimental verification of the availability and performance of the Fabric system after the replacement of national cryptography algorithms is carried out. The experimental results show that the SM2 interface of the new Fabric alliance chain has good usability, and the average latency is reduced by 51.8%, and the transaction throughput is increased by 33.1%. © 2021 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Datapath Combinational Equivalence Checking With Hybrid Sweeping Engines and Parallelization

arXiv

引用

arXiv 2024年

作者： Chen, Zhihan Zhang, Xindi Qian, Yuhang Cai, Shaowei School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of System Software Chinese Academy of Sciences State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

In the application of IC design for microprocessors, there are often demands for optimizing the implementation of datapath circuits, on which various arithmetic operations are performed. Combinational equivalence checking (CEC) plays an essential role in ensuring the correctness of design optimization. The most prevalent CEC algorithms are based on SAT sweeping, which utilizes SAT to prove the equivalence of the internal node pairs in topological order, and the equivalent nodes are merged. Datapath circuits usually contain equivalent pairs for which the transitive fan-in cones are small but have a high XOR chain density, and proving such node pairs is very difficult for SAT solvers. An exact probability-based simulation (EPS) is suitable for verifying such pairs, while this method is not suitable for pairs with many primary inputs due to the memory cost. We first reduce the memory cost of EPS and integrate it to improve the SAT sweeping method. Considering the complementary abilities of SAT and EPS, we design an engine selection heuristic to dynamically choose SAT or EPS in the sweeping process, according to XOR chain density. Our method is further improved by reducing unnecessary engine calls by detecting regularity. Furthermore, we parallelized the SAT and EPS engines of HYBRIDCEC, leading to the parallel CEC prover. Experiments on a benchmark suite from industrial datapath circuits show that our method is much faster than the state-of-the-art CEC tool namely ABC ‘&cec’ on nearly all instances, and is more than 100× faster on 30% of the instances, 1000× faster on 12% of the instances. In addition, the 64 threads version of our method achieved 77x speedup. Copyright © 2024, The Authors. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Toward digital twin of the ocean: from digitalization to cloning

引用

Intelligent Marine technology and systems 2023年第1期1卷 1-12页

作者： Chen, Ge Yang, Jie Huang, Baoxiang Ma, Chunyong Tian, Fenglin Ge, Linyao Xia, Linghui Li, Jianhui Frontiers Science Center for Deep Ocean Multispheres and Earth System School of Marine Technology Ocean University of China Qingdao China Laboratory for Regional Oceanography and Numerical Modeling Laoshan Laboratory Qingdao China Department of Computer Science and Technology Qingdao University Qingdao China

The forthcoming wave of progress in oceanographic technology is the digital twin of the ocean, a concept that integrates marine big data and artificial intelligence (AI). This development is a logical consequence of combining data science and marine science and is considered superior to previous models, such as the digital ocean, transparent ocean, and smart ocean. Amid the swift advancement of next-generation information technology, the conditions are favorable for developing a prototype digital twin of the ocean, which will integrate various functionalities—data fusion, situation presentation, phenomenon mining, autonomous learning, and intelligent prediction. The salient distinction between a digital twin of the ocean and traditional forms of virtual or augmented reality is because of the intelligence beyond digitalization exhibited by the former, primarily facilitated by AI-based cloning. Hence, herein, we initially propose a structured architecture for the generative digital twin ocean, encompassing elements from real-time data pools to key technologies and proof-of-concept applications. The core components of this prototype system include a data pool, an AI-based oceanographic model, and three-dimensional visualization interactions. Future research and objectives for the digital twin ocean will principally focus on the following: four-dimensional (comprising three-dimensional space along with time) digital cloning and real-time mapping of global ocean parameters, cooperative observation coupled with human–computer interactions, and intelligent prediction along with cutting-edge applications. Prospectively, this transformative technology holds the potential to considerably enhance our understanding of the ocean, yielding groundbreaking discoveries that will profoundly influence the marine economy and sustainable development.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Two-timescale Optimization for E2E Network Slicing-aided Cloud-edge Collaborative Networks

引用

IEEE Transactions on Vehicular technology 2025年第6期74卷 9777-9789页

作者： Wang, Yunfeng Zhao, Liqiang Chu, Xiaoli Song, Shenghui Deng, Yansha Nallanathan, Arumugam Zhou, Guorong Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China Xidian University Guangzhou Institute of Technology Guangzhou510100 China University of Sheffield Department of Electronic and Electrical Engineering SheffieldS10 2TN United Kingdom Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong King's College London Department of Engineering LondonWC2R 2LS United Kingdom Queen Mary University of London School of Electronic Engineering and Computer Science LondonE1 4NS United Kingdom Kyung Hee University Department of Electronic Engineering Gyeonggi-do Yongin-si17104 Korea Republic of

To leverage the synergy between cloud computing (CC) and edge computing (EC) to support various services while reducing the CC/EC switching overhead, the two-timescale utility maximization problem for an end-to-end network slicing-aided cloud-edge collaborative network (E2E-CECN) is formulated covering both the high throughput and low delay service requirements. To solve the utility maximization problem while dynamically adjusting the weights of the E2E-CECN utility to accommodate the variation of users' service requests, we proposed a reward comparison double deep Q network algorithm to optimize the large timescale joint virtual base station activation and CC-EC scheduling, and a reward comparison deep deterministic policy gradient algorithm to optimize the small timescale allocation of backhaul link capacity (BLC), CC/EC capability and transmission power. Numerical results show that both the high-throughput and low-delay service requirements can be satisfied simultaneously under the reasonable BLC usage and power consumption. © 1967-2012 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

A Local Search Algorithm for MaxSMT(LIA)

arXiv

引用

arXiv 2024年

作者： He, Xiang Li, Bohan Zhao, Mengyu Cai, Shaowei Key Laboratory of System Software Chinese Academy of Sciences State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

MaxSAT modulo theories (MaxSMT) is an important generalization of Satisfiability modulo theories (SMT) with various applications. In this paper, we focus on MaxSMT with the background theory of Linear Integer Arithmetic, denoted as MaxSMT(LIA). We design the first local search algorithm for MaxSMT(LIA) called PairLS, based on the following novel ideas. A novel operator called pairwise operator is proposed for integer variables. It extends the original local search operator by simultaneously operating on two variables, enriching the search space. Moreover, a compensation-based picking heuristic is proposed to determine and distinguish the pairwise operations. Experiments are conducted to evaluate our algorithm on massive benchmarks. The results show that our solver is competitive with state-of-the-art MaxSMT solvers. Furthermore, we also apply the pairwise operation to enhance the local search algorithm of SMT, which shows its extensibility. Copyright © 2024, The Authors. All rights reserved.

关键词： Local search (optimization)

来源：评论

学校读者我要写书评

暂无评论

ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization

arXiv

引用

arXiv 2024年

作者： Chen, Zhihan Lin, Peng Hu, Hao Cai, Shaowei Key Laboratory of System Software Chinese Academy of Sciences State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

As a broadly applied technique in numerous optimization problems, recently, local search has been employed to solve Pseudo-Boolean Optimization (PBO) problem. A representative local search solver for PBO is LS-PBO. In this paper, firstly, we improve LS-PBO by a dynamic scoring mechanism, which dynamically strikes a balance between score on hard constraints and score on the objective function. Moreover, on top of this improved LS-PBO, we develop the first parallel local search PBO solver. The main idea is to share good solutions among different threads to guide the search, by maintaining a pool of feasible solutions. For evaluating solutions when updating the pool, we propose a function that considers both the solution quality and the diversity of the pool. Furthermore, we calculate the polarity density in the pool to enhance the scoring function of local search. Our empirical experiments show clear benefits of the proposed parallel approach, making it competitive with the parallel version of the famous commercial solver Gurobi. © 2024, CC BY.

关键词： Local search (optimization)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：