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

Reconstruction and application of flooding routing algorithm for smart street light over wireless sensor networks

INTERNATIONAL JOURNAL OF INTERNET PROTOCOL TECHNOLOGY 2020年第1期13卷 9-17页

作者： Wang, Zhichao Tang, Liang Huang, Jun Steed Shi, Hongwei Bian, Li Suqian Coll Inst Elect & Informat Suqian 223800 Peoples R China Carleton Univ 1125 Colonel By Dr Ottawa ON K1S 5B6 Canada

For smart street light wireless sensor networks, there are huge number of redundant packets flooding in the route discovery process, resulting in information explosion and high energy consumption. This paper proposes an improved flooding routing protocol, during the route discovery process, each node could receive signals such as the serial number of packets copies, destination address, node types and so on, the algorithm will judge whether the received signals need to be continue forwarded in a certain forward probability or not. Thus, the total forward times will be reduced and accordingly the information explosion could be prevented and the energy consumption could be reduced without reducing the reliability. Simulation experiments are conducted on MATLAB, and results show that the improved algorithm has much more higher flooding efficiency than the traditional flooding routing algorithm, and a very broad application prospect to balance the efficiency versus the reliability of the whole networks.

关键词： smart lighting packets flooding algorithm efficiency network reliability

来源：评论

学校读者我要写书评

暂无评论

Solving the Quadratic Assignment Problem

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2020年第1期56卷 53-57页

作者： Sergienko, I., V Shylo, V. P. Chupov, S., V Shylo, P., V Natl Acad Sci Ukraine VM Glushkov Inst Cybernet Kiev Ukraine Uzhgorod Natl Univ Uzhgorod Ukraine

Two modifications of the repeated iterated tabu algorithm for solving the quadratic assignment problem (with and without kernel allocation technology) are proposed. These modifications are analyzed and compared with the best modern algorithms for solving this problem. The efficiency of the developed algorithms is shown, in particular, for large-scale problems for which new records were found with their help.

关键词： quadratic assignment problem repeated iterated tabu search solution kernel allocation technology random perturbation of solution components algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

RETRACTED: A novel registration and super-resolution jointed paradigm for medical images under internet of thing environment (Retracted article. See SEP, 2022)

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2019年第5期78卷 5107-5135页

作者： Lin, Yu Yang, Jie Mi, Jing Yang, Jingjing Zhang, Xiao Hebei North Univ Zhangjiakou 075000 Hebei Peoples R China

This paper proposes a novel registration and super-resolution jointed paradigm for medical images under the Internet of thing environment. In the medical image processing, the matching issue is one catches wide attention with the domain of research. Image registration technique can be divided into similarity measure, optimization, geometric transformation, and interpolation, etc. As the first essential clue of our model, we propose the novel registration algorithm based on energy feature extraction. Generally, the matching energy function by the similarity measurement and a penalty constitution is called the external force and endogenic force separately. The matching is an external force and endogenic force mutual competition, eventually achieves the balanced process. Furtherly, we integrate the game analysis and area feature selection to achieve the better image super-resolution mode through the pretreatment of the image to change the initial value, so as to achieve the purpose of improving the performance. Besides the algorithm level innovation, we integrate the GPU and the IOT to construct the hardware based implementation of the proposed medical image processing system. The latency of registers to read and write data across a GPU's entire storage system is minimal, it is private to each thread, and can only be accessed by its owning thread. For each thread, the local memory is also private and it is often used to deal with the problem of overflow register, reducing the buffer overflow caused by the entire application of a substantial decline in the possibility and shared memory is visible to all threads within the thread block. We then achieve the optimal integration of IOT and GPU. The experimental result proves the robustness of the method.

关键词： Medical image Image registration Image super-resolution Internet of things Data storage algorithm efficiency Jointed paradigm

来源：评论

学校读者我要写书评

暂无评论

Instance scale, numerical properties and design of metaheuristics: A study for the facility location problem

引用

IFAC-PapersOnLine 2019年第13期52卷 2219-2224页

作者： Chalupa, David Nielsen, Peter Operations Research Group Department of Materials and Production Aalborg University Fibigerstræde 16 Aalborg9220 Denmark

We present an in-depth computational study of two local search metaheuristics for the classical uncapacitated facility location problem. We investigate four problem instance models, studied for the same problem size, for which the two metaheuristics exhibit intriguing and contrasting behaviours. The metaheuristics explored include a local search (LS) algorithm that chooses the best moves in the current neighbourhood, while a randomised local search (RLS) algorithm chooses the first move that does not lead to a worsening. The experimental results indicate that the right choice between these two algorithms depends heavily on the distribution of coefficients within the problem instance. This is also put further into context by finding optimal or near-optimal solutions using a mixed-integer linear programming problem solver. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Integer programming Combinatorial optimization Heuristic algorithms Local search (optimization) Location algorithm efficiency Facility location problem Integer Linear Programming Local search Local search algorithm Local search metaheuristics Mixed integer linear programming problems Uncapacitated facility locations

