Browsing
     by title


0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:   
OK
Full Text
Peer Reviewed
See detailEvolution systems of measures and semigroup properties on evolving manifolds
Cheng, Li Juan UL; Thalmaier, Anton UL

in Electronic Journal of Probability (2018), 23(20), 1-27

An evolving Riemannian manifold (M,g_t)_{t\in I} consists of a smooth d-dimensional manifold M, equipped with a geometric flow g_t of complete Riemannian metrics, parametrized by I=(-\infty,T). Given an ... [more ▼]

An evolving Riemannian manifold (M,g_t)_{t\in I} consists of a smooth d-dimensional manifold M, equipped with a geometric flow g_t of complete Riemannian metrics, parametrized by I=(-\infty,T). Given an additional C^{1,1} family of vector fields (Z_t)_{t\in I} on M. We study the family of operators L_t=\Delta_t +Z_t where \Delta_t denotes the Laplacian with respect to the metric g_t. We first give sufficient conditions, in terms of space-time Lyapunov functions, for non-explosion of the diffusion generated by L_t, and for existence of evolution systems of probability measures associated to it. Coupling methods are used to establish uniqueness of the evolution systems under suitable curvature conditions. Adopting such a unique system of probability measures as reference measures, we characterize supercontractivity, hypercontractivity and ultraboundedness of the corresponding time-inhomogeneous semigroup. To this end, gradient estimates and a family of (super-)logarithmic Sobolev inequalities are established. [less ▲]

Detailed reference viewed: 281 (63 UL)
Full Text
Peer Reviewed
See detailEvolutionary Algorithm Parameter Tuning with Sensitivity Analysis
Pinel, Frédéric UL; Danoy, Grégoire UL; Bouvry, Pascal UL

in Security and Intelligent Information Systems (2011)

Detailed reference viewed: 91 (10 UL)
Peer Reviewed
See detailEvolutionary algorithms based on game theory and cellular automata with coalitions
Dorronsoro, Bernabe; Burguillo, J.C.; Peleteiro, A. et al

in Zelinka, I.; Snasel, V.; Abraham, A. (Eds.) Handbook of Optimization (2013)

Detailed reference viewed: 82 (2 UL)
Full Text
Peer Reviewed
See detailEvolutionary algorithms based on game theory and cellular automata with coalitions
Dorronsoro, Bernabé UL; Burguillo, Juan Carlos; Peleteiro, Ana et al

in Zelinka, I.; Snasel, V.; Abraham, A. (Eds.) Handbook of Optimization (2013)

Cellular genetic algorithms (cGAs) are a kind of genetic algorithms (GAs) with decentralized population in which interactions among individuals are restricted to the closest ones. The use of decentralized ... [more ▼]

Cellular genetic algorithms (cGAs) are a kind of genetic algorithms (GAs) with decentralized population in which interactions among individuals are restricted to the closest ones. The use of decentralized populations in GAs allows to keep the population diversity for longer, usually resulting in a better exploration of the search space and, therefore in a better performance of the algorithm. However, the use of decentralized populations supposes the need of several new parameters that have a major impact on the behavior of the algorithm. In the case of cGAs, these parameters are the population and neighborhood shapes. Hence, in this work we propose a new adaptive technique based in Cellular Automata, Game Theory and Coalitions that allow to manage dynamic neighborhoods. As a result, the new adaptive cGAs (EACO) with coalitions outperform the compared cGA with fixed neighborhood for the selected benchmark of combinatorial optimization problems. [less ▲]

Detailed reference viewed: 147 (2 UL)
Full Text
Peer Reviewed
See detailEvolutionary Algorithms for Convolutional Neural Network Visualisation
Bernard, Nicolas UL; Leprévost, Franck UL

in Meneses, Esteban; Castro, Harold; Barrios Hernández, Carlos Jaime (Eds.) et al High Performance Computing -- 5th Latin American Conference, CARLA 2018, Piedecuesta, Colombia (2018)

Deep Learning is based on deep neural networks trained over huge sets of examples. It enabled computers to compete with ---~or even outperform~--- humans at many tasks, from playing Go to driving ... [more ▼]

Deep Learning is based on deep neural networks trained over huge sets of examples. It enabled computers to compete with ---~or even outperform~--- humans at many tasks, from playing Go to driving vehicules. Still, it remains hard to understand how these networks actually operate. While an observer sees any individual local behaviour, he gets little insight about their global decision-making process. However, there is a class of neural networks widely used for image processing, convolutional networks, where each layer contains features working in parallel. By their structure, these features keep some spatial information across a network's layers. Visualisation of this spatial information at different locations in a network, notably on input data that maximise the activation of a given feature, can give insights on the way the model works. This paper investigates the use of Evolutionary Algorithms to evolve such input images that maximise feature activation. Compared with some pre-existing approaches, ours seems currently computationally heavier but with a wider applicability. [less ▲]

