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

computer 2002年第4期35卷 51-+页

作者： Gorin, AL Abella, A Alonso, T Riccardi, G Wright, JH AT&T Labs Res Speech Res Dept Murray Hill NJ 07974 USA

The next generation of voice-based interface technology will enable easy-to-use automation of new and existing communication services, making human-machine interaction more natural.

关键词： PROGRAMMING languages (Electronic computers) computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Design and control of a four-wheeled omnidirectional mobile robot with steerable omnidirectional wheels

引用

JOURNAL OF ROBOTIC SYSTEMS 2004年第4期21卷 193-208页

作者： Song, JB Byun, KS Korea Univ Dept Mech Engn Seoul 136701 South Korea

Omnidirectional mobile robots are capable of arbitrary motion in an arbitrary direction without changing the direction of wheels, because they can perform 3 degree-of-freedom (DOF) motion on a two-dimensional plane. In this research, a new class of omnidirectional mobile robot is proposed. Since it has synchronously steerable omnidirectional wheels, it is called an omnidirectional mobile robot with steerable omnidirectional wheels (OMR-SOW). It has 3 DOFs in motion and one DOF in steering. One steering DOF can function as a continuously variable transmission (CVT). CVT of the OMR-SOW increases the range of velocity ratio from the wheel velocities to robot velocity, which may improve performance of the mobile robot. The OMR-SOW with four omnidirectional wheels has been developed in this research. Kinematics and dynamics of this robot will be analyzed in detail. Various tests have been conducted to demonstrate the validity and feasibility of the proposed mechanism and control algorithm. (C) 2004 Wiley Periodicals, Inc.

关键词： Velocity Ratio Standing Orders Omnidirectional mobile robot DEPTH OF FIELD Robot Wheels computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Nonparametric Belief Propagation

引用

COMMUNICATIONS OF THE ACM 2010年第10期53卷 95-103页

作者： Sudderth, Erik B. Ihler, Alexander T. Isard, Michael Freeman, William T. Willsky, Alan S. Brown Univ Providence RI 02912 USA Univ Calif Irvine Irvine CA USA Microsoft Res Mountain View CA USA MIT Cambridge MA 02139 USA

Continuous quantities are ubiquitous in models of real-world phenomena, but are surprisingly difficult to reason about automatically. Probabilistic graphical models such as Bayesian networks and Markov random fields, and algorithms for approximate inference such as belief propagation (BP), have proven to be powerful tools in a wide range of applications in statistics and artificial intelligence. However, applying these methods to models with continuous variables remains a challenging task. In this work we describe an extension of BP to continuous variable models, generalizing particle filtering, and Gaussian mixture filtering techniques for time series to more complex models. We illustrate the power of the resulting nonparametric BP algorithm via two applications: kinematic tracking of visual motion and distributed localization in sensor networks.

关键词： Nonparametric statistics Probability theory algorithms Bayesian analysis computer algorithms Information modeling Kinematics Localization theory Sensor networks Graphical modeling (Statistics) Variables (Mathematics) Artificial intelligence software Statistical research Graphic methods for multivariate analysis

来源：评论

学校读者我要写书评

暂无评论

A measurement based approach to TCP congestion control

引用

EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS 2002年第1期13卷 53-63页

作者： Ruddle, A Allison, C Lindsay, P Univ St Andrews Sch Comp Sci St Andrews KY16 9AJ Fife Scotland

Congestion is a major Internet problem. TCP has evolved in attemptting to deal with this and now employs congestion control algorithms that effectively limit the bandwidth available to any one connection. However, as TCP is not the only transport protocol used on the Internet, the growth of non-TCP traffic has lead to the formulation of TCP-Friendly formulae. It is recommended that all best effort traffic conform to these formulae, and they act as a benchmark against which the success of any congestion control algorithms can be judged. Unfortunately, key assumptions behind the formulation of TCP's algorithms - low bandwidth, and bulk data transfers - are often no longer valid. In this paper it is shown that the combination of increasing bandwidth and short web transfers means that a significant amount of TCP traffic fails to obtain the bandwidth implied by the TCP-friendly formulae. An alternative, measurement-based approach that predicts a fairer starting window size for a connection is presented and evaluated. Information about the characteristics of particular network paths is dynamically maintained and used to suggest a fairer starting window size for new connections. Minor modifications to TCP allow these suggestions to be used to set start-up control variables, and thereby strengthen the negative correlation between the bandwidth used by a connection and the level of congestion on its network path. The measurement-based approach is realised through the use of a Location Information Server (LIS). The LIS performs centralised passive monitoring of transport headers in order to derive network level path information. Location Information Packets (LIP) are used to communicate suggested start-up variables to local hosts. The design, implementation and evaluation of an LIS, LIP and participating host's TCP software are presented.

