Has Low Productivity Constrained Competitiveness of African Firms? : Comparison of the Firm Performances with Asian Firms

It has been argued that poor productive performance is one of critical sources of stagnation of the African manufacturing sector, but firm-level empirical supports are limited. Using the inter-regional firm data of the garment industry, technical efficiency and its contribution to competitiveness measured as unit costs were compared between Kenyan and Bangladeshi firms. Our estimates indicated that there is no significant gap in the average technical efficiency of the two industries despite conservative estimation, although unit costs greatly differ between the two industries. Higher unit cost in Kenyan firms mainly stems from high labour cost, while impact of inefficiency is quite small. Productivity accounts little for the stagnation of garment industry in several African countries.

Localization and Tracking in Energy-Constrained Networks with Dynamic Connectivity

Systems used for target localization, such as goods, individuals, or animals, commonly rely on operational means to meet the final application demands. However, what would happen if some means were powered up randomly by harvesting systems? And what if those devices not randomly powered had their duty cycles restricted? Under what conditions would such an operation be tolerable in localization services? What if the references provided by nodes in a tracking problem were distorted? Moreover, there is an underlying topic common to the previous questions regarding the transfer of conceptual models to reality in field tests: what challenges are faced upon deploying a localization network that integrates energy harvesting modules? The application scenario of the system studied is a traditional herding environment of semi domesticated reindeer (Rangifer tarandus tarandus) in northern Scandinavia. In these conditions, information on approximate locations of reindeer is as important as environmental preservation. Herders also need cost-effective devices capable of operating unattended in, sometimes, extreme weather conditions. The analyses developed are worthy not only for the specific application environment presented, but also because they may serve as an approach to performance of navigation systems in absence of reasonably accurate references like the ones of the Global Positioning System (GPS). A number of energy-harvesting solutions, like thermal and radio-frequency harvesting, do not commonly provide power beyond one milliwatt. When they do, battery buffers may be needed (as it happens with solar energy) which may raise costs and make systems more dependent on environmental temperatures. In general, given our problem, a harvesting system is needed that be capable of providing energy bursts of, at least, some milliwatts. Many works on localization problems assume that devices have certain capabilities to determine unknown locations based on range-based techniques or fingerprinting which cannot be assumed in the approach considered herein. The system presented is akin to range-free techniques, but goes to the extent of considering very low node densities: most range-free techniques are, therefore, not applicable. Animal localization, in particular, uses to be supported by accurate devices such as GPS collars which deplete batteries in, maximum, a few days. Such short-life solutions are not particularly desirable in the framework considered. In tracking, the challenge may times addressed aims at attaining high precision levels from complex reliable hardware and thorough processing techniques. One of the challenges in this Thesis is the use of equipment with just part of its facilities in permanent operation, which may yield high input noise levels in the form of distorted reference points. The solution presented integrates a kinetic harvesting module in some nodes which are expected to be a majority in the network. These modules are capable of providing power bursts of some milliwatts which suffice to meet node energy demands. The usage of harvesting modules in the aforementioned conditions makes the system less dependent on environmental temperatures as no batteries are used in nodes with harvesters--it may be also an advantage in economic terms. There is a second kind of nodes. They are battery powered (without kinetic energy harvesters), and are, therefore, dependent on temperature and battery replacements. In addition, their operation is constrained by duty cycles in order to extend node lifetime and, consequently, their autonomy. There is, in turn, a third type of nodes (hotspots) which can be static or mobile. They are also battery-powered, and are used to retrieve information from the network so that it is presented to users. The system operational chain starts at the kinetic-powered nodes broadcasting their own identifier. If an identifier is received at a battery-powered node, the latter stores it for its records. Later, as the recording node meets a hotspot, its full record of detections is transferred to the hotspot. Every detection registry comprises, at least, a node identifier and the position read from its GPS module by the battery-operated node previously to detection. The characteristics of the system presented make the aforementioned operation own certain particularities which are also studied. First, identifier transmissions are random as they depend on movements at kinetic modules--reindeer movements in our application. Not every movement suffices since it must overcome a certain energy threshold. Second, identifier transmissions may not be heard unless there is a battery-powered node in the surroundings. Third, battery-powered nodes do not poll continuously their GPS module, hence localization errors rise even more. Let's recall at this point that such behavior is tight to the aforementioned power saving policies to extend node lifetime. Last, some time is elapsed between the instant an identifier random transmission is detected and the moment the user is aware of such a detection: it takes some time to find a hotspot. Tracking is posed as a problem of a single kinetically-powered target and a population of battery-operated nodes with higher densities than before in localization. Since the latter provide their approximate positions as reference locations, the study is again focused on assessing the impact of such distorted references on performance. Unlike in localization, distance-estimation capabilities based on signal parameters are assumed in this problem. Three variants of the Kalman filter family are applied in this context: the regular Kalman filter, the alpha-beta filter, and the unscented Kalman filter. The study enclosed hereafter comprises both field tests and simulations. Field tests were used mainly to assess the challenges related to power supply and operation in extreme conditions as well as to model nodes and some aspects of their operation in the application scenario. These models are the basics of the simulations developed later. The overall system performance is analyzed according to three metrics: number of detections per kinetic node, accuracy, and latency. The links between these metrics and the operational conditions are also discussed and characterized statistically. Subsequently, such statistical characterization is used to forecast performance figures given specific operational parameters. In tracking, also studied via simulations, nonlinear relationships are found between accuracy and duty cycles and cluster sizes of battery-operated nodes. The solution presented may be more complex in terms of network structure than existing solutions based on GPS collars. However, its main gain lies on taking advantage of users' error tolerance to reduce costs and become more environmentally friendly by diminishing the potential amount of batteries that can be lost. Whether it is applicable or not depends ultimately on the conditions and requirements imposed by users' needs and operational environments, which is, as it has been explained, one of the topics of this Thesis.