来源：评论

学校读者我要写书评

暂无评论

TIN_DDM Buffer Surface Construction algorithm Based on Rolling Ball Acceleration Optimization Model

引用

Journal of Geodesy and Geoinformation Science 2020年第3期3卷 88-103页

作者： Jian DONG Zhiheng ZHANG Rencan PENG Gaixiao LI Mo WANG Department of Military Oceanograhy and Hydrography&Cartography Dalian Naval AcademyDalian 116018China Key Laboratory of Hydrographic Surveying and Mapping of PLA Dalian Naval AcademyDalian 116018China

In view of the TIN_DDM buffer surface existing in the construction and application of special data type,algorithm efficiency and precision are not matching;the paper applied the rolling ball model in the process of TIN_DDM buffer surface *** on the precision limitation analysis of rolling ball model,the overall precision control method of rolling ball model has been *** the efficiency requirement of TIN_DDM buffer surface construction,the influence principle of key sampling points and rolling ball radius to TIN_DDM buffer surface construction efficiency has been elaborated,and the rule of identifying key sampling points has also been ***,by erecting the numerical relationship between key sampling points and rolling ball radius,a TIN_DDM buffer surface construction algorithm based on rolling ball acceleration optimization model has been brought *** time complexity of the algorithm is O(n).The experiments show that the algorithm could realize the TIN_DDM buffer surface construction with high efficiency,and the algorithm precision is controlled with in 2σ.

关键词： TIN_DDM rolling ball model buffer surface construction algorithm precision algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

A hybrid algorithm for the load flow analysis of VSC-HVDC systems based on 1+√2 order Newton-Raphson and simplified Newton

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2020年第0期118卷 105828-000页

作者： Wei, Yanfang Li, Qiankun Liu, Kang-Zhi Wang, Peng Zeng, Zhihui Wang, Xiaowei Henan Polytech Univ Sch Elect Engn & Automat Jiaozuo 454000 Henan Peoples R China Chiba Univ Dept Elect & Elect Engn Chiba 2638522 Japan State Grid Henan Elect Power Res Inst Zhengzhou 454052 Peoples R China Xi An Jiao Tong Univ Sch Elect Engn Xian 710049 Peoples R China

With the rapid increase of multi-terminal and multi-infeed VSC-HVDC lines, the dimension and scale of AC/DC system equation and Jacobian matrix (JM) increase sharply, which makes the load flow (LF) analysis very complicated. In this paper, a new hybrid method is proposed to address this issue. This hybrid algorithm is composed of a 1 + root 2 order Newton-Raphson (NR) method and a simplified Newton (SN) method. Specifically, the 1 + root 2 order NR method is executed up to a preset number of iterations first, then the algorithm is switched to the SN until the system accuracy is met. A good compromise between the solution accuracy and computation burden can be achieved once a suitable iteration number is preset. To this end, a unified iterative form suitable for solving the LF of AC/DC systems with VSC-HVDC is derived in detail: a dimension reduction treatment is proposed to solve the problem of increasing dimension of JM;a rule of thumb is provided for the determination of the iteration number of 1 + root 2 order NR. Then, the proposed hybrid method is validated on the modified IEEE-14, 30, 57 and 118 test systems. Comparisons and analyses are made for numerous scenarios, including the basic test of LF, different control modes and control objectives, influence of active and reactive powers on VSC parameters, algorithm performance under various initial states and heavy loading, etc. Compared with Newton and 1 + root 2 order NR methods, the hybrid method shows a significantly shortened convergence time, 30% of 1 + root 2 order NR and 47% of Newton on average.

关键词： Voltage source converter AC/DC system Hybrid high-order Newton method Load flow algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

An Efficient algorithm for Computing Entropic Measures of Feature Subsets

An Efficient Algorithm for Computing Entropic Measures of Fe...

引用

European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD)

作者： Pennerath, Frederic Univ Lorraine LORIA CNRS Cent Supelec F-57000 Metz France Univ Paris Saclay LORIA CNRS Cent Supelec F-57000 Metz France

ISBN: (纸本)9783030109288;9783030109271

Entropic measures such as conditional entropy or mutual information have been used numerous times in pattern mining, for instance to characterize valuable itemsets or approximate functional dependencies. Strangely enough the fundamental problem of designing efficient algorithms to compute entropy of subsets of features (or mutual information of feature subsets relatively to some target feature) has received little attention compared to the analog problem of computing frequency of itemsets. The present article proposes to fill this gap: it introduces a fast and scalable method that computes entropy and mutual information for a large number of feature subsets by adopting the divide and conquer strategy used by FP-growth - one of the most efficient frequent itemset mining algorithm. In order to illustrate its practical interest, the algorithm is then used to solve the recently introduced problem of mining reliable approximate functional dependencies. It finally provides empirical evidences that in the context of non-redundant pattern extraction, the proposed method outperforms existing algorithms for both speed and scalability. Code related to this chapter is available at: https://***/P-Fred/HFP-Growth.

