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

IEEE Latin American Symposium on Circuits and systems

作者： Daniel M. Mufioz Carlos H. Llanos Leandro dos S. Coelho Mauricio Ayala-Rincon Department of Mechanical Engineering Automation and Control Group/GRACO University of Brasilia Industrial and Systems Engineering Graduate Program LAS/PPGEPS Pontifical Catholic University of Parana Department of Computer Science and Mathematics University of Brasilia

ISBN: (纸本)9781467312073

Artificial bee colony (ABC) is an optimization algorithm inspired on the intelligent behavior of honey bee swarms. It is suitable to be applied when mathematical techniques are impractical or provide suboptimal solutions. As a population-based algorithm, the ABC suffers on large execution times specifically for embedded optimization problems with computational limitations. For that we propose a hardware parallel architecture of the opposition-based ABC algorithm (HPOABC) that facilitates the implementation in Field programmable Gate Arrays (FPGAs). Numerical simulations using four well-known benchmark problems demonstrate that the opposition-based approach allows the algorithm to improve its functionality, preserving the swarm diversity. Additionally, synthesis results point outs that the HPOABC architecture is effectively mapped in hardware and is suitable for embedded applications.

关键词： Global optimization Swarm intelligence Artificial bee colony FPGAs Floating-point arithmetic

来源：评论

学校读者我要写书评

暂无评论

Human genome meeting 2016 : Houston, TX, USA. 28 February - 2 March 2016

引用

Human genomics 2016年第1期10 Suppl 1卷 12页

作者： A. K. Srivastava Y. Wang R. Huang C. Skinner T. Thompson L. Pollard T. Wood F. Luo R. Stevenson R. Polimanti J. Gelernter X. Lin I. Y. Lim Y. Wu A. L. Teh L. Chen I. M. Aris S. E. Soh M. T. Tint J. L. MacIsaac F. Yap K. Kwek S. M. Saw M. S. Kobor M. J. Meaney K. M. Godfrey Y. S. Chong J. D. Holbrook Y. S. Lee P. D. Gluckman N. Karnani A. Kapoor D. Lee A. Chakravarti C. Maercker F. Graf M. Boutros G. Stamoulis F. Santoni P. Makrythanasis A. Letourneau M. Guipponi N. Panousis M. Garieri P. Ribaux E. Falconnet C. Borel S. E. Antonarakis S. Kumar J. Curran J. Blangero S. Chatterjee J. Akiyama D. Auer C. Berrios L. Pennacchio T. R. Donti G. Cappuccio M. Miller P. Atwal A. Kennedy A. Cardon C. Bacino L. Emrick J. Hertecant F. Baumer B. Porter M. Bainbridge P. Bonnen B. Graham R. Sutton Q. Sun S. Elsea Z. Hu P. Wang Y. Zhu J. Zhao M. Xiong David A. Bennett A. Hidalgo-Miranda S. Romero-Cordoba S. Rodriguez-Cuevas R. Rebollar-Vega E. Tagliabue M. Iorio E. D’Ippolito S. Baroni B. Kaczkowski Y. Tanaka H. Kawaji A. Sandelin R. Andersson M. Itoh T. Lassmann Y. Hayashizaki P. Carninci A. R. R. Forrest C. A. Semple E. A. Rosenthal B. Shirts L. Amendola C. Gallego M. Horike-Pyne A. Burt P. Robertson P. Beyers C. Nefcy D. Veenstra F. Hisama R. Bennett M. Dorschner D. Nickerson J. Smith K. Patterson D. Crosslin R. Nassir N. Zubair T. Harrison U. Peters G. Jarvik F. Menghi K. Inaki X. Woo P. Kumar K. Grzeda A. Malhotra H. Kim D. Ucar P. Shreckengast K. Karuturi J. Keck J. Chuang E. T. Liu B. Ji A. Tyler G. Ananda G. Carter H. Nikbakht M. Montagne M. Zeinieh A. Harutyunyan M. Mcconechy N. Jabado P. Lavigne J. Majewski J. B. Goldstein M. Overman G. Varadhachary R. Shroff R. Wolff M. Javle A. Futreal D. Fogelman L. Bravo W. Fajardo H. Gomez C. Castaneda C. Rolfo J. A. Pinto K. C. Akdemir L. Chin S. Patterson C. Statz S. Mockus S. N. Nikolaev X. I. Bonilla L. Parmentier B. King F. Bezrukov G. Kaya V. Zoete V. Seplyarskiy H. Sharpe T. McKee K. Popadin N. Basset-Seguin R. Ben Chaabene M. Andrianova C. Verdan K. Grosdemange O. Sumara M. E JCSRI Greenwood Genetic Center Greenwood USA School of Computing Clemson University Clemson USA Biochemical Genetics Laboratory Greenwood Genetic Center Greenwood USA Department Psychiatry Yale Sch Med and VA CT Healthcare Center West Haven USA Department Genetics Yale Sch Med and VA CT Healthcare Center West Haven USA Department Neurobiology Yale Sch Med and VA CT Healthcare Center West Haven USA Singapore Institute for Clinical Sciences Singapore Singapore National University of Singapore Singapore Singapore University of British Columbia Vancouver Canada KK Women’s and Children’s Hospital Singapore Singapore University of Southampton and University Hospital Southampton NHS Foundation Trust Southampton UK University of Auckland Auckland New Zealand McKusick-Nathans Institute of Genetic Medicine Johns Hopkins University School of Medicine Baltimore USA Esslingen University of Applied Sciences Esslingen Germany German Cancer Research Center Heidelberg Germany Department of Genetic Medicine and Development University of Geneva Medical School Geneva Switzerland Geneva University Hospitals-HUG Service of Genetic Medicine Geneva Switzerland GE3 Institute of Genetics and Genomics of Geneva University of Geneva Medical School Geneva Switzerland South Texas Diabetes and Obesity Institute School of Medicine University of Texas Rio-Grande Valley Edinburg USA South Texas Diabetes and Obesity Institute School of Medicine University of Texas Rio-Grande Valley Brownsville USA Institute of Genetic Medicine Johns Hopkins University Baltimore USA Genomics Division Lawrence Berkeley National Laboratory Berkeley USA Molecular and Human Genetics Baylor College of Medicine Houston USA Department of Translational Medical Sciences Federico II University Naples Italy Metabolon Inc Durham USA Section of Pediatric Neurology and Neuroscience Baylor College of Medicine Houston USA Tawam Hospital Abu Dhabi United Arab Emirates Stanford Medical School Stanford USA Sch