Evolutionary computation of forests with Degree- and Role-Constrained Minimum Spanning Trees

Finding the degree-constrained minimum spanning tree (DCMST) of a graph is a widely studied NP-hard problem. One of its most important applications is network design. Here we deal with a new variant of the DCMST problem, which consists of finding not only the degree- but also the role-constrained minimum spanning tree (DRCMST), i.e., we add constraints to restrict the role of the nodes in the tree to root, intermediate or leaf node. Furthermore, we do not limit the number of root nodes to one, thereby, generally, building a forest of DRCMSTs. The modeling of network design problems can benefit from the possibility of generating more than one tree and determining the role of the nodes in the network. We propose a novel permutation-based representation to encode these forests. In this new representation, one permutation simultaneously encodes all the trees to be built. We simulate a wide variety of DRCMST problems which we optimize using eight different evolutionary computation algorithms encoding individuals of the population using the proposed representation. The algorithms we use are: estimation of distribution algorithm, generational genetic algorithm, steady-state genetic algorithm, covariance matrix adaptation evolution strategy, differential evolution, elitist evolution strategy, non-elitist evolution strategy and particle swarm optimization. The best results are for the estimation of distribution algorithms and both types of genetic algorithms, although the genetic algorithms are significantly faster.

A control theoretic approach to solve a constrained uplink power dynamic game

This paper addresses an uplink power control dynamic game where we assume that each user battery represents the system state that changes with time following a discrete-time version of a differential game. To overcome the complexity of the analysis of a dynamic game approach we focus on the concept of Dynamic Potential Games showing that the game can be solved as an equivalent Multivariate Optimum Control Problem. The solution of this problem is quite interesting because different users split the activity in time, avoiding higher interferences and providing a long term fairness.

Development of a fuzzy control based self-adaptive system for energy saving in constrained networks for the Internet of Things

