Dinámica de las Redes Virtuales de Fabricación Global en la Industria Aeronáutica

[ES] Las redes virtuales de fabricación global (RVFGs) están formadas por empresas independientes las cuales establecen entre sí relaciones de tipo horizontal y vertical, pudiendo incluso ser competidores, donde no es necesario mantener internamente grandes recursos fabriles sino gestionar y compartir eficientemente los recursos de la red.

Using network mesures to test evolved NK-landscapes

In this paper we empirically investigate which are the structural characteristics that can help to predict the complexity of NK-landscape instances for estimation of distribution algorithms. To this end, we evolve instances that maximize the estimation of distribution algorithm complexity in terms of its success rate. Similarly, instances that minimize the algorithm complexity are evolved. We then identify network measures, computed from the structures of the NK-landscape instances, that have a statistically significant difference between the set of easy and hard instances. The features identified are consistently significant for different values of N and K.

Learning in Network Games

We report the findings of an experiment designed to study how people learn and make decisions in network games. Network games offer new opportunities to identify learning rules, since on networks (compared to e.g. random matching) more rules differ in terms of their information requirements. Our experimental design enables us to observe both which actions participants choose and which information they consult before making their choices. We use this information to estimate learning types using maximum likelihood methods. There is substantial heterogeneity in learning types. However, the vast majority of our participants' decisions are best characterized by reinforcement learning or (myopic) best-response learning. The distribution of learning types seems fairly stable across contexts. Neither network topology nor the position of a player in the network seem to substantially affect the estimated distribution of learning types.

New methods for generating populations in Markov network based EDAs: Decimation strategies and model-based template recombination

Methods for generating a new population are a fundamental component of estimation of distribution algorithms (EDAs). They serve to transfer the information contained in the probabilistic model to the new generated population. In EDAs based on Markov networks, methods for generating new populations usually discard information contained in the model to gain in efficiency. Other methods like Gibbs sampling use information about all interactions in the model but are computationally very costly. In this paper we propose new methods for generating new solutions in EDAs based on Markov networks. We introduce approaches based on inference methods for computing the most probable configurations and model-based template recombination. We show that the application of different variants of inference methods can increase the EDAs’ convergence rate and reduce the number of function evaluations needed to find the optimum of binary and non-binary discrete functions.

Birkenhead Sixth Form College: Opening up remote access to the college network brings wider benefits to all

Birkenhead Sixth Form College implemented a virtual network to open up remote access to the college network for its students, staff and governors. In particular, for childcare students on work placements, this has meant 24/7 secure access to their work and resources, and the ability to make timely updates to their work evidence logs. The impact is better continuity of learning and a dramatic increase in the hand-in rate for work. For the staff, governors and college as a whole, the benefits of anytime-access to the network are more than were envisaged at the outset; not only is it saving them valuable time and eliminating the need for large print runs, it is expected to bring cost-savings to the College in the long term.

Comparisons of static, quasi-static and dynamic 3D porous media scale network models for two-phase immiscible flow in porous media

A dynamic 3D pore-scale network model is formulated for investigating the effect of interfacial tension and oil-water viscosity during chemical flooding. The model takes into account both viscous and capillary forces in analyzing the impact of chemical properties on flow behavior or displacement configuration, while the static model with conventional invasion percolation algorithm incorporates the capillary pressure only. From comparisons of simulation results from these models. it indicates that the static pore scale network model can be used successfully when the capillary number is low. With the capillary increases due to the enhancement of water viscosity or decrease of interfacial tension, only the quasi-static and dynamic model can give insight into the displacement mechanisms.