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

Annual CCSC Northeastern Conference on The Journal of Computing in Small Colleges

作者： Norman Neff Computer Science Department The College of New Jersey Trenton NJ

algorithms courses are typically organized either by application area or by design technique. Each of these organizations has its strength, but neither effectively reflects the fact that sophisticated algorithms are not designed in a single pass. This paper describes and gives an example of the strategy of successive transformation, in which a sequence of algorithms is generated to solve a single problem. design of algorithms by successive transformation requires more time per problem, since each problem requires multiple phases of analysis. To the extent that this method is used, the breadth of the course in terms of areas and algorithms is reduced. However, we assert that at least a few such experiences are indispensable, because such painstaking analysis is representative of algorithm design as it really is, and because successive transformation is an excellent way to show students the power of theory to improve applications.

关键词： algorithm design algorithms program area design techniques MULTI-PHASE

来源：评论

学校读者我要写书评

暂无评论

algorithm design of Graphic Password Authentication System

Algorithm Design of Graphic Password Authentication System

引用

2018 International Conference on Data Processing,Artificial Intelligence,and Communications(DPAIC 2018)

作者： Peifeng Li Xuzhou Technician College

With the development of computer application technology and the popularity of computer network applications, people are increasingly relying on computers and network systems to complete important tasks, which makes computer system security issues extremely important. As one of the core components of computer system security, identity authentication technology refers to the technical means used to confirm the operator identity process in computers and network systems. Currently, text-based password authentication is still the most widely used authentication technology because of its simplicity. Graphical password is a new type of password verification technology. It is an alternative solution to the shortcomings of text passwords that are difficult to remember and poorly resistant to cracking.

关键词： authentication technology graphical password algorithm design

来源：评论

学校读者我要写书评

暂无评论

Congestion control algorithm design of ad hoc network and its reliability analysis

引用

AGRO FOOD INDUSTRY HI-TECH 2017年第3期28卷 1404-1406页

作者： Hu, Weimin Jiangsu Coll Engn & Technol Nantong Jiangsu Peoples R China

As a centerless self-organizing wireless network, Ad Hoc network requires both router transceiver nodes and other nodes to facilitate the data forwarding. Therefore, larger data transfer will easily cause the network to be congested, thereby leading to the block of wireless network signal. Base on this situation, a Bayesian control algorithm is proposed to solve the congestion of Ad Hoc network so as to make full use of the wireless network resources, prevent the network congestion to the greatest degree and improve the performance of wireless network. Further, a reliability test is conducted on the congestion control algorithm of Ad Hoc network to make better use of wireless network real-time data and their performance.

关键词： Ad Hoc network congestion control algorithm design simulation test

来源：评论

学校读者我要写书评

暂无评论

Constrained multimodal multi-objective optimization: Test problem construction and algorithm design

引用

SWARM AND EVOLUTIONARY COMPUTATION 2023年 76卷

作者： Ming, Fei Gong, Wenyin Yang, Yueping Liao, Zuowen China Univ Geosci Sch Comp Sci Wuhan 430074 Peoples R China State Grid Ningbo Power Supply Co Ningbo 315000 Peoples R China Beibu Gulf Univ Beibu Gulf Ocean Dev Res Ctr Qinzhou 535000 Peoples R China

Solving multimodal multi-objective optimization problems (MMOPs) has received increasing attention. How-ever, recent studies only consider unconstrained MMOPs. Given the fact that there are usually constraints in real-world optimization problems, in this work, we propose a test problem construction approach for constrained multimodal multi-objective optimization. Based on the approach, a test suite, containing 14 instances with diverse features and difficulties, is created. Meanwhile, a new evolutionary framework is tailored for this kind of problem. We test the proposed framework in the experiments and compare it to state-of-the-art multimodal multi-objective optimization algorithms on the proposed test suite. The results reveal that the proposed test suite is challenging and it can motivate researchers to develop new algorithms. In addition, the superiority of our proposed framework demonstrates its effectiveness in handling constrained MMOPs.

