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

CRFs for Digital Signature and NIZK Proof System in Web Services 1

22nd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2022

作者： Kang, Burong Zhang, Lei Yang, Yafang Meng, Xinyu Engineering Research Center of Software/Hardware Co-design Technology and Application Ministry of Education East China Normal University Shanghai200062 China Science and Technology on Communication Security Laboratory Sichuan610041 China Research Institute of China Telecom Corporation Limited Shanghai200062 China School of Computer Science Fudan University Shanghai200433 China

ISBN: (数字)9783031226779

ISBN: (纸本)9783031226762

Web services are service-oriented computing technology which allows computers running different operating domains to access and share each other’s databases. Each web service is an application (like online business) which may require the private information of users. Thus, it will be important to preserve these web users’ individual privacy. The traditional approaches to achieve this goal in web security is to use the cryptographic technologies, such as digital signature, NIZK proof system. Whereas, some recent research results indicate that these cryptographic technologies may suffer from the algorithm substitution attack (ASA). ASA means that the cryptographic technology would be embedded some backdoor in the process of its implementation by the attacker, and with the backdoor information the attacker can steal the user’s private information. To address this problem, the concept of cryptographic reverse firewall (CRF) has been introduced, which could sanitize the messages inputting and outputting the user’s computer. In this paper, we construct the CRFs for the efficient Pointcheval-Sanders (PS) signature as well as the NIZK proof system. © 2023, Springer Nature Switzerland AG.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Domain Adaptive Code Completion via Language Models and Decoupled Domain Databases

Domain Adaptive Code Completion via Language Models and Deco...

引用

IEEE International Conference on Automated software engineering (ASE)

作者： Ze Tang Jidong Ge Shangqing Liu Tingwei Zhu Tongtong Xu Liguo Huang Bin Luo National Key Laboratory for Novel Software Technology Nanjing University China Nanyang Technological University Singapore Huawei Software Engineering Application Technology China Department of Computer Science Southern Methodist University USA

Large Language Models (LLMs) have demonstrated remarkable performance in code completion. However, due to the lack of domain-specific knowledge, they may not be optimal in completing code that requires intensive domain knowledge for example completing the library names. Although there are several works that have confirmed the effectiveness of fine-tuning techniques to adapt language models for code completion in specific domains. They are limited by the need for constant fine-tuning of the model when the project is in constant iteration. To address this limitation, in this paper, we propose $k$ NM-LM, a retrieval-augmented language model (R-LM), that integrates domain knowledge into language models without fine-tuning. Different from previous techniques, our approach is able to automatically adapt to different language models and domains. Specifically, it utilizes the in-domain code to build the retrieval-based database decoupled from LM, and then combines it with LM through Bayesian inference to complete the code. The extensive experiments on the completion of intra-project and intra-scenario have confirmed that $k$ NM-LM brings about appreciable enhancements when compared to CodeGPT and UnixCoder. A deep analysis of our tool including the responding speed, storage usage, specific type code completion, and API invocation completion has confirmed that $k$ NM-LM provides satisfactory performance, which renders it highly appropriate for domain adaptive code completion. Furthermore, our approach operates without the requirement for direct access to the language model's parameters. As a result, it can seamlessly integrate with black-box code completion models, making it easy to integrate our approach as a plugin to further enhance the performance of these models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bounded-DWA: An Efficient Local Planner for Ackermann-driven Vehicles on Sandy Terrain

Bounded-DWA: An Efficient Local Planner for Ackermann-driven...

引用

IEEE International Conference on Real-time Computing and Robotics (RCAR)

作者： Ke Gong Zhiyuan Xu Xinyu Zhang Shanghai Key Laboratory of Trustworthy Computing Engineering Research Center of Software/Hardware Co-Design Technology and Application (MoE) and School of Software Engineering East China Normal University Shanghai Midea Group China