O1 The metabolomics approach to autism: identification of biomarkers for early detection of autism spectrum disorder A. K. Srivastava, Y. Wang, R. Huang, C. Skinner, T. Thompson, L. Pollard, T. Wood, F. Luo, R. Stevenson O2 Phenome-wide association study for smoking- and drinking-associated genes in 26,394 American women with African, Asian, European, and Hispanic descents R. Polimanti, J. Gelernter O3 Effects of prenatal environment, genotype and DNA methylation on birth weight and subsequent postnatal outcomes: findings from GUSTO, an Asian birth cohort X. Lin, I. Y. Lim, Y. Wu, A. L. Teh, L. Chen, I. M. Aris, S. E. Soh, M. T. Tint, J. L. MacIsaac, F. Yap, K. Kwek, S. M. Saw, M. S. Kobor, M. J. Meaney, K. M. Godfrey, Y. S. Chong, J. D. Holbrook, Y. S. Lee, P. D. Gluckman, N. Karnani, GUSTO study group O4 High-throughput identification of specific qt interval modulating enhancers at the SCN5A locus A. Kapoor, D. Lee, A. Chakravarti O5 Identification of extracellular matrix components inducing cancer cell migration in the supernatant of cultivated mesenchymal stem cells C. Maercker, F. Graf, M. Boutros O6 Single cell allele specific expression (ASE) IN T21 and common trisomies: a novel approach to understand DOWN syndrome and other aneuploidies G. Stamoulis, F. Santoni, P. Makrythanasis, A. Letourneau, M. Guipponi, N. Panousis, M. Garieri, P. Ribaux, E. Falconnet, C. Borel, S. E. Antonarakis O7 Role of microRNA in LCL to IPSC reprogramming S. Kumar, J. Curran, J. Blangero O8 Multiple enhancer variants disrupt gene regulatory network in Hirschsprung disease S. Chatterjee, A. Kapoor, J. Akiyama, D. Auer, C. Berrios, L. Pennacchio, A. Chakravarti O9 Metabolomic profiling for the diagnosis of neurometabolic disorders T. R. Donti, G. Cappuccio, M. Miller, P. Atwal, A. Kennedy, A. Cardon, C. Bacino, L. Emrick, J. Hertecant, F. Baumer, B. Porter, M. Bainbridge, P. Bonnen, B. Graham, R. Sutton, Q. Sun, S. Elsea O10 A novel causal methylation network approach to Alzheimer’s

