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

An Instance-Specific Parameter Tuning Approach Using Fuzzy Logic for a Post Processing Topological Map-Matching algorithm

引用

IEEE INTELLIGENT TRANSPORTATION SYSTEMS MAGAZINE 2018年第4期10卷 87-97页

作者： Alejandra Blazquez, Carola Ries, Jana Jesus Leon, Roberto Andres Miranda, Pablo Univ Andres Bello Villa Del Mar Chile Univ Portsmouth Operat & Syst Management Grp Portsmouth Hants England Pontificia Univ Catolica Valparaiso Sch Ind Engn Valparaiso Chile

Map Matching algorithms (MMAs) are developed to solve spatial ambiguities that arise in the process of assigning GPS measurements onto a digital roadway network. Scarce systematic parameter tuning approaches exist in the literature for optimizing MMA performance. Thus, a novel framework is proposed for a systematic calibration of the parameters of a post-processing MMA. The calibration approach consists of an Instance-specific Parameter Tuning Strategy (IPTS) that employs Fuzzy Logic principles. The proposed fuzzy IPTS tool determines algorithm-specific parameter values based on instance-specific information a priori to the execution of the MMA. Finally, the proposed IPTS tool is able to adjust to two particular decision maker preferences on algorithm performance, namely solution quality and computational time.

关键词： Global Positioning System Road safety Tuning Fuzzy logic Calibration algorithm design and analysis Spatial analysis Decision making

来源：评论

学校读者我要写书评

暂无评论

Routing Cost Minimization and Throughput Maximization of NFV-Enabled Unicasting in Software-Defined Networks

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2018年第2期15卷 732-745页

作者： Jia, Mike Liang, Weifa Huang, Meitain Xu, Zichuan Ma, Yu Australian Natl Univ Res Sch Comp Sci Canberra ACT 2601 Australia Dalian Univ Technol Sch Software Dalian 116024 Peoples R China

Data transfer in contemporary networks usually is associated with strict policy enforcement for data transfer security and system performance purposes. Such a policy is represented by a service chain consisting of a sequence of network functions such as firewalls, intrusion detection systems, transcoders, etc. Due to the high cost and inflexibility of managing hardware-based network functions, network function virtualization (NFV) has emerged as a promising technology to meet the stringent requirement imposed on the service chain of each data transfer request in a low-cost and flexible way. In this paper, we study policy-aware unicast request admissions with and without end-to-end delay constraints in a software defined network. We aim to minimize the operational cost of admitting a single request in terms of both computing resource consumption for implementing the NFVs in the service chain and bandwidth resource consumption for routing its data traffic, or maximize the network throughput for a sequence of requests without the knowledge of future request arrivals. We first formulate four novel optimization problems and provide a generic optimization framework for the problems. We then develop efficient algorithms for the admission of a single NFV-enabled request with and without the end-to-end delay constraint, where NFV-enabled requests are defined as the requests with policy enforcement requirements. We also devise online algorithms with a guaranteed performance for dynamic admissions of requests without the knowledge of future arrivals. In particular, we provide the very first online algorithm with a provable competitive ratio for the problem without the end-to-end delay requirement. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results show that the proposed algorithms are promising and outperform existing heuristics.

关键词： Policy-aware unicasting operational cost minimization online algorithms service chains software defined networks network function virtualization algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Gene Tree Construction and Correction Using SuperTree and Reconciliation

引用

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2018年第5期15卷 1560-1570页

作者： Lafond, Manuel Chauve, Cedric El-Mabrouk, Nadia Ouangraoua, Aida Univ Montreal Dept Informat DIRO Montreal PQ H3T 1J4 Canada Simon Fraser Univ Dept Math Burnaby BC V5A 1S6 Canada Univ Sherbrooke Dept Informat Sherbrooke PQ J1K 2R1 Canada

