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

10th International Symposium on Dependable software engineering: Theories, Tools and Applications, SETTA 2024

作者： Wang, Chao Wu, Peng Petri, Gustavo Jia, Qiaowen He, Youlin Lv, Yi Liu, Zhiming Centre for Research and Innovation in Software Engineering College of Computer and Information Science Southwest University Chongqing China and State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Arm Research Cambridge United Kingdom China Great Wall Technology Group Co. Ltd. Shenzhen China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9789819606016

Strong linearizability is a variant of linearizability and is more suitable for verification. In this paper we investigate the following two problems: (1) for which deterministic sequential specifications there exist linearizable but not strongly linearizable objects;(2) can we capture any violation scheme of strong linearizability for practical objects that are linearizable but not strongly linearizable. To deal with the first problem, we propose two classes of deterministic sequential specifications called inclusively-permutative sequential specifications and exclusively-permutative sequential specifications. The first class of sequential specifications contains sequential specifications of counter, register, max-register, snapshot, set, queue, stack and priority queue. The second class of sequential specifications contains sequential specifications of blocking queue, blocking stack and blocking priority queue. To establish these results, we propose a uniform methodology to construct a wait-free, linearizable but not strongly linearizable object for these two classes of sequential specifications. Our universal construction is based on the classical universal construction, and it additionally permits each operation to change the "take-effect-order" of previous operations. To deal with the second problem, we use bi-branch distinguishable executions to represent violations of strong linearizability. We investigate eight objects that are linearizable but not strongly linearizable, and we show that for each object, it has a pair of bi-branch distinguishable executions such that our universal construction can generate another pair of bi-branch distinguishable executions with the same set of histories. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards Integrated Spatial Crowdsourcing: Online Privacy-Preserving Selection

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Wang, Hengzhi Ma, Minghe Cui, Laizhong Liu, Jiangchuan Shenzhen University College of Computer Science and Software Engineering Shenzhen China Simon Fraser University School of Computing Science Burnaby Canada

We study an intriguing and practical scenario of online Spatial Crowdsourcing (SC), in which workers have the flexibility to perform tasks using various methods, such as walking, driving, or utilizing Unmanned Aerial Vehicles (UAVs). This results in workers having heterogeneous, arbitrary, and non-stationary utilities over time. We refer to this scenario as integrated SC. Unfortunately, existing studies are limited in addressing integrated SC settings due to two aspects: (1) these studies are based on the assumption that workers' utilities are independently and identically distributed and follow a stationary distribution like Gaussian, which does not hold in integrated SC;(2) their approaches fail to provide personalized privacy preservation for different workers. Motivated by these limitations, we closely investigate the heterogeneous utility and personalized privacy requirement in integrated SC and propose an Online Personalized Privacy-preserving Selection framework (OPPS). In this framework, we present an online selection policy that balances the exploration-exploitation trade-off given heterogeneous utilities and develop a built-in privacy policy that ensures differential privacy guarantee. We then demonstrate that our framework effectively addresses the trade-off by deriving a sublinear, privacy-related upper bound on regret that scales as O(√T). Extensive numerical simulations based on real-world drone datasets are conducted to validate the effectiveness of our framework compared with state-of-the-art approaches. © 2004-2012 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

OSN Rumor Control Model Based on Community Immunization 22

OSN Rumor Control Model Based on Community Immunization

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Dong, Ming Sun, Zhiqiang Tan, Zhenhua Zhang, Bin Northeastern University School of Computer Science and Engineering Shenyang China Northeastern University Software College Shenyang China Northeastern University National Frontiers Science Center for Industrial Intelligence and Systems Optimization Shenyang China Ministry of Education China

ISBN: (纸本)9798331509712

This paper proposes a rumor control model based on community immunization. Based on the community division and the trust network inference algorithm, the model redefines the standard to measure the importance of nodes in the network. First, the model uses the Louvain clustering algorithm based on the Ochiai coefficient to discover the network community and then presents the trust network inference algorithm. By analyzing the key factors that affect trust transfer between nodes, the trust evaluation between unfamiliar nodes is inferred, and important nodes with a high degree of trust in the network community are calculated. Finally, combined with the characteristics of inner degree and outer degree centrality of nodes in the network community, five types of important nodes in the network are screened out. To avoid repeated selection of nodes, this paper identifies a group of key nodes in the network community for local immunization by means of deduplication and taking intersection, so as to realize effective control of rumors in the network. © 2024 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal Resource Allocation Method for Device-to-Device Communication in 5G Networks

引用

computers, Materials & Continua 2022年第4期71卷 1-15页

作者： Fahd N.Al-Wesabi Imran Khan Saleem Latteef Mohammed Huda Farooq Jameel Mohammad Alamgeer Ali M.Al-Sharafi Byung Seo Kim Department of Computer Science King Khalid UniversityMuhayel AseerKSA Faculty of Computer and IT Sana’a UniversityYemen Department of Electrical Engineering University of Engineering and TechnologyPeshawarPakistan Department of Medical Instrumentation Techniques Engineering Electrical Engineering Technical CollegeMiddle Technical UniversityBaghdad10013Iraq Department of Information Systems King Khalid UniversityMayahel AseerKSA Department of Computer Science College of Computers and Information TechnologyUniversity of BishaKSA Department of Software and Communications Engineering Hongik UniversityKorea