We present a new dynamic window approach (DWA) for mobile vehicles equipped with Ackermann steering geometry that adheres to Ackermann kinematic constraints. By integrating these constraints with the sampling window in DWA, we can further reduce and bound the sampling range and enhance the efficiency of the DWA when a mobile vehicle moves on sandy terrain. Furthermore, we improve the evaluation function to optimize the selected trajectory. Our algorithm is successfully validated in ROS and Gazebo through comparison with other existing local planner such as the original DWA and TEB algorithms. We also successfully deploy our Bounded-DWA in the application of coverage path planning, where tree-planting robots traverse on sandy terrain.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Domain Adaptive Code Completion via Language Models and Decoupled Domain Databases

arXiv

引用

arXiv 2023年

作者： Tang, Ze Ge, Jidong Liu, Shangqing Zhu, Tingwei Xu, Tongtong Huang, Liguo Luo, Bin National Key Laboratory for Novel Software Technology Nanjing University China Nanyang Technological University Singapore Huawei Software Engineering Application Technology China Department of Computer Science Southern Methodist University United States

Large Language Models (LLMs) have demonstrated remarkable performance in code completion. However, due to the lack of domain-specific knowledge, they may not be optimal in completing code that requires intensive domain knowledge for example completing the library names. Although there are several works that have confirmed the effectiveness of fine-tuning techniques to adapt language models for code completion in specific domains. They are limited by the need for constant fine-tuning of the model when the project is in constant iteration. To address this limitation, in this paper, we propose kNM-LM, a retrieval-augmented language model (R-LM), that integrates domain knowledge into language models without fine-tuning. Different from previous techniques, our approach is able to automatically adapt to different language models and domains. Specifically, it utilizes the in-domain code to build the retrieval-based database decoupled from LM, and then combines it with LM through Bayesian inference to complete the code. The extensive experiments on the completion of intra-project and intra-scenario have confirmed that kNM-LM brings about appreciable enhancements when compared to CodeGPT and UnixCoder. A deep analysis of our tool including the responding speed, storage usage, specific type code completion, and API invocation completion has confirmed that kNM-LM provides satisfactory performance, which renders it highly appropriate for domain adaptive code completion. Furthermore, our approach operates without the requirement for direct access to the language model's parameters. As a result, it can seamlessly integrate with black-box code completion models, making it easy to integrate our approach as a plugin to further enhance the performance of these models. Copyright © 2023, The Authors. All rights reserved.

关键词： Domain Knowledge

来源：评论

学校读者我要写书评

暂无评论

An Alternative Algorithm for the Symmetry Classification of Ordinary Differential Equations

引用

Sound & Vibration 2022年第1期56卷 65-76页

作者： Yi Tian Jing Pang College of Data Science and Application Inner Mongolia University of TechnologyHohhot010080China Inner Mongolia Autonomous Region Engineering and Technology Research Center of Big Data Based Software Service Hohhot010080China College of Science Inner Mongolia University of TechnologyHohhot010051China Inner Mongolia Key Laboratory of Statistical Analysis Theory for Life Data and Neural Network Modeling Inner Mongolia University of TechnologyHohhot010051China

This is the first paper on symmetry classification for ordinary differential equations(ODEs)based on Wu’s *** carry out symmetry classification of two ODEs,named the generalizations of the Kummer-Schwarz equations which involving arbitrary ***,Lie algorithm is used to give the determining equations of symmetry for the given equations,which involving arbitrary ***,differential form Wu’s method is used to decompose determining equations into a union of a series of zero sets of differential characteristic sets,which are easy to be solved *** branch of the decomposition yields a class of symmetries and associated *** algorithm makes the classification become direct and *** Dimitrov Bozhkov,and Pammela Ramos da Conceição have used the Lie algorithm to give the symmetry classifications of the equations talked in this paper in *** this paper,we can find that the differential form Wu’s method for symmetry classification of ODEs with arbitrary function(parameter)is effective,and is an alternative method.

关键词： Kummer-Schwarz equation ordinary differential equations(ODEs) differential form Wu’s method

来源：评论

学校读者我要写书评

暂无评论

Research on the Current State of Privacy Risks in Children's Mobile applications 4

Research on the Current State of Privacy Risks in Children's...

引用

4th International Symposium on Computer technology and Information Science, ISCTIS 2024