The supertree problem asking for a tree displaying a set of consistent input trees has been largely considered for the reconstruction of species trees. Here, we rather explore this framework for the sake of reconstructing a gene tree from a set of input gene trees on partial data. In this perspective, the phylogenetic tree for the species containing the genes of interest can be used to choose among the many possible compatible "supergenetrees", the most natural criteria being to minimize a reconciliation cost. We develop a variety of algorithmic solutions for the construction and correction of gene trees using the supertree framework. A dynamic programming supertree algorithm for constructing or correcting gene trees, exponential in the number of input trees, is first developed for the less constrained version of the problem. It is then adapted to gene trees with nodes labeled as duplication or speciation, the additional constraint being to preserve the orthology and paralogy relations between genes. Then, a quadratic time algorithm is developed for efficiently correcting an initial gene tree while preserving a set of "trusted" subtrees, as well as the relative phylogenetic distance between them, in both cases of labeled or unlabeled input trees. By applying these algorithms to the set of Ensembl gene trees, we show that this new correction framework is particularly useful to correct weakly-supported duplication nodes. The C++ source code for the algorithms and simulations described in the paper are available at https://***/UdeM-LBIT/SuGeT.

关键词： algorithm design and analysis bioinformatics phylogeny reconciliation supertree

来源：评论

学校读者我要写书评

暂无评论

Greenput: A Power-Saving algorithm That Achieves Maximum Throughput in Wireless Networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2018年第2期26卷 906-919页

作者： Chang, Cheng-Shang Lee, Duan-Shin Su, Chia-Kai Natl Tsing Hua Univ Inst Commun Engn Hsinchu 300 Taiwan

The dynamic frame sizing algorithm is a throughput-optimal algorithm that can achieve maximum network throughput without the knowledge of arrival rates. Motivated by the need for energy-efficient communication in wireless networks, in this paper, we propose a new dynamic frame sizing algorithm, called the Greenput algorithm, that takes power allocation into account. In our Greenput algorithm, time is partitioned into frames, and the frame size of each frame is determined based on the backlogs presented at the beginning of a frame. To obtain a good delay-energy efficiency tradeoff, the key insight of our Greenput algorithm is to reduce transmit power to save energy when the backlogs are low so as not to incur too much packet delay. For this, we define a threshold parameter T-max (for the minimum time to empty the backlogs with maximum power allocation), and the Greenput algorithm enters the (mixed) power-saving mode when the backlogs are below the threshold. Using a large deviation bound, we prove that our Greenput algorithm is still throughput optimal. In addition to the stability result, we also perform a fluid approximation analysis for energy efficiency and average packet delay when T-max is very large. To show the delay-energy efficiency tradeoff, we conduct extensive computer simulations by using the Shannon formula as the channel model in a wireless network. Our simulation results show that both energy efficiency and average packet delay are quite close to their fluid approximations even when T-max is moderately large.

关键词： Queueing analysis optimization algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Mobile Target Coverage and Tracking on Drone-Be-Gone UAV Cyber-Physical Testbed

引用

IEEE SYSTEMS JOURNAL 2018年第4期12卷 3485-3496页

作者： Khan, Mouhyemen Heurtefeux, Karel Mohamed, Amr Harras, Khaled A. Hassan, Mohammad Mehedi Qatar Univ Dept Comp Sci & Engn Doha Qatar Carnegie Mellon Univ Comp Sci Dept Doha Qatar King Saud Univ Coll Comp & Informat Sci Riyadh 11543 Saudi Arabia