关键词： Pulmonary Arterial Hypertension Oral Squamous Cell Carcinoma Deep Neural Network Autosomal Recessive Polycystic Kidney Disease Whole Genome Bisulfite Sequencing

来源：评论

学校读者我要写书评

暂无评论

Modularity detection in protein-protein interaction networks

引用

BMC Research Notes 2011年第1期4卷 1-6页

作者： Narayanan, Tejaswini Gersten, Merril Subramaniam, Shankar Grama, Ananth Department of Electrical and Computer Engineering University of California San Diego United States Graduate Program in Bioinformatics and Systems Biology University of California San Diego United States Department of Bioengineering University of California San Diego United States Department of Computer Science Purdue University West Lafayette IN United States

Background: Many recent studies have investigated modularity in biological networks, and its role in functional and structural characterization of constituent biomolecules. A technique that has shown considerable promise in the domain of modularity detection is the Newman and Girvan (NG) algorithm, which relies on the number of shortest-paths across pairs of vertices in the network traversing a given edge, referred to as the betweenness of that edge. The edge with the highest betweenness is iteratively eliminated from the network, with the betweenness of the remaining edges recalculated in every iteration. This generates a complete dendrogram, from which modules are extracted by applying a quality metric called modularity denoted by Q. This exhaustive computation can be prohibitively expensive for large networks such as Protein-Protein Interaction Networks. In this paper, we present a novel optimization to the modularity detection algorithm, in terms of an efficient termination criterion based on a target edge betweenness value, using which the process of iterative edge removal may be terminated. Results: We validate the robustness of our approach by applying our algorithm on real-world protein-protein interaction networks of Yeast, *** and Drosophila, and demonstrate that our algorithm consistently has significant computational gains in terms of reduced runtime, when compared to the NG algorithm. Furthermore, our algorithm produces modules comparable to those from the NG algorithm, qualitatively and quantitatively. We illustrate this using comparison metrics such as module distribution, module membership cardinality, modularity Q, and Jaccard Similarity Coefficient. Conclusions: We have presented an optimized approach for efficient modularity detection in networks. The intuition driving our approach is the extraction of holistic measures of centrality from graphs, which are representative of inherent modular structure of the underlying network, and the applic

关键词： Biological Network Jaccard Index Input Network High Betweenness Jaccard Similarity Coefficient

来源：评论

学校读者我要写书评

暂无评论

A Verification Mechanism of Feature Models for Mobile and Context-Aware Software Product Lines

A Verification Mechanism of Feature Models for Mobile and Co...

引用

Brazilian Symposium on Software Components, Architectures and Reuse (SBCARS)

作者： Fabiana G. Marinho Rossana M.C. Andrade Cl´udia Werner Graduate Program in Computer Science Federal University of Ceará Fortaleza Brazil Systems Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil

Software Product Lines (SPLs) have been used to develop mobile and context-aware applications, which provide services and data for their users from anywhere and at any time using context information. In SPLs, commonality and variability of a system family are identified and often documented in a feature model. However, the development of a feature model for mobile and context-aware SPLs is not trivial, since it should comprise system and context information. Furthermore, the consistency check of feature models in the considered domain is also complex and demands advanced skills of software engineers. This paper proposes a mechanism to formalize and verify the correctness and consistency of feature models for mobile and context-aware SPLs based on a profile enriched with OCL specifications.

关键词： Unified modeling language Context Context modeling Mobile communication Adaptation models Software

来源：评论

学校读者我要写书评

暂无评论

Local histograms of character n-grams for authorship attribution

Local histograms of character n-grams for authorship attribu...

引用

49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL-HLT 2011

作者： Escalante, Hugo Jair Solorio, Thamar Montes-Y-Gómez, Manuel Graduate Program in Systems Eng. Universidad Autónoma de Nuevo León San Nicolás de los Garza NL 66450 Mexico Dept. of Computer and Information Sciences University of Alabama at Birmingham Birmingham AL 35294 United States Computer Science Department INAOE Tonantzintla Puebla 72840 Mexico