关键词： Information Sciences Bandwidth Window Size Tritolyl Phosphates computer algorithms formula Connections tactical command post POSITION INFORMATION

来源：评论

学校读者我要写书评

暂无评论

Adaptive techniques for extraction of pre-seismic parameters of Total Electron Content (TEC) at anomaly crest station

引用

GEOMATICS NATURAL HAZARDS & RISK 2012年第3期3卷 193-206页

作者： Devi, M. Sarma, A. J. D. Kalita, S. Barbara, A. K. Depueva, A. Gauhati Univ Dept Phys Gauhati 781014 India IZMIRAN Troitsk 142190 Moscow Region Russia

Total electron content (TEC) data, obtained from satellites, are used in the search for imprints for identifying the probability factor of an impending earthquake. Extraction of earthquake induced signature is done mainly from day-to-day variations in TEC peak (TECpeak.). The use of a single parameter such as TECpeak is not always enough to formulate such a pointer. The paper therefore focuses on the need to introduce other markers such as the shape of TEC profile and to utilize any modification in the profile shape caused by an impending earthquake to identify precursors. An automatic pattern matching approach for processing global positioning system (GPS) generated TEC records is introduced to achieve this aim and TEC profiles are passed through a template framed from the time series of quiet day data. The Dynamic Time Warping (DTW) algorithm is adopted to look for deviations in the entire TEC profile of days prior to the earthquake with respect to the template. Variation, if any, would be used as an index of earthquake induced signature. A few case studies using this algorithm are presented in the paper. Work is based on TEC data collected from the GPS receiver at Guwahati (26 degrees 10' N, 91 degrees 45' E), an equatorial anomaly crest station.

关键词： ARTIFICIAL satellites EARTHQUAKE prediction GLOBAL Positioning System ELECTRONIC data processing computer algorithms

来源：评论

学校读者我要写书评

暂无评论

INELASTIC BACKGROUND AND PEAK AREA DETERMINATION IN X-RAY PHOTOELECTRON-SPECTROSCOPY (ESCA)

引用

APPLIED SPECTROSCOPY 1984年第4期38卷 505-518页

作者： PROCTOR, A HERCULES, DM UNIV PITTSBURGH DEPT CHEMPITTSBURGHPA 15260

Analysis of the Au 4f ESCA spectra of thin gold films deposited over a graphite base shows that as the separation from the main photoelectron peak, ΔE, increases the background decreases. Conversely, the effect of a contaminant overlayer on solid gold gives rise to a background which increases as ΔE increases. There is, therefore, a considerable variety of background profiles which can be encountered in real samples, which depends markedly on the element, its concentration, and its distribution in the sample. Over the region of the photoelectron line signal itself, the simple integral description which assumes that the background is proportional to the number of electrons of higher kinetic energy is reasonably valid and is suggested for peak area measurement when a nonlinear profile is needed. Direct integration and curve fitting techniques constitute the two main methods of peak area measurement. Simulated Ni 2p spectra are used to compare the effectiveness of the simple integral and linear background profiles for producing the correct peak areas. Although the simple integral profile shows more consistency and is to be preferred in general, certain fortuitous cancellation effects, particularly with nonmonochromatized spectra, make areas using the linear background fairly accurate in some instances. Curve fitting can overcome many of the problems of direct integration resulting from severe peak overlap. Two types of Gaussian/Lorentzian functions with a suitable exponential tailing function, which has a finite area over reasonable integration limits, are discussed with regard to their use in non-linear least-squares curve fitting methods. Also discussed is the usefulness of composite and difference spectra as simpler methods of determining the relative areas of overlapping peaks.

