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

arXiv 2018年

作者： Merchant, Farhad Vatwani, Tarun Chattopadhyay, Anupam Raha, Soumyendu Nandy, S.K. Narayan, Ranjani Institute for Communication Technologies and Embedded Systems RWTH Aachen University Germany Hardware and Embedded Systems Lab Nanyang Technological University Singapore Scientific Computation Laboratory Indian Institute of Science Bangalore India Computer Aided Design Laboratory Indian Institute of Science Bangalore India Morphing Machines Pvt. Ltd

In this paper, we present efficient realization of Kalman Filter (KF) that can achieve up to 65% of the theoretical peak performance of underlying architecture platform. KF is realized using Modified Faddeeva Algorithm (MFA) as a basic building block due to its versatility and REDEFINE Coarse Grained Reconfigurable Architecture (CGRA) is used as a platform for experiments since REDEFINE is capable of supporting realization of a set algorithmic compute structures at run-time on a Reconfigurable Data-path (RDP). We perform several hardware and software based optimizations in the realization of KF to achieve 116% improvement in terms of Gflops over the first realization of KF. Overall, with the presented approach for KF, 4-105x performance improvement in terms of Gflops/watt over several academically and commercially available realizations of KF is attained. In REDEFINE, we show that our implementation is scalable and the performance attained is commensurate with the underlying hardware resources. Copyright © 2018, The Authors. All rights reserved.

关键词： Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Parallelizing an embedded real-Time person matching system for smart cameras

Ada User Journal

引用

Ada User Journal 2017年第3期38卷 157-166页

作者： Bid, Nesrine A. Loukil, Kais Ayedi, Walid Abid, Mohamcd Laboratory of Computer and Embedded Systems National School of Engineering of Sfax 3038 Tunisia MMA Laboratory National Institute of Applied Sciences and Technology 676-1080 Tunisia Department of Electrical and Computer Engineering Renewable Energy Group King Abdulaziz University 21589 Saudi Arabia

Person matching is an important topic in video- surveillance and can be used to design detection, tracking and recognition systems. Multi-scale covariance (MSCOV) is considered as one of the most promising descriptors for person matching. Unfortunately, implementing such descriptors for person matching requires heavy computation. For a system that requires real-Time matching, visual information needs to be fast processed without reducing accuracy. Parallel processing is frequently adopted to speed-up execution-Time. This paper presents an optimized parallel model of a person matching system based on MSCOV. To this aim, a high-level parallelization approach based on the exploration of task and data levels of parallelism is adopted. Starting from the block diagram, an initial model that extracts the maximum task-level parallelism is proposed. This model is implemented and validated at a high system-level. Analyzing the communication and computation workload results, the potential bottlenecks of this model are identified. An optimized parallel model with the best workload balance is then developed. This model is prototyped and validated using a multicore architecture. The experimental results are promising and the system is shown to perform person matching in real-Time with 16.33 fps using a dual-core ARM-Cortex-A9.

关键词： Security systems

来源：评论

学校读者我要写书评

暂无评论

MAVSec: Securing the MAVLink protocol for ardupilot/PX4 unmanned aerial systems

arXiv

引用

arXiv 2019年

作者： Allouch, Azza Cheikhrouhou, Omar Koubaa, Anis Khalgui, Mohamed Abbes, Tarek University of El Manar Tunis Tunisia College of CIT Taif University Taif Saudi Arabia Computer and Embedded Systems Laboratory University of Sfax Sfax Tunisia Prince Sultan University Saudi Arabia CISTER INESC-TEC ISEP Portugal Gaitech Robotics China University of Carthage Tunis Tunisia Digital Security Research Unit ENETCOM University of Sfax Sfax Tunisia

The MAVLink is a lightweight communication protocol between Unmanned Aerial Vehicles (UAVs) and ground control stations (GCSs). It defines a set of bi-directional messages exchanged between a UAV (aka drone) and a ground station. The messages carry out information about the UAV's states and control commands sent from the ground station. However, the MAVLink protocol is not secure and has several vulnerabilities to different attacks that result in critical threats and safety concerns. Very few studies provided solutions to this problem. In this paper, we discuss the security vulnerabilities of the MAVLink protocol and propose MAVSec, a security-integrated mechanism for MAVLink that leverages the use of encryption algorithms to ensure the protection of exchanged MAVLink messages between UAVs and GCSs. To validate MAVSec, we implemented it in Ardupilot and evaluated the performance of different encryption algorithms (i.e. AES-CBC, AES-CTR, RC4 and ChaCha20) in terms of memory usage and CPU consumption. The experimental results show that ChaCha20 has a better performance and is more efficient than other encryption algorithms. Integrating ChaCha20 into MAVLink can guarantee its messages confidentiality, without affecting its performance, while occupying less memory and CPU consumption, thus, preserving memory and saving the battery for the resource-constrained drone. Copyright © 2019, The Authors. All rights reserved.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Multi-task variational information bottleneck

arXiv

引用

arXiv 2020年

