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

ACTA PHYSICA POLONICA A 2016年第6期130卷 1435-1438页

作者： Metlevskis, E. Martavicius, R. Katkevicius, A. Plonis, D. Krukonis, A. Vilnius Gediminas Tech Univ Dept Elect Syst Naugarduko Str 41-413 LT-03227 Vilnius Lithuania

The algorithm of parametric synthesis of meander slow-wave system with additional shields is presented in this paper. The influence of main constructive parameters of meander slow-wave system with additional shields on its electrical characteristics was evaluated in order to achieve the optimal results of the synthesis. Verification of the algorithm of parametric synthesis of meander slow-wave system with additional shields was carried out using four different models of meander slow-wave system with additional shields grounded in different positions. Sonnet (R) software package which is based on the method of moments has been used during the investigation.

关键词： SLOW wave structures SHIELDS computer algorithms SOFTWARE verification ELECTRIC fields

来源：评论

学校读者我要写书评

暂无评论

A Topology-Inferred Graph-Based Heuristic Algorithm for Map Simplification

引用

TRANSACTIONS IN GIS 2016年第5期20卷 775-789页

作者： Guo, QiuLei Karimi, Hassan A. Univ Pittsburgh Sch Informat Sci Pittsburgh PA 15260 USA

In this article we present a heuristic map simplification algorithm based on a novel topology-inferred graph model. Compared with the existing algorithms, which only focus either on geometry simplification or on topological consistency, our algorithm simplifies the map composed of series of polylines and constraint points while maintaining the topological relationships in the map, maximizing the number of removal points, and minimizing error distance efficiently. Unlike some traditional geometry simplification algorithms, such as Douglas and Peucker's, which add points incrementally, we remove points sequentially based on a priority determined by heuristic functions. In the first stage, we build a graph to model the topology of points in the map from which we determine whether a point is removable or not. As map generalization is needed in different applications with different requirements, we present two heuristic functions to determine the priority of points removal for two different purposes: to save storage space and to reduce computation time. The time complexity of our algorithm is O(nlogk)which is efficient enough to be considered for real-time applications. Experiments on real maps were conducted and the results indicate that our algorithm produces high quality results;one heuristic function results in higher removal points saving storage space and the other improves the time performance significantly.

关键词： HEURISTIC algorithms computer algorithms TOPOLOGY GEOMETRIC analysis AMALGAMATION

来源：评论

学校读者我要写书评

暂无评论

Incorporating organelle correlations into semi-supervised learning for protein subcellular localization prediction

引用

BIOINFORMATICS 2016年第14期32卷 2184-2192页

作者： Xu, Ying-Ying Yang, Fan Shen, Hong-Bin Shanghai Jiao Tong Univ Inst Image Proc & Pattern Recognit Key Lab Syst Control & Informat Proc Minist Educ China Shanghai 200240 Peoples R China

Motivation: Bioimages of subcellular protein distribution as a new data source have attracted much attention in the field of automated prediction of proteins subcellular localization. Performance of existing systems is significantly limited by the small number of high-quality images with explicit annotations, resulting in the small sample size learning problem. This limitation is more serious for the multi-location proteins that co-exist at two or more organelles, because it is difficult to accurately annotate those proteins by biological experiments or automated systems. Results: In this study, we designed a new protein subcellular localization prediction pipeline aiming to deal with the small sample size learning and multi-location proteins annotation problems. Five semi-supervised algorithms that can make use of lower-quality data were integrated, and a new multi-label classification approach by incorporating the correlations among different organelles in cells was proposed. The organelle correlations were modeled by the Bayesian network, and the topology of the correlation graph was used to guide the order of binary classifiers training in the multi-label classification to reflect the label dependence relationship. The proposed protocol was applied on both immunohistochemistry and immunofluorescence images, and our experimental results demonstrated its efficiency. Availability and implementation: The datasets and code are available at: ***/bioinf/CorrASemiB.

关键词： PROTEINS computer algorithms IMMUNOHISTOCHEMISTRY IMMUNOFLUORESCENCE MOLECULAR genetics

来源：评论

学校读者我要写书评

暂无评论

Spectral identification of topological domains

引用

BIOINFORMATICS 2016年第14期32卷 2151-2158页

作者： Chen, Jie Hero, Alfred O., III Rajapakse, Indika Northwestern Polytech Univ CIAIC Sch Marine Sci & Technol Xian Peoples R China Univ Michigan Dept Elect Engn & Comp Sci Sch Med Ann Arbor MI 48109 USA Univ Michigan Sch Med Dept Computat Med & Bioinformat Ann Arbor MI USA Univ Michigan Dept Biomed Engn Coll Literature Sci & Arts Ann Arbor MI 48109 USA Univ Michigan Dept Stat Coll Literature Sci & Arts Ann Arbor MI 48109 USA Univ Michigan Dept Math Coll Literature Sci & Arts Ann Arbor MI 48109 USA

