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

Hybrid IT? Algorithm for Large-Scale Colored Traveling Salesman Problem

Chinese Journal of Electronics 2024年第6期33卷 1337-1345页

作者： Xueshi DONG College of Computer Science and Technology Qingdao University Beijing Key Laboratory of Urban Spatial Information Engineering School of Computer Science Wuhan University

In the fields of intelligent transportation and multi-task cooperation, many practical problems can be modeled by colored traveling salesman problem(CTSP). When solving large-scale CTSP with a scale of more than 1000dimensions, their convergence speed and the quality of their solutions are limited. This paper proposes a new hybrid IT?(HIT?) algorithm, which integrates two new strategies, crossover operator and mutation strategy, into the standard IT?. In the iteration process of HIT?, the feasible solution of CTSP is represented by the double chromosome coding, and the random drift and wave operators are used to explore and develop new unknown regions. In this process, the drift operator is executed by the improved crossover operator, and the wave operator is performed by the optimized mutation strategy. Experiments show that HIT? is superior to the known comparison algorithms in terms of the quality solution.

关键词： Transportation Traveling salesman problems Multitasking Encoding Standards Biological cells Convergence

来源：评论

学校读者我要写书评

暂无评论

A fully connected polarization-entangled network via integrated spontaneous four-wave mixing engineering

引用

science China(Physics,Mechanics & Astronomy) 2025年第6期Mechanics & Astronomy) .卷 76-83页

作者： Pingyu Zhu Yan Wang Yuxing Du Miaomiao Yu Kaikai Zhang Kun Wang Ping Xu Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer Science and TechnologyNational University of Defense Technology Hefei National Laboratory

Quantum communication is rapidly developing and is gradually being commercialized due to its technological maturity. Establishing dense communication links among multiple users in a scalable and efficient way is of great significance for realizing a large-scale quantum communication network. Here, we propose a novel scheme to construct a fully connected polarizationentangled network, utilizing the engineering of spontaneous four-wave mixings(SFWMs) and a path-polarization converter. It does not require active optical switches which limit the communication speed, or trusted nodes which lead to potential security risks. The required frequency channels in the network grow linearly with the number of users. We experimentally demonstrate a six-user fully connected network with on-chip SFWM processes motivated by four pumps. Each user in the network receives a frequency channel, and all fifteen connections between the users are implemented simultaneously. Our work opens up a promising scheme to efficiently construct fully connected large-scale networks.

关键词： quantum network quantum entanglement nonlinear optics integrated optics

来源：评论

学校读者我要写书评

暂无评论

GPS: graph contrastive learning via multi-scale augmented views from adversarial pooling

引用

science China(information sciences) 2025年第1期68卷 145-158页

作者： Wei JU Yiyang GU Zhengyang MAO Ziyue QIAO Yifang QIN Xiao LUO Hui XIONG Ming ZHANG School of Computer Science National Key Laboratory for Multimedia Information ProcessingPeking University Artificial Intelligence Thrust The Hong Kong University of Science and Technology Department of Computer Science University of California

Self-supervised graph representation learning has recently shown considerable promise in a range of fields, including bioinformatics and social networks. A large number of graph contrastive learning approaches have shown promising performance for representation learning on graphs, which train models by maximizing agreement between original graphs and their augmented views(i.e., positive views). Unfortunately, these methods usually involve pre-defined augmentation strategies based on the knowledge of human experts. Moreover, these strategies may fail to generate challenging positive views to provide sufficient supervision signals. In this paper, we present a novel approach named graph pooling contrast(GPS) to address these *** by the fact that graph pooling can adaptively coarsen the graph with the removal of redundancy, we rethink graph pooling and leverage it to automatically generate multi-scale positive views with varying emphasis on providing challenging positives and preserving semantics, i.e., strongly-augmented view and weakly-augmented view. Then, we incorporate both views into a joint contrastive learning framework with similarity learning and consistency learning, where our pooling module is adversarially trained with respect to the encoder for adversarial robustness. Experiments on twelve datasets on both graph classification and transfer learning tasks verify the superiority of the proposed method over its counterparts.

