l-stable Functions and Constrained Optimization

Иван Гинчев - Класът на ℓ-устойчивите в точка функции, дефиниран в [2] и разширяващ класа на C1,1 функциите, се обобщава от скаларни за векторни функции. Доказани са някои свойства на ℓ-устойчивите векторни функции. Показано е, че векторни оптимизационни задачи с ограничения допускат условия от втори ред изразени чрез посочни производни, което обобщава резултати от [2] и [5].

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.

Suppression of patterning effects in digital communications by an adaptive constrained coding

We quantify the error statistics and patterning effects in a 5x 40 Gbit/s WDM RZ-DBPSK SMF/DCF fibre link using hybrid Raman/EDFA amplification. We propose an adaptive constrained coding for the suppression of errors due to patterning effects. It is established, that this coding technique can greatly reduce the bit error rate (BER) value even for large BER (BER > 101). The proposed approach can be used in the combination with the forward error correction schemes (FEC) to correct the errors even when real channel BER is outside the FEC workspace.

Nonholonomically Constrained Dynamics and Optimization of Rolling Isolation Systems

Rolling Isolation Systems provide a simple and effective means for protecting components from horizontal floor vibrations. In these systems a platform rolls on four steel balls which, in turn, rest within shallow bowls. The trajectories of the balls is uniquely determined by the horizontal and rotational velocity components of the rolling platform, and thus provides nonholonomic constraints. In general, the bowls are not parabolic, so the potential energy function of this system is not quadratic. This thesis presents the application of Gauss's Principle of Least Constraint to the modeling of rolling isolation platforms. The equations of motion are described in terms of a redundant set of constrained coordinates. Coordinate accelerations are uniquely determined at any point in time via Gauss's Principle by solving a linearly constrained quadratic minimization. In the absence of any modeled damping, the equations of motion conserve energy. This mathematical model is then used to find the bowl profile that minimizes response acceleration subject to displacement constraint.

Inheritance of the CENP-A chromatin domain is spatially and temporally constrained at human centromeres.

BACKGROUND: Chromatin containing the histone variant CENP-A (CEN chromatin) exists as an essential domain at every centromere and heritably marks the location of kinetochore assembly. The size of the CEN chromatin domain on alpha satellite DNA in humans has been shown to vary according to underlying array size. However, the average amount of CENP-A reported at human centromeres is largely consistent, implying the genomic extent of CENP-A chromatin domains more likely reflects variations in the number of CENP-A subdomains and/or the density of CENP-A nucleosomes within individual subdomains. Defining the organizational and spatial properties of CEN chromatin would provide insight into centromere inheritance via CENP-A loading in G1 and the dynamics of its distribution between mother and daughter strands during replication. RESULTS: Using a multi-color protein strategy to detect distinct pools of CENP-A over several cell cycles, we show that nascent CENP-A is equally distributed to sister centromeres. CENP-A distribution is independent of previous or subsequent cell cycles in that centromeres showing disproportionately distributed CENP-A in one cycle can equally divide CENP-A nucleosomes in the next cycle. Furthermore, we show using extended chromatin fibers that maintenance of the CENP-A chromatin domain is achieved by a cycle-specific oscillating pattern of new CENP-A nucleosomes next to existing CENP-A nucleosomes over multiple cell cycles. Finally, we demonstrate that the size of the CENP-A domain does not change throughout the cell cycle and is spatially fixed to a similar location within a given alpha satellite DNA array. CONCLUSIONS: We demonstrate that most human chromosomes share similar patterns of CENP-A loading and distribution and that centromere inheritance is achieved through specific placement of new CENP-A near existing CENP-A as assembly occurs each cell cycle. The loading pattern fixes the location and size of the CENP-A domain on individual chromosomes. These results suggest that spatial and temporal dynamics of CENP-A are important for maintaining centromere identity and genome stability.

Future fish distributions constrained by depth in warming seas

European continental shelf seas have experienced intense warming over the past 30 years1. In the North Sea, fish have been comprehensively monitored throughout this period and resulting data provide a unique record of changes in distribution and abundance in response to climate change2, 3. We use these data to demonstrate the remarkable power of generalized additive models (GAMs), trained on data earlier in the time series, to reliably predict trends in distribution and abundance in later years. Then, challenging process-based models that predict substantial and ongoing poleward shifts of cold-water species4, 5, we find that GAMs coupled with climate projections predict future distributions of demersal (bottom-dwelling) fish species over the next 50 years will be strongly constrained by availability of habitat of suitable depth. This will lead to pronounced changes in community structure, species interactions and commercial fisheries, unless individual acclimation or population-level evolutionary adaptations enable fish to tolerate warmer conditions or move to previously uninhabitable locations.