Mobile wireless sensor networks have been extensively deployed for enhancing environmental monitoring and surveillance. The availability of low-cost mobile robots equipped with a variety of sensors makes them promising in target coverage tasks. They are particularly suitable where quick, inexpensive, or nonlasting visual sensing solutions are required. In this paper, we consider the problem of low complexity target tracking to cover and follow moving targets using flying robots. We tackle this problem by clustering targets while estimating the camera location and orientation for each cluster separately through a cover-set coverage method. We also leverage partial knowledge of target mobility to enhance the efficiency of our proposed algorithms. Three computationally efficient approaches are developed: predictive fuzzy, predictive incremental fuzzy, and local incremental fuzzy. The objective is to find a compromise among coverage efficiency, traveled distance, number of drones required, and complexity. The targets move according to one of the following three possible mobility patterns: random waypoint, Manhattan grid, and reference point group mobility patterns. The feasibility of our algorithms and their performance are also tested on a real-world indoor testbed called drone-be-gone, using Parrot *** quadcopters. The deployment confirms the results obtained with simulations and highlights the suitability of the proposed solutions for real-time applications.

关键词： algorithm design and analysis autonomous agents clustering algorithms cyber-physical systems unmanned vehicles

来源：评论

学校读者我要写书评

暂无评论

A Memory Centric Architecture of the Link Assessment algorithm in Large Graphs

IEEE DESIGN & TEST

引用

IEEE design & TEST 2018年第1期35卷 7-15页

作者： Brugger, Christian Grigorovici, Valentin Jung, Matthias De Schryver, Christian Weis, Christian Wehn, Norbert Zweig, Katharina Anna Univ Kaiserslautern D-67663 Kaiserslautern Germany Univ Kaiserslautern Dept Elect & Comp Engn Kaiserslautern Germany Univ Kaiserslautern Microelect Syst Design Res Grp Kaiserslautern Germany Univ Kaiserslautern Microelect Syst Design Dept Elect & Comp Engn Kaiserslautern Germany Univ Kaiserslautern Graph Theory & Complex Network Anal Grp Kaiserslautern Germany

Editor’s note: Link Assessment is a commonly used algorithm for similarity detection in large graphs. This article proposes a custom hardware architecture that achieves substantially better performance and energy eff... 详细信息

关键词： Random access memory Memory architecture Social network services algorithm design and analysis Hardware Optimization

来源：评论

学校读者我要写书评

暂无评论

Identifying DNA Methylation Modules Associated with a Cancer by Probabilistic Evolutionary Learning

引用

IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE 2018年第3期13卷 12-19页

作者： Rhee, Je-Keun Kim, Soo-Jin Zhang, Byoung-Tak Catholic Univ Korea Coll Med Canc Res Inst Seoul South Korea Seoul Natl Univ Res Inst Agr & Life Sci Coll Agr & Life Sci Seoul South Korea Seoul Natl Univ Sch Comp Sci Engn Seoul South Korea

DNA methylation leads to inhibition of downstream gene expression. Recently, considerable studies have been made to determine the effects of DNA methylation on complex disease. However, further studies are necessary to find the multiple interactions of many DNA methylation sites and their association with cancer. Here, to assess DNA methylation modules potentially relevant to disease, we use an Estimation of Distribution algorithm (EDA) to identify high-order interaction of DNA methylated sites (or modules) that are potentially relevant to disease. The method builds a probabilistic dependency model to produce a solution that is a set of discriminative methylation sites. The algorithm is applied to array- and sequencing-based high-throughput DNA methylation profiling datasets. The experimental results show that it is able to identify DNA methylation modules for cancer.

关键词： DNA Gene expression algorithm design and analysis Cancer Data models Diseases

来源：评论

学校读者我要写书评

暂无评论

FDA-MIMO Radar Range-Angle Estimation: CRLB, MSE, and Resolution analysis

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2018年第1期54卷 284-294页

作者： Xiong, Jie Wang, Wen-Qin Gao, Kuandong Univ Elect Sci & Technol China Sch Commun & Informat Engn Chengdu 610051 Sichuan Peoples R China State Key Lab Complex Electromaget Environm Effec Luoyang Peoples R China

