Well-Posedness, Conditioning and Regularization of Minimization, Inclusion and Fixed-Point Problems

AMS subject classification: 65K10, 49M07, 90C25, 90C48.

Editorial:opening Pandora's box? The EU in 2013

Editorinal on the Special Issue: The JCMS Annual Review of the European Union in 2013

Predictors of household hardship in a resource constrained environment:the case of sub-Saharan Africa

Using data from the 2004 wave of the Afrobarometer survey, this study examines correlates of household hardship in three countries of sub-Saharan Africa: Tanzania, Zambia, and Zimbabwe. Findings provide partial support for the hypothesized relationship. Specifically, poverty reduction initiatives and informal assistance are associated with reduced hardship while civic engagement is related to an increase in household hardship. We also note that certain demographic characteristics are linked to hardship. Policy and practice implications are suggested. © The Author(s) 2011.

Weakly-constrained codes for suppression of patterning effects in digital communications

We propose weakly-constrained stream and block codes with tunable pattern-dependent statistics and demonstrate that the block code capacity at large block sizes is close to the the prediction obtained from a simple Markov model published earlier. We demonstrate the feasibility of the code by presenting original encoding and decoding algorithms with a complexity log-linear in the block size and with modest table memory requirements. We also show that when such codes are used for mitigation of patterning effects in optical fibre communications, a gain of about 0.5dB is possible under realistic conditions, at the expense of small redundancy 10%). © 2006 IEEE.

CVaR minimization by the SRA algorithm

Using the risk measure CV aR in �nancial analysis has become more and more popular recently. In this paper we apply CV aR for portfolio optimization. The problem is formulated as a two-stage stochastic programming model, and the SRA algorithm, a recently developed heuristic algorithm, is applied for minimizing CV aR.

CVaR számítás SRA algoritmussal (CVaR minimization by the SRA algorithm)

A CV aR kockázati mérték egyre nagyobb jelentőségre tesz szert portfóliók kockázatának megítélésekor. A portfolió egészére a CVaR kockázati mérték minimalizálását meg lehet fogalmazni kétlépcsős sztochasztikus feladatként. Az SRA algoritmus egy mostanában kifejlesztett megoldó algoritmus sztochasztikus programozási feladatok optimalizálására. Ebben a cikkben az SRA algoritmussal oldottam meg CV aR kockázati mérték minimalizálást. ___________ The risk measure CVaR is becoming more and more popular in recent years. In this paper we use CVaR for portfolio optimization. We formulate the problem as a two-stage stochastic programming model. We apply the SRA algorithm, which is a recently developed heuristic algorithm, to minimizing CVaR.

Makespan minimization in a job shop with a batch processing machine

A job shop with one batch processing and several discrete machines is analyzed. Given a set of jobs, their process routes, processing requirements, and size, the objective is to schedule the jobs such that the makespan is minimized. The batch processing machine can process a batch of jobs as long as the machine capacity is not violated. The batch processing time is equal to the longest processing job in the batch. The problem under study can be represented as Jm:batch:Cmax. If no batches were formed, the scheduling problem under study reduces to the classical job shop scheduling problem (i.e. Jm:: Cmax), which is known to be NP-hard. This research extends the scheduling literature by combining Jm::Cmax with batch processing. The primary contributions are the mathematical formulation, a new network representation and several solution approaches. The problem under study is observed widely in metal working and other industries, but received limited or no attention due to its complexity. A novel network representation of the problem using disjunctive and conjunctive arcs, and a mathematical formulation are proposed to minimize the makespan. Besides that, several algorithms, like batch forming heuristics, dispatching rules, Modified Shifting Bottleneck, Tabu Search (TS) and Simulated Annealing (SA), were developed and implemented. An experimental study was conducted to evaluate the proposed heuristics, and the results were compared to those from a commercial solver (i.e., CPLEX). TS and SA, with the combination of MWKR-FF as the initial solution, gave the best solutions among all the heuristics proposed. Their results were close to CPLEX; and for some larger instances, with total operations greater than 225, they were competitive in terms of solution quality and runtime. For some larger problem instances, CPLEX was unable to report a feasible solution even after running for several hours. Between SA and the experimental study indicated that SA produced a better average Cmax for all instances. The solution approaches proposed will benefit practitioners to schedule a job shop (with both discrete and batch processing machines) more efficiently. The proposed solution approaches are easier to implement and requires short run times to solve large problem instances.