作者： Geng, Xinrui Liu, Tao Shang, Chong Chen, Jianxiang Lu, Yueran Zhang, Yan Wang, Lifeng Xi'an Jiaotong-Liverpool University School of AI and Advanced Computing Suzhou China MIIT Key Laboratory of Mobile Application Innovation and Governance Technology Beijing China Chinese Academy of Sciences Institute of Information Engineering Beijing China Shanxi Agricultural University School of Agricultural Engineering China Tianjin Normal University School of Software Engineering Tianjin China University of Chinese Academy of Sciences Institute of Information Engineering Chinese Academy of Sciences School of Cyber Security Beijing China Shandong Yeda Smart City Operation Technology Co. Ltd. Shandong China

ISBN: (纸本)9798350354560

In the digital age, children increasingly access a vast world of information through mobile applications. Despite global regulations and protective measures by app stores, privacy breaches in these apps persist. This study investigates privacy issues and threats in children's mobile applications by comparing APKs and legal provisions across different countries. It examines 70 representative children's apps from China, Europe, the U.S., and Japan through static code analysis and dynamic runtime testing. Using a mixed-methods approach, the research identifies integrated third-party services, data transmission protocols, permission requests, and conducts code audits to assess privacy compliance. It also simulates real usage scenarios to track data flow and detect unauthorized data collection and sharing practices. Furthermore, the study compares national privacy laws, focusing on data minimization, parental consent mechanisms, data encryption, and storage duration regulations. The goal is to provide empirical evidence and recommendations for optimizing global children's online privacy protection policies. © 2024 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

ConZone: A Zoned Flash Storage Emulator for Consumer Devices

ConZone: A Zoned Flash Storage Emulator for Consumer Devices

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Dingcui Yu Jialin Liu Yumiao Zhao Wentong Li Ziang Huang Zonghuan Yan Mengyang Ma Liang Shi MoE Engineering Research Center of Software/Hardware Co-Design Technology and Application East China Normal University Shanghai China College of Computer Science and Technology East China Normal University Shanghai China Software Engineering Institute East China Normal University Shanghai China Wuhan National Laboratory for Optoelectronics Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9783982674100

ISBN: (纸本)9798331534646

Considering the potential benefits to lifespan and performance, zoned flash storage is expected to be incorporated into the next generation of consumer devices. However, due to the limited volatile cache and heterogeneous flash cells of consumer-grade flash storage, adopting a zone abstraction requires additional internal hardware design to maximize its benefits. To understand and efficiently improve the hardware design on consumer-grade zoned flash storage, we present ConZone—the first emulator tailored to the characteristics of consumer-grade zoned flash storage. Users can explore the internal architecture and management strategies of consumer-grade zoned flash storage and integrate the optimization with software. We validate the accuracy of ConZone by realizing a hardware architecture for consumer-grade zoned flash storage and comparing it with the state-of-the-art. We also make a case study for read performance research with ConZone to explore the design of mapping mechanisms and cache management strategies.

关键词： Performance evaluation Accuracy Europe Computer architecture Hardware software Planning Optimization Next generation networking

来源：评论

学校读者我要写书评

暂无评论

PS3: Precise Patch Presence Test Based on Semantic Symbolic Signature

PS3: Precise Patch Presence Test Based on Semantic Symbolic ...

引用

International Conference on software engineering (ICSE)

作者： Qi Zhan Xing Hu Zhiyang Li Xin Xia David Lo Shanping Li The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Zhejiang University Hangzhou China Software Engineering Application Technology Lab Huawei China Singapore Management University Singapore

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