关键词： ESCA Data analysis Quantitative analysis computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Data Mining algorithms for Screening Potential Proteins of Drug Target

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2017年第1期2017卷 1-10页

作者： Wang, Qi Huang, JinCai Feng, YangHe Fei, JiaWei Natl Univ Def Technol Coll Informat Syst & Management Sci & Technol Informat Syst Engn Lab Changsha Hunan Peoples R China

The past few decades have witnessed the boom in pharmacology as well as the dilemma of drug development. Playing a crucial role in drug design, the screening of potential human proteins of drug targets from open access database with well-measured physical and chemical properties is a task of challenge but significance. In this paper, the screening of potential drug target proteins (DTPs) from a fine collected dataset containing 5376 unlabeled proteins and 517 known DTPs was researched. Our objective is to screen potential DTPs from the 5376 proteins. Here we proposed two strategies assisting the construction of dataset of reliable nondrug target proteins (NDTPs) and then bagging of decision trees method was employed in the final prediction. Such two-stage algorithms have shown their effectiveness and superior performance on the testing set. Both of the algorithms maintained higher recall ratios of DTPs, respectively, 93.5% and 97.4%. In one turn of experiments, strategy1-based bagging of decision trees algorithm screened about 558 possible DTPs while 1782 potential DTPs were predicted in the second algorithm. Besides, two strategy-based algorithms showed the consensus of the predictions in the results, with approximately 442 potential DTPs in common. These selected DTPs provide reliable choices for further verification based on biomedical experiments.

关键词： DRUG targeting DATA mining computer algorithms DRUG development DRUG design

来源：评论

学校读者我要写书评

暂无评论

Formulation and heuristic algorithms for multi-chip module substrate testing

引用

computerS & ELECTRICAL ENGINEERING 2013年第4期39卷 1049-1060页

作者： Murakami, Keisuke Aoyama Gakuin Univ Dept Ind & Syst Engn Tokyo 150 Japan

Multi-chip module (MCM) substrates are designed for packing two or more semiconductor chips. On these substrates, there are open faults in the wiring, which are electrical disconnections. We must therefore test the substrates to detect open faults, and it is essential to establish an efficient method of testing them. One type of test method uses two probes. Two probes, each touching one edge (end) of an inter-chip wiring, are used to check for the presence of faults. Testing is complete when we have confirmed that no faults exist on the MCM substrate. The objective is to minimize the time to complete testing, that is, our aim is to design efficient routes for the two probes. In this paper, we propose a novel approach of formulating the routing problem as a shortest path problem with covering constraints (SPCC) and we also propose three algorithms for the SPCC. In computational experiments, we show that our formulation and algorithms outperform the existing method. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： HEURISTIC algorithms MULTICHIP modules (Microelectronics) ROUTING protocols (computer network protocols) DEBUGGING in computer science computer algorithms COMPUTATIONAL complexity CONSTRAINT satisfaction (Artificial intelligence)

来源：评论

学校读者我要写书评

暂无评论

A divide-conquer-recombine algorithmic paradigm for large spatiotemporal quantum molecular dynamics simulations

引用

JOURNAL OF CHEMICAL PHYSICS 2014年第18期140卷 18A529-18A529页

作者： Shimojo, Fuyuki Hattori, Shinnosuke Kalia, Rajiv K. Kunaseth, Manaschai Mou, Weiwei Nakano, Aiichiro Nomura, Ken-ichi Ohmura, Satoshi Rajak, Pankaj Shimamura, Kohei Vashishta, Priya Univ So Calif Dept Comp Sci Dept Phys & Astron Los Angeles CA 90089 USA Univ So Calif Dept Chem Engn & Mat Sci Los Angeles CA 90089 USA Kumamoto Univ Dept Phys Kumamoto 8608555 Japan Natl Nanotechnol Ctr Pathum Thani 12120 Thailand Kyoto Univ Dept Phys Kyoto 6068502 Japan Kyushu Univ Dept Appl Quantum Phys & Nucl Engn Fukuoka 8190395 Japan

