New stakeholders, spaces and instruments of analysis in the context of energy relationships: Case studies from Kazakhstan and Turkmenistan

The disintegration of the USSR brought the emergence of a new geo-energy space in Central Asia. This space arose in the context of a global energy transition, which began in the late 1970s. Therefore, this new space in a changing energy world requires both new conceptual frameworks of analysis and the creation of new analytical tools. Taking into account this fact, our paper attempts to apply the theoretical framework of the Global Commodity Chain (GCC) to the case of natural resources in Central Asia. The aim of the paper is to check if there could be any Central Asia’s geo-energy space, assuming that this space would exist if natural resources were managed with regional criteria. The paper is divided into four sections. First an introduction that describes the new global energy context within natural resources of Central Asia would be integrated. Secondly, the paper justifies why the GCC methodology is suitable for the study of the value chains of energy products. Thirdly, we build up three cases studies (oil and uranium from Kazakhstan and gas from Turkmenistan) which reveal a high degree of uncertainty over the direction these chains will take. Finally, we present the conclusions of this study that state that the most plausible scenario would be the integration of energy resources of these countries in GCC where the core of the decision-making process will be far away from the region of Central Asia. Key words: Energy transition, geo-energy space, Global Commodity Chains, Central Asia

Calorimetry of dehydrogenation and dangling-bond recombination in several hydrogenated amorphous silicon materials

Differential scanning calorimetry (DSC) was used to study the dehydrogenation processes that take place in three hydrogenated amorphous silicon materials: nanoparticles, polymorphous silicon, and conventional device-quality amorphous silicon. Comparison of DSC thermograms with evolved gas analysis (EGA) has led to the identification of four dehydrogenation processes arising from polymeric chains (A), SiH groups at the surfaces of internal voids (A'), SiH groups at interfaces (B), and in the bulk (C). All of them are slightly exothermic with enthalpies below 50 meV/H atoms , indicating that, after dissociation of any SiH group, most dangling bonds recombine. The kinetics of the three low-temperature processes [with DSC peak temperatures at around 320 (A),360 (A'), and 430°C (B)] exhibit a kinetic-compensation effect characterized by a linea relationship between the activation entropy and enthalpy, which constitutes their signature. Their Si-H bond-dissociation energies have been determined to be E (Si-H)0=3.14 (A), 3.19 (A'), and 3.28 eV (B). In these cases it was possible to extract the formation energy E(DB) of the dangling bonds that recombine after Si-H bond breaking [0.97 (A), 1.05 (A'), and 1.12 (B)]. It is concluded that E(DB) increases with the degree of confinement and that E(DB)>1.10 eV for the isolated dangling bond in the bulk. After Si-H dissociation and for the low-temperature processes, hydrogen is transported in molecular form and a low relaxation of the silicon network is promoted. This is in contrast to the high-temperature process for which the diffusion of H in atomic form induces a substantial lattice relaxation that, for the conventional amorphous sample, releases energy of around 600 meV per H atom. It is argued that the density of sites in the Si network for H trapping diminishes during atomic diffusion

Role of Particle Shape on the Stress Propagation in Granular Packings

We present an experimental and numerical study on the influence that particle aspect ratio has on the mechanical and structural properties of granular packings. For grains with maximal symmetry (squares), the stress propagation in the packing localizes forming chainlike forces analogous to the ones observed for spherical grains. This scenario can be understood in terms of stochastic models of aggregation and random multiplicative processes. As the grains elongate, the stress propagation is strongly affected. The interparticle normal force distribution tends toward a Gaussian, and, correspondingly, the force chains spread leading to a more uniform stress distribution reminiscent of the hydrostatic profiles known for standard liquids

Anharmonicity contributions to the vibrational second hyperpolarizability of conjugated oligomers