Multiple-input multiple-output (MIMO) radar enjoys the advantage of increased degrees-of-freedom and spatial diversity gain, but it cannot effectively resolves the targets closely spaced in the same angle cell (but different range cells). Frequency diverse array (FDA)-MIMO radar can handle this problem by exploiting its range-dependent beampattern. FDA-MIMO radar was, thus, suggested for range-angle estimation of targets. Nevertheless, it is necessary to provide theoretical performance analysis for such a relatively new radar technique. Since multiple signal classification (MUSIC) algorithm is widely adopted in most of the FDA-MIMO literature, this paper derives the Cramer-Rao lower bound and mean square error expressions in MUSIC-based range-angle estimation algorithms for a general FDA-MIMO radar. Furthermore, the corresponding range and angle resolution thresholds in target detection and localization are also derived. Numerical results verify that the FDA-MIMO indeed outperforms conventional MIMO radar in both range-angle estimation and resolution threshold performance.

关键词： Estimation MIMO radar MIMO Multiple signal classification Array signal processing algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Modified algorithm for the Simulation of Charge Behavior in Water Tree Aged Cross-Linked Polyethylene Cable

引用

IEEE ACCESS 2018年 6卷 23929-23938页

作者： Zhang, Yu Liu, Deyuan Wu, Jiandong Yin, Yi Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Shanghai 200240 Peoples R China

In this paper, a modified algorithm is introduced to explain the process of charge formation in water tree aged cable insulation with respect to the dielectric properties of water tree areas and the cylindrical geometries of cable insulation. The algorithm combined with the classic bipolar charge transport model represents a novel attempt to simulate charge behavior in insulation with water tree. The finite-difference method is employed to solve for the electric field in the presence of space charge, and the finite-volume method is employed to solve the charge continuity equation. The dielectric parameters in this paper are not instantaneous near the interface but are functions of the radius. To overcome the Courant-Friedrichs-Lewy condition, the Crank-Nicolson method is used to separate the governing equations in the time domain. To validate the accuracy of the model, this paper also presents the space charge behavior in water tree aged cross-linked polyethylene cable samples measured by the full-scale pulsed electro-acoustic method. The homocharge is injected under a high electric field. During the depolarization process, the shallow trap charge gradually disappears, whereas the homocharge continues to form a positive peak signal. Simulations show that the homocharge accumulates in the tip of the water tree because the dielectric characteristics of the material change during the water-aging process. The model describes the behavior of space charge in the water tree aged insulation of cylindrical geometries. Improvements will be needed in the following research.

关键词： Water tree XLPE space charge Crank-Nicolson bipolar charge transport model cable insulation algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Reliable Formation Protocol for Bluetooth Hybrid Single-hop and Multi-hop Networks

引用

IEEE NETWORK 2018年第2期32卷 120-125页

作者： Yu, Chih-Min Lin, En-Li Chung Hua Univ Hsinchu Taiwan Chung Hua Univ Dept Elect Engn Hsinchu Taiwan

There are presently many applications where a non-uniform distribution of devices needs to be established for Bluetooth scatternets. Under the scenario of one dense zone and multiple sparse zones, the dense area has a high probability of generating a single-hop scenario since most devices are within radio range, whereas most devices are out of radio range under the multi-hop scenario in other sparse areas. Thus, both situations have to be considered in the formation of an algorithm design for most real-life situations. This work proposes a reliable formation protocol, called Dual-Ring Tree, for hybrid single-hop/multi-hop instances. To benefit from the advantages of the hybrid scenarios, a dual-ring subnet is presented as a single-hop solution for dense areas, while a tree-shaped subnet is designed as a multi-hop solution for sparse areas. To the best of the authors' knowledge, this is the first time such an algorithm has been designed to deal with both single-hop and multi-hop scenarios. The computer simulation results suggest that the reliable Dual-Ring Tree outperforms conventional BlueHRT in terms of routing efficiency and network reliability for Bluetooth multi-hop networks.

关键词： algorithm design and analysis Topology Reliability Spread spectrum communication Computer network reliability Bluetooth

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：