Base de dados : MEDLINE
Pesquisa : L01.224.050.375.095 [Categoria DeCS]
Referências encontradas : 15 [refinar]
Mostrando: 1 .. 10   no formato [Detalhado]

página 1 de 2 ir para página        

  1 / 15 MEDLINE  
              next record last record
seleciona
para imprimir
Fotocópia
Texto completo
[PMID]:28968408
[Au] Autor:Orenstein Y; Pellow D; Marçais G; Shamir R; Kingsford C
[Ad] Endereço:Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, Massasschusetts, United States of America.
[Ti] Título:Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing.
[So] Source:PLoS Comput Biol;13(10):e1005777, 2017 Oct.
[Is] ISSN:1553-7358
[Cp] País de publicação:United States
[La] Idioma:eng
[Ab] Resumo:With the rapidly increasing volume of deep sequencing data, more efficient algorithms and data structures are needed. Minimizers are a central recent paradigm that has improved various sequence analysis tasks, including hashing for faster read overlap detection, sparse suffix arrays for creating smaller indexes, and Bloom filters for speeding up sequence search. Here, we propose an alternative paradigm that can lead to substantial further improvement in these and other tasks. For integers k and L > k, we say that a set of k-mers is a universal hitting set (UHS) if every possible L-long sequence must contain a k-mer from the set. We develop a heuristic called DOCKS to find a compact UHS, which works in two phases: The first phase is solved optimally, and for the second we propose several efficient heuristics, trading set size for speed and memory. The use of heuristics is motivated by showing the NP-hardness of a closely related problem. We show that DOCKS works well in practice and produces UHSs that are very close to a theoretical lower bound. We present results for various values of k and L and by applying them to real genomes show that UHSs indeed improve over minimizers. In particular, DOCKS uses less than 30% of the 10-mers needed to span the human genome compared to minimizers. The software and computed UHSs are freely available at github.com/Shamir-Lab/DOCKS/ and acgt.cs.tau.ac.il/docks/, respectively.
[Mh] Termos MeSH primário: Algoritmos
Biologia Computacional/métodos
Genoma Bacteriano
Genoma Humano
Sequenciamento de Nucleotídeos em Larga Escala/métodos
Análise de Sequência de DNA/métodos
Software
[Mh] Termos MeSH secundário: Animais
Caenorhabditis elegans/genética
Heurística Computacional
Seres Humanos
[Pt] Tipo de publicação:JOURNAL ARTICLE
[Em] Mês de entrada:1710
[Cu] Atualização por classe:171031
[Lr] Data última revisão:
171031
[Sb] Subgrupo de revista:IM
[Da] Data de entrada para processamento:171003
[St] Status:MEDLINE
[do] DOI:10.1371/journal.pcbi.1005777


  2 / 15 MEDLINE  
              first record previous record next record last record