ISBN: (纸本)9781932432879

This paper proposes the use of local histograms (LH) over character n-grams for authorship attribution (AA). LHs are enriched histogram representations that preserve sequential information in documents;they have been successfully used for text categorization and document visualization using word histograms. In this work we explore the suitability of LHs over n-grams at the character-level for AA. We show that LHs are particularly helpful for AA, because they provide useful information for uncovering, to some extent, the writing style of authors. We report experimental results in AA data sets that confirm that LHs over character n-grams are more helpful for AA than the usual global histograms, yielding results far superior to state of the art approaches. We found that LHs are even more advantageous in challenging conditions, such as having imbalanced and small training sets. Our results motivate further research on the use of LHs for modeling the writing style of authors for related tasks, such as authorship verification and plagiarism detection. © 2011 Association for Computational Linguistics.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

Hardware Particle Swarm Optimization with passive congregation for embedded applications

Hardware Particle Swarm Optimization with passive congregati...

引用

Southern Conference on programmable Logic

作者： Muñoz, Daniel M. Llanos, Carlos H. Coelho, Leandro Dos S. Ayala-Rincón, Mauricio Department of Mechanical Engineering Automation and Control Group/GRACO 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

ISBN: (纸本)9781424488483

Achieving high performance optimization algorithms for embedded applications can be very challenging, particularly when several requirements such as high accuracy computations, short elapsed time, area cost, low power consumption and portability must be accomplished. This paper proposes a hardware implementation of the Particle Swarm Optimization algorithm with passive congregation (HPPSOpc), which was developed using several floating-point arithmetic libraries. The passive congregation is a biological behavior which allows the swarm to preserve its integrity, balancing between global and local search. The HPPSOpc architecture was implemented on a Virtex5 FPGA device and validated using two multimodal benchmark problems. Synthesis, simulation and execution time results demonstrates that the passive congregation approach is a low cost solution for solving embedded optimization problems with a high performance. © 2011 IEEE.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

Opposition-based shuffled PSO with passive congregation applied to FM matching synthesis

Opposition-based shuffled PSO with passive congregation appl...

引用

IEEE Congress on Evolutionary Computation

作者： Munoz, Daniel M. Llanos, Carlos H. Dos S. Coelho, Leandro Ayala-Rincon, Mauricio Department of Mechanical Engineering Automation and Control Group/GRACO University of Brasilia Brasilia D.F. Brazil Industrial and Systems Engineering Graduate Program LAS/PPGEPS Pontifical Catholic University of Parana Curitiba Parana Brazil Department of Computer Science and Mathematics University of Brasilia Brasilia D.F. Brazil

ISBN: (纸本)9781424478347

Synthesis of musical instruments or human voice is a time consuming process which requires theoretical and experimental knowledge about the synthesis engine. Commonly, performers need to deal with synthesizer interfaces and a process of trial and error for creating musical sounds similar to a target sound. This drawback can be overcome by adjusting automatically the synthesizer parameters using optimization algorithms. In this paper a hybrid particle swarm optimization (PSO) algorithm is proposed to solve the frequency modulation (FM) matching synthesis problem. The proposed algorithm takes advantage of a shuffle process for exchanging information between particles and applies the selective passive congregation and the opposition-based learning approaches to preserve swarm diversity. Both approaches for injecting diversity are based on simple operators, preserving the easy implementation philosophy of the particle swarm optimization. The proposed hybrid particle swarm optimization algorithm was validated for a three-nested FM synthesizer, which represents a 6-dimensional multimodal optimization problem with strong epistasis. Simulation results revealed that the proposed algorithm presented promising results in terms of quality of solutions. © 2011 IEEE.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

MLEA： A Solution for Users of Android in UTPVirtual

引用

computer Technology and Application 2011年第5期2卷 406-412页

作者： Gisela Torres de Clunie Sergio Crespo Coelho da Silva Pinto Aris Linet Castillo Lucas Monteiro Braz Tasia Serrao Norman Rangel Jeanette Riley Olinda de Barraza Kexy Rodriguez Computer Systems Engineering Department Technological University of Panama Panama 0819 Panama Computer Science Research and Graduate Program in Applied Computing University of the Sinos Valley （UNISINOS） RS 93022-000 Brazil CIDITIC Technological University of Panama Panama 0819 Panama