Detailed reference viewed: 11 (0 UL)
See detailEvolutionary Algorithms for Mobile Ad Hoc Networks
Dorronsoro, Bernabé UL; Ruiz, Patricia UL; Danoy, Grégoire UL et al

Book published by John Wiley & Sons (2014)

Detailed reference viewed: 175 (11 UL)
Full Text
Peer Reviewed
See detailAn evolutionary approach to translating operational specifications into declarative specifications
Molina, Facundo; Cornejo, César; Degiovanni, Renzo Gaston UL et al

in Science of Computer Programming (2019), 181

Various tools for program analysis, including run-time assertion checkers and static analyzers such as verification and test generation tools, require formal specifications of the programs being analyzed ... [more ▼]

Various tools for program analysis, including run-time assertion checkers and static analyzers such as verification and test generation tools, require formal specifications of the programs being analyzed. Moreover, many of these tools and techniques require such specifications to be written in a particular style, or follow certain patterns, in order to obtain an acceptable performance from the corresponding analyses. Thus, having a formal specification sometimes is not enough for using a particular technique, since such specification may not be provided in the right formalism. In this paper, we deal with this problem in the increasingly common case of having an operational specification, while for analysis reasons requiring a declarative specification. We propose an evolu- tionary approach to translate an operational specification written in a sequen- tial programming language, into a declarative specification, in relational logic. We perform experiments on a benchmark of data structure implementations, for which operational invariants are available, and show that our evolutionary computation based approach to translating specifications achieves very good precision in this context, and produces declarative specifications that are more amenable to analyses that demand specifications in this style. This is assessed in two contexts: bounded verification of data structure invariant preservation, and instance enumeration using symbolic execution aided by tight bounds. [less ▲]

Detailed reference viewed: 36 (2 UL)
Full Text
Peer Reviewed
See detailEvolutionary conservation and network structure characterize genes of phenotypic relevance for mitosis in human
Ostaszewski, Marek UL; Eifes, Serge UL; del Sol Mesa, Antonio UL

in PLoS ONE (2012), 7(5), 36488

The impact of gene silencing on cellular phenotypes is difficult to establish due to the complexity of interactions in the associated biological processes and pathways. A recent genome-wide RNA knock-down ... [more ▼]

The impact of gene silencing on cellular phenotypes is difficult to establish due to the complexity of interactions in the associated biological processes and pathways. A recent genome-wide RNA knock-down study both identified and phenotypically characterized a set of important genes for the cell cycle in HeLa cells. Here, we combine a molecular interaction network analysis, based on physical and functional protein interactions, in conjunction with evolutionary information, to elucidate the common biological and topological properties of these key genes. Our results show that these genes tend to be conserved with their corresponding protein interactions across several species and are key constituents of the evolutionary conserved molecular interaction network. Moreover, a group of bistable network motifs is found to be conserved within this network, which are likely to influence the network stability and therefore the robustness of cellular functioning. They form a cluster, which displays functional homogeneity and this cluster is significantly enriched in genes phenotypically relevant for mitosis. Additional results reveal a relationship between specific cellular processes and the phenotypic outcomes induced by gene silencing. This study introduces new ideas regarding the relationship between genotype and phenotype in the context of the cell cycle. We show that the analysis of molecular interaction networks can result in the identification of genes relevant to cellular processes, which is a promising avenue for future research. [less ▲]

Detailed reference viewed: 128 (3 UL)
Full Text
Peer Reviewed
See detailEvolutionary Fuzzing of Android OS Vendor System Services
Iannillo, Antonio Ken UL; Natella, Roberto; Cotroneo, Domenico

in Empirical Software Engineering (2019)

Android devices are shipped in several flavors by more than 100 manufacturer partners, which extend the Android “vanilla” OS with new system services and modify the existing ones. These proprietary ... [more ▼]

Android devices are shipped in several flavors by more than 100 manufacturer partners, which extend the Android “vanilla” OS with new system services and modify the existing ones. These proprietary extensions expose Android devices to reliability and security issues. In this paper, we propose a coverage-guided fuzzing platform (Chizpurfle) based on evolutionary algorithms to test proprietary Android system services. A key feature of this platform is the ability to profile coverage on the actual, unmodified Android device, by taking advantage of dynamic binary re-writing techniques. We applied this solution to three high-end commercial Android smartphones. The results confirmed that evolutionary fuzzing is able to test Android OS system services more efficiently than blind fuzzing. Furthermore, we evaluate the impact of different choices for the fitness function and selection algorithm. [less ▲]

