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

Video image target monitoring based on RNN-LSTM

MULTIMEDIA TOOLS AND APPLICATIONS 2019年第4期78卷 4527-4544页

作者： Liu, Feng Chen, Zhigang Wang, Jie Cent S Univ Sch Software Changsha 410075 Hunan Peoples R China Univ Jinan Sch Informat Sci & Engn Jinan Shandong Peoples R China Hengyang Normal Univ Coll Comp Sci & Technol Hengyang Peoples R China

Traditional image object classification and detection algorithms and strategies cannot meet the problem of video image acquisition and processing. Deep learning deliberately simulates the hierarchical structure of human brain, and establishes the mapping from low-level signals to high-level semantics, so as to achieve hierarchical feature representation of data. Deep learning technology has powerful visual information processing ability, which has become the forefront technology and domestic and international research hotspots to deal with this challenge. In order to solve the problem of target space location in video surveillance system, time-consuming and other problems, in this paper, we propose the algorithm based on RNN-LSTM deep learning. At the same time, according to the principle of OpenGL perspective imaging and photogrammetry consistency, we use 3D scene simulation imaging technology, relying on the corresponding relationship between video images and simulation images we locate the target object. In the 3D virtual scene, we set up the virtual camera to simulate the imaging processing of the actual camera, and the pixel coordinates in the video image of the surveillance target are substituted into the simulation image, next, the spatial coordinates of the target are inverted by the inverse process of the virtual imaging. The experimental results show that the detection of target objects has high accuracy, which has an important reference value for outdoor target localization through video surveillance images.

关键词： Recurrent neural network Long short-term memory Deep learning network Video image Target monitoring algorithm design

来源：评论

学校读者我要写书评

暂无评论

Semi-dynamic algorithms for strongly chordal graphs

引用

DISCRETE MATHEMATICS algorithmS AND APPLICATIONS 2021年第4期13卷

作者： Rahman, Md Zamilur Mukhopadhyay, Asish Univ Windsor Sch Comp Sci Windsor ON N9B 3P4 Canada

Within the broad ambit of algorithm design, the study of dynamic graph algorithms continues to be a thriving area of research. Commensurate with this interest is an extensive literature on the topic. Not surprisingly, dynamic algorithms for all varieties of shortest path problems, in view of their practical importance, occupy a preeminent position. Relevant to this paper are fully dynamic algorithms for chordal graphs. Surprisingly, to the best of our knowledge, there seems to be no reported results for the problem of dynamic algorithms for strongly chordal graphs. To redress this gap, in this paper, we propose a semi-dynamic algorithm for edge-deletions and a semi-dynamic algorithm for edge-insertions in a strongly chordal graph, G. The query complexity of an edge-deletion is O(d(u)(2)d(v)(2)), where d(u) and d(v) are the degrees of the vertices u and v of the candidate edge {u,v}, while the query complexity of an edge-insertion is O(n(2)), where n is the number of vertices of G.

关键词： algorithm design graph algorithms semi-dynamic algorithms strongly chordal graphs

来源：评论

学校读者我要写书评

暂无评论

Prufer Coding: A Vectorization Method for Undirected Labeled Graph

引用

IEEE ACCESS 2020年 8卷 175360-175369页

作者： Yang, Lin Wang, Yongjie Natl Univ Def Technol Coll Elect Engn Hefei 230037 Peoples R China Anhui Key Lab Cyberspace Secur Situat Awareness & Hefei 230037 Peoples R China

Prufer algorithm is a powerful method for topology vectorization, but the traditional prufer algorithm method can only encode a rootless labeled tree, and no prior work has studied the method of applying it to the graph vectorization. This paper proposes a vectorization method for undirected labeled graphs based on the prufer algorithm, including graph encoding and decoding algorithms. A particular case was discovered by preliminary experiments, which will reduce the accuracy of the coding algorithm (when the node size reaches more than 150, the accuracy can only reach about 60%), so a connectivity check mechanism that based on the Warshall algorithm is proposed and added to the coding algorithm. A large number of experimental verifications show that the accuracy of the coding algorithm can reach 100% after introducing this mechanism. Then the length of the vector generated by the coding algorithm is analyzed, and the results show that graph vectorization can improve the efficiency of partial topology calculation. Finally, the defects of the algorithm are discussed. The most significant defect is that the length of the vector generated by the encoding algorithm is uncertain, which will prevent it from being applied to more topological calculations.

关键词： Encoding Decoding Topology Network topology Licenses Skeleton Sorting Graph vectorization topology calculation prufer algorithm Warshall algorithm algorithm design

来源：评论

学校读者我要写书评

暂无评论

Fast constant-time gcd computation and modular inversion

IACR Transactions on Cryptographic Hardware and Embedded Sys...

引用

IACR Transactions on Cryptographic Hardware and Embedded Systems 2019年第3期2019卷 340-398页

作者： Bernstein, Daniel J. Yang, Bo-Yin Department of Computer Science University of Illinois at Chicago ChicagoIL60607–7045 United States Horst Görtz Institute for IT Security Ruhr University Bochum Germany Institute of Information Science and Research Center of Information Technology and Innovation Academia Sinica 128 Section 2 Academia Road Taipei115-29 Taiwan

