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

作者： Carneiro, Hugo C. C. França, Felipe M. G. Lima, Priscila M. V. Systems Engineering and Computer Science Program/COPPE Universidade Federal do Rio de Janeiro Caixa Postal 68511 21941-972 Rio de Janeiro RJ Brazil Department of Mathematics Universidade Federal Rural do Rio de Janeiro Km 47 Campus Universitário BR-465 23890-000 Seropédica RJ Brazil

ISBN: (纸本)9789898425324

Weightless Artificial Neural Networks have proved to be a promising paradigm for classification tasks. This work introduces the WANN-Tagger, which makes use of weightless artificial neural networks for labelling Portuguese sentences, tagging each of its terms with its respective part-of-speech. A first experimental evaluation using the CETENFolha corpus indicates the usefulness of this paradigm and shows that it outperforms traditional feedforward neural networks in both accuracy and training time, and also that it is competitive in accuracy with the Hidden Markov Model in some cases. Additionally, WANN-Tagger shows itself capable of incrementally learning new tagged sentences during runtime.

关键词： Feedforward neural networks

来源：评论

学校读者我要写书评

暂无评论

Movement Persuit Control of an Offshore Automated Platform via a RAM-based Neural Network

Movement Persuit Control of an Offshore Automated Platform v...

引用

International Conference on Control, Automation, Robotics and Vision

作者： Horacio L. Franca Joao Carlos P. da Silva Omar Lengerke Max S. Dutra Massimo De Gregorio Felipe M. G. Franca Computer Science Department Mathematics Institute Universidade Federal do Rio de Janeiro Rio de Janeiro Brazil Mechanical Engineering Program COPPE Universidade Federal do Rio de Janeiro Rio de Janeiro Brazil Istituto di Cibernetica "Eduardo Caianiello" Consiglio Nazionale delle Ricerche (CNR) Naples Italy System Engineering and Computer Science Program COPPE Universidade Federal do Rio de Janeiro Rio de Janeiro Brazil

ISBN: (纸本)9781424478149

