La producción flexible: Just in time versus organización científica del trabajo

Nadie puede negar que la competitividad actual de la industria japonesa se basa, entre otras razones, en el bajo coste y alto nivel de calidad de sus productos. Ambas cualidades se han conseguido por la aplicación, a partir de los 70, de prácticas innovadoras y nuevas tecnologías de fabricación como es el caso del Just in Time.

Model of sources: a proposal for the hierarchy, merging strategy and representation of the information sources in virtual models of historical buildings

Contributed to: Fusion of Cultures: XXXVIII Annual Conference on Computer Applications and Quantitative Methods in Archaeology – CAA2010 (Granada, Spain, Apr 6-9, 2010)

Para una relectura del compromiso en los años sesenta: paradoja, escritura transparente, retracción de Antonio Gamoneda

[ES] En este artículo se trata de analizar el planteamiento del compromiso poético a la altura del comienzo de la década de los años sesenta, a partir del análisis de esa modalidad de escritura en Blues castellano de Antonio Gamoneda, libro cuyos poemas datan de 1961–1966, aunque permaneció inédito hasta 1982. Leído en el contexto de su producción, Blues castellano muestra una solidaridad absoluta con algunos de los modelos poéticos comprometidos de la época (Nazim Hikmet, Bertolt Brecht, los espirituales negros, etc.), así como una vinculación hacia un tipo de compromiso poético que va a hacer recaer su dimensión crítica en el lenguaje poético, no sólo en el referente externo. En Blues castellano se consolidan ya algunos de los conceptos centrales de la poesía gamonediana posterior: retracción, búsqueda de una escritura transparente, desaparición del sujeto en la escritura, etc.

Expected Fair Allocation in Farsighted Network Formation

I consider cooperation situations where players have network relations. Networks evolve according to a stationary transition probability matrix and at each moment in time players receive payoffs from a stationary allocation rule. Players discount the future by a common factor. The pair formed by an allocation rule and a transition probability matrix is called expected fair if for every link in the network both participants gain, marginally, and in discounted, expected terms, the same from it; and it is called a pairwise network formation procedure if the probability that a link is created (or eliminated) is positive if the discounted, expected gains to its two participants are positive too. The main result is the existence, for the discount factor small enough, of an expected fair and pairwise network formation procedure where the allocation rule is component balanced, meaning it distributes the total value of any maximal connected subnetwork among its participants. This existence result holds for all discount factors when the pairwise network formation procedure is restricted. I finally provide some comparison with previous models of farsighted network formation.

Forward-looking Pairwise Stability in Networks with Externalities

We consider cooperation situations where players have network relations. Networks evolve according to a stationary transition probability matrix and at each moment in time players receive payoffs from a stationary allocation rule. Players discount the future by a common factor. The pair formed by an allocation rule and a transition probability matrix is called a forward-looking network formation scheme if, first, the probability that a link is created is positive if the discounted, expected gains to its two participants are positive, and if, second, the probability that a link is eliminated is positive if the discounted, expected gains to at least one of its two participants are positive. The main result is the existence, for all discount factors and all value functions, of a forward-looking network formation scheme. Furthermore, we can always nd a forward-looking network formation scheme such that (i) the allocation rule is component balanced and (ii) the transition probabilities increase in the di erence in payo s for the corresponding players responsible for the transition. We use this dynamic solution concept to explore the tension between e ciency and stability.

Community structure in real-world networks from a non-parametrical synchronization-based dynamical approach

[EN]This work analyzes the problem of community structure in real-world networks based on the synchronization of nonidentical coupled chaotic Rössler oscillators each one characterized by a defined natural frequency, and coupled according to a predefined network topology. The interaction scheme contemplates an uniformly increasing coupling force to simulate a society in which the association between the agents grows in time. To enhance the stability of the correlated states that could emerge from the synchronization process, we propose a parameterless mechanism that adapts the characteristic frequencies of coupled oscillators according to a dynamic connectivity matrix deduced from correlated data. We show that the characteristic frequency vector that results from the adaptation mechanism reveals the underlying community structure present in the network.

Contributions to unsupervised and supervised learning with applications in digital image processing

311 p. : il.

DLK1 and DLK2 characterization in mouse salivary gland development

103 p.; 102 p.