Las redes del futuro, incluyendo las redes de próxima generación, tienen entre sus objetivos de diseño el control sobre el consumo de energía y la conectividad de la red. Estos objetivos cobran especial relevancia cuando hablamos de redes con capacidades limitadas, como es el caso de las redes de sensores inalámbricos (WSN por sus siglas en inglés). Estas redes se caracterizan por estar formadas por dispositivos de baja o muy baja capacidad de proceso y por depender de baterías para su alimentación. Por tanto la optimización de la energía consumida se hace muy importante. Son muchas las propuestas que se han realizado para optimizar el consumo de energía en este tipo de redes. Quizás las más conocidas son las que se basan en la planificación coordinada de periodos de actividad e inactividad, siendo una de las formas más eficaces para extender el tiempo de vida de las baterías. La propuesta que se presenta en este trabajo se basa en el control de la conectividad mediante una aproximación probabilística. La idea subyacente es que se puede esperar que una red mantenga la conectividad si todos sus nodos tienen al menos un número determinado de vecinos. Empleando algún mecanismo que mantenga ese número, se espera que se pueda mantener la conectividad con un consumo energético menor que si se empleara una potencia de transmisión fija que garantizara una conectividad similar. Para que el mecanismo sea eficiente debe tener la menor huella posible en los dispositivos donde se vaya a emplear. Por eso se propone el uso de un sistema auto-adaptativo basado en control mediante lógica borrosa. En este trabajo se ha diseñado e implementado el sistema descrito, y se ha probado en un despliegue real confirmando que efectivamente existen configuraciones posibles que permiten mantener la conectividad ahorrando energía con respecto al uso de una potencia de transmisión fija. ABSTRACT. Among the design goals for future networks, including next generation networks, we can find the energy consumption and the connectivity. These two goals are of special relevance when dealing with constrained networks. That is the case of Wireless Sensors Networks (WSN). These networks consist of devices with low or very low processing capabilities. They also depend on batteries for their operation. Thus energy optimization becomes a very important issue. Several proposals have been made for optimizing the energy consumption in this kind of networks. Perhaps the best known are those based on the coordinated planning of active and sleep intervals. They are indeed one of the most effective ways to extend the lifetime of the batteries. The proposal presented in this work uses a probabilistic approach to control the connectivity of a network. The underlying idea is that it is highly probable that the network will have a good connectivity if all the nodes have a minimum number of neighbors. By using some mechanism to reach that number, we hope that we can preserve the connectivity with a lower energy consumption compared to the required one if a fixed transmission power is used to achieve a similar connectivity. The mechanism must have the smallest footprint possible on the devices being used in order to be efficient. Therefore a fuzzy control based self-adaptive system is proposed. This work includes the design and implementation of the described system. It also has been validated in a real scenario deployment. We have obtained results supporting that there exist configurations where it is possible to get a good connectivity saving energy when compared to the use of a fixed transmission power for a similar connectivity.

Distal enhancer regulation by promoter derepression in topologically constrained DNA in vitro

Long-range promoter–enhancer interactions are a crucial regulatory feature of many eukaryotic genes yet little is known about the mechanisms involved. Using cloned chicken βA-globin genes, either individually or within the natural chromosomal locus, enhancer-dependent transcription is achieved in vitro at a distance of 2 kb with developmentally staged erythroid extracts. This occurs by promoter derepression and is critically dependent upon DNA topology. In the presence of the enhancer, genes must exist in a supercoiled conformation to be actively transcribed, whereas relaxed or linear templates are inactive. Distal protein–protein interactions in vitro may be favored on supercoiled DNA because of topological constraints. In this system, enhancers act primarily to increase the probability of rapid and efficient transcription complex formation and initiation. Repressor and activator proteins binding within the promoter, including erythroid-specific GATA-1, mediate this process.

Inhibition of HIV type 1 infectivity by constrained α-helical peptides: Implications for the viral fusion mechanism