During software development, vulnerabilities have posed a significant threat to users. Patches are the most effective way to combat vulnerabilities. In a large-scale software system, testing the presence of a security patch in every affected binary is crucial to ensure system security. Identifying whether a binary has been patched for a known vulnerability is challenging, as there may only be small differences between patched and vulnerable versions. Existing approaches mainly focus on detecting patches that are compiled in the same compiler options. However, it is common for developers to compile programs with very different compiler options in different situations, which causes inaccuracy for existing methods. In this paper, we propose a new approach named $PS^{3}$ , referring to precise patch presence test based on semantic-level symbolic signature. $PS^{3}$ exploits symbolic emulation to extract signatures that are stable under different compiler options. Then $PS^{3}$ can precisely test the presence of the patch by comparing the signatures between the reference and the target at semantic level. To evaluate the effectiveness of our approach, we constructed a dataset consisting of 3,631 (CVE, binary) pairs of 62 recent CVEs in four C/C++ projects. The experimental results show that $PS^{3}$ achieves scores of 0.82, 0.97, and 0.89 in terms of precision, recall, and F1 score, respectively. $PS^{3}$ outperforms the state-of-the-art baselines by improving 33% in terms of F1 score and remains stable in different compiler options.

关键词： Program processors Semantics Emulation software systems Security Testing software engineering

来源：评论

学校读者我要写书评

暂无评论

GIRP: Energy-Efficient QoS-Oriented Microservice Resource Provisioning via Multi-Objective Multi-Task Reinforcement Learning

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 5793-5807页

作者： Yuan, Honggang Wang, Ting Fu, Min Shi, Yuanming East China Normal University MoE Engineering Research Center of Software/Hardware Co-design Technology and Application Shanghai Key Laboratory of Trustworthy Computing Shanghai200062 China National University of Singapore Department of Electrical and Computer Engineering 117583 Singapore ShanghaiTech University School of Information Science and Technology Shanghai201210 China

Microservice architecture has revolutionized web service development by facilitating loosely coupled and independently developable components distributed as containers or virtual machines. While existing studies emphasize end-to-end latency, this paper investigates energy-efficient quality-of-service (QoS)-oriented microservice provisioning, focusing on both QoS satisfaction and power consumption (PC) conservation. We propose the Green and Intelligent Resource Provision (GIRP) architecture, integrating a data-driven energy-latency-aware resource allocation and scheduling manager to balance latency and PC. To reconcile the trade-offs involved, a dual-objective optimization problem is formulated to minimize latency and energy use by selecting proper servers, allocating CPU cores, and determining service replicas. To address challenges with discrete variables, dual objectives, and implicit mappings, we leverage a model-free deep deterministic policy gradient-based reinforcement learning algorithm. Specifically, we develop a multi-task agent via the Multi-gate Mixture-of-Experts model to simultaneously make two separate actions regarding CPU core numbers and service replica numbers, followed by a single-task agent to determine service scheduling. Extensive experiments on the DeathStarBenchmark testbed validate GIRP's effectiveness, demonstrating approximately 52% resource savings and a 43% reduction in PC compared to leading methods like Sinan, Firm, and heuristic-based algorithms. These results highlight GIRP's capability to optimize microservice orchestration by balancing end-to-end latency and power efficiency. © 2025 IEEE. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Password Guessing Attack Based on Probabilistic Context Free Algorithm 8

Password Guessing Attack Based on Probabilistic Context Free...

引用

8th IEEE International Conference on Computer and Communications, ICCC 2022

作者： Jiang, Xuejing Sun, Xun Liu, Qiuming Jiangxi Vocational and Technical College of Information Application Nanchang330043 China School of Software Engineering Jiangxi University of Science and Technology Nanchang330013 China Nanchang Key Laboratory of Virtual Digital Factory and Cultural Communications Nanchang330013 China

ISBN: (纸本)9781665450515

Password is the primary way of identity authentication at present. The password security is closely related to more than 4 billion netizen all over the world. Password contains lots of semantic information, so how to extract the semantic of password and apply it to password guessing algorithm can further uncover the behavior preference of users in creating passwords, and improve the cracking rate of guessing attacks. We analyze the background and present situation of password security research, and determine the general steps and basic framework of password guessing algorithm based on natural language processing technology. We introduce the relevant preparatory knowledge and make statistical analysis on many password data sets. The popular password, password grammar, password pattern, character composition, length distribution, character distribution and semantic information of password data set are analyzed. We propose a password guessing algorithm based on probabilistic context free algorithm. The actual leaked password data set is selected for training and testing, and several groups of password guessing contrast experiments are set up. The results prove the effectiveness of proposed algorithm. © 2022 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：