The reproduction of the movements of a ship by automated platforms, without the use of sensors providing exact data related to the numeric variables involved, is a non-trivial matter. The creation of an artificial vision system that can follow the cadence of said ship, in six axes of freedom, is the goal of this research. Considering that a real time response is a requisite in this case, it was decided to adopt a Boolean artificial neural network system that could identify and follow arbitrary interest points that could define, as a group, a model of the movement of an observed vessel. This paper describes the development of a prototype based on the Boolean perceptron model WiSARD (Wilkie, Stonham and Aleksander's Recognition Device), that is being implemented in the C programming language on a desktop computer using a regular webcam as input.

关键词： Stewart platform weightless neural networks WiSARD

来源：评论

学校读者我要写书评

暂无评论

Accelerating the Shuffled Frog Leaping algorithm by parallel implementations in FPGAs

Accelerating the Shuffled Frog Leaping algorithm by parallel...

引用

International Conference on Bio-Inspired Computing: Theories and Applications, BICTA

作者： Daniel M. Muñoz Carlos H. Llanos Leandro dos S. Coelho Mauricio Ayala-Rincón Department of Mechanical Engineering University of Brasilia Brasilia D.F Brazil Industrial and Systems Engineering Graduate Program Pontifical Catholic University of Parana Curitiba Parana Brazil Department of Computer Science and Mathematics University of Brasilia Brasilia D.F Brazil

Meta-heuristics are efficient techniques for solving large scale optimization problems in which traditional mathematical techniques are impractical or provide suboptimal solutions. The Shuffled Frog Leaping algorithm (SFLA) is a stochastic iterative method, bio-inspired on the memetic evolution of a group of frogs when seeking for food, which combines the social behavior-based of the particle swarm optimization technique (PSO) and the global information exchange of memetic algorithms. However, the SFLA algorithm suffers on large execution times, being this problem clearly evident when solving complex optimization problems for embedded applications. This drawback can be overcome by exploiting the parallel capabilities of the SFLA. This paper proposes a hardware parallel implementation of the SFLA algorithm (HPSFLA) using FPGAs (Field programmable gate Arrays) and the efficient floating-point arithmetic. The proposed architecture allows the SFLA to improve the functionality of the algorithm as well as to decrease the execution times by implementing parallel frogs and parallel memeplexes. Three well-known benchmark problems have been used to validate the implemented algorithm and simulation results demonstrate that the HPSFLA speeds-up by factors of 362, 727 and 211 a C-code implementation using an embedded microprocessor for the Sphere, Rastrigin and Rosenbrock benchmarks problems, respectively. Synthesis, simulation and execution time results demonstrate the effectiveness of the proposed HPSFLA architecture for embedded optimization systems.

关键词： mathematics Field programmable gate arrays Table lookup

来源：评论

学校读者我要写书评

暂无评论

Computing H/D-Exchange rates of single residues from data of proteolytic fragments

引用

BMC Bioinformatics 2010年第1期11卷 1-12页

作者： Althaus, Ernst Canzar, Stefan Ehrler, Carsten Emmett, Mark R. Karrenbauer, Andreas Marshall, Alan G. Meyer-Bäse, Anke Tipton, Jeremiah D. Zhang, Hui-Min Institut für Informatik Fachbereich 08 Staudingerweg 9 55099 Mainz Germany Algorithmic Computational Biology Centrum Wiskunde and Informatica Amsterdam Netherlands Center for Bioinformatics Computer Science Department Saarland University 66041 Saarbrücken Germany Ion Cyclotron Resonance Program National High Magnetic Field Laboratory Florida State University 1800 East Paul Dirac Drive Tallahassee FL 32310-4005 United States Department of Chemistry and Biochemistry Florida State University 95 Chieftain Way Tallahassee FL 32306 United States Institute of Mathematics EPFL Station 8 1015 Lausanne Switzerland Department of Scientific Computing Florida State University Tallahassee FL 32306-4120 United States

Background: Protein conformation and protein/protein interaction can be elucidated by solution-phase Hydrogen/Deuterium exchange (sHDX) coupled to high-resolution mass analysis of the digested protein or protein complex. In sHDX experiments mutant proteins are compared to wild-type proteins or a ligand is added to the protein and compared to the wild-type protein (or mutant). The number of deuteriums incorporated into the polypeptides generated from the protease digest of the protein is related to the solvent accessibility of amide protons within the original protein ***: In this work, sHDX data was collected on a 14.5 T FT-ICR MS. An algorithm was developed based on combinatorial optimization that predicts deuterium exchange with high spatial resolution based on the sHDX data of overlapping proteolytic fragments. Often the algorithm assigns deuterium exchange with single residue ***: With our new method it is possible to automatically determine deuterium exchange with higher spatial resolution than the level of digested fragments. © 2010 Althaus et al;licensee BioMed Central Ltd.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Stylistic analysis of paintings using wavelets and machine learning

Stylistic analysis of paintings using wavelets and machine l...

引用

17th European Signal Processing Conference, EUSIPCO 2009

作者： Jafarpour, Sina Polatkan, Güngör Brevdo, Eugene Hughes, Shannon Brasoveanu, Andrei Daubechies, Ingrid Princeton University Departments of Electrical Engineering Computer Science and Mathematics Program in Applied and Computational Mathematics Princeton NJ 08544 United States

Wavelet transforms and machine learning tools can be used to assist art experts in the stylistic analysis of paintings. A dual-tree complex wavelet transform, Hidden Markov Tree modeling and Random Forest classifiers are used here for a stylistic analysis of Vincent van Gogh's paintings with results on two stylometry challenges that concern "dating, resp. extracting distinguishing features". © EURASIP, 2009.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix

A Nearly-Linear Time Algorithm for Approximately Solving Lin...

引用

Combinatorial Scientific Computing 2009

作者： Daitch, Samuel I. Spielman, Daniel A. Yale University Department of Computer Science PO Box 208285 New HavenCT06520-8285 United States Yale University Program in Applied Mathematics and Department of Computer Science PO Box 208285 New HavenCT06520-8285 United States

We present an algorithm for solving a linear system in a symmetric M-matrix. In particular, for n × n symmetric M-matrix M, we show how to find a diagonal matrix D such that DMD is diagonally-dominant. To compute D, the algorithm must solve O (log n) linear systems in diagonally-dominant matrices. If we solve these diagonally-dominant systems approximately using the Spielman-Teng nearly-linear time solver [1], then we obtain an algorithm for approximately solving linear systems in symmetric M-matrices, for which the expected running time is also nearly-linear. © 2009 Combinatorial Scientific Computing. All Rights Reserved.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

STYLISTIC ANALYSIS OF PAINTINGS USING WAVELETS AND MACHINE LEARNING

STYLISTIC ANALYSIS OF PAINTINGS USING WAVELETS AND MACHINE L...

引用

European signal processing conference

作者： Sina Jafarpour Guengor Polatkan Eugene Brevdo Shannon Hughes Andrei Brasoveanu Ingrid Daubechies Departments of Electrical Engineering Computer Science and Mathematics and the Program in Applied and Computational Mathematics Princeton NJ 08544

ISBN: (纸本)9781617388767

关键词： Support vector machines Abstracts Image resolution Radio frequency

来源：评论

学校读者我要写书评

暂无评论

Executive Summary of Dagstuhl Seminar on Structured Decompositions and Efficient Algorithms (08492)

Executive Summary of Dagstuhl Seminar on Structured Decompos...

引用

Structured Decompositions and Efficient Algorithms 2008

作者： Dahlke, Stephan Daubechies, Ingrid Elad, M. Kutyniok, Gitta Teschke, Gerd Philipps-Universität Marburg FB12 Mathematik und Informatik Hans-Meerwein Straße Lahnberge Marburg35032 Germany Princeton University Program in Applied and Computational Mathematics Fine Hall Washington Road PrincetonNJ08544-1000 United States Technion Computer Science Department Haifa Technion City32000 Israel Universität Osnabrück Institute of Mathematics Osnabrück49069 Germany Hochschule Neubrandenburg University of Applied Sciences Institute for Computational Mathematics in Science and Technology Brodaer Str. 2 Neubrandenburg17033 Germany

New emerging technologies such as high-precision sensors or new MRI machines drive us towards a challenging quest for new, more effective, and more daring mathematical models and algorithms. Therefore, in the last few years researchers have started to investigate different methods to efficiently represent or extract relevant information from complex, high dimensional and/or multimodal data. Efficiently in this context means a representation that is linked to the features or characteristics of interest, thereby typically providing a sparse expansion of such. Besides the construction of new and advanced ansatz systems the central question is how to design algorithms that are able to treat complex and high dimensional data and that efficiently perform a suitable approximation of the signal. One of the main challenges is to design new sparse approximation algorithms that would ideally combine, with an adjustable tradeoff, two properties: a provably good 'quality' of the resulting decomposition under mild assumptions on the analyzed sparse signal, and numerically efficient design. The topic is driven by applications as well as by theoretical questions. Therefore, the aim of this seminar was to bring together a good mixture of scientists with different backgrounds in order to discuss recent progress as well as new challenging perspectives. In particular, it was intended to strengthen the interaction of mathematicians and computer scientists. © 2009 Dagstuhl Seminar Proceedings. All Rights Reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Multiscale modeling in rodent ventricular myocytes

Multiscale modeling in rodent ventricular myocytes

引用

作者： Lu, Shaoying Michailova, Anushka Saucerman, Jeffrey Cheng, Yuhui Yu, Zeyun Kaiser, Timothy Li, Wilfred Bank, Randolph Holst, Michael McCammon, J. Hayashi, Takeharu Hoshijima, Masahiko Arzberger, Peter McCulloch, Andrew Bioengineering Department University of Illinois United States Bioengineering Department UCSD United States Department of Biomedical Engineering University of Virginia United States Department of Mathematics UCSD United States UCSD United States College of Computer Science and Technology Jilin University China Department of Mathematics Center for Computational Mathematics and the Computational Science Mathematics and Engineering Doctoral Program at UCSD Department of Pharmacology UCSD United States Center for Research in Biological Systems UCSD United States Department of Bioengineering UCSD United States Department of Bioengineering PFBH 241 University of California San Diego 9500 Gilman Drive San Diego CA 92093-0412 United States

There is a growing body of experimental evidence suggesting that the Ca2+ signaling in ventricular myocytes is characterized by a high gradient near the cell membrane and a more uniform Ca2+ distribution in the cell interior [1]--[7]. An important reason for this phenomenon might be that in these cells the t-tubular system forms a network of extracellular space, extending deep into the cell interior. This allows the electrical signal, that propagates rapidly along the cell membrane, to reach the vicinity of the sarcoplasmic reticulum (SR), where intracellular Ca2+ required for myofilament activation is stored [1], [8]--[11]. Early studies of cardiac muscle showed that the t-tubules are found at intervals of about 2 lm along the longitudinal cell axis in close proximity to the Z-disks of the sarcomeres [12]. Subsequent studies have demonstrated that the t-tubular system has also longitudinal extensions [9]--[11], [13].

关键词： Cells

来源：评论

学校读者我要写书评

暂无评论

Quadratic fermionic interactions yield Hamiltonians with large ground-state energy gaps

引用

Physical Review A 2009年第3期79卷 032331-032331页

作者： Michael J. O’Hara Dianne P. O’Leary Applied Mathematics Program University of Maryland College Park MD 20742 United States Department of Computer Science Institute for Advanced Computer Studies University of Maryland College Park MD 20742 United States Mathematical and Computational Sciences Division National Institute of Standards and Technology Gaithersburg MD 20899 United States

Polynomially large ground-state energy gaps are rare in many-body quantum systems, but useful in quantum information and an interesting feature of the one-dimensional quantum Ising model. We show analytically that the gap is generically polynomially large not just for the quantum Ising model, but for one-, two-, and three-dimensional interaction lattices and Hamiltonians with certain random interactions. We extend the analysis to Hamiltonian evolutions and we use the Jordan-Wigner transformation and a related transformation for spin-3/2 particles to show that our results can be restated using spin operators in a surprisingly simple manner. These results also yield a new perspective on the one-dimensional cluster state.

关键词： Ising model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：