seleciona
para imprimir
Fotocópia
Texto completo
[PMID]:28557993
[Au] Autor:Schmidt TL; Barton NH; Rasic G; Turley AP; Montgomery BL; Iturbe-Ormaetxe I; Cook PE; Ryan PA; Ritchie SA; Hoffmann AA; O'Neill SL; Turelli M
[Ad] Endereço:School of BioSciences, Bio21 Institute, University of Melbourne, Parkville, Victoria, Australia.
[Ti] Título:Local introduction and heterogeneous spatial spread of dengue-suppressing Wolbachia through an urban population of Aedes aegypti.
[So] Source:PLoS Biol;15(5):e2001894, 2017 May.
[Is] ISSN:1545-7885
[Cp] País de publicação:United States
[La] Idioma:eng
[Ab] Resumo:Dengue-suppressing Wolbachia strains are promising tools for arbovirus control, particularly as they have the potential to self-spread following local introductions. To test this, we followed the frequency of the transinfected Wolbachia strain wMel through Ae. aegypti in Cairns, Australia, following releases at 3 nonisolated locations within the city in early 2013. Spatial spread was analysed graphically using interpolation and by fitting a statistical model describing the position and width of the wave. For the larger 2 of the 3 releases (covering 0.97 km2 and 0.52 km2), we observed slow but steady spatial spread, at about 100-200 m per year, roughly consistent with theoretical predictions. In contrast, the smallest release (0.11 km2) produced erratic temporal and spatial dynamics, with little evidence of spread after 2 years. This is consistent with the prediction concerning fitness-decreasing Wolbachia transinfections that a minimum release area is needed to achieve stable local establishment and spread in continuous habitats. Our graphical and likelihood analyses produced broadly consistent estimates of wave speed and wave width. Spread at all sites was spatially heterogeneous, suggesting that environmental heterogeneity will affect large-scale Wolbachia transformations of urban mosquito populations. The persistence and spread of Wolbachia in release areas meeting minimum area requirements indicates the promise of successful large-scale population transformation.
[Mh] Termos MeSH primário: Aedes/microbiologia
Agentes de Controle Biológico
Vírus da Dengue/fisiologia
Dengue/prevenção & controle
Modelos Biológicos
Urbanização
Wolbachia/fisiologia
[Mh] Termos MeSH secundário: Aedes/crescimento & desenvolvimento
Aedes/fisiologia
Aedes/virologia
Animais
Agentes de Controle Biológico/isolamento & purificação
Colapso da Colônia/microbiologia
Colapso da Colônia/virologia
Heurística Computacional
Dengue/transmissão
Dengue/virologia
Vírus da Dengue/crescimento & desenvolvimento
Vírus da Dengue/isolamento & purificação
Vetores de Doenças
Feminino
Saúde Global
Transição Epidemiológica
Seres Humanos
Controle de Infecções
Masculino
Parques Recreativos
Queensland
Análise Espaço-Temporal
Wolbachia/crescimento & desenvolvimento
Wolbachia/isolamento & purificação
[Pt] Tipo de publicação:COMPARATIVE STUDY; JOURNAL ARTICLE
[Nm] Nome de substância:
0 (Biological Control Agents)
[Em] Mês de entrada:1709
[Cu] Atualização por classe:170906
[Lr] Data última revisão:
170906
[Sb] Subgrupo de revista:IM
[Da] Data de entrada para processamento:170531
[St] Status:MEDLINE
[do] DOI:10.1371/journal.pbio.2001894


  3 / 15 MEDLINE  
              first record previous record next record last record
seleciona
para imprimir
Fotocópia
Texto completo
[PMID]:28269390
[Au] Autor:Yang Zhou; Zhengguo Sheng; Leung VC; Servati P
[Ti] Título:Beacon-based opportunistic scheduling in wireless body area network.
[So] Source:Conf Proc IEEE Eng Med Biol Soc;2016:4995-4998, 2016 08.
[Is] ISSN:1557-170X
[Cp] País de publicação:United States
[La] Idioma:eng
[Ab] Resumo:Wireless Body Area Networks (WBANs) are one of the key technologies that support the development of digital health care, which has attracted increasing attention in recent years. Compared with general Wireless Sensor Networks (WSNs), WBANs have more stringent requirements on reliability and energy efficiency. Though WBANs are applied within limited transmission range, the on-body channel condition can be very challenging because of blocking or absorbing of signal. In this paper, we are looking into the design of Medium Access Control (MAC) protocols and propose an opportunistic scheduling scheme by applying heuristic scheduling and dynamic superframe length adjustment to improve the system performance. The simulations have been supplemented to show the advantages of the proposed solutions in outage rate performance, compared with existing solutions.
[Mh] Termos MeSH primário: Algoritmos
Redes de Comunicação de Computadores
Corpo Humano
Tecnologia sem Fio/instrumentação
[Mh] Termos MeSH secundário: Heurística Computacional
Simulação por Computador
Seres Humanos
Modelos Teóricos
[Pt] Tipo de publicação:JOURNAL ARTICLE; RESEARCH SUPPORT, NON-U.S. GOV'T
[Em] Mês de entrada:1706
[Cu] Atualização por classe:171126
[Lr] Data última revisão:
171126
[Sb] Subgrupo de revista:IM
[Da] Data de entrada para processamento:170309
[St] Status:MEDLINE
[do] DOI:10.1109/EMBC.2016.7591849


  4 / 15 MEDLINE  
              first record previous record next record last record