With the rapid development of the next-generation mobile network,the number of terminal devices and applications is growing ***,how to obtain a higher data rate,wider network coverage and higher resource utilization in the limited spectrum resources has become the common research goal of ***-to-Device(D2D)communication technology and other frontier communication technologies have ***-to-Device communication technology is the technology that devices in proximity can communicate directly in cellular *** has become one of the key technologies of the fifth-generation mobile communications system(5G).D2D communication technology which is introduced into cellular networks can effectively improve spectrum utilization,enhance network coverage,reduce transmission delay and improve system throughput,but it would also bring complicated and various interferences due to reusing cellular resources at the same *** resource management is one of the most challenging and importing issues to give full play to the advantages of D2D *** resource allocation is an important factor that needs to be addressed in D2D ***,this paper proposes an optimization method based on the game-matching *** main idea is to model the optimization problem of the quality-of-experience based on user fairness and solve it through game-matching *** results show that the proposed algorithm effectively improved the resource allocation and utilization as compared with existing algorithms.

关键词： D2D communication resource allocation optimization networks

来源：评论

学校读者我要写书评

暂无评论

Physical Layer Encrypted Maritime Communications Utilizing UAV-Enabled Virtual Antenna Array

Physical Layer Encrypted Maritime Communications Utilizing U...

引用

IEEE International Conference on Communications (ICC)

作者： Jiawei Huang Aimin Wang Geng Sun Jiahui Li Xiaoya Zheng College of Software Engineering and College of Computer Science and Technology Jilin University Changchun China School of Computer Science and Engineering Nanyang Technological University Singapore Singapore

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

Maritime wireless communications as the promising applications gradually spur people's interest. However, they are suffering from critical security issues due to the feature of open channels. This paper propose to utilize a group of unmanned aerial vehicles (UAVs) as a jammer to achieve physical layer security during the maritime wireless communications. Specifically, these UAVs form a maritime UAV-enabled virtual antenna array (UVAA), which can be allowed to transmit jamming signals to the eavesdropper. In the designed system, we formulate a maritime wireless communication multi-objective optimization problem (MWCMOP) to simultaneously achieve the maximization of the signal-to-interference-plus-noise ratio (SINR) of the legal vessel, minimization of the SINR of the eavesdropping vessel, and minimization of the total flying energy cost of UAVs. It is challenging to solve the formulated MWCMOP since it is complex and NP-hard. Thus, we present a novel improved evolutionary algorithm to deal with the problem. Simulation results show that the presented algorithm is superior to other peer algorithms and it is capable of searching a transmission-maximizing flight scheme.

关键词： Wireless communication Simulation Interference Autonomous aerial vehicles Cryptography Jamming Maritime communications

来源：评论

学校读者我要写书评

暂无评论

Industrial Automation Information Analogy for Smart Grid Security

引用

computers, Materials & Continua 2022年第5期71卷 3985-3999页

作者： Muhammad Asif Ishfaq Ali Shahbaz Ahmad Azeem Irshad Akber Abid Gardezi Fawaz Alassery Habib Hamam Muhammad Shafiq Department of Computer Science National Textile UniversityFaisalabad37610PunjabPakistan Department of Computer Science and Software Engineering International Islamic UniversityIslamabadPakistan Department of Computer Science COMSATS University IslamabadIslamabadPakistan Department of Computer Engineering College of Computers and Information TechnologyTaif UniversityTaifSaudi Arabia Faculty of Engineering Moncton UniversityNBE1A3E9Canada Department of Information and Communication Engineering Yeungnam UniversityGyeongsan38541Korea

Industrial automation or assembly automation is a strictly monitored environment,in which changes occur at a good *** are many types of entities in the focusing environment,and the data generated by these devices is *** addition,because the robustness is achieved by sensing redundant data,the data becomes *** data generating device,whether it is a sensing device or a physical device,streams the data to a higher-level deception device for calculation,so that it can be driven and configured according to the updated *** the emergence of the Industry 4.0 concept that includes a variety of automation technologies,various data is generated through numerous ***,the data generated for industrial automation requires unique Information Architecture(IA).IA should be able to satisfy hard real-time constraints to spontaneously change the environment and the instantaneous configuration of all *** understand its applicability,we used an example smart grid *** smart grid system needs an IA to fulfill the communication requirements to report the hard real-time changes in the power immediately following the *** addition,in a smart grid system,it needs to report changes on either side of the system,i.e.,consumers and suppliers configure and reconfigure the system according to the *** this article,we propose an analogy of a physical phenomenon.A point charge is used as a data generating device,the streamline of electric flux is used as a data flow,and the charge distribution on a closed surface is used as a ***,the intensity changes are used in the physical process,e.g.,the smart *** analogy is explained by metaphors,and the structural mapping framework is used for its theoretical *** proposed analogy provides a theoretical basis for the development of such information architectures that can represent data flows,definition changes(deterministic and non-deterministic),events,and i