Linear peptides derived from the membrane proximal region of the gp41 ectodomain are effective inhibitors of HIV type 1 (HIV-1)-mediated fusion events. These inhibitory peptides lack structure in solution, rendering mechanistic interpretation of their activity difficult. Using structurally constrained analogs of these molecules, we demonstrate that the peptides inhibit infectivity by adopting a helical conformation. Moreover, we show that a specific face of the helix must be exposed to block viral infectivity. Recent crystal structures show that the region of gp41 corresponding to the inhibitory peptides is helical and uses the analogous face to pack against a groove formed by an N-terminal coiled-coil trimer. Our results provide a direct link between the inhibition of HIV-1 infectivity by these peptides and the x-ray structures, and suggest that the conformation of gp41 observed by crystallography represents the fusogenic state. Other agents that block HIV-1 infectivity by binding to this groove may hold promise for the treatment of AIDS.

A growth-constrained environment drives tumor progression in vivo

We recently have shown that selective growth of transplanted normal hepatocytes can be achieved in a setting of cell cycle block of endogenous parenchymal cells. Thus, massive proliferation of donor-derived normal hepatocytes was observed in the liver of rats previously given retrorsine (RS), a naturally occurring alkaloid that blocks proliferation of resident liver cells. In the present study, the fate of nodular hepatocytes transplanted into RS-treated or normal syngeneic recipients was followed. The dipeptidyl peptidase type IV-deficient (DPPIV−) rat model for hepatocyte transplantation was used to distinguish donor-derived cells from recipient cells. Hepatocyte nodules were chemically induced in Fischer 344, DPPIV+ rats; livers were then perfused and larger (>5 mm) nodules were separated from surrounding tissue. Cells isolated from either tissue were then injected into normal or RS-treated DPPIV− recipients. One month after transplantation, grossly visible nodules (2–3 mm) were seen in RS-treated recipients transplanted with nodular cells. They grew rapidly, occupying 80–90% of the host liver at 2 months, and progressed to hepatocellular carcinoma within 4 months. By contrast, no liver nodules developed within 6 months when nodular hepatocytes were injected into the liver of recipients not exposed to RS, although small clusters of donor-derived cells were present in these animals. Taken together, these results directly point to a fundamental role played by the host environment in modulating the growth and the progression rate of altered cells during carcinogenesis. In particular, they indicate that conditions associated with growth constraint of the host tissue can drive tumor progression in vivo.

Betidamino acids: versatile and constrained scaffolds for drug discovery.

Betidamino acids (a contraction of "beta" position and "amide") are N'-monoacylated (optionally, N'-monoacylated and N-mono- or N,N'-dialkylated) aminoglycine derivatives in which each N'acyl/alkyl group may mimic naturally occurring amino acid side chains or introduce novel functionalities. Betidamino acids are most conveniently generated on solid supports used for the synthesis of peptides by selective acylation of one of the two amino functions of orthogonally protected aminoglycine(s) to generate the side chain either prior to or after the elongation of the main chain. We have used unresolved Nalpha-tert-butyloxycarbonyl-N'alpha-fluorenylmethoxycarbonyl++ + aminoglycine, and Nalpha-(Nalpha-methyl)-tert-butyloxycarbonyl-N'alpha-fluo renylmethoxycarbonyl aminoglycine as the templates for the introduction of betidamino acids in Acyline [Ac-D2Nal-D4Cpa-D3Pal-Ser-4Aph(Ac)-D4Aph(A c)-Leu-Ilys-Pro-DAla-NH2, where 2Nal is 2-naphthylalanine, 4Cpa is 4-chlorophenylalanine, 3Pal is 3-pyridylalanine, Aph is 4-aminophenylalanine, and Ilys is Nepsilon-isopropyllysine], a potent gonadotropin-releasing hormone antagonist, in order to test biocompatibility of these derivatives. Diasteremneric peptides could be separated in most cases by reverse-phase HPLC. Biological results indicated small differences in relative potencies (<5-fold) between the D and L nonalkylated betidamino acid-containing Acyline derivatives. Importantly, most betide diastereomers were equipotent with Acyline. In an attempt to correlate structure and observed potency, Ramachandran-type plots were calculated for a series of betidamino acids and their methylated homologs. According to these calculations, betidamino acids have access to a more limited and distinct number of conformational states (including those associated with alpha-helices, beta-sheets, or turn structures), with deeper minima than those observed for natural amino acids.