作者： Qian, Weizhu Chen, Bowei Zhang, Yichao Wen, Guanghui Gechter, Franck Le laboratoire Connaissance et Intelligence Artificielle Distribuées Université Bourgogne Franche-Comté France Adam Smith Business School University of Glasgow United Kingdom Department of Computer Science and Technology Tongji University China Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai200092 China Department of Systems Science School of Mathematics Southeast University Nanjing210016 China School of Engineering RMIT University MelbourneVIC3000 Australia Le laboratoire Connaissance et Intelligence Artificielle Distribuées Université Bourgogne Franche-Comté and Mosel LORIA UMR CNRS Université de Lorraine 7503 France

Multi-task learning (MTL) is an important subject in machine learning and artificial intelligence. Its applications to computer vision, signal processing, and speech recognition are ubiquitous. Although this subject has attracted considerable attention recently, the performance and robustness of the existing models to different tasks have not been well balanced. This article proposes an MTL model based on the architecture of the variational information bottleneck (VIB), which can provide a more effective latent representation of the input features for the downstream tasks. Extensive observations on three public data sets under adversarial attacks show that the proposed model is competitive to the state-of-the-art algorithms concerning the prediction accuracy. Experimental results suggest that combining the VIB and the task-dependent uncertainties is a very effective way to abstract valid information from the input features for accomplishing multiple tasks. © 2020, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Parallel Implementation for Real Time Person Matching System

Parallel Implementation for Real Time Person Matching System

引用

International Conference on Microelectronics, ICM

作者： Nesrine Abid Tarek Ouni Kais Loukil Mohamed Abid Ahmed Chiheb Ammeri Laboratory of Computer and Embedded Systems National School of Engineering of Sfax SFAX TUNISIA Digital Research Center SFAX TUNISIA Electrical and Computer Engineering Department College of Engineering Sultan Qaboos University Al-Khod Muscat Sultanate of Oman

ISBN: (纸本)9781538681688;9781538681671

Local Binary Pattern multi-scale covariance descriptor (LBP_MSCOV) has been proved to be robust for video surveillance applications such as person detection, tracking and re-identification. Matching technique has recently grown in interest. It can be used to design person detection, tracking and re-identification. However, the original version is difficult to execute in real time. It requires a large data set and complex operations. Parallel implementation is adopted to achieve real time constraints. In this paper, we propose an optimized parallel model of a person matching algorithm based on LBP_MSCOV. For this end, a high-level parallelization approach based on the exploration of task and data levels of parallelism is adopted. First, an initial model is defined using only task-level parallelism. Second, this model is validated and analyzed at a high level of abstraction. Using the communication and computation workload results, the potential bottlenecks of this model are then identified. Concurrent optimizations are then performed to propose an optimized parallel model with the best workload balance. Finally, this model is validated and prototyped using a dual-core ARM-Cortex-A9architecture achieving up to 20.21 fps processing performance.

关键词： Computational modeling Feature extraction Microsoft Windows Microelectronics Task analysis Covariance matrices Real-time systems

来源：评论

学校读者我要写书评

暂无评论

MapReduce-based parallel GEP algorithm for efficient function mining in big data applications

MapReduce-based parallel GEP algorithm for efficient functio...

引用

作者： Liu, Yang Ma, Chenxiao Xu, Lixiong Shen, Xiaodong Li, Maozhen Li, Pengcheng School of Electrical Engineering and Information Sichuan University Chengdu610065 China Department of Electronic and Computer Engineering Brunel University London UxbridgeUB8 3PH United Kingdom Key Laboratory of Embedded Systems and Service Computing Ministry of Education Tongji University Shanghai200092 China State Grid Shanxi Electric Power Company Xi'an710048 China

Gene expression programming (GEP) algorithm is one of the most effective function mining algorithms in enabling the mathematical equation fitting for the input dataset. However, GEP algorithm encounters low efficiency issue in big data processing due to large overhead in its evolution when it handles the large-scale data. In order to solve the issue, this paper presents two parallelized GEP algorithms using MapReduce. Based on data separation, the first algorithm aims at speeding up the large-scale classification. However, it is lack of ability to output the mined equation explicitly. Therefore, based on the further improvements of the first algorithm, the second parallelized GEP algorithm aims at mining the equation efficiently and also outputs the equation explicitly and directly. The experimental results show that both algorithms are effective for processing large volume of data. © 2017 John Wiley & Sons, Ltd.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Centralized and distributed optimum power control and beam-forming in network flooding 23

Centralized and distributed optimum power control and beam-f...

引用

23rd European Wireless Conference, EW 2017

作者： Abdelkader, Abdelrahman Jorswieck, Eduard A. Zimmerling, Marco Communications Laboratory Faculty of Electrical and Computer Engineering TU Dresden Germany Networked Embedded Systems Group Center for Advancing Electronics Dresden TU Dresden Germany

ISBN: (纸本)9783800744268