Future fish distributions constrained by depth in warming seas

European continental shelf seas have experienced intense warming over the past 30 years1. In the North Sea, fish have been comprehensively monitored throughout this period and resulting data provide a unique record of changes in distribution and abundance in response to climate change2, 3. We use these data to demonstrate the remarkable power of generalized additive models (GAMs), trained on data earlier in the time series, to reliably predict trends in distribution and abundance in later years. Then, challenging process-based models that predict substantial and ongoing poleward shifts of cold-water species4, 5, we find that GAMs coupled with climate projections predict future distributions of demersal (bottom-dwelling) fish species over the next 50 years will be strongly constrained by availability of habitat of suitable depth. This will lead to pronounced changes in community structure, species interactions and commercial fisheries, unless individual acclimation or population-level evolutionary adaptations enable fish to tolerate warmer conditions or move to previously uninhabitable locations.

Energy efficiency optimization in hardware-constrained large-scale MIMO systems

Large-scale multiple-input multiple-output (MIMO) communication systems can bring substantial improvement in spectral efficiency and/or energy efficiency, due to the excessive degrees-of-freedom and huge array gain. However, large-scale MIMO is expected to deploy lower-cost radio frequency (RF) components, which are particularly prone to hardware impairments. Unfortunately, compensation schemes are not able to remove the impact of hardware impairments completely, such that a certain amount of residual impairments always exists. In this paper, we investigate the impact of residual transmit RF impairments (RTRI) on the spectral and energy efficiency of training-based point-to-point large-scale MIMO systems, and seek to determine the optimal training length and number of antennas which maximize the energy efficiency. We derive deterministic equivalents of the signal-to-noise-and-interference ratio (SINR) with zero-forcing (ZF) receivers, as well as the corresponding spectral and energy efficiency, which are shown to be accurate even for small number of antennas. Through an iterative sequential optimization, we find that the optimal training length of systems with RTRI can be smaller compared to ideal hardware systems in the moderate SNR regime, while larger in the high SNR regime. Moreover, it is observed that RTRI can significantly decrease the optimal number of transmit and receive antennas.

Fast iterative solvers for time-dependent PDE-constrained optimization problems

Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik, Kumulative Habilitation, 2016

Optimal Budget-Constrained Sample Allocation for Selection Decisions with Multiple Uncertain Attributes

A decision-maker, when faced with a limited and fixed budget to collect data in support of a multiple attribute selection decision, must decide how many samples to observe from each alternative and attribute. This allocation decision is of particular importance when the information gained leads to uncertain estimates of the attribute values as with sample data collected from observations such as measurements, experimental evaluations, or simulation runs. For example, when the U.S. Department of Homeland Security must decide upon a radiation detection system to acquire, a number of performance attributes are of interest and must be measured in order to characterize each of the considered systems. We identified and evaluated several approaches to incorporate the uncertainty in the attribute value estimates into a normative model for a multiple attribute selection decision. Assuming an additive multiple attribute value model, we demonstrated the idea of propagating the attribute value uncertainty and describing the decision values for each alternative as probability distributions. These distributions were used to select an alternative. With the goal of maximizing the probability of correct selection we developed and evaluated, under several different sets of assumptions, procedures to allocate the fixed experimental budget across the multiple attributes and alternatives. Through a series of simulation studies, we compared the performance of these allocation procedures to the simple, but common, allocation procedure that distributed the sample budget equally across the alternatives and attributes. We found the allocation procedures that were developed based on the inclusion of decision-maker knowledge, such as knowledge of the decision model, outperformed those that neglected such information. Beginning with general knowledge of the attribute values provided by Bayesian prior distributions, and updating this knowledge with each observed sample, the sequential allocation procedure performed particularly well. These observations demonstrate that managing projects focused on a selection decision so that the decision modeling and the experimental planning are done jointly, rather than in isolation, can improve the overall selection results.

Efficient Hill Climber for Constrained Pseudo-Boolean Optimization Problems

Efficient hill climbers have been recently proposed for single- and multi-objective pseudo-Boolean optimization problems. For $k$-bounded pseudo-Boolean functions where each variable appears in at most a constant number of subfunctions, it has been theoretically proven that the neighborhood of a solution can be explored in constant time. These hill climbers, combined with a high-level exploration strategy, have shown to improve state of the art methods in experimental studies and open the door to the so-called Gray Box Optimization, where part, but not all, of the details of the objective functions are used to better explore the search space. One important limitation of all the previous proposals is that they can only be applied to unconstrained pseudo-Boolean optimization problems. In this work, we address the constrained case for multi-objective $k$-bounded pseudo-Boolean optimization problems. We find that adding constraints to the pseudo-Boolean problem has a linear computational cost in the hill climber.