Power and thermal aware scheduling for real-time computing systems

Over the past few decades, we have been enjoying tremendous benefits thanks to the revolutionary advancement of computing systems, driven mainly by the remarkable semiconductor technology scaling and the increasingly complicated processor architecture. However, the exponentially increased transistor density has directly led to exponentially increased power consumption and dramatically elevated system temperature, which not only adversely impacts the system's cost, performance and reliability, but also increases the leakage and thus the overall power consumption. Today, the power and thermal issues have posed enormous challenges and threaten to slow down the continuous evolvement of computer technology. Effective power/thermal-aware design techniques are urgently demanded, at all design abstraction levels, from the circuit-level, the logic-level, to the architectural-level and the system-level. ^ In this dissertation, we present our research efforts to employ real-time scheduling techniques to solve the resource-constrained power/thermal-aware, design-optimization problems. In our research, we developed a set of simple yet accurate system-level models to capture the processor's thermal dynamic as well as the interdependency of leakage power consumption, temperature, and supply voltage. Based on these models, we investigated the fundamental principles in power/thermal-aware scheduling, and developed real-time scheduling techniques targeting at a variety of design objectives, including peak temperature minimization, overall energy reduction, and performance maximization. ^ The novelty of this work is that we integrate the cutting-edge research on power and thermal at the circuit and architectural-level into a set of accurate yet simplified system-level models, and are able to conduct system-level analysis and design based on these models. The theoretical study in this work serves as a solid foundation for the guidance of the power/thermal-aware scheduling algorithms development in practical computing systems.^

Expression of the Myod and T-Box Families of Transcription Factors in the Developing Purkinje Fiber

The coordinated beating of the heart depends on a group ofhighly specialized cells that constitute the cardiac conduction system. Among these cells, the Purkinje fibers are responsible for propagation of the electric impulse into the ventricles. In early stages of development, Purkinje fibers and skeletal muscle fibers originate from similar but separate populations of myocytes. The role of the MyoD family of transcription factors in the development of the myotube is well known, but the role of these factors in the development of the Purkinje fiber is not. Members of the T-Box family of transcription.The coordinated beating of the heart depends on a group ofhighly specialized cells that constitute the cardiac conduction system. Among these cells, the Purkinje fibers are responsible for propagation of the electric impulse into the ventricles. In early stages of development, Purkinje fibers and skeletal muscle fibers originate from similar but separate populations of myocytes. The role of the MyoD family of transcription factors in the development of the myotube is well known, but the role of these factors in the development of the Purkinje fiber is not. Members of the T-Box family of transcription factors are also involved in the development of various cardiac tissues, including the conduction system but little is known about their role in the development of the Purkinje fiber. We explored the expression of members of the MyoD and T-Box families in the developing cardiac conduction system in vivo and in vitro. We showed that the expression of these factors changes as the myocyte differentiates into the Purkinje fiber. We also showed that NRG-1, a secreted protein involved in the development of the Purkinje fiber, features a dose-dependent response in the differentiation of cultured ventricular myocytes.

Estudo da deposição de filmes finos de BaTi(1-X)Zr(X)O3 por meio de planejamento Box-Behnken