seleciona
para imprimir
Fotocópia
Texto completo
[PMID]:28083762
[Au] Autor:Lim K; Yamada KD; Frith MC; Tomii K
[Ad] Endereço:Artificial Intelligence Research Center, National Institute of Advanced Industrial Science and Technology (AIST), 2-4-7 Aomi, Koto-ku, Tokyo, 135-0064, Japan.
[Ti] Título:Protein sequence-similarity search acceleration using a heuristic algorithm with a sensitive matrix.
[So] Source:J Struct Funct Genomics;17(4):147-154, 2016 Dec.
[Is] ISSN:1570-0267
[Cp] País de publicação:Netherlands
[La] Idioma:eng
[Ab] Resumo:Protein database search for public databases is a fundamental step in the target selection of proteins in structural and functional genomics and also for inferring protein structure, function, and evolution. Most database search methods employ amino acid substitution matrices to score amino acid pairs. The choice of substitution matrix strongly affects homology detection performance. We earlier proposed a substitution matrix named MIQS that was optimized for distant protein homology search. Herein we further evaluate MIQS in combination with LAST, a heuristic and fast database search tool with a tunable sensitivity parameter m, where larger m denotes higher sensitivity. Results show that MIQS substantially improves the homology detection and alignment quality performance of LAST across diverse m parameters. Against a protein database consisting of approximately 15 million sequences, LAST with m = 10 achieves better homology detection performance than BLASTP, and completes the search 20 times faster. Compared to the most sensitive existing methods being used today, CS-BLAST and SSEARCH, LAST with MIQS and m = 10 shows comparable homology detection performance at 2.0 and 3.9 times greater speed, respectively. Results demonstrate that MIQS-powered LAST is a time-efficient method for sensitive and accurate homology search.
[Mh] Termos MeSH primário: Heurística Computacional
Bases de Dados de Proteínas
Análise de Sequência de Proteína
[Mh] Termos MeSH secundário: Algoritmos
Biologia Computacional
Modelos Moleculares
Proteínas/química
Alinhamento de Sequência
[Pt] Tipo de publicação:JOURNAL ARTICLE
[Nm] Nome de substância:
0 (Proteins)
[Em] Mês de entrada:1709
[Cu] Atualização por classe:170911
[Lr] Data última revisão:
170911
[Sb] Subgrupo de revista:IM
[Da] Data de entrada para processamento:170114
[St] Status:MEDLINE
[do] DOI:10.1007/s10969-016-9210-4


  5 / 15 MEDLINE  
              first record previous record next record last record
seleciona
para imprimir
Fotocópia
Texto completo
[PMID]:27942013
[Au] Autor:Chen J; Du C; Han P
[Ad] Endereço:Department of Computer Science, Northwestern Polytechnical University, Xi'an, China, 710072.
[Ti] Título:Scheduling Independent Partitions in Integrated Modular Avionics Systems.
[So] Source:PLoS One;11(12):e0168064, 2016.
[Is] ISSN:1932-6203
[Cp] País de publicação:United States
[La] Idioma:eng
[Ab] Resumo:Recently the integrated modular avionics (IMA) architecture has been widely adopted by the avionics industry due to its strong partition mechanism. Although the IMA architecture can achieve effective cost reduction and reliability enhancement in the development of avionics systems, it results in a complex allocation and scheduling problem. All partitions in an IMA system should be integrated together according to a proper schedule such that their deadlines will be met even under the worst case situations. In order to help provide a proper scheduling table for all partitions in IMA systems, we study the schedulability of independent partitions on a multiprocessor platform in this paper. We firstly present an exact formulation to calculate the maximum scaling factor and determine whether all partitions are schedulable on a limited number of processors. Then with a Game Theory analogy, we design an approximation algorithm to solve the scheduling problem of partitions, by allowing each partition to optimize its own schedule according to the allocations of the others. Finally, simulation experiments are conducted to show the efficiency and reliability of the approach proposed in terms of time consumption and acceptance ratio.
[Mh] Termos MeSH primário: Aviação
Sistemas de Computação
[Mh] Termos MeSH secundário: Agendamento de Consultas
Heurística Computacional
Simulação por Computador
Integração de Sistemas
[Pt] Tipo de publicação:JOURNAL ARTICLE
[Em] Mês de entrada:1706
[Cu] Atualização por classe:170628
[Lr] Data última revisão:
170628
[Sb] Subgrupo de revista:IM
[Da] Data de entrada para processamento:161213
[St] Status:MEDLINE
[do] DOI:10.1371/journal.pone.0168064


  6 / 15 MEDLINE  
              first record previous record next record last record