Restricted Hartree-Fock 6-31G calculations of electrical and mechanical anharmonicity contributions to the longitudinal vibrational second hyperpolarizability have been carried out for eight homologous series of conjugated oligomers - polyacetylene, polyyne, polydiacetylene, polybutatriene, polycumulene, polysilane, polymethineimine, and polypyrrole. To draw conclusions about the limiting infinite polymer behavior, chains containing up to 12 heavy atoms along the conjugated backbone were considered. In general, the vibrational hyperpolarizabilities are substantial in comparison with their static electronic counterparts for the dc-Kerr and degenerate four-wave mixing processes (as well as for static fields) but not for electric field-induced second harmonic generation or third harmonic generation. Anharmonicity terms due to nuclear relaxation are important for the dc-Kerr effect (and for the static hyperpolarizability) in the σ-conjugated polymer, polysilane, as well as the nonplanar π systems polymethineimine and polypyrrole. Restricting polypyrrole to be planar, as it is in the crystal phase, causes these anharmonic terms to become negligible. When the same restriction is applied to polymethineimine the effect is reduced but remains quantitatively significant due to the first-order contribution. We conclude that anharmonicity associated with nuclear relaxation can be ignored, for semiquantitative purposes, in planar π-conjugated polymers. The role of zero-point vibrational averaging remains to be evaluated

Fusion of the human gene for the polyubiquitination co-effector UEV-1 with Kua, a newly identified gene