Motivation: Topological domains have been proposed as the backbone of interphase chromosome structure. They are regions of high local contact frequency separated by sharp boundaries. Genes within a domain often have correlated transcription. In this paper, we present a computational efficient spectral algorithm to identify topological domains from chromosome conformation data (Hi-C data). We consider the genome as a weighted graph with vertices defined by loci on a chromosome and the edge weights given by interaction frequency between two loci. Laplacian-based graph segmentation is then applied iteratively to obtain the domains at the given compactness level. Comparison with algorithms in the literature shows the advantage of the proposed strategy. Results: An efficient algorithm is presented to identify topological domains from the Hi-C matrix. Availability and Implementation: The Matlab source code and illustrative examples are available at http://***/

关键词： CHROMOSOME structure MOLECULAR structure computer algorithms LOCUS (Mathematics) computer programming

来源：评论

学校读者我要写书评

暂无评论

Robust causal inference using directed acyclic graphs: the R package 'dagitty'

引用

INTERNATIONAL JOURNAL OF EPIDEMIOLOGY 2016年第6期45卷 1887-1894页

作者： Textor, Johannes van der Zander, Benito Gilthorpe, Mark S. Liskiewicz, Maciej Ellison, George T. H. Radboud Univ Nijmegen Med Ctr Dept Tumour Immunol POB 9101 NL-6500 HB Nijmegen Netherlands Univ Lubeck Inst Theoret Comp Sci Lubeck Germany Univ Leeds Leeds Inst Cardiovasc & Metab Med Leeds W Yorkshire England Univ Leeds Leeds Inst Data Analyt Leeds W Yorkshire England

Directed acyclic graphs (DAGs), which offer systematic representations of causal relationships, have become an established framework for the analysis of causal inference in epidemiology, often being used to determine covariate adjustment sets for minimizing confounding bias. DAGitty is a popular web application for drawing and analysing DAGs. Here we introduce the R package 'dagitty', which provides access to all of the capabilities of the DAGitty web application within the R platform for statistical computing, and also offers several new functions. We describe how the R package 'dagitty' can be used to: evaluate whether a DAG is consistent with the dataset it is intended to represent;enumerate 'statistically equivalent' but causally different DAGs;and identify exposure-outcome adjustment sets that are valid for causally different but statistically equivalent DAGs. This functionality enables epidemiologists to detect causal misspecifications in DAGs and make robust inferences that remain valid for a range of different DAGs.

关键词： DIRECTED acyclic graphs COMMUNICABLE disease epidemiology computer algorithms EPIDEMIOLOGISTS computer software

来源：评论

学校读者我要写书评

暂无评论

CudaChain: an alternative algorithm for finding 2D convex hulls on the GPU

引用

SPRINGERPLUS 2016年第1期5卷 1页

作者： Mei, Gang China Univ Geosci Sch Engn & Technol 29 Xueyuan Rd Beijing 100083 Peoples R China

This paper presents an alternative GPU-accelerated convex hull algorithm and a novel Sorting-based Preprocessing Approach (SPA) for planar point sets. The proposed convex hull algorithm termed as CudaChain consists of two stages: (1) two rounds of preprocessing performed on the GPU and (2) the finalization of calculating the expected convex hull on the CPU. Those interior points locating inside a quadrilateral formed by four extreme points are first discarded, and then the remaining points are distributed into several (typically four) sub regions. For each subset of points, they are first sorted in parallel;then the second round of discarding is performed using SPA;and finally a simple chain is formed for the current remaining points. A simple polygon can be easily generated by directly connecting all the chains in sub regions. The expected convex hull of the input points can be finally obtained by calculating the convex hull of the simple polygon. The library Thrust is utilized to realize the parallel sorting, reduction, and partitioning for better efficiency and simplicity. Experimental results show that: (1) SPA can very effectively detect and discard the interior points;and (2) CudaChain achieves 5x-6x speedups over the famous Qhull implementation for 20M points.

关键词： computer algorithms GRAPHICS processing units (computers) TWO-dimensional models CUDA (computer architecture) CENTRAL processing units (computers)

来源：评论

学校读者我要写书评

暂无评论

Live Demonstration: 3D sonar sensing using low-cost MEMS arrays

Live Demonstration: 3D sonar sensing using low-cost MEMS arr...

引用

IEEE Sensors Conference

作者： Robin Kerstens Jan Steckel University of Antwerp FTI CoSys Lab University of Antwerp and Flanders Make FTI CoSys Lab