关键词： Industry 4.0 information architecture industrial automation

来源：评论

学校读者我要写书评

暂无评论

On Quantum Methods for Machine Learning Problems Part Ⅱ: Quantum Classification Algorithms

引用

Big Data Mining and Analytics 2020年第1期3卷 56-67页

作者： Farid Ablayev Marat Ablayev Joshua Zhexue Huang Kamil Khadiev Nailya Salikhova Dingming Wu the College of Computer Science&Software Engineering Shenzhen UniversityShenzhen 518000China the Kazan Federal University Kazan 42008Russia

This is a review of quantum methods for machine learning problems that consists of two *** first part,"quantum tools",presented some of the fundamentals and introduced several quantum tools based on known quantum search *** second part of the review presents several classification problems in machine learning that can be accelerated with quantum *** have chosen supervised learning tasks as typical classification problems to illustrate the use of quantum methods for classification.

关键词： quantum classification binary classification nearest neighbor algorithm

来源：评论

学校读者我要写书评

暂无评论

Corpus of Carbonate Platforms with Lexical Annotations for Named Entity Recognition

引用

computer Modeling in engineering & sciences 2023年第4期135卷 91-108页

作者： Zhichen Hu Huali Ren Jielin Jiang Yan Cui Xiumian Hu Xiaolong Xu School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China Institution of Artificial Intelligence and Blockchain Guangzhou UniversityGuangzhou515021China School of Earth Sciences and Engineering Nanjing UniversityNanjing210023China College of Mathematics and Information Science Nanjing Normal University of Special EducationNanjing210023China

An obviously challenging problem in named entity recognition is the construction of the kind data set of *** some research has been conducted on entity database construction,the majority of them are directed at Wikipedia or the minority at structured entities such as people,locations and organizational nouns in the *** paper focuses on the identification of scientific entities in carbonate platforms in English literature,using the example of carbonate platforms in ***,based on the fact that the reasons for writing literature in key disciplines are likely to be provided by multidisciplinary experts,this paper designs a literature content extraction method that allows dealing with complex text ***,based on the literature extraction content,we formalize the entity extraction task(lexicon and lexical-based entity extraction)for entity ***,for testing the accuracy of entity extraction,three currently popular recognition methods are chosen to perform entity detection in this *** show that the entity data set provided by the lexicon and lexical-based entity extraction method is of significant assistance for the named entity recognition *** study presents a pilot study of entity extraction,which involves the use of a complex structure and specialized literature on carbonate platforms in English.

关键词： Named entity recognition carbonate platform corpus entity extraction english literature detection

来源：评论

学校读者我要写书评

暂无评论

Fast Distributed Polynomial Multiplication Algorithm for Lattice-based Cryptographic Decryption In Blockchain Systems 22

Fast Distributed Polynomial Multiplication Algorithm for Lat...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Zhao, Hongjian Tao, Yunting Kong, Fanyu Zhang, Guoyan Zhang, Hanlin Yu, Jia Shandong University School of Software Jinan China Binzhou Polytechnic College of Information Engineering Binzhou China Shandong University Shandong Sansec Information Technology Co. Ltd School of Software Jinan China Shandong University School of Cyber Science and Technology Qingdao China Qingdao University College of Computer Science and Technology Qingdao China

ISBN: (纸本)9798331509712

Lattice-based Post-Quantum Cryptography (PQC) can effectively resist the quantum threat to blockchain's underlying cryptographic algorithms. Blockchain node decryption is one of the most commonly used cryptographic computations in blockchain systems, and polynomial multiplication, a time-consuming operation for decryption, is one of the factors limiting blockchain efficiency. This paper proposes a novel distributed computing algorithm for polynomial multiplication, applicable in blockchain decryption. By splitting polynomials into lower-degree terms and delegating tasks to distributed nodes, our approach reduces computation time. A novel verification strategy based on the Karatsuba algorithm ensures result accuracy. The experimental results demonstrate that our proposed scheme improves the execution efficiency of NTT and INTT operations by approximately 47.8% and 52.4%, and reduces Kyber decryption time by up to 23.5%. © 2024 IEEE.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

On Quantum Methods for Machine Learning Problems Part Ⅰ: Quantum Tools

引用

Big Data Mining and Analytics 2020年第1期3卷 41-55页

This is a review of quantum methods for machine learning problems that consists of two *** first part,"quantum tools",presents the fundamentals of qubits,quantum registers,and quantum states,introduces important quantum tools based on known quantum search algorithms and SWAP-test,and discusses the basic quantum procedures used for quantum search *** second part,"quantum classification algorithms",introduces several classification problems that can be accelerated by using quantum subroutines and discusses the quantum methods used for classification.

关键词： quantum algorithm quantum programming machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：