This paper introduces streamlined constant-time variants of Euclid’s algorithm, both for polynomial inputs and for integer inputs. As concrete applications, this paper saves time in (1) modular inversion for Curve25519, which was previously believed to be handled much more efficiently by Fermat’s method, and (2) key generation for the ntruhrss701 and sntrup4591761 lattice-based cryptosystems. © 2019, Ruhr-University of Bochum. All rights reserved.

关键词： algorithm design Branchless algorithms Constant-time computations Curve25519 Euclid’s algorithm Gcd Greatest common divisor Modular inversion Modular reciprocal NTRU

来源：评论

学校读者我要写书评

暂无评论

Revenue-maximizing virtualized network function chain placement in dynamic environment

引用

Future Generation Computer Systems 2020年 108卷 650-661页

作者： Yanghao Xie Sheng Wang Yueyue Dai School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu PR China

Network Function Virtualization (NFV) is a promising paradigm which can increase network flexibility by deploying newly network services into networks. Because of the flexibility, NFV is also considered as one of the building blocks for 5G and edge computing. However, the intrinsic dynamic features of NFV and the rigorous requirements proposed by 5G and edge computing, such as delay, pose significant challenges to make the optimal Virtual Network Function (VNF) chain placement. To address this problem, we first formulate the VNF chain placement problem as an integer linear programming problem with taking the dynamic characteristics in to consideration. Then we propose an efficient dynamic algorithm, called DynAmic vnF placemenT (DAFT), which provides a good solution for VNF chain placement. DAFT is based on primal–dual technique and combines with an efficient subroutine which is solved by reducing to the shortest path problem. The theoretic analysis shows DAFT is ( 1 − 1 ∕ e ) -competitive to offline optimal solution. We also propose a modified algorithm concerning algorithm implementation issues, which is called Feasible DAFT (FDAFT). Finally, we evaluate the proposed algorithms through extensive numerical simulations. The experiment results show that DAFT and FDAFT achieve average competitive ratios up to 98.42% and 96.74%, respectively and outperform the compared algorithms around 50%.

关键词： Network Function Virtualization Next generation networks Resource allocation algorithm design

来源：评论

学校读者我要写书评

暂无评论

Enhanced Strapdown Attitude Computation

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2020年第6期43卷 1220-1224页

作者： Ignagni, Mario ASTER Labs Inc St Paul MN 55126 USA

A study is conducted to assess the implicit error associated with the use of the Goodman–Robinson rotation-vector equation in the presence of such angular motions, and to evaluate the potential of a simple algorithmic enhancement of this equation to improve attitude accuracy. The simplified Goodman–Robinson rotation-vector equation approximates the second term on the right-hand side of the first equation using the integral of the angular-rate vector instead of the rotation vector, with the third term being eliminated altogether. To determine the accuracy associated with the Goodman–Robinson rotation-vector equation, two angular-rate profiles are considered, such as a generalized angular rate and a coning angular rate.

关键词： Angular Motion Numerical Integration algorithm design Quaternions Vibration Isolation Strapdown Navigation Military Aviation Diminishing Returns Airborne Computers Aircraft Maneuvers

来源：评论

学校读者我要写书评

暂无评论

Routing in triple loop circulants: A case of networks-on-chip

引用

HELIYON 2020年第7期6卷 e04427页

作者： Romanov, Aleksandr Yu Starykh, Vladimir A. Natl Res Univ Higher Sch Econ 34 Tallinskaya Ulitsa Moscow 123458 Russia

In this paper we propose and analyze various approaches to organizing routing in a triple loop circulant topologies as applied to networks-on-chip: static routing based on universal graph search algorithms, such as Dijkstra's algorithm and a possible implementation using Table routing;algorithms created analytically based on an engineering approach with taking into account the structural features of triple loop circulant graphs (Advanced clockwise, Direction selection);an algorithm created on the basis of a mathematical analysis of graph structure and solving the problem of enumerating coefficients at generators (Coefficients finding algorithm). Efficiency, maximum graph paths, occupied memory resources, and calculation time of the algorithms developed are estimated. Comparison of various variants of the algorithms is made and recommendations on their application for the development of networks-on-chip with triple loop circulant topologies are given. It is shown that Advanced clockwise and Direction selection algorithms guarantee that the packet reaches the destination node, but often in more steps than the shortest path. Nevertheless, they themselves are simpler and require less hardware resources than other algorithms. In turn, Coefficients finding algorithm has great computational complexity, but is optimal and, in comparison with Dijkstra's algorithm, is much simpler for RTL implementation which reduces network-on-chip routers resources cost.

关键词： Electrical engineering Topology Computer architecture algorithm design Very-large-scale integration Computer-aided engineering Network-on-chip Dijkstra's algorithm Triple loop circulant Routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Scaling in Concurrent Evolutionary algorithms 6th

Scaling in Concurrent Evolutionary Algorithms

引用