We introduce an extension of the divide-and-conquer (DC) algorithmic paradigm called divide-conquer-recombine (DCR) to perform large quantum molecular dynamics (QMD) simulations on massively parallel supercomputers, in which interatomic forces are computed quantum mechanically in the framework of density functional theory (DFT). In DCR, the DC phase constructs globally informed, overlapping local-domain solutions, which in the recombine phase are synthesized into a global solution encompassing large spatiotemporal scales. For the DC phase, we design a lean divide-and-conquer (LDC) DFT algorithm, which significantly reduces the prefactor of the O(N) computational cost for N electrons by applying a density-adaptive boundary condition at the peripheries of the DC domains. Our globally scalable and locally efficient solver is based on a hybrid real-reciprocal space approach that combines: (1) a highly scalable real-space multigrid to represent the global charge density;and (2) a numerically efficient plane-wave basis for local electronic wave functions and charge density within each domain. Hybrid space-band decomposition is used to implement the LDC-DFT algorithm on parallel computers. A benchmark test on an IBM Blue Gene/Q computer exhibits an isogranular parallel efficiency of 0.984 on 786 432 cores for a 50.3 x 10(6)-atom SiC system. As a test of production runs, LDC-DFT-based QMD simulation involving 16 661 atoms is performed on the Blue Gene/Q to study on-demand production of hydrogen gas from water using LiAl alloy particles. As an example of the recombine phase, LDC-DFT electronic structures are used as a basis set to describe global photoexcitation dynamics with nonadiabatic QMD (NAQMD) and kinetic Monte Carlo (KMC) methods. The NAQMD simulations are based on the linear response time-dependent density functional theory to describe electronic excited states and a surface-hopping approach to describe transitions between the excited states. A series of techniques

关键词： MOLECULAR dynamics RESEARCH SUPERcomputerS DENSITY functional theory PARALLEL computers computer algorithms MONTE Carlo method LINEAR systems

来源：评论

学校读者我要写书评

暂无评论

A quadratically regularized functional canonical correlation analysis for identifying the global structure of pleiotropy with NGS data

引用

PLOS COMPUTATIONAL BIOLOGY 2017年第10期13卷 1-33页

作者： Lin, Nan Zhu, Yun Fan, Ruzong Xiong, Momiao Univ Texas Hlth Sci Ctr Houston Dept Biostat & Data Sci Sch Publ Hlth Houston TX 77030 USA Tulane Univ Sch Publ Hlth & Trop Med Dept Epidemiol New Orleans LA USA Eunice Kennedy Shriver Natl Inst Child Hlth & Hum Biostat & Bioinformat Branch Div Intramural Populat Hlth Res NIH Bethesda MD USA

Investigating the pleiotropic effects of genetic variants can increase statistical power, provide important information to achieve deep understanding of the complex genetic structures of disease, and offer powerful tools for designing effective treatments with fewer side effects. However, the current multiple phenotype association analysis paradigm lacks breadth (number of phenotypes and genetic variants jointly analyzed at the same time) and depth (hierarchical structure of phenotype and genotypes). A key issue for high dimensional pleiotropic analysis is to effectively extract informative internal representation and features from high dimensional genotype and phenotype data. To explore correlation information of genetic variants, effectively reduce data dimensions, and overcome critical barriers in advancing the development of novel statistical methods and computational algorithms for genetic pleiotropic analysis, we proposed a new statistic method referred to as a quadratically regularized functional CCA (QRFCCA) for association analysis which combines three approaches: (1) quadratically regularized matrix factorization, (2) functional data analysis and (3) canonical correlation analysis (CCA). Large-scale simulations show that the QRFCCA has a much higher power than that of the ten competing statistics while retaining the appropriate type 1 errors. To further evaluate performance, the QRFCCA and ten other statistics are applied to the whole genome sequencing dataset from the TwinsUK study. We identify a total of 79 genes with rare variants and 67 genes with common variants significantly associated with the 46 traits using QRFCCA. The results show that the QRFCCA substantially outperforms the ten other statistics.

关键词： GENETIC pleiotropy GENETIC disorders PHENOTYPE computer algorithms CORRELATION (Statistics)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：