Search results for " Computer science"
showing 10 items of 3983 documents
Smartphone data analysis for human activity recognition
2017
In recent years, the percentage of the population owning a smartphone has increased significantly. These devices provide the user with more and more functions, so that anyone is encouraged to carry one during the day, implicitly producing that can be analysed to infer knowledge of the userâs context. In this work we present a novel framework for Human Activity Recognition (HAR) using smartphone data captured by means of embedded triaxial accelerometer and gyroscope sensors. Some statistics over the captured sensor data are computed to model each activity, then real-time classification is performed by means of an efficient supervised learning technique. The system we propose also adopts a …
A distributed visualization system for crowd simulations1
2011
The visualization system of large-scale crowd simulations should scale up with both the number of visuals views of the virtual world and the number of agents displayed in each visual. Otherwise, we could have large scale crowd simulations where only a small percentage of the population is displayed. Several approaches have been proposed in order to efficiently render crowds of animated characters. However, these approaches either render crowds animated with simple behaviors or they can only support a few hundreds of user-driven entities. In this paper, we propose a distributed visualization system for large crowds of autonomous agents that allows the visualization of crowds animated with co…
Connections with Other Population-Based Approaches
2003
Throughout this book, we have established that scatter search (SS) belongs to the family of population-based metaheuristics. This family also includes the well-known evolutionary algorithms and the approach known as path relinking.
Diversity Management in Memetic Algorithms
2012
In Evolutionary Computing, Swarm Intelligence, and more generally, populationbased algorithms diversity plays a crucial role in the success of the optimization. Diversity is a property of a group of individuals which indicates how much these individuals are alike. Clearly, a group composed of individuals similar to each other is said to have a low diversity whilst a group of individuals dissimilar to each other is said to have a high diversity. In computer science, in the context of population-based algorithms the concept of diversity is more specific: the diversity of a population is a measure of the number of different solutions present, see [239].
A Primer on Memetic Algorithms
2012
Memetic Algorithms (MAs) are population-based metaheuristics composed of an evolutionary framework and a set of local search algorithms which are activated within the generation cycle of the external framework, see [376]. The earliest MA implementation has been given in [621] in the context of the Travelling Salesman Problem (TSP) while an early systematic definition has been presented in [615]. The concept of meme is borrowed from philosophy and is intended as the unit of cultural transmission. In other words, complex ideas can be decomposed into memes which propagate andmutate within a population.Culture, in this way, constantly undergoes evolution and tends towards progressive improvemen…
Identification of Replicator Mutator models
2006
The complexity of biology literally calls for quantitative tools in order to support and validate biologists intuition and traditional qualitative descriptions. In this paper, the Replicator-Mutator models for Evolutionary Dynamics are validated/invalidated in a worst-case deterministic setting. These models analyze the DNA and RNA evolution or describe the population dynamics of viruses and bacteria. We identify the Fitness and the Replication Probability parameters of a genetic sequences, subject to a set of stringent constraints to have physical meaning and to guarantee positiveness. The conditional central estimate is determined in order to validate/invalidate the model. The effectivene…
Large Networks of Dynamic Agents: Consensus under Adversarial Disturbances
2012
This paper studies interactions among homogeneous social groups within the framework of large population games. Each group is represented by a network and the behavior described by a two-player repeated game. The contribution is three-fold. Beyond the idea of providing a novel two-level model with repeated games at a lower level and population games at a higher level, we also establish a mean field equilibrium and study state feedback best-response strategies as well as worst-case adversarial disturbances in that context.
First-principles calculations on surface hydroxyl impurities in BaF2
2012
Abstract OH − impurities located near the (1 1 1) BaF 2 surface have been studied by using density functional theory (DFT) with hybrid exchange potentials, namely DFT-B3PW. Twenty surface OH − configurations were studied, and the hydroxyls located on the first surface layer are the energetically most favorable configurations. For the (1 1 1) BaF 2 surface atomic layers, the surface hydroxyls lead to a remarkable XY -translation and a dilating effect in the Z -direction, overcoming the surface shrinking effect in the perfect slab. Bond population analysis shows that the surface effect strengthens the covalency of surface OH − impurities. The studies on band structures and density of states (…
Algorithms and Logic as Programming Primers
2019
To adapt all-immersive digitalization, the Finnish National Curriculum 2014 (FNC-2014) ‘digi-jumps’ by integrating programming into elementary education. However, applying the change to mathematics teachers’ everyday praxis is hindered by a too high-level specification. To elaborate FNC-2014 into more concrete learning targets, we review the computer science syllabi of countries that are well ahead, as well as the education recommendations set by computer science organizations, such as ACM and IEEE. The whole mathematics syllabus should be critically viewed in the light of these recommendations and feedback collected from software professionals and educators. The feedback reveals an imbalan…
Iterative constructions of central conic arcs using non-stationary IFS
2012
Several methods of subdivision exist to build parabola arcs or circle arcs in the usual Euclidean affine plane. Using a compass and a ruler, it is possible to construct, from three weighted points, circles arcs in the affine space without projective considerations. This construction is based on rational quadratic Bézier curve properties. However, when the conic is an ellipse or a hyperbola, the weight computation is relatively hard. As the equation of a conic is $\qaff(x,y)=1$, where $\qaff$ is a quadratic form, one can use the pseudo-metric associed to $\qaff$ in the affine plane and then, the conic geometry is also handled as an Euclidean circle. At each step of the iterative algorithm, t…