seleciona
para imprimir
Fotocópia
[PMID]:27258842
[Au] Autor:Coelho VN; Coelho IM; Souza MJ; Oliveira TA; Cota LP; Haddad MN; Mladenovic N; Silva RC; Guimarães FG
[Ad] Endereço:Undergraduate Program of Control and Automation Engineering, Universidade Federal de Ouro Preto, Ouro Preto, MG, 35400-000, BrazilGraduate Program in Electrical Engineering, Universidade Federal de Minas Gerais, Belo Horizonte, MG, 31270-901, Brazil vncoelho@gmail.com.
[Ti] Título:Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems.
[So] Source:Evol Comput;24(4):637-666, 2016.
[Is] ISSN:1530-9304
[Cp] País de publicação:United States
[La] Idioma:eng
[Ab] Resumo:This article presents an Evolution Strategy (ES)--based algorithm, designed to self-adapt its mutation operators, guiding the search into the solution space using a Self-Adaptive Reduced Variable Neighborhood Search procedure. In view of the specific local search operators for each individual, the proposed population-based approach also fits into the context of the Memetic Algorithms. The proposed variant uses the Greedy Randomized Adaptive Search Procedure with different greedy parameters for generating its initial population, providing an interesting exploration-exploitation balance. To validate the proposal, this framework is applied to solve three different [Formula: see text]-Hard combinatorial optimization problems: an Open-Pit-Mining Operational Planning Problem with dynamic allocation of trucks, an Unrelated Parallel Machine Scheduling Problem with Setup Times, and the calibration of a hybrid fuzzy model for Short-Term Load Forecasting. Computational results point out the convergence of the proposed model and highlight its ability in combining the application of move operations from distinct neighborhood structures along the optimization. The results gathered and reported in this article represent a collective evidence of the performance of the method in challenging combinatorial optimization problems from different application domains. The proposed evolution strategy demonstrates an ability of adapting the strength of the mutation disturbance during the generations of its evolution process. The effectiveness of the proposal motivates the application of this novel evolutionary framework for solving other combinatorial optimization problems.
[Mh] Termos MeSH primário: Algoritmos
Evolução Biológica
[Mh] Termos MeSH secundário: Heurística Computacional
Simulação por Computador
Seres Humanos
Aprendizado de Máquina
Mineração
Mutação
Admissão e Escalonamento de Pessoal
[Pt] Tipo de publicação:JOURNAL ARTICLE
[Em] Mês de entrada:1705
[Cu] Atualização por classe:170509
[Lr] Data última revisão:
170509
[Sb] Subgrupo de revista:IM
[Da] Data de entrada para processamento:160604
[St] Status:MEDLINE


  7 / 15 MEDLINE  
              first record previous record next record last record