This paper describes a design of an educational platform for a mobile learning architecture, which is a state of the an topic in distance education. The product will allow users to interact in an efficient, flexible, and transparent fashion with a web-based education environment, in this case Module Object-Oriented Dynamic Learning Environment （Moodle）, using Android mobile devices. In order to provide a strong and lasting architecture, the Service Oriented Architecture （SOA） methodology is used given that it allows easy software re-utilization as well as integration of heterogeneous services. The architecture is based on web services implemented with Representational State Transfer （REST）, as it has been demonstrated to be lighter and less consuming than other protocols, for devices with limited resources such as mobile devices. Web services provide the communication means between the server side and the client side of the architecture, whereas agents are used to deliver the services itself. The authors propose the development of an environment that facilitates the integration of various educational resources to support m-learning. An important aspect of the proposal is the offering of a tool to provide customized alerts for students and teachers, enabling them to remain updated about activities taking place in the courses.

关键词： Distance learning virtual education m-learning service oriented architecture （SOA） mobile learning mobile computing interoperability representational state transfer （REST）.

来源：评论

学校读者我要写书评

暂无评论

A Radial Basis Function Spike Model for Indirect Learning via Integrate-and-Fire Sampling and Reconstruction Techniques

引用

Advances in Artificial Neural systems 2012年第1期2012卷

作者： X. Zhang G. Foderaro C. Henriquez A. M. J. VanDongen S. Ferrari Laboratory for Intelligent Systems and Control (LISC) Department of Mechanical Engineering and Materials Science Duke University Durham NC 27708 USAduke.edu Department of Biomedical Engineering and Department of Computer Science Duke University Durham NC 27708 USAduke.edu Program in Neuroscience & Behavioral Disorders Duke-NUS Graduate Medical School Singapore Singapore

This paper presents a deterministic and adaptive spike model derived from radial basis functions and a leaky integrate-and-fire sampler developed for training spiking neural networks without direct weight manipulation. Several algorithms have been proposed for training spiking neural networks through biologically-plausible learning mechanisms, such as spike-timing-dependent synaptic plasticity and Hebbian plasticity. These algorithms typically rely on the ability to update the synaptic strengths, or weights, directly, through a weight update rule in which the weight increment can be decided and implemented based on the training equations. However, in several potential applications of adaptive spiking neural networks, including neuroprosthetic devices and CMOS/memristor nanoscale neuromorphic chips, the weights cannot be manipulated directly and, instead, tend to change over time by virtue of the pre- and postsynaptic neural activity. This paper presents an indirect learning method that induces changes in the synaptic weights by modulating spike-timing-dependent plasticity by means of controlled input spike trains. In place of the weights, the algorithm manipulates the input spike trains used to stimulate the input neurons by determining a sequence of spike timings that minimize a desired objective function and, indirectly, induce the desired synaptic plasticity in the network.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic Generation of Balletic Motions

Automatic Generation of Balletic Motions

引用

IEEE/ACM International Conference on Cyber-Physical systems (ICCPS)

作者： Amy LaViers Magnus Egerstedt Yushan Chen Calin Belta School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA USA Department of Electrical and Computer Engineering Boston University Boston MA USA Department of Mechanical Engineering Division of Systems Engineering and the Bioinformatics Graduate Program Boston University MA USA

As cyber-physical systems become more prevalent, specifications for these systems must be formulated in a more nuanced manner. This paper presents a particular instantiation of such specification by proposing a framework that endows robotic motions with a sense of aesthetic style. Drawing inspiration from classical ballet, poses are cast as discrete states and movements as the transitions between these states. Thus, a given movement style is encoded in the availability of transitions at each state, and the dynamics of a complex physical trajectory are abstracted as a system which moves between these states. Using Linear Temporal Logic (LTL), we are able to further constrain the set of possible sequences through the transition system and thus prevent it from evolving through a sequence of states that is physically impossible or aesthetically undesirable. Our overarching objective is to facilitate subtle degrees of control over systems as such subtleties are required, more and more, to interact in a social and aesthetically driven world.

关键词： Automata Leg Legged locomotion Humans Trajectory Hip

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：