关键词： graph representation learning graph neural networks graph contrastive learning graph augmentations graph pooling

来源：评论

学校读者我要写书评

暂无评论

The quantum Ising model for perfect matching and solving it with variational quantum eigensolver

引用

science China(information sciences) 2024年第9期67卷 306-320页

作者： Qilin ZHENG Pingyu ZHU Chao WU Miaomiao YU Weihong LUO Ping XU Institute for Quantum Information and State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Hefei National Laboratory

Obtaining all perfect matchings of a graph is a tough problem in graph theory, and its complexity belongs to the #P-Complete class. The problem is closely related to combinatorics, marriage matching problems, dense subgraphs, the Gaussian boson sampling, chemical molecular structures, and dimer *** this paper, we propose a quadratic unconstrained binary optimization formula of the perfect matching problem and translate it into the quantum Ising model. We can obtain all perfect matchings by mapping them to the ground state of the quantum Ising Hamiltonian and solving it with the variational quantum eigensolver. Adjusting the model's parameters can also achieve the maximum or minimum weighted perfect matching. The experimental results on a superconducting quantum computer of the Origin Quantum Computing technology Company show that our model can encode 2~n dimensional optimization space with only O（n） qubits consumption and achieve a high success probability of the ground state corresponding to all perfect matchings. In addition, the further simulation results show that the model can support a scale of more than 14 qubits, effectively resist the adverse effects of noise, and obtain a high success probability at a shallow variational depth. This method can be extended to other combinatorial optimization problems.

关键词： perfect matching Ising model quantum Hamiltonian variational quantum eigensolver quadratic unconstrained binary optimization

来源：评论

学校读者我要写书评

暂无评论

IQABC-Based Hybrid Deployment Algorithm for Mobile Robotic Agents Providing Network Coverage

引用

Tsinghua science and technology 2024年第2期29卷 589-604页

作者： Shuang Xu Xiaojie Liu Dengao Li Jumin Zhao College of Computer Science and Technology(College of Data Science) Taiyuan University of TechnologyTaiyuan 030024China Pengcheng Laboratory Shenzhen 518055China College of Information and Computer Taiyuan University of TechnologyTaiyuan 030024China

Working as aerial base stations,mobile robotic agents can be formed as a wireless robotic network to provide network services for on-ground mobile devices in a target ***,a challenging issue is how to deploy these mobile robotic agents to provide network services with good quality for more users,while considering the mobility of on-ground *** this paper,to solve this issue,we decouple the coverage problem into the vertical dimension and the horizontal dimension without any loss of optimization and introduce the network coverage model with maximum coverage ***,we propose a hybrid deployment algorithm based on the improved quick artificial bee *** algorithm is composed of a centralized deployment algorithm and a distributed *** proposed deployment algorithm deploy a given number of mobile robotic agents to provide network services for the on-ground devices that are independent and identically *** results have demonstrated that the proposed algorithm deploys agents appropriately to cover more ground area and provide better coverage uniformity.

关键词： wireless robotic networks network coverage deployment algorithm improved quick artificial bee colony

来源：评论

学校读者我要写书评

暂无评论

A new quantum key distribution resource allocation and routing optimization scheme

引用

Chinese Physics B 2024年第3期33卷 244-259页

作者：毕琳袁晓同吴炜杰林升熙 School of Computer Science and Technology Changchun University of Science and TechnologyChangchun 130012China Key Laboratory of Network and Information Security in Jilin Province Changchun 130012China

