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

A New Adaptive Controller for Performance Improvement of Automotive Suspension Systems with MR Dampers

SAE INTERNATIONAL JOURNAL OF PASSENGER CARS-MECHANICAL SYSTEMS 2014年第3期7卷 959-971页

作者： Khajepour, Amir Agrawal, Ankur Univ Waterloo Waterloo ON Canada

A control algorithm is developed for active/semi-active suspensions which can provide more comfort and better handling simultaneously. A weighting parameter is tuned online which is derived from two components - slow and fast adaptation to assign weights to comfort and handling. After establishing through simulations that the proposed adaptive control algorithm can demonstrate a performance better than some controllers in prior-art, it is implemented on an actual vehicle (Cadillac STS) which is equipped with MR dampers and several sensors. The vehicle is tested on smooth and rough roads and over speed bumps.

关键词： automotive engineering Suspension System adaptive controller DAMPER COMFORT computer algorithms rough road Speed Bumps Handling (Psychology) performance boost

来源：评论

学校读者我要写书评

暂无评论

Massive fungal biodiversity data re-annotation with multi-level clustering

引用

SCIENTIFIC REPORTS 2014年第1期4卷 1-9页

作者： Duong Vu Szoke, Szaniszlo Wiwie, Christian Baumbach, Jan Cardinali, Gianluigi Rottger, Richard Robert, Vincent CBS KNAW Fungal Biodivers Ctr Bioinformat Grp Utrecht Netherlands Max Planck Inst Informat D-66123 Saarbrucken Germany Univ Southern Denmark Inst Math & Comp Sci Odense Denmark Univ Perugia I-06100 Perugia Italy

With the availability of newer and cheaper sequencing methods, genomic data are being generated at an increasingly fast pace. In spite of the high degree of complexity of currently available search routines, the massive number of sequences available virtually prohibits quick and correct identification of large groups of sequences sharing common traits. Hence, there is a need for clustering tools for automatic knowledge extraction enabling the curation of large-scale databases. Current sophisticated approaches on sequence clustering are based on pairwise similarity matrices. This is impractical for databases of hundreds of thousands of sequences as such a similarity matrix alone would exceed the available memory. In this paper, a new approach called MultiLevel Clustering (MLC) is proposed which avoids a majority of sequence comparisons, and therefore, significantly reduces the total runtime for clustering. An implementation of the algorithm allowed clustering of all 344,239 ITS (Internal Transcribed Spacer) fungal sequences from GenBank utilizing only a normal desktop computer within 22 CPU-hours whereas the greedy clustering method took up to 242 CPU-hours.

关键词： GENOMICS RESEARCH DATABASES DOCUMENT clustering computer algorithms FUNGAL remediation

来源：评论

学校读者我要写书评

暂无评论

Ascertainment of acute liver injury in two European primary care databases

引用

EUROPEAN JOURNAL OF CLINICAL PHARMACOLOGY 2014年第10期70卷 1227-1235页

作者： Ruigomez, A. Brauer, R. Garcia Rodriguez, L. A. Huerta, C. Requena, G. Gil, M. de Abajo, Francisco Downey, G. Bate, A. Tepie, M. Feudjo de Groot, M. Schlienger, R. Reynolds, R. Klungel, O. CEIFE Madrid 28004 Spain Univ London London Sch Hyg & Trop Med Fac Epidemiol & Populat Hlth London WC1E 7HT England AEMPS Div Pharmacoepidemiol & Pharmacovigilance Med Human Use Dept Madrid Spain Univ Alcala Pharmacol Sect Dept Biomed Sci 2 Madrid Spain Amgen NV London England Pfizer Ltd Epidemiol Tadworth England Univ Utrecht Fac Sci Div Pharmacoepidemiol & Clin Pharmacol Utrecht Netherlands Novartis Pharma AG Basel Switzerland Pfizer Res & Dev Epidemiol New York NY USA