关键词： Constrained multimodal multi-objective optimization Evolutionary algorithm Test problem construction algorithm design

来源：评论

学校读者我要写书评

暂无评论

Reinforcement-Learning-Based Quantum Adiabatic algorithm design for Integer Programming

引用

SPIN 2021年第3期11卷

作者： Zhu, Jiawei Fudan Univ Inst Nano Elect & Quantum Comp State Key Lab Surface Phys Shanghai 200433 Peoples R China Fudan Univ Dept Phys Shanghai 200433 Peoples R China

Adiabatic quantum computing (AQC) is a computation protocol to solve difficult problems exploiting quantum advantage, directly applicable to optimization problems. In performing the AQC, different configurations of the Hamiltonian path could lead to dramatic differences in the computation efficiency. It is thus crucial to configure the Hamiltonian path to optimize the computation performance of AQC. Here we apply a reinforcement learning approach to configure AQC for integer programming, where we find the learning process automatically converges to a quantum algorithm that exhibits scaling advantage over the trivial AQC using a linear Hamiltonian path. This reinforcement-learning-based approach for quantum adiabatic algorithm design for integer programming can well be adapted to the quantum resources in different quantum computation devices, due to its built-in flexibility.

关键词： Adiabatic quantum computing integer programming reinforcement learning algorithm design

来源：评论

学校读者我要写书评

暂无评论

Efficient Multi-party Computation algorithm design for Real-World Applications

Efficient Multi-party Computation Algorithm Design for Real-...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Zengxiang Li Chutima Kitcharoenpaisan Phond Phunchongharn Yechao Yang Rick Siow Mong Goh Yusen Li Institute of High Performance Computing A * STAR Singapore King Mongkut's University of Technology Thonburi Thailand Nankai - Baidu Joint Lab Nankai University

ISBN: (纸本)9781728125848

Secure Multi-Party Computation (MPC) is a promising privacy-preserving technology to enable multiple trustless parties to compute a function jointly without revealing private inputs to each other. With the fast development of MPC protocols, software implementation, and underlying computation infrastructure, MPC has developed from purely theoretical interest to tangible platform implementations for real-world applications. In this paper, we investigate multiple mechanisms to design efficient MPC algorithms by avoiding costly MPC operations and leveraging parallel operations. In order to speed up database table searching, a machine learning-based approach is proposed to completely avoid equality-check operations, playing the trade-off between efficiency and accuracy. According to our experimental results, a well-designed MPC algorithm could improve performance and scalability significantly, and thus make MPC technology practicable.

关键词： Privacy-preserving Multi-Party computation Machine learning Performance Scalability Cargo consolidation Scalability Maximum Allowable Concentration Artificial Intelligence Machine Learning algorithm design arithmetic

来源：评论

学校读者我要写书评

暂无评论

Localization algorithm design and Performance Analysis in Probabilistic LOS/NLOS Environment

Localization Algorithm Design and Performance Analysis in Pr...

引用

Ad-Hoc and Sensor Networks Symposium

作者： Xiufang Shi Guoqiang Mao Zaiyue Yang Jiming Chen State Key Lab. of Industrial Control Technology Zhejiang University School of Computing and Communication University of Technology Sydney

ISBN: (纸本)9781479966653

Non-line-of-sight (NLOS) propagation, which widely exists in wireless systems, will degrade the performance of wireless positioning system if it is not taken into consideration in the localization algorithm design. The 3rd Generation Partnership Project (3GPP) suggests that the probabilities of line-of-sight (LOS) and NLOS are related to the distance between the receiver and the transmitter. In this paper, we propose a Maximum Likelihood Estimator (MLE) for localization, which incorporates the distance dependent LOS/NLOS probabilities. Then, the position error bound is derived using Cramer-Rao Lower Bound (CRLB). Through numerical analysis, the impact of NLOS propagation on the position error bound is evaluated. The performance of our proposed algorithm is verified by real world experimental data.