关键词： Pattern mining Entropic measures algorithm efficiency Approximate functional dependency Pattern redundancy

来源：评论

学校读者我要写书评

暂无评论

Instance Scale, Numerical Properties and Design of Metaheuristics: A Study for the Facility Location Problem 9

Instance Scale, Numerical Properties and Design of Metaheuri...

引用

9th IFAC/IFIP/IFORS/IISE/INFORMS Conference on Manufacturing Modelling, Management and Control (IFAC MIM)

作者： Chalupa, David Nielsen, Peter Aalborg Univ Operat Res Grp Dept Mat & Prod Fibigerstraede 16 DK-9220 Aalborg Denmark

We present an in-depth computational study of two local search metaheuristics for the classical uncapacitated facility location problem. We investigate four problem instance models, studied for the same problem size, for which the two metaheuristics exhibit intriguing and contrasting behaviours. The metaheuristics explored include a local search (LS) algorithm that chooses the best moves in the current neighbourhood, while a randomised local search (RLS) algorithm chooses the first move that does not lead to a worsening. The experimental results indicate that the right choice between these two algorithms depends heavily on the distribution of coefficients within the problem instance. This is also put further into context by finding optimal or near-optimal solutions using a mixed-integer linear programming problem solver. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： facility location problem local search combinatorial optimisation integer linear programming algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

Quantum Deterministic Computing

Quantum Deterministic Computing

引用

East-West Design & Test Symposium (EWDTS)

作者： Wajeb Gharibi Vladimir Hahanov Ka Lok Man Svetlana Chumachenko Eugenia Litvinova Ivan Hahanov University of Missouri Kansas City MO USA Design Automation Department Kharkov National University of Radio Electronics Kharkov Ukraine Xi'an Jiaotong-Liverpool University China

ISBN: (数字)9781728198996

ISBN: (纸本)9781728199009

A novel deterministic paradigm for creating quantum computing via photon transactions with the electrons of an atom is described. This paradigm is free of quantum logic. The practically focused evolutionary path of quantum computing starting with the classical approach is shown: Memory-Address-Transaction → Electron-Address-Transaction Electron → Address- Quantaction (EAQ). Qubit-vector models for describing functionalities are proposed that differ from the known truth tables in the compactness of description and technological ability of the algorithm implementation for synthesis and analysis of digital devices and SoC components. For example, we consider a memory-driven algorithm for the simulation of digital devices based on qubit-vector forms for describing functionalities with a significant increase in the performance of computational processes. These processes can be utilized for analysis and synthesis through parallel execution of logic operations. A set of comparative estimates of qubit models and methods for improving the efficiency of the algorithms for simulating digital devices is presented.

关键词： quantum computing quantum determinism Memory-Address-Transaction Electron-Address-Quantaction quantum transactions structure of electrons qubit vectors matrix data structures digital systems-on-chips quantum computing digital equipment Data structures Truth table algorithms parallel execution quanta algorithm simulation algorithm efficiency deterministic synthesis Electrons

来源：评论

学校读者我要写书评

暂无评论

Detection Of A Target Track Loss Based On The Shiryaev Rule Using Plots Amplitude Information

Detection Of A Target Track Loss Based On The Shiryaev Rule ...

引用

IEEE International Conference on Electronics and Nanotechnology (ELNANO)

作者： Oleksandr S. Neuimin Serhii Ya. Zhuk Igor O. Tovkach Viacheslav O. Chmelov Igor Sikorsky Kyiv Polytechnic Institute Kyiv Ukraine

ISBN: (数字)9781728197135

ISBN: (纸本)9781728197142

An important task of the radar data processing is target track loss detection, after which it is reset. It acquires special significance at small signal-to-noise ratio. The presence of plots amplitude information allows to increase the efficiency of target detection and target tracking in the presence of interference. In the work a sequential algorithm for target track loss detection using the plots amplitude information based on the Shiryaev rule is obtained. Moreover, the method of probabilistic data association is used to estimate target's movement parameters at small signal-to-noise ratio. The analysis of the obtained algorithm efficiency is performed on a model example of target tracking due to the survey radar which measures range and range rate using statistical modeling.

关键词： object detection probability radar signal processing sensor fusion target tracking Target tracking Object detection Radar signal processing Sensor fusion algorithm efficiency Probability data association signal to noise ratios radar data processing sequential algorithm Moving parameter

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：