The purpose of this study was to ascertain acute liver injury (ALI) in primary care databases using different computer algorithms. The aim of this investigation was to study and compare the incidence of ALI in different primary care databases and using different definitions of ALI. The Clinical Practice Research Datalink (CPRD) in UK and the Spanish "Base de datos para la Investigacin Farmacoepidemiolgica en Atencin Primaria" (BIFAP) were used. Both are primary care databases from which we selected individuals of all ages registered between January 2004 and December 2009. We developed two case definitions of idiopathic ALI using computer algorithms: (i) restrictive definition (definite cases) and (ii) broad definition (definite and probable cases). Patients presenting prior liver conditions were excluded. Manual review of potential cases was performed to confirm diagnosis, in a sample in CPRD (21 %) and all potential cases in BIFAP. Incidence rates of ALI by age, sex and calendar year were calculated. In BIFAP, all cases considered definite after manual review had been detected with the computer algorithm as potential cases, and none came from the non-cases group. The restrictive definition of ALI had a low sensitivity but a very high specificity (95 % in BIFAP) and showed higher rates of agreement between computer search and manual review compared to the broad definition. Higher incidence rates of definite ALI in 2008 were observed in BIFAP (3.01 (95 % confidence interval (CI) 2.13-4.25) per 100,000 person-years than CPRD (1.35 (95 % CI 1.03-1.78)). This study shows that it is feasible to identify ALI cases if restrictive selection criteria are used and the possibility to review additional information to rule out differential diagnoses. Our results confirm that idiopathic ALI is a very rare disease in the general population. Finally, the construction of a standard definition with predefined criteria facilitates the timely comparison across databases.

关键词： Primary care databases Incidence Acute liver injury computer algorithms Diagnosis definition BIFAP CPRD

来源：评论

学校读者我要写书评

暂无评论

ExSPAnder: a universal repeat resolver for DNA fragment assembly

引用

BIOINFORMATICS 2014年第12期30卷 293-301页

作者： Prjibelski, Andrey D. Vasilinetc, Irina Bankevich, Anton Gurevich, Alexey Krivosheeva, Tatiana Nurk, Sergey Son Pham Korobeynikov, Anton Lapidus, Alla Pevzner, Pavel A. St Petersburg Acad Univ Algorithm Biol Lab St Petersburg Russia St Petersburg State Univ Dept Math & Mech St Petersburg 199034 Russia St Petersburg State Univ Theodosius Dobzhansky Ctr Genome Bioinformat St Petersburg 199034 Russia Univ Calif San Diego Dept Comp Sci & Engn San Diego CA 92103 USA

Next-generation sequencing (NGS) technologies have raised a challenging de novo genome assembly problem that is further amplified in recently emerged single-cell sequencing projects. While various NGS assemblers can use information from several libraries of read-pairs, most of them were originally developed for a single library and do not fully benefit from multiple libraries. Moreover, most assemblers assume uniform read coverage, condition that does not hold for single-cell projects where utilization of read-pairs is even more challenging. We have developed an exSPAnder algorithm that accurately resolves repeats in the case of both single and multiple libraries of read-pairs in both standard and single-cell assembly projects.

关键词： GENOMICS -- computer network resources NEXT generation networks computer algorithms SEQUENCE alignment (Bioinformatics) STORAGE fragmentation (computer science) DNA

来源：评论

学校读者我要写书评

暂无评论

引用

CROP SCIENCE 2014年第3期54卷 1070-1078页

作者： Krishnan, Ramesh R. Sumathy, R. Ramesh, S. R. Bindroo, B. B. Naik, Girish V. Cent Sericultural Res & Training Inst Mol Biol Lab 1 Mysore 570008 Karnataka India Cent Sericultural Res & Training Inst Bioinformat Ctr Mysore 570008 Karnataka India Cent Sericultural Germplasm Resources Ctr Hosur 635109 India Cent Sericultural Res & Training Inst Mysore 570008 Karnataka India

Sampling core collections containing a diverse set of entries has been practiced over the last two decades for a number of crops and has become a vital component of modern day crop improvement programs. A diverse, multipurpose core collection should represent the maximum genetic diversity available in an entire germplasm collection with a small number of entries. Selection of genetically distant entries that represent the maximum diversity of the entire germplasm collection is a challenging task that has been improved over the years. In this study, we introduce the similarity elimination (SimEli) method to sample genetically distant entries for the development of core collections, which was used to sample a diverse core collection of mulberry accessions using phenotypic markers. The performance of the SimEli method was compared with that of the PowerCore algorithm for phenotypic markers and with that of the Core Hunter and genetic distance optimization (GDOpt) algorithms for simple sequence repeat (SSR) markers. The SimEli method effectively selected genetically distant entries, whereas PowerCore proved efficient for selecting outliers among a small number of entries. However, the SimEli method outperformed the Core Hunter algorithm in selecting distant entries with high mean and minimum entry to nearest entry distance values. The Core Hunter collections retained a greater number of alleles than did collections developed using the SimEli method only when increased weight was given to Shannon's diversity index when using Core Hunter. The SimEli method is more user-friendly, involves simple steps, and requires less computational time than other leading programs for the development of core collections.

关键词： CROP improvement REPEATED sequence (Genetics) GENETIC markers in plants computer algorithms CROPS -- Genetics CROPS -- Germplasm resources

来源：评论

学校读者我要写书评

暂无评论

BiPACE 2D-graph-based multiple alignment for comprehensive 2D gas chromatography-mass spectrometry

引用

BIOINFORMATICS 2014年第7期30卷 988-995页

作者： Hoffmann, Nils Wilhelm, Mathias Doebbe, Anja Niehaus, Karsten Stoye, Jens Univ Bielefeld Fac Technol D-33501 Bielefeld Germany Univ Bielefeld CeBiTec D-33501 Bielefeld Germany Univ Bielefeld Fac Biol D-33501 Bielefeld Germany Univ Bielefeld D-33501 Bielefeld Germany

Motivation: Comprehensive 2D gas chromatography-mass spectrometry is an established method for the analysis of complex mixtures in analytical chemistry and metabolomics. It produces large amounts of data that require semiautomatic, but preferably automatic handling. This involves the location of significant signals (peaks) and their matching and alignment across different measurements. To date, there exist only a few openly available algorithms for the retention time alignment of peaks originating from such experiments that scale well with increasing sample and peak numbers, while providing reliable alignment results. Results: We describe BiPACE 2D, an automated algorithm for retention time alignment of peaks from 2D gas chromatography-mass spectrometry experiments and evaluate it on three previously published datasets against the mSPA, SWPA and Guineu algorithms. We also provide a fourth dataset from an experiment studying the H-2 production of two different strains of Chlamydomonas reinhardtii that is available from the MetaboLights database together with the experimental protocol, peak-detection results and manually curated multiple peak alignment for future comparability with newly developed algorithms.

关键词： GAS chromatography/Mass spectrometry (GC-MS) RESEARCH GRAPH theory ANALYTICAL biochemistry METABOLOMICS CHLAMYDOMONAS reinhardtii BIOLOGICAL databases computer algorithms BIOINFORMATICS -- computer network resources

来源：评论

学校读者我要写书评

暂无评论

ELLIPTIC CURVES WITH FULL 2-TORSION AND MAXIMAL ADELIC GALOIS REPRESENTATIONS

引用

MATHEMATICS OF COMPUTATION 2014年第290期83卷 2925-2951页

作者： Corwin, David Feng, Tony Li, Zane Kun Trebat-Leder, Sarah Princeton Univ Dept Math Princeton NJ 08544 USA

In 1972, Serre showed that the adelic Galois representation associated to a non-CM elliptic curve over a number field has open image in GL(2)((Z) over cap). In (2010), Greicius developed necessary and sufficient criteria for determining when this representation is actually surjective and exhibits such an example. However, verifying these criteria turns out to be difficult in practice;Greicius describes tests for them that apply only to semistable elliptic curves over a specific class of cubic number fields. In this paper, we extend Greicius's methods in several directions. First, we consider the analogous problem for elliptic curves with full 2-torsion. Following Greicius, we obtain necessary and sufficient conditions for the associated adelic representation to be maximal and also develop a battery of computationally effective tests that can be used to verify these conditions. We are able to use our tests to construct an infinite family of curves over Q(alpha) with maximal image, where a is the real root of x(3) + x + 1. Next, we extend Greicius's tests to more general settings, such as non-semistable elliptic curves over arbitrary cubic number fields. Finally, we give a general discussion concerning such problems for arbitrary torsion subgroups.

关键词： ELLIPTIC curves RESEARCH GALOIS theory ARBITRARY constants HYPOTHESIS METHODOLOGY computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimizing the Joint Replenishment and Channel Coordination Problem under Supply Chain Environment Using a Simple and Effective Differential Evolution Algorithm

引用

DISCRETE DYNAMICS IN NATURE AND SOCIETY 2014年第unknown期2014卷 1-12页

作者： Wang, Lin Qu, Hui Liu, Shan Chen, Can Huazhong Univ Sci Technol Sch Management Wuhan 430074 Peoples R China Wuhan Univ Econ & Management Sch Wuhan 430072 Peoples R China

This paper presents a useful and practical procurement approach using the joint replenishment and channel coordination (JR-CC) policy in a two-echelon supply chain considering the coordination cost. The objective is to determine a basic replenishment cycle time and the replenishment interval to minimize the total cost of the supply chain. To solve this NP-hard problem, a simple and improved differential evolution algorithm (IDE) is developed. The performance of the IDE is verified by benchmark functions. Moreover, results of comparative numerical example show the effectiveness of the proposed IDE. IDE can be used as a good candidate for the JR-CC model. Results of numerical examples also indicate that the JR-CC policy can result in considerable cost saving, and enhance the efficiency of a supply chain. But not all members in the supply chain can benefit a lot using this policy. Moreover, results of sensitivity analysis show that retailers have more willingness to adopt the JR-CC policy than the manufacturers because of the different cost savings.

关键词： SUPPLY chain management DIFFERENTIAL evolution (computer science) computer algorithms COST control SENSITIVITY analysis

来源：评论

学校读者我要写书评

暂无评论

Robust Adaptive Model Tracking for Distributed Parameter Control of Linear Infinite-dimensional Systems in Hilbert Space

引用

IEEE/CAA Journal of Automatica Sinica 2014年第3期1卷 294-301页

作者： Mark J.Balas Susan A.Frost the Embry-Riddle Aeronautical University the NASA Ames Research Center

This paper is focused on adaptively controlling a linear infinite-dimensional system to track a finite-dimensional reference *** a linear continuous-time infinite-dimensional plant on a Hilbert space with disturbances of known waveform but unknown amplitude and phase,we show that there exists a stabilizing direct model reference adaptive control law with the properties of certain disturbance rejection and *** plant is described by a closed,densely defined linear operator that generates a continuous semigroup of bounded operators on the Hilbert space of *** central result will show that all errors will converge to a prescribed neighborhood of zero in an infinitedimensional Hilbert *** result will not require the use of the standard Barbalat’s lemma which requires certain signals to be uniformly *** result is used to determine conditions under which a linear infinite-dimensional system can be directly adaptively controlled to follow a reference *** particular,we examine conditions for a set of ideal trajectories to exist for the tracking *** results are applied to adaptive control of general linear diffusion systems described by self-adjoint operators with compact resolvent.

关键词： Adaptation models Adaptive control Hilbert space Learning (artificial intelligence) Robustness Trajectory adaptive control algorithm adaptive theory distributed parameter system Distributed parameter systems Hilbert space trajectory Adaptation models reference model adaptive control Robustness computer algorithms

来源：评论

学校读者我要写书评

暂无评论

On independence and entropy for high-dimensional isotropic subshifts

引用

PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY 2014年第4期109卷 921-945页

作者： Meyerovitch, Tom Pavlov, Ronnie Ben Gurion Univ Negev Dept Math IL-84105 Beer Sheva Israel Univ Denver Dept Math Denver CO 80208 USA

In this work, we study the problem of finding the asymptotic growth rate of the number of d-dimensional arrays with side length n over a given alphabet which avoid a list of onedimensional 'forbidden' words along all cardinal directions, as both n and d tend to infinity. Louidor, Marcus, and the second author called this quantity the 'limiting entropy';it is the limit of a sequence of topological entropies of a sequence of isotropic Zd subshifts with the dimension d tending to infinity ['Independence entropy of Zd -shift spaces', Acta. Appl. Math. 126 (2013) 297-317]. We find an expression for this limiting entropy which involves only onedimensional words, which was implicitly conjectured in [E. Louidor, B. Marcus and R. Pavlov, 'ndependence entropy of Zd -shift spaces', Acta. Appl. Math. 126 (2013) 297-317], and given the name 'independence entropy'. In the case where the list of ` forbidden' words is finite, this expression is algorithmically computable and is of the form (1/ n) log k for k, n. N. Our proof also characterizes the weak limits (as d.8) of isotropic measures of maximal entropy;any such measure is a Bernoulli extension over some zero entropy factor taken from an explicitly defined set of measures. We also demonstrate how our results apply to various models previously studied in the literature, in some cases recovering or generalizing known results, but in other cases proving new ones. The core idea of our proof is to consider certain isotropic measures on a limiting 'infinite-dimensional' subshift, and apply a variant of the classical theorem of de Finetti on exchangeable random variables.

关键词： ENTROPY ISOTROPIC properties CARDINAL points computer algorithms RANDOM variables MATHEMATICAL models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：