We consider a device-to-device wireless multi-hop communication scenario with resource-constrained devices that require energy-efficient connectivity. Based on the recently proposed Glossy network flooding protocol, we develop both centralized and distributed beam-forming and power control algorithms, and analyze their performance. The proposed schemes are compared in terms of their energy efficiency to the standard Glossy. Numerical simulations demonstrate that a centralized power control scheme can achieve several-fold improvements in energy efficiency over Glossy across a wide spectrum of network configurations at comparable packet reception rates. We also show how power control and beam-forming can be applied in a distributed manner and demonstrate achievable gains compared to standard Glossy. The results indicate that adaptive power control and distributed beam-forming strategies improve energy efficiency, which is one important performance indicator in 5G Internet-of-Things applications. © VDE VERLAG GMBH · Berlin · Offenbach.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Pre-training of an artificial neural network for software fault prediction 7

Pre-training of an artificial neural network for software fa...

引用

7th International Conference on computer and Knowledge Engineering, ICCKE 2017

作者： Owhadi-Kareshk, Moein Sedaghat, Yasser Akbarzadeh, Mohammad-R.-T. Center of Excellence On Soft Computing and Intelligent Information Processing Ireland Dependable Distributed Embedded Systems Laboratory Department of Computer Engineering Ferdowsi University of Mashhad Mashhad Iran

ISBN: (纸本)9781538608043

Software fault prediction is one of the significant stages in the software testing process. At this stage, the probability of fault occurrence is predicted based on the documented information of the software systems that are already tested. Using this prior knowledge, developers and testing teams can better manage the testing process. There are many efforts in the field of machine learning to solve this classification problem. We propose to use a pre-training technique for a shallow, i.e. with fewer hidden layers, Artificial Neural Network (ANN). While this method is usually employed to prevent over-fitting in deep ANNs, our results indicate that even in a shallow network, it improves the accuracy by escaping from local minima. We compare the proposed method with four SVM-based classifiers and a regular ANN without pre-training on seven datasets from NASA codes in the PROMISE repository. Results confirm that the pre-training improves accuracy by achieving the best overall ranking of 1.43. Among seven datasets, our method has higher accuracy in four of them, while ANN and support vector machine are the best for two and one datasets, respectively. © 2017 IEEE.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

Adaptive morphological reconstruction for seeded image segmentation

arXiv

引用

arXiv 2019年

作者： Lei, Tao Jia, Xiaohong Liu, Tongliang Liu, Shigang Meng, Hongying Nandi, Asoke K. School of Electronical and Information Engineering Shaanxi University of Science and Technology Xi’an710021 China School of Computer Science Northwestern Polytechnical University Xi’an710072 China School of Electronical and Information Engineering Shaanxi University of Science and Technology Xi’an710021 China School of Computer Science University of Sydney Sydney Australia School of Computer Science Shaanxi Normal University Xi’an710119 China Department of Electronic and Computer Engineering Brunel University London Uxbridge MiddlesexUB8 3PH United Kingdom Department of Electronic and Computer Engineering Brunel University London Uxbridge MiddlesexUB8 3PH United Kingdom Key Laboratory of Embedded Systems and Service Computing Col- lege of Electronic and Information Engineering Tongji University Shanghai200092 China

—Morphological reconstruction (MR) is often employed by seeded image segmentation algorithms such as watershed transform and power watershed as it is able to filter seeds (regional minima) to reduce over-segmentation. However, MR might mistakenly filter meaningful seeds that are required for generating accurate segmentation and it is also sensitive to the scale because a single-scale structuring element is employed. In this paper, a novel adaptive morphological reconstruction (AMR) operation is proposed that has three advantages. Firstly, AMR can adaptively filter useless seeds while preserving meaningful ones. Secondly, AMR is insensitive to the scale of structuring elements because multiscale structuring elements are employed. Finally, AMR has two attractive properties: monotonic increasingness and convergence that help seeded segmentation algorithms to achieve a hierarchical segmentation. Experiments clearly demonstrate that AMR is useful for improving algorithms of seeded image segmentation and seed-based spectral segmentation. Compared to several state-of-the-art algorithms, the proposed algorithms provide better segmentation results requiring less computing time. Source code is available at https://***/SUST-reynole/AMR. Copyright © 2019, The Authors. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Analysis of the possibility of levitation of ferromagnetic bodies in a static magnetic field

引用

IOP Conference Series: Materials Science and Engineering 2019年第1期680卷

作者： M A Vernezi K I Goryanina O I Katin D Yu Donskoy A D Lukyanov A N Tooraj Laboratory of local automation and embedded systems Don State Technical University Gagarin Square 1 Rostov-on-Don 344000 Russia Federation Instrumentation Lab School of electrical and computer engineering University of Tehran Tehran Iran

The hypothesis of the existence of three-dimensional regions near the sources of the magnetic field, in which it is possible to obtain a stable position of the magnetic object in a stationary field. The hypothesis is based on the existence of two types of points: points with zero field level and points with local extremum of this field. The obtained distributions of magnetic forces act stabilizing on the object under study, in particular, create the effect of levitation of ferromagnetic bodies in the gravitational field of the Earth. Examples of configurations of the field sources that generate many such points. systems of current windings providing creation of one-and two-dimensional configurations of areas near sources within which magnetic levitation is possible are analyzed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：