seleciona
para imprimir
Fotocópia
[PMID]:27243329
[Au] Autor:Buzdalov M; Doerr B; Kever M
[Ad] Endereço:ITMO University, 49 Kpohbepkckuu npocnekt, Saint Petersburg, 197101, Russia mbuzdalov@gmail.com.
[Ti] Título:The Unrestricted Black-Box Complexity of Jump Functions.
[So] Source:Evol Comput;24(4):719-744, 2016.
[Is] ISSN:1530-9304
[Cp] País de publicação:United States
[La] Idioma:eng
[Ab] Resumo:We analyze the unrestricted black-box complexity of the Jump function classes for different jump sizes. For upper bounds, we present three algorithms for small, medium, and extreme jump sizes. We prove a matrix lower bound theorem which is capable of giving better lower bounds than the classic information theory approach. Using this theorem, we prove lower bounds that almost match the upper bounds. For the case of extreme jump functions, which apart from the optimum reveal only the middle fitness value(s), we use an additional lower bound argument to show that any black-box algorithm does not gain significant insight about the problem instance from the first [Formula: see text] fitness evaluations. This, together with our upper bound, shows that the black-box complexity of extreme jump functions is [Formula: see text].
[Mh] Termos MeSH primário: Algoritmos
[Mh] Termos MeSH secundário: Evolução Biológica
Heurística Computacional
Simulação por Computador
[Pt] Tipo de publicação:JOURNAL ARTICLE
[Em] Mês de entrada:1705
[Cu] Atualização por classe:170509
[Lr] Data última revisão:
170509
[Sb] Subgrupo de revista:IM
[Da] Data de entrada para processamento:160601
[St] Status:MEDLINE


  8 / 15 MEDLINE  
              first record previous record next record last record
seleciona
para imprimir
Fotocópia
[PMID]:27120113
[Au] Autor:Hart E; Sim K
[Ad] Endereço:School of Computing, Edinburgh Napier University, Edinburgh, EH10, UK e.hart@napier.ac.uk.
[Ti] Título:A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling.
[So] Source:Evol Comput;24(4):609-635, 2016.
[Is] ISSN:1530-9304
[Cp] País de publicação:United States
[La] Idioma:eng
[Ab] Resumo:We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics composed of linear sequences of dispatching rules: each rule is represented using a tree structure and is itself evolved. Following a training period, the ensemble is shown to outperform both existing dispatching rules and a standard genetic programming algorithm on a large set of new test instances. In addition, it obtains superior results on a set of 210 benchmark problems from the literature when compared to two state-of-the-art hyper-heuristic approaches. Further analysis of the relationship between heuristics in the evolved ensemble and the instances each solves provides new insights into features that might describe similar instances.
[Mh] Termos MeSH primário: Heurística Computacional
Admissão e Escalonamento de Pessoal
[Mh] Termos MeSH secundário: Algoritmos
Seres Humanos
Aprendizado de Máquina
Trabalho
[Pt] Tipo de publicação:JOURNAL ARTICLE
[Em] Mês de entrada:1705
[Cu] Atualização por classe:170509
[Lr] Data última revisão:
170509
[Sb] Subgrupo de revista:IM
[Da] Data de entrada para processamento:160428
[St] Status:MEDLINE


  9 / 15 MEDLINE  
              first record previous record next record last record
seleciona
para imprimir
Fotocópia
Texto completo
[PMID]:26797472
[Au] Autor:Rouhani M; Javan DS
[Ad] Endereço:Faculty of engineering, Ferdowsi University of Mashhad, Mashhad, Iran. Electronic address: rouhani@um.ac.ir.
[Ti] Título:Two fast and accurate heuristic RBF learning rules for data classification.
[So] Source:Neural Netw;75:150-61, 2016 Mar.
[Is] ISSN:1879-2782
[Cp] País de publicação:United States
[La] Idioma:eng
[Ab] Resumo:This paper presents new Radial Basis Function (RBF) learning methods for classification problems. The proposed methods use some heuristics to determine the spreads, the centers and the number of hidden neurons of network in such a way that the higher efficiency is achieved by fewer numbers of neurons, while the learning algorithm remains fast and simple. To retain network size limited, neurons are added to network recursively until termination condition is met. Each neuron covers some of train data. The termination condition is to cover all training data or to reach the maximum number of neurons. In each step, the center and spread of the new neuron are selected based on maximization of its coverage. Maximization of coverage of the neurons leads to a network with fewer neurons and indeed lower VC dimension and better generalization property. Using power exponential distribution function as the activation function of hidden neurons, and in the light of new learning approaches, it is proved that all data became linearly separable in the space of hidden layer outputs which implies that there exist linear output layer weights with zero training error. The proposed methods are applied to some well-known datasets and the simulation results, compared with SVM and some other leading RBF learning methods, show their satisfactory and comparable performance.
[Mh] Termos MeSH primário: Heurística Computacional
Aprendizado de Máquina
Redes Neurais (Computação)
Estatística como Assunto/classificação
[Mh] Termos MeSH secundário: Algoritmos
Seres Humanos
Neurônios/fisiologia
Fatores de Tempo
[Pt] Tipo de publicação:JOURNAL ARTICLE
[Em] Mês de entrada:1610
[Cu] Atualização por classe:161230
[Lr] Data última revisão:
161230
[Sb] Subgrupo de revista:IM
[Da] Data de entrada para processamento:160123
[St] Status:MEDLINE


  10 / 15 MEDLINE  
              first record previous record
seleciona
para imprimir
Fotocópia
Texto completo
[PMID]:26245240
[Au] Autor:Joshi A; Perin DM; Amadi C; Trout K
[Ad] Endereço:City University of New York, NY, USA. ashish.joshi@sph.cuny.edu.
[Ti] Título:Evaluating the usability of an interactive, bi-lingual, touchscreen-enabled breastfeeding educational programme: application of Nielson's heuristics.
[So] Source:J Innov Health Inform;22(2):265-74, 2015 Mar 05.
[Is] ISSN:2058-4563
[Cp] País de publicação:England
[La] Idioma:eng
[Ab] Resumo:The study purpose was to conduct heuristic evaluation of an interactive, bilingual touchscreen-enabled breastfeeding educational programme for Hispanic women living in rural settings in Nebraska. Three raters conducted the evaluation during May 2013 using principles of Nielson's heuristics. A total of 271 screens were evaluated and included: interface (n = 5), programme sections (n = 223) and educational content (n = 43). A total of 97 heuristic violations were identified and were mostly related to interface (8 violations/5 screens) and programme components (89 violations/266 screens). The most common heuristic violations reported were recognition rather than recall (62%, n = 60), consistency and standards (14%, n = 14) and match between the system and real world (9%, n = 9). Majority of the heuristic violations had minor usability issues (73%, n = 71). The only grade 4 heuristic violation reported was due to the visibility of system status in the assessment modules. The results demonstrated that the system was more consistent with Nielsen's usability heuristics. With Nielsen's usability heuristics, it is possible to identify problems in a timely manner, and help facilitate the identification and prioritisation of problems needing urgent attention at an earlier stage before the final deployment of the system.
[Mh] Termos MeSH primário: Aleitamento Materno
Heurística Computacional
Educação em Saúde
Hispano-Americanos/educação
Mães/educação
Multilinguismo
Interface Usuário-Computador
[Mh] Termos MeSH secundário: Adulto
Apresentação de Dados
Feminino
Seres Humanos
Motivação
Nebraska
População Rural
Software
[Pt] Tipo de publicação:EVALUATION STUDIES; JOURNAL ARTICLE; RESEARCH SUPPORT, N.I.H., EXTRAMURAL
[Em] Mês de entrada:1605
[Cu] Atualização por classe:150806
[Lr] Data última revisão:
150806
[Sb] Subgrupo de revista:IM
[Da] Data de entrada para processamento:150807
[St] Status:MEDLINE
[do] DOI:10.14236/jhi.v22i2.71



página 1 de 2 ir para página        
   


Refinar a pesquisa
  Base de dados : MEDLINE Formulário avançado   

    Pesquisar no campo  
1  
2
3
 
           



Search engine: iAH v2.6 powered by WWWISIS

BIREME/OPAS/OMS - Centro Latino-Americano e do Caribe de Informação em Ciências da Saúde