6th Workshop on Engineering Applications (WEA)

作者： Merelo, Juan J. Laredo, J. L. J. Castillo, Pedro A. Garcia-Valdez, Jose-Mario Rojas-Galeano, Sergio Univ Granada CITIC Granada Spain Univ Havre Normandie LITIS RI2C Le Havre France Inst Tecnol Tijuana Calzada Tecnol S-N Tijuana Mexico Univ Distrital Francisco Jose de Caldas Sch Engn Bogota Colombia

ISBN: (纸本)9783030310196;9783030310189

The concept of channel, a computational mechanism used to convey state to different threads of process execution, is at the core of the design of multi-threaded concurrent algorithms. In the case of concurrent evolutionary algorithms, channels can be used to communicate messages between several threads performing different evolution tasks related to genetic operations or mixing of populations. In this paper we study to what extent the design of these messages in a communicating sequential process context may influence scaling and performance of concurrent evolutionary algorithms. For this aim, we designed a channel-based concurrent evolutionary algorithm that is able to effectively solve different benchmark binary problems (e.g. OneMax, LeadingOnes, RoyalRoad), showing that it provides a good basis to leverage the multithreaded and multi-core capabilities of modern computers. Although our results indicate that concurrency is advantageous to scale-up the performance of evolutionary algorithms, they also highlight how the trade-off between concurrency, communication and evolutionary parameters affect the outcome of the evolved solutions, opening-up new opportunities for algorithm design.

关键词： Concurrency Concurrent evolutionary algorithms Performance evaluation algorithm design Distributed evolutionary algorithm

来源：评论

学校读者我要写书评

暂无评论

Multidisciplinary design of Ultra-High-Speed Electrical Machines

引用

IEEE TRANSACTIONS ON ENERGY CONVERSION 2018年第3期33卷 1203-1212页

作者： Ismagilov, Flur R. Uzhegov, Nikita Vavilov, Vyacheslav E. Bekuzin, Vladimir I. Ayguzina, Valentina V. Ufa State Aviat Tech Univ Dept Electromech Ufa 450005 Russia SpinDrive Lappeenranta 54100 Finland

This paper presents a multidisciplinary design algorithm of the ultra-high-speed electrical machine (UHSEM). Presented algorithm enables UHSEM design with a rotational speed of 0.5-1.2 Mrpm, taking into account the mutual influence of thermal, mechanical, and electromagnetic processes. Based on the algorithm, the 138 W UHSEM with a 1.2 Mrpm rotational speed was calculated. Material selection for the active parts of the machine is described. Analysis of the suitable bearings for UHSEM application is presented. Mechanical, electromagnetic, and cooling design aspects are shown with example of the calculated machine. To evaluate the effectiveness of the developed computer models and the calculation method, the experimental model of the 100 W UHSEM was tested in the motor mode at the rotational speed of 500 000 rpm. The test results demonstrated that the multidisciplinary design algorithm has high accuracy and is suitable for UHSEMs. The discrepancy between developed models and experimental results does not exceed 7%.

关键词： Ultra-high-speed electrical machine algorithm design permanent magnets

来源：评论

学校读者我要写书评

暂无评论

On Virtual Network Embedding: Paths and Cycles 27

On Virtual Network Embedding: Paths and Cycles

引用

IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)

作者： Wu, Haitao Zhou, Fen Chen, Yaojun Zhang, Ran Nanjing Univ Dept Math Nanjing 210093 Peoples R China Univ Avignon CERI LIA Avignon France Inst Super Elect Paris LISITE Lab Paris France Shanghai Univ Finance & Econ Sch Math Guoding Rd 777 Shanghai 200433 Peoples R China

ISBN: (纸本)9781728149516;9781728149509

Network virtualization provides a promising solution to overcome the ossification of current networks, allowing multiple Virtual Network Requests (VNRs) embedded on a common infrastructure. The major challenge in network virtualization is the Virtual Network Embedding (VNE) problem, which is to embed VNRs onto a shared substrate network and known to be NP-hard. The topological heterogeneity of VNRs is one important factor hampering the performance of the VNE. However, in many specialized applications and infrastructures, VNRs are of some common structural features e.g., paths and cycles. To achieve better outcomes, it is thus critical to design dedicated algorithms for these applications and infrastructures by taking into accounting topological characteristics. Besides, paths and cycles are two of the most fundamental topologies that all network structures consist of. Exploiting the characteristics of path and cycle embeddings is vital to tackle the general VNE problem. In this paper, we investigated the path and cycle embedding problems. For path embedding, we utilize Multiple Knapsack Problem (MKP) and Multi-Dimensional Knapsack Problem (MDKP), we proposed an efficient and effective MKP-MDKP-based algorithm. For cycle embedding, we proposed a Weighted Directed Auxiliary Graph (WDAG) to develop a polynomial-time algorithm to determine the least-resource-consuming embedding. Numerical results showed our customized algorithms can boost the acceptance ratio and revenue compared to generic embedding algorithms in the literature.

关键词： Virtual Network Embedding (VNE) Path and Cycles Embeddings algorithm design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：