Quantum key distribution(QKD)is a technology that can resist the threat of quantum computers to existing conventional cryptographic ***,due to the stringent requirements of the quantum key generation environment,the generated quantum keys are considered valuable,and the slow key generation rate conflicts with the high-speed data transmission in traditional optical *** this paper,for the QKD network with a trusted relay,which is mainly based on point-to-point quantum keys and has complex changes in network resources,we aim to allocate resources reasonably for data packet ***,we formulate a linear programming constraint model for the key resource allocation(KRA)problem based on the time-slot ***,we propose a new scheduling scheme based on the graded key security requirements(GKSR)and a new micro-log key storage algorithm for effective storage and management of key ***,we propose a key resource consumption(KRC)routing optimization algorithm to properly allocate time slots,routes,and key *** results show that the proposed scheme significantly improves the key distribution success rate and key resource utilization rate,among others.

关键词： quantum key distribution(QKD) resource allocation key storage routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Robust tube-based MPC with smooth computation for dexterous robot manipulation

引用

science China(information sciences) 2024年第11期67卷 252-268页

作者： Yu LUO Tianying JI Fuchun SUN Qie SIMA Huaping LIU Mingxuan JING Jianwei ZHANG Department of Computer Science and Technology Tsinghua University Science & Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences Department of Informatics University of Hamburg

Dexterous robot manipulation has shone in complex industrial scenarios, where multiple manipulators, or fingers, cooperate to grasp and manipulate objects. When encountering multi-objective optimization with system constraints in such scenarios, model predictive control(MPC) has demonstrated exceptional performance in complex multi-robot manipulation tasks involving multi-objective optimization with system constraints. However, in such scenarios, the substantial computational load required to solve the optimal control problem(OCP) at each triggering instant can lead to significant delays between state sampling and control application, hindering real-time performance. To address these challenges, this paper introduces a novel robust tube-based smooth MPC approach for two fundamental manipulation tasks: reaching a given target and tracking a reference trajectory. By predicting the successor state as the initial condition for imminent OCP solving, we can solve the forthcoming OCP ahead of time, alleviating delay effects. Additionally,we establish an upper bound for linearizing the original nonlinear system, reducing OCP complexity and enhancing response speed. Grounded in tube-based MPC theory, the recursive feasibility and closed-loop stability amidst constraints and disturbances are ensured. Empirical validation is provided through two numerical simulations and two real-world dexterous robot manipulation tasks, which shows that the seamless control input by our methods can effectively enhance the solving efficiency and control performance when compared to conventional time-triggered MPC strategies.

关键词： dexterous robot manipulation model predictive control smooth computation

来源：评论

学校读者我要写书评

暂无评论

Predicting Age and Gender in Author Profiling: A Multi-Feature Exploration

引用

computers, Materials & Continua 2024年第5期79卷 3333-3353页

作者： Aiman Muhammad Arshad Bilal Khan Sadique Ahmad Muhammad Asim Department of Computer Science City University of Science and Information TechnologyPeshawar25000Pakistan EIAS:Data Science and Blockchain Laboratory College of Computer and Information SciencesPrince Sultan UniversityRiyadh11586Saudi Arabia School of Computer Science and Technology Guangdong University of TechnologyGuangzhou510006China

Author Profiling (AP) is a subsection of digital forensics that focuses on the detection of the author’s personalinformation, such as age, gender, occupation, and education, based on various linguistic features, e.g., stylistic,semantic, and syntactic. The importance of AP lies in various fields, including forensics, security, medicine, andmarketing. In previous studies, many works have been done using different languages, e.g., English, Arabic, French,***, the research on RomanUrdu is not up to the ***, this study focuses on detecting the author’sage and gender based on Roman Urdu text messages. The dataset used in this study is Fire’18-MaponSMS. Thisstudy proposed an ensemble model based on AdaBoostM1 and Random Forest (AMBRF) for AP using multiplelinguistic features that are stylistic, character-based, word-based, and sentence-based. The proposed model iscontrasted with several of the well-known models fromthe literature, including J48-Decision Tree (J48),Na飗e Bays(NB), K Nearest Neighbor (KNN), and Composite Hypercube on Random Projection (CHIRP), NB-Updatable,RF, and AdaboostM1. The overall outcome shows the better performance of the proposed AdaboostM1 withRandom Forest (ABMRF) with an accuracy of 54.2857% for age prediction and 71.1429% for gender predictioncalculated on stylistic features. Regarding word-based features, age and gender were considered in 50.5714% and60%, respectively. On the other hand, KNN and CHIRP show the weakest performance using all the linguisticfeatures for age and gender prediction.