UEV proteins are enzymatically inactive variants of the E2 ubiquitin-conjugating enzymes that regulate noncanonical elongation of ubiquitin chains. In Saccharomyces cerevisiae, UEV is part of the RAD6-mediated error-free DNA repair pathway. In mammalian cells, UEV proteins can modulate c-FOS transcription and the G2-M transition of the cell cycle. Here we show that the UEV genes from phylogenetically distant organisms present a remarkable conservation in their exon–intron structure. We also show that the human UEV1 gene is fused with the previously unknown gene Kua. In Caenorhabditis elegans and Drosophila melanogaster, Kua and UEV are in separated loci, and are expressed as independent transcripts and proteins. In humans, Kua and UEV1 are adjacent genes, expressed either as separate transcripts encoding independent Kua and UEV1 proteins, or as a hybrid Kua–UEV transcript, encoding a two-domain protein. Kua proteins represent a novel class of conserved proteins with juxtamembrane histidine-rich motifs. Experiments with epitope-tagged proteins show that UEV1A is a nuclear protein, whereas both Kua and Kua–UEV localize to cytoplasmic structures, indicating that the Kua domain determines the cytoplasmic localization of Kua–UEV. Therefore, the addition of a Kua domain to UEV in the fused Kua–UEV protein confers new biological properties to this regulator of variant polyubiquitination.[Kua cDNAs isolated by RT-PCR and described in this paper have been deposited in the GenBank data library under accession nos. AF1155120 (H. sapiens) and AF152361 (D. melanogaster). Genomic clones containing UEV genes: S. cerevisiae, YGL087c (accession no. Z72609); S. pombe, c338 (accession no. AL023781); P. falciparum, MAL3P2 (accession no. AL034558); A. thaliana, F26F24 (accession no. AC005292); C. elegans, F39B2 (accession no. Z92834); D. melanogaster, AC014908; and H. sapiens, 1185N5 (accession no. AL034423). Accession numbers for Kua cDNAs in GenBank dbEST: M. musculus, AA7853; T. cruzi, AI612534. Other Kua-containing sequences: A. thaliana genomic clones F10M23 (accession no. AL035440), F19K23 (accession no. AC000375), and T20K9 (accession no. AC004786).

Towards a User-Friendly Platform for Building Language Resources based on Web Services

This paper presents the platform developed in the PANACEA project, a distributed factory that automates the stages involved in the acquisition, production, updating and maintenance of Language Resources required by Machine Translation and other Language Technologies. We adopt a set of tools that have been successfully used in the Bioinformatics field, they are adapted to the needs of our field and used to deploy web services, which can be combined to build more complex processing chains (workflows). This paper describes the platform and its different components (web services, registry, workflows, social network and interoperability). We demonstrate the scalability of the platform by carrying out a set of massive data experiments. Finally, a validation of the platform across a set of required criteria proves its usability for different types of users (non-technical users and providers).

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 the problem 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.

The network origins of aggregate fluctuations

This paper argues that in the presence of intersectoral input-output linkages, microeconomicidiosyncratic shocks may lead to aggregate fluctuations. In particular, itshows that, as the economy becomes more disaggregated, the rate at which aggregatevolatility decays is determined by the structure of the network capturing such linkages.Our main results provide a characterization of this relationship in terms of the importanceof different sectors as suppliers to their immediate customers as well as theirrole as indirect suppliers to chains of downstream sectors. Such higher-order interconnectionscapture the possibility of "cascade effects" whereby productivity shocks to asector propagate not only to its immediate downstream customers, but also indirectlyto the rest of the economy. Our results highlight that sizable aggregate volatility isobtained from sectoral idiosyncratic shocks only if there exists significant asymmetryin the roles that sectors play as suppliers to others, and that the "sparseness" of theinput-output matrix is unrelated to the nature of aggregate fluctuations.

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.

Adaptive approach heuristics for the generalized assignment problem

The Generalized Assignment Problem consists in assigning a setof tasks to a set of agents with minimum cost. Each agent hasa limited amount of a single resource and each task must beassigned to one and only one agent, requiring a certain amountof the resource of the agent. We present new metaheuristics forthe generalized assignment problem based on hybrid approaches.One metaheuristic is a MAX-MIN Ant System (MMAS), an improvedversion of the Ant System, which was recently proposed byStutzle and Hoos to combinatorial optimization problems, and itcan be seen has an adaptive sampling algorithm that takes inconsideration the experience gathered in earlier iterations ofthe algorithm. Moreover, the latter heuristic is combined withlocal search and tabu search heuristics to improve the search.A greedy randomized adaptive search heuristic (GRASP) is alsoproposed. Several neighborhoods are studied, including one basedon ejection chains that produces good moves withoutincreasing the computational effort. We present computationalresults of the comparative performance, followed by concludingremarks and ideas on future research in generalized assignmentrelated problems.

Forecasting and turning point predictions in a Bayesian panel VAR model

We provide methods for forecasting variables and predicting turning points in panel Bayesian VARs. We specify a flexible model which accounts for both interdependencies in the cross section and time variations in the parameters. Posterior distributions for the parameters are obtained for a particular type of diffuse, for Minnesota-type and for hierarchical priors. Formulas for multistep, multiunit point and average forecasts are provided. An application to the problem of forecasting the growth rate of output and of predicting turning points in the G-7 illustrates the approach. A comparison with alternative forecasting methods is also provided.

A recoverable production planning model

Aware of the importance of developing new alternatives to improve the performance of the companies, our purpose in this paper is to develop a medium term production planning model that deals with the concepts of Partnership and Reverse Logistics. Our model takes advantage of the synergies of integration, developing a model for global production planning that generates the optimal production and purchasing schedule for all the companies integrating a logistic chain. In a second part of the paper we incorporate products returns to the first model proposed, and analyze the implications they have over this model. We use some examples with different configurations of supply chains varying the number of production plants, distribution centers and recovery plants. To solve the model we have combined optimization and simulation procedures.

Programa de gestió per la Boutique Shahrazad

Per tal d'iniciar el meu TFC, vaig decidir començar a desenvolupar un programa que contempla la gestió diària del comerç, així com la dels productes, clients, proveïdors, vendes i compres, d’un negoci que es tracta d’una botiga de roba, sabates,bosses i complements, per tal de convertir-ho en un sistema de gestió més complert. Actualment, l’entorn de negoci en el petit comerç està cada cop més desplaçat degut al gran creixement de les grans superfícies per part de franquícies de cadenes molt potents. A més, els clients són cada cop més exigents i el mercat està cada vegada més saturat. És per això que voldrem incloure un valor afegit al sistema, per poder donar un nou punt de vista al negoci, de tal manera que permeti nodrir la nostra relació amb el client, de manera que la col•laboració sigui satisfactòria per ambdues parts. I per acabar s’elabora una pàgina web per tal de fer promoció i publicitat per la botiga, ja que avui en dia és molt important existir en el món virtual.

Superheavy nuclei in relativistic effective Lagrangian model

Isotopic and isotonic chains of superheavy nuclei are analyzed to search for spherical double shell closures beyond Z=82 and N=126 within the new effective field theory model of Furnstahl, Serot, and Tang for the relativistic nuclear many-body problem. We take into account several indicators to identify the occurrence of possible shell closures, such as two-nucleon separation energies, two-nucleon shell gaps, average pairing gaps, and the shell correction energy. The effective Lagrangian model predicts N=172 and Z=120 and N=258 and Z=120 as spherical doubly magic superheavy nuclei, whereas N=184 and Z=114 show some magic character depending on the parameter set. The magicity of a particular neutron (proton) number in the analyzed mass region is found to depend on the number of protons (neutrons) present in the nucleus.