Input chains and industrialization

A key aspect of industrialization is theadoption of increasing-returns-to-scale, industrial,technologies. Two other, well-documented aspects arethat industrial technologies are adopted throughoutintermediate-input chains and that they use intermediateinputs intensively relative to the technologies theyreplace. These features of industrial technologiescombined imply that countries with access to similartechnologies may have very different levels ofindustrialization and income, even if the degree ofincreasing returns to scale at the firm level is relativelysmall. Furthermore, a small improvement in theproductivity of industrial technologies can trigger full-scaleindustrialization and a large increase in income.

On certain greedoid polyhedra, partially indexable scheduling problems and extended restless bandit allocation indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid(whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then theproblem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

Restless bandits, partial conservation laws and indexability

We show that if performance measures in a stochastic scheduling problem satisfy a set of so-called partial conservation laws (PCL), which extend previously studied generalized conservation laws (GCL), then the problem is solved optimally by a priority-index policy for an appropriate range of linear performance objectives, where the optimal indices are computed by a one-pass adaptive-greedy algorithm, based on Klimov's. We further apply this framework to investigate the indexability property of restless bandits introduced by Whittle, obtaining the following results: (1) we identify a class of restless bandits (PCL-indexable) which are indexable; membership in this class is tested through a single run of the adaptive-greedy algorithm, which also computes the Whittle indices when the test is positive; this provides a tractable sufficient condition for indexability; (2) we further indentify the class of GCL-indexable bandits, which includes classical bandits, having the property that they are indexable under any linear reward objective. The analysis is based on the so-called achievable region method, as the results follow fromnew linear programming formulations for the problems investigated.

Long term debt with hidden borrowing

We consider borrowers with the opportunity to raise funds from a competitive baking sector,that shares information about borrowers, and an alternative hidden lender. We highlight thatthe presence of the hidden lender restricts the contracts that can be obtained from the banking sector and that in equilibrium some borrowers obtain funds from both the banking sector and the (inefficient) hidden lender simultaneously. We further show that as the inefficiency of the hidden lender increases, total welfare decreases. By extending the model to examine a partially hidden lender, we further highlight the key role of information.

Dynamical properties of discrete breathers in curved chains with first and second neighbor interaction

We present the study of discrete breather dynamics in curved polymerlike chains consisting of masses connected via nonlinear springs. The polymer chains are one dimensional but not rectilinear and their motion takes place on a plane. After constructing breathers following numerically accurate procedures, we launch them in the chains and investigate properties of their propagation dynamics. We find that breather motion is strongly affected by the presence of curved regions of polymers, while the breathers themselves show a very strong resilience and remarkable stability in the presence of geometrical changes. For chains with strong angular rigidity we find that breathers either pass through bent regions or get reflected while retaining their frequency. Their motion is practically lossless and seems to be determined through local energy conservation. For less rigid chains modeled via second neighbor interactions, we find similarly that chain geometry typically does not destroy the localized breather states but, contrary to the angularly rigid chains, it induces some small but constant energy loss. Furthermore, we find that a curved segment acts as an active gate reflecting or refracting the incident breather and transforming its velocity to a value that depends on the discrete breathers frequency. We analyze the physical reasoning behind these seemingly general breather properties.

Confinement of discrete breathers in inhomogeneously profiled nonlinear chains

We investigate numerically the scattering of a moving discrete breather on a pair of junctions in a Fermi-Pasta-Ulam chain. These junctions delimit an extended region with different masses of the particles. We consider (i) a rectangular trap, (ii) a wedge shaped trap, and (iii) a smoothly varying convex or concave mass profile. All three cases lead to DB confinement, with the ease of trapping depending on the profile of the trap. We also study the collision and trapping of two DBs within the profile as a function of trap width, shape, and approach time at the two junctions. The latter controls whether one or both DBs are trapped.

Stochastic processes induced by dichotomous markov noise: Some exact dynamical results

Stochastic processes defined by a general Langevin equation of motion where the noise is the non-Gaussian dichotomous Markov noise are studied. A non-FokkerPlanck master differential equation is deduced for the probability density of these processes. Two different models are exactly solved. In the second one, a nonequilibrium bimodal distribution induced by the noise is observed for a critical value of its correlation time. Critical slowing down does not appear in this point but in another one.

Self-similarity of complex networks and hidden metric spaces

We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces. Clustering, i.e., cycles of length three, plays a crucial role in this framework as a topological reflection of the triangle inequality in the hidden geometry. We prove that a class of hidden variable models with underlying metric spaces are able to accurately reproduce the self-similarity properties that we measured in the real networks. Our findings indicate that hidden geometries underlying these real networks are a plausible explanation for their observed topologies and, in particular, for their self-similarity with respect to the degree-based renormalization.

Class of correlated random networks with hidden variables

We study a class of models of correlated random networks in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices. We find analytical expressions for the main topological properties of these models as a function of the distribution of hidden variables and the probability of connecting vertices. The expressions obtained are checked by means of numerical simulations in a particular example. The general model is extended to describe a practical algorithm to generate random networks with an a priori specified correlation structure. We also present an extension of the class, to map nonequilibrium growing networks to networks with hidden variables that represent the time at which each vertex was introduced in the system.

Variational localized-site cluster expansions. X. Dimerization in linear Heisenberg chains

Ground-state instability to bond alternation in long linear chains is considered from the point of view of valence-bond (VB) theory. This instability is viewed as the consequence of a long-range order (LRO) which is expected if the ground state is reasonably described in terms of the Kekulé states (with nearest-neighbor singlet pairing). It is argued that the bond alternation and associated LRO predicted by this simple, VB picture is retained for certain linear Heisenberg models; many-body VB calculations on spin s=1 / 2 and s=1 chains are carried out in a test of this argument.

Dissociation from BiP and Retrotranslocation of Unassembled Immunoglobulin Light Chains Are Tightly Coupled to Proteasome Activity

Unassembled immunoglobulin light chains expressed by the mouse plasmacytoma cell line NS1 (KNS1) are degraded in vivo with a half-life of 50-60 min in a way that closely resembles endoplasmic reticulum (ER)-associated degradation (Knittler et al., 1995). Here we show that the peptide aldehydes MG132 and PS1 and the specific proteasome inhibitor lactacystin effectively increased the half-life of KNS1, arguing for a proteasome-mediated degradation pathway. Subcellular fractionation and protease protection assays have indicated an ER localization of KNS1 upon proteasome inhibition. This was independently confirmed by the analysis of the folding state of KNS1and size fractionation experiments showing that the immunoglobulin light chain remained bound to the ER chaperone BiP when the activity of the proteasome was blocked. Moreover, kinetic studies performed in lactacystin-treated cells revealed a time-dependent increase in the physical stability of the BiP-KNS1complex, suggesting that additional proteins are present in the older complex. Together, our data support a model for ER-associated degradation in which both the release of a soluble nonglycosylated protein from BiP and its retrotranslocation out of the ER are tightly coupled with proteasome activity.

Analyzing hidden semantics in social bookmarking of open educational resources

Web 2.0 services such as social bookmarking allow users to manage and share the links they find interesting, adding their own tags for describingthem. This is especially interesting in the field of open educational resources, asdelicious is a simple way to bridge the institutional point of view (i.e. learningobject repositories) with the individual one (i.e. personal collections), thuspromoting the discovering and sharing of such resources by other users. In this paper we propose a methodology for analyzing such tags in order to discover hidden semantics (i.e. taxonomies and vocabularies) that can be used toimprove descriptions of learning objects and make learning object repositories more visible and discoverable. We propose the use of a simple statistical analysis tool such as principal component analysis to discover which tags createclusters that can be semantically interpreted. We will compare the obtained results with a collection of resources related to open educational resources, in order to better understand the real needs of people searching for open educational resources.

Content value chains modelling using a copyright ontology

Existing digital rights management (DRM) systems, initiatives like Creative Commons or research works as some digital rights ontologies provide limited support for content value chains modelling and management. This is becoming a critical issue as content markets start to profit from the possibilities of digital networks and the World Wide Web. The objective is to support the whole copyrighted content value chain across enterprise or business niches boundaries. Our proposal provides a framework that accommodates copyright law and a rich creation model in order to cope with all the creation life cycle stages. The dynamic aspects of value chains are modelled using a hybrid approach that combines ontology-based and rule-based mechanisms. The ontology implementation is based on Web Ontology Language and Description Logic (OWL-DL) reasoners, are directly used for license checking. On the other hand, for more complex aspects of the dynamics of content value chains, rule languages are the choice.