关键词： Digital forensics author profiling for security AdaBoostM1 random forest ensemble learning

来源：评论

学校读者我要写书评

暂无评论

Online Nonstop Task Management for Storm-Based Distributed Stream Processing Engines

引用

Journal of computer science & technology 2024年第1期39卷 116-138页

作者：张洲金培权谢希科王晓亮刘睿诚万寿红 School of Computer Science and Technology University of Science and Technology of ChinaHefei 230026China Key Laboratory of Electromagnetic Space Information Chinese Academy of SciencesHefei 230026China

Most distributed stream processing engines(DSPEs)do not support online task management and cannot adapt to time-varying data ***,some studies have proposed online task deployment algorithms to solve this ***,these approaches do not guarantee the Quality of Service(QoS)when the task deployment changes at runtime,because the task migrations caused by the change of task deployments will impose an exorbitant *** study one of the most popular DSPEs,Apache Storm,and find out that when a task needs to be migrated,Storm has to stop the resource(implemented as a process of Worker in Storm)where the task is *** will lead to the stop and restart of all tasks in the resource,resulting in the poor performance of task *** to solve this problem,in this pa-per,we propose N-Storm(Nonstop Storm),which is a task-resource decoupling DSPE.N-Storm allows tasks allocated to resources to be changed at runtime,which is implemented by a thread-level scheme for task ***,we add a local shared key/value store on each node to make resources aware of the changes in the allocation ***,each resource can manage its tasks at *** on N-Storm,we further propose Online Task Deployment(OTD).Differ-ing from traditional task deployment algorithms that deploy all tasks at once without considering the cost of task migra-tions caused by a task re-deployment,OTD can gradually adjust the current task deployment to an optimized one based on the communication cost and the runtime states of *** demonstrate that OTD can adapt to different kinds of applications including computation-and communication-intensive *** experimental results on a real DSPE cluster show that N-Storm can avoid the system stop and save up to 87%of the performance degradation time,compared with Apache Storm and other state-of-the-art *** addition,OTD can increase the average CPU usage by 51%for computation-intensive application

关键词： distributed stream processing engine(DSPE) Apache Storm online task migration online task deployment

来源：评论

学校读者我要写书评

暂无评论

Fixed-point quantum continuous search algorithm with optimal query complexity

引用

science China(Physics,Mechanics & Astronomy) 2025年第6期Mechanics & Astronomy) .卷 84-95页

作者： Shan Jin Yuhan Huang Shaojun Wu Guanyu Zhou Chang-Ling Zou Luyan Sun Xiaoting Wang Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of China Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology Key Laboratory of Quantum Information CAS University of Science and Technology of China Hefei National Laboratory Center for Quantum Information Institute for Interdisciplinary Information Sciences Tsinghua University

Continuous search problems(CSPs), which involve finding solutions within a continuous domain, frequently arise in fields such as optimization, physics, and engineering. Unlike discrete search problems, CSPs require navigating an uncountably infinite space, presenting unique computational challenges. In this work, we propose a fixed-point quantum search algorithm that leverages continuous variables to address these challenges, achieving a quadratic speedup. Inspired by the discrete search results, we manage to establish a lower bound on the query complexity of arbitrary quantum search for CSPs, demonstrating the optimality of our approach. In addition, we demonstrate how to design the internal structure of the quantum search oracle for specific problems. Furthermore, we develop a general framework to apply this algorithm to a range of problem types, including optimization and eigenvalue problems involving continuous variables.

关键词： quantum search quantum algorithm quantum computation optimization spectral problems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：