ISBN: (纸本)9781509010134

In recent years, our research group has developed state of the art 3D sonar sensors [1]-[3] which use a low-cost MEMS microphone array for real-time acoustic imaging in air. Using this sensor, various robotic applications have been developed [2], including obstacle avoidance and corridor following and SLAM [1]. The developed sensor is capable of localizing an arbitrary number of reflectors, and generates 2D (range versus azimuth) or 3D (range versus azimuth and elevation) acoustic images of the environment by emitting a broadband, spatially omnidirectional acoustic emission. This emission is reflected back by the environment to the microphone array. Using array beamforming algorithms an acoustic image of the environment is created, which subsequently can be either visualized or used in various control algorithms. The overview of the developed sensor array can be seen in figure 1.

关键词： microphone arrays azimuth Sensor arrays Environments sonar Acoustic images Microelectromechanical systems Obstacle avoidance computer algorithms reflectors Corridors Sensors Acoustic equipment

来源：评论

学校读者我要写书评

暂无评论

Event Rate Control in Online Advertising

Event Rate Control in Online Advertising

引用

American Control Conference

作者： Niklas Karlsson Qian Sang Vice President of R&D at Aol Platforms 395 Page Mill Road Palo Alto CA 94306 USA Senior Research Scientist of R&D at Aol Platforms 395 Page Mill Road Palo Alto CA 94306 USA

ISBN: (纸本)9781509045839

Internet advertising is a relatively new area where feedback control has become critically important for scalable optimization. But using feedback control presents new challenges, one being the discontinuous nature of the input-output relationship of the plant to control. In this paper we propose an actuator and control algorithm for the specific objective of scalable event rate control in online advertising. The actuator makes the input-output relationship of the plant effectively continuous and with adjustable plant gain, and the feedback controller implements a PI controller to regulate the campaign-level event rate to stay at or above a reference value.

关键词： actuator control algorithm Online advertising actuators feedback control INPUT-OUTPUT PI control rate control feedback controller reference value Standing Orders computer algorithms algorithms

来源：评论

学校读者我要写书评

暂无评论

RSSI-based heading control for robust long-range aerial networking using directional antennas

RSSI-based heading control for robust long-range aerial netw...

引用

American Control Conference

作者： Jing Yan Yan Wan Junfei Xie Shengli Fu Songwei Li Institute of Electrical Engineering Yanshan University Department of Electrical Engineering University of Texas at Arlington Department of Computer Science Texas A&M University at Corpus Christi Department of Electrical Engineering University of North Texas

ISBN: (纸本)9781509045839

Aerial networking using directional antennas (ANDA) is considered as a promising solution for the networking of unmanned aerial vehicles (UAVs) over long distance. The cyber constraints on communication channel characteristics and physical constraints on the payload, power, and mobility of UAVs produce challenges to achieve a robust ANDA. In this paper, an RSSI and fuzzy logic based control algorithm is developed to control directional antennas mounted on two moving UAVs to achieve a robust broad-band long-distance communication channel. In particular, the self-alignment of UAV-mounted directional antennas over a long distance is achieved through fusing GPS and communication channel characteristic measured by received signal strength indicator (RSSI), using unscented Kalman filter and fuzzy logic strategies. Simulations are performed to validate the RSSI and fuzzy logic based directional antenna control approach. The solution developed in this paper can significantly enhance the performance of wireless communication channel in imperfect environment subject to the unavailability of GPS and unstable strength of wireless signals.

关键词： Directive antennas Received Signal Strength Indicator Communication channels Unmanned Aerial Vehicle Networking Remote heading control Global Positioning Systems computer algorithms Fuzzy logic Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Decentralized Chassis Control with Guaranteed Performance: A Lyapunov Approach

Decentralized Chassis Control with Guaranteed Performance: A...

引用

American Control Conference

作者： Yuxiao Chen Huei Peng Jessy Grizzle Dept. of Mechanical Engineering University of Michigan

ISBN: (纸本)9781509045839

This paper presents a Lyapunov-based method for verification and synthesis of decentralized chassis control systems. The method provides performance guarantees without exposing the control algorithms of each agent. We use a Lyapunov derivative condition to guarantee stability and set invariance of the closed-loop system. Agents are asked to exchange polynomials that represent the influence of the control actions on the system dynamics, while the control algorithms are kept secret. Dual decomposition is used to ensure that the solution converges and is equivalent to that of a centralized solution.

关键词： Decentralized control Lyapunov methods Dual Decomposition Integrated Chassis Control Barrier Certificates Lyapunov methods decentralised control computer algorithms Chassis Device Component Decentralized System dynamics control systems control action Agents

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：