Potent, structurally constrained agonists and competitive antagonists of corticotropin-releasing factor.

Predictive methods, physicochemical measurements, and structure activity relationship studies suggest that corticotropin-releasing factor (CRF; corticoliberin), its family members, and competitive antagonists (resulting from N-terminal deletions) usually assume an alpha-helical conformation when interacting with the CRF receptor(s). To test this hypothesis further, we have scanned the whole sequence of the CRF antagonist [D-Phe12,Nle21,38]r/hCRF-(12-41) (r/hCRF, rat/human CRF; Nle, norleucine) with an i-(i + 3) bridge consisting of the Glu-Xaa-Xaa-Lys scaffold. We have found astressin [cyclo(30-33)[D-Phe12,Nle21,38,Glu30,Lys33]r/ hCRF(12-41)] to be approximately 30 times more potent than [D-Phe12,Nle21,38]r/hCRF-(12-41), our present standard, and 300 times more potent than the corresponding linear analog in an in vitro pituitary cell culture assay. Astressin has low affinity for the CRF binding protein and high affinity (Ki = 2 nM) for the cloned pituitary receptor. Radioiodinated [D-125I-Tyr12]astressin was found to be a reliable ligand for binding assays. In vivo, astressin is significantly more potent than any previously tested antagonist in reducing hypophyseal corticotropin (ACTH) secretion in stressed or adrenalectomized rats. The cyclo(30-33)[Ac-Pro4,D-Phe12,Nle21,38,Glu30,Lys33++ +]r/hCRF-(4-41) agonist and its linear analog are nearly equipotent, while the antagonist astressin and its linear form vary greatly in their potencies. This suggests that the lactam cyclization reinstates a structural constraint in the antagonists that is normally induced by the N terminus of the agonist.

Enhanced conformational sampling in Monte Carlo simulations of proteins: application to a constrained peptide.

A Monte Carlo simulation method for globular proteins, called extended-scaled-collective-variable (ESCV) Monte Carlo, is proposed. This method combines two Monte Carlo algorithms known as entropy-sampling and scaled-collective-variable algorithms. Entropy-sampling Monte Carlo is able to sample a large configurational space even in a disordered system that has a large number of potential barriers. In contrast, scaled-collective-variable Monte Carlo provides an efficient sampling for a system whose dynamics is highly cooperative. Because a globular protein is a disordered system whose dynamics is characterized by collective motions, a combination of these two algorithms could provide an optimal Monte Carlo simulation for a globular protein. As a test case, we have carried out an ESCV Monte Carlo simulation for a cell adhesive Arg-Gly-Asp-containing peptide, Lys-Arg-Cys-Arg-Gly-Asp-Cys-Met-Asp, and determined the conformational distribution at 300 K. The peptide contains a disulfide bridge between the two cysteine residues. This bond mimics the strong geometrical constraints that result from a protein's globular nature and give rise to highly cooperative dynamics. Computation results show that the ESCV Monte Carlo was not trapped at any local minimum and that the canonical distribution was correctly determined.

Pion-kaon scattering amplitude constrained with forward dispersion relations up to 1.6 GeV

In this work we provide simple and precise parametrizations of the existing πK scattering data from threshold up to 1.6 GeV, which are constrained to satisfy forward dispersion relations as well as three additional threshold sum rules. We also provide phenomenological values of the threshold parameters and of the resonance poles that appear in elastic scattering.

Stationarity and regularity of infinite collections of sets. Applications to infinitely constrained optimization

This article continues the investigation of stationarity and regularity properties of infinite collections of sets in a Banach space started in Kruger and López (J. Optim. Theory Appl. 154(2), 2012), and is mainly focused on the application of the stationarity criteria to infinitely constrained optimization problems. We consider several settings of optimization problems which involve (explicitly or implicitly) infinite collections of sets and deduce for them necessary conditions characterizing stationarity in terms of dual space elements—normals and/or subdifferentials.