Ferroelectric ceramics with perovskite structure (ABO3) are widely used in solid state memories (FeRAM’s and DRAM's) as well as multilayered capacitors, especially as a thin films. When doped with zirconium ions, BaTiO3-based materials form a solid solution known as barium zirconate titanate (BaTi1-xZrxO3). Also called BZT, this material can undergo significant changes in their electrical properties for a small variation of zirconium content in the crystal lattice. The present work is the study of the effects of deposition parameters of BaTi0,75Zr0,25O3 thin films by spin-coating method on their morphology and physical properties, through an experimental design of the Box-Behnken type. The resin used in the process has been synthesized by the polymeric precursor method (Pechini) and subsequently split into three portions each of which has its viscosity adjusted to 10, 20 and 30 mPa∙s by means of a rotary viscometer. The resins were then deposited on Pt/Ti/SiO2/Si substrates by spin-coating method on 15 different combinations of viscosity, spin speed (3000, 5500 and 8000 rpm) and the number of deposited layers (5, 8 and 11 layers) and then calcined at 800 ° C for 1 h. The phase composition of the films was analyzed by X-ray diffraction (XRD) and indexed with the JCPDS 36-0019. Surface morphology and grain size were observed by atomic force microscopy (AFM) indicating uniform films and average grain size around 40 nm. Images of the cross section of the films were obtained by scanning electron microscopy field emission (SEM-FEG), indicating very uniform thicknesses ranging from 140-700 nm between samples. Capacitance measurements were performed at room temperature using an impedance analyzer. The films presented dielectric constant values of 55-305 at 100kHz and low dielectric loss. The design indicated no significant interaction effects between the deposition parameters on the thickness of the films. The response surface methodology enabled better observes the simultaneous effect of variables.

Cooperative routing for collision minimization in wireless sensor networks

Cooperative communication has gained much interest due to its ability to exploit the broadcasting nature of the wireless medium to mitigate multipath fading. There has been considerable amount of research on how cooperative transmission can improve the performance of the network by focusing on the physical layer issues. During the past few years, the researchers have started to take into consideration cooperative transmission in routing and there has been a growing interest in designing and evaluating cooperative routing protocols. Most of the existing cooperative routing algorithms are designed to reduce the energy consumption; however, packet collision minimization using cooperative routing has not been addressed yet. This dissertation presents an optimization framework to minimize collision probability using cooperative routing in wireless sensor networks. More specifically, we develop a mathematical model and formulate the problem as a large-scale Mixed Integer Non-Linear Programming problem. We also propose a solution based on the branch and bound algorithm augmented with reducing the search space (branch and bound space reduction). The proposed strategy builds up the optimal routes from each source to the sink node by providing the best set of hops in each route, the best set of relays, and the optimal power allocation for the cooperative transmission links. To reduce the computational complexity, we propose two near optimal cooperative routing algorithms. In the first near optimal algorithm, we solve the problem by decoupling the optimal power allocation scheme from optimal route selection. Therefore, the problem is formulated by an Integer Non-Linear Programming, which is solved using a branch and bound space reduced method. In the second near optimal algorithm, the cooperative routing problem is solved by decoupling the transmission power and the relay node se- lection from the route selection. After solving the routing problems, the power allocation is applied in the selected route. Simulation results show the algorithms can significantly reduce the collision probability compared with existing cooperative routing schemes.

Semi-engineered earthquake-resistant structures: one-storey buildings built up with gabion-box walls

This thesis studies the static and seismic behavior of simple structures made with gabion box walls. The analysis was performed considering a one-story building with standard dimensions in plan (6m x 5m) and a lightweight timber roof. The main focus of the present investigation is to find the principals aspects of the seismic behavior of a one story building made with gabion box walls, in order to prevent a failure due to seismic actions and in this way help to reduce the seismic risk of developing countries where this natural disaster have a significant intensity. Regarding the gabion box wall, it has been performed some calculations and analysis in order to understand the static and dynamic behavior. From the static point of view, it has been performed a verification of the normal stress computing the normal stress that arrives at the base of the gabion wall and the corresponding capacity of the ground. Moreover, regarding the seismic analysis, it has been studied the in-plane and out-of-plane behavior. The most critical aspect was discovered to be the out-of-plane behavior, for which have been developed models considering the “rigid- no tension model” for masonry, finding a kinematically admissible multiplier that will create a collapse mechanism for the structure. Furthermore, it has been performed a FEM and DEM models to find the maximum displacement at the center of the wall, maximum tension stresses needed for calculating the steel connectors for joining consecutive gabions and the dimensions (length of the wall and distance between orthogonal walls or buttresses) of a geometrical configuration for the standard modulus of the structure, in order to ensure an adequate safety margin for earthquakes with a PGA around 0.4-0.5g. Using the results obtained before, it has been created some rules of thumb, that have to be satisfy in order to ensure a good behavior of these structure.