关键词： location error algorithm design maximum likelihood estimation CARRIER SYSTEM Transmitters 3GPP Probability Receivers Nonlinear optics

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Clustering algorithm design for C-RAN Based on Multi-Objective Optimization Theory

A Dynamic Clustering Algorithm Design for C-RAN Based on Mul...

引用

IEEE Vehicular Technology Conference

作者： Xi Chen Na Li Jing Wang Chengwen Xing Liang Sun Ming Lei School of Information and Electronics Beijing Institute of Technology NEC Laboratories China

ISBN: (纸本)9781479944811

Cloud radio access network (C-RAN) is a new concept of network architecture, which brings a technical revolution into the wireless communication market and leads to some kind of all new mode of the future wireless communications. In this paper the clustering algorithm based on multi-objective optimization is investigated. The proposed algorithm aims at maximizing the throughput contribution of the Remote RF Head (RRH) to the whole system and minimizing its total power consumption with guaranteed energy efficiency of RRH. Using the novel greedy dynamic clustering algorithm, the joint capacity of RRHs is improved. The throughput of each RRH is first given using the pricing mechanism and the Pascoletti and Serafini Scalarization method is then implemented to solve the multi-objective optimization problem. Finally, the performance of the algorithm is assessed by the simulation results. It is shown that the novel dynamic clustering algorithm based on multi-objective optimization in the C-RAN architecture outperforms the traditional greedy clustering approach.

关键词： cloud computing greedy algorithms optimisation radio access networks telecommunication industry C-RAN architecture Pascoletti and Serafini scalarization method RRH cloud radio access network clustering algorithm design greedy dynamic clustering algorithm multiobjective optimization remote RF head wireless communication market Antennas Clustering algorithms Computer architecture Heuristic algorithms Interference Optimization Throughput RRH gene Clustering algorithms Wireless networks Telecommunications industry Throughput greedy algorithm Computer Architecture Heuristic algorithms ANTENNA Cloud Computing CARRIER SYSTEM algorithm design

来源：评论

学校读者我要写书评

暂无评论

Formation Control of Multi-Agent Systems With Switching Topologies: An ILC-Based Distributed algorithm design

Formation Control of Multi-Agent Systems With Switching Topo...

引用

American Control Conference

作者： Deyuan Meng Kevin L. Moore Seventh Research Division Beihang University (BUAA) Beijing 100191 P. R. China Department of Electrical Engineering and Computer Science Colorado School of Mines Golden CO 80401 USA

ISBN: (纸本)9781479917730

This paper deals with iterative formation control problems for multi-agent systems with switching topologies. Our approach combines consensus protocol algorithms conducted with an iterative learning control update. This leads to networks dynamically changing with evolution along two directions: a finite time axis and an infinite iteration axis. A distributed algorithm is constructed based on nearest neighbor information, and its convergence is established via a Roesser system-based two-dimensional approach. It is shown that a desired relative formation between agents can be achieved along a finite time trajectory if and only if the union of the interaction graphs between the agents over iteration intervals of finite length has a spanning tree for every time step. Simulations are included to illustrate the effectiveness of the derived results.

关键词： distributed algorithms algorithm design Agents finite length Spanning tree iterative methods If and only if switching

来源：评论

学校读者我要写书评

暂无评论

Loose Security Protocol algorithm design and Performance Analysis Method

Loose Security Protocol Algorithm Design and Performance Ana...

引用

2016 International Congress on Computation algorithms in Engineering

作者： Kaifen Liu Muhd Amirul Najhan bin Shamsudin Chongqing Creation Vocational College National Defence University Kuala Lumpur Malaysia

For the network security problem, this paper proposes a kind of loose security protocol algorithm. The protocol includes two parts: authentication and encryption, which are respectively used for authentication and encryption for the network applications. This paper also adopts OPNET to customize the application modeling method in order to analyze the network performance of the protocol algorithm. The simulation shows that, after analysis and optimization of the algorithm performance through customizing the application model by using OPNET in the design of the loose security protocol algorithm, the algorithm performance has a significant improvement.

关键词： loose security protocol algorithm design performance analysis method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：