Detailed reference viewed: 91 (2 UL)
Full Text
Peer Reviewed
See detailEvolutionary fuzzy system for architecture control in a constructive neural network
Calvo, R.; Figueiredo, M.; Antonelo, Eric Aislan UL

in 2005 International Symposium on Computational Intelligence in Robotics and Automation (2005)

This work describes an evolutionary system to control the growth of a constructive neural network for autonomous navigation. A classifier system generates Takagi-Sugeno fuzzy rules and controls the ... [more ▼]

This work describes an evolutionary system to control the growth of a constructive neural network for autonomous navigation. A classifier system generates Takagi-Sugeno fuzzy rules and controls the architecture of a constructive neural network. The performance of the mobile robot guides the evolutionary learning mechanism. Experiments show the efficiency of the classifier fuzzy system for analyzing if it is worth inserting a new neuron into the architecture. [less ▲]

Detailed reference viewed: 32 (0 UL)
Full Text
Peer Reviewed
See detailEvolutionary Genomics and Conservation of the Endangered Przewalski's Horse.
Der Sarkissian, Clio; Ermini, Luca; Schubert, Mikkel et al

in Current Biology (2015), 25(19), 2577-83

Przewalski's horses (PHs, Equus ferus ssp. przewalskii) were discovered in the Asian steppes in the 1870s and represent the last remaining true wild horses. PHs became extinct in the wild in the 1960s but ... [more ▼]

Przewalski's horses (PHs, Equus ferus ssp. przewalskii) were discovered in the Asian steppes in the 1870s and represent the last remaining true wild horses. PHs became extinct in the wild in the 1960s but survived in captivity, thanks to major conservation efforts. The current population is still endangered, with just 2,109 individuals, one-quarter of which are in Chinese and Mongolian reintroduction reserves [1]. These horses descend from a founding population of 12 wild-caught PHs and possibly up to four domesticated individuals [2-4]. With a stocky build, an erect mane, and stripped and short legs, they are phenotypically and behaviorally distinct from domesticated horses (DHs, Equus caballus). Here, we sequenced the complete genomes of 11 PHs, representing all founding lineages, and five historical specimens dated to 1878-1929 CE, including the Holotype. These were compared to the hitherto-most-extensive genome dataset characterized for horses, comprising 21 new genomes. We found that loci showing the most genetic differentiation with DHs were enriched in genes involved in metabolism, cardiac disorders, muscle contraction, reproduction, behavior, and signaling pathways. We also show that DH and PH populations split approximately 45,000 years ago and have remained connected by gene-flow thereafter. Finally, we monitor the genomic impact of approximately 110 years of captivity, revealing reduced heterozygosity, increased inbreeding, and variable introgression of domestic alleles, ranging from non-detectable to as much as 31.1%. This, together with the identification of ancestry informative markers and corrections to the International Studbook, establishes a framework for evaluating the persistence of genetic variation in future reintroduced populations. [less ▲]

Detailed reference viewed: 68 (4 UL)
Full Text
Peer Reviewed
See detailEvolutionary Robustness Testing of Data Processing Systems using Models and Data Mutation
Di Nardo, Daniel UL; Pastore, Fabrizio UL; Arcuri, Andrea UL et al

in Proceedings of the 30th IEEE/ACM International Conference on Automated Software Engineering (2015, November)

System level testing of industrial data processing software poses several challenges. Input data can be very large, even in the order of gigabytes, and with complex constraints that define when an input ... [more ▼]

System level testing of industrial data processing software poses several challenges. Input data can be very large, even in the order of gigabytes, and with complex constraints that define when an input is valid. Generating the right input data to stress the system for robustness properties (e.g. to test how faulty data is handled) is hence very complex, tedious and error prone when done manually. Unfortunately, this is the current practice in industry. In previous work, we defined a methodology to model the structure and the constraints of input data by using UML class diagrams and OCL constraints. Tests were automatically derived to cover predefined fault types in a fault model. In this paper, to obtain more effective system level test cases, we developed a novel search-based test generation tool. Experiments on a real-world, large industrial data processing system show that our automated approach can not only achieve better code coverage, but also accomplishes this using significantly smaller test suites. [less ▲]

Detailed reference viewed: 304 (33 UL)
See detailEVOLVE - A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation IV [EVOLVE 2013, Leiden The Netherlands, July 10-13, 2013]
Emmerich, Michael; Deutz, Andre; Schuetze, Oliver et al

Book published by Springer (2013)

Detailed reference viewed: 67 (7 UL)
See detailEVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II
Schütze, O.; Coello, C. A. C.; Bouvry, Pascal UL et al

Book published by Springer (2012)

Detailed reference viewed: 85 (1 UL)