Max-Min SINR in Large-Scale Single-Cell MU-MIMO: Asymptotic Analysis and Low Complexity Transceivers

KAUST Repository

Sifaou, Houssem

2016-12-28

This work focuses on the downlink and uplink of large-scale single-cell MU-MIMO systems in which the base station (BS) endowed with M antennas communicates with K single-antenna user equipments (UEs). Particularly, we aim at reducing the complexity of the linear precoder and receiver that maximize the minimum signal-to-interference-plus-noise ratio subject to a given power constraint. To this end, we consider the asymptotic regime in which M and K grow large with a given ratio. Tools from random matrix theory (RMT) are then used to compute, in closed form, accurate approximations for the parameters of the optimal precoder and receiver, when imperfect channel state information (modeled by the generic Gauss-Markov formulation form) is available at the BS. The asymptotic analysis allows us to derive the asymptotically optimal linear precoder and receiver that are characterized by a lower complexity (due to the dependence on the large scale components of the channel) and, possibly, by a better resilience to imperfect channel state information. However, the implementation of both is still challenging as it requires fast inversions of large matrices in every coherence period. To overcome this issue, we apply the truncated polynomial expansion (TPE) technique to the precoding and receiving vector of each UE and make use of RMT to determine the optimal weighting coefficients on a per- UE basis that asymptotically solve the max-min SINR problem. Numerical results are used to validate the asymptotic analysis in the finite system regime and to show that the proposed TPE transceivers efficiently mimic the optimal ones, while requiring much lower computational complexity.

Cooperative AF Relaying in Spectrum-Sharing Systems: Performance Analysis under Average Interference Power Constraints and Nakagami-m Fading

KAUST Repository

Xia, Minghua; Aissa, Sonia

2012-01-01

the optimal end-to-end performance, the transmit powers of the secondary source and the relays are optimized with respect to average interference power constraints at primary users and Nakagami-$m$ fading parameters of interference channels (for mathematical

Precoding Design for Single-RF Massive MIMO Systems: A Large System Analysis

KAUST Repository

Sifaou, Houssem

2016-08-26

This work revisits a recently proposed precoding design for massive multiple-input multiple output (MIMO) systems that is based on the use of an instantaneous total power constraint. The main advantages of this technique lie in its suitability to the recently proposed single radio frequency (RF) MIMO transmitter coupled with a very-high power efficiency. Such features have been proven using simulations for uncorrelated channels. Based on tools from random matrix theory, we propose in this work to analyze the performance of this precoder for more involved channels accounting for spatial correlation. The obtained expressions are then optimized in order to maximize the signalto- interference-plus-noise ratio (SINR). Simulation results are provided in order to illustrate the performance of the optimized precoder in terms of peak-to-average power ratio (PAPR) and signal-to-interference-plus-noise ratio (SINR). © 2012 IEEE.

Cooperative AF Relaying in Spectrum-Sharing Systems: Performance Analysis under Average Interference Power Constraints and Nakagami-m Fading

KAUST Repository

Xia, Minghua

2012-06-01

Since the electromagnetic spectrum resource becomes more and more scarce, improving spectral efficiency is extremely important for the sustainable development of wireless communication systems and services. Integrating cooperative relaying techniques into spectrum-sharing cognitive radio systems sheds new light on higher spectral efficiency. In this paper, we analyze the end-to-end performance of cooperative amplify-and-forward (AF) relaying in spectrum-sharing systems. In order to achieve the optimal end-to-end performance, the transmit powers of the secondary source and the relays are optimized with respect to average interference power constraints at primary users and Nakagami-$m$ fading parameters of interference channels (for mathematical tractability, the desired channels from secondary source to relay and from relay to secondary destination are assumed to be subject to Rayleigh fading). Also, both partial and opportunistic relay-selection strategies are exploited to further enhance system performance. Based on the exact distribution functions of the end-to-end signal-to-noise ratio (SNR) obtained herein, the outage probability, average symbol error probability, diversity order, and ergodic capacity of the system under study are analytically investigated. Our results show that system performance is dominated by the resource constraints and it improves slowly with increasing average SNR. Furthermore, larger Nakagami-m fading parameter on interference channels deteriorates system performance slightly. On the other hand, when interference power constraints are stringent, opportunistic relay selection can be exploited to improve system performance significantly. All analytical results are corroborated by simulation results and they are shown to be efficient tools for exact evaluation of system performance.

Uplink transmit beamforming design for SINR maximization with full multiuser channel state information

Science.gov (United States)

Xi, Songnan; Zoltowski, Michael D.

2008-04-01

Multiuser multiple-input multiple-output (MIMO) systems are considered in this paper. We continue our research on uplink transmit beamforming design for multiple users under the assumption that the full multiuser channel state information, which is the collection of the channel state information between each of the users and the base station, is known not only to the receiver but also to all the transmitters. We propose an algorithm for designing optimal beamforming weights in terms of maximizing the signal-to-interference-plus-noise ratio (SINR). Through statistical modeling, we decouple the original mathematically intractable optimization problem and achieved a closed-form solution. As in our previous work, the minimum mean-squared error (MMSE) receiver with successive interference cancellation (SIC) is adopted for multiuser detection. The proposed scheme is compared with an existing jointly optimized transceiver design, referred to as the joint transceiver in this paper, and our previously proposed eigen-beamforming algorithm. Simulation results demonstrate that our algorithm, with much less computational burden, accomplishes almost the same performance as the joint transceiver for spatially independent MIMO channel and even better performance for spatially correlated MIMO channels. And it always works better than our previously proposed eigen beamforming algorithm.

All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables

DEFF Research Database (Denmark)

Gutin, Gregory; Van Iersel, Leo; Mnich, Matthias

2010-01-01

A ternary Permutation-CSP is specified by a subset Π of the symmetric group S3. An instance of such a problem consists of a set of variables V and a multiset of constraints, which are ordered triples of distinct variables of V. The objective is to find a linear ordering α of V that maximizes...... the number of triples whose rearrangement (under α) follows a permutation in Π. We prove that all ternary Permutation-CSPs parameterized above average have kernels with quadratic numbers of variables....

Near-optimal Downlink precoding of a MISO system for a secondary network under the SINR constraints of a primary network

KAUST Repository

Park, Kihong; Alouini, Mohamed-Slim

2013-01-01

-to-interference-plus-noise-ratio constraints on the primary network in order to guarantee the quality-of-service for the latter network. While the interference due to the secondary transmission in the conventional underlay CR approach may severely degrade the performance of the primary

Sistem national de management al resurselor digitale în stiinta si tehnologie, bazat pe structuri GRID - SINRED

CERN Document Server

Banciu, D

2007-01-01

Proiectului CEEX, SINRED ?i-a propus s? defineasc? ?i s? realizeze un sistem na?ional unitar de management al resurselor digitale în ?tiin?? ?i tehnologie bazat pe structuri GRID. Partenerii din consor?iu sunt: Universitatea din Bucure?ti; Universitatea Politehnica Bucure?ti; Universitatea Tehnic? din Cluj-Napoca; Institutul National de Informare ?i Documentar; Universitatea de Vest din Timi?oara. Problematica propus? spre rezolvare se circumscrie urm?toarelor obiective specifice: definirea ?i fundamentarea solu?iilor privind constituirea unei biblioteci digitale bazate pe re?eaua bibliotecilor universitare, publice ?i academic;definirea metodelor ?i metodologiilor de creare a unui sistem unitar la nivel na?ional în domeniul info-documentar bazat pe documente digital; analiza ?i testarea modalit??ilor de valorificare a tehnologiilor GRID în domeniul info-documentar;definirea unor proceduri de construire a bazelor de date digitale în acord cu normele ?i reglement?rile na?ionale ?i interna?ionale în domeni...

A virtual pebble game to ensemble average graph rigidity.

Science.gov (United States)

González, Luis C; Wang, Hui; Livesay, Dennis R; Jacobs, Donald J

2015-01-01

The body-bar Pebble Game (PG) algorithm is commonly used to calculate network rigidity properties in proteins and polymeric materials. To account for fluctuating interactions such as hydrogen bonds, an ensemble of constraint topologies are sampled, and average network properties are obtained by averaging PG characterizations. At a simpler level of sophistication, Maxwell constraint counting (MCC) provides a rigorous lower bound for the number of internal degrees of freedom (DOF) within a body-bar network, and it is commonly employed to test if a molecular structure is globally under-constrained or over-constrained. MCC is a mean field approximation (MFA) that ignores spatial fluctuations of distance constraints by replacing the actual molecular structure by an effective medium that has distance constraints globally distributed with perfect uniform density. The Virtual Pebble Game (VPG) algorithm is a MFA that retains spatial inhomogeneity in the density of constraints on all length scales. Network fluctuations due to distance constraints that may be present or absent based on binary random dynamic variables are suppressed by replacing all possible constraint topology realizations with the probabilities that distance constraints are present. The VPG algorithm is isomorphic to the PG algorithm, where integers for counting "pebbles" placed on vertices or edges in the PG map to real numbers representing the probability to find a pebble. In the VPG, edges are assigned pebble capacities, and pebble movements become a continuous flow of probability within the network. Comparisons between the VPG and average PG results over a test set of proteins and disordered lattices demonstrate the VPG quantitatively estimates the ensemble average PG results well. The VPG performs about 20% faster than one PG, and it provides a pragmatic alternative to averaging PG rigidity characteristics over an ensemble of constraint topologies. The utility of the VPG falls in between the most

Performance study and optimization of cooperative diversity networks with co-channel interference

KAUST Repository

Ikki, Salama Said

2014-01-01

In this paper, we investigate the effect of co-channel interference on the performance of cooperative diversity networks with amplify-and-forward (AF) relaying. We consider both conventional and opportunistic relaying. First, we obtain a tight upper-bound for the equivalent signal-to-interference-plus-noise ratio (SINR) at the destination. Subsequently, the cumulative distribution function (CDF), probability density function (PDF) and moment generating function (MGF) of the effective SINR are determined based on the upper-bound. Expressions for the error probabilities in both conventional and opportunistic relaying are derived utilizing the statistical characterization of the effective SINR. We also derive an approximate PDF of the equivalent instantaneous SINR at the destination. This leads to a simple and general asymptotic error probability expression which facilitates better insight into the effect of different system parameters on the error probability. Furthermore, we investigate the problem of optimum resource allocation in the network aiming at improving performance in the presence of resource constraints. We present numerical results that illustrate the excellent match between the analytical results and the simulation results, and the performance enhancement resulting from the proposed optimal resource allocation. © 2014 IEEE.

Near-optimal Downlink precoding of a MISO system for a secondary network under the SINR constraints of a primary network

KAUST Repository

Park, Kihong

2013-04-01

In this paper, we study a multiple-input single-output cognitive radio (CR) system where only the primary base station (BS) has multiple antennas. We consider a rate maximization problem of the secondary network under signal-to-interference-plus-noise-ratio constraints on the primary network in order to guarantee the quality-of-service for the latter network. While the interference due to the secondary transmission in the conventional underlay CR approach may severely degrade the performance of the primary network, we propose a primary BS-aided approach in which the primary BS helps relay the secondary users\\' signals instead of allowing them to communicate with each other via a direct path between them. In addition, an algorithm to find a near-optimal beamforming solution at the primary BS is proposed. Finally, based on some selected numerical results, we show that the proposed scheme outperforms the conventional underlay CR configuration over a wide transmit power range. © 2013 IEEE.

Short-sale Constraints and Credit Runs

DEFF Research Database (Denmark)

Venter, Gyuri

), creditors with high private signals are more lenient to roll over debt, and a bank with lower asset quality remains solvent. This leads to higher allocative efficiency in the real economy. My result thus implies that the decrease in average informativeness due to short-sale constraints can be more than......This paper studies how short-sale constraints affect the informational efficiency of market prices and the link between prices and economic activity. I show that under short-sale constraints security prices contain less information. However, short-sale constraints increase the informativeness...... the price of an asset the bank holds. I show that short-selling constraints in the financial market lead to the revival of self-fulfilling beliefs about the beliefs and actions of others, and create multiple equilibria. In the equilibrium where agents rely more on public information (i.e., the price...

Averaged null energy condition from causality

Science.gov (United States)

Hartman, Thomas; Kundu, Sandipan; Tajdini, Amirhossein

2017-07-01

Unitary, Lorentz-invariant quantum field theories in flat spacetime obey mi-crocausality: commutators vanish at spacelike separation. For interacting theories in more than two dimensions, we show that this implies that the averaged null energy, ∫ duT uu , must be non-negative. This non-local operator appears in the operator product expansion of local operators in the lightcone limit, and therefore contributes to n-point functions. We derive a sum rule that isolates this contribution and is manifestly positive. The argument also applies to certain higher spin operators other than the stress tensor, generating an infinite family of new constraints of the form ∫ duX uuu··· u ≥ 0. These lead to new inequalities for the coupling constants of spinning operators in conformal field theory, which include as special cases (but are generally stronger than) the existing constraints from the lightcone bootstrap, deep inelastic scattering, conformal collider methods, and relative entropy. We also comment on the relation to the recent derivation of the averaged null energy condition from relative entropy, and suggest a more general connection between causality and information-theoretic inequalities in QFT.

High-Average, High-Peak Current Injector Design

CERN Document Server

Biedron, S G; Virgo, M

2005-01-01

There is increasing interest in high-average-power (>100 kW), um-range FELs. These machines require high peak current (~1 kA), modest transverse emittance, and beam energies of ~100 MeV. High average currents (~1 A) place additional constraints on the design of the injector. We present a design for an injector intended to produce the required peak currents at the injector, eliminating the need for magnetic compression within the linac. This reduces the potential for beam quality degradation due to CSR and space charge effects within magnetic chicanes.

Radio resource allocation over fading channels under statistical delay constraints

CERN Document Server

Le-Ngoc, Tho

2017-01-01

This SpringerBrief presents radio resource allocation schemes for buffer-aided communications systems over fading channels under statistical delay constraints in terms of upper-bounded average delay or delay-outage probability. This Brief starts by considering a source-destination communications link with data arriving at the source transmission buffer. The first scenario, the joint optimal data admission control and power allocation problem for throughput maximization is considered, where the source is assumed to have a maximum power and an average delay constraints. The second scenario, optimal power allocation problems for energy harvesting (EH) communications systems under average delay or delay-outage constraints are explored, where the EH source harvests random amounts of energy from renewable energy sources, and stores the harvested energy in a battery during data transmission. Online resource allocation algorithms are developed when the statistical knowledge of the random channel fading, data arrivals...

Linear-constraint wavefront control for exoplanet coronagraphic imaging systems

Science.gov (United States)

Sun, He; Eldorado Riggs, A. J.; Kasdin, N. Jeremy; Vanderbei, Robert J.; Groff, Tyler Dean

2017-01-01

A coronagraph is a leading technology for achieving high-contrast imaging of exoplanets in a space telescope. It uses a system of several masks to modify the diffraction and achieve extremely high contrast in the image plane around target stars. However, coronagraphic imaging systems are very sensitive to optical aberrations, so wavefront correction using deformable mirrors (DMs) is necessary to avoid contrast degradation in the image plane. Electric field conjugation (EFC) and Stroke minimization (SM) are two primary high-contrast wavefront controllers explored in the past decade. EFC minimizes the average contrast in the search areas while regularizing the strength of the control inputs. Stroke minimization calculates the minimum DM commands under the constraint that a target average contrast is achieved. Recently in the High Contrast Imaging Lab at Princeton University (HCIL), a new linear-constraint wavefront controller based on stroke minimization was developed and demonstrated using numerical simulation. Instead of only constraining the average contrast over the entire search area, the new controller constrains the electric field of each single pixel using linear programming, which could led to significant increases in speed of the wavefront correction and also create more uniform dark holes. As a follow-up of this work, another linear-constraint controller modified from EFC is demonstrated theoretically and numerically and the lab verification of the linear-constraint controllers is reported. Based on the simulation and lab results, the pros and cons of linear-constraint controllers are carefully compared with EFC and stroke minimization.

Low Complexity Precoder and Receiver Design for Massive MIMO Systems: A Large System Analysis using Random Matrix Theory

KAUST Repository

Sifaou, Houssem

2016-05-01

Massive MIMO systems are shown to be a promising technology for next generations of wireless communication networks. The realization of the attractive merits promised by massive MIMO systems requires advanced linear precoding and receiving techniques in order to mitigate the interference in downlink and uplink transmissions. This work considers the precoder and receiver design in massive MIMO systems. We first consider the design of the linear precoder and receiver that maximize the minimum signal-to-interference-plus-noise ratio (SINR) subject to a given power constraint. The analysis is carried out under the asymptotic regime in which the number of the BS antennas and that of the users grow large with a bounded ratio. This allows us to leverage tools from random matrix theory in order to approximate the parameters of the optimal linear precoder and receiver by their deterministic approximations. Such a result is of valuable practical interest, as it provides a handier way to implement the optimal precoder and receiver. To reduce further the complexity, we propose to apply the truncated polynomial expansion (TPE) concept on a per-user basis to approximate the inverse of large matrices that appear on the expressions of the optimal linear transceivers. Using tools from random matrix theory, we determine deterministic approximations of the SINR and the transmit power in the asymptotic regime. Then, the optimal per-user weight coe cients that solve the max-min SINR problem are derived. The simulation results show that the proposed precoder and receiver provide very close to optimal performance while reducing signi cantly the computational complexity. As a second part of this work, the TPE technique in a per-user basis is applied to the optimal linear precoding that minimizes the transmit power while satisfying a set of target SINR constraints. Due to the emerging research eld of green cellular networks, such a problem is receiving increasing interest nowadays. Closed

Performance Evaluation of Received Signal Strength Based Hard Handover for UTRAN LTE

DEFF Research Database (Denmark)

Anas, Mohmmad; Calabrese, Francesco Davide; Mogensen, Preben

2007-01-01

This paper evaluates the hard handover performance for UTRAN LTE system. The focus is on the impact that received signal strength based hard handover algorithm have on the system performance measured in terms of number of handovers, time between two consecutive handovers and uplink SINR for a user...... about to experience a handover. A handover algorithm based on received signal strength measurements has been designed and implemented in a dynamic system level simulator and has been studied for different parameter sets in a 3GPP UTRAN LTE recommended simulation scenario. The results suggest...... that a downlink measurement bandwidth of 1.25 MHz and a handover margin of 2 dB to 6 dB are the parameters that will lead to the best compromise between average number of handovers and average uplink SINR for user speeds of 3 kmph to 120 kmph....

Selection of new constraints

International Nuclear Information System (INIS)

Sugier, A.

2003-01-01

The selected new constraints should be consistent with the scale of concern i.e. be expressed roughly as fractions or multiples of the average annual background. They should take into account risk considerations and include the values of the currents limits, constraints and other action levels. The recommendation is to select four leading values for the new constraints: 500 mSv ( single event or in a decade) as a maximum value, 0.01 mSv/year as a minimum value; and two intermediate values: 20 mSv/year and 0.3 mSv/year. This new set of dose constraints, representing basic minimum standards of protection for the individuals taking into account the specificity of the exposure situations are thus coherent with the current values which can be found in ICRP Publications. A few warning need however to be noticed: There is no more multi sources limit set by ICRP. The coherence between the proposed value of dose constraint (20 mSv/year) and the current occupational dose limit of 20 mSv/year is valid only if the workers are exposed to one single source. When there is more than one source, it will be necessary to apportion. The value of 1000 mSv lifetimes used for relocation can be expressed into annual dose, which gives approximately 10 mSv/year and is coherent with the proposed dose constraint. (N.C.)

Performance Prediction of Constrained Waveform Design for Adaptive Radar

Science.gov (United States)

2016-11-01

the famous Woodward quote, having a ubiquitous feeling for all radar waveform design (and performance prediction) researchers , that is found at the end...discuss research that develops performance prediction models to quantify the impact on SINR when an amplitude constraint is placed on a radar waveform...optimize the radar perfor- mance for the particular scenario and tasks. There have also been several survey papers on various topics in waveform design for

Exploring JLA supernova data with improved flux-averaging technique

Energy Technology Data Exchange (ETDEWEB)

Wang, Shuang; Wen, Sixiang; Li, Miao, E-mail: wangshuang@mail.sysu.edu.cn, E-mail: wensx@mail2.sysu.edu.cn, E-mail: limiao9@mail.sysu.edu.cn [School of Physics and Astronomy, Sun Yat-Sen University, University Road (No. 2), Zhuhai (China)

2017-03-01

In this work, we explore the cosmological consequences of the ''Joint Light-curve Analysis'' (JLA) supernova (SN) data by using an improved flux-averaging (FA) technique, in which only the type Ia supernovae (SNe Ia) at high redshift are flux-averaged. Adopting the criterion of figure of Merit (FoM) and considering six dark energy (DE) parameterizations, we search the best FA recipe that gives the tightest DE constraints in the ( z {sub cut}, Δ z ) plane, where z {sub cut} and Δ z are redshift cut-off and redshift interval of FA, respectively. Then, based on the best FA recipe obtained, we discuss the impacts of varying z {sub cut} and varying Δ z , revisit the evolution of SN color luminosity parameter β, and study the effects of adopting different FA recipe on parameter estimation. We find that: (1) The best FA recipe is ( z {sub cut} = 0.6, Δ z =0.06), which is insensitive to a specific DE parameterization. (2) Flux-averaging JLA samples at z {sub cut} ≥ 0.4 will yield tighter DE constraints than the case without using FA. (3) Using FA can significantly reduce the redshift-evolution of β. (4) The best FA recipe favors a larger fractional matter density Ω {sub m} . In summary, we present an alternative method of dealing with JLA data, which can reduce the systematic uncertainties of SNe Ia and give the tighter DE constraints at the same time. Our method will be useful in the use of SNe Ia data for precision cosmology.

Transport characteristics of a silicene nanoribbon on Ag(110

Directory of Open Access Journals (Sweden)

Ryoichi Hiraoka

2017-08-01

Full Text Available We present the transport characteristics of individual silicene nanoribbons (SiNRs grown on Ag(110. By lifting up a single SiNR with a low-temperature scanning tunneling microscope tip, a nanojunction consisting of tip, SiNR and Ag is fabricated. In the differential conductance spectra of the nanojunctions fabricated by this methodology, a peak appears at the Fermi level which is not observed in the spectra measured either for the SiNRs before being lifted up or the clean Ag substrate. We discuss the origin of the peak as it relates to the SiNR.

Constraints on cosmological parameters in power-law cosmology

International Nuclear Information System (INIS)

Rani, Sarita; Singh, J.K.; Altaibayeva, A.; Myrzakulov, R.; Shahalam, M.

2015-01-01

In this paper, we examine observational constraints on the power law cosmology; essentially dependent on two parameters H 0 (Hubble constant) and q (deceleration parameter). We investigate the constraints on these parameters using the latest 28 points of H(z) data and 580 points of Union2.1 compilation data and, compare the results with the results of ΛCDM . We also forecast constraints using a simulated data set for the future JDEM, supernovae survey. Our studies give better insight into power law cosmology than the earlier done analysis by Kumar [arXiv:1109.6924] indicating it tuning well with Union2.1 compilation data but not with H(z) data. However, the constraints obtained on and i.e. H 0 average and q average using the simulated data set for the future JDEM, supernovae survey are found to be inconsistent with the values obtained from the H(z) and Union2.1 compilation data. We also perform the statefinder analysis and find that the power-law cosmological models approach the standard ΛCDM model as q → −1. Finally, we observe that although the power law cosmology explains several prominent features of evolution of the Universe, it fails in details

Quaternary re-arrangement analysed by spectral enhancement: the interaction of a sporulation repressor with its antagonist.

Science.gov (United States)

Scott, D J; Leejeerajumnean, S; Brannigan, J A; Lewis, R J; Wilkinson, A J; Hoggett, J G

1999-11-12

The protein/protein interaction between SinI and SinR has been studied by analytical ultracentrifugation and gel electrophoresis in an attempt to understand how these proteins contribute to developmental control of sporulation in Bacillus subtilis. SinR was found to be tetrameric, while SinI was found to exist as monomers and dimers in a rapidly reversible equilibrium. Labelling of SinR by incorporating the tryptophan analogue 7-azatryptophan (7AW) into the protein in place of tryptophan shifts the UV absorbance spectrum, thus allowing selective monitoring of 7AWSinR at 315 nm using the UV absorption optics of the analytical ultracentrifuge. Selective monitoring of SinR in mixtures of SinR and SinI enables the binding and stoichiometry of the interaction to be investigated quantitatively and unambiguously. We demonstrate that the oligomeric forms of SinR and SinI re-arrange to form a tight 1:1 SinR:SinI complex, with no stable intermediate species. A fragment of SinR, SinR(1-69), which contains only the DNA-binding domain, was found to be monomeric, showing that the protein appears not to oligomerise in a similar manner to the Cro repressor, a protein with which it shares a marked structural similarity. Copyright 1999 Academic Press.

Asynchronous Gossip for Averaging and Spectral Ranking

Science.gov (United States)

Borkar, Vivek S.; Makhijani, Rahul; Sundaresan, Rajesh

2014-08-01

We consider two variants of the classical gossip algorithm. The first variant is a version of asynchronous stochastic approximation. We highlight a fundamental difficulty associated with the classical asynchronous gossip scheme, viz., that it may not converge to a desired average, and suggest an alternative scheme based on reinforcement learning that has guaranteed convergence to the desired average. We then discuss a potential application to a wireless network setting with simultaneous link activation constraints. The second variant is a gossip algorithm for distributed computation of the Perron-Frobenius eigenvector of a nonnegative matrix. While the first variant draws upon a reinforcement learning algorithm for an average cost controlled Markov decision problem, the second variant draws upon a reinforcement learning algorithm for risk-sensitive control. We then discuss potential applications of the second variant to ranking schemes, reputation networks, and principal component analysis.

Hamiltonian constraint in polymer parametrized field theory

International Nuclear Information System (INIS)

Laddha, Alok; Varadarajan, Madhavan

2011-01-01

Recently, a generally covariant reformulation of two-dimensional flat spacetime free scalar field theory known as parametrized field theory was quantized using loop quantum gravity (LQG) type ''polymer'' representations. Physical states were constructed, without intermediate regularization structures, by averaging over the group of gauge transformations generated by the constraints, the constraint algebra being a Lie algebra. We consider classically equivalent combinations of these constraints corresponding to a diffeomorphism and a Hamiltonian constraint, which, as in gravity, define a Dirac algebra. Our treatment of the quantum constraints parallels that of LQG and obtains the following results, expected to be of use in the construction of the quantum dynamics of LQG: (i) the (triangulated) Hamiltonian constraint acts only on vertices, its construction involves some of the same ambiguities as in LQG and its action on diffeomorphism invariant states admits a continuum limit, (ii) if the regulating holonomies are in representations tailored to the edge labels of the state, all previously obtained physical states lie in the kernel of the Hamiltonian constraint, (iii) the commutator of two (density weight 1) Hamiltonian constraints as well as the operator correspondent of their classical Poisson bracket converge to zero in the continuum limit defined by diffeomorphism invariant states, and vanish on the Lewandowski-Marolf habitat, (iv) the rescaled density 2 Hamiltonian constraints and their commutator are ill-defined on the Lewandowski-Marolf habitat despite the well-definedness of the operator correspondent of their classical Poisson bracket there, (v) there is a new habitat which supports a nontrivial representation of the Poisson-Lie algebra of density 2 constraints.

Impact of Co-Channel Interference on the Outage Performance Under Multiple Type II Relay Environments

KAUST Repository

Choi, Seyeong; Alouini, Mohamed-Slim; Nam, Sung Sik

2017-01-01

In this paper, through an exact analysis of the outage probability, we investigate the impact of co-channel interference (CCI) on the outage performance of type II (or user equipment) relay under multiple-relay environments considering the selection combining-based relay selection scheme with the decode-and-forward protocol. We consider the signal to interference plus noise ratio (SINR) over both independent and identically distributed and independent but non-identically distributed fading channels. To fully take into account the effect of CCI, we adopt a more practical parameter such as the CCI coefficient. The major difficulty in the analysis resides in the determination of the statistics of the output SINR. To settle this problem, we first present the general but relatively simplified expressions for the statistics and then the related outage probability in closed-form. Furthermore, to consider more practical scenario, based on the fact that the number of participating relays can be random, we investigate the average outage probability by averaging the number of participating relays.

Impact of Co-Channel Interference on the Outage Performance Under Multiple Type II Relay Environments

KAUST Repository

Choi, Seyeong

2017-11-15

In this paper, through an exact analysis of the outage probability, we investigate the impact of co-channel interference (CCI) on the outage performance of type II (or user equipment) relay under multiple-relay environments considering the selection combining-based relay selection scheme with the decode-and-forward protocol. We consider the signal to interference plus noise ratio (SINR) over both independent and identically distributed and independent but non-identically distributed fading channels. To fully take into account the effect of CCI, we adopt a more practical parameter such as the CCI coefficient. The major difficulty in the analysis resides in the determination of the statistics of the output SINR. To settle this problem, we first present the general but relatively simplified expressions for the statistics and then the related outage probability in closed-form. Furthermore, to consider more practical scenario, based on the fact that the number of participating relays can be random, we investigate the average outage probability by averaging the number of participating relays.

Pleiotropic roles of Clostridium difficile sin locus

Science.gov (United States)

Ou, Junjun; Dupuy, Bruno

2018-01-01

Clostridium difficile is the primary cause of nosocomial diarrhea and pseudomembranous colitis. It produces dormant spores, which serve as an infectious vehicle responsible for transmission of the disease and persistence of the organism in the environment. In Bacillus subtilis, the sin locus coding SinR (113 aa) and SinI (57 aa) is responsible for sporulation inhibition. In B. subtilis, SinR mainly acts as a repressor of its target genes to control sporulation, biofilm formation, and autolysis. SinI is an inhibitor of SinR, so their interaction determines whether SinR can inhibit its target gene expression. The C. difficile genome carries two sinR homologs in the operon that we named sinR and sinR’, coding for SinR (112 aa) and SinR’ (105 aa), respectively. In this study, we constructed and characterized sin locus mutants in two different C. difficile strains R20291 and JIR8094, to decipher the locus’s role in C. difficile physiology. Transcriptome analysis of the sinRR’ mutants revealed their pleiotropic roles in controlling several pathways including sporulation, toxin production, and motility in C. difficile. Through various genetic and biochemical experiments, we have shown that SinR can regulate transcription of key regulators in these pathways, which includes sigD, spo0A, and codY. We have found that SinR’ acts as an antagonist to SinR by blocking its repressor activity. Using a hamster model, we have also demonstrated that the sin locus is needed for successful C. difficile infection. This study reveals the sin locus as a central link that connects the gene regulatory networks of sporulation, toxin production, and motility; three key pathways that are important for C. difficile pathogenesis. PMID:29529083

The effects of average revenue regulation on electricity transmission investment and pricing

International Nuclear Information System (INIS)

Matsukawa, Isamu

2008-01-01

This paper investigates the long-run effects of average revenue regulation on an electricity transmission monopolist who applies a two-part tariff comprising a variable congestion price and a non-negative fixed access fee. A binding constraint on the monopolist's expected average revenue lowers the access fee, promotes transmission investment, and improves consumer surplus. In a case of any linear or log-linear electricity demand function with a positive probability that no congestion occurs, average revenue regulation is allocatively more efficient than a Coasian two-part tariff if the level of capacity under average revenue regulation is higher than that under a Coasian two-part tariff. (author)

Power efficient low complexity precoding for massive MIMO systems

KAUST Repository

Sifaou, Houssem

2014-12-01

This work aims at designing a low-complexity precoding technique in the downlink of a large-scale multiple-input multiple-output (MIMO) system in which the base station (BS) is equipped with M antennas to serve K single-antenna user equipments. This is motivated by the high computational complexity required by the widely used zero-forcing or regularized zero-forcing precoding techniques, especially when K grows large. To reduce the computational burden, we adopt a precoding technique based on truncated polynomial expansion (TPE) and make use of the asymptotic analysis to compute the deterministic equivalents of its corresponding signal-to-interference-plus-noise ratios (SINRs) and transmit power. The asymptotic analysis is conducted in the regime in which M and K tend to infinity with the same pace under the assumption that imperfect channel state information is available at the BS. The results are then used to compute the TPE weights that minimize the asymptotic transmit power while meeting a set of target SINR constraints. Numerical simulations are used to validate the theoretical analysis. © 2014 IEEE.

The Effects of Average Revenue Regulation on Electricity Transmission Investment and Pricing

OpenAIRE

Isamu Matsukawa

2005-01-01

This paper investigates the long-run effects of average revenue regulation on an electricity transmission monopolist who applies a two- part tariff comprising a variable congestion price and a non-negative fixed access fee. A binding constraint on the monopolist fs expected average revenue lowers the access fee, promotes transmission investment, and improves consumer surplus. In a case of any linear or log-linear electricity demand function with a positive probability that no congestion occur...

Design constraints for electron-positron linear colliders

International Nuclear Information System (INIS)

Mondelli, A.; Chernin, D.

1991-01-01

A prescription for examining the design constraints in the e + -e - linear collider is presented. By specifying limits on certain key quantities, an allowed region of parameter space can be presented, hopefully clarifying some of the design options. The model starts with the parameters at the interaction point (IP), where the expressions for the luminosity, the disruption parameter, beamstrahlung, and average beam power constitute four relations among eleven IP parameters. By specifying the values of five of these quantities, and using these relationships, the unknown parameter space can be reduced to a two-dimensional space. Curves of constraint can be plotted in this space to define an allowed operating region. An accelerator model, based on a modified, scaled SLAC structure, can then be used to derive the corresponding parameter space including the constraints derived from power consumption and wake field effects. The results show that longer, lower gradient accelerators are advantageous

Secret-Key Agreement with Public Discussion subject to an Amplitude Constraint

KAUST Repository

Zorgui, Marwen

2016-04-06

This paper considers the problem of secret-key agreement with public discussion subject to a peak power constraint A on the channel input. The optimal input distribution is proved to be discrete with finite support. To overcome the computationally heavy search for the optimal discrete distribution, several suboptimal schemes are proposed and shown numerically to perform close to the capacity. Moreover, lower and upper bounds for the secret-key capacity are provided and used to prove that the secret-key capacity converges for asymptotic high values of A, to the secret-key capacity with an average power constraint A2. Finally, when the amplitude constraint A is small (A ! 0), the secret-key capacity is proved to be asymptotically equal to the capacity of the legitimate user with an amplitude constraint A and no secrecy constraint.

Secret-Key Agreement with Public Discussion subject to an Amplitude Constraint

KAUST Repository

Zorgui, Marwen; Rezki, Zouheir; Alomair, Basel; Alouini, Mohamed-Slim

2016-01-01

This paper considers the problem of secret-key agreement with public discussion subject to a peak power constraint A on the channel input. The optimal input distribution is proved to be discrete with finite support. To overcome the computationally heavy search for the optimal discrete distribution, several suboptimal schemes are proposed and shown numerically to perform close to the capacity. Moreover, lower and upper bounds for the secret-key capacity are provided and used to prove that the secret-key capacity converges for asymptotic high values of A, to the secret-key capacity with an average power constraint A2. Finally, when the amplitude constraint A is small (A ! 0), the secret-key capacity is proved to be asymptotically equal to the capacity of the legitimate user with an amplitude constraint A and no secrecy constraint.

PAPR-Constrained Pareto-Optimal Waveform Design for OFDM-STAP Radar

Energy Technology Data Exchange (ETDEWEB)

Sen, Satyabrata [ORNL

2014-01-01

We propose a peak-to-average power ratio (PAPR) constrained Pareto-optimal waveform design approach for an orthogonal frequency division multiplexing (OFDM) radar signal to detect a target using the space-time adaptive processing (STAP) technique. The use of an OFDM signal does not only increase the frequency diversity of our system, but also enables us to adaptively design the OFDM coefficients in order to further improve the system performance. First, we develop a parametric OFDM-STAP measurement model by considering the effects of signaldependent clutter and colored noise. Then, we observe that the resulting STAP-performance can be improved by maximizing the output signal-to-interference-plus-noise ratio (SINR) with respect to the signal parameters. However, in practical scenarios, the computation of output SINR depends on the estimated values of the spatial and temporal frequencies and target scattering responses. Therefore, we formulate a PAPR-constrained multi-objective optimization (MOO) problem to design the OFDM spectral parameters by simultaneously optimizing four objective functions: maximizing the output SINR, minimizing two separate Cramer-Rao bounds (CRBs) on the normalized spatial and temporal frequencies, and minimizing the trace of CRB matrix on the target scattering coefficients estimations. We present several numerical examples to demonstrate the achieved performance improvement due to the adaptive waveform design.

Constraint Differentiation

DEFF Research Database (Denmark)

Mödersheim, Sebastian Alexander; Basin, David; Viganò, Luca

2010-01-01

We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation works by eliminating certain kinds of redundancies that arise in the search space when using constraints to represent...... results show that constraint differentiation substantially reduces search and considerably improves the performance of OFMC, enabling its application to a wider class of problems....

Power Minimization of a Wireless Sensor Node under Different Rate Constraints

KAUST Repository

Solares, Jose

2016-03-31

Future wireless networks are expected to handle a huge number of devices, including sensors, within a low energy consumption. In this scope, we present, in this paper, performance of wireless sensor networks (WSN). Specifically, we aim at finding the optimal transmit power of a node communicating with multiple receivers in a cognitive radio (CR) spectrum sharing framework, i.e., existence of an active primary user. We first present the optimal power with single secondary receiver, under instantaneous or average transmission rate constraints. Then, we propose a suboptimal solution for an easier, yet efficient, implementation and perform insightful asymptotical analysis for both schemes with Rayleigh fading. Afterwards, we extend our results to a multiple secondary receives CR scenario and present the corresponding optimal and suboptimal transmit power while satisfying independent peak/average and sum of peak/average transmission rate constraints. The corresponding numerical results are provided for Rayleigh and Nakagami-m fading channels. We characterize some transmission outage events depending on system parameters.

Power Minimization of a Wireless Sensor Node under Different Rate Constraints

KAUST Repository

Solares, Jose; Sboui, Lokman; Rezki, Zouheir; Alouini, Mohamed-Slim

2016-01-01

Future wireless networks are expected to handle a huge number of devices, including sensors, within a low energy consumption. In this scope, we present, in this paper, performance of wireless sensor networks (WSN). Specifically, we aim at finding the optimal transmit power of a node communicating with multiple receivers in a cognitive radio (CR) spectrum sharing framework, i.e., existence of an active primary user. We first present the optimal power with single secondary receiver, under instantaneous or average transmission rate constraints. Then, we propose a suboptimal solution for an easier, yet efficient, implementation and perform insightful asymptotical analysis for both schemes with Rayleigh fading. Afterwards, we extend our results to a multiple secondary receives CR scenario and present the corresponding optimal and suboptimal transmit power while satisfying independent peak/average and sum of peak/average transmission rate constraints. The corresponding numerical results are provided for Rayleigh and Nakagami-m fading channels. We characterize some transmission outage events depending on system parameters.

Comparative structural and electronic studies of hydrogen interaction with isolated versus ordered silicon nanoribbons grown on Ag(110)

International Nuclear Information System (INIS)

Dávila, M E; Montero, I; Marele, A; Gómez-Rodríguez, J M; De Padova, P; Hennies, F; Pietzsch, A; Shariati, M N; Le Lay, G

2012-01-01

We have investigated the geometry and electronic structure of two different types of self-aligned silicon nanoribbons (SiNRs), forming either isolated SiNRs or a self-assembled 5 × 2/5 × 4 grating on an Ag(110) substrate, by scanning tunnelling microscopy and high resolution x-ray photoelectron spectroscopy. At room temperature we further adsorb on these SiNRs either atomic or molecular hydrogen. The hydrogen absorption process and hydrogenation mechanism are similar for isolated or 5 × 2/5 × 4 ordered SiNRs and are not site selective; the main difference arises from the fact that the isolated SiNRs are more easily attacked and destroyed faster. In fact, atomic hydrogen strongly interacts with any Si atoms, modifying their structural and electronic properties, while molecular hydrogen has first to dissociate. Hydrogen finally etches the Si nanoribbons and their complete removal from the Ag(110) surface could eventually be expected. (paper)

Two-agent scheduling in open shops subject to machine availability and eligibility constraints

Directory of Open Access Journals (Sweden)

Ling-Huey Su

2015-09-01

Full Text Available Purpose: The aims of this article are to develop a new mathematical formulation and a new heuristic for the problem of preemptive two-agent scheduling in open shops subject to machine maintenance and eligibility constraints. Design/methodology: Using the ideas of minimum cost flow network and constraint programming, a heuristic and a network based linear programming are proposed to solve the problem. Findings: Computational experiments show that the heuristic generates a good quality schedule with a deviation of 0.25% on average from the optimum and the network based linear programming model can solve problems up to 110 jobs combined with 10 machines without considering the constraint that each operation can be processed on at most one machine at a time. In order to satisfy this constraint, a time consuming Constraint Programming is proposed. For n = 80 and m = 10, the average execution time for the combined models (linear programming model combined with Constraint programming exceeds two hours. Therefore, the heuristic algorithm we developed is very efficient and is in need. Practical implications: Its practical implication occurs in TFT-LCD and E-paper manufacturing wherein units go through a series of diagnostic tests that do not have to be performed in any specified order. Originality/value: The main contribution of the article is to split the time horizon into many time intervals and use the dispatching rule for each time interval in the heuristic algorithm, and also to combine the minimum cost flow network with the Constraint Programming to solve the problem optimally. 

Constraint-based scheduling applying constraint programming to scheduling problems

CERN Document Server

Baptiste, Philippe; Nuijten, Wim

2001-01-01

Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsibl...

Perceived Average Orientation Reflects Effective Gist of the Surface.

Science.gov (United States)

Cha, Oakyoon; Chong, Sang Chul

2018-03-01

The human ability to represent ensemble visual information, such as average orientation and size, has been suggested as the foundation of gist perception. To effectively summarize different groups of objects into the gist of a scene, observers should form ensembles separately for different groups, even when objects have similar visual features across groups. We hypothesized that the visual system utilizes perceptual groups characterized by spatial configuration and represents separate ensembles for different groups. Therefore, participants could not integrate ensembles of different perceptual groups on a task basis. We asked participants to determine the average orientation of visual elements comprising a surface with a contour situated inside. Although participants were asked to estimate the average orientation of all the elements, they ignored orientation signals embedded in the contour. This constraint may help the visual system to keep the visual features of occluding objects separate from those of the occluded objects.

A Survey of Myanmar Rice Production and Constraints

Directory of Open Access Journals (Sweden)

T.A.A. Naing

2008-10-01

Full Text Available Although modern high yielding varieties were introduced into Myanmar in the early 1980s, the national average of rice grain yield has stagnated at 3.2-3.4 t ha-1. To identify yield constraints, input intensities and the general practices of rice cultivation in Myanmar, a survey was conducted during the wet seasons of 2001 and 2002. A total of 98 farmers from five townships in Upper Myanmar and 16 in Lower Myanmar representing the most important areas of rice production were questioned on their management practices, yields, and perceived yield constraints over the previous four years. There was a recent decrease in the overall average rate of fertilizer application, an increase in the prevalence of rice-legume cropping systems, and only localized insect pest or disease problems. Additionally, rice yields were found to be higher in Upper Myanmar, likely the results of more suitable weather conditions, better irrigation, and ready market access. Furthermore, a number of critical factors affecting production are identified and possible solutions discussed.

Receive antenna selection for underlay cognitive radio with instantaneous interference constraint

KAUST Repository

Hanif, Muhammad Fainan; Yang, Hongchuan; Alouini, Mohamed-Slim

2015-01-01

. These results are then applied to the outage and average bit error rate analysis when the secondary transmitter changes the transmit power in finite discrete levels to satisfy the instantaneous interference constraint at the primary receiver.

Estimating Crustal Properties Directly from Satellite Tracking Data by Using a Topography-based Constraint

Science.gov (United States)

Goossens, S. J.; Sabaka, T. J.; Genova, A.; Mazarico, E. M.; Nicholas, J. B.; Neumann, G. A.; Lemoine, F. G.

2017-12-01

The crust of a terrestrial planet is formed by differentiation processes in its early history, followed by magmatic evolution of the planetary surface. It is further modified through impact processes. Knowledge of the crustal structure can thus place constraints on the planet's formation and evolution. In particular, the average bulk density of the crust is a fundamental parameter in geophysical studies, such as the determination of crustal thickness, studies of the mechanisms of topography support, and the planet's thermo-chemical evolution. Yet even with in-situ samples available, the crustal density is difficult to determine unambiguously, as exemplified by the results for the Gravity and Recovery Interior Laboratory (GRAIL) mission, which found an average crustal density for the Moon that was lower than generally assumed. The GRAIL results were possible owing to the combination of its high-resolution gravity and high-resolution topography obtained by the Lunar Orbiter Laser Altimeter (LOLA) onboard the Lunar Reconnaissance Orbiter (LRO), and high correlations between the two datasets. The crustal density can be determined by its contribution to the gravity field of a planet, but at long wavelengths flexure effects can dominate. On the other hand, short-wavelength gravity anomalies are difficult to measure, and either not determined well enough (other than at the Moon), or their power is suppressed by the standard `Kaula' regularization constraint applied during inversion of the gravity field from satellite tracking data. We introduce a new constraint that has infinite variance in one direction, called xa . For constraint damping factors that go to infinity, it can be shown that the solution x becomes equal to a scale factor times xa. This scale factor is completely determined by the data, and we call our constraint rank-minus-1 (RM1). If we choose xa to be topography-induced gravity, then we can estimate the average bulk crustal density directly from the data

Interference-aware random beam selection schemes for spectrum sharing systems

KAUST Repository

Abdallah, Mohamed

2012-10-19

Spectrum sharing systems have been recently introduced to alleviate the problem of spectrum scarcity by allowing secondary unlicensed networks to share the spectrum with primary licensed networks under acceptable interference levels to the primary users. In this work, we develop interference-aware random beam selection schemes that provide enhanced performance for the secondary network under the condition that the interference observed by the receivers of the primary network is below a predetermined/acceptable value. We consider a secondary link composed of a transmitter equipped with multiple antennas and a single-antenna receiver sharing the same spectrum with a primary link composed of a single-antenna transmitter and a single-antenna receiver. The proposed schemes select a beam, among a set of power-optimized random beams, that maximizes the signal-to-interference-plus-noise ratio (SINR) of the secondary link while satisfying the primary interference constraint for different levels of feedback information describing the interference level at the primary receiver. For the proposed schemes, we develop a statistical analysis for the SINR statistics as well as the capacity and bit error rate (BER) of the secondary link.

Averaged null energy condition and difference inequalities in quantum field theory

International Nuclear Information System (INIS)

Yurtsever, U.

1995-01-01

For a large class of quantum states, all local (pointwise) energy conditions widely used in relativity are violated by the renormalized stress-energy tensor of a quantum field. In contrast, certain nonlocal positivity constraints on the quantum stress-energy tensor might hold quite generally, and this possibility has received considerable attention in recent years. In particular, it is now known that the averaged null energy condition, the condition that the null-null component of the stress-energy tensor integrated along a complete null geodesic is non-negative for all states, holds quite generally in a wide class of spacetimes for a minimally coupled scalar field. Apart from the specific class of spacetimes considered (mainly two-dimensional spacetimes and four-dimensional Minkowski space), the most significant restriction on this result is that the null geodesic over which the average is taken must be achronal. Recently, Ford and Roman have explored this restriction in two-dimensional flat spacetime, and discovered that in a flat cylindrical space, although the stress energy tensor itself fails to satisfy the averaged null energy condition (ANEC) along the (nonachronal) null geodesics, when the ''Casimir-vacuum'' contribution is subtracted from the stress-energy the resulting tensor does satisfy the ANEC inequality. Ford and Roman name this class of constraints on the quantum stress-energy tensor ''difference inequalities.'' Here I give a proof of the difference inequality for a minimally coupled massless scalar field in an arbitrary (globally hyperbolic) two-dimensional spacetime, using the same techniques as those we relied on to prove the ANEC in an earlier paper with Wald. I begin with an overview of averaged energy conditions in quantum field theory

Modifier constraint in alkali borophosphate glasses using topological constraint theory

Energy Technology Data Exchange (ETDEWEB)

Li, Xiang [Key Laboratory for Ultrafine Materials of Ministry of Education, School of Materials Science and Engineering, East China University of Science and Technology, Shanghai 200237 (China); Zeng, Huidan, E-mail: hdzeng@ecust.edu.cn [Key Laboratory for Ultrafine Materials of Ministry of Education, School of Materials Science and Engineering, East China University of Science and Technology, Shanghai 200237 (China); Jiang, Qi [Key Laboratory for Ultrafine Materials of Ministry of Education, School of Materials Science and Engineering, East China University of Science and Technology, Shanghai 200237 (China); Zhao, Donghui [Unifrax Corporation, Niagara Falls, NY 14305 (United States); Chen, Guorong [Key Laboratory for Ultrafine Materials of Ministry of Education, School of Materials Science and Engineering, East China University of Science and Technology, Shanghai 200237 (China); Wang, Zhaofeng; Sun, Luyi [Department of Chemical & Biomolecular Engineering and Polymer Program, Institute of Materials Science, University of Connecticut, Storrs, CT 06269 (United States); Chen, Jianding [Key Laboratory for Ultrafine Materials of Ministry of Education, School of Materials Science and Engineering, East China University of Science and Technology, Shanghai 200237 (China)

2016-12-01

In recent years, composition-dependent properties of glasses have been successfully predicted using the topological constraint theory. The constraints of the glass network are derived from two main parts: network formers and network modifiers. The constraints of the network formers can be calculated on the basis of the topological structure of the glass. However, the latter cannot be accurately calculated in this way, because of the existing of ionic bonds. In this paper, the constraints of the modifier ions in phosphate glasses were thoroughly investigated using the topological constraint theory. The results show that the constraints of the modifier ions are gradually increased with the addition of alkali oxides. Furthermore, an improved topological constraint theory for borophosphate glasses is proposed by taking the composition-dependent constraints of the network modifiers into consideration. The proposed theory is subsequently evaluated by analyzing the composition dependence of the glass transition temperature in alkali borophosphate glasses. This method is supposed to be extended to other similar glass systems containing alkali ions.

SOLAR WIND PROTONS AT 1 AU: TRENDS AND BOUNDS, CONSTRAINTS AND CORRELATIONS

Energy Technology Data Exchange (ETDEWEB)

Hellinger, Petr; Trávníček, Pavel M., E-mail: petr.hellinger@asu.cas.cz [Astronomical Institute, AS CR, Bocni II/1401,CZ-14100 Prague (Czech Republic)

2014-03-20

The proton temperature anisotropy in the solar wind exhibits apparent bounds which are compatible with the theoretical constraints imposed by temperature-anisotropy-driven kinetic instabilities. Recent statistical analyses based on conditional averaging indicate that near these theoretical constraints the solar wind protons typically have enhanced temperatures and a weaker collisionality. Here we carefully analyze the solar wind data and show that these results are a consequence of superposition of multiple correlations in the solar wind, namely, they mostly result from the correlation between the proton temperature and the solar wind velocity and from the superimposed anti-correlation between the proton temperature anisotropy and the proton parallel beta in the fast solar wind. Colder and more collisional data are distributed around temperature isotropy whereas hotter and less collisional data have a wider range of the temperature anisotropy anti-correlated with the proton parallel beta with signatures of constraints owing to the temperature-anisotropy-driven instabilities. However, most of the hot and weakly collisional data, including the hottest and least collisional ones, lies far from the marginal stability regions. Consequently, we conclude that there is no clear relation between the enhanced temperatures and instability constraints and that the conditional averaging used for these analyses must be used carefully and need to be well tested.

Constraints on communication in classrooms for the deaf.

Science.gov (United States)

Matthews, T J; Reich, C F

1993-03-01

One explanation for the relatively low scholastic achievement of deaf students is the character of communication in the classroom. Unlike aural communication methods, line-of-sight methods share the limitation that the receiver of the message must look at the sender. To assess the magnitude of this constraint, we measured the amount of time signers were looked at by potential receivers in typical secondary school classes for the deaf. Videotaped segments indicated that on average the messages sent by teachers and students were seen less than half the time. Students frequently engaged in collateral conversations. The constraints of line-of-sight communication are profound and should be addressed by teaching techniques, classroom layout, and possibly, the use of computer-communication technology.

Graphical constraints: a graphical user interface for constraint problems

OpenAIRE

Vieira, Nelson Manuel Marques

2015-01-01

A constraint satisfaction problem is a classical artificial intelligence paradigm characterized by a set of variables (each variable with an associated domain of possible values), and a set of constraints that specify relations among subsets of these variables. Solutions are assignments of values to all variables that satisfy all the constraints. Many real world problems may be modelled by means of constraints. The range of problems that can use this representation is very diverse and embrace...

A theoretical approach to the problem of dose-volume constraint estimation and their impact on the dose-volume histogram selection

International Nuclear Information System (INIS)

Schinkel, Colleen; Stavrev, Pavel; Stavreva, Nadia; Fallone, B. Gino

2006-01-01

This paper outlines a theoretical approach to the problem of estimating and choosing dose-volume constraints. Following this approach, a method of choosing dose-volume constraints based on biological criteria is proposed. This method is called ''reverse normal tissue complication probability (NTCP) mapping into dose-volume space'' and may be used as a general guidance to the problem of dose-volume constraint estimation. Dose-volume histograms (DVHs) are randomly simulated, and those resulting in clinically acceptable levels of complication, such as NTCP of 5±0.5%, are selected and averaged producing a mean DVH that is proven to result in the same level of NTCP. The points from the averaged DVH are proposed to serve as physical dose-volume constraints. The population-based critical volume and Lyman NTCP models with parameter sets taken from literature sources were used for the NTCP estimation. The impact of the prescribed value of the maximum dose to the organ, D max , on the averaged DVH and the dose-volume constraint points is investigated. Constraint points for 16 organs are calculated. The impact of the number of constraints to be fulfilled based on the likelihood that a DVH satisfying them will result in an acceptable NTCP is also investigated. It is theoretically proven that the radiation treatment optimization based on physical objective functions can sufficiently well restrict the dose to the organs at risk, resulting in sufficiently low NTCP values through the employment of several appropriate dose-volume constraints. At the same time, the pure physical approach to optimization is self-restrictive due to the preassignment of acceptable NTCP levels thus excluding possible better solutions to the problem

BDDC Algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields

KAUST Repository

Oh, Duk-Soon; Widlund, Olof B.; Zampini, Stefano; Dohrmann, Clark R.

2017-01-01

A BDDC domain decomposition preconditioner is defined by a coarse component, expressed in terms of primal constraints, a weighted average across the interface between the subdomains, and local components given in terms of solvers of local subdomain problems. BDDC methods for vector field problems discretized with Raviart-Thomas finite elements are introduced. The methods are based on a deluxe type of weighted average and an adaptive selection of primal constraints developed to deal with coefficients with high contrast even inside individual subdomains. For problems with very many subdomains, a third level of the preconditioner is introduced.

BDDC Algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields

KAUST Repository

Oh, Duk-Soon

2017-06-13

A BDDC domain decomposition preconditioner is defined by a coarse component, expressed in terms of primal constraints, a weighted average across the interface between the subdomains, and local components given in terms of solvers of local subdomain problems. BDDC methods for vector field problems discretized with Raviart-Thomas finite elements are introduced. The methods are based on a deluxe type of weighted average and an adaptive selection of primal constraints developed to deal with coefficients with high contrast even inside individual subdomains. For problems with very many subdomains, a third level of the preconditioner is introduced.

Functional Sites Induce Long-Range Evolutionary Constraints in Enzymes.

Directory of Open Access Journals (Sweden)

Benjamin R Jack

2016-05-01

Full Text Available Functional residues in proteins tend to be highly conserved over evolutionary time. However, to what extent functional sites impose evolutionary constraints on nearby or even more distant residues is not known. Here, we report pervasive conservation gradients toward catalytic residues in a dataset of 524 distinct enzymes: evolutionary conservation decreases approximately linearly with increasing distance to the nearest catalytic residue in the protein structure. This trend encompasses, on average, 80% of the residues in any enzyme, and it is independent of known structural constraints on protein evolution such as residue packing or solvent accessibility. Further, the trend exists in both monomeric and multimeric enzymes and irrespective of enzyme size and/or location of the active site in the enzyme structure. By contrast, sites in protein-protein interfaces, unlike catalytic residues, are only weakly conserved and induce only minor rate gradients. In aggregate, these observations show that functional sites, and in particular catalytic residues, induce long-range evolutionary constraints in enzymes.

Quantized Average Consensus on Gossip Digraphs with Reduced Computation

Science.gov (United States)

Cai, Kai; Ishii, Hideaki

The authors have recently proposed a class of randomized gossip algorithms which solve the distributed averaging problem on directed graphs, with the constraint that each node has an integer-valued state. The essence of this algorithm is to maintain local records, called “surplus”, of individual state updates, thereby achieving quantized average consensus even though the state sum of all nodes is not preserved. In this paper we study a modified version of this algorithm, whose feature is primarily in reducing both computation and communication effort. Concretely, each node needs to update fewer local variables, and can transmit surplus by requiring only one bit. Under this modified algorithm we prove that reaching the average is ensured for arbitrary strongly connected graphs. The condition of arbitrary strong connection is less restrictive than those known in the literature for either real-valued or quantized states; in particular, it does not require the special structure on the network called balanced. Finally, we provide numerical examples to illustrate the convergence result, with emphasis on convergence time analysis.

Optimal power allocation of a sensor node under different rate constraints

KAUST Repository

Ayala Solares, Jose Roberto

2012-06-01

The optimal transmit power of a sensor node while satisfying different rate constraints is derived. First, an optimization problem with an instantaneous transmission rate constraint is addressed. Next, the optimal power is analyzed, but now with an average transmission rate constraint. The optimal solution for a class of fading channels, in terms of system parameters, is presented and a suboptimal solution is also proposed for an easier, yet efficient, implementation. Insightful asymptotical analysis for both schemes, considering a Rayleigh fading channel, are shown. Finally, the optimal power allocation for a sensor node in a cognitive radio environment is analyzed where an optimum solution for a class of fading channels is again derived. In all cases, numerical results are provided for either Rayleigh or Nakagami-m fading channels. © 2012 IEEE.

Channel Modeling

Science.gov (United States)

Schmitz, Arne; Schinnenburg, Marc; Gross, James; Aguiar, Ana

For any communication system the Signal-to-Interference-plus-Noise-Ratio of the link is a fundamental metric. Recall (cf. Chapter 9) that the SINR is defined as the ratio between the received power of the signal of interest and the sum of all "disturbing" power sources (i.e. interference and noise). From information theory it is known that a higher SINR increases the maximum possible error-free transmission rate (referred to as Shannon capacity [417] of any communication system and vice versa). Conversely, the higher the SINR, the lower will be the bit error rate in practical systems. While one aspect of the SINR is the sum of all distracting power sources, another issue is the received power. This depends on the transmitted power, the used antennas, possibly on signal processing techniques and ultimately on the channel gain between transmitter and receiver.

Low Complexity Precoder and Receiver Design for Massive MIMO Systems: A Large System Analysis using Random Matrix Theory

KAUST Repository

Sifaou, Houssem

2016-01-01

transceivers. Using tools from random matrix theory, we determine deterministic approximations of the SINR and the transmit power in the asymptotic regime. Then, the optimal per-user weight coe cients that solve the max-min SINR problem are derived

From physical dose constraints to equivalent uniform dose constraints in inverse radiotherapy planning

International Nuclear Information System (INIS)

Thieke, Christian; Bortfeld, Thomas; Niemierko, Andrzej; Nill, Simeon

2003-01-01

Optimization algorithms in inverse radiotherapy planning need information about the desired dose distribution. Usually the planner defines physical dose constraints for each structure of the treatment plan, either in form of minimum and maximum doses or as dose-volume constraints. The concept of equivalent uniform dose (EUD) was designed to describe dose distributions with a higher clinical relevance. In this paper, we present a method to consider the EUD as an optimization constraint by using the method of projections onto convex sets (POCS). In each iteration of the optimization loop, for the actual dose distribution of an organ that violates an EUD constraint a new dose distribution is calculated that satisfies the EUD constraint, leading to voxel-based physical dose constraints. The new dose distribution is found by projecting the current one onto the convex set of all dose distributions fulfilling the EUD constraint. The algorithm is easy to integrate into existing inverse planning systems, and it allows the planner to choose between physical and EUD constraints separately for each structure. A clinical case of a head and neck tumor is optimized using three different sets of constraints: physical constraints for all structures, physical constraints for the target and EUD constraints for the organs at risk, and EUD constraints for all structures. The results show that the POCS method converges stable and given EUD constraints are reached closely

Physical activity participation and constraints among athletic training students.

Science.gov (United States)

Stanek, Justin; Rogers, Katherine; Anderson, Jordan

2015-02-01

Researchers have examined the physical activity (PA) habits of certified athletic trainers; however, none have looked specifically at athletic training students. To assess PA participation and constraints to participation among athletic training students. Cross-sectional study. Entry-level athletic training education programs (undergraduate and graduate) across the United States. Participants were 1125 entry-level athletic training students. Self-reported PA participation, including a calculated PA index based on a typical week. Leisure constraints and demographic data were also collected. Only 22.8% (252/1105) of athletic training students were meeting the American College of Sports Medicine recommendations for PA through moderate-intensity cardiorespiratory exercise. Although 52.3% (580/1105) were meeting the recommendations through vigorous-intensity cardiorespiratory exercise, 60.5% (681/1125) were meeting the recommendations based on the combined total of moderate or vigorous cardiorespiratory exercise. In addition, 57.2% (643/1125) of respondents met the recommendations for resistance exercise. Exercise habits of athletic training students appear to be better than the national average and similar to those of practicing athletic trainers. Students reported structural constraints such as lack of time due to work or studies as the most significant barrier to exercise participation. Athletic training students experienced similar constraints to PA participation as practicing athletic trainers, and these constraints appeared to influence their exercise participation during their entry-level education. Athletic training students may benefit from a greater emphasis on work-life balance during their entry-level education to promote better health and fitness habits.

Complementary Set Matrices Satisfying a Column Correlation Constraint

OpenAIRE

Wu, Di; Spasojevic, Predrag

2006-01-01

Motivated by the problem of reducing the peak to average power ratio (PAPR) of transmitted signals, we consider a design of complementary set matrices whose column sequences satisfy a correlation constraint. The design algorithm recursively builds a collection of $2^{t+1}$ mutually orthogonal (MO) complementary set matrices starting from a companion pair of sequences. We relate correlation properties of column sequences to that of the companion pair and illustrate how to select an appropriate...

A RED modified weighted moving average for soft real-time application

Directory of Open Access Journals (Sweden)

Domanśka Joanna

2014-09-01

Full Text Available The popularity of TCP/IP has resulted in an increase in usage of best-effort networks for real-time communication. Much effort has been spent to ensure quality of service for soft real-time traffic over IP networks. The Internet Engineering Task Force has proposed some architecture components, such as Active Queue Management (AQM. The paper investigates the influence of the weighted moving average on packet waiting time reduction for an AQM mechanism: the RED algorithm. The proposed method for computing the average queue length is based on a difference equation (a recursive equation. Depending on a particular optimality criterion, proper parameters of the modified weighted moving average function can be chosen. This change will allow reducing the number of violations of timing constraints and better use of this mechanism for soft real-time transmissions. The optimization problem is solved through simulations performed in OMNeT++ and later verified experimentally on a Linux implementation

Constraint-based reachability

Directory of Open Access Journals (Sweden)

Arnaud Gotlieb

2013-02-01

Full Text Available Iterative imperative programs can be considered as infinite-state systems computing over possibly unbounded domains. Studying reachability in these systems is challenging as it requires to deal with an infinite number of states with standard backward or forward exploration strategies. An approach that we call Constraint-based reachability, is proposed to address reachability problems by exploring program states using a constraint model of the whole program. The keypoint of the approach is to interpret imperative constructions such as conditionals, loops, array and memory manipulations with the fundamental notion of constraint over a computational domain. By combining constraint filtering and abstraction techniques, Constraint-based reachability is able to solve reachability problems which are usually outside the scope of backward or forward exploration strategies. This paper proposes an interpretation of classical filtering consistencies used in Constraint Programming as abstract domain computations, and shows how this approach can be used to produce a constraint solver that efficiently generates solutions for reachability problems that are unsolvable by other approaches.

FPGA Dynamic Power Minimization through Placement and Routing Constraints

Directory of Open Access Journals (Sweden)

Deepak Agarwal

2006-08-01

Full Text Available Field-programmable gate arrays (FPGAs are pervasive in embedded systems requiring low-power utilization. A novel power optimization methodology for reducing the dynamic power consumed by the routing of FPGA circuits by modifying the constraints applied to existing commercial tool sets is presented. The power optimization techniques influence commercial FPGA Place and Route (PAR tools by translating power goals into standard throughput and placement-based constraints. The Low-Power Intelligent Tool Environment (LITE is presented, which was developed to support the experimentation of power models and power optimization algorithms. The generated constraints seek to implement one of four power optimization approaches: slack minimization, clock tree paring, N-terminal net colocation, and area minimization. In an experimental study, we optimize dynamic power of circuits mapped into 0.12 μm Xilinx Virtex-II FPGAs. Results show that several optimization algorithms can be combined on a single design, and power is reduced by up to 19.4%, with an average power savings of 10.2%.

Constraint-Muse: A Soft-Constraint Based System for Music Therapy

Science.gov (United States)

Hölzl, Matthias; Denker, Grit; Meier, Max; Wirsing, Martin

Monoidal soft constraints are a versatile formalism for specifying and solving multi-criteria optimization problems with dynamically changing user preferences. We have developed a prototype tool for interactive music creation, called Constraint Muse, that uses monoidal soft constraints to ensure that a dynamically generated melody harmonizes with input from other sources. Constraint Muse provides an easy to use interface based on Nintendo Wii controllers and is intended to be used in music therapy for people with Parkinson’s disease and for children with high-functioning autism or Asperger’s syndrome.

Power allocation for target detection in radar networks based on low probability of intercept: A cooperative game theoretical strategy

Science.gov (United States)

Shi, Chenguang; Salous, Sana; Wang, Fei; Zhou, Jianjiang

2017-08-01

Distributed radar network systems have been shown to have many unique features. Due to their advantage of signal and spatial diversities, radar networks are attractive for target detection. In practice, the netted radars in radar networks are supposed to maximize their transmit power to achieve better detection performance, which may be in contradiction with low probability of intercept (LPI). Therefore, this paper investigates the problem of adaptive power allocation for radar networks in a cooperative game-theoretic framework such that the LPI performance can be improved. Taking into consideration both the transmit power constraints and the minimum signal to interference plus noise ratio (SINR) requirement of each radar, a cooperative Nash bargaining power allocation game based on LPI is formulated, whose objective is to minimize the total transmit power by optimizing the power allocation in radar networks. First, a novel SINR-based network utility function is defined and utilized as a metric to evaluate power allocation. Then, with the well-designed network utility function, the existence and uniqueness of the Nash bargaining solution are proved analytically. Finally, an iterative Nash bargaining algorithm is developed that converges quickly to a Pareto optimal equilibrium for the cooperative game. Numerical simulations and theoretic analysis are provided to evaluate the effectiveness of the proposed algorithm.

Cerebral palsy in adult patients: constraint-induced movement therapy is effective to reverse the nonuse of the affected upper limb

Directory of Open Access Journals (Sweden)

Ana Cecília P. Oliveira

2016-01-01

Full Text Available ABSTRACT Objective To determine if the original protocol of Constraint-Induced Movement Therapy (CIMT, is adequate to reverse the nonuse of the affected upper limb (AUL in patients with Cerebral Palsy (CP in adulthood. Method The study included 10 patients diagnosed with CP hemiparesis had attended the adult protocol CIMT, from January/August 2009/2014. Results Average age 24.6 (SD 9.44; MAL average pretreatment How Often (HO = 0.72 and How Well (HW = 0.68 and post-treatment HO = 3.77 and HW = 3.60 (p ≤ 0.001 and pretreatment WMFT average = 21.03 and post-treatment average = 18.91 (p = 0.350. Conclusion The constraint-induced movement therapy is effective to reverse the nonuse learn of the AUL in adult patients with CP.

Reduction of Constraints: Applicability of the Homogeneity Constraint for Macrobatch 3

International Nuclear Information System (INIS)

Peeler, D.K.

2001-01-01

The Product Composition Control System (PCCS) is used to determine the acceptability of each batch of Defense Waste Processing Facility (DWPF) melter feed in the Slurry Mix Evaporator (SME). This control system imposes several constraints on the composition of the contents of the SME to define acceptability. These constraints relate process or product properties to composition via prediction models. A SME batch is deemed acceptable if its sample composition measurements lead to acceptable property predictions after accounting for modeling, measurement and analytic uncertainties. The baseline document guiding the use of these data and models is ''SME Acceptability Determination for DWPF Process Control (U)'' by Brown and Postles [1996]. A minimum of three PCCS constraints support the prediction of the glass durability from a given SME batch. The Savannah River Technology Center (SRTC) is reviewing all of the PCCS constraints associated with durability. The purpose of this review is to revisit these constraints in light of the additional knowledge gained since the beginning of radioactive operations at DWPF and to identify any supplemental studies needed to amplify this knowledge so that redundant or overly conservative constraints can be eliminated or replaced by more appropriate constraints

Performance of Spatial Division Multiplexing MIMO with Frequency Domain Packet Scheduling

DEFF Research Database (Denmark)

Wei, Na; Pokhariyal, Akhilesh; Sørensen, Troels Bundgaard

2008-01-01

the performance bounds of SDM-FDPS. To facilitate the analysis, a unified SINR concept is utilized to make a fair comparison of MIMO schemes with different number of spatial streams. The effect of packet scheduling is included in the post-scheduling SINR distribution using an analytical model. Based on that...

Momentum constraint relaxation

International Nuclear Information System (INIS)

Marronetti, Pedro

2006-01-01

Full relativistic simulations in three dimensions invariably develop runaway modes that grow exponentially and are accompanied by violations of the Hamiltonian and momentum constraints. Recently, we introduced a numerical method (Hamiltonian relaxation) that greatly reduces the Hamiltonian constraint violation and helps improve the quality of the numerical model. We present here a method that controls the violation of the momentum constraint. The method is based on the addition of a longitudinal component to the traceless extrinsic curvature A ij -tilde, generated by a vector potential w i , as outlined by York. The components of w i are relaxed to solve approximately the momentum constraint equations, slowly pushing the evolution towards the space of solutions of the constraint equations. We test this method with simulations of binary neutron stars in circular orbits and show that it effectively controls the growth of the aforementioned violations. We also show that a full numerical enforcement of the constraints, as opposed to the gentle correction of the momentum relaxation scheme, results in the development of instabilities that stop the runs shortly

Calculating ensemble averaged descriptions of protein rigidity without sampling.

Science.gov (United States)

González, Luis C; Wang, Hui; Livesay, Dennis R; Jacobs, Donald J

2012-01-01

Previous works have demonstrated that protein rigidity is related to thermodynamic stability, especially under conditions that favor formation of native structure. Mechanical network rigidity properties of a single conformation are efficiently calculated using the integer body-bar Pebble Game (PG) algorithm. However, thermodynamic properties require averaging over many samples from the ensemble of accessible conformations to accurately account for fluctuations in network topology. We have developed a mean field Virtual Pebble Game (VPG) that represents the ensemble of networks by a single effective network. That is, all possible number of distance constraints (or bars) that can form between a pair of rigid bodies is replaced by the average number. The resulting effective network is viewed as having weighted edges, where the weight of an edge quantifies its capacity to absorb degrees of freedom. The VPG is interpreted as a flow problem on this effective network, which eliminates the need to sample. Across a nonredundant dataset of 272 protein structures, we apply the VPG to proteins for the first time. Our results show numerically and visually that the rigidity characterizations of the VPG accurately reflect the ensemble averaged [Formula: see text] properties. This result positions the VPG as an efficient alternative to understand the mechanical role that chemical interactions play in maintaining protein stability.

Distance and slope constraints: adaptation and variability in golf putting.

Science.gov (United States)

Dias, Gonçalo; Couceiro, Micael S; Barreiros, João; Clemente, Filipe M; Mendes, Rui; Martins, Fernando M

2014-07-01

The main objective of this study is to understand the adaptation to external constraints and the effects of variability in a golf putting task. We describe the adaptation of relevant variables of golf putting to the distance to the hole and to the addition of a slope. The sample consisted of 10 adult male (33.80 ± 11.89 years), volunteers, right handed and highly skilled golfers with an average handicap of 10.82. Each player performed 30 putts at distances of 2, 3 and 4 meters (90 trials in Condition 1). The participants also performed 90 trials, at the same distances, with a constraint imposed by a slope (Condition 2). The results indicate that the players change some parameters to adjust to the task constraints, namely the duration of the backswing phase, the speed of the club head and the acceleration at the moment of impact with the ball. The effects of different golf putting distances in the no-slope condition on different kinematic variables suggest a linear adjustment to distance variation that was not observed when in the slope condition.

Do modified audit opinions have economic consequences? Empirical evidence based on financial constraints

Directory of Open Access Journals (Sweden)

Zhiwei Lin

2011-09-01

Full Text Available We present a framework and empirical evidence to explain why, on average, 11% of listed firms in China received modified audit opinions (MAOs between 1992 and 2009. We argue that there are two reasons for this phenomenon: strong earnings management incentives lower firms’ financial reporting quality and soft budget constraints weaken the information and governance roles of audit opinions. We find that firms’ financial constraints eased after receiving MAOs, which suggests that MAOs have limited economic consequences. Further analysis shows that this phenomenon predominantly exists in government-controlled firms and firms that receive MAOs for the first time. We also find that MAOs have not influenced financial constraints after 2006. Finally, we find that MAOs did not affect borrowing cash flows from banks until 2005, suggesting that MAOs did not start affecting bank financing until that year. We also find that firms receive more related-party financing after receiving MAOs. Our results indicate that a limited effect on bank financing and increased related-party financing reduce the effect of MAOs on financial constraints.

Calculating ensemble averaged descriptions of protein rigidity without sampling.

Directory of Open Access Journals (Sweden)

Luis C González

Full Text Available Previous works have demonstrated that protein rigidity is related to thermodynamic stability, especially under conditions that favor formation of native structure. Mechanical network rigidity properties of a single conformation are efficiently calculated using the integer body-bar Pebble Game (PG algorithm. However, thermodynamic properties require averaging over many samples from the ensemble of accessible conformations to accurately account for fluctuations in network topology. We have developed a mean field Virtual Pebble Game (VPG that represents the ensemble of networks by a single effective network. That is, all possible number of distance constraints (or bars that can form between a pair of rigid bodies is replaced by the average number. The resulting effective network is viewed as having weighted edges, where the weight of an edge quantifies its capacity to absorb degrees of freedom. The VPG is interpreted as a flow problem on this effective network, which eliminates the need to sample. Across a nonredundant dataset of 272 protein structures, we apply the VPG to proteins for the first time. Our results show numerically and visually that the rigidity characterizations of the VPG accurately reflect the ensemble averaged [Formula: see text] properties. This result positions the VPG as an efficient alternative to understand the mechanical role that chemical interactions play in maintaining protein stability.

Crack-tip constraint analyses and constraint-dependent LBB curves for circumferential through-wall cracked pipes

Energy Technology Data Exchange (ETDEWEB)

Chen, Y.L.; Wang, G.Z., E-mail: gzwang@ecust.edu.cn; Xuan, F.Z.; Tu, S.T.

2015-04-15

Highlights: • Solution of constraint parameter τ* for through-wall cracked pipes has been obtained. • Constraint increases with increasing crack length and radius–thickness ratio of pipes. • Constraint-dependent LBB curve for through-wall cracked pipes has been constructed. • For increasing accuracy of LBB assessments, constraint effect should be considered. - Abstract: The leak-before-break (LBB) concept has been widely applied in the structural integrity assessments of pressured pipes in nuclear power plants. However, the crack-tip constraint effects in LBB analyses and designs cannot be incorporated. In this paper, by using three-dimensional finite element calculations, the modified load-independent T-stress constraint parameter τ* for circumferential through-wall cracked pipes with different geometries and crack sizes has been analyzed under different loading conditions, and the solutions of the crack-tip constraint parameter τ* have been obtained. Based on the τ* solutions and constraint-dependent J–R curves of a steel, the constraint-dependent LBB (leak-before-break) curves have been constructed. The results show that the constraint τ* increases with increasing crack length θ, mean radius R{sub m} and radius–thickness ratio R{sub m}/t of the pipes. In LBB analyses, the critical crack length calculated by the J–R curve of the standard high constraint specimen for pipes with shorter cracks is over-conservative, and the degree of conservatism increases with decreasing crack length θ, R{sub m} and R{sub m}/t. Therefore, the constraint-dependent LBB curves should be constructed to modify the over-conservatism and increase accuracy of LBB assessments.

Stochastic population dynamics under resource constraints

Energy Technology Data Exchange (ETDEWEB)

Gavane, Ajinkya S., E-mail: ajinkyagavane@gmail.com; Nigam, Rahul, E-mail: rahul.nigam@hyderabad.bits-pilani.ac.in [BITS Pilani Hyderabad Campus, Shameerpet, Hyd - 500078 (India)

2016-06-02

This paper investigates the population growth of a certain species in which every generation reproduces thrice over a period of predefined time, under certain constraints of resources needed for survival of population. We study the survival period of a species by randomizing the reproduction probabilities within a window at same predefined ages and the resources are being produced by the working force of the population at a variable rate. This randomness in the reproduction rate makes the population growth stochastic in nature and one cannot predict the exact form of evolution. Hence we study the growth by running simulations for such a population and taking an ensemble averaged over 500 to 5000 such simulations as per the need. While the population reproduces in a stochastic manner, we have implemented a constraint on the amount of resources available for the population. This is important to make the simulations more realistic. The rate of resource production then is tuned to find the rate which suits the survival of the species. We also compute the mean life time of the species corresponding to different resource production rate. Study for these outcomes in the parameter space defined by the reproduction probabilities and rate of resource production is carried out.

Misconceptions and constraints

International Nuclear Information System (INIS)

Whitten, M.; Mahon, R.

2005-01-01

In theory, the sterile insect technique (SIT) is applicable to a wide variety of invertebrate pests. However, in practice, the approach has been successfully applied to only a few major pests. Chapters in this volume address possible reasons for this discrepancy, e.g. Klassen, Lance and McInnis, and Robinson and Hendrichs. The shortfall between theory and practice is partly due to the persistence of some common misconceptions, but it is mainly due to one constraint, or a combination of constraints, that are biological, financial, social or political in nature. This chapter's goal is to dispel some major misconceptions, and view the constraints as challenges to overcome, seeing them as opportunities to exploit. Some of the common misconceptions include: (1) released insects retain residual radiation, (2) females must be monogamous, (3) released males must be fully sterile, (4) eradication is the only goal, (5) the SIT is too sophisticated for developing countries, and (6) the SIT is not a component of an area-wide integrated pest management (AW-IPM) strategy. The more obvious constraints are the perceived high costs of the SIT, and the low competitiveness of released sterile males. The perceived high up-front costs of the SIT, their visibility, and the lack of private investment (compared with alternative suppression measures) emerge as serious constraints. Failure to appreciate the true nature of genetic approaches, such as the SIT, may pose a significant constraint to the wider adoption of the SIT and other genetically-based tactics, e.g. transgenic genetically modified organisms (GMOs). Lack of support for the necessary underpinning strategic research also appears to be an important constraint. Hence the case for extensive strategic research in ecology, population dynamics, genetics, and insect behaviour and nutrition is a compelling one. Raising the competitiveness of released sterile males remains the major research objective of the SIT. (author)

Constraints and Creativity in NPD - Testing the Impact of 'Late Constraints'

DEFF Research Database (Denmark)

Onarheim, Balder; Valgeirsdóttir, Dagný

experiment was conducted, involving 12 teams of industrial designers from three different countries, each team working on two 30 minutes design tasks. In one condition all constraints were given at the start, and in the other one new radical constraint was added after 12 minutes. The output from all 24 tasks......The aim of the presented work is to investigate how the timing of project constraints can influence the creativity of the output in New Product Development (NPD) projects. When seeking to produce a creative output, is it beneficial to know all constraints when initiating a project...... was assessed for creativity using the Consensual Assessment Technique (CAT), and a comparative within-subjects analysis found no significant different between the two conditions. Controlling for task and assessor a small but non-significant effect was found, in favor of the ‘late constraint’ condition. Thus...

Distance measurements from supernovae and dark energy constraints

International Nuclear Information System (INIS)

Wang Yun

2009-01-01

Constraints on dark energy from current observational data are sensitive to how distances are measured from Type Ia supernova (SN Ia) data. We find that flux averaging of SNe Ia can be used to test the presence of unknown systematic uncertainties, and yield more robust distance measurements from SNe Ia. We have applied this approach to the nearby+SDSS+ESSENCE+SNLS+HST set of 288 SNe Ia, and the 'Constitution' set of 397 SNe Ia. Combining the SN Ia data with cosmic microwave background anisotropy data from Wilkinson Microwave Anisotropy Probe 5 yr observations, the Sloan Digital Sky Survey baryon acoustic oscillation measurements, the data of 69 gamma-ray bursts (GRBs) , and the Hubble constant measurement from the Hubble Space Telescope project SHOES, we measure the dark energy density function X(z)≡ρ X (z)/ρ X (0) as a free function of redshift (assumed to be a constant at z>1 or z>1.5). Without the flux averaging of SNe Ia, the combined data using the Constitution set of SNe Ia seem to indicate a deviation from a cosmological constant at ∼95% confidence level at 0 98% confidence level for z≤0.75 using the combined data with 288 SNe Ia from nearby+SDSS+ESSENCE+SNLS+HST, independent of the assumptions about X(z≥1). We quantify dark energy constraints without assuming a flat Universe using the dark energy figure of merit for both X(z) and a dark energy equation-of-state linear in the cosmic scale factor.

Appointment Template Redesign in a Women's Health Clinic Using Clinical Constraints to Improve Service Quality and Efficiency.

Science.gov (United States)

Huang, Y; Verduzco, S

2015-01-01

Patient wait time is a critical element of access to care that has long been recognized as a major problem in modern outpatient health care delivery systems. It impacts patient and medical staff productivity, stress, quality and efficiency of medical care, as well as health-care cost and availability. This study was conducted in a Women's Health Clinic. The objective was to improve clinic service quality by redesigning patient appointment template using the clinical constraints. The proposed scheduling template consisted of two key elements: the redesign of appointment types and the determination of the length of time slots using defined constraints. The re-classification technique was used for the redesign of appointment visit types to capture service variation for scheduling purposes. Then, the appointment length was determined by incorporating clinic constraints or goals, such as patient wait time, physician idle time, overtime, finish time, lunch hours, when the last appointment was scheduled, and the desired number of appointment slots, to converge the optimal length of appointment slots for each visit type. The redesigned template was implemented and the results indicated a 73% reduction in average patient waiting from the reported 40 to 11 minutes. The patient no-show rate was reduced by 4% from 24% to 20%. The morning section on average finished about 11:50 am. The clinic day was finished around 4:45 pm. Provider average idle time was estimated to be about 5 minutes, which can be used for charting/documenting patients. This study provided an alternative method of redesigning appointment scheduling templates using only the clinical constraints rather than the traditional way that required an objective function. This paper also documented the employed methods step by step in a real clinic setting. The implementation results concluded a significant improvement on patient wait time and no-show rate.

A Comprehensive Theory of Algorithms for Wireless Networks and Mobile Systems

Science.gov (United States)

2016-06-08

pages 109-118, July 2015. [3] Magnus Halldorsson, Stephan Holzer and Nancy Lynch. A Local Broadcast Layer for the SINR Network Model. ACM Symposium on...publication, 2014. [9] Magnus Halldorsson, Stephan Holzer, Pradipta Mitra and Roger Wattenhofer. The Power of Oblivious Wireless Power. Submitted for...David Peleg. Nonuniform SINR+Voronoi Diagrams are Effectively Uniform. In Yoram Moses, editor, Distributed Computing: 29th International Symposium

Rf system modeling for the high average power FEL at CEBAF

International Nuclear Information System (INIS)

Merminga, L.; Fugitt, J.; Neil, G.; Simrock, S.

1995-01-01

High beam loading and energy recovery compounded by use of superconducting cavities, which requires tight control of microphonic noise, place stringent constraints on the linac rf system design of the proposed high average power FEL at CEBAF. Longitudinal dynamics imposes off-crest operation, which in turn implies a large tuning angle to minimize power requirements. Amplitude and phase stability requirements are consistent with demonstrated performance at CEBAF. A numerical model of the CEBAF rf control system is presented and the response of the system is examined under large parameter variations, microphonic noise, and beam current fluctuations. Studies of the transient behavior lead to a plausible startup and recovery scenario

Financing Constraints and Entrepreneurship

OpenAIRE

William R. Kerr; Ramana Nanda

2009-01-01

Financing constraints are one of the biggest concerns impacting potential entrepreneurs around the world. Given the important role that entrepreneurship is believed to play in the process of economic growth, alleviating financing constraints for would-be entrepreneurs is also an important goal for policymakers worldwide. We review two major streams of research examining the relevance of financing constraints for entrepreneurship. We then introduce a framework that provides a unified perspecti...

Creativity from Constraints in Engineering Design

DEFF Research Database (Denmark)

Onarheim, Balder

2012-01-01

This paper investigates the role of constraints in limiting and enhancing creativity in engineering design. Based on a review of literature relating constraints to creativity, the paper presents a longitudinal participatory study from Coloplast A/S, a major international producer of disposable...... and ownership of formal constraints played a crucial role in defining their influence on creativity – along with the tacit constraints held by the designers. The designers were found to be highly constraint focused, and four main creative strategies for constraint manipulation were observed: blackboxing...

Deepening Contractions and Collateral Constraints

DEFF Research Database (Denmark)

Jensen, Henrik; Ravn, Søren Hove; Santoro, Emiliano

and occasionally non-binding credit constraints. Easier credit access increases the likelihood that constraints become slack in the face of expansionary shocks, while contractionary shocks are further amplified due to tighter constraints. As a result, busts gradually become deeper than booms. Based...

[Environmental efficiency evaluation under carbon emission constraint in Western China].

Science.gov (United States)

Rong, Jian-bo; Yan, Li-jiao; Huang, Shao-rong; Zhang, Ge

2015-06-01

This research used the SBM model based on undesirable outputs to measure the static environmental efficiency of Western China under carbon emission constraint from 2000 to 2012. The researchers also utilized the Malmquist index to further analyze the change tendency of environmental efficiency. Additionally, Tobit regression analysis was used to study the factors relevant to environmental efficiency. Practical solutions to improve environmental quality in Western China were put forward. The study showed that in Western China, environmental efficiency with carbon emission constraint was significantly lower than that without carbon emission constraint, and the difference could be described as an inverse U-shaped curve which increased at first and then decreased. Guang-xi and Inner Mongolia, the two provinces met the effective environmental efficiency levels all the time under carbon emission constraint. However, the five provinces of Guizhou, Gansu, Qinghai, Ningxia and Xinjiang did not. Furthermore, Ningxia had the lowest level of environmental efficiency, with a score between 0.281-0.386. Although the environmental efficiency of most provinces was currently at an ineffective level, the environmental efficiency quality was gradually improving at an average speed of 6.6%. Excessive CO2 emission and a large amount of energy consumption were the primary factors causing environmental inefficiency in Western China, and energy intensity had the most negative impact on the environmental efficiency. The increase of import and export trade reduced the environmental efficiency significantly in Western China, while the increase of foreign direct investment had a positive effect on its environmental efficiency.

Occupational dose constraint

International Nuclear Information System (INIS)

Heilbron Filho, Paulo Fernando Lavalle; Xavier, Ana Maria

2005-01-01

The revision process of the international radiological protection regulations has resulted in the adoption of new concepts, such as practice, intervention, avoidable and restriction of dose (dose constraint). The latter deserving of special mention since it may involve reducing a priori of the dose limits established both for the public and to individuals occupationally exposed, values that can be further reduced, depending on the application of the principle of optimization. This article aims to present, with clarity, from the criteria adopted to define dose constraint values to the public, a methodology to establish the dose constraint values for occupationally exposed individuals, as well as an example of the application of this methodology to the practice of industrial radiography

The balanced survivor average causal effect.

Science.gov (United States)

Greene, Tom; Joffe, Marshall; Hu, Bo; Li, Liang; Boucher, Ken

2013-05-07

Statistical analysis of longitudinal outcomes is often complicated by the absence of observable values in patients who die prior to their scheduled measurement. In such cases, the longitudinal data are said to be "truncated by death" to emphasize that the longitudinal measurements are not simply missing, but are undefined after death. Recently, the truncation by death problem has been investigated using the framework of principal stratification to define the target estimand as the survivor average causal effect (SACE), which in the context of a two-group randomized clinical trial is the mean difference in the longitudinal outcome between the treatment and control groups for the principal stratum of always-survivors. The SACE is not identified without untestable assumptions. These assumptions have often been formulated in terms of a monotonicity constraint requiring that the treatment does not reduce survival in any patient, in conjunction with assumed values for mean differences in the longitudinal outcome between certain principal strata. In this paper, we introduce an alternative estimand, the balanced-SACE, which is defined as the average causal effect on the longitudinal outcome in a particular subset of the always-survivors that is balanced with respect to the potential survival times under the treatment and control. We propose a simple estimator of the balanced-SACE that compares the longitudinal outcomes between equivalent fractions of the longest surviving patients between the treatment and control groups and does not require a monotonicity assumption. We provide expressions for the large sample bias of the estimator, along with sensitivity analyses and strategies to minimize this bias. We consider statistical inference under a bootstrap resampling procedure.

Optimal Power Allocation of a Wireless Sensor Node under Different Rate Constraints

KAUST Repository

Solares, Jose

2011-07-01

Wireless sensor networks consist of the placement of sensors over a broad area in order to acquire data. Depending on the application, different design criteria should be considered in the construction of the sensors but among all of them, the battery life-cycle is of crucial interest. Power minimization is a problem that has been addressed from different approaches which include an analysis from an architectural perspective and with bit error rate and/or discrete instantaneous transmission rate constraints, among others. In this work, the optimal transmit power of a sensor node while satisfying different rate constraints is derived. First, an optimization problem with an instantaneous transmission rate constraint is addressed. Next, the optimal power is analyzed, but now with an average transmission rate constraint. The optimal solution for a class of fading channels, in terms of system parameters, is presented and a suboptimal solution is also proposed for an easier, yet efficient, implementation. Insightful asymptotical analysis for both schemes, considering a Rayleigh fading channel, are shown. Furthermore, the optimal power allocation for a sensor node in a cognitive radio environment is analyzed where an optimum solution for a class of fading channels is again derived. In all cases, numerical results are provided for either Rayleigh or Nakagami-m fading channels. The results obtained are extended to scenarios where we have either one transmitter-multiple receivers or multiple transmitters-one receiver.

Solar constraints

International Nuclear Information System (INIS)

Provost, J.

1984-01-01

Accurate tests of the theory of stellar structure and evolution are available from the Sun's observations. The solar constraints are reviewed, with a special attention to the recent progress in observing global solar oscillations. Each constraint is sensitive to a given region of the Sun. The present solar models (standard, low Z, mixed) are discussed with respect to neutrino flux, low and high degree five-minute oscillations and low degree internal gravity modes. It appears that actually there do not exist solar models able to fully account for all the observed quantities. (Auth.)

Temporal Concurrent Constraint Programming

DEFF Research Database (Denmark)

Nielsen, Mogens; Valencia Posso, Frank Dan

2002-01-01

The ntcc calculus is a model of non-deterministic temporal concurrent constraint programming. In this paper we study behavioral notions for this calculus. In the underlying computational model, concurrent constraint processes are executed in discrete time intervals. The behavioral notions studied...... reflect the reactive interactions between concurrent constraint processes and their environment, as well as internal interactions between individual processes. Relationships between the suggested notions are studied, and they are all proved to be decidable for a substantial fragment of the calculus...

MIMO Radar Transceiver Design for High Signal-to-Interference-Plus-Noise Ratio

KAUST Repository

Lipor, John

2013-05-12

Multiple-input multiple-output (MIMO) radar employs orthogonal or partially correlated transmit signals to achieve performance benefits over its phased-array counterpart. It has been shown that MIMO radar can achieve greater spatial resolution, improved signal-to-noise ratio (SNR) and target localization, and greater clutter resolution using space-time adaptive processing (STAP). This thesis explores various methods to improve the signal-to-interference-plus-noise ratio (SINR) via transmit and receive beamforming. In MIMO radar settings, it is often desirable to transmit power only to a given location or set of locations defined by a beampattern. Current methods involve a two- step process of designing the transmit covariance matrix R via iterative solutions and then using R to generate waveforms that fulfill practical constraints such as having a constant-envelope or drawing from a finite alphabet. In this document, a closed- form method to design R is proposed that utilizes the discrete Fourier transform (DFT) coefficients and Toeplitz matrices. The resulting covariance matrix fulfills the practical constraints such as positive semidefiniteness and the uniform elemental power constraint and provides performance similar to that of iterative methods, which require a much greater computation time. Next, a transmit architecture is presented 
that exploits the orthogonality of frequencies at discrete DFT values to transmit a sum of orthogonal signals from each antenna. The resulting waveforms provide a lower mean-square error than current methods at a much lower computational cost, and a simulated detection scenario demonstrates the performance advantages achieved. It is also desirable to receive signal power only from a given set of directions defined by a beampattern. In a later chapter of this document, the problem of receive beampattern matching is formulated and three solutions to this problem are demonstrated. We show that partitioning the received data vector

Theory of Constraints (TOC)

DEFF Research Database (Denmark)

Michelsen, Aage U.

2004-01-01

Tankegangen bag Theory of Constraints samt planlægningsprincippet Drum-Buffer-Rope. Endvidere skitse af The Thinking Process.......Tankegangen bag Theory of Constraints samt planlægningsprincippet Drum-Buffer-Rope. Endvidere skitse af The Thinking Process....

A cost constraint alone has adverse effects on food selection and nutrient density: an analysis of human diets by linear programming.

Science.gov (United States)

Darmon, Nicole; Ferguson, Elaine L; Briend, André

2002-12-01

Economic constraints may contribute to the unhealthy food choices observed among low socioeconomic groups in industrialized countries. The objective of the present study was to predict the food choices a rational individual would make to reduce his or her food budget, while retaining a diet as close as possible to the average population diet. Isoenergetic diets were modeled by linear programming. To ensure these diets were consistent with habitual food consumption patterns, departure from the average French diet was minimized and constraints that limited portion size and the amount of energy from food groups were introduced into the models. A cost constraint was introduced and progressively strengthened to assess the effect of cost on the selection of foods by the program. Strengthening the cost constraint reduced the proportion of energy contributed by fruits and vegetables, meat and dairy products and increased the proportion from cereals, sweets and added fats, a pattern similar to that observed among low socioeconomic groups. This decreased the nutritional quality of modeled diets, notably the lowest cost linear programming diets had lower vitamin C and beta-carotene densities than the mean French adult diet (i.e., cost constraint can decrease the nutrient densities of diets and influence food selection in ways that reproduce the food intake patterns observed among low socioeconomic groups. They suggest that economic measures will be needed to effectively improve the nutritional quality of diets consumed by these populations.

Constraint Embedding for Multibody System Dynamics

Science.gov (United States)

Jain, Abhinandan

2009-01-01

This paper describes a constraint embedding approach for the handling of local closure constraints in multibody system dynamics. The approach uses spatial operator techniques to eliminate local-loop constraints from the system and effectively convert the system into tree-topology systems. This approach allows the direct derivation of recursive O(N) techniques for solving the system dynamics and avoiding the expensive steps that would otherwise be required for handling the closedchain dynamics. The approach is very effective for systems where the constraints are confined to small-subgraphs within the system topology. The paper provides background on the spatial operator O(N) algorithms, the extensions for handling embedded constraints, and concludes with some examples of such constraints.

Optimization of regional water - power systems under cooling constraints and climate change

DEFF Research Database (Denmark)

Payet-burin, Raphaël; Bertoni, Federica; Davidsen, Claus

2018-01-01

Thermo-electric generation represents 70% of Europe's electricity production and 43% of water withdrawals, and is therefore a key element of the water-energy nexus. In 2003, 2006 and 2009, several thermal power plants had to be switched off in Europe because of heat waves, showing the need...... to assess the impact of climate change on cooling constraints of thermal power plants. An integrated water-power model of the Iberian Peninsula was developed in this study. It includes a physical hydrologic representation, spatially and temporally resolved water demands, management of water infrastructure...... and a simple power system model. The system was evaluated under present and future climatic conditions using different climate change scenarios. The cost of cooling constraints is found to increase by 220–640 million €/year, for the period 2046–2065 depending on the climate change scenario. Average available...

Trade-off between multiple constraints enables simultaneous formation of modules and hubs in neural systems.

Directory of Open Access Journals (Sweden)

Yuhan Chen

Full Text Available The formation of the complex network architecture of neural systems is subject to multiple structural and functional constraints. Two obvious but apparently contradictory constraints are low wiring cost and high processing efficiency, characterized by short overall wiring length and a small average number of processing steps, respectively. Growing evidence shows that neural networks are results from a trade-off between physical cost and functional value of the topology. However, the relationship between these competing constraints and complex topology is not well understood quantitatively. We explored this relationship systematically by reconstructing two known neural networks, Macaque cortical connectivity and C. elegans neuronal connections, from combinatory optimization of wiring cost and processing efficiency constraints, using a control parameter α, and comparing the reconstructed networks to the real networks. We found that in both neural systems, the reconstructed networks derived from the two constraints can reveal some important relations between the spatial layout of nodes and the topological connectivity, and match several properties of the real networks. The reconstructed and real networks had a similar modular organization in a broad range of α, resulting from spatial clustering of network nodes. Hubs emerged due to the competition of the two constraints, and their positions were close to, and partly coincided, with the real hubs in a range of α values. The degree of nodes was correlated with the density of nodes in their spatial neighborhood in both reconstructed and real networks. Generally, the rebuilt network matched a significant portion of real links, especially short-distant ones. These findings provide clear evidence to support the hypothesis of trade-off between multiple constraints on brain networks. The two constraints of wiring cost and processing efficiency, however, cannot explain all salient features in the real

Minimal Flavor Constraints for Technicolor

DEFF Research Database (Denmark)

Sakuma, Hidenori; Sannino, Francesco

2010-01-01

We analyze the constraints on the the vacuum polarization of the standard model gauge bosons from a minimal set of flavor observables valid for a general class of models of dynamical electroweak symmetry breaking. We will show that the constraints have a strong impact on the self-coupling and mas......We analyze the constraints on the the vacuum polarization of the standard model gauge bosons from a minimal set of flavor observables valid for a general class of models of dynamical electroweak symmetry breaking. We will show that the constraints have a strong impact on the self...

Temporal Concurrent Constraint Programming

DEFF Research Database (Denmark)

Nielsen, Mogens; Palamidessi, Catuscia; Valencia, Frank Dan

2002-01-01

The ntcc calculus is a model of non-deterministic temporal concurrent constraint programming. In this paper we study behavioral notions for this calculus. In the underlying computational model, concurrent constraint processes are executed in discrete time intervals. The behavioral notions studied...

SU-F-T-342: Dosimetric Constraint Prediction Guided Automatic Mulit-Objective Optimization for Intensity Modulated Radiotherapy

International Nuclear Information System (INIS)

Song, T; Zhou, L; Li, Y

2016-01-01

Purpose: For intensity modulated radiotherapy, the plan optimization is time consuming with difficulties of selecting objectives and constraints, and their relative weights. A fast and automatic multi-objective optimization algorithm with abilities to predict optimal constraints and manager their trade-offs can help to solve this problem. Our purpose is to develop such a framework and algorithm for a general inverse planning. Methods: There are three main components contained in this proposed multi-objective optimization framework: prediction of initial dosimetric constraints, further adjustment of constraints and plan optimization. We firstly use our previously developed in-house geometry-dosimetry correlation model to predict the optimal patient-specific dosimetric endpoints, and treat them as initial dosimetric constraints. Secondly, we build an endpoint(organ) priority list and a constraint adjustment rule to repeatedly tune these constraints from their initial values, until every single endpoint has no room for further improvement. Lastly, we implement a voxel-independent based FMO algorithm for optimization. During the optimization, a model for tuning these voxel weighting factors respecting to constraints is created. For framework and algorithm evaluation, we randomly selected 20 IMRT prostate cases from the clinic and compared them with our automatic generated plans, in both the efficiency and plan quality. Results: For each evaluated plan, the proposed multi-objective framework could run fluently and automatically. The voxel weighting factor iteration time varied from 10 to 30 under an updated constraint, and the constraint tuning time varied from 20 to 30 for every case until no more stricter constraint is allowed. The average total costing time for the whole optimization procedure is ∼30mins. By comparing the DVHs, better OAR dose sparing could be observed in automatic generated plan, for 13 out of the 20 cases, while others are with competitive

SU-F-T-342: Dosimetric Constraint Prediction Guided Automatic Mulit-Objective Optimization for Intensity Modulated Radiotherapy

Energy Technology Data Exchange (ETDEWEB)

Song, T; Zhou, L [Southern Medical University, Guangzhou, Guangdong (China); Li, Y [Beihang University, Beijing, Beijing (China)

2016-06-15

Purpose: For intensity modulated radiotherapy, the plan optimization is time consuming with difficulties of selecting objectives and constraints, and their relative weights. A fast and automatic multi-objective optimization algorithm with abilities to predict optimal constraints and manager their trade-offs can help to solve this problem. Our purpose is to develop such a framework and algorithm for a general inverse planning. Methods: There are three main components contained in this proposed multi-objective optimization framework: prediction of initial dosimetric constraints, further adjustment of constraints and plan optimization. We firstly use our previously developed in-house geometry-dosimetry correlation model to predict the optimal patient-specific dosimetric endpoints, and treat them as initial dosimetric constraints. Secondly, we build an endpoint(organ) priority list and a constraint adjustment rule to repeatedly tune these constraints from their initial values, until every single endpoint has no room for further improvement. Lastly, we implement a voxel-independent based FMO algorithm for optimization. During the optimization, a model for tuning these voxel weighting factors respecting to constraints is created. For framework and algorithm evaluation, we randomly selected 20 IMRT prostate cases from the clinic and compared them with our automatic generated plans, in both the efficiency and plan quality. Results: For each evaluated plan, the proposed multi-objective framework could run fluently and automatically. The voxel weighting factor iteration time varied from 10 to 30 under an updated constraint, and the constraint tuning time varied from 20 to 30 for every case until no more stricter constraint is allowed. The average total costing time for the whole optimization procedure is ∼30mins. By comparing the DVHs, better OAR dose sparing could be observed in automatic generated plan, for 13 out of the 20 cases, while others are with competitive

Efficient Searching with Linear Constraints

DEFF Research Database (Denmark)

Agarwal, Pankaj K.; Arge, Lars Allan; Erickson, Jeff

2000-01-01

We show how to preprocess a set S of points in d into an external memory data structure that efficiently supports linear-constraint queries. Each query is in the form of a linear constraint xd a0+∑d−1i=1 aixi; the data structure must report all the points of S that satisfy the constraint. This pr...

Constraint qualifications and optimality conditions for optimization problems with cardinality constraints

Czech Academy of Sciences Publication Activity Database

Červinka, Michal; Kanzow, Ch.; Schwartz, A.

2016-01-01

Roč. 160, č. 1 (2016), s. 353-377 ISSN 0025-5610 R&D Projects: GA ČR GAP402/12/1309; GA ČR GA15-00735S Institutional support: RVO:67985556 Keywords : Cardinality constraints * Constraint qualifications * Optimality conditions * KKT conditions * Strongly stationary points Subject RIV: BA - General Mathematics Impact factor: 2.446, year: 2016 http://library.utia.cas.cz/separaty/2016/MTR/cervinka-0461165.pdf

An assessment of energy efficiency based on environmental constraints and its influencing factors in China.

Science.gov (United States)

Chen, Yao; Xu, Jing-Ting

2018-05-03

The super-efficiency directional distance function (DDF) with data envelopment analysis (DEA) model (SEDDF-DEA) is more facilitative than to increase traditional method as a rise of energy efficiency in China, which is currently important energy development from Asia-pacific region countries. SEDDF-DEA is promoted as sustained total-factor energy efficiency (TFEE), value added outputs, and Malmquist-Luenberger productivity index (MLPI) to otherwise thorny environmental energy productivity problems with environmental constraint to concrete the means of regression model. This paper assesses the energy efficiency under environmental constraints using panel data covering the years of 2000-2015 in China. Considering the environmental constraints, the results showed that the average TFEE of the whole country followed an upward trend after 2006. The average MLPI score for the whole country increased by 10.57% during 2005-2010, which was mainly due to the progress made in developing and applying environmental technologies. The TFEE of the whole nation was promoted by the accumulation of capital stock, while it was suppressed by excessive production in secondary industries and foreign investment. The primary challenge for the northeast of China is to strengthen industrial transformation and upgrade traditional industries, as well as adjusting the economy and energy structure. The eastern and central regions of the country need to exploit clean- or low-energy industry to improve inefficiencies due to excessive consumption. The western region of China needs to implement renewable energy strategies to promote regional development.

Constraint Specialisation in Horn Clause Verification

DEFF Research Database (Denmark)

Kafle, Bishoksan; Gallagher, John Patrick

2015-01-01

We present a method for specialising the constraints in constrained Horn clauses with respect to a goal. We use abstract interpretation to compute a model of a query-answer transformation of a given set of clauses and a goal. The effect is to propagate the constraints from the goal top......-down and propagate answer constraints bottom-up. Our approach does not unfold the clauses at all; we use the constraints from the model to compute a specialised version of each clause in the program. The approach is independent of the abstract domain and the constraints theory underlying the clauses. Experimental...

Constraint specialisation in Horn clause verification

DEFF Research Database (Denmark)

Kafle, Bishoksan; Gallagher, John Patrick

2017-01-01

We present a method for specialising the constraints in constrained Horn clauses with respect to a goal. We use abstract interpretation to compute a model of a query–answer transformed version of a given set of clauses and a goal. The constraints from the model are then used to compute...... a specialised version of each clause. The effect is to propagate the constraints from the goal top-down and propagate answer constraints bottom-up. The specialisation procedure can be repeated to yield further specialisation. The approach is independent of the abstract domain and the constraint theory...

Reduction Of Constraints For Coupled Operations

International Nuclear Information System (INIS)

Raszewski, F.; Edwards, T.

2009-01-01

The homogeneity constraint was implemented in the Defense Waste Processing Facility (DWPF) Product Composition Control System (PCCS) to help ensure that the current durability models would be applicable to the glass compositions being processed during DWPF operations. While the homogeneity constraint is typically an issue at lower waste loadings (WLs), it may impact the operating windows for DWPF operations, where the glass forming systems may be limited to lower waste loadings based on fissile or heat load limits. In the sludge batch 1b (SB1b) variability study, application of the homogeneity constraint at the measurement acceptability region (MAR) limit eliminated much of the potential operating window for DWPF. As a result, Edwards and Brown developed criteria that allowed DWPF to relax the homogeneity constraint from the MAR to the property acceptance region (PAR) criterion, which opened up the operating window for DWPF operations. These criteria are defined as: (1) use the alumina constraint as currently implemented in PCCS (Al 2 O 3 (ge) 3 wt%) and add a sum of alkali constraint with an upper limit of 19.3 wt% (ΣM 2 O 2 O 3 constraint to 4 wt% (Al 2 O 3 (ge) 4 wt%). Herman et al. previously demonstrated that these criteria could be used to replace the homogeneity constraint for future sludge-only batches. The compositional region encompassing coupled operations flowsheets could not be bounded as these flowsheets were unknown at the time. With the initiation of coupled operations at DWPF in 2008, the need to revisit the homogeneity constraint was realized. This constraint was specifically addressed through the variability study for SB5 where it was shown that the homogeneity constraint could be ignored if the alumina and alkali constraints were imposed. Additional benefit could be gained if the homogeneity constraint could be replaced by the Al 2 O 3 and sum of alkali constraint for future coupled operations processing based on projections from Revision 14 of

A Case Study of Obsolescence Management Constraints During Development of Sustainment-Dominated Systems

Science.gov (United States)

Welch, Jonathan

This case study focused on obsolescence management constraints that occur during development of sustainment-dominated systems. Obsolescence management constraints were explored in systems expected to last 20 years or more and that tend to use commercial off-the-shelf products. The field of obsolescence has received little study, but obsolescence has a large cost for military systems. Because developing complex systems takes an average of 3 to 8 years, and commercial off-the-shelf components are typically obsolete within 3 to 5 years, military systems are often deployed with obsolescence issues that are transferred to the sustainment community to determine solutions. The main problem addressed in the study was to identify the constraints that have caused 70% of military systems under development to be obsolete when they are delivered. The purpose of the study was to use a qualitative case study to identify constraints that interfered with obsolescence management occurring during the development stages of a program. The participants of this case study were managers, subordinates, and end-users who were logistics and obsolescence experts. Researchers largely agree that proactive obsolescence management is a lower cost solution for sustainment-dominated systems. Program managers must understand the constraints and understand the impact of not implementing proactive solutions early in the development program lifecycle. The conclusion of the study found several constraints that prevented the development program from early adoption of obsolescence management theories, specifically pro-active theories. There were three major themes identified: (a) management commitment, (b) lack of details in the statement of work, and (c) vendor management. Each major theme includes several subthemes. The recommendation is future researchers should explore two areas: (a) comparing the cost of managing obsolescence early in the development process versus the costs of managing later, (b

Transmission and capacity pricing and constraints

International Nuclear Information System (INIS)

Fusco, M.

1999-01-01

A series of overhead viewgraphs accompanied this presentation which discussed the following issues regarding the North American electric power industry: (1) capacity pricing transmission constraints, (2) nature of transmission constraints, (3) consequences of transmission constraints, and (4) prices as market evidence. Some solutions suggested for pricing constraints included the development of contingent contracts, back-up power in supply regions, and new line capacity construction. 8 tabs., 20 figs

Characterization of surface topography and chemical composition of mini-implants

OpenAIRE

Knop, Luegya Amorim Henriques; Soares, Ana Prates; Shintcovsk, Ricardo Lima; Martins, Lidia Parsekian; Gandini Jr., Luiz Gonzaga

2015-01-01

Abstract Aim : To assess the surface topography and chemical composition of three brands of as-received mini-implants (SIN(r), Morelli(r), and Conexao(r)). Methods: Twelve mini-implants of each brand were analyzed by scanning electron microscopy and energy dispersive X-ray (EDX). Results: There was no significant differences among SIN(r), Morelli(r), and Conexao(r) mini-implants comparing their surface topography by visualization of SEM micrographs and analysis of scores. The EDX analysis ...

State Averages

Data.gov (United States)

U.S. Department of Health & Human Services — A list of a variety of averages for each state or territory as well as the national average, including each quality measure, staffing, fine amount and number of...

Evaluating Distributed Timing Constraints

DEFF Research Database (Denmark)

Kristensen, C.H.; Drejer, N.

1994-01-01

In this paper we describe a solution to the problem of implementing time-optimal evaluation of timing constraints in distributed real-time systems.......In this paper we describe a solution to the problem of implementing time-optimal evaluation of timing constraints in distributed real-time systems....

Thermomechanical constraints and constitutive formulations in thermoelasticity

Directory of Open Access Journals (Sweden)

Baek S.

2003-01-01

Full Text Available We investigate three classes of constraints in a thermoelastic body: (i a deformation-temperature constraint, (ii a deformation-entropy constraint, and (iii a deformation-energy constraint. These constraints are obtained as limits of unconstrained thermoelastic materials and we show that constraints (ii and (iii are equivalent. By using a limiting procedure, we show that for the constraint (i, the entropy plays the role of a Lagrange multiplier while for (ii and (iii, the absolute temperature plays the role of Lagrange multiplier. We further demonstrate that the governing equations for materials subject to constraint (i are identical to those of an unconstrained material whose internal energy is an affine function of the entropy, while those for materials subject to constraints (ii and (iii are identical to those of an unstrained material whose Helmholtz potential is affine in the absolute temperature. Finally, we model the thermoelastic response of a peroxide-cured vulcanizate of natural rubber and show that imposing the constraint in which the volume change depends only on the internal energy leads to very good predictions (compared to experimental results of the stress and temperature response under isothermal and isentropic conditions.

Pathloss Measurements and Modeling for UAVs Connected to Cellular Networks

DEFF Research Database (Denmark)

Amorim, Rafhael Medeiros de; Mogensen, Preben Elgaard; Sørensen, Troels Bundgaard

2017-01-01

. The measurements were conducted in an operating LTE network (850 MHz), using a commercial cell phone, placed inside the frame of the UAV. Trials were conducted for UAV flying at 5 different heights measured above ground level (20, 40, 60, 80 and 100m) and a pathloss regression line was obtained from results. Then......This paper assess field measurements, as part of the investigation of the suitability of cellular networks for providing connectivity to UAVs (unmanned aerial vehicles). Evaluation is done by means of field measurements obtained in a rural environment in Denmark with an airbone UAV......, downlink (DL) SINR levels obtained during flight measurements are also presented. An important result obtained from the measurents reveal that there is a height-related DL SINR degradation. Three main sources of uncertainty on the pathloss model that could be responsible for the SINR degradation are also...

Transmit selection algorithms for imperfect threshold-based receive MRC in the presence of co-channel interference

KAUST Repository

Radaydeh, Redha Mahmoud Mesleh

2010-01-01

The performance of transmit antenna selection for threshold-based maximal ratio combining (MRC) diversity receivers in the presence of multiple co-channel interfering signals is studied. The impact of imperfect channel estimation of desired user signals is considered, and the effect of phase and time misalignments between desired and undesired signals is incorporated in the analysis. Precise formulation for Nakagami-m faded interfering signals is presented. The analysis is applicable for arbitrary transmit antenna selection, which is based on the receiver combined signal-to-noise ratios (SNRs) or combined signal-to-interference-plus-noise ratios (SINRs) for different transmit channels. New expressions for the distribution of combined SINR and outage probability performance are derived considering SNR-based as well as SINR-based selection algorithms. The results can be used to study the performance of different system architectures under various channel conditions when the implementation complexity is of interest. ©2010 IEEE.

Asymptotically optimum multialternative sequential procedures for discernment of processes minimizing average length of observations

Science.gov (United States)

Fishman, M. M.

1985-01-01

The problem of multialternative sequential discernment of processes is formulated in terms of conditionally optimum procedures minimizing the average length of observations, without any probabilistic assumptions about any one occurring process, rather than in terms of Bayes procedures minimizing the average risk. The problem is to find the procedure that will transform inequalities into equalities. The problem is formulated for various models of signal observation and data processing: (1) discernment of signals from background interference by a multichannel system; (2) discernment of pulse sequences with unknown time delay; (3) discernment of harmonic signals with unknown frequency. An asymptotically optimum sequential procedure is constructed which compares the statistics of the likelihood ratio with the mean-weighted likelihood ratio and estimates the upper bound for conditional average lengths of observations. This procedure is shown to remain valid as the upper bound for the probability of erroneous partial solutions decreases approaching zero and the number of hypotheses increases approaching infinity. It also remains valid under certain special constraints on the probability such as a threshold. A comparison with a fixed-length procedure reveals that this sequential procedure decreases the length of observations to one quarter, on the average, when the probability of erroneous partial solutions is low.

Impact of a cost constraint on nutritionally adequate food choices for French women: an analysis by linear programming.

Science.gov (United States)

Darmon, Nicole; Ferguson, Elaine L; Briend, André

2006-01-01

To predict, for French women, the impact of a cost constraint on the food choices required to provide a nutritionally adequate diet. Isocaloric daily diets fulfilling both palatability and nutritional constraints were modeled in linear programming, using different cost constraint levels. For each modeled diet, total departure from an observed French population's average food group pattern ("mean observed diet") was minimized. To achieve the nutritional recommendations without a cost constraint, the modeled diet provided more energy from fish, fresh fruits and green vegetables and less energy from animal fats and cheese than the "mean observed diet." Introducing and strengthening a cost constraint decreased the energy provided by meat, fresh vegetables, fresh fruits, vegetable fat, and yogurts and increased the energy from processed meat, eggs, offal, and milk. For the lowest cost diet (ie, 3.18 euros/d), marked changes from the "mean observed diet" were required, including a marked reduction in the amount of energy from fresh fruits (-85%) and green vegetables (-70%), and an increase in the amount of energy from nuts, dried fruits, roots, legumes, and fruit juices. Nutrition education for low-income French women must emphasize these affordable food choices.

Machine tongues. X. Constraint languages

Energy Technology Data Exchange (ETDEWEB)

Levitt, D.

Constraint languages and programming environments will help the designer produce a lucid description of a problem domain, and then of particular situations and problems in it. Early versions of these languages were given descriptions of real world domain constraints, like the operation of electrical and mechanical parts. More recently, the author has automated a vocabulary for describing musical jazz phrases, using constraint language as a jazz improviser. General constraint languages will handle all of these domains. Once the model is in place, the system will connect built-in code fragments and algorithms to answer questions about situations; that is, to help solve problems. Bugs will surface not in code, but in designs themselves. 15 references.

Constraints on food chain length arising from regional metacommunity dynamics

Science.gov (United States)

Calcagno, Vincent; Massol, François; Mouquet, Nicolas; Jarne, Philippe; David, Patrice

2011-01-01

Classical ecological theory has proposed several determinants of food chain length, but the role of metacommunity dynamics has not yet been fully considered. By modelling patchy predator–prey metacommunities with extinction–colonization dynamics, we identify two distinct constraints on food chain length. First, finite colonization rates limit predator occupancy to a subset of prey-occupied sites. Second, intrinsic extinction rates accumulate along trophic chains. We show how both processes concur to decrease maximal and average food chain length in metacommunities. This decrease is mitigated if predators track their prey during colonization (habitat selection) and can be reinforced by top-down control of prey vital rates (especially extinction). Moreover, top-down control of colonization and habitat selection can interact to produce a counterintuitive positive relationship between perturbation rate and food chain length. Our results show how novel limits to food chain length emerge in spatially structured communities. We discuss the connections between these constraints and the ones commonly discussed, and suggest ways to test for metacommunity effects in food webs. PMID:21367786

MO-DE-207A-05: Dictionary Learning Based Reconstruction with Low-Rank Constraint for Low-Dose Spectral CT

International Nuclear Information System (INIS)

Xu, Q; Liu, H; Xing, L; Yu, H; Wang, G

2016-01-01

Purpose: Spectral CT enabled by an energy-resolved photon-counting detector outperforms conventional CT in terms of material discrimination, contrast resolution, etc. One reconstruction method for spectral CT is to generate a color image from a reconstructed component in each energy channel. However, given the radiation dose, the number of photons in each channel is limited, which will result in strong noise in each channel and affect the final color reconstruction. Here we propose a novel dictionary learning method for spectral CT that combines dictionary-based sparse representation method and the patch based low-rank constraint to simultaneously improve the reconstruction in each channel and to address the inter-channel correlations to further improve the reconstruction. Methods: The proposed method has two important features: (1) guarantee of the patch based sparsity in each energy channel, which is the result of the dictionary based sparse representation constraint; (2) the explicit consideration of the correlations among different energy channels, which is realized by patch-by-patch nuclear norm-based low-rank constraint. For each channel, the dictionary consists of two sub-dictionaries. One is learned from the average of the images in all energy channels, and the other is learned from the average of the images in all energy channels except the current channel. With average operation to reduce noise, these two dictionaries can effectively preserve the structural details and get rid of artifacts caused by noise. Combining them together can express all structural information in current channel. Results: Dictionary learning based methods can obtain better results than FBP and the TV-based method. With low-rank constraint, the image quality can be further improved in the channel with more noise. The final color result by the proposed method has the best visual quality. Conclusion: The proposed method can effectively improve the image quality of low-dose spectral

MO-DE-207A-05: Dictionary Learning Based Reconstruction with Low-Rank Constraint for Low-Dose Spectral CT

Energy Technology Data Exchange (ETDEWEB)

Xu, Q [Xi’an Jiaotong University, Xi’an (China); Stanford University School of Medicine, Stanford, CA (United States); Liu, H; Xing, L [Stanford University School of Medicine, Stanford, CA (United States); Yu, H [University of Massachusetts Lowell, Lowell, MA (United States); Wang, G [Rensselaer Polytechnic Instute., Troy, NY (United States)

2016-06-15

Purpose: Spectral CT enabled by an energy-resolved photon-counting detector outperforms conventional CT in terms of material discrimination, contrast resolution, etc. One reconstruction method for spectral CT is to generate a color image from a reconstructed component in each energy channel. However, given the radiation dose, the number of photons in each channel is limited, which will result in strong noise in each channel and affect the final color reconstruction. Here we propose a novel dictionary learning method for spectral CT that combines dictionary-based sparse representation method and the patch based low-rank constraint to simultaneously improve the reconstruction in each channel and to address the inter-channel correlations to further improve the reconstruction. Methods: The proposed method has two important features: (1) guarantee of the patch based sparsity in each energy channel, which is the result of the dictionary based sparse representation constraint; (2) the explicit consideration of the correlations among different energy channels, which is realized by patch-by-patch nuclear norm-based low-rank constraint. For each channel, the dictionary consists of two sub-dictionaries. One is learned from the average of the images in all energy channels, and the other is learned from the average of the images in all energy channels except the current channel. With average operation to reduce noise, these two dictionaries can effectively preserve the structural details and get rid of artifacts caused by noise. Combining them together can express all structural information in current channel. Results: Dictionary learning based methods can obtain better results than FBP and the TV-based method. With low-rank constraint, the image quality can be further improved in the channel with more noise. The final color result by the proposed method has the best visual quality. Conclusion: The proposed method can effectively improve the image quality of low-dose spectral

Bistability and Biofilm Formation in Bacillus subtilis

Science.gov (United States)

Chai, Yunrong; Chu, Frances; Kolter, Roberto; Losick, Richard

2008-01-01

Summary Biofilms of Bacillus subtilis consist of long chains of cells that are held together in bundles by an extracellular matrix of exopolysaccharide and the protein TasA. The exopolysaccharide is produced by enzymes encoded by the epsA-O operon and the gene encoding TasA is located in the yqxM-sipW-tasA operon. Both operons are under the control of the repressor SinR. Derepression is mediated by the antirepressor SinI, which binds to SinR with a 1:1 stoichiometry. Paradoxically, in medium promoting derepression of the matrix operons, the overall concentration of SinR in the culture greatly exceeded that of SinI. We show that under biofilm-promoting conditions sinI, which is under the control of the response regulator Spo0A, was expressed only in a small subpopulation of cells, whereas sinR was expressed in almost all cells. Activation of Spo0A is known to be subject to a bistable switch, and we infer that SinI reaches levels sufficient to trigger matrix production only in the subpopulation of cells in which Spo0A is active. Additionally, evidence suggests that sinI is expressed at intermediate, but not low or high, levels of Spo0A activity, which may explain why certain nutritional conditions are more effective in promoting biofilm formation than others. PMID:18047568

Ant colony optimization and constraint programming

CERN Document Server

Solnon, Christine

2013-01-01

Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search

Causality Constraints in Conformal Field Theory

CERN Multimedia

CERN. Geneva

2015-01-01

Causality places nontrivial constraints on QFT in Lorentzian signature, for example fixing the signs of certain terms in the low energy Lagrangian. In d-dimensional conformal field theory, we show how such constraints are encoded in crossing symmetry of Euclidean correlators, and derive analogous constraints directly from the conformal bootstrap (analytically). The bootstrap setup is a Lorentzian four-point function corresponding to propagation through a shockwave. Crossing symmetry fixes the signs of certain log terms that appear in the conformal block expansion, which constrains the interactions of low-lying operators. As an application, we use the bootstrap to rederive the well known sign constraint on the (∂φ)4 coupling in effective field theory, from a dual CFT. We also find constraints on theories with higher spin conserved currents. Our analysis is restricted to scalar correlators, but we argue that similar methods should also impose nontrivial constraints on the interactions of spinni...

Causality constraints in conformal field theory

Energy Technology Data Exchange (ETDEWEB)

Hartman, Thomas; Jain, Sachin; Kundu, Sandipan [Department of Physics, Cornell University,Ithaca, New York (United States)

2016-05-17

Causality places nontrivial constraints on QFT in Lorentzian signature, for example fixing the signs of certain terms in the low energy Lagrangian. In d dimensional conformal field theory, we show how such constraints are encoded in crossing symmetry of Euclidean correlators, and derive analogous constraints directly from the conformal bootstrap (analytically). The bootstrap setup is a Lorentzian four-point function corresponding to propagation through a shockwave. Crossing symmetry fixes the signs of certain log terms that appear in the conformal block expansion, which constrains the interactions of low-lying operators. As an application, we use the bootstrap to rederive the well known sign constraint on the (∂ϕ){sup 4} coupling in effective field theory, from a dual CFT. We also find constraints on theories with higher spin conserved currents. Our analysis is restricted to scalar correlators, but we argue that similar methods should also impose nontrivial constraints on the interactions of spinning operators.

Learning and Parallelization Boost Constraint Search

Science.gov (United States)

Yun, Xi

2013-01-01

Constraint satisfaction problems are a powerful way to abstract and represent academic and real-world problems from both artificial intelligence and operations research. A constraint satisfaction problem is typically addressed by a sequential constraint solver running on a single processor. Rather than construct a new, parallel solver, this work…

Fuzzy Constraint-Based Agent Negotiation

Institute of Scientific and Technical Information of China (English)

Menq-Wen Lin; K. Robert Lai; Ting-Jung Yu

2005-01-01

Conflicts between two or more parties arise for various reasons and perspectives. Thus, resolution of conflicts frequently relies on some form of negotiation. This paper presents a general problem-solving framework for modeling multi-issue multilateral negotiation using fuzzy constraints. Agent negotiation is formulated as a distributed fuzzy constraint satisfaction problem (DFCSP). Fuzzy constrains are thus used to naturally represent each agent's desires involving imprecision and human conceptualization, particularly when lexical imprecision and subjective matters are concerned. On the other hand, based on fuzzy constraint-based problem-solving, our approach enables an agent not only to systematically relax fuzzy constraints to generate a proposal, but also to employ fuzzy similarity to select the alternative that is subject to its acceptability by the opponents. This task of problem-solving is to reach an agreement that benefits all agents with a high satisfaction degree of fuzzy constraints, and move towards the deal more quickly since their search focuses only on the feasible solution space. An application to multilateral negotiation of a travel planning is provided to demonstrate the usefulness and effectiveness of our framework.

Constraint-based scheduling

Science.gov (United States)

Zweben, Monte

1993-01-01

The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.

Notes on Timed Concurrent Constraint Programming

DEFF Research Database (Denmark)

Nielsen, Mogens; Valencia, Frank D.

2004-01-01

and program reactive systems. This note provides a comprehensive introduction to the background for and central notions from the theory of tccp. Furthermore, it surveys recent results on a particular tccp calculus, ntcc, and it provides a classification of the expressive power of various tccp languages.......A constraint is a piece of (partial) information on the values of the variables of a system. Concurrent constraint programming (ccp) is a model of concurrency in which agents (also called processes) interact by telling and asking information (constraints) to and from a shared store (a constraint...

The constraints

International Nuclear Information System (INIS)

Jones, P.M.S.

1987-01-01

There are considerable incentives for the use of nuclear in preference to other sources for base load electricity generation in most of the developed world. These are economic, strategic, environmental and climatic. However, there are two potential constraints which could hinder the development of nuclear power to its full economic potential. These are public opinion and financial regulations which distort the nuclear economic advantage. The concerns of the anti-nuclear lobby are over safety, (especially following the Chernobyl accident), the management of radioactive waste, the potential effects of large scale exposure of the population to radiation and weapons proliferation. These are discussed. The financial constraint is over two factors, the availability of funds and the perception of cost, both of which are discussed. (U.K.)

A Regularization SAA Scheme for a Stochastic Mathematical Program with Complementarity Constraints

Directory of Open Access Journals (Sweden)

Yu-xin Li

2014-01-01

Full Text Available To reflect uncertain data in practical problems, stochastic versions of the mathematical program with complementarity constraints (MPCC have drawn much attention in the recent literature. Our concern is the detailed analysis of convergence properties of a regularization sample average approximation (SAA method for solving a stochastic mathematical program with complementarity constraints (SMPCC. The analysis of this regularization method is carried out in three steps: First, the almost sure convergence of optimal solutions of the regularized SAA problem to that of the true problem is established by the notion of epiconvergence in variational analysis. Second, under MPCC-MFCQ, which is weaker than MPCC-LICQ, we show that any accumulation point of Karash-Kuhn-Tucker points of the regularized SAA problem is almost surely a kind of stationary point of SMPCC as the sample size tends to infinity. Finally, some numerical results are reported to show the efficiency of the method proposed.

Developmental constraints on behavioural flexibility.

Science.gov (United States)

Holekamp, Kay E; Swanson, Eli M; Van Meter, Page E

2013-05-19

We suggest that variation in mammalian behavioural flexibility not accounted for by current socioecological models may be explained in part by developmental constraints. From our own work, we provide examples of constraints affecting variation in behavioural flexibility, not only among individuals, but also among species and higher taxonomic units. We first implicate organizational maternal effects of androgens in shaping individual differences in aggressive behaviour emitted by female spotted hyaenas throughout the lifespan. We then compare carnivores and primates with respect to their locomotor and craniofacial adaptations. We inquire whether antagonistic selection pressures on the skull might impose differential functional constraints on evolvability of skulls and brains in these two orders, thus ultimately affecting behavioural flexibility in each group. We suggest that, even when carnivores and primates would theoretically benefit from the same adaptations with respect to behavioural flexibility, carnivores may nevertheless exhibit less behavioural flexibility than primates because of constraints imposed by past adaptations in the morphology of the limbs and skull. Phylogenetic analysis consistent with this idea suggests greater evolutionary lability in relative brain size within families of primates than carnivores. Thus, consideration of developmental constraints may help elucidate variation in mammalian behavioural flexibility.

Generalized Pauli constraints in small atoms

DEFF Research Database (Denmark)

Schilling, Christian; Altunbulak, Murat; Knecht, Stefan

2018-01-01

investigations have found evidence that these constraints are exactly saturated in several physically relevant systems, e.g., in a certain electronic state of the beryllium atom. It has been suggested that, in such cases, the constraints, rather than the details of the Hamiltonian, dictate the system......'s qualitative behavior. Here, we revisit this question with state-of-the-art numerical methods for small atoms. We find that the constraints are, in fact, not exactly saturated, but that they lie much closer to the surface defined by the constraints than the geometry of the problem would suggest. While...

Learning With Mixed Hard/Soft Pointwise Constraints.

Science.gov (United States)

Gnecco, Giorgio; Gori, Marco; Melacci, Stefano; Sanguineti, Marcello

2015-09-01

A learning paradigm is proposed and investigated, in which the classical framework of learning from examples is enhanced by the introduction of hard pointwise constraints, i.e., constraints imposed on a finite set of examples that cannot be violated. Such constraints arise, e.g., when requiring coherent decisions of classifiers acting on different views of the same pattern. The classical examples of supervised learning, which can be violated at the cost of some penalization (quantified by the choice of a suitable loss function) play the role of soft pointwise constraints. Constrained variational calculus is exploited to derive a representer theorem that provides a description of the functional structure of the optimal solution to the proposed learning paradigm. It is shown that such an optimal solution can be represented in terms of a set of support constraints, which generalize the concept of support vectors and open the doors to a novel learning paradigm, called support constraint machines. The general theory is applied to derive the representation of the optimal solution to the problem of learning from hard linear pointwise constraints combined with soft pointwise constraints induced by supervised examples. In some cases, closed-form optimal solutions are obtained.

Linear precoding based on polynomial expansion: reducing complexity in massive MIMO

KAUST Repository

Mueller, Axel; Kammoun, Abla; Bjö rnson, Emil; Debbah, Mé rouane

2016-01-01

By deriving new random matrix results, we obtain a deterministic expression for the asymptotic signal-to-interference-and-noise ratio (SINR) achieved by TPE precoding in massive MIMO systems. Furthermore, we provide a closed-form expression for the polynomial coefficients that maximizes this SINR. To maintain a fixed per-user rate loss as compared to RZF, the polynomial degree does not need to scale with the system, but it should be increased with the quality of the channel knowledge and the signal-to-noise ratio.

Ultra-Reliable Communications in Failure-Prone Realistic Networks

DEFF Research Database (Denmark)

Gerardino, Guillermo Andrés Pocovi; Lauridsen, Mads; Alvarez, Beatriz Soret

2016-01-01

We investigate the potential of different diversity and interference management techniques to achieve the required downlink SINR outage probability for ultra-reliable communications. The evaluation is performed in a realistic network deployment based on site-specific data from a European capital....... Micro and macroscopic diversity techniques are proved to be important enablers of ultra-reliable communications. Particularly, it is shown how a 4x4 MIMO scheme with three orders of macroscopic diversity can achieve the required SINR outage performance. Smaller gains are obtained from interference...

Constraint-based Word Segmentation for Chinese

DEFF Research Database (Denmark)

Christiansen, Henning; Bo, Li

2014-01-01

-hoc and statistically based methods. In this paper, we show experiments of implementing different approaches to CWSP in the framework of CHR Grammars [Christiansen, 2005] that provides a constraint solving approach to language analysis. CHR Grammars are based upon Constraint Handling Rules, CHR [Frühwirth, 1998, 2009......], which is a declarative, high-level programming language for specification and implementation of constraint solvers....

Generalized Pauli constraints in small atoms

Science.gov (United States)

Schilling, Christian; Altunbulak, Murat; Knecht, Stefan; Lopes, Alexandre; Whitfield, James D.; Christandl, Matthias; Gross, David; Reiher, Markus

2018-05-01

The natural occupation numbers of fermionic systems are subject to nontrivial constraints, which include and extend the original Pauli principle. A recent mathematical breakthrough has clarified their mathematical structure and has opened up the possibility of a systematic analysis. Early investigations have found evidence that these constraints are exactly saturated in several physically relevant systems, e.g., in a certain electronic state of the beryllium atom. It has been suggested that, in such cases, the constraints, rather than the details of the Hamiltonian, dictate the system's qualitative behavior. Here, we revisit this question with state-of-the-art numerical methods for small atoms. We find that the constraints are, in fact, not exactly saturated, but that they lie much closer to the surface defined by the constraints than the geometry of the problem would suggest. While the results seem incompatible with the statement that the generalized Pauli constraints drive the behavior of these systems, they suggest that the qualitatively correct wave-function expansions can in some systems already be obtained on the basis of a limited number of Slater determinants, which is in line with numerical evidence from quantum chemistry.

University Course Timetabling using Constraint Programming

Directory of Open Access Journals (Sweden)

Hadi Shahmoradi

2017-03-01

Full Text Available University course timetabling problem is a challenging and time-consuming task on the overall structure of timetable in every academic environment. The problem deals with many factors such as the number of lessons, classes, teachers, students and working time, and these are influenced by some hard and soft constraints. The aim of solving this problem is to assign courses and classes to teachers and students, so that the restrictions are held. In this paper, a constraint programming method is proposed to satisfy maximum constraints and expectation, in order to address university timetabling problem. For minimizing the penalty of soft constraints, a cost function is introduced and AHP method is used for calculating its coefficients. The proposed model is tested on department of management, University of Isfahan dataset using OPL on the IBM ILOG CPLEX Optimization Studio platform. A statistical analysis has been conducted and shows the performance of the proposed approach in satisfying all hard constraints and also the satisfying degree of the soft constraints is on maximum desirable level. The running time of the model is less than 20 minutes that is significantly better than the non-automated ones.

What prevents phenological adjustment to climate change in migrant bird species? Evidence against the ``arrival constraint'' hypothesis

Science.gov (United States)

Goodenough, Anne E.; Hart, Adam G.; Elliot, Simon L.

2011-01-01

Phenological studies have demonstrated changes in the timing of seasonal events across multiple taxonomic groups as the climate warms. Some northern European migrant bird populations, however, show little or no significant change in breeding phenology, resulting in synchrony with key food sources becoming mismatched. This phenological inertia has often been ascribed to migration constraints (i.e. arrival date at breeding grounds preventing earlier laying). This has been based primarily on research in The Netherlands and Germany where time between arrival and breeding is short (often as few as 9 days). Here, we test the arrival constraint hypothesis over a 15-year period for a U.K. pied flycatcher ( Ficedula hypoleuca) population where laying date is not constrained by arrival as the period between arrival and breeding is substantial and consistent (average 27 ± 4.57 days SD). Despite increasing spring temperatures and quantifiably stronger selection for early laying on the basis of number of offspring to fledge, we found no significant change in breeding phenology, in contrast with co-occurring resident blue tits ( Cyanistes caeruleus). We discuss possible non-migratory constraints on phenological adjustment, including limitations on plasticity, genetic constraints and competition, as well as the possibility of counter-selection pressures relating to adult survival, longevity or future reproductive success. We propose that such factors need to be considered in conjunction with the arrival constraint hypothesis.

What prevents phenological adjustment to climate change in migrant bird species? Evidence against the "arrival constraint" hypothesis.

Science.gov (United States)

Goodenough, Anne E; Hart, Adam G; Elliot, Simon L

2011-01-01

Phenological studies have demonstrated changes in the timing of seasonal events across multiple taxonomic groups as the climate warms. Some northern European migrant bird populations, however, show little or no significant change in breeding phenology, resulting in synchrony with key food sources becoming mismatched. This phenological inertia has often been ascribed to migration constraints (i.e. arrival date at breeding grounds preventing earlier laying). This has been based primarily on research in The Netherlands and Germany where time between arrival and breeding is short (often as few as 9 days). Here, we test the arrival constraint hypothesis over a 15-year period for a U.K. pied flycatcher (Ficedula hypoleuca) population where laying date is not constrained by arrival as the period between arrival and breeding is substantial and consistent (average 27 ± 4.57 days SD). Despite increasing spring temperatures and quantifiably stronger selection for early laying on the basis of number of offspring to fledge, we found no significant change in breeding phenology, in contrast with co-occurring resident blue tits (Cyanistes caeruleus). We discuss possible non-migratory constraints on phenological adjustment, including limitations on plasticity, genetic constraints and competition, as well as the possibility of counter-selection pressures relating to adult survival, longevity or future reproductive success. We propose that such factors need to be considered in conjunction with the arrival constraint hypothesis.

Psychological constraints on egalitarianism

DEFF Research Database (Denmark)

Kasperbauer, Tyler Joshua

2015-01-01

processes motivating people to resist various aspects of egalitarianism. I argue for two theses, one normative and one descriptive. The normative thesis holds that egalitarians must take psychological constraints into account when constructing egalitarian ideals. I draw from non-ideal theories in political...... philosophy, which aim to construct moral goals with current social and political constraints in mind, to argue that human psychology must be part of a non-ideal theory of egalitarianism. The descriptive thesis holds that the most fundamental psychological challenge to egalitarian ideals comes from what......Debates over egalitarianism for the most part are not concerned with constraints on achieving an egalitarian society, beyond discussions of the deficiencies of egalitarian theory itself. This paper looks beyond objections to egalitarianism as such and investigates the relevant psychological...

Constraint Programming for Context Comprehension

DEFF Research Database (Denmark)

Christiansen, Henning

2014-01-01

A close similarity is demonstrated between context comprehension, such as discourse analysis, and constraint programming. The constraint store takes the role of a growing knowledge base learned throughout the discourse, and a suitable con- straint solver does the job of incorporating new pieces...

A Smoothing Algorithm for a New Two-Stage Stochastic Model of Supply Chain Based on Sample Average Approximation

OpenAIRE

Liu Yang; Yao Xiong; Xiao-jiao Tong

2017-01-01

We construct a new two-stage stochastic model of supply chain with multiple factories and distributors for perishable product. By introducing a second-order stochastic dominance (SSD) constraint, we can describe the preference consistency of the risk taker while minimizing the expected cost of company. To solve this problem, we convert it into a one-stage stochastic model equivalently; then we use sample average approximation (SAA) method to approximate the expected values of the underlying r...

Some cosmological constraints on gauge theories

International Nuclear Information System (INIS)

Schramm, D.N.

1983-01-01

In these lectures, a review is made of various constraints cosmology may place on gauge theories. Particular emphasis is placed on those constraints obtainable from Big Bang Nucleosynthesis, with only brief mention made of Big Bang Baryosynthesis. There is also a considerable discussion of astrophysical constraints on masses and lifetimes of neutrinos with specific mention of the 'missing mass (light)' problem of galactic dynamics. (orig./HSI)

Reversal of an Epigenetic Switch Governing Cell Chaining in Bacillus subtilis by Protein Instability

Science.gov (United States)

Chai, Yunrong; Kolter, Roberto; Losick, Richard

2010-01-01

Bacillus subtilis forms long chains of cells during growth and biofilm formation. Cell separation is mediated by autolysins, whose genes are under the negative control of a heteromeric complex composed of the proteins SinR and SlrR. Formation of the SinR•SlrR complex is governed by a self-reinforcing, double-negative feedback loop in which SinR represses the gene for SlrR and SlrR, by forming the SinR•SlrR complex, titrates SinR and prevents it from repressing slrR. The loop is a bistable switch and exists in a SlrRLOW state in which autolysin genes are on, and a SlrRHIGH state in which autolysin genes are repressed by SinR•SlrR. Cells in the SlrRLOW state are driven into the SlrRHIGH state by SinI, an antirepressor that binds to and inhibits SinR. However, the mechanism by which cells in the SlrRHIGH state revert back to the SlrRLOW state is unknown. We report that SlrR is proteolytically unstable and present evidence that self-cleavage via a LexA-like autopeptidase and ClpC contribute to its degradation. Cells producing a self-cleavage-resistant mutant of SlrR exhibited more persistent chaining during growth and yielded biofilms with enhanced structural complexity. We propose that degradation of SlrR allows cells to switch from the SlrRHIGH to the SlrRLOW state. PMID:20923420

Dynamics and causality constraints

International Nuclear Information System (INIS)

Sousa, Manoelito M. de

2001-04-01

The physical meaning and the geometrical interpretation of causality implementation in classical field theories are discussed. Causality in field theory are kinematical constraints dynamically implemented via solutions of the field equation, but in a limit of zero-distance from the field sources part of these constraints carries a dynamical content that explains old problems of classical electrodynamics away with deep implications to the nature of physicals interactions. (author)

Averaging models: parameters estimation with the R-Average procedure

Directory of Open Access Journals (Sweden)

S. Noventa

2010-01-01

Full Text Available The Functional Measurement approach, proposed within the theoretical framework of Information Integration Theory (Anderson, 1981, 1982, can be a useful multi-attribute analysis tool. Compared to the majority of statistical models, the averaging model can account for interaction effects without adding complexity. The R-Average method (Vidotto & Vicentini, 2007 can be used to estimate the parameters of these models. By the use of multiple information criteria in the model selection procedure, R-Average allows for the identification of the best subset of parameters that account for the data. After a review of the general method, we present an implementation of the procedure in the framework of R-project, followed by some experiments using a Monte Carlo method.

Data assimilation with inequality constraints

Science.gov (United States)

Thacker, W. C.

If values of variables in a numerical model are limited to specified ranges, these restrictions should be enforced when data are assimilated. The simplest option is to assimilate without regard for constraints and then to correct any violations without worrying about additional corrections implied by correlated errors. This paper addresses the incorporation of inequality constraints into the standard variational framework of optimal interpolation with emphasis on our limited knowledge of the underlying probability distributions. Simple examples involving only two or three variables are used to illustrate graphically how active constraints can be treated as error-free data when background errors obey a truncated multi-normal distribution. Using Lagrange multipliers, the formalism is expanded to encompass the active constraints. Two algorithms are presented, both relying on a solution ignoring the inequality constraints to discover violations to be enforced. While explicitly enforcing a subset can, via correlations, correct the others, pragmatism based on our poor knowledge of the underlying probability distributions suggests the expedient of enforcing them all explicitly to avoid the computationally expensive task of determining the minimum active set. If additional violations are encountered with these solutions, the process can be repeated. Simple examples are used to illustrate the algorithms and to examine the nature of the corrections implied by correlated errors.

Statistical analysis of probabilistic models of software product lines with quantitative constraints

DEFF Research Database (Denmark)

Beek, M.H. ter; Legay, A.; Lluch Lafuente, Alberto

2015-01-01

We investigate the suitability of statistical model checking for the analysis of probabilistic models of software product lines with complex quantitative constraints and advanced feature installation options. Such models are specified in the feature-oriented language QFLan, a rich process algebra...... of certain behaviour to the expected average cost of products. This is supported by a Maude implementation of QFLan, integrated with the SMT solver Z3 and the distributed statistical model checker MultiVeStA. Our approach is illustrated with a bikes product line case study....

Testing instrument validity for LATE identification based on inequality moment constraints

DEFF Research Database (Denmark)

Huber, Martin; Mellace, Giovanni

2015-01-01

We derive testable implications of instrument validity in just identified treatment effect models with endogeneity and consider several tests. The identifying assumptions of the local average treatment effect allow us to both point identify and bound the mean potential outcomes (i) of the always...... takers under treatment and (ii) of the never takers under non-treatment. The point identified means must lie within their respective bounds, which provides us with four testable inequality moment constraints. Finally, we adapt our testing framework to the identification of distributional features....... A brief simulation study and an application to labor market data are also provided....

C-mixture and multi-constraints based genetic algorithm for collaborative data publishing

Directory of Open Access Journals (Sweden)

Yogesh R. Kulkarni

2018-04-01

Full Text Available Due to increasing need of using distributed databases, high demand presents on sharing data to easily update and access the useful information without any interruption. The sharing of distributed databases causes a serious issue of securing information since the databases consist of sensitive personal information. To preserve the sensitive information and at the same time, releasing the useful information, a significant effort is made by the researchers under privacy preserving data publishing that have been receiving considerable attention in recent years. In this work, a new privacy measure, called c-mixture is introduced to maintain the privacy constraint without affecting utility of the database. In order to apply the proposed privacy measure to privacy preserving data publishing, a new algorithm called, CPGEN is developed using genetic algorithm and multi-objective constraints. The proposed multi-objective optimization considered the multiple privacy constraints along with the utility measurement to measure the importance. Also, the proposed CPGEN is adapted to handle the cold-start problem which commonly happened in distributed databases. The proposed algorithm is experimented with adult dataset and quantitative performance is analyzed using generalized information loss and average equivalence class size metric. From the experimentation, we proved that the proposed algorithm maintained the privacy and utility as compared with the existing algorithm. Keywords: Privacy, Utility, Distributed databases, Data publishing, Optimization, Sensitive information

A Smoothing Algorithm for a New Two-Stage Stochastic Model of Supply Chain Based on Sample Average Approximation

Directory of Open Access Journals (Sweden)

Liu Yang

2017-01-01

Full Text Available We construct a new two-stage stochastic model of supply chain with multiple factories and distributors for perishable product. By introducing a second-order stochastic dominance (SSD constraint, we can describe the preference consistency of the risk taker while minimizing the expected cost of company. To solve this problem, we convert it into a one-stage stochastic model equivalently; then we use sample average approximation (SAA method to approximate the expected values of the underlying random functions. A smoothing approach is proposed with which we can get the global solution and avoid introducing new variables and constraints. Meanwhile, we investigate the convergence of an optimal value from solving the transformed model and show that, with probability approaching one at exponential rate, the optimal value converges to its counterpart as the sample size increases. Numerical results show the effectiveness of the proposed algorithm and analysis.

Use of dose constraints in public exposure

International Nuclear Information System (INIS)

Tageldein, Amged

2015-02-01

An overview of the dose constraints in public exposures has been carried out in this project. The establishment, development and the application of the concept of dose constraints are reviewed with regards to public exposure. The role of dose constraints in the process of optimization of radiation protection was described and has been showed that the concept of the dose constraints along with many other concept of radiation protection is widely applied in the optimization of exposure to radiation. From the beginning of the establishment of dose constraints as a concept in radiation protection, the International Commission of Radiological Protection (ICRP) has published a number of documents that provides detailed application related to radiation protection and safety of public exposure from ionizing radiation. This work provides an overview of such publications and related documents with special emphasis on optimization of public exposure using dose constraints. (au)

Performance analysis of dual-hop relaying systems in the presence of Co-channel interference

KAUST Repository

Ikki, Salama Said

2010-12-01

In this paper, we investigate the effect of co-channel interference on the performance of dual-hop communications with amplify-and-forward relaying. Based on the derivation of the effective signal-to-interference-plus-noise ratio (SINR) at the destination node of the system, taking into account co-channel interference, we obtain expressions for the error and outage probabilities. Moreover, we study the performance of the system in the high SINR regime. Monte-Carlo simulations are further provided and confirm the accuracy of the analytical results. ©2010 IEEE.

An Efficient Rank Adaptation Algorithm for Cellular MIMO Systems with IRC Receivers

DEFF Research Database (Denmark)

Mahmood, Nurul Huda; Berardinelli, Gilberto; Tavares, Fernando Menezes Leitão

2014-01-01

Multiple transmit and receive antennas introduce additional degrees of freedom, which can be used to increase the number of spatial channels between a transmitter-receiver pair. Alternately, the additional degrees of freedom can be used to improve the interference resilience property with the help...... algorithm based on an estimate of the mean signal-to-interference-plus-noise ratio (SINR) at an IRC receiver; wherein, we use results from random matrix theory to derive the expression for the mean post-IRC SINR in the presence of interferers with unequal powers. The performance of the proposed algorithm...

A general treatment of dynamic integrity constraints

NARCIS (Netherlands)

de Brock, EO

This paper introduces a general, set-theoretic model for expressing dynamic integrity constraints, i.e., integrity constraints on the state changes that are allowed in a given state space. In a managerial context, such dynamic integrity constraints can be seen as representations of "real world"

An Introduction to 'Creativity Constraints'

DEFF Research Database (Denmark)

Onarheim, Balder; Biskjær, Michael Mose

2013-01-01

Constraints play a vital role as both restrainers and enablers in innovation processes by governing what the creative agent/s can and cannot do, and what the output can and cannot be. Notions of constraints are common in creativity research, but current contributions are highly dispersed due to n...

Market segmentation using perceived constraints

Science.gov (United States)

Jinhee Jun; Gerard Kyle; Andrew Mowen

2008-01-01

We examined the practical utility of segmenting potential visitors to Cleveland Metroparks using their constraint profiles. Our analysis identified three segments based on their scores on the dimensions of constraints: Other priorities--visitors who scored the highest on 'other priorities' dimension; Highly Constrained--visitors who scored relatively high on...

Constraint Handling Rules with Binders, Patterns and Generic Quantification

NARCIS (Netherlands)

Serrano, Alejandro; Hage, J.

2017-01-01

Constraint Handling Rules provide descriptions for constraint solvers. However, they fall short when those constraints specify some binding structure, like higher-rank types in a constraint-based type inference algorithm. In this paper, the term syntax of constraints is replaced by λ-tree syntax, in

Toward an automaton Constraint for Local Search

Directory of Open Access Journals (Sweden)

Jun He

2009-10-01

Full Text Available We explore the idea of using finite automata to implement new constraints for local search (this is already a successful technique in constraint-based global search. We show how it is possible to maintain incrementally the violations of a constraint and its decision variables from an automaton that describes a ground checker for that constraint. We establish the practicality of our approach idea on real-life personnel rostering problems, and show that it is competitive with the approach of [Pralong, 2007].

Constraint-based Attribute and Interval Planning

Science.gov (United States)

Jonsson, Ari; Frank, Jeremy

2013-01-01

In this paper we describe Constraint-based Attribute and Interval Planning (CAIP), a paradigm for representing and reasoning about plans. The paradigm enables the description of planning domains with time, resources, concurrent activities, mutual exclusions among sets of activities, disjunctive preconditions and conditional effects. We provide a theoretical foundation for the paradigm, based on temporal intervals and attributes. We then show how the plans are naturally expressed by networks of constraints, and show that the process of planning maps directly to dynamic constraint reasoning. In addition, we de ne compatibilities, a compact mechanism for describing planning domains. We describe how this framework can incorporate the use of constraint reasoning technology to improve planning. Finally, we describe EUROPA, an implementation of the CAIP framework.

Shortened constraint-induced movement therapy in subacute stroke - no effect of using a restraint

DEFF Research Database (Denmark)

Brogårdh, Christina; Vestling, Monika; Sjölund, Bengt H

2009-01-01

OBJECTIVE: To examine the effect of using a mitt during shortened constraint-induced movement therapy for patients in the subacute phase after stroke. SUBJECTS: Twenty-four patients with stroke (mean age 57.6 (standard deviation (SD) 8.5) years; average 7 weeks post-stroke) with mild to moderate......, no statistically significant differences between the groups were found in any measures at any point in time. CONCLUSION: In this study, no effect of using a restraint in patients with subacute stroke was found. Thus, this component in the constraint-induced therapy concept seems to be of minor importance...... Scale, the Sollerman hand function test, the 2-Point Discrimination test and Motor Activity Log test. RESULTS: Patients in both groups showed significant improvements in arm and hand motor performance and on self-reported motor ability after 2 weeks of therapy and at 3 months follow-up. However...

Constraints on stress-energy perturbations in general relativity

International Nuclear Information System (INIS)

Traschen, J.

1985-01-01

Conditions are found for the existence of integral constraints on stress-energy perturbations in general relativity. The integral constraints can be thought of as a general-relativistic generalization of the conservation of energy and momentum of matter perturbations in special relativity. The constraints are stated in terms of a vector field V, and the Robertson-Walker spacetimes are shown to have such constraint vectors. Although in general V is not a Killing vector, in a vacuum spacetime the constraint vectors are precisely the Killing vectors

On Lifecycle Constraints of Artifact-Centric Workflows

Science.gov (United States)

Kucukoguz, Esra; Su, Jianwen

Data plays a fundamental role in modeling and management of business processes and workflows. Among the recent "data-aware" workflow models, artifact-centric models are particularly interesting. (Business) artifacts are the key data entities that are used in workflows and can reflect both the business logic and the execution states of a running workflow. The notion of artifacts succinctly captures the fluidity aspect of data during workflow executions. However, much of the technical dimension concerning artifacts in workflows is not well understood. In this paper, we study a key concept of an artifact "lifecycle". In particular, we allow declarative specifications/constraints of artifact lifecycle in the spirit of DecSerFlow, and formulate the notion of lifecycle as the set of all possible paths an artifact can navigate through. We investigate two technical problems: (Compliance) does a given workflow (schema) contain only lifecycle allowed by a constraint? And (automated construction) from a given lifecycle specification (constraint), is it possible to construct a "compliant" workflow? The study is based on a new formal variant of artifact-centric workflow model called "ArtiNets" and two classes of lifecycle constraints named "regular" and "counting" constraints. We present a range of technical results concerning compliance and automated construction, including: (1) compliance is decidable when workflow is atomic or constraints are regular, (2) for each constraint, we can always construct a workflow that satisfies the constraint, and (3) sufficient conditions where atomic workflows can be constructed.

Performance Analysis of Communications under Energy Harvesting Constraints with noisy CSI

KAUST Repository

Znaidi, Mohamed Ridha Ali

2016-01-06

In energy harvesting communications, the transmitters have to adapt transmission to availability of energy harvested during the course of communication. The performance of the transmission depends on the channel conditions which vary randomly due to environmental changes. In this work, we consider the problem of power allocation taking into account the energy arrivals over time and the degree of channel state information (CSI) available at the transmitter, to maximize the throughput. Differently from previous work, the CSI at the transmitter is not perfect and may include estimation errors. We solve this problem with respect to the Energy Harvesting constraints. We determine the optimal power in the case where the channel is assumed to be perfectly known at the receiver. Also, we obtain the power policy when the transmitter has no CSI. Furthermore, we analyze the asymptotic average throughput in a system where the average recharge rate goes asymptotically to zero and when it is very high.

Block Pickard Models for Two-Dimensional Constraints

DEFF Research Database (Denmark)

Forchhammer, Søren; Justesen, Jørn

2009-01-01

In Pickard random fields (PRF), the probabilities of finite configurations and the entropy of the field can be calculated explicitly, but only very simple structures can be incorporated into such a field. Given two Markov chains describing a boundary, an algorithm is presented which determines...... for the domino tiling constraint represented by a quaternary alphabet. PRF models are also presented for higher order constraints, including the no isolated bits (n.i.b.) constraint, and a minimum distance 3 constraint by defining super symbols on blocks of binary symbols....

Team spirit makes the difference: the interactive effects of team work engagement and organizational constraints during a military operation on psychological outcomes afterwards.

Science.gov (United States)

Boermans, S M; Kamphuis, W; Delahaij, R; van den Berg, C; Euwema, M C

2014-12-01

This article prospectively explores the effects of collective team work engagement and organizational constraints during military deployment on individual-level psychological outcomes afterwards. Participants were 971 Dutch peacekeepers within 93 teams who were deployed between the end of 2008 and beginning of 2010, for an average of 4 months, in the International Security Assistance Force. Surveys were administered 2 months into deployment and 6 months afterwards. Multi-level regression analyses demonstrated that team work engagement during deployment moderated the relation between organizational constraints and post-deployment fatigue symptoms. Team members reported less fatigue symptoms after deployment if they were part of highly engaged teams during deployment, particularly when concerns about organizational constraints during deployment were high. In contrast, low team work engagement was related to more fatigue symptoms, particularly when concerns about organizational constraints were high. Contrary to expectations, no effects for team work engagement or organizational constraints were found for post-traumatic growth. The present study highlights that investing in team work engagement is important for those working in highly demanding jobs. © 2014 John Wiley & Sons, Ltd.

Neutron resonance averaging

International Nuclear Information System (INIS)

Chrien, R.E.

1986-10-01

The principles of resonance averaging as applied to neutron capture reactions are described. Several illustrations of resonance averaging to problems of nuclear structure and the distribution of radiative strength in nuclei are provided. 30 refs., 12 figs

Revisiting the simplicity constraints and coherent intertwiners

International Nuclear Information System (INIS)

Dupuis, Maite; Livine, Etera R

2011-01-01

In the context of loop quantum gravity and spinfoam models, the simplicity constraints are essential in that they allow one to write general relativity as a constrained topological BF theory. In this work, we apply the recently developed U(N) framework for SU(2) intertwiners to the issue of imposing the simplicity constraints to spin network states. More particularly, we focus on solving on individual intertwiners in the 4D Euclidean theory. We review the standard way of solving the simplicity constraints using coherent intertwiners and we explain how these fit within the U(N) framework. Then we show how these constraints can be written as a closed u(N) algebra and we propose a set of U(N) coherent states that solves all the simplicity constraints weakly for an arbitrary Immirzi parameter.

Effects of Carrier Frequency Offset, Timing Offset, and Channel Spread Factor on the Performance of Hexagonal Multicarrier Modulation Systems

Directory of Open Access Journals (Sweden)

Kui Xu

2009-01-01

Full Text Available Hexagonal multicarrier modulation (HMM system is the technique of choice to overcome the impact of time-frequency dispersive transmission channel. This paper examines the effects of insufficient synchronization (carrier frequency offset, timing offset on the amplitude and phase of the demodulated symbol by using a projection receiver in hexagonal multicarrier modulation systems. Furthermore, effects of CFO, TO, and channel spread factor on the performance of signal-to-interference-plus-noise ratio (SINR in hexagonal multicarrier modulation systems are further discussed. The exact SINR expression versus insufficient synchronization and channel spread factor is derived. Theoretical analysis shows that similar degradation on symbol amplitude and phase caused by insufficient synchronization is incurred as in traditional cyclic prefix orthogonal frequency-division multiplexing (CP-OFDM transmission. Our theoretical analysis is confirmed by numerical simulations in a doubly dispersive (DD channel with exponential delay power profile and U-shape Doppler power spectrum, showing that HMM systems outperform traditional CP-OFDM systems with respect to SINR against ISI/ICI caused by insufficient synchronization and doubly dispersive channel.

General expressions for downlink signal to interference and noise ratio in homogeneous and heterogeneous LTE-Advanced networks.

Science.gov (United States)

Ali, Nora A; Mourad, Hebat-Allah M; ElSayed, Hany M; El-Soudani, Magdy; Amer, Hassanein H; Daoud, Ramez M

2016-11-01

The interference is the most important problem in LTE or LTE-Advanced networks. In this paper, the interference was investigated in terms of the downlink signal to interference and noise ratio (SINR). In order to compare the different frequency reuse methods that were developed to enhance the SINR, it would be helpful to have a generalized expression to study the performance of the different methods. Therefore, this paper introduces general expressions for the SINR in homogeneous and in heterogeneous networks. In homogeneous networks, the expression was applied for the most common types of frequency reuse techniques: soft frequency reuse (SFR) and fractional frequency reuse (FFR). The expression was examined by comparing it with previously developed ones in the literature and the comparison showed that the expression is valid for any type of frequency reuse scheme and any network topology. Furthermore, the expression was extended to include the heterogeneous network; the expression includes the problem of co-tier and cross-tier interference in heterogeneous networks (HetNet) and it was examined by the same method of the homogeneous one.

General expressions for downlink signal to interference and noise ratio in homogeneous and heterogeneous LTE-Advanced networks

Directory of Open Access Journals (Sweden)

Nora A. Ali

2016-11-01

Full Text Available The interference is the most important problem in LTE or LTE-Advanced networks. In this paper, the interference was investigated in terms of the downlink signal to interference and noise ratio (SINR. In order to compare the different frequency reuse methods that were developed to enhance the SINR, it would be helpful to have a generalized expression to study the performance of the different methods. Therefore, this paper introduces general expressions for the SINR in homogeneous and in heterogeneous networks. In homogeneous networks, the expression was applied for the most common types of frequency reuse techniques: soft frequency reuse (SFR and fractional frequency reuse (FFR. The expression was examined by comparing it with previously developed ones in the literature and the comparison showed that the expression is valid for any type of frequency reuse scheme and any network topology. Furthermore, the expression was extended to include the heterogeneous network; the expression includes the problem of co-tier and cross-tier interference in heterogeneous networks (HetNet and it was examined by the same method of the homogeneous one.

Sensitivity of Multicarrier Two-Dimensional Spreading Schemes to Synchronization Errors

Directory of Open Access Journals (Sweden)

Geneviève Jourdain

2008-06-01

Full Text Available This paper presents the impact of synchronization errors on the performance of a downlink multicarrier two-dimensional spreading OFDM-CDMA system. This impact is measured by the degradation of the signal to interference and noise ratio (SINR obtained after despreading and equalization. The contribution of this paper is twofold. First, we use some properties of random matrix and free probability theories to derive a new expression of the SINR. This expression is then independent of the actual value of the spreading codes while still accounting for the orthogonality between codes. This model is validated by means of Monte Carlo simulations. Secondly, the model is exploited to derive the SINR degradation of OFDM-CDMA systems due to synchronization errors which include a timing error, a carrier frequency offset, and a sampling frequency offset. It is also exploited to compare the sensitivities of MC-CDMA and MC-DS-CDMA systems to these errors in a frequency selective channel. This work is carried out for zero-forcing and minimum mean square error equalizers.

Dual-Mode Gas Sensor Composed of a Silicon Nanoribbon Field Effect Transistor and a Bulk Acoustic Wave Resonator: A Case Study in Freons

Directory of Open Access Journals (Sweden)

Ye Chang

2018-01-01

Full Text Available In this paper, we develop a novel dual-mode gas sensor system which comprises a silicon nanoribbon field effect transistor (Si-NR FET and a film bulk acoustic resonator (FBAR. We investigate their sensing characteristics using polar and nonpolar organic compounds, and demonstrate that polarity has a significant effect on the response of the Si-NR FET sensor, and only a minor effect on the FBAR sensor. In this dual-mode system, qualitative discrimination can be achieved by analyzing polarity with the Si-NR FET and quantitative concentration information can be obtained using a polymer-coated FBAR with a detection limit at the ppm level. The complementary performance of the sensing elements provides higher analytical efficiency. Additionally, a dual mixture of two types of freons (CFC-113 and HCFC-141b is further analyzed with the dual-mode gas sensor. Owing to the small size and complementary metal-oxide semiconductor (CMOS-compatibility of the system, the dual-mode gas sensor shows potential as a portable integrated sensing system for the analysis of gas mixtures in the future.

The Ambiguous Role of Constraints in Creativity

DEFF Research Database (Denmark)

Biskjær, Michael Mose; Onarheim, Balder; Wiltschnig, Stefan

2011-01-01

The relationship between creativity and constraints is often described in the literature either in rather imprecise, general concepts or in relation to very specific domains. Cross-domain and cross-disciplinary takes on how the handling of constraints influences creative activities are rare. In t......-disciplinary research into the ambiguous role of constraints in creativity....

Fixed Costs and Hours Constraints

Science.gov (United States)

Johnson, William R.

2011-01-01

Hours constraints are typically identified by worker responses to questions asking whether they would prefer a job with more hours and more pay or fewer hours and less pay. Because jobs with different hours but the same rate of pay may be infeasible when there are fixed costs of employment or mandatory overtime premia, the constraint in those…

Improving the productivity of dairy cattle on smallholder farms in Mzuzu milk shed area in Malawi: Constraints and possible interventions

International Nuclear Information System (INIS)

Kumwenda, M.S.L.

1999-01-01

A study was carried out in the Mzuzu milk shed area in Northern Malawi, to identify major constraints to dairy cattle production systems prevailing in the area (Phase I) and develop a sustainable feed supplementation intervention (Phase II) based on tree legume leaves of Sesbania sesban for increasing milk production. Phase I of the study revealed that the major constraint to increasing productivity was poor nutrition related to the fluctuating supply of quality and quantity of feed. Body weights of cows averaged 301 ± 81.3 kg and ranged from 189 to 550 kg whereas the body condition score (BCS, on 1-9 scale) averaged 5.73 ± 1.35 and ranged from 2.00 to 9.00. Average milk production was 6.1 ± 5 kg/d and ranged from 1.5 to 19.0 kg/d. Post-partum reproductive status varied considerably. Cows consumed 10.6 ± 6.2 kg/day of roughage and 2.96 ± 1.45 kg/day of concentrates. The quality of the feeds was moderate. Roughages contained 1.56 ± 0.12% N while concentrates contained 1.88 ± 0.04% N. Poor reproductive management and prevalence of internal parasites were also identified as constraints. The intervention (Phase II) based on supplementation with tree legume leaves of Sesbania sesban significantly (P <0.05) improved the performance of dairy cows. Cows supplemented with tree legume leaves showed significantly higher body weights (368 ± 65.5 vs 348.7 ± 59.2 kg) and BCS (6.3 ± 0.9 vs 5.3 ± 1) compared to their counterparts receiving a supplement according to the present management practice. Daily milk yields of cows on the experimental diet averaged 8.6 ± 3.2 kg whereas those on control diet averaged 5.4 ± 1.7 kg. Significant differences in milk yields between the two groups of cows could have been due to higher dry matter intake from the supplementary diet. Cows on experimental diet consumed 3.5 ± 1.2 kg of supplementary feed as compared to 2.2 ± 0.7 kg by cows on the control diet. (author)

Arctic-nesting birds find physiological relief in the face of trophic constraints.

Science.gov (United States)

McKinnon, Laura; Nol, Erica; Juillet, Cédric

2013-01-01

A climate-induced phenological mismatch between the timing of reproduction and the timing of food resource peaks is one of the key hypothesized effects of climate change on wildlife. Though supported as a mechanism of population decline in birds, few studies have investigated whether the same temperature increases that drive this mismatch have the potential to decrease energetic costs of growth and compensate for the potential negative effects of reduced food availability. We generated independent indices of climate and resource availability and quantified their effects on growth of Dunlin (Calidris alpina) chicks, in the sub-arctic tundra of Churchill, Manitoba during the summers of 2010-2011 and found that when resource availability was below average, above average growth could be maintained in the presence of increasing temperatures. These results provide evidence that chicks may find physiological relief from the trophic constraints hypothesized by climate change studies.

Future Cosmological Constraints From Fast Radio Bursts

Science.gov (United States)

Walters, Anthony; Weltman, Amanda; Gaensler, B. M.; Ma, Yin-Zhe; Witzemann, Amadeus

2018-03-01

We consider the possible observation of fast radio bursts (FRBs) with planned future radio telescopes, and investigate how well the dispersions and redshifts of these signals might constrain cosmological parameters. We construct mock catalogs of FRB dispersion measure (DM) data and employ Markov Chain Monte Carlo analysis, with which we forecast and compare with existing constraints in the flat ΛCDM model, as well as some popular extensions that include dark energy equation of state and curvature parameters. We find that the scatter in DM observations caused by inhomogeneities in the intergalactic medium (IGM) poses a big challenge to the utility of FRBs as a cosmic probe. Only in the most optimistic case, with a high number of events and low IGM variance, do FRBs aid in improving current constraints. In particular, when FRBs are combined with CMB+BAO+SNe+H 0 data, we find the biggest improvement comes in the {{{Ω }}}{{b}}{h}2 constraint. Also, we find that the dark energy equation of state is poorly constrained, while the constraint on the curvature parameter, Ω k , shows some improvement when combined with current constraints. When FRBs are combined with future baryon acoustic oscillation (BAO) data from 21 cm Intensity Mapping, we find little improvement over the constraints from BAOs alone. However, the inclusion of FRBs introduces an additional parameter constraint, {{{Ω }}}{{b}}{h}2, which turns out to be comparable to existing constraints. This suggests that FRBs provide valuable information about the cosmological baryon density in the intermediate redshift universe, independent of high-redshift CMB data.

Faddeev-Jackiw quantization and constraints

International Nuclear Information System (INIS)

Barcelos-Neto, J.; Wotzasek, C.

1992-01-01

In a recent Letter, Faddeev and Jackiw have shown that the reduction of constrained systems into its canonical, first-order form, can bring some new insight into the research of this field. For sympletic manifolds the geometrical structure, called Dirac or generalized bracket, is obtained directly from the inverse of the nonsingular sympletic two-form matrix. In the cases of nonsympletic manifolds, this two-form is degenerated and cannot be inverted to provide the generalized brackets. This singular behavior of the sympletic matrix is indicative of the presence of constraints that have to be carefully considered to yield to consistent results. One has two possible routes to treat this problem: Dirac has taught us how to implement the constraints into the potential part (Hamiltonian) of the canonical Lagrangian, leading to the well-known Dirac brackets, which are consistent with the constraints and can be mapped into quantum commutators (modulo ordering terms). The second route, suggested by Faddeev and Jackiw, and followed in this paper, is to implement the constraints directly into the canonical part of the first order Lagrangian, using the fact that the consistence condition for the stability of the constrained manifold is linear in the time derivative. This algorithm may lead to an invertible two-form sympletic matrix from where the Dirac brackets are readily obtained. This algorithm is used in this paper to investigate some aspects of the quantization of constrained systems with first- and second-class constraints in the sympletic approach

Liquidity Constraints and Fiscal Stabilization Policy

DEFF Research Database (Denmark)

Kristoffersen, Mark Strøm

It is often claimed that the presence of liquidity constrained households enhances the need for and the effects of fi…scal stabilization policies. This paper studies this in a model of a small open economy with liquidity constrained households. The results show that the consequences of liquidity...... constraints are more complex than previously thought: The optimal stabilization policy in case of productivity shocks is independent of the liquidity constraints, and the presence of liquidity constraints tends to reduce the need for an active policy stabilizing productivity shocks....

Regenerative cooperative diversity networks with co-channel interference: Performance analysis and optimal energy allocation

KAUST Repository

Ikki, Salama Said

2013-02-01

A study of the effects of co-channel interference on a multirelay system with decode-and-forward (DF) protocol is presented. Orthogonal relaying is considered, and all relays that correctly decode the message in the broadcasting phase participate in the adaptive relaying phase. First, the effective signal-to-interference-plus-noise ratio (SINR) at the receiver is derived. Then, considering outage as the performance metric, we obtain exact closed-form expression for the outage probability. Simple and general asymptotic expressions for the outage probability, which explicitly show the coding and the diversity gains, are also derived and discussed. Furthermore, we present optimal energy-allocation schemes for minimizing outage under different resource constraints. Monte Carlo simulations are further provided to confirm the analytical results and illustrate the outage performance for different interference conditions and optimization schemes. © 1967-2012 IEEE.

Regenerative cooperative diversity networks with co-channel interference: Performance analysis and optimal energy allocation

KAUST Repository

Ikki, Salama Said; Pandarakkottilil, Ubaidulla; Aï ssa, Sonia

2013-01-01

A study of the effects of co-channel interference on a multirelay system with decode-and-forward (DF) protocol is presented. Orthogonal relaying is considered, and all relays that correctly decode the message in the broadcasting phase participate in the adaptive relaying phase. First, the effective signal-to-interference-plus-noise ratio (SINR) at the receiver is derived. Then, considering outage as the performance metric, we obtain exact closed-form expression for the outage probability. Simple and general asymptotic expressions for the outage probability, which explicitly show the coding and the diversity gains, are also derived and discussed. Furthermore, we present optimal energy-allocation schemes for minimizing outage under different resource constraints. Monte Carlo simulations are further provided to confirm the analytical results and illustrate the outage performance for different interference conditions and optimization schemes. © 1967-2012 IEEE.

Review of Minimal Flavor Constraints for Technicolor

DEFF Research Database (Denmark)

S. Fukano, Hidenori; Sannino, Francesco

2010-01-01

We analyze the constraints on the the vacuum polarization of the standard model gauge bosons from a minimal set of flavor observables valid for a general class of models of dynamical electroweak symmetry breaking. We will show that the constraints have a strong impact on the self-coupling and mas......We analyze the constraints on the the vacuum polarization of the standard model gauge bosons from a minimal set of flavor observables valid for a general class of models of dynamical electroweak symmetry breaking. We will show that the constraints have a strong impact on the self...

Impact of leaf motion constraints on IMAT plan quality, deliver accuracy, and efficiency

International Nuclear Information System (INIS)

Chen Fan; Rao Min; Ye Jinsong; Shepard, David M.; Cao Daliang

2011-01-01

but can lead to less accurate dose distribution as evidenced by increasing discrepancies between the planned and the delivered doses. For example, the results from our patient-specific quality assurance measurements demonstrated that the average gamma analysis passing rate decreased from 98% to 80% when the allowable leaf motion increased from 3 to 20 mm/deg. Larger leaf motion constraints also led to longer treatment delivery times (2 to 4 folds) due to the additional MLC leaf motion. Conclusions: Leaf motion constraints significantly impact IMAT plans in terms of plan quality, delivery accuracy, and delivery efficiency with the impact magnified for more complex cases. Our studies indicate that a leaf motion constraint of 2 to 3 mm/deg of gantry rotation can provide an optimal balance between plan quality, delivery accuracy, and efficiency.

Relaxations of semiring constraint satisfaction problems

CSIR Research Space (South Africa)

Leenen, L

2007-03-01

Full Text Available The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework preferences can be associated with tuples of values of the variable domains...

Solar system constraints on disformal gravity theories

International Nuclear Information System (INIS)

Ip, Hiu Yan; Schmidt, Fabian; Sakstein, Jeremy

2015-01-01

Disformal theories of gravity are scalar-tensor theories where the scalar couples derivatively to matter via the Jordan frame metric. These models have recently attracted interest in the cosmological context since they admit accelerating solutions. We derive the solution for a static isolated mass in generic disformal gravity theories and transform it into the parameterised post-Newtonian form. This allows us to investigate constraints placed on such theories by local tests of gravity. The tightest constraints come from preferred-frame effects due to the motion of the Solar System with respect to the evolving cosmological background field. The constraints we obtain improve upon the previous solar system constraints by two orders of magnitude, and constrain the scale of the disformal coupling for generic models to ℳ ∼> 100 eV. These constraints render all disformal effects irrelevant for cosmology

Observational constraints on interstellar chemistry

International Nuclear Information System (INIS)

Winnewisser, G.

1984-01-01

The author points out presently existing observational constraints in the detection of interstellar molecular species and the limits they may cast on our knowledge of interstellar chemistry. The constraints which arise from the molecular side are summarised and some technical difficulties encountered in detecting new species are discussed. Some implications for our understanding of molecular formation processes are considered. (Auth.)

Expressing Model Constraints Visually with VMQL

DEFF Research Database (Denmark)

Störrle, Harald

2011-01-01

) for specifying constraints on UML models. We examine VMQL's usability by controlled experiments and its expressiveness by a representative sample. We conclude that VMQL is less expressive than OCL, although expressive enough for most of the constraints in the sample. In terms of usability, however, VMQL......OCL is the de facto standard language for expressing constraints and queries on UML models. However, OCL expressions are very difficult to create, understand, and maintain, even with the sophisticated tool support now available. In this paper, we propose to use the Visual Model Query Language (VMQL...

Implicit Motives and Men's Perceived Constraint in Fatherhood.

Science.gov (United States)

Ruppen, Jessica; Waldvogel, Patricia; Ehlert, Ulrike

2016-01-01

Research shows that implicit motives influence social relationships. However, little is known about their role in fatherhood and, particularly, how men experience their paternal role. Therefore, this study examined the association of implicit motives and fathers' perceived constraint due to fatherhood. Furthermore, we explored their relation to fathers' life satisfaction. Participants were fathers with biological children ( N = 276). They were asked to write picture stories, which were then coded for implicit affiliation and power motives. Perceived constraint and life satisfaction were assessed on a visual analog scale. A higher implicit need for affiliation was significantly associated with lower perceived constraint, whereas the implicit need for power had the opposite effect. Perceived constraint had a negative influence on life satisfaction. Structural equation modeling revealed significant indirect effects of implicit affiliation and power motives on life satisfaction mediated by perceived constraint. Our findings indicate that men with a higher implicit need for affiliation experience less constraint due to fatherhood, resulting in higher life satisfaction. The implicit need for power, however, results in more perceived constraint and is related to decreased life satisfaction.

On relaxing the Mangasarian-Fromovitz constraint qualification

Czech Academy of Sciences Publication Activity Database

Kruger, A.Y.; Minchenko, L.; Outrata, Jiří

2014-01-01

Roč. 18, č. 1 (2014), s. 171-189 ISSN 1385-1292 R&D Projects: GA ČR GAP402/12/1309 Institutional support: RVO:67985556 Keywords : Nonlinear programming * Regularity conditions * Constraint qualifications * Lagrange multipliers * Mangasarian–Fromovitz constraint qualification * Constant rank constraint qualification Subject RIV: BA - General Mathematics Impact factor: 0.679, year: 2014 http://library.utia.cas.cz/separaty/2014/MTR/outrata-0426110.pdf

Constraint programming for modelling and solving modal satisfiability

NARCIS (Netherlands)

Brand, S.; Gennari, R.; de Rijke, M.

2003-01-01

We explore to what extent and how efficiently constraint programmingcan be used in the context of automated reasoning for modal logics. We encode modal satisfiability problems as constraint satisfactionproblems with non-boolean domains, together with suitable constraints.Experiments show that the

Cosmological constraints on Brans-Dicke theory.

Science.gov (United States)

Avilez, A; Skordis, C

2014-07-04

We report strong cosmological constraints on the Brans-Dicke (BD) theory of gravity using cosmic microwave background data from Planck. We consider two types of models. First, the initial condition of the scalar field is fixed to give the same effective gravitational strength Geff today as the one measured on Earth, GN. In this case, the BD parameter ω is constrained to ω>692 at the 99% confidence level, an order of magnitude improvement over previous constraints. In the second type, the initial condition for the scalar is a free parameter leading to a somewhat stronger constraint of ω>890, while Geff is constrained to 0.981theory and are valid for any Horndeski theory, the most general second-order scalar-tensor theory, which approximates the BD theory on cosmological scales. In this sense, our constraints place strong limits on possible modifications of gravity that might explain cosmic acceleration.

What's in a country average? Wealth, gender, and regional inequalities in immunization in India.

Science.gov (United States)

Pande, Rohini P; Yazbeck, Abdo S

2003-12-01

Recent attention to Millennium Development Goals by the international development community has led to the formation of targets to measure country-level achievements, including achievements on health status indicators such as childhood immunization. Using the example of immunization in India, this paper demonstrates the importance of disaggregating national averages for a better understanding of social disparities in health. Specifically, the paper uses data from the India National Family Health Survey 1992-93 to analyze socioeconomic, gender, urban-rural and regional inequalities in immunization in India for each of the 17 largest states. Results show that, on average, southern states have better immunization levels and lower immunization inequalities than many northern states. Wealth and regional inequalities are correlated with overall levels of immunization in a non-linear fashion. Gender inequalities persist in most states, including in the south, and seem unrelated to overall immunization or the levels of other inequalities measured here. This suggests that the gender differentials reflect deep-seated societal factors rather than health system issues per se. The disaggregated information and analysis used in this paper allows for setting more meaningful targets than country averages. Additionally, it helps policy makers and planners to understand programmatic constraints and needs by identifying disparities between sub-groups of the population, including strong and weak performers at the state and regional levels.

A Temporal Concurrent Constraint Programming Calculus

DEFF Research Database (Denmark)

Palamidessi, Catuscia; Valencia Posso, Frank Darwin

2001-01-01

The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and non-deterministic timed behavior. We call this tcc extension the ntcc calculus...

Toward making the constraint hypersurface an attractor in free evolution

International Nuclear Information System (INIS)

Fiske, David R.

2004-01-01

When constructing numerical solutions to systems of evolution equations subject to a constraint, one must decide what role the constraint equations will play in the evolution system. In one popular choice, known as free evolution, a simulation is treated as a Cauchy problem, with the initial data constructed to satisfy the constraint equations. This initial data are then evolved via the evolution equations with no further enforcement of the constraint equations. The evolution, however, via the discretized evolution equations introduce constraint violating modes at the level of truncation error, and these constraint violating modes will behave in a formalism dependent way. This paper presents a generic method for incorporating the constraint equations into the evolution equations so that the off-constraint dynamics are biased toward the constraint satisfying solutions

Correcting for the free energy costs of bond or angle constraints in molecular dynamics simulations.

Science.gov (United States)

König, Gerhard; Brooks, Bernard R

2015-05-01

Free energy simulations are an important tool in the arsenal of computational biophysics, allowing the calculation of thermodynamic properties of binding or enzymatic reactions. This paper introduces methods to increase the accuracy and precision of free energy calculations by calculating the free energy costs of constraints during post-processing. The primary purpose of employing constraints for these free energy methods is to increase the phase space overlap between ensembles, which is required for accuracy and convergence. The free energy costs of applying or removing constraints are calculated as additional explicit steps in the free energy cycle. The new techniques focus on hard degrees of freedom and use both gradients and Hessian estimation. Enthalpy, vibrational entropy, and Jacobian free energy terms are considered. We demonstrate the utility of this method with simple classical systems involving harmonic and anharmonic oscillators, four-atomic benchmark systems, an alchemical mutation of ethane to methanol, and free energy simulations between alanine and serine. The errors for the analytical test cases are all below 0.0007kcal/mol, and the accuracy of the free energy results of ethane to methanol is improved from 0.15 to 0.04kcal/mol. For the alanine to serine case, the phase space overlaps of the unconstrained simulations range between 0.15 and 0.9%. The introduction of constraints increases the overlap up to 2.05%. On average, the overlap increases by 94% relative to the unconstrained value and precision is doubled. The approach reduces errors arising from constraints by about an order of magnitude. Free energy simulations benefit from the use of constraints through enhanced convergence and higher precision. The primary utility of this approach is to calculate free energies for systems with disparate energy surfaces and bonded terms, especially in multi-scale molecular mechanics/quantum mechanics simulations. This article is part of a Special Issue

Judgement of Design Scheme Based on Flexible Constraint in ICAD

Institute of Scientific and Technical Information of China (English)

无

2000-01-01

The conception of flexible constraint is proposed in the paper. The solution of flexible constraint is in special range, and maybe different in different instances of same design scheme. The paper emphasis on how to evaluate and optimize a design scheme with flexible constraints based on the satisfaction degree function defined on flexible constraints. The conception of flexible constraint is used to solve constraint conflict and design optimization in complicated constraint-based assembly design by the PFM parametrization assembly design system. An instance of gear-box design is used for verifying optimization method.

A comparison of debt and primary-deficit constraints

NARCIS (Netherlands)

Ribeiro, M.P.; Beetsma, R.; Schabert, A.

2008-01-01

This paper compares constraints on the public debt with constraints on the primary deficit. The analysis takes into account how an optimizing government reacts to the different constraints when deciding on a spending and borrowing plan. We find that the economy behaves similarly under both

Integral constraints on perturbations of Robertson-Walker cosmologies

International Nuclear Information System (INIS)

Ellis, G.F.R.; Jaklitsch, M.J.

1989-01-01

Integral constraints occur in the case of spherically symmetric inhomogeneities in Robertson-Walker universes, and (according to Traschen) in the case of general perturbations of these models. It is shown that these constraints are the same in the case of spherical symmetry, and they are interpreted as 'fitting conditions', that is, as constraints on the background Robertson-Walker model rather than on the nature of inhomogeneities. These integral constraints significantly affect the interpretation of anisotropies in the cosmic microwave background radiation. 22 refs

Study on the unified constraint parameter for characterizing in-plane and out-of-plane constraint based on the equivalent plastic strain

International Nuclear Information System (INIS)

Yang Jie; Wang Guozhen; Xuan Fuzhen; Tu Shandong

2013-01-01

Background: Constraint can significantly alter the material's fracture toughness. Purpose: In order to increase accuracy of the structural integrity assessment. It needs to consider the effect of constraint on the fracture toughness of nuclear power materials and structures. A unified measure which can reflect both in-plane and out-of-plane constraint is needed. Methods: In this paper, the finite element numerical simulation method was used, a unified measure and characterization parameter of in-plane and out-of-plane constraint based on crack-tip equivalent plastic strain have been investigated. Results: The results show that the area surrounded by ε p isoline has a good relevance with the material's fracture toughness on different constraint conditions, so it may be a suitable parameter. Based on the area A PEEQ , a unified constraint characterization parameter √A p is defined. It was found that there exists a sole linear relation between the normalized fracture toughness J IC /J re f and √A p regardless of the in-plane, out-of-plane constraint and the selection of the p isolines. The sole J IC /J re f-√A p line exists for a certain material. For different materials, the slope of J IC /J re f-√A p reference line is different. The material whose slope is larger has a higher J IC /J re f and is more sensitive to constraint at the same magnitude of normalized unified parameter. Conclusions: The unified J IC /J re f -√A p reference line may be used to assess the safety of a cracked component with any constraint levels regardless of in-plane or out-of-plane constraint or both. (authors)

Fluid convection, constraint and causation

Science.gov (United States)

Bishop, Robert C.

2012-01-01

Complexity—nonlinear dynamics for my purposes in this essay—is rich with metaphysical and epistemological implications but is receiving sustained philosophical analysis only recently. I will explore some of the subtleties of causation and constraint in Rayleigh–Bénard convection as an example of a complex phenomenon, and extract some lessons for further philosophical reflection on top-down constraint and causation particularly with respect to causal foundationalism. PMID:23386955

Freedom and constraint analysis and optimization

NARCIS (Netherlands)

Brouwer, Dannis Michel; Boer, Steven; Aarts, Ronald G.K.M.; Meijaard, Jacob Philippus; Jonker, Jan B.

2011-01-01

Many mathematical and intuitive methods for constraint analysis of mechanisms have been proposed. In this article we compare three methods. Method one is based on Grüblers equation. Method two uses an intuitive analysis method based on opening kinematic loops and evaluating the constraints at the

Constraint theory multidimensional mathematical model management

CERN Document Server

Friedman, George J

2017-01-01

Packed with new material and research, this second edition of George Friedman’s bestselling Constraint Theory remains an invaluable reference for all engineers, mathematicians, and managers concerned with modeling. As in the first edition, this text analyzes the way Constraint Theory employs bipartite graphs and presents the process of locating the “kernel of constraint” trillions of times faster than brute-force approaches, determining model consistency and computational allowability. Unique in its abundance of topological pictures of the material, this book balances left- and right-brain perceptions to provide a thorough explanation of multidimensional mathematical models. Much of the extended material in this new edition also comes from Phan Phan’s PhD dissertation in 2011, titled “Expanding Constraint Theory to Determine Well-Posedness of Large Mathematical Models.” Praise for the first edition: "Dr. George Friedman is indisputably the father of the very powerful methods of constraint theory...

Domain general constraints on statistical learning.

Science.gov (United States)

Thiessen, Erik D

2011-01-01

All theories of language development suggest that learning is constrained. However, theories differ on whether these constraints arise from language-specific processes or have domain-general origins such as the characteristics of human perception and information processing. The current experiments explored constraints on statistical learning of patterns, such as the phonotactic patterns of an infants' native language. Infants in these experiments were presented with a visual analog of a phonotactic learning task used by J. R. Saffran and E. D. Thiessen (2003). Saffran and Thiessen found that infants' phonotactic learning was constrained such that some patterns were learned more easily than other patterns. The current results indicate that infants' learning of visual patterns shows the same constraints as infants' learning of phonotactic patterns. This is consistent with theories suggesting that constraints arise from domain-general sources and, as such, should operate over many kinds of stimuli in addition to linguistic stimuli. © 2011 The Author. Child Development © 2011 Society for Research in Child Development, Inc.

Dose constraints, what are they now?

International Nuclear Information System (INIS)

Lazo, T.

2005-01-01

The concept of a source-related dose constraint was first introduced in ICPR publication 60. The idea was to provide a number that individual exposures from a single, specific source should not exceed, and below which optimisation of protection should take place. Dose constraints were applied to occupational and public exposures from practices. In order to simplify and clarify the ICRP's recommendations, the latest draft, RPO5, presents dose constraints again, and with the same meaning as in publication 60. However, the dose constraints are now applied in all situations, not just practices. This new approach does provide simplification, in that a single concept is applied to all types of exposures (normal situations, accident situations, and existing situations). However, the approach and numerical values that are selected by regulatory authorities for the application of the concept, particularly in normal situations which are also subject to dose limits, will be crucial to the implementation of the system of radiological protection. (author)

Applicability of new radio technologies for advanced UMTS networks

Directory of Open Access Journals (Sweden)

A. Dekorsy

2004-01-01

Full Text Available An expanded effort is under the way to support the evolution of UMTS (Universal Mobile Telecommunication System. Apart from delivering high data rates, future UMTS releases will also require to provide high network performance in terms of system capacity, low radiated power, and high coverage. Well promising performance-enhancing technologies are smart antennas as well as multiuser detection. Although these new radio technologies have recently been subject to intense research, main UMTS network integration aspects with their specific constraints have been neglected in many cases. Especially the interaction with UMTS radio resource control being required to meet Quality of Service (QoS constraints has to be included to assess the applicability of these technologies for UMTS. In this paper, we study the interaction of beamforming concepts as well as multiuser detection with load and power control. We also work out UMTS specific constraints like signal-to-interference-plus-noise ratio (SINR operating points, pilot power pollution or channel estimation, all strongly limiting network performance. Results are shown for capacity gains and power reduction for all beamforming concepts of interest as well as linear multiuser detection schemes. The results show that fix as well as user-specific beamforming significantly improves network performance gains in downlink. In uplink multiuser detection indicates fairly modest system capacity gains, while it reduces tremendously mobile station power.

Simulating non-holonomic constraints within the LCP-based simulation framework

DEFF Research Database (Denmark)

Ellekilde, Lars-Peter; Petersen, Henrik Gordon

2006-01-01

be incorporated directly, and derive formalism for how the non-holonomic contact constraints can be modelled as a combination of non-holonomic equality constraints and ordinary contacts constraints. For each of these three we are able to guarantee solvability, when using Lemke's algorithm. A number of examples......In this paper, we will extend the linear complementarity problem-based rigid-body simulation framework with non-holonomic constraints. We consider three different types of such, namely equality, inequality and contact constraints. We show how non-holonomic equality and inequality constraints can...... are included to demonstrate the non-holonomic constraints. Udgivelsesdato: Marts...

DELPHI ANALYSIS OF CONSTRAINTS TO MAIZE PRODUCTION IN ...

African Journals Online (AJOL)

A descriptive Delphi study was conducted to: identify constraints to maize production on SNL from the perspectives of crop researchers, extension officers and farmers; categorise the constraints; rank them in order of importance; and identify ways of addressing them. A total of 33 constraint items were identified and ...

Near-Optimal Fingerprinting with Constraints

Directory of Open Access Journals (Sweden)

Gulyás Gábor György

2016-10-01

Full Text Available Several recent studies have demonstrated that people show large behavioural uniqueness. This has serious privacy implications as most individuals become increasingly re-identifiable in large datasets or can be tracked, while they are browsing the web, using only a couple of their attributes, called as their fingerprints. Often, the success of these attacks depends on explicit constraints on the number of attributes learnable about individuals, i.e., the size of their fingerprints. These constraints can be budget as well as technical constraints imposed by the data holder. For instance, Apple restricts the number of applications that can be called by another application on iOS in order to mitigate the potential privacy threats of leaking the list of installed applications on a device. In this work, we address the problem of identifying the attributes (e.g., smartphone applications that can serve as a fingerprint of users given constraints on the size of the fingerprint. We give the best fingerprinting algorithms in general, and evaluate their effectiveness on several real-world datasets. Our results show that current privacy guards limiting the number of attributes that can be queried about individuals is insufficient to mitigate their potential privacy risks in many practical cases.

Coverage-based constraints for IMRT optimization

Science.gov (United States)

Mescher, H.; Ulrich, S.; Bangert, M.

2017-09-01

Radiation therapy treatment planning requires an incorporation of uncertainties in order to guarantee an adequate irradiation of the tumor volumes. In current clinical practice, uncertainties are accounted for implicitly with an expansion of the target volume according to generic margin recipes. Alternatively, it is possible to account for uncertainties by explicit minimization of objectives that describe worst-case treatment scenarios, the expectation value of the treatment or the coverage probability of the target volumes during treatment planning. In this note we show that approaches relying on objectives to induce a specific coverage of the clinical target volumes are inevitably sensitive to variation of the relative weighting of the objectives. To address this issue, we introduce coverage-based constraints for intensity-modulated radiation therapy (IMRT) treatment planning. Our implementation follows the concept of coverage-optimized planning that considers explicit error scenarios to calculate and optimize patient-specific probabilities q(\\hat{d}, \\hat{v}) of covering a specific target volume fraction \\hat{v} with a certain dose \\hat{d} . Using a constraint-based reformulation of coverage-based objectives we eliminate the trade-off between coverage and competing objectives during treatment planning. In-depth convergence tests including 324 treatment plan optimizations demonstrate the reliability of coverage-based constraints for varying levels of probability, dose and volume. General clinical applicability of coverage-based constraints is demonstrated for two cases. A sensitivity analysis regarding penalty variations within this planing study based on IMRT treatment planning using (1) coverage-based constraints, (2) coverage-based objectives, (3) probabilistic optimization, (4) robust optimization and (5) conventional margins illustrates the potential benefit of coverage-based constraints that do not require tedious adjustment of target volume objectives.

Vandenberg Air Force Base Upper Level Wind Launch Weather Constraints

Science.gov (United States)

Shafer, Jaclyn A.; Wheeler, Mark M.

2012-01-01

The 30th Operational Support Squadron Weather Flight (30 OSSWF) provides comprehensive weather services to the space program at Vandenberg Air Force Base (VAFB) in California. One of their responsibilities is to monitor upper-level winds to ensure safe launch operations of the Minuteman III ballistic missile. The 30 OSSWF tasked the Applied Meteorology Unit (AMU) to analyze VAFB sounding data with the goal of determining the probability of violating (PoV) their upper-level thresholds for wind speed and shear constraints specific to this launch vehicle, and to develop a tool that will calculate the PoV of each constraint on the day of launch. In order to calculate the probability of exceeding each constraint, the AMU collected and analyzed historical data from VAFB. The historical sounding data were retrieved from the National Oceanic and Atmospheric Administration Earth System Research Laboratory archive for the years 1994-2011 and then stratified into four sub-seasons: January-March, April-June, July-September, and October-December. The maximum wind speed and 1000-ft shear values for each sounding in each subseason were determined. To accurately calculate the PoV, the AMU determined the theoretical distributions that best fit the maximum wind speed and maximum shear datasets. Ultimately it was discovered that the maximum wind speeds follow a Gaussian distribution while the maximum shear values follow a lognormal distribution. These results were applied when calculating the averages and standard deviations needed for the historical and real-time PoV calculations. In addition to the requirements outlined in the original task plan, the AMU also included forecast sounding data from the Rapid Refresh model. This information provides further insight for the launch weather officers (LWOs) when determining if a wind constraint violation will occur over the next few hours on day of launch. The interactive graphical user interface (GUI) for this project was developed in

Pairwise Constraint-Guided Sparse Learning for Feature Selection.

Science.gov (United States)

Liu, Mingxia; Zhang, Daoqiang

2016-01-01

Feature selection aims to identify the most informative features for a compact and accurate data representation. As typical supervised feature selection methods, Lasso and its variants using L1-norm-based regularization terms have received much attention in recent studies, most of which use class labels as supervised information. Besides class labels, there are other types of supervised information, e.g., pairwise constraints that specify whether a pair of data samples belong to the same class (must-link constraint) or different classes (cannot-link constraint). However, most of existing L1-norm-based sparse learning methods do not take advantage of the pairwise constraints that provide us weak and more general supervised information. For addressing that problem, we propose a pairwise constraint-guided sparse (CGS) learning method for feature selection, where the must-link and the cannot-link constraints are used as discriminative regularization terms that directly concentrate on the local discriminative structure of data. Furthermore, we develop two variants of CGS, including: 1) semi-supervised CGS that utilizes labeled data, pairwise constraints, and unlabeled data and 2) ensemble CGS that uses the ensemble of pairwise constraint sets. We conduct a series of experiments on a number of data sets from University of California-Irvine machine learning repository, a gene expression data set, two real-world neuroimaging-based classification tasks, and two large-scale attribute classification tasks. Experimental results demonstrate the efficacy of our proposed methods, compared with several established feature selection methods.

Chance-Constrained Guidance With Non-Convex Constraints

Science.gov (United States)

Ono, Masahiro

2011-01-01

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of

On Averaging Rotations

DEFF Research Database (Denmark)

Gramkow, Claus

1999-01-01

In this article two common approaches to averaging rotations are compared to a more advanced approach based on a Riemannian metric. Very offten the barycenter of the quaternions or matrices that represent the rotations are used as an estimate of the mean. These methods neglect that rotations belo...... approximations to the Riemannian metric, and that the subsequent corrections are inherient in the least squares estimation. Keywords: averaging rotations, Riemannian metric, matrix, quaternion......In this article two common approaches to averaging rotations are compared to a more advanced approach based on a Riemannian metric. Very offten the barycenter of the quaternions or matrices that represent the rotations are used as an estimate of the mean. These methods neglect that rotations belong...

Specifying Dynamic and Deontic Integrity Constraints

NARCIS (Netherlands)

Wieringa, Roelf J.; Meyer, John-Jules; Weigand, Hans

In the dominant view of knowledge bases (KB's), a KB is a set of facts (atomic sentences) and integrity constraints (IC's). An IC is then a sentence which must at least be consistent with the other sentences in the KB, This view obliterates the distinction between, for example, the constraint that

Stability Constraints for Robust Model Predictive Control

Directory of Open Access Journals (Sweden)

Amanda G. S. Ottoni

2015-01-01

Full Text Available This paper proposes an approach for the robust stabilization of systems controlled by MPC strategies. Uncertain SISO linear systems with box-bounded parametric uncertainties are considered. The proposed approach delivers some constraints on the control inputs which impose sufficient conditions for the convergence of the system output. These stability constraints can be included in the set of constraints dealt with by existing MPC design strategies, in this way leading to the “robustification” of the MPC.

Parallel Execution of Multi Set Constraint Rewrite Rules

DEFF Research Database (Denmark)

Sulzmann, Martin; Lam, Edmund Soon Lee

2008-01-01

that the underlying constraint rewrite implementation executes rewrite steps in parallel on increasingly popular becoming multi-core architectures. We design and implement efficient algorithms which allow for the parallel execution of multi-set constraint rewrite rules. Our experiments show that we obtain some......Multi-set constraint rewriting allows for a highly parallel computational model and has been used in a multitude of application domains such as constraint solving, agent specification etc. Rewriting steps can be applied simultaneously as long as they do not interfere with each other.We wish...

[The Nature and Issues of Drug Addiction Treatment under Constraint].

Science.gov (United States)

Quirion, Bastien

This article is exploring different forms of constraint that are exerted in the field of drug addiction treatment. The objective of this article is to establish benchmarks and to stimulate reflection about the ethical and clinical implications of those constraints in the field of drug addiction treatment. This article is presenting a critical review of different forms of constraint that can be exerted in Canada in regard to the treatment of drug addiction. In the first section of the article, a definition of therapeutic intervention is proposed, that includes the dimension of power, which justifies the importance of considering the coercive aspects of treatment. The second section, which represents the core section of the paper, is devoted to the presentation of different levels of constraint that can be distinguished in regard to drug addicts who are under treatment. Three levels of constraint are exposed: judicial constraint, institutional constraint and relational constraint. The coercive aspect of treatment can then be recognized as a combination of all tree levels of constraint. Judicial constraint refers to any form of constraint in which the court or the judge is imposing or recommending treatment. This particular level of constraint can take different forms, such as therapeutic remands, conditions of a probation order, conditions of a conditional sentence of imprisonment, and coercive treatment such as the ones provided through drug courts. Institutional constraint refers to any form of constraint exerted within any institutional setting, such as correctional facilities and programs offered in community. Correctional facilities being limited by their own specific mission, it might have a major impact on the way the objectives of treatment are defined. Those limitations can then be considered as a form of constraint, in which drug users don't have much space to express their personal needs. Finally, relational constraint refers to any form of constraint in

Average-energy games

Directory of Open Access Journals (Sweden)

Patricia Bouyer

2015-09-01

Full Text Available Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the objective is to optimize the long-run average gain per action, and energy games, where the system has to avoid running out of energy. We study average-energy games, where the goal is to optimize the long-run average of the accumulated energy. We show that this objective arises naturally in several applications, and that it yields interesting connections with previous concepts in the literature. We prove that deciding the winner in such games is in NP inter coNP and at least as hard as solving mean-payoff games, and we establish that memoryless strategies suffice to win. We also consider the case where the system has to minimize the average-energy while maintaining the accumulated energy within predefined bounds at all times: this corresponds to operating with a finite-capacity storage for energy. We give results for one-player and two-player games, and establish complexity bounds and memory requirements.

Constraints on γ and strong phases from B → πK decays

International Nuclear Information System (INIS)

Buras, Andrzej J.; Fleischer, Robert

2001-01-01

As we pointed out recently, the neutral decays B d → π - + K± and B d → π 0 K may provide non-trivial bounds on the CKM angle γ. Here we reconsider this approach in the light of recent CLEO data, which look very interesting. In particular, the results for the corresponding CP-averaged branching ratios are in favour of strong constraints on γ, where the second quadrant is preferred. Such a situation would be in conflict with the standard analysis of the unitarity triangle. Moreover, constraints on a CO-conserving strong phase δ n are in favour of a negative value of cosδ n , which would be in conflict with the factorization expectation. In addition, there seems to be an interesting discrepancy with the bounds that are implied by the charged B → πK system: whereas these decays favour a range for γ that is similar to that of the neutral modes, they point towards a positive value of cosδ c , which would be in conflict with the expectation of equal signs for cosδ n and cosδ c . (author)

Constraints on γ and strong phases from B → πK decays

International Nuclear Information System (INIS)

Buras, A.J.

2000-08-01

As we pointed out recently, the neutral decays B d → π -+ K ± and B d → π 0 K may provide non-trivial bounds on the CKM angle γ. Here we reconsider this approach in the light of recent CLEO data, which look very interesting. In particular, the results for the corresponding CP-averaged branching ratios are in favour of strong constraints on γ, where the second quadrant is preferred. Such a situation would be in conflict with the standard analysis of the unitarity triangle. Moreover, constraints on a CP-conserving strong phase δ n are in favour of a negative value of cos δ n , which would be in conflict with the factorization expectation. In addition, there seems to be an interesting discrepancy with the bounds that are implied by the charged B → π K system: whereas these decays favour a range for γ that is similar to that of the neutral modes, they point towards a positive value of cos δ c , which would be in conflict with the expectation of equal signs for cos δ n and cos δ c . (orig.)

A novel constraint for thermodynamically designing DNA sequences.

Directory of Open Access Journals (Sweden)

Qiang Zhang

Full Text Available Biotechnological and biomolecular advances have introduced novel uses for DNA such as DNA computing, storage, and encryption. For these applications, DNA sequence design requires maximal desired (and minimal undesired hybridizations, which are the product of a single new DNA strand from 2 single DNA strands. Here, we propose a novel constraint to design DNA sequences based on thermodynamic properties. Existing constraints for DNA design are based on the Hamming distance, a constraint that does not address the thermodynamic properties of the DNA sequence. Using a unique, improved genetic algorithm, we designed DNA sequence sets which satisfy different distance constraints and employ a free energy gap based on a minimum free energy (MFE to gauge DNA sequences based on set thermodynamic properties. When compared to the best constraints of the Hamming distance, our method yielded better thermodynamic qualities. We then used our improved genetic algorithm to obtain lower-bound DNA sequence sets. Here, we discuss the effects of novel constraint parameters on the free energy gap.

Worst-Case Cooperative Jamming for Secure Communications in CIoT Networks.

Science.gov (United States)

Li, Zhen; Jing, Tao; Ma, Liran; Huo, Yan; Qian, Jin

2016-03-07

The Internet of Things (IoT) is a significant branch of the ongoing advances in the Internet and mobile communications. The use of a large number of IoT devices makes the spectrum scarcity problem even more serious. The usable spectrum resources are almost entirely occupied, and thus, the increasing radio access demands of IoT devices cannot be met. To tackle this problem, the Cognitive Internet of Things (CIoT) has been proposed. In a CIoT network, secondary users, i.e., sensors and actuators, can access the licensed spectrum bands provided by licensed primary users (such as telephones). Security is a major concern in CIoT networks. However, the traditional encryption method at upper layers (such as symmetric cryptography and asymmetric cryptography) may be compromised in CIoT networks, since these types of networks are heterogeneous. In this paper, we address the security issue in spectrum-leasing-based CIoT networks using physical layer methods. Considering that the CIoT networks are cooperative networks, we propose to employ cooperative jamming to achieve secrecy transmission. In the cooperative jamming scheme, a certain secondary user is employed as the helper to harvest energy transmitted by the source and then uses the harvested energy to generate an artificial noise that jams the eavesdropper without interfering with the legitimate receivers. The goal is to minimize the signal to interference plus noise ratio (SINR) at the eavesdropper subject to the quality of service (QoS) constraints of the primary traffic and the secondary traffic. We formulate the considered minimization problem into a two-stage robust optimization problem based on the worst-case Channel State Information of the Eavesdropper. By using semi-definite programming (SDP), the optimal solutions of the transmit covariance matrices can be obtained. Moreover, in order to build an incentive mechanism for the secondary users, we propose an auction framework based on the cooperative jamming scheme

Worst-Case Cooperative Jamming for Secure Communications in CIoT Networks

Directory of Open Access Journals (Sweden)

Zhen Li

2016-03-01

Full Text Available The Internet of Things (IoT is a significant branch of the ongoing advances in the Internet and mobile communications. Yet, the use of a large number of IoT devices can severely worsen the spectrum scarcity problem. The usable spectrum resources are almost entirely occupied, and thus, the increasing demands of radio access from IoT devices cannot be met. To tackle this problem, the Cognitive Internet of Things (CIoT has been proposed. In a CIoT network, secondary users, i.e., sensors and actuators, can access the licensed spectrum bands provided by licensed primary users (such as cellular telephones. Security is a major concern in CIoT networks. However, the traditional encryption method at upper layers (such as symmetric and asymmetric ciphers may not be suitable for CIoT networks since these networks are composed of low-profile devices. In this paper, we address the security issues in spectrum-leasing-based CIoT networks using physical layer methods. Considering that the CIoT networks are cooperative in nature, we propose to employ cooperative jamming to achieve secure transmission. In our proposed cooperative jamming scheme, a certain secondary user is employed as the helper to harvest energy transmitted by the source and then uses the harvested energy to generate an artificial noise that jams the eavesdropper without interfering with the legitimate receivers. The goal is to minimize the Signal to Interference plus Noise Ratio (SINR at the eavesdropper subject to the Quality of Service (QoS constraints of the primary traffic and the secondary traffic. We formulate the minimization problem into a two-stage robust optimization problem based on the worst-case Channel State Information of the Eavesdropper (ECSI. By using Semi-Definite Programming (SDP, the optimal solutions of the transmit covariance matrices can be obtained. Moreover, in order to build an incentive mechanism for the secondary users, we propose an auction framework based on the

Constraint programming and decision making

CERN Document Server

Kreinovich, Vladik

2014-01-01

In many application areas, it is necessary to make effective decisions under constraints. Several area-specific techniques are known for such decision problems; however, because these techniques are area-specific, it is not easy to apply each technique to other applications areas. Cross-fertilization between different application areas is one of the main objectives of the annual International Workshops on Constraint Programming and Decision Making. Those workshops, held in the US (El Paso, Texas), in Europe (Lyon, France), and in Asia (Novosibirsk, Russia), from 2008 to 2012, have attracted researchers and practitioners from all over the world. This volume presents extended versions of selected papers from those workshops. These papers deal with all stages of decision making under constraints: (1) formulating the problem of multi-criteria decision making in precise terms, (2) determining when the corresponding decision problem is algorithmically solvable; (3) finding the corresponding algorithms, and making...

Constraint Embedding Technique for Multibody System Dynamics

Science.gov (United States)

Woo, Simon S.; Cheng, Michael K.

2011-01-01

Multibody dynamics play a critical role in simulation testbeds for space missions. There has been a considerable interest in the development of efficient computational algorithms for solving the dynamics of multibody systems. Mass matrix factorization and inversion techniques and the O(N) class of forward dynamics algorithms developed using a spatial operator algebra stand out as important breakthrough on this front. Techniques such as these provide the efficient algorithms and methods for the application and implementation of such multibody dynamics models. However, these methods are limited only to tree-topology multibody systems. Closed-chain topology systems require different techniques that are not as efficient or as broad as those for tree-topology systems. The closed-chain forward dynamics approach consists of treating the closed-chain topology as a tree-topology system subject to additional closure constraints. The resulting forward dynamics solution consists of: (a) ignoring the closure constraints and using the O(N) algorithm to solve for the free unconstrained accelerations for the system; (b) using the tree-topology solution to compute a correction force to enforce the closure constraints; and (c) correcting the unconstrained accelerations with correction accelerations resulting from the correction forces. This constraint-embedding technique shows how to use direct embedding to eliminate local closure-loops in the system and effectively convert the system back to a tree-topology system. At this point, standard tree-topology techniques can be brought to bear on the problem. The approach uses a spatial operator algebra approach to formulating the equations of motion. The operators are block-partitioned around the local body subgroups to convert them into aggregate bodies. Mass matrix operator factorization and inversion techniques are applied to the reformulated tree-topology system. Thus in essence, the new technique allows conversion of a system with

Biological constraints do not entail cognitive closure.

Science.gov (United States)

Vlerick, Michael

2014-12-01

From the premise that our biology imposes cognitive constraints on our epistemic activities, a series of prominent authors--most notably Fodor, Chomsky and McGinn--have argued that we are cognitively closed to certain aspects and properties of the world. Cognitive constraints, they argue, entail cognitive closure. I argue that this is not the case. More precisely, I detect two unwarranted conflations at the core of arguments deriving closure from constraints. The first is a conflation of what I will refer to as 'representation' and 'object of representation'. The second confuses the cognitive scope of the assisted mind for that of the unassisted mind. Cognitive closure, I conclude, cannot be established from pointing out the (uncontroversial) existence of cognitive constraints. Copyright © 2014 Elsevier Ltd. All rights reserved.

Level-Set Topology Optimization with Aeroelastic Constraints

Science.gov (United States)

Dunning, Peter D.; Stanford, Bret K.; Kim, H. Alicia

2015-01-01

Level-set topology optimization is used to design a wing considering skin buckling under static aeroelastic trim loading, as well as dynamic aeroelastic stability (flutter). The level-set function is defined over the entire 3D volume of a transport aircraft wing box. Therefore, the approach is not limited by any predefined structure and can explore novel configurations. The Sequential Linear Programming (SLP) level-set method is used to solve the constrained optimization problems. The proposed method is demonstrated using three problems with mass, linear buckling and flutter objective and/or constraints. A constraint aggregation method is used to handle multiple buckling constraints in the wing skins. A continuous flutter constraint formulation is used to handle difficulties arising from discontinuities in the design space caused by a switching of the critical flutter mode.

Constraint Logic Programming approach to protein structure prediction

Directory of Open Access Journals (Sweden)

Fogolari Federico

2004-11-01

Full Text Available Abstract Background The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models. The protein structure prediction problem can be cast in the form of an optimization problem. Notwithstanding its importance, the problem has very seldom been tackled by Constraint Logic Programming, a declarative programming paradigm suitable for solving combinatorial optimization problems. Results Constraint Logic Programming techniques have been applied to the protein structure prediction problem on the face-centered cube lattice model. Molecular dynamics techniques, endowed with the notion of constraint, have been also exploited. Even using a very simplified model, Constraint Logic Programming on the face-centered cube lattice model allowed us to obtain acceptable results for a few small proteins. As a test implementation their (known secondary structure and the presence of disulfide bridges are used as constraints. Simplified structures obtained in this way have been converted to all atom models with plausible structure. Results have been compared with a similar approach using a well-established technique as molecular dynamics. Conclusions The results obtained on small proteins show that Constraint Logic Programming techniques can be employed for studying protein simplified models, which can be converted into realistic all atom models. The advantage of Constraint Logic Programming over other, much more explored, methodologies, resides in the rapid software prototyping, in the easy way of encoding heuristics, and in exploiting all the advances made in this research area, e.g. in constraint propagation and its use for pruning the huge search space.

Constraint Logic Programming approach to protein structure prediction.

Science.gov (United States)

Dal Palù, Alessandro; Dovier, Agostino; Fogolari, Federico

2004-11-30

The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models. The protein structure prediction problem can be cast in the form of an optimization problem. Notwithstanding its importance, the problem has very seldom been tackled by Constraint Logic Programming, a declarative programming paradigm suitable for solving combinatorial optimization problems. Constraint Logic Programming techniques have been applied to the protein structure prediction problem on the face-centered cube lattice model. Molecular dynamics techniques, endowed with the notion of constraint, have been also exploited. Even using a very simplified model, Constraint Logic Programming on the face-centered cube lattice model allowed us to obtain acceptable results for a few small proteins. As a test implementation their (known) secondary structure and the presence of disulfide bridges are used as constraints. Simplified structures obtained in this way have been converted to all atom models with plausible structure. Results have been compared with a similar approach using a well-established technique as molecular dynamics. The results obtained on small proteins show that Constraint Logic Programming techniques can be employed for studying protein simplified models, which can be converted into realistic all atom models. The advantage of Constraint Logic Programming over other, much more explored, methodologies, resides in the rapid software prototyping, in the easy way of encoding heuristics, and in exploiting all the advances made in this research area, e.g. in constraint propagation and its use for pruning the huge search space.

COSMOLOGICAL CONSTRAINTS FROM GALAXY CLUSTERING AND THE MASS-TO-NUMBER RATIO OF GALAXY CLUSTERS

International Nuclear Information System (INIS)

Tinker, Jeremy L.; Blanton, Michael R.; Sheldon, Erin S.; Wechsler, Risa H.; Becker, Matthew R.; Rozo, Eduardo; Zu, Ying; Weinberg, David H.; Zehavi, Idit; Busha, Michael T.; Koester, Benjamin P.

2012-01-01

We place constraints on the average density (Ω m ) and clustering amplitude (σ 8 ) of matter using a combination of two measurements from the Sloan Digital Sky Survey: the galaxy two-point correlation function, w p (r p ), and the mass-to-galaxy-number ratio within galaxy clusters, M/N, analogous to cluster M/L ratios. Our w p (r p ) measurements are obtained from DR7 while the sample of clusters is the maxBCG sample, with cluster masses derived from weak gravitational lensing. We construct nonlinear galaxy bias models using the Halo Occupation Distribution (HOD) to fit both w p (r p ) and M/N for different cosmological parameters. HOD models that match the same two-point clustering predict different numbers of galaxies in massive halos when Ω m or σ 8 is varied, thereby breaking the degeneracy between cosmology and bias. We demonstrate that this technique yields constraints that are consistent and competitive with current results from cluster abundance studies, without the use of abundance information. Using w p (r p ) and M/N alone, we find Ω 0.5 m σ 8 = 0.465 ± 0.026, with individual constraints of Ω m = 0.29 ± 0.03 and σ 8 = 0.85 ± 0.06. Combined with current cosmic microwave background data, these constraints are Ω m = 0.290 ± 0.016 and σ 8 = 0.826 ± 0.020. All errors are 1σ. The systematic uncertainties that the M/N technique are most sensitive to are the amplitude of the bias function of dark matter halos and the possibility of redshift evolution between the SDSS Main sample and the maxBCG cluster sample. Our derived constraints are insensitive to the current level of uncertainties in the halo mass function and in the mass-richness relation of clusters and its scatter, making the M/N technique complementary to cluster abundances as a method for constraining cosmology with future galaxy surveys.

COSMOLOGICAL CONSTRAINTS FROM GALAXY CLUSTERING AND THE MASS-TO-NUMBER RATIO OF GALAXY CLUSTERS

Energy Technology Data Exchange (ETDEWEB)

Tinker, Jeremy L.; Blanton, Michael R. [Center for Cosmology and Particle Physics, Department of Physics, New York University, New York, NY 10013 (United States); Sheldon, Erin S. [Brookhaven National Laboratory, Upton, NY 11973 (United States); Wechsler, Risa H. [Kavli Institute for Particle Astrophysics and Cosmology, Physics Department, and SLAC National Accelerator Laboratory, Stanford University, Stanford, CA 94305 (United States); Becker, Matthew R.; Rozo, Eduardo [Kavli Institute for Cosmological Physics, University of Chicago, Chicago, IL 60637 (United States); Zu, Ying; Weinberg, David H. [Department of Astronomy, Ohio State University, Columbus, OH 43210 (United States); Zehavi, Idit [Department of Astronomy and CERCA, Case Western Reserve University, Cleveland, OH 44106 (United States); Busha, Michael T. [Institute for Theoretical Physics, Department of Physics, University of Zurich, CH-8057 Zurich (Switzerland); Koester, Benjamin P. [Department of Astronomy and Astrophysics, University of Chicago, Chicago, IL 6037 (United States)

2012-01-20

We place constraints on the average density ({Omega}{sub m}) and clustering amplitude ({sigma}{sub 8}) of matter using a combination of two measurements from the Sloan Digital Sky Survey: the galaxy two-point correlation function, w{sub p} (r{sub p} ), and the mass-to-galaxy-number ratio within galaxy clusters, M/N, analogous to cluster M/L ratios. Our w{sub p} (r{sub p} ) measurements are obtained from DR7 while the sample of clusters is the maxBCG sample, with cluster masses derived from weak gravitational lensing. We construct nonlinear galaxy bias models using the Halo Occupation Distribution (HOD) to fit both w{sub p} (r{sub p} ) and M/N for different cosmological parameters. HOD models that match the same two-point clustering predict different numbers of galaxies in massive halos when {Omega}{sub m} or {sigma}{sub 8} is varied, thereby breaking the degeneracy between cosmology and bias. We demonstrate that this technique yields constraints that are consistent and competitive with current results from cluster abundance studies, without the use of abundance information. Using w{sub p} (r{sub p} ) and M/N alone, we find {Omega}{sup 0.5}{sub m}{sigma}{sub 8} = 0.465 {+-} 0.026, with individual constraints of {Omega}{sub m} = 0.29 {+-} 0.03 and {sigma}{sub 8} = 0.85 {+-} 0.06. Combined with current cosmic microwave background data, these constraints are {Omega}{sub m} = 0.290 {+-} 0.016 and {sigma}{sub 8} = 0.826 {+-} 0.020. All errors are 1{sigma}. The systematic uncertainties that the M/N technique are most sensitive to are the amplitude of the bias function of dark matter halos and the possibility of redshift evolution between the SDSS Main sample and the maxBCG cluster sample. Our derived constraints are insensitive to the current level of uncertainties in the halo mass function and in the mass-richness relation of clusters and its scatter, making the M/N technique complementary to cluster abundances as a method for constraining cosmology with future galaxy

Averaging of nonlinearity-managed pulses

International Nuclear Information System (INIS)

Zharnitsky, Vadim; Pelinovsky, Dmitry

2005-01-01

We consider the nonlinear Schroedinger equation with the nonlinearity management which describes Bose-Einstein condensates under Feshbach resonance. By using an averaging theory, we derive the Hamiltonian averaged equation and compare it with other averaging methods developed for this problem. The averaged equation is used for analytical approximations of nonlinearity-managed solitons

Combining parallel detection of proton echo planar spectroscopic imaging (PEPSI) measurements with a data-consistency constraint improves SNR.

Science.gov (United States)

Tsai, Shang-Yueh; Hsu, Yi-Cheng; Chu, Ying-Hua; Kuo, Wen-Jui; Lin, Fa-Hsuan

2015-12-01

One major challenge of MRSI is the poor signal-to-noise ratio (SNR), which can be improved by using a surface coil array. Here we propose to exploit the spatial sensitivity of different channels of a coil array to enforce the k-space data consistency (DC) in order to suppress noise and consequently to improve MRSI SNR. MRSI data were collected using a proton echo planar spectroscopic imaging (PEPSI) sequence at 3 T using a 32-channel coil array and were averaged with one, two and eight measurements (avg-1, avg-2 and avg-8). The DC constraint was applied using a regularization parameter λ of 1, 2, 3, 5 or 10. Metabolite concentrations were quantified using LCModel. Our results show that the suppression of noise by applying the DC constraint to PEPSI reconstruction yields up to 32% and 27% SNR gain for avg-1 and avg-2 data with λ = 5, respectively. According to the reported Cramer-Rao lower bounds, the improvement in metabolic fitting was significant (p < 0.01) when the DC constraint was applied with λ ≥ 2. Using the DC constraint with λ = 3 or 5 can minimize both root-mean-square errors and spatial variation for all subjects using the avg-8 data set as reference values. Our results suggest that MRSI reconstructed with a DC constraint can save around 70% of scanning time to obtain images and spectra with similar SNRs using λ = 5. Copyright © 2015 John Wiley & Sons, Ltd.

Evidence of redshifts in the average solar line profiles of C IV and Si IV from OSO-8 observations

Science.gov (United States)

Roussel-Dupre, D.; Shine, R. A.

1982-01-01

Line profiles of C IV and Si V obtained by the Colorado spectrometer on OSO-8 are presented. It is shown that the mean profiles are redshifted with a magnitude varying from 6-20 km/s, and with a mean of 12 km/s. An apparent average downflow of material in the 50,000-100,000 K temperature range is measured. The redshifts are observed in the line center positions of spatially and temporally averaged profiles and are measured either relative to chromospheric Si I lines or from a comparison of sun center and limb profiles. The observations of 6-20 km/s redshifts place constraints on the mechanisms that dominate EUV line emission since it requires a strong weighting of the emission in regions of downward moving material, and since there is little evidence for corresponding upward moving materials in these lines.

Linear determining equations for differential constraints

International Nuclear Information System (INIS)

Kaptsov, O V

1998-01-01

A construction of differential constraints compatible with partial differential equations is considered. Certain linear determining equations with parameters are used to find such differential constraints. They generalize the classical determining equations used in the search for admissible Lie operators. As applications of this approach equations of an ideal incompressible fluid and non-linear heat equations are discussed

Modifier constraints in alkali ultraphosphate glasses

DEFF Research Database (Denmark)

Rodrigues, B.P.; Mauro, J.C.; Yue, Yuanzheng

2014-01-01

In applying the recently introduced concept of cationic constraint strength [J. Chem. Phys. 140, 214501 (2014)] to bond constraint theory (BCT) of binary phosphate glasses in the ultraphosphate region of xR2O-(1-x)P2O5 (with x ≤ 0.5 and R = {Li, Na, Cs}), we demonstrate that a fundamental limitat...

Implicit Motives and Men’s Perceived Constraint in Fatherhood

Science.gov (United States)

Ruppen, Jessica; Waldvogel, Patricia; Ehlert, Ulrike

2016-01-01

Research shows that implicit motives influence social relationships. However, little is known about their role in fatherhood and, particularly, how men experience their paternal role. Therefore, this study examined the association of implicit motives and fathers’ perceived constraint due to fatherhood. Furthermore, we explored their relation to fathers’ life satisfaction. Participants were fathers with biological children (N = 276). They were asked to write picture stories, which were then coded for implicit affiliation and power motives. Perceived constraint and life satisfaction were assessed on a visual analog scale. A higher implicit need for affiliation was significantly associated with lower perceived constraint, whereas the implicit need for power had the opposite effect. Perceived constraint had a negative influence on life satisfaction. Structural equation modeling revealed significant indirect effects of implicit affiliation and power motives on life satisfaction mediated by perceived constraint. Our findings indicate that men with a higher implicit need for affiliation experience less constraint due to fatherhood, resulting in higher life satisfaction. The implicit need for power, however, results in more perceived constraint and is related to decreased life satisfaction. PMID:27933023

Medical image segmentation by a constraint satisfaction neural network

International Nuclear Information System (INIS)

Chen, C.T.; Tsao, E.C.K.; Lin, W.C.

1991-01-01

This paper proposes a class of Constraint Satisfaction Neural Networks (CSNNs) for solving the problem of medical image segmentation which can be formulated as a Constraint Satisfaction Problem (CSP). A CSNN consists of a set of objects, a set of labels for each object, a collection of constraint relations linking the labels of neighboring objects, and a topological constraint describing the neighborhood relationship among various objects. Each label for a particular object indicates one possible interpretation for that object. The CSNN can be viewed as a collection of neurons that interconnect with each other. The connections and the topology of a CSNN are used to represent the constraints in a CSP. The mechanism of the neural network is to find a solution that satisfies all the constraints in order to achieve a global consistency. The final solution outlines segmented areas and simultaneously satisfies all the constraints. This technique has been applied to medical images and the results show that this CSNN method is a very promising approach for image segmentation

Implicit Motives and Men’s Perceived Constraint in Fatherhood

Directory of Open Access Journals (Sweden)

Jessica Ruppen

2016-11-01

Full Text Available Research shows that implicit motives influence social relationships. However, little is known about their role in fatherhood and, particularly, how men experience their paternal role. Therefore, this study examined the association of implicit motives and fathers’ perceived constraint due to fatherhood. Furthermore, we explored their relation to fathers’ life satisfaction. Participants were fathers with biological children (N = 276. They were asked to write picture stories, which were then coded for implicit affiliation and power motives. Perceived constraint and life satisfaction were assessed on a visual analog scale. A higher implicit need for affiliation was significantly associated with lower perceived constraint, whereas the implicit need for power had the opposite effect. Perceived constraint had a negative influence on life satisfaction. Structural equation modeling revealed significant indirect effects of implicit affiliation and power motives on life satisfaction mediated by perceived constraint. Our findings indicate that men with a higher implicit need for affiliation experience less constraint due to fatherhood, resulting in higher life satisfaction. The implicit need for power, however, results in more perceived constraint and is related to decreased life satisfaction.

Lagrange constraint neural networks for massive pixel parallel image demixing

Science.gov (United States)

Szu, Harold H.; Hsu, Charles C.

2002-03-01

We have shown that the remote sensing optical imaging to achieve detailed sub-pixel decomposition is a unique application of blind source separation (BSS) that is truly linear of far away weak signal, instantaneous speed of light without delay, and along the line of sight without multiple paths. In early papers, we have presented a direct application of statistical mechanical de-mixing method called Lagrange Constraint Neural Network (LCNN). While the BSAO algorithm (using a posteriori MaxEnt ANN and neighborhood pixel average) is not acceptable for remote sensing, a mirror symmetric LCNN approach is all right assuming a priori MaxEnt for unknown sources to be averaged over the source statistics (not neighborhood pixel data) in a pixel-by-pixel independent fashion. LCNN reduces the computation complexity, save a great number of memory devices, and cut the cost of implementation. The Landsat system is designed to measure the radiation to deduce surface conditions and materials. For any given material, the amount of emitted and reflected radiation varies by the wavelength. In practice, a single pixel of a Landsat image has seven channels receiving 0.1 to 12 microns of radiation from the ground within a 20x20 meter footprint containing a variety of radiation materials. A-priori LCNN algorithm provides the spatial-temporal variation of mixture that is hardly de-mixable by other a-posteriori BSS or ICA methods. We have already compared the Landsat remote sensing using both methods in WCCI 2002 Hawaii. Unfortunately the absolute benchmark is not possible because of lacking of the ground truth. We will arbitrarily mix two incoherent sampled images as the ground truth. However, the constant total probability of co-located sources within the pixel footprint is necessary for the remote sensing constraint (since on a clear day the total reflecting energy is constant in neighborhood receiving pixel sensors), we have to normalized two image pixel-by-pixel as well. Then, the

Pair Production Constraints on Superluminal Neutrinos Revisited

International Nuclear Information System (INIS)

Brodsky, Stanley

2012-01-01

We revisit the pair creation constraint on superluminal neutrinos considered by Cohen and Glashow in order to clarify which types of superluminal models are constrained. We show that a model in which the superluminal neutrino is effectively light-like can evade the Cohen-Glashow constraint. In summary, any model for which the CG pair production process operates is excluded because such timelike neutrinos would not be detected by OPERA or other experiments. However, a superluminal neutrino which is effectively lightlike with fixed p 2 can evade the Cohen-Glashow constraint because of energy-momentum conservation. The coincidence involved in explaining the SN1987A constraint certainly makes such a picture improbable - but it is still intrinsically possible. The lightlike model is appealing in that it does not violate Lorentz symmetry in particle interactions, although one would expect Hughes-Drever tests to turn up a violation eventually. Other evasions of the CG constraints are also possible; perhaps, e.g., the neutrino takes a 'short cut' through extra dimensions or suffers anomalous acceleration in matter. Irrespective of the OPERA result, Lorentz-violating interactions remain possible, and ongoing experimental investigation of such possibilities should continue.

Diffusion Processes Satisfying a Conservation Law Constraint

Directory of Open Access Journals (Sweden)

J. Bakosi

2014-01-01

Full Text Available We investigate coupled stochastic differential equations governing N nonnegative continuous random variables that satisfy a conservation principle. In various fields a conservation law requires a set of fluctuating variables to be nonnegative and (if appropriately normalized sum to one. As a result, any stochastic differential equation model to be realizable must not produce events outside of the allowed sample space. We develop a set of constraints on the drift and diffusion terms of such stochastic models to ensure that both the nonnegativity and the unit-sum conservation law constraints are satisfied as the variables evolve in time. We investigate the consequences of the developed constraints on the Fokker-Planck equation, the associated system of stochastic differential equations, and the evolution equations of the first four moments of the probability density function. We show that random variables, satisfying a conservation law constraint, represented by stochastic diffusion processes, must have diffusion terms that are coupled and nonlinear. The set of constraints developed enables the development of statistical representations of fluctuating variables satisfying a conservation law. We exemplify the results with the bivariate beta process and the multivariate Wright-Fisher, Dirichlet, and Lochner’s generalized Dirichlet processes.

Route constraints model based on polychromatic sets

Science.gov (United States)

Yin, Xianjun; Cai, Chao; Wang, Houjun; Li, Dongwu

2018-03-01

With the development of unmanned aerial vehicle (UAV) technology, the fields of its application are constantly expanding. The mission planning of UAV is especially important, and the planning result directly influences whether the UAV can accomplish the task. In order to make the results of mission planning for unmanned aerial vehicle more realistic, it is necessary to consider not only the physical properties of the aircraft, but also the constraints among the various equipment on the UAV. However, constraints among the equipment of UAV are complex, and the equipment has strong diversity and variability, which makes these constraints difficult to be described. In order to solve the above problem, this paper, referring to the polychromatic sets theory used in the advanced manufacturing field to describe complex systems, presents a mission constraint model of UAV based on polychromatic sets.

ON Integrated Chance Constraints in ALM for Pension Funds

OpenAIRE

Youssouf A. F. Toukourou; Fran\\c{c}ois Dufresne

2015-01-01

We discuss the role of integrated chance constraints (ICC) as quantitative risk constraints in asset and liability management (ALM) for pension funds. We define two types of ICC: the one period integrated chance constraint (OICC) and the multiperiod integrated chance constraint (MICC). As their names suggest, the OICC covers only one period whereas several periods are taken into account with the MICC. A multistage stochastic linear programming model is therefore developed for this purpose and...

Constraints and Ambiguity

DEFF Research Database (Denmark)

Dove, Graham; Biskjær, Michael Mose; Lundqvist, Caroline Emilie

2017-01-01

groups of students building three models each. We studied groups building with traditional plastic bricks and also using a digital environment. The building tasks students undertake, and our subsequent analysis, are informed by the role constraints and ambiguity play in creative processes. Based...

QCD unitarity constraints on Reggeon Field Theory

Energy Technology Data Exchange (ETDEWEB)

Kovner, Alex [Physics Department, University of Connecticut,2152 Hillside Road, Storrs, CT 06269 (United States); Levin, Eugene [Departemento de Física, Universidad Técnica Federico Santa María,and Centro Científico-Tecnológico de Valparaíso,Avda. Espana 1680, Casilla 110-V, Valparaíso (Chile); Department of Particle Physics, Tel Aviv University,Tel Aviv 69978 (Israel); Lublinsky, Michael [Physics Department, Ben-Gurion University of the Negev,Beer Sheva 84105 (Israel); Physics Department, University of Connecticut,2152 Hillside Road, Storrs, CT 06269 (United States)

2016-08-04

We point out that the s-channel unitarity of QCD imposes meaningful constraints on a possible form of the QCD Reggeon Field Theory. We show that neither the BFKL nor JIMWLK nor Braun’s Hamiltonian satisfy the said constraints. In a toy, zero transverse dimensional case we construct a model that satisfies the analogous constraint and show that at infinite energy it indeed tends to a “black disk limit' as opposed to the model with triple Pomeron vertex only, routinely used as a toy model in the literature.

QCD unitarity constraints on Reggeon Field Theory

International Nuclear Information System (INIS)

Kovner, Alex; Levin, Eugene; Lublinsky, Michael

2016-01-01

We point out that the s-channel unitarity of QCD imposes meaningful constraints on a possible form of the QCD Reggeon Field Theory. We show that neither the BFKL nor JIMWLK nor Braun’s Hamiltonian satisfy the said constraints. In a toy, zero transverse dimensional case we construct a model that satisfies the analogous constraint and show that at infinite energy it indeed tends to a “black disk limit' as opposed to the model with triple Pomeron vertex only, routinely used as a toy model in the literature.

Constraint satisfaction problems CSP formalisms and techniques

CERN Document Server

Ghedira, Khaled

2013-01-01

A Constraint Satisfaction Problem (CSP) consists of a set of variables, a domain of values for each variable and a set of constraints. The objective is to assign a value for each variable such that all constraints are satisfied. CSPs continue to receive increased attention because of both their high complexity and their omnipresence in academic, industrial and even real-life problems. This is why they are the subject of intense research in both artificial intelligence and operations research. This book introduces the classic CSP and details several extensions/improvements of both formalisms a

Use of dose constraints for occupational exposure

International Nuclear Information System (INIS)

Kaijage, Tunu

2015-02-01

The use of dose constraints for occupational exposure was reviewed in this project. The role of dose constraints as used in optimization of protection of workers was described. Different issues to be considered in application of the concept and challenges associated with their implementation were also discussed. The situation where dose constraints could be misinterpreted to dose limits is also explained as the two are clearly differentiated by the International Commission of Radiological Protection (ICRP) Publication 103. Moreover, recommendations to all parties responsible for protection and safety of workers were discussed. (au)

Accuracy Constraint Determination in Fixed-Point System Design

Directory of Open Access Journals (Sweden)

Serizel R

2008-01-01

Full Text Available Most of digital signal processing applications are specified and designed with floatingpoint arithmetic but are finally implemented using fixed-point architectures. Thus, the design flow requires a floating-point to fixed-point conversion stage which optimizes the implementation cost under execution time and accuracy constraints. This accuracy constraint is linked to the application performances and the determination of this constraint is one of the key issues of the conversion process. In this paper, a method is proposed to determine the accuracy constraint from the application performance. The fixed-point system is modeled with an infinite precision version of the system and a single noise source located at the system output. Then, an iterative approach for optimizing the fixed-point specification under the application performance constraint is defined and detailed. Finally the efficiency of our approach is demonstrated by experiments on an MP3 encoder.

Theory of constraints: A state-of-art review

Directory of Open Access Journals (Sweden)

Maryam Orouji

2015-11-01

Full Text Available The theory of constraints (TOC is a management tool, which considers any manageable system as being limited in reaching more of its objectives by some constraints. According to TOC, there is always, at least, one single constraint, and TOC implements a concentrating process to detect the constraint and restructure the remaining of the organization around it. This paper presents an overview of different perspectives of TOC and its implementation in different industries such as project management, quality management, outsourcing, product mix, make-to-buy, accounting, banking and health care, etc. The results indicate that the method has been extensively implemented in different areas of accounting.

Latin hypercube sampling with inequality constraints

International Nuclear Information System (INIS)

Iooss, B.; Petelet, M.; Asserin, O.; Loredo, A.

2010-01-01

In some studies requiring predictive and CPU-time consuming numerical models, the sampling design of the model input variables has to be chosen with caution. For this purpose, Latin hypercube sampling has a long history and has shown its robustness capabilities. In this paper we propose and discuss a new algorithm to build a Latin hypercube sample (LHS) taking into account inequality constraints between the sampled variables. This technique, called constrained Latin hypercube sampling (cLHS), consists in doing permutations on an initial LHS to honor the desired monotonic constraints. The relevance of this approach is shown on a real example concerning the numerical welding simulation, where the inequality constraints are caused by the physical decreasing of some material properties in function of the temperature. (authors)

The difference between alternative averages

Directory of Open Access Journals (Sweden)

James Vaupel

2012-09-01

Full Text Available BACKGROUND Demographers have long been interested in how compositional change, e.g., change in age structure, affects population averages. OBJECTIVE We want to deepen understanding of how compositional change affects population averages. RESULTS The difference between two averages of a variable, calculated using alternative weighting functions, equals the covariance between the variable and the ratio of the weighting functions, divided by the average of the ratio. We compare weighted and unweighted averages and also provide examples of use of the relationship in analyses of fertility and mortality. COMMENTS Other uses of covariances in formal demography are worth exploring.

Medical image segmentation by means of constraint satisfaction neural network

International Nuclear Information System (INIS)

Chen, C.T.; Tsao, C.K.; Lin, W.C.

1990-01-01

This paper applies the concept of constraint satisfaction neural network (CSNN) to the problem of medical image segmentation. Constraint satisfaction (or constraint propagation), the procedure to achieve global consistency through local computation, is an important paradigm in artificial intelligence. CSNN can be viewed as a three-dimensional neural network, with the two-dimensional image matrix as its base, augmented by various constraint labels for each pixel. These constraint labels can be interpreted as the connections and the topology of the neural network. Through parallel and iterative processes, the CSNN will approach a solution that satisfies the given constraints thus providing segmented regions with global consistency

The Relationship between Leisure Constraints, Constraint Negotiation Strategies and Facilitators with Recreational Sport Activity Participation of College Students

Science.gov (United States)

Kocak, Funda

2017-01-01

The aim of this study is to determine the constraints in participating the leisure activities for college students, the strategies of negotiation regarding these constraints and the relationship between the facilitators and activity participation. The population of the study consists of currently registered students from Ankara University.…

Tailored parameter optimization methods for ordinary differential equation models with steady-state constraints.

Science.gov (United States)

Fiedler, Anna; Raeth, Sebastian; Theis, Fabian J; Hausser, Angelika; Hasenauer, Jan

2016-08-22

Ordinary differential equation (ODE) models are widely used to describe (bio-)chemical and biological processes. To enhance the predictive power of these models, their unknown parameters are estimated from experimental data. These experimental data are mostly collected in perturbation experiments, in which the processes are pushed out of steady state by applying a stimulus. The information that the initial condition is a steady state of the unperturbed process provides valuable information, as it restricts the dynamics of the process and thereby the parameters. However, implementing steady-state constraints in the optimization often results in convergence problems. In this manuscript, we propose two new methods for solving optimization problems with steady-state constraints. The first method exploits ideas from optimization algorithms on manifolds and introduces a retraction operator, essentially reducing the dimension of the optimization problem. The second method is based on the continuous analogue of the optimization problem. This continuous analogue is an ODE whose equilibrium points are the optima of the constrained optimization problem. This equivalence enables the use of adaptive numerical methods for solving optimization problems with steady-state constraints. Both methods are tailored to the problem structure and exploit the local geometry of the steady-state manifold and its stability properties. A parameterization of the steady-state manifold is not required. The efficiency and reliability of the proposed methods is evaluated using one toy example and two applications. The first application example uses published data while the second uses a novel dataset for Raf/MEK/ERK signaling. The proposed methods demonstrated better convergence properties than state-of-the-art methods employed in systems and computational biology. Furthermore, the average computation time per converged start is significantly lower. In addition to the theoretical results, the

Extended Set Constraints and Tree Grammar Abstraction of Programs

DEFF Research Database (Denmark)

Rosendahl, Mads; Gallagher, John Patrick

2011-01-01

Set constraints are relations between sets of ground terms or trees. This paper presents two main contributions: firstly we consider an extension of the systems of set constraints to include a tuple constructor, and secondly we construct a simplified solution procedure for set constraints. We...

Constraints, Trade-offs and the Currency of Fitness.

Science.gov (United States)

Acerenza, Luis

2016-03-01

Understanding evolutionary trajectories remains a difficult task. This is because natural evolutionary processes are simultaneously affected by various types of constraints acting at the different levels of biological organization. Of particular importance are constraints where correlated changes occur in opposite directions, called trade-offs. Here we review and classify the main evolutionary constraints and trade-offs, operating at all levels of trait hierarchy. Special attention is given to life history trade-offs and the conflict between the survival and reproduction components of fitness. Cellular mechanisms underlying fitness trade-offs are described. At the metabolic level, a linear trade-off between growth and flux variability was found, employing bacterial genome-scale metabolic reconstructions. Its analysis indicates that flux variability can be considered as the currency of fitness. This currency is used for fitness transfer between fitness components during adaptations. Finally, a discussion is made regarding the constraints which limit the increase in the amount of fitness currency during evolution, suggesting that occupancy constraints are probably the main restrictions.

Origin of constraints in relativistic classical Hamiltonian dynamics

International Nuclear Information System (INIS)

Mallik, S.; Hugentobler, E.

1979-01-01

We investigate the null-plane or the front form of relativistic classical Hamiltonian dynamics as proposed by Dirac and developed by Leutwyler and Stern. For systems of two spinless particles we show that the algebra of Poincare generators is equivalent to describing dynamics in terms of two covariant constraint equations, the Poisson bracket of the two constraints being weakly zero. The latter condition is solved for certain simple forms of constraints

Export constraints facing Lesotho-based manufacturing enterprises

Directory of Open Access Journals (Sweden)

Motšelisi C. Mokhethi

2015-07-01

Full Text Available Orientation: Exporting is preferred by many enterprises as the mode of foreign entry as it requires less commitment of organisational resources and offers flexibility of managerial actions. However, enterprises face a number of challenges when attempting to initiate exports or expand their export operations. Research purpose: This study was undertaken to determine the characteristics and composition of export barriers constraining exporting by Lesotho-based manufacturing enterprises. Motivation for the study: Lesotho is faced with low destination diversity and low diversity in export products. Research design, approach and method: Data was collected from 162 Lesotho-based manufacturing enterprises through a self-administered questionnaire. Main findings: In its findings, the study firstly identified international constraints, distribution constraints and financial constraints as factors constraining exporting. Secondly, it was determined that three exporting constraints, all internal to the enterprise and all related to one factor (namely financial constraint hampered exporting. Lastly, the ANOVA results revealed that the perceptions of export constraints differed according to the enterprise characteristics, enterprise size, ownership and type of industry. Contribution/value-add: With the majority of enterprises in this study being identified as micro-enterprises, the government of Lesotho needs to pay particular attention to addressing the export needs of these enterprises in order to enable them to participate in exporting activities − especially considering that they can play a pivotal role in the alleviation of poverty, job creation and economic rejuvenation.

Einstein constraints in the Yang-Mills form

International Nuclear Information System (INIS)

Ashtekar, A.

1987-01-01

It is pointed out that constraints of Einstein's theory play a powerful role in both classical and quantum theory because they generate motions in spacetime, rather than in an internal space. New variables are then introduced on the Einstein phase space in terms of which constraints simplify considerably. In particular, the use of these variables enables one to imbed the constraint surface of Einstein's theory into that of Yang-Mills. The imbedding suggests new lines of attack to a number of problems in classical and quantum gravity and provides new concepts and tools to investigate the microscopic structure of space-time geometry

Non-technical constraints to eradication: the Italian experience.

Science.gov (United States)

Moda, Giuliana

2006-02-25

Although technical constraints to eradication of bovine tuberculosis are well-recognised, non-technical constraints can also delay progress towards eradication, leading to inefficiency and increased programme costs. This paper seeks to analyse the main non-technical constraints that can interfere with the successful implementation of tuberculosis eradication plans, based on experiences from an area of high tuberculosis prevalence in Regione Piemonte, Italy. The main social and economic constraints faced in the past 20 years are reviewed, including a social reluctance to recognise the importance of seeking eradication as the goal of disease control, effective communication of technical issues, the training and the organization of veterinary services, the relationship between the regional authority and farmers and their representatives, and data management and epidemiological reporting. The paper analyses and discusses the solutions that were applied in Regione Piemonte and the benefits that were obtained. Tuberculosis eradication plans are one of the most difficult tasks of the Veterinary Animal Health Services, and non-technical constraints must be considered when progress towards eradication is less than expected. Organizational and managerial resources can help to overcome social or economic obstacles, provided the veterinary profession is willing to address technical, but also non-technical, constraints to eradication.

A Foot-Mounted Inertial Measurement Unit (IMU) Positioning Algorithm Based on Magnetic Constraint.

Science.gov (United States)

Wang, Yan; Li, Xin; Zou, Jiaheng

2018-03-01

With the development of related applications, indoor positioning techniques have been more and more widely developed. Based on Wi-Fi, Bluetooth low energy (BLE) and geomagnetism, indoor positioning techniques often rely on the physical location of fingerprint information. The focus and difficulty of establishing the fingerprint database are in obtaining a relatively accurate physical location with as little given information as possible. This paper presents a foot-mounted inertial measurement unit (IMU) positioning algorithm under the loop closure constraint based on magnetic information. It can provide relatively reliable position information without maps and geomagnetic information and provides a relatively accurate coordinate for the collection of a fingerprint database. In the experiment, the features extracted by the multi-level Fourier transform method proposed in this paper are validated and the validity of loop closure matching is tested with a RANSAC-based method. Moreover, the loop closure detection results show that the cumulative error of the trajectory processed by the graph optimization algorithm is significantly suppressed, presenting a good accuracy. The average error of the trajectory under loop closure constraint is controlled below 2.15 m.

A Foot-Mounted Inertial Measurement Unit (IMU Positioning Algorithm Based on Magnetic Constraint

Directory of Open Access Journals (Sweden)

Yan Wang

2018-03-01

Full Text Available With the development of related applications, indoor positioning techniques have been more and more widely developed. Based on Wi-Fi, Bluetooth low energy (BLE and geomagnetism, indoor positioning techniques often rely on the physical location of fingerprint information. The focus and difficulty of establishing the fingerprint database are in obtaining a relatively accurate physical location with as little given information as possible. This paper presents a foot-mounted inertial measurement unit (IMU positioning algorithm under the loop closure constraint based on magnetic information. It can provide relatively reliable position information without maps and geomagnetic information and provides a relatively accurate coordinate for the collection of a fingerprint database. In the experiment, the features extracted by the multi-level Fourier transform method proposed in this paper are validated and the validity of loop closure matching is tested with a RANSAC-based method. Moreover, the loop closure detection results show that the cumulative error of the trajectory processed by the graph optimization algorithm is significantly suppressed, presenting a good accuracy. The average error of the trajectory under loop closure constraint is controlled below 2.15 m.

Performance analysis of power-efficient adaptive interference cancelation in fading channels

KAUST Repository

Radaydeh, Redha Mahmoud Mesleh; Alouini, Mohamed-Slim

2010-01-01

This paper analyzes the performance of a -steering scheme for highly correlated receive antennas in the presence of statistically unordered co-channel interferers over multipath fading channels. An adaptive activation of receive antennas according to the interfering signals fading conditions is considered in the analysis. Analytical expressions for various system performance measures, including the outage probability, average error probability of different signaling schemes, and raw moments of the combined signal-to-interference-plus-noise ratio (SINR) are obtained in exact forms. Numerical and simulation results for the performance-complexity tradeoff of this scheme is presented and then compared with that of full-size arbitrary interference cancelation and no cancelation scenarios. ©2010 IEEE.

Performance analysis of power-efficient adaptive interference cancelation in fading channels

KAUST Repository

Radaydeh, Redha Mahmoud Mesleh

2010-12-01

This paper analyzes the performance of a -steering scheme for highly correlated receive antennas in the presence of statistically unordered co-channel interferers over multipath fading channels. An adaptive activation of receive antennas according to the interfering signals fading conditions is considered in the analysis. Analytical expressions for various system performance measures, including the outage probability, average error probability of different signaling schemes, and raw moments of the combined signal-to-interference-plus-noise ratio (SINR) are obtained in exact forms. Numerical and simulation results for the performance-complexity tradeoff of this scheme is presented and then compared with that of full-size arbitrary interference cancelation and no cancelation scenarios. ©2010 IEEE.

Evaluating Direct Manipulation Operations for Constraint-Based Layout

OpenAIRE

Zeidler , Clemens; Lutteroth , Christof; Stuerzlinger , Wolfgang; Weber , Gerald

2013-01-01

Part 11: Interface Layout and Data Entry; International audience; Layout managers are used to control the placement of widgets in graphical user interfaces (GUIs). Constraint-based layout managers are more powerful than other ones. However, they are also more complex and their layouts are prone to problems that usually require direct editing of constraints. Today, designers commonly use GUI builders to specify GUIs. The complexities of traditional approaches to constraint-based layouts pose c...

Optimal Portfolio Choice with Wash Sale Constraints

DEFF Research Database (Denmark)

Astrup Jensen, Bjarne; Marekwica, Marcel

2011-01-01

We analytically solve the portfolio choice problem in the presence of wash sale constraints in a two-period model with one risky asset. Our results show that wash sale constraints can heavily affect portfolio choice of investors with unrealized losses. The trading behavior of such investors...

Best-Response Distributed Subchannel Selection for Minimizing Interference in Femtocell Networks}

Directory of Open Access Journals (Sweden)

Somsak Kittipiyakul

2015-08-01

Full Text Available We study a distributed channel allocation problem of non-cooperative OFDMA femtocells in two-tiered macro-femto networks. The objective is to maximize the total capacity of uplink macro users and femto users. We assume a time-slotted system, a time-invariant channel model (no fading, each user knows the signal-to-interference-plus-noise ratio (SINR of all channels, and the channel selection happens only at the beginning of each time-slot. We study the performance of a best-response strategy where each user chooses to transmit in the highest-SINR channel. For simplicity, we focus on the homogeneous 3-link, 2-channel case and show that if all users update their actions every time-slot (i.e., all users make simultaneous moves, an oscillation can occur and result in the worst performance. To avoid the oscillation and achieve the highest total capacity, while still assuming no coordination among the users, we propose a stochastic best-response algorithm, where each user updates its channel selection with a selection probability p. We use a Markov chain to analyze the average capacity performance and use simulation results to confirm our analysis and also provide performance of other homogeneous cases with more number of links and channels. It is shown that the highest total capacity can be achieved when the selection probability p is very small. This stochastic best response with small p in effect provides a sequential move mechanism which requires no coordination.

Optimal capital stock and financing constraints

OpenAIRE

Saltari, Enrico; Giuseppe, Travaglini

2011-01-01

In this paper we show that financing constraints affect the optimal level of capital stock even when the financing constraint is ineffective. This happens when the firm rationally anticipates that access to external financing resources may be rationed in the future. We will show that with these expectations, the optimal investment policy is to invest less in any given period, thereby lowering the desired optimal capital stock in the long run.

Isocurvature constraints on portal couplings

Energy Technology Data Exchange (ETDEWEB)

Kainulainen, Kimmo; Nurmi, Sami; Vaskonen, Ville [Department of Physics, University of Jyväskylä, P.O.Box 35 (YFL), FI-40014 University of Jyväskylä (Finland); Tenkanen, Tommi; Tuominen, Kimmo, E-mail: kimmo.kainulainen@jyu.fi, E-mail: sami.t.nurmi@jyu.fi, E-mail: tommi.tenkanen@helsinki.fi, E-mail: kimmo.i.tuominen@helsinki.fi, E-mail: ville.vaskonen@jyu.fi [Department of Physics, University of Helsinki P.O. Box 64, FI-00014, Helsinki (Finland)

2016-06-01

We consider portal models which are ultraweakly coupled with the Standard Model, and confront them with observational constraints on dark matter abundance and isocurvature perturbations. We assume the hidden sector to contain a real singlet scalar s and a sterile neutrino ψ coupled to s via a pseudoscalar Yukawa term. During inflation, a primordial condensate consisting of the singlet scalar s is generated, and its contribution to the isocurvature perturbations is imprinted onto the dark matter abundance. We compute the total dark matter abundance including the contributions from condensate decay and nonthermal production from the Standard Model sector. We then use the Planck limit on isocurvature perturbations to derive a novel constraint connecting dark matter mass and the singlet self coupling with the scale of inflation: m {sub DM}/GeV ∼< 0.2λ{sub s}{sup 3/8} ( H {sub *}/10{sup 11} GeV){sup −3/2}. This constraint is relevant in most portal models ultraweakly coupled with the Standard Model and containing light singlet scalar fields.

Network Design with Node Degree Balance Constraints

DEFF Research Database (Denmark)

Pedersen, Michael Berliner; Crainic, Teodor Gabriel

This presentation discusses an extension to the network design model where there in addition to the flow conservation constraints also are constraints that require design conservation. This means that the number of arcs entering and leaving a node must be the same. As will be shown the model has ...

Constraint solving for direct manipulation of features

NARCIS (Netherlands)

Lourenco, D.; Oliveira, P.; Noort, A.; Bidarra, R.

2006-01-01

In current commercial feature modeling systems, support for direct manipulation of features is not commonly available. This is partly due to the strong reliance of such systems on constraints, but also to the lack of speed of current constraint solvers. In this paper, an approach to the optimization

Molecular dynamics simulations on PGLa using NMR orientational constraints

Energy Technology Data Exchange (ETDEWEB)

Sternberg, Ulrich, E-mail: ulrich.sternberg@partner.kit.edu; Witter, Raiker [Tallinn University of Technology, Technomedicum (Estonia)

2015-11-15

NMR data obtained by solid state NMR from anisotropic samples are used as orientational constraints in molecular dynamics simulations for determining the structure and dynamics of the PGLa peptide within a membrane environment. For the simulation the recently developed molecular dynamics with orientational constraints technique (MDOC) is used. This method introduces orientation dependent pseudo-forces into the COSMOS-NMR force field. Acting during a molecular dynamics simulation these forces drive molecular rotations, re-orientations and folding in such a way that the motional time-averages of the tensorial NMR properties are consistent with the experimentally measured NMR parameters. This MDOC strategy does not depend on the initial choice of atomic coordinates, and is in principle suitable for any flexible and mobile kind of molecule; and it is of course possible to account for flexible parts of peptides or their side-chains. MDOC has been applied to the antimicrobial peptide PGLa and a related dimer model. With these simulations it was possible to reproduce most NMR parameters within the experimental error bounds. The alignment, conformation and order parameters of the membrane-bound molecule and its dimer were directly derived with MDOC from the NMR data. Furthermore, this new approach yielded for the first time the distribution of segmental orientations with respect to the membrane and the order parameter tensors of the dimer systems. It was demonstrated the deuterium splittings measured at the peptide to lipid ratio of 1/50 are consistent with a membrane spanning orientation of the peptide.

Constraint processing in our extensible language for cooperative imaging system

Science.gov (United States)

Aoki, Minoru; Murao, Yo; Enomoto, Hajime

1996-02-01

The extensible WELL (Window-based elaboration language) has been developed using the concept of common platform, where both client and server can communicate with each other with support from a communication manager. This extensible language is based on an object oriented design by introducing constraint processing. Any kind of services including imaging in the extensible language is controlled by the constraints. Interactive functions between client and server are extended by introducing agent functions including a request-respond relation. Necessary service integrations are satisfied with some cooperative processes using constraints. Constraints are treated similarly to data, because the system should have flexibilities in the execution of many kinds of services. The similar control process is defined by using intentional logic. There are two kinds of constraints, temporal and modal constraints. Rendering the constraints, the predicate format as the relation between attribute values can be a warrant for entities' validity as data. As an imaging example, a processing procedure of interaction between multiple objects is shown as an image application for the extensible system. This paper describes how the procedure proceeds in the system, and that how the constraints work for generating moving pictures.

Bayesian model averaging and weighted average least squares : Equivariance, stability, and numerical issues

NARCIS (Netherlands)

De Luca, G.; Magnus, J.R.

2011-01-01

In this article, we describe the estimation of linear regression models with uncertainty about the choice of the explanatory variables. We introduce the Stata commands bma and wals, which implement, respectively, the exact Bayesian model-averaging estimator and the weighted-average least-squares

Constraints in distortion-invariant target recognition system simulation

Science.gov (United States)

Iftekharuddin, Khan M.; Razzaque, Md A.

2000-11-01

Automatic target recognition (ATR) is a mature but active research area. In an earlier paper, we proposed a novel ATR approach for recognition of targets varying in fine details, rotation, and translation using a Learning Vector Quantization (LVQ) Neural Network (NN). The proposed approach performed segmentation of multiple objects and the identification of the objects using LVQNN. In this current paper, we extend the previous approach for recognition of targets varying in rotation, translation, scale, and combination of all three distortions. We obtain the analytical results of the system level design to show that the approach performs well with some constraints. The first constraint determines the size of the input images and input filters. The second constraint shows the limits on amount of rotation, translation, and scale of input objects. We present the simulation verification of the constraints using DARPA's Moving and Stationary Target Recognition (MSTAR) images with different depression and pose angles. The simulation results using MSTAR images verify the analytical constraints of the system level design.

Brain evolution and development: adaptation, allometry and constraint

Science.gov (United States)

Barton, Robert A.

2016-01-01

Phenotypic traits are products of two processes: evolution and development. But how do these processes combine to produce integrated phenotypes? Comparative studies identify consistent patterns of covariation, or allometries, between brain and body size, and between brain components, indicating the presence of significant constraints limiting independent evolution of separate parts. These constraints are poorly understood, but in principle could be either developmental or functional. The developmental constraints hypothesis suggests that individual components (brain and body size, or individual brain components) tend to evolve together because natural selection operates on relatively simple developmental mechanisms that affect the growth of all parts in a concerted manner. The functional constraints hypothesis suggests that correlated change reflects the action of selection on distributed functional systems connecting the different sub-components, predicting more complex patterns of mosaic change at the level of the functional systems and more complex genetic and developmental mechanisms. These hypotheses are not mutually exclusive but make different predictions. We review recent genetic and neurodevelopmental evidence, concluding that functional rather than developmental constraints are the main cause of the observed patterns. PMID:27629025

Sustainability constraints on UK bioenergy development

International Nuclear Information System (INIS)

Thornley, Patricia; Upham, Paul; Tomei, Julia

2009-01-01

Use of bioenergy as a renewable resource is increasing in many parts of the world and can generate significant environmental, economic and social benefits if managed with due regard to sustainability constraints. This work reviews the environmental, social and economic constraints on key feedstocks for UK heat, power and transport fuel. Key sustainability constraints include greenhouse gas savings achieved for different fuels, land availability, air quality impacts and facility siting. Applying those constraints, we estimate that existing technologies would facilitate a sustainability constrained level of medium-term bioenergy/biofuel supply to the UK of 4.9% of total energy demand, broken down into 4.3% of heat demands, 4.3% of electricity, and 5.8% of transport fuel. This suggests that attempts to increase the supply above these levels could have counterproductive sustainability impacts in the absence of compensating technology developments or identification of additional resources. The barriers that currently prevent this level of supply being achieved have been analysed and classified. This suggests that the biggest policy impacts would be in stimulating the market for heat demand in rural areas, supporting feedstock prices in a manner that incentivised efficient use/maximum greenhouse gas savings and targeting investment capital that improves yield and reduces land-take.

Nonlinear Model Predictive Control with Constraint Satisfactions for a Quadcopter

Science.gov (United States)

Wang, Ye; Ramirez-Jaime, Andres; Xu, Feng; Puig, Vicenç

2017-01-01

This paper presents a nonlinear model predictive control (NMPC) strategy combined with constraint satisfactions for a quadcopter. The full dynamics of the quadcopter describing the attitude and position are nonlinear, which are quite sensitive to changes of inputs and disturbances. By means of constraint satisfactions, partial nonlinearities and modeling errors of the control-oriented model of full dynamics can be transformed into the inequality constraints. Subsequently, the quadcopter can be controlled by an NMPC controller with the updated constraints generated by constraint satisfactions. Finally, the simulation results applied to a quadcopter simulator are provided to show the effectiveness of the proposed strategy.

Lorentz violation. Motivation and new constraints

Energy Technology Data Exchange (ETDEWEB)

Liberati, S. [Scuola Internazionale Superiore di Studi Avanzati SISSA, Trieste (Italy); Istituto Nazionale di Fisica Nucleare INFN, Sezione di Trieste (Italy); Maccione, L. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)

2009-09-15

We review the main theoretical motivations and observational constraints on Planck scale sup-pressed violations of Lorentz invariance. After introducing the problems related to the phenomenological study of quantum gravitational effects, we discuss the main theoretical frameworks within which possible departures from Lorentz invariance can be described. In particular, we focus on the framework of Effective Field Theory, describing several possible ways of including Lorentz violation therein and discussing their theoretical viability. We review the main low energy effects that are expected in this framework. We discuss the current observational constraints on such a framework, focusing on those achievable through high-energy astrophysics observations. In this context we present a summary of the most recent and strongest constraints on QED with Lorentz violating non-renormalizable operators. Finally, we discuss the present status of the field and its future perspectives. (orig.)

Lorentz violation. Motivation and new constraints

International Nuclear Information System (INIS)

Liberati, S.; Maccione, L.

2009-09-01

We review the main theoretical motivations and observational constraints on Planck scale sup-pressed violations of Lorentz invariance. After introducing the problems related to the phenomenological study of quantum gravitational effects, we discuss the main theoretical frameworks within which possible departures from Lorentz invariance can be described. In particular, we focus on the framework of Effective Field Theory, describing several possible ways of including Lorentz violation therein and discussing their theoretical viability. We review the main low energy effects that are expected in this framework. We discuss the current observational constraints on such a framework, focusing on those achievable through high-energy astrophysics observations. In this context we present a summary of the most recent and strongest constraints on QED with Lorentz violating non-renormalizable operators. Finally, we discuss the present status of the field and its future perspectives. (orig.)

Coping with the work constraints in crop-livestock farming systems

Directory of Open Access Journals (Sweden)

Mohamed Taher Sraïri

2017-06-01

Full Text Available This research aims to characterize the ways crop-livestock farms adapt themselves to work constraints. A follow-up of work activities was achieved in a sample of 14 family farms. Work times in each agricultural activity (livestock and crops were quantified, distinguishing the contributions of family members and that of the off-farm workers. Results showed that the annual working time averaged 1030 days per year per farm. It increased with multiple activities within farms. Work devoted to livestock averaged 581 days a year, mainly achieved by family members, while crops necessitated 449 days of work, mostly assumed by off farm workers. Farms with limited arable land devoted significant time to livestock. The results also revealed that the gross incomes from one day of work in livestock were almost 50-times less than those from the same duration in cash crops. Altogether, the results confirm the necessity to consider work as a crucial variable determining farming systems’ performances and the use efficiency of this input. As a consequence, in many developing countries, the assumption of plenty of family workers availability may not be valid anymore to justify agricultural policies mainly based on intense on-farm work uses.

Pension fund's illiquid assets allocation under liquidity and capital constraints

OpenAIRE

Broeders, Dirk; Jansen, Kristy; Werker, Bas

2017-01-01

This paper empirically assesses the impact of liquidity and capital constraints on the allocation of defined benefit pension funds to illiquid assets. Liquidity constraints result from short-term pension payments and collateral requirements on derivatives. Capital constraints follow from the requirement to retain sufficient capital to absorb unexpected losses. Liability duration and hedging affect the allocation to illiquid assets through both these constraints. First, we find a hump-shaped i...

Distribution system constraints and their impact on distributed generation: final report

Energy Technology Data Exchange (ETDEWEB)

Thornycroft, J.; Caisley, A.; Russell, T.; Willis, S.; Youssef, R.; Bawden, R.; Holden, G.; Williams, J.

2004-05-01

This report examines constraints due to the connection of distributed generators to the distribution network focusing on small generators with the aim of developing technical and economic models to examine the relationship between the initial investment and the ensuing cost of the constraints under different scenarios. Constraints are defined as limitations to operation of connected generators, and the types of constraints, and the allocation of reinforcement and constraint costs are considered. Details are given of the modeling of sections of urban, rural and semi-rural network at Faversham, and the current constraints on this network are described.

Understanding the leisure constraints of Hispanic-Americans in Northern Virginia: an exploratory analysis of constraints, socioeconomic status and acculturation

Science.gov (United States)

Edward F, II Byrne; Ellen B. Drogin Rodgers

2003-01-01

The purpose of this study is to investigate the constraints to use of outdoor recreation resources and participation in leisure activities among Hispanic restaurant workers in Northern Virginia; specifically, the relationship of socioeconomic status and acculturation to leisure constraints. The dramatic rate of increase of Hispanic-Americans, the group's low...

Self-Imposed Creativity Constraints

DEFF Research Database (Denmark)

Biskjaer, Michael Mose

2013-01-01

Abstract This dissertation epitomizes three years of research guided by the research question: how can we conceptualize creative self-binding as a resource in art and design processes? Concretely, the dissertation seeks to offer insight into the puzzling observation that highly skilled creative...... practitioners sometimes freely and intentionally impose rigid rules, peculiar principles, and other kinds of creative obstructions on themselves as a means to spur momentum in the process and reach a distinctly original outcome. To investigate this the dissertation is composed of four papers (Part II) framed...... of analysis. Informed by the insight that constraints both enable and restrain creative agency, the dissertation’s main contention is that creative self- binding may profitably be conceptualized as the exercise of self-imposed creativity constraints. Thus, the dissertation marks an analytical move from vague...

Distance Constraint Satisfaction Problems

Science.gov (United States)

Bodirsky, Manuel; Dalmau, Victor; Martin, Barnaby; Pinsker, Michael

We study the complexity of constraint satisfaction problems for templates Γ that are first-order definable in ({ Z}; {suc}), the integers with the successor relation. Assuming a widely believed conjecture from finite domain constraint satisfaction (we require the tractability conjecture by Bulatov, Jeavons and Krokhin in the special case of transitive finite templates), we provide a full classification for the case that Γ is locally finite (i.e., the Gaifman graph of Γ has finite degree). We show that one of the following is true: The structure Γ is homomorphically equivalent to a structure with a certain majority polymorphism (which we call modular median) and CSP(Γ) can be solved in polynomial time, or Γ is homomorphically equivalent to a finite transitive structure, or CSP(Γ) is NP-complete.

Notes on Well-Posed, Ensemble Averaged Conservation Equations for Multiphase, Multi-Component, and Multi-Material Flows

International Nuclear Information System (INIS)

Ray A. Berry

2005-01-01

At the INL researchers and engineers routinely encounter multiphase, multi-component, and/or multi-material flows. Some examples include: Reactor coolant flows Molten corium flows Dynamic compaction of metal powders Spray forming and thermal plasma spraying Plasma quench reactor Subsurface flows, particularly in the vadose zone Internal flows within fuel cells Black liquor atomization and combustion Wheat-chaff classification in combine harvesters Generation IV pebble bed, high temperature gas reactor The complexity of these flows dictates that they be examined in an averaged sense. Typically one would begin with known (or at least postulated) microscopic flow relations that hold on the ''small'' scale. These include continuum level conservation of mass, balance of species mass and momentum, conservation of energy, and a statement of the second law of thermodynamics often in the form of an entropy inequality (such as the Clausius-Duhem inequality). The averaged or macroscopic conservation equations and entropy inequalities are then obtained from the microscopic equations through suitable averaging procedures. At this stage a stronger form of the second law may also be postulated for the mixture of phases or materials. To render the evolutionary material flow balance system unique, constitutive equations and phase or material interaction relations are introduced from experimental observation, or by postulation, through strict enforcement of the constraints or restrictions resulting from the averaged entropy inequalities. These averaged equations form the governing equation system for the dynamic evolution of these mixture flows. Most commonly, the averaging technique utilized is either volume or time averaging or a combination of the two. The flow restrictions required for volume and time averaging to be valid can be severe, and violations of these restrictions are often found. A more general, less restrictive (and far less commonly used) type of averaging known as

Canonical and D-transformations in Theories with Constraints

OpenAIRE

Gitman, Dmitri M.

1995-01-01

A class class of transformations in a super phase space (we call them D-transformations) is described, which play in theories with second-class constraints the role of ordinary canonical transformations in theories without constraints.

On the performance of arbitrary transmit selection for threshold-based receive MRC with and without co-channel interference

KAUST Repository

Radaydeh, Redha Mahmoud Mesleh

2011-11-01

The performance of multiple-antenna diversity systems in which the receiver combines signal replicas per threshold-based maximal ratio combining (MRC) and transmitter uses only a single antenna according to receive combined signal strength is studied. The impact of imperfect channel estimation and the effect of phase and time misalignments between desired and undesired signals are implicitly investigated. It is assumed that the desired signal replicas and interfering signals undergo statistically independent flat Rayleigh fading. The analysis is applicable for arbitrary transmit antenna selection, based either on receive combined signal-to-noise ratio (SNR) or receive combined signal-to-interference-plus-noise ratio (SINR). For the scenario of identical multiple-antenna channels, closed-form analytical results for the combined SNR statistics and some performance measures are first presented. The SNR-based and SINR-based selection algorithms are then employed to obtain expressions for the distribution of combined SINR and outage probability performance, which are applicable for different statistical models of interfering signals. The adopted system models herein as well as the analytical development add enhancements on many existing results, and can be used to study the performance of different architectures under various channel conditions when the implementation complexity is of interest. © 2011 IEEE.

On the Efficient Simulation of Outage Probability in a Log-normal Fading Environment

KAUST Repository

Rached, Nadhir B.

2017-02-15

The outage probability (OP) of the signal-to-interference-plus-noise ratio (SINR) is an important metric that is used to evaluate the performance of wireless systems. One difficulty toward assessing the OP is that, in realistic scenarios, closed-form expressions cannot be derived. This is for instance the case of the Log-normal environment, in which evaluating the OP of the SINR amounts to computing the probability that a sum of correlated Log-normal variates exceeds a given threshold. Since such a probability does not admit a closed-form expression, it has thus far been evaluated by several approximation techniques, the accuracies of which are not guaranteed in the region of small OPs. For these regions, simulation techniques based on variance reduction algorithms is a good alternative, being quick and highly accurate for estimating rare event probabilities. This constitutes the major motivation behind our work. More specifically, we propose a generalized hybrid importance sampling scheme, based on a combination of a mean shifting and a covariance matrix scaling, to evaluate the OP of the SINR in a Log-normal environment. We further our analysis by providing a detailed study of two particular cases. Finally, the performance of these techniques is performed both theoretically and through various simulation results.

Unified Stochastic Geometry Model for MIMO Cellular Networks with Retransmissions

KAUST Repository

Afify, Laila H.

2016-10-11

This paper presents a unified mathematical paradigm, based on stochastic geometry, for downlink cellular networks with multiple-input-multiple-output (MIMO) base stations (BSs). The developed paradigm accounts for signal retransmission upon decoding errors, in which the temporal correlation among the signal-to-interference-plus-noise-ratio (SINR) of the original and retransmitted signals is captured. In addition to modeling the effect of retransmission on the network performance, the developed mathematical model presents twofold analysis unification for MIMO cellular networks literature. First, it integrates the tangible decoding error probability and the abstracted (i.e., modulation scheme and receiver type agnostic) outage probability analysis, which are largely disjoint in the literature. Second, it unifies the analysis for different MIMO configurations. The unified MIMO analysis is achieved by abstracting unnecessary information conveyed within the interfering signals by Gaussian signaling approximation along with an equivalent SISO representation for the per-data stream SINR in MIMO cellular networks. We show that the proposed unification simplifies the analysis without sacrificing the model accuracy. To this end, we discuss the diversity-multiplexing tradeoff imposed by different MIMO schemes and shed light on the diversity loss due to the temporal correlation among the SINRs of the original and retransmitted signals. Finally, several design insights are highlighted.

On the Efficient Simulation of Outage Probability in a Log-normal Fading Environment

KAUST Repository

Rached, Nadhir B.; Kammoun, Abla; Alouini, Mohamed-Slim; Tempone, Raul

2017-01-01

The outage probability (OP) of the signal-to-interference-plus-noise ratio (SINR) is an important metric that is used to evaluate the performance of wireless systems. One difficulty toward assessing the OP is that, in realistic scenarios, closed-form expressions cannot be derived. This is for instance the case of the Log-normal environment, in which evaluating the OP of the SINR amounts to computing the probability that a sum of correlated Log-normal variates exceeds a given threshold. Since such a probability does not admit a closed-form expression, it has thus far been evaluated by several approximation techniques, the accuracies of which are not guaranteed in the region of small OPs. For these regions, simulation techniques based on variance reduction algorithms is a good alternative, being quick and highly accurate for estimating rare event probabilities. This constitutes the major motivation behind our work. More specifically, we propose a generalized hybrid importance sampling scheme, based on a combination of a mean shifting and a covariance matrix scaling, to evaluate the OP of the SINR in a Log-normal environment. We further our analysis by providing a detailed study of two particular cases. Finally, the performance of these techniques is performed both theoretically and through various simulation results.

Unified Stochastic Geometry Model for MIMO Cellular Networks with Retransmissions

KAUST Repository

Afify, Laila H.; Elsawy, Hesham; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2016-01-01

This paper presents a unified mathematical paradigm, based on stochastic geometry, for downlink cellular networks with multiple-input-multiple-output (MIMO) base stations (BSs). The developed paradigm accounts for signal retransmission upon decoding errors, in which the temporal correlation among the signal-to-interference-plus-noise-ratio (SINR) of the original and retransmitted signals is captured. In addition to modeling the effect of retransmission on the network performance, the developed mathematical model presents twofold analysis unification for MIMO cellular networks literature. First, it integrates the tangible decoding error probability and the abstracted (i.e., modulation scheme and receiver type agnostic) outage probability analysis, which are largely disjoint in the literature. Second, it unifies the analysis for different MIMO configurations. The unified MIMO analysis is achieved by abstracting unnecessary information conveyed within the interfering signals by Gaussian signaling approximation along with an equivalent SISO representation for the per-data stream SINR in MIMO cellular networks. We show that the proposed unification simplifies the analysis without sacrificing the model accuracy. To this end, we discuss the diversity-multiplexing tradeoff imposed by different MIMO schemes and shed light on the diversity loss due to the temporal correlation among the SINRs of the original and retransmitted signals. Finally, several design insights are highlighted.

On the performance of arbitrary transmit selection for threshold-based receive MRC with and without co-channel interference

KAUST Repository

Radaydeh, Redha Mahmoud Mesleh; Alouini, Mohamed-Slim

2011-01-01

The performance of multiple-antenna diversity systems in which the receiver combines signal replicas per threshold-based maximal ratio combining (MRC) and transmitter uses only a single antenna according to receive combined signal strength is studied. The impact of imperfect channel estimation and the effect of phase and time misalignments between desired and undesired signals are implicitly investigated. It is assumed that the desired signal replicas and interfering signals undergo statistically independent flat Rayleigh fading. The analysis is applicable for arbitrary transmit antenna selection, based either on receive combined signal-to-noise ratio (SNR) or receive combined signal-to-interference-plus-noise ratio (SINR). For the scenario of identical multiple-antenna channels, closed-form analytical results for the combined SNR statistics and some performance measures are first presented. The SNR-based and SINR-based selection algorithms are then employed to obtain expressions for the distribution of combined SINR and outage probability performance, which are applicable for different statistical models of interfering signals. The adopted system models herein as well as the analytical development add enhancements on many existing results, and can be used to study the performance of different architectures under various channel conditions when the implementation complexity is of interest. © 2011 IEEE.

The Issue of Unit Constraints and the Non-Confiscatory Electricity Market

DEFF Research Database (Denmark)

Haji Bashi, Mazaher; Rahmati, Iman; Bak, Claus Leth

2017-01-01

Security constraint unit commitment is devised to drive the generation unit schedule in a deregulated environment. Generation bids, transmission system constraints and generation unit constraints are thoroughly considered in this optimization problem. It is acceptable that the transmission system...... normal condition constraints may affect the economic opportunities of the generation companies in the electricity market. Transmission system limitations are the inherent limits of the market environment but this is not true for the generation unit constraints. It means that the generation unit...... constraint of a certain player should not affect the economic opportunities of the rivals. If this happen, generation units can claim to the electricity market regulatory board. In this paper the effect of generation unit constraint on the market outcome is discussed. A fair mechanism is introduced in which...

Pension fund's illiquid assets allocation under liquidity and capital constraints

NARCIS (Netherlands)

Broeders, Dirk; Jansen, Kristy; Werker, Bas

2017-01-01

This paper empirically assesses the impact of liquidity and capital constraints on the allocation of defined benefit pension funds to illiquid assets. Liquidity constraints result from short-term pension payments and collateral requirements on derivatives. Capital constraints follow from the

Effective constraint algebras with structure functions

International Nuclear Information System (INIS)

Bojowald, Martin; Brahma, Suddhasattwa

2016-01-01

This article presents the result that fluctuations and higher moments of a state, by themselves, do not imply quantum corrections in structure functions of constrained systems. Moment corrections are isolated from other types of quantum effects, such as factor-ordering choices and regularization, by introducing a new condition with two parts: (i) having a direct (or faithful) quantization of the classical structure functions, (ii) free of factor-ordering ambiguities. In particular, it is assumed that the classical constraints can be quantized in an anomaly free way, so that properties of the resulting constraint algebras can be derived. If the two-part condition is not satisfied, effective constraints can still be evaluated, but quantum effects may be stronger. Consequences for canonical quantum gravity, whose structure functions encode space–time structure, are discussed. In particular, deformed algebras found in models of loop quantum gravity provide reliable information even in the Planck regime. (paper)

WMAP constraints on the Cardassian model

International Nuclear Information System (INIS)

Sen, A.A.; Sen, S.

2003-01-01

We investigate the constraints on the Cardassian model using the recent results from the Wilkinson microwave anisotropy probe for the locations of the peaks of the cosmic microwave background (CMB) anisotropy spectrum. We find that the model is consistent with the recent observational data for a certain range of the model parameter n and the cosmological parameters. We find that the Cardassian model is favored compared to the ΛCDM model for a higher spectral index (n s ≅1) together with a lower value of the Hubble parameter h (h≤0.71). But for smaller values of n s , both ΛCDM and Cardassian models are equally favored. Also, irrespective of supernova constraints, CMB data alone predict the current acceleration of the Universe in this model. We have also studied the constraint on σ 8 , the rms density fluctuations at the 8h -1 Mpc scale

A combined constraint handling framework: an empirical study

DEFF Research Database (Denmark)

Si, Chengyong; Hu, Junjie; Lan, Tian

2017-01-01

This paper presents a new combined constraint handling framework (CCHF) for solving constrained optimization problems (COPs). The framework combines promising aspects of different constraint handling techniques (CHTs) in different situations with consideration of problem characteristics. In order...

Averaging in spherically symmetric cosmology

International Nuclear Information System (INIS)

Coley, A. A.; Pelavas, N.

2007-01-01

The averaging problem in cosmology is of fundamental importance. When applied to study cosmological evolution, the theory of macroscopic gravity (MG) can be regarded as a long-distance modification of general relativity. In the MG approach to the averaging problem in cosmology, the Einstein field equations on cosmological scales are modified by appropriate gravitational correlation terms. We study the averaging problem within the class of spherically symmetric cosmological models. That is, we shall take the microscopic equations and effect the averaging procedure to determine the precise form of the correlation tensor in this case. In particular, by working in volume-preserving coordinates, we calculate the form of the correlation tensor under some reasonable assumptions on the form for the inhomogeneous gravitational field and matter distribution. We find that the correlation tensor in a Friedmann-Lemaitre-Robertson-Walker (FLRW) background must be of the form of a spatial curvature. Inhomogeneities and spatial averaging, through this spatial curvature correction term, can have a very significant dynamical effect on the dynamics of the Universe and cosmological observations; in particular, we discuss whether spatial averaging might lead to a more conservative explanation of the observed acceleration of the Universe (without the introduction of exotic dark matter fields). We also find that the correlation tensor for a non-FLRW background can be interpreted as the sum of a spatial curvature and an anisotropic fluid. This may lead to interesting effects of averaging on astrophysical scales. We also discuss the results of averaging an inhomogeneous Lemaitre-Tolman-Bondi solution as well as calculations of linear perturbations (that is, the backreaction) in an FLRW background, which support the main conclusions of the analysis

Design with Nonlinear Constraints

KAUST Repository

Tang, Chengcheng

2015-01-01

. The first application is the design of meshes under both geometric and static constraints, including self-supporting polyhedral meshes that are not height fields. Then, with a formulation bridging mesh based and spline based representations, the application

A constraint-based bottom-up counterpart to definite clause grammars

DEFF Research Database (Denmark)

Christiansen, Henning

2004-01-01

A new grammar formalism, CHR Grammars (CHRG), is proposed that provides a constraint-solving approach to language analysis, built on top of the programming language of Constraint Handling Rules in the same way as Definite Clause Grammars (DCG) on Prolog. CHRG works bottom-up and adds the following......, integrity constraints, operators a la assumption grammars, and to incorporate other constraint solvers. (iv)~Context-sensitive rules that apply for disambiguation, coordination in natural language and tagger-like rules....

Interference management using direct sequence spread spectrum ...

African Journals Online (AJOL)

Interference management using direct sequence spread spectrum (DSSS) technique ... Journal of Fundamental and Applied Sciences ... Keywords: DSSS, LTE network; Wi-Fi network; SINR; interference management and interference power.

Decentralized SINR Balancing in Cognitive Radio Networks

KAUST Repository

Dhifallah, Oussama Najeeb; Dahrouj, Hayssam; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2016-01-01

and primary transmitters can transmit simultaneously their data over the same frequency bands, so as to achieve a high system spectrum efficiency. The paper considers the downlink balancing problem of maximizing the minimum signal-to-interference-plus noise

Financial constraint and R&D investment: evidence from CIS

OpenAIRE

Tiwari, A.K.; Mohnen, P.; Palm, F.C.; Schim van der Loeff, S.

2007-01-01

Using direct information on financial constraints from questionnaires, rather than the commonly used balance sheet information, this paper presents evidence that, controlling for traditional factors as size, market share, cooperative arrangement, and expected profitability, financial constraints affect a firm's decision of how much to invest in R&D activities. Apart from these constraints, other hampering factors as market uncertainty and institutional bottlenecks, regulations and organizatio...

Constraints and Logic Programming in Grammars and Language Analysis

DEFF Research Database (Denmark)

Christiansen, Henning

2014-01-01

Constraints are an important notion in grammars and language analysis, and constraint programming techniques have been developed concurrently for solving a variety of complex problems. In this chapter we consider the synthesis of these branches into practical and effective methods for language...... methods that combine constraints with logic grammars such as Definite Clause Grammars and CHR Grammars, and show also a direct relationship to abductive reasoning....

Overview of the use of dose constraints in occupational exposures

International Nuclear Information System (INIS)

Bonny, A.

2013-04-01

An overview of the use of dose constraints in occupational exposures has been carried out in this project. This was done by reviewing and analyzing some of the operational issues/challenges associated with their implementation and providing suggestions regarding operational objectives and uses of dose constraints.The role of dose constraints in the process of optimisation of radiation protection was described, and explanations provided where necessary in order to avoid the possible situations where dose constraints are misinterpreted or used as a stringent limit. Finally, the identification of potential issues that need to be considered in the implementation and setting of dose constraints for the purposes of occupational radiation protection were discussed. (author)

How to average logarithmic retrievals?

Directory of Open Access Journals (Sweden)

B. Funke

2012-04-01

Full Text Available Calculation of mean trace gas contributions from profiles obtained by retrievals of the logarithm of the abundance rather than retrievals of the abundance itself are prone to biases. By means of a system simulator, biases of linear versus logarithmic averaging were evaluated for both maximum likelihood and maximum a priori retrievals, for various signal to noise ratios and atmospheric variabilities. These biases can easily reach ten percent or more. As a rule of thumb we found for maximum likelihood retrievals that linear averaging better represents the true mean value in cases of large local natural variability and high signal to noise ratios, while for small local natural variability logarithmic averaging often is superior. In the case of maximum a posteriori retrievals, the mean is dominated by the a priori information used in the retrievals and the method of averaging is of minor concern. For larger natural variabilities, the appropriateness of the one or the other method of averaging depends on the particular case because the various biasing mechanisms partly compensate in an unpredictable manner. This complication arises mainly because of the fact that in logarithmic retrievals the weight of the prior information depends on abundance of the gas itself. No simple rule was found on which kind of averaging is superior, and instead of suggesting simple recipes we cannot do much more than to create awareness of the traps related with averaging of mixing ratios obtained from logarithmic retrievals.

Joint random beam and spectrum selection for spectrum sharing systems with partial channel state information

KAUST Repository

Abdallah, Mohamed M.

2013-11-01

In this work, we develop joint interference-aware random beam and spectrum selection scheme that provide enhanced performance for the secondary network under the condition that the interference observed at the primary receiver is below a predetermined acceptable value. We consider a secondary link composed of a transmitter equipped with multiple antennas and a single-antenna receiver sharing the same spectrum with a set of primary links composed of a single-antenna transmitter and a single-antenna receiver. The proposed schemes jointly select a beam, among a set of power-optimized random beams, as well as the primary spectrum that maximizes the signal-to-interference-plus-noise ratio (SINR) of the secondary link while satisfying the primary interference constraint. In particular, we consider the case where the interference level is described by a q-bit description of its magnitude, whereby we propose a technique to find the optimal quantizer thresholds in a mean square error (MSE) sense. © 2013 IEEE.

Joint random beam and spectrum selection for spectrum sharing systems with partial channel state information

KAUST Repository

Abdallah, Mohamed M.; Sayed, Mostafa M.; Alouini, Mohamed-Slim; Qaraqe, Khalid A.

2013-01-01

In this work, we develop joint interference-aware random beam and spectrum selection scheme that provide enhanced performance for the secondary network under the condition that the interference observed at the primary receiver is below a predetermined acceptable value. We consider a secondary link composed of a transmitter equipped with multiple antennas and a single-antenna receiver sharing the same spectrum with a set of primary links composed of a single-antenna transmitter and a single-antenna receiver. The proposed schemes jointly select a beam, among a set of power-optimized random beams, as well as the primary spectrum that maximizes the signal-to-interference-plus-noise ratio (SINR) of the secondary link while satisfying the primary interference constraint. In particular, we consider the case where the interference level is described by a q-bit description of its magnitude, whereby we propose a technique to find the optimal quantizer thresholds in a mean square error (MSE) sense. © 2013 IEEE.

Mobility and Position Error Analysis of a Complex Planar Mechanism with Redundant Constraints

Science.gov (United States)

Sun, Qipeng; Li, Gangyan

2018-03-01

Nowadays mechanisms with redundant constraints have been created and attracted much attention for their merits. The mechanism of the redundant constraints in a mechanical system is analyzed in this paper. A analysis method of Planar Linkage with a repetitive structure is proposed to get the number and type of constraints. According to the difference of applications and constraint characteristics, the redundant constraints are divided into the theoretical planar redundant constraints and the space-planar redundant constraints. And the calculation formula for the number of redundant constraints and type of judging method are carried out. And a complex mechanism with redundant constraints is analyzed of the influence about redundant constraints on mechanical performance. With the combination of theoretical derivation and simulation research, a mechanism analysis method is put forward about the position error of complex mechanism with redundant constraints. It points out the direction on how to eliminate or reduce the influence of redundant constraints.

Constrained dynamical systems: separation of constraints into first and second classes

International Nuclear Information System (INIS)

Chitaya, N.P.; Gogilidze, S.A.; Surovtsev, Yu.S.

1996-01-01

In the Dirac approach to the generalized Hamiltonian formalism, dynamical systems with first- and second-class constraints are investigated. The classification and separation of constraints into the first- and second-class ones are presented with the help of passing to an equivalent canonical set of constraints. The general structure of second-class constraints is clarified. 14 refs

Constraints and spandrels of interareal connectomes

Science.gov (United States)

Rubinov, Mikail

2016-12-01

Interareal connectomes are whole-brain wiring diagrams of white-matter pathways. Recent studies have identified modules, hubs, module hierarchies and rich clubs as structural hallmarks of these wiring diagrams. An influential current theory postulates that connectome modules are adequately explained by evolutionary pressures for wiring economy, but that the other hallmarks are not explained by such pressures and are therefore less trivial. Here, we use constraint network models to test these postulates in current gold-standard vertebrate and invertebrate interareal-connectome reconstructions. We show that empirical wiring-cost constraints inadequately explain connectome module organization, and that simultaneous module and hub constraints induce the structural byproducts of hierarchies and rich clubs. These byproducts, known as spandrels in evolutionary biology, include the structural substrate of the default-mode network. Our results imply that currently standard connectome characterizations are based on circular analyses or double dipping, and we emphasize an integrative approach to future connectome analyses for avoiding such pitfalls.

Constraints on grand unified superstring theories

International Nuclear Information System (INIS)

Ellis, J.; Lopez, J.L.; Nanopoulos, D.V.; Houston Advanced Research Center

1990-01-01

We evaluate some constraints on the construction of grand unified superstring theories (GUSTs) using higher level Kac-Moody algebras on the world-sheet. In the most general formulation of the heterotic string in four dimensions, an analysis of the basic GUST model-building constraints, including a realistic hidden gauge group, reveals that there are no E 6 models and any SO(10) models can only exist at level-5. Also, any such SU(5) models can exist only for levels 4≤k≤19. These SO(10) and SU(5) models risk having many large, massless, phenomenologically troublesome representations. We also show that with a suitable hidden sector gauge group, it is possible to avoid free light fractionally charged particles, which are endemic to string derived models. We list all such groups and their representations for the flipped SU(5)xU(1) model. We conclude that a sufficiently binding hidden sector gauge group becomes a basic model-building constraint. (orig.)

Water Constraints in an Electric Sector Capacity Expansion Model

Energy Technology Data Exchange (ETDEWEB)

Macknick, Jordan [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Cohen, Stuart [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Newmark, Robin [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Martinez, Andrew [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Sullivan, Patrick [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Tidwell, Vince [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2015-07-17

This analysis provides a description of the first U.S. national electricity capacity expansion model to incorporate water resource availability and costs as a constraint for the future development of the electricity sector. The Regional Energy Deployment System (ReEDS) model was modified to incorporate water resource availability constraints and costs in each of its 134 Balancing Area (BA) regions along with differences in costs and efficiencies of cooling systems. Water resource availability and cost data are from recently completed research at Sandia National Laboratories (Tidwell et al. 2013b). Scenarios analyzed include a business-as-usual 3 This report is available at no cost from the National Renewable Energy Laboratory (NREL) at www.nrel.gov/publications. scenario without water constraints as well as four scenarios that include water constraints and allow for different cooling systems and types of water resources to be utilized. This analysis provides insight into where water resource constraints could affect the choice, configuration, or location of new electricity technologies.

Formation control of marine craft using constraint functions

DEFF Research Database (Denmark)

Ihle, Ivar-Andre F.; Jouffroy, Jerome; Fossen, Thor I.

This article presents a method for formation control of marine surface vessels inspired by Lagrangian mechanics. The desired formation configuration is given as a set of constraint functions. The functions are treated analytically and by using feedback from the imposed constraint functions, const...

Resources, constraints and capabilities

NARCIS (Netherlands)

Dhondt, S.; Oeij, P.R.A.; Schröder, A.

2018-01-01

Human and financial resources as well as organisational capabilities are needed to overcome the manifold constraints social innovators are facing. To unlock the potential of social innovation for the whole society new (social) innovation friendly environments and new governance structures

An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint

Directory of Open Access Journals (Sweden)

2006-01-01

Full Text Available We consider the problem of minimizing a convex separable logarithmic function over a region defined by a convex inequality constraint or linear equality constraint, and two-sided bounds on the variables (box constraints. Such problems are interesting from both theoretical and practical point of view because they arise in some mathematical programming problems as well as in various practical problems such as problems of production planning and scheduling, allocation of resources, decision making, facility location problems, and so forth. Polynomial algorithms are proposed for solving problems of this form and their convergence is proved. Some examples and results of numerical experiments are also presented.

Constraints on reusability of learning objects

DEFF Research Database (Denmark)

May, Michael; Hussmann, Peter Munkebo; Jensen, Anne Skov

2010-01-01

It is the aim of this paper to discuss some didactic constraints on the use and reuse of digital modular learning objects. Engineering education is used as the specific context of use with examples from courses in introductory electronics and mathematics. Digital multimedia and modular learning....... Constraints on reuse arise from the nature of conceptual understanding in higher education and the functionality of learning objects within present technologies. We will need didactic as well as technical perspectives on learning objects in designing for understanding....

On Averaging Rotations

DEFF Research Database (Denmark)

Gramkow, Claus

2001-01-01

In this paper two common approaches to averaging rotations are compared to a more advanced approach based on a Riemannian metric. Very often the barycenter of the quaternions or matrices that represent the rotations are used as an estimate of the mean. These methods neglect that rotations belong ...... approximations to the Riemannian metric, and that the subsequent corrections are inherent in the least squares estimation.......In this paper two common approaches to averaging rotations are compared to a more advanced approach based on a Riemannian metric. Very often the barycenter of the quaternions or matrices that represent the rotations are used as an estimate of the mean. These methods neglect that rotations belong...

Practical constraints on fuel management a utility perspective

International Nuclear Information System (INIS)

Grier, C.A.

1986-01-01

The practical and potential constraints of performing fuel management at a large utility are reviewed. Based on approximately six years of experience in performing fuel management the constraints due to commercial, technical, utility system, design methods, and personnel and computer resources are discussed in detail

Applying the theory of constraints in health care: Part 1--The philosophy.

Science.gov (United States)

Breen, Anne M; Burton-Houle, Tracey; Aron, David C

2002-01-01

The imperative to improve both technical and service quality while simultaneously reducing costs is quite clear. The Theory of Constraints (TOC) is an emerging philosophy that rests on two assumptions: (1) systems thinking and (2) if a constraint "is anything that limits a system from achieving higher performance versus its goal," then every system must have at least one (and at most no more than a few) constraints or limiting factors. A constraint is neither good nor bad in itself. Rather, it just is. In fact, recognition of the existence of constraints represents an excellent opportunity for improvement because it allows one to focus ones efforts in the most productive area--identifying and managing the constraints. This is accomplished by using the five focusing steps of TOC: (1) identify the system's constraint; (2) decide how to exploit it; (3) subordinate/synchronize everything else to the above decisions; (4) elevate the system's constraint; and (5) if the constraint has shifted in the above steps, go back to step 1. Do not allow inertia to become the system's constraint. TOC also refers to a series of tools termed "thinking processes" and the sequence in which they are used.

A methodology for controlling motion and constraint forces in holonomically constrained systems

International Nuclear Information System (INIS)

Sapio, Vincent De; Srinivasa, Narayan

2015-01-01

Holonomic constraints are ubiquitous in multibody systems. We present an approach to effectively address the control of holonomically constrained systems using a novel decomposition of task, constraint, and posture space. In addition to providing a natural approach for motion control in the presence of constraints, this scheme also allows for concurrent specification of desired constraint forces, given sufficient actuation. It does this by exposing both motion coordinates and constraint forces within the control formalism, allowing for substantial flexibility in control synthesis. Implementations are presented based on a partitioning of the constraint forces into controlled and uncontrolled subsets, as well as a specification of implicit conditions on the constraint forces. A number of examples demonstrate the practical efficacy of the approach. Finally, a system-level methodology for constraint management during robot interactions with the environment is presented

A methodology for controlling motion and constraint forces in holonomically constrained systems

Energy Technology Data Exchange (ETDEWEB)

Sapio, Vincent De, E-mail: vdesapio@hrl.com; Srinivasa, Narayan, E-mail: nsrinivasa@hrl.com [HRL Laboratories, LLC, Information and Systems Sciences Laboratory (United States)

2015-02-15

Holonomic constraints are ubiquitous in multibody systems. We present an approach to effectively address the control of holonomically constrained systems using a novel decomposition of task, constraint, and posture space. In addition to providing a natural approach for motion control in the presence of constraints, this scheme also allows for concurrent specification of desired constraint forces, given sufficient actuation. It does this by exposing both motion coordinates and constraint forces within the control formalism, allowing for substantial flexibility in control synthesis. Implementations are presented based on a partitioning of the constraint forces into controlled and uncontrolled subsets, as well as a specification of implicit conditions on the constraint forces. A number of examples demonstrate the practical efficacy of the approach. Finally, a system-level methodology for constraint management during robot interactions with the environment is presented.

Walking, running, and resting under time, distance, and average speed constraints: optimality of walk–run–rest mixtures

Science.gov (United States)

Long, Leroy L.; Srinivasan, Manoj

2013-01-01

On a treadmill, humans switch from walking to running beyond a characteristic transition speed. Here, we study human choice between walking and running in a more ecological (non-treadmill) setting. We asked subjects to travel a given distance overground in a given allowed time duration. During this task, the subjects carried, and could look at, a stopwatch that counted down to zero. As expected, if the total time available were large, humans walk the whole distance. If the time available were small, humans mostly run. For an intermediate total time, humans often use a mixture of walking at a slow speed and running at a higher speed. With analytical and computational optimization, we show that using a walk–run mixture at intermediate speeds and a walk–rest mixture at the lowest average speeds is predicted by metabolic energy minimization, even with costs for transients—a consequence of non-convex energy curves. Thus, sometimes, steady locomotion may not be energy optimal, and not preferred, even in the absence of fatigue. Assuming similar non-convex energy curves, we conjecture that similar walk–run mixtures may be energetically beneficial to children following a parent and animals on long leashes. Humans and other animals might also benefit energetically from alternating between moving forward and standing still on a slow and sufficiently long treadmill. PMID:23365192

Walking, running, and resting under time, distance, and average speed constraints: optimality of walk-run-rest mixtures.

Science.gov (United States)

Long, Leroy L; Srinivasan, Manoj

2013-04-06

On a treadmill, humans switch from walking to running beyond a characteristic transition speed. Here, we study human choice between walking and running in a more ecological (non-treadmill) setting. We asked subjects to travel a given distance overground in a given allowed time duration. During this task, the subjects carried, and could look at, a stopwatch that counted down to zero. As expected, if the total time available were large, humans walk the whole distance. If the time available were small, humans mostly run. For an intermediate total time, humans often use a mixture of walking at a slow speed and running at a higher speed. With analytical and computational optimization, we show that using a walk-run mixture at intermediate speeds and a walk-rest mixture at the lowest average speeds is predicted by metabolic energy minimization, even with costs for transients-a consequence of non-convex energy curves. Thus, sometimes, steady locomotion may not be energy optimal, and not preferred, even in the absence of fatigue. Assuming similar non-convex energy curves, we conjecture that similar walk-run mixtures may be energetically beneficial to children following a parent and animals on long leashes. Humans and other animals might also benefit energetically from alternating between moving forward and standing still on a slow and sufficiently long treadmill.

Consistency maintenance for constraint in role-based access control model

Institute of Scientific and Technical Information of China (English)

韩伟力; 陈刚; 尹建伟; 董金祥

2002-01-01

Constraint is an important aspect of role-based access control and is sometimes argued to be the principal motivation for role-based access control (RBAC). But so far few authors have discussed consistency maintenance for constraint in RBAC model. Based on researches of constraints among roles and types of inconsistency among constraints, this paper introduces corresponding formal rules, rule-based reasoning and corresponding methods to detect, avoid and resolve these inconsistencies. Finally, the paper introduces briefly the application of consistency maintenance in ZD-PDM, an enterprise-oriented product data management (PDM) system.

Consistency maintenance for constraint in role-based access control model

Institute of Scientific and Technical Information of China (English)

韩伟力; 陈刚; 尹建伟; 董金祥

2002-01-01

Constraint is an important aspect of role-based access control and is sometimes argued to be the principal motivation for role-based access control (RBAC). But so far'few authors have discussed consistency maintenance for constraint in RBAC model. Based on researches of constraints among roles and types of inconsistency among constraints, this paper introduces correaponding formal rules, rulebased reasoning and corresponding methods to detect, avoid and resolve these inconsistencies. Finally,the paper introduces briefly the application of consistency maintenance in ZD-PDM, an enterprise-ori-ented product data management (PDM) system.

Quantum centipedes with strong global constraint

Science.gov (United States)

Grange, Pascal

2017-06-01

A centipede made of N quantum walkers on a one-dimensional lattice is considered. The distance between two consecutive legs is either one or two lattice spacings, and a global constraint is imposed: the maximal distance between the first and last leg is N  +  1. This is the strongest global constraint compatible with walking. For an initial value of the wave function corresponding to a localized configuration at the origin, the probability law of the first leg of the centipede can be expressed in closed form in terms of Bessel functions. The dispersion relation and the group velocities are worked out exactly. Their maximal group velocity goes to zero when N goes to infinity, which is in contrast with the behaviour of group velocities of quantum centipedes without global constraint, which were recently shown by Krapivsky, Luck and Mallick to give rise to ballistic spreading of extremal wave-front at non-zero velocity in the large-N limit. The corresponding Hamiltonians are implemented numerically, based on a block structure of the space of configurations corresponding to compositions of the integer N. The growth of the maximal group velocity when the strong constraint is gradually relaxed is explored, and observed to be linear in the density of gaps allowed in the configurations. Heuristic arguments are presented to infer that the large-N limit of the globally constrained model can yield finite group velocities provided the allowed number of gaps is a finite fraction of N.

Parallel handling of integrity constraints on fragmented relations

NARCIS (Netherlands)

Grefen, P.W.P.J.; Apers, Peter M.G.

A short introduction to the important aspects of the PRISMA DBMS (database management system) and to the notation and terminology used is presented. It is shown how integrity constraints formulated in terms of global relations can be translated into a fragmented form. The strategy for constraint

A Constraint Model for Constrained Hidden Markov Models

DEFF Research Database (Denmark)

Christiansen, Henning; Have, Christian Theil; Lassen, Ole Torp

2009-01-01

A Hidden Markov Model (HMM) is a common statistical model which is widely used for analysis of biological sequence data and other sequential phenomena. In the present paper we extend HMMs with constraints and show how the familiar Viterbi algorithm can be generalized, based on constraint solving ...

ANALYSIS OF CONSTRAINTS IN RESOURCE USE EFFICIENCY IN ...

African Journals Online (AJOL)

ANALYSIS OF CONSTRAINTS IN RESOURCE USE EFFICIENCY IN MULTIPLE CROPPING SYSTEM BY SMALL-HOLDER FARMERS IN EBONYI STATE OF ... high cost of modern inputs, lack of adequate finance and lack of collaterals among others served as major constraints, which constituted29%, 36%, 33% and 22% ...

Spin glasses and nonlinear constraints in portfolio optimization

International Nuclear Information System (INIS)

Andrecut, M.

2014-01-01

We discuss the portfolio optimization problem with the obligatory deposits constraint. Recently it has been shown that as a consequence of this nonlinear constraint, the solution consists of an exponentially large number of optimal portfolios, completely different from each other, and extremely sensitive to any changes in the input parameters of the problem, making the concept of rational decision making questionable. Here we reformulate the problem using a quadratic obligatory deposits constraint, and we show that from the physics point of view, finding an optimal portfolio amounts to calculating the mean-field magnetizations of a random Ising model with the constraint of a constant magnetization norm. We show that the model reduces to an eigenproblem, with 2N solutions, where N is the number of assets defining the portfolio. Also, in order to illustrate our results, we present a detailed numerical example of a portfolio of several risky common stocks traded on the Nasdaq Market.

Spin glasses and nonlinear constraints in portfolio optimization

Energy Technology Data Exchange (ETDEWEB)

Andrecut, M., E-mail: mircea.andrecut@gmail.com

2014-01-17

We discuss the portfolio optimization problem with the obligatory deposits constraint. Recently it has been shown that as a consequence of this nonlinear constraint, the solution consists of an exponentially large number of optimal portfolios, completely different from each other, and extremely sensitive to any changes in the input parameters of the problem, making the concept of rational decision making questionable. Here we reformulate the problem using a quadratic obligatory deposits constraint, and we show that from the physics point of view, finding an optimal portfolio amounts to calculating the mean-field magnetizations of a random Ising model with the constraint of a constant magnetization norm. We show that the model reduces to an eigenproblem, with 2N solutions, where N is the number of assets defining the portfolio. Also, in order to illustrate our results, we present a detailed numerical example of a portfolio of several risky common stocks traded on the Nasdaq Market.

Model quality assessment using distance constraints from alignments

DEFF Research Database (Denmark)

Paluszewski, Martin; Karplus, Kevin

2008-01-01

that model which is closest to the true structure. In this article, we present a new approach for addressing the MQA problem. It is based on distance constraints extracted from alignments to templates of known structure, and is implemented in the Undertaker program for protein structure prediction. One novel...... feature is that we extract noncontact constraints as well as contact constraints. We describe how the distance constraint extraction is done and we show how they can be used to address the MQA problem. We have compared our method on CASP7 targets and the results show that our method is at least comparable...... with the best MQA methods that were assessed at CASP7. We also propose a new evaluation measure, Kendall's tau, that is more interpretable than conventional measures used for evaluating MQA methods (Pearson's r and Spearman's rho). We show clear examples where Kendall's tau agrees much more with our intuition...

Analysis of Space Tourism Constraints

Science.gov (United States)

Bonnal, Christophe

2002-01-01

Space tourism appears today as a new Eldorado in a relatively near future. Private operators are already proposing services for leisure trips in Low Earth Orbit, and some happy few even tested them. But are these exceptional events really marking the dawn of a new space age ? The constraints associated to the space tourism are severe : - the economical balance of space tourism is tricky; development costs of large manned - the technical definition of such large vehicles is challenging, mainly when considering - the physiological aptitude of passengers will have a major impact on the mission - the orbital environment will also lead to mission constraints on aspects such as radiation, However, these constraints never appear as show-stoppers and have to be dealt with pragmatically: - what are the recommendations one can make for future research in the field of space - which typical roadmap shall one consider to develop realistically this new market ? - what are the synergies with the conventional missions and with the existing infrastructure, - how can a phased development start soon ? The paper proposes hints aiming at improving the credibility of Space Tourism and describes the orientations to follow in order to solve the major hurdles found in such an exciting development.

Managing Constraint Generators in Retail Design Processes

DEFF Research Database (Denmark)

Münster, Mia Borch; Haug, Anders

case studies of fashion store design projects, the present paper addresses this gap. The and six case studies of fashion store design projects, the present paper sheds light on the types of constraints generated by the relevant constraint generators. The paper shows that in the cases studied......Retail design concepts are complex designs meeting functional and aesthetic demands. During a design process a retail designer has to consider various constraint generators such as stakeholder interests, physical limitations and restrictions. Obviously the architectural site, legislators...... and landlords need to be considered as well as the interest of the client and brand owner. Furthermore the users need to be taken into account in order to develop an interesting and functional shopping and working environments. Finally, suppliers and competitors may influence the design with regard...

Lagrangian averaging with geodesic mean.

Science.gov (United States)

Oliver, Marcel

2017-11-01

This paper revisits the derivation of the Lagrangian averaged Euler (LAE), or Euler- α equations in the light of an intrinsic definition of the averaged flow map as the geodesic mean on the volume-preserving diffeomorphism group. Under the additional assumption that first-order fluctuations are statistically isotropic and transported by the mean flow as a vector field, averaging of the kinetic energy Lagrangian of an ideal fluid yields the LAE Lagrangian. The derivation presented here assumes a Euclidean spatial domain without boundaries.

Importance of the local constraint in slave-boson theories

International Nuclear Information System (INIS)

Zhang, L.; Jain, J.K.; Emery, V.J.

1993-01-01

Slave bosons are commonly introduced in order to implement an infinite Hubbard U by means of a local constraint. The usual starting point for investigations within this scheme is a mean-field theory in which the constraint is taken to be global. This approximate treatment of the constraint is studied in the context of a two-band Hubbard model, and it is shown that (i) the ground state has a significant number of doubly occupied sites, despite the infinite on-site repulsion in the original model, and (ii) there is an unphysical tendency for pairing. However, it is found that if the local constraint is retained for the insulator at half filling, then mean-field theory gives the correct result that the double occupancy is zero

Exact penalty results for mathematical programs with vanishing constraints

Czech Academy of Sciences Publication Activity Database

Hoheisel, T.; Kanzow, Ch.; Outrata, Jiří

2010-01-01

Roč. 72, č. 5 (2010), s. 2514-2526 ISSN 0362-546X R&D Projects: GA AV ČR IAA100750802 Institutional research plan: CEZ:AV0Z10750506 Keywords : Mathematical programs with vanishing constraints * Mathematical programs with equilibrium constraints * Exact penalization * Calmness * Subdifferential calculus * Limiting normal cone Subject RIV: BA - General Mathematics Impact factor: 1.279, year: 2010 http://library.utia.cas.cz/separaty/2010/MTR/outrata-exact penalty results for mathematical programs with vanishing constraints.pdf

Social Constraints on Animate Vision

National Research Council Canada - National Science Library

Breazeal, Cynthia; Edsinger, Aaron; Fitzpatrick, Paul; Scassellati, Brian

2000-01-01

.... In humanoid robotic systems, or in any animate vision system that interacts with people, social dynamics provide additional levels of constraint and provide additional opportunities for processing economy...

Ecosystems emerging. 5: Constraints

Czech Academy of Sciences Publication Activity Database

Patten, B. C.; Straškraba, Milan; Jorgensen, S. E.

2011-01-01

Roč. 222, č. 16 (2011), s. 2945-2972 ISSN 0304-3800 Institutional research plan: CEZ:AV0Z50070508 Keywords : constraint * epistemic * ontic Subject RIV: EH - Ecology, Behaviour Impact factor: 2.326, year: 2011 http://www.sciencedirect.com/science/article/pii/S0304380011002274

HOROPLAN: computer-assisted nurse scheduling using constraint-based programming.

Science.gov (United States)

Darmoni, S J; Fajner, A; Mahé, N; Leforestier, A; Vondracek, M; Stelian, O; Baldenweck, M

1995-01-01

Nurse scheduling is a difficult and time consuming task. The schedule has to determine the day to day shift assignments of each nurse for a specified period of time in a way that satisfies the given requirements as much as possible, taking into account the wishes of nurses as closely as possible. This paper presents a constraint-based, artificial intelligence approach by describing a prototype implementation developed with the Charme language and the first results of its use in the Rouen University Hospital. Horoplan implements a non-cyclical constraint-based scheduling, using some heuristics. Four levels of constraints were defined to give a maximum of flexibility: French level (e.g. number of worked hours in a year), hospital level (e.g. specific day-off), department level (e.g. specific shift) and care unit level (e.g. specific pattern for week-ends). Some constraints must always be verified and can not be overruled and some constraints can be overruled at a certain cost. Rescheduling is possible at any time specially in case of an unscheduled absence.

Formal Constraints on Memory Management for Composite Overloaded Operations

Directory of Open Access Journals (Sweden)

Damian W.I. Rouson

2006-01-01

Full Text Available The memory management rules for abstract data type calculus presented by Rouson, Morris & Xu [15] are recast as formal statements in the Object Constraint Language (OCL and applied to the design of a thermal energy equation solver. One set of constraints eliminates memory leaks observed in composite overloaded expressions with three current Fortran 95/2003 compilers. A second set of constraints ensures economical memory recycling. The constraints are preconditions, postconditions and invariants on overloaded operators and the objects they receive and return. It is demonstrated that systematic run-time assertion checking inspired by the formal constraints facilitated the pinpointing of an exceptionally hard-to-reproduce compiler bug. It is further demonstrated that the interplay between OCL's modeling capabilities and Fortran's programming capabilities led to a conceptual breakthrough that greatly improved the readability of our code by facilitating operator overloading. The advantages and disadvantages of our memory management rules are discussed in light of other published solutions [11,19]. Finally, it is demonstrated that the run-time assertion checking has a negligible impact on performance.

Nonnegative Matrix Factorization with Rank Regularization and Hard Constraint.

Science.gov (United States)

Shang, Ronghua; Liu, Chiyang; Meng, Yang; Jiao, Licheng; Stolkin, Rustam

2017-09-01

Nonnegative matrix factorization (NMF) is well known to be an effective tool for dimensionality reduction in problems involving big data. For this reason, it frequently appears in many areas of scientific and engineering literature. This letter proposes a novel semisupervised NMF algorithm for overcoming a variety of problems associated with NMF algorithms, including poor use of prior information, negative impact on manifold structure of the sparse constraint, and inaccurate graph construction. Our proposed algorithm, nonnegative matrix factorization with rank regularization and hard constraint (NMFRC), incorporates label information into data representation as a hard constraint, which makes full use of prior information. NMFRC also measures pairwise similarity according to geodesic distance rather than Euclidean distance. This results in more accurate measurement of pairwise relationships, resulting in more effective manifold information. Furthermore, NMFRC adopts rank constraint instead of norm constraints for regularization to balance the sparseness and smoothness of data. In this way, the new data representation is more representative and has better interpretability. Experiments on real data sets suggest that NMFRC outperforms four other state-of-the-art algorithms in terms of clustering accuracy.

Event-Triggered Distributed Average Consensus Over Directed Digital Networks With Limited Communication Bandwidth.

Science.gov (United States)

Li, Huaqing; Chen, Guo; Huang, Tingwen; Dong, Zhaoyang; Zhu, Wei; Gao, Lan

2016-12-01

In this paper, we consider the event-triggered distributed average-consensus of discrete-time first-order multiagent systems with limited communication data rate and general directed network topology. In the framework of digital communication network, each agent has a real-valued state but can only exchange finite-bit binary symbolic data sequence with its neighborhood agents at each time step due to the digital communication channels with energy constraints. Novel event-triggered dynamic encoder and decoder for each agent are designed, based on which a distributed control algorithm is proposed. A scheme that selects the number of channel quantization level (number of bits) at each time step is developed, under which all the quantizers in the network are never saturated. The convergence rate of consensus is explicitly characterized, which is related to the scale of network, the maximum degree of nodes, the network structure, the scaling function, the quantization interval, the initial states of agents, the control gain and the event gain. It is also found that under the designed event-triggered protocol, by selecting suitable parameters, for any directed digital network containing a spanning tree, the distributed average consensus can be always achieved with an exponential convergence rate based on merely one bit information exchange between each pair of adjacent agents at each time step. Two simulation examples are provided to illustrate the feasibility of presented protocol and the correctness of the theoretical results.

Cyclic labellings with constraints at two distances

OpenAIRE

Leese, R; Noble, S D

2004-01-01

Motivated by problems in radio channel assignment, we consider the vertex-labelling of graphs with non-negative integers. The objective is to minimise the span of the labelling, subject to constraints imposed at graph distances one and two. We show that the minimum span is (up to rounding) a piecewise linear function of the constraints, and give a complete specification, together with associated optimal assignments, for trees and cycles.

Adjustment and Optimization of the Cropping Systems under Water Constraint

Directory of Open Access Journals (Sweden)

Pingli An

2016-11-01

Full Text Available The water constraint on agricultural production receives growing concern with the increasingly sharp contradiction between demand and supply of water resources. How to mitigate and adapt to potential water constraint is one of the key issues for ensuring food security and achieving sustainable agriculture in the context of climate change. It has been suggested that adjustment and optimization of cropping systems could be an effective measure to improve water management and ensure food security. However, a knowledge gap still exists in how to quantify potential water constraint and how to select appropriate cropping systems. Here, we proposed a concept of water constraint risk and developed an approach for the evaluation of the water constraint risks for agricultural production by performing a case study in Daxing District, Beijing, China. The results show that, over the whole growth period, the order of the water constraint risks of crops from high to low was wheat, rice, broomcorn, foxtail millet, summer soybean, summer peanut, spring corn, and summer corn, and the order of the water constraint risks of the cropping systems from high to low was winter wheat-summer grain crops, rice, broomcorn, foxtail millet, and spring corn. Our results are consistent with the actual evolving process of cropping system. This indicates that our proposed method is practicable to adjust and optimize the cropping systems to mitigate and adapt to potential water risks. This study provides an insight into the adjustment and optimization of cropping systems under resource constraints.

Energy constraints and organizational change in US production

Energy Technology Data Exchange (ETDEWEB)

1980-12-01

There is still considerable uncertainty about the way in which energy-supply constraints affect industrial thinking and activity. Yet, this is an important issue in determining the effectiveness of conservation programs and in formulating energy policy. The authors expand on a survey of US business attitudes and responses to energy constraints first published in the September 1979 Energy Policy with the results of further analysis of their survey. In particular, they examine correlations between perceived causes and preferred solutions of energy problems, organizational adjustments to energy constraints in energy-intensive industries, and the ways in which production operations have changed in response to supply problems. 5 references, 5 tables.

Production constraints and perceived marketing problems of stock ...

African Journals Online (AJOL)

In an endeavour to improve the livestock production and particularly the marketing of livestock in the Northern Communal Areas of Namibia, this study analyses the perception of livestock farmers in this regard. The low off-take percentage is the most serious production constraint, but marketing, although a constraint, is not ...

An adaptive ES with a ranking based constraint handling strategy

Directory of Open Access Journals (Sweden)

Kusakci Ali Osman

2014-01-01

Full Text Available To solve a constrained optimization problem, equality constraints can be used to eliminate a problem variable. If it is not feasible, the relations imposed implicitly by the constraints can still be exploited. Most conventional constraint handling methods in Evolutionary Algorithms (EAs do not consider the correlations between problem variables imposed by the constraints. This paper relies on the idea that a proper search operator, which captures mentioned implicit correlations, can improve performance of evolutionary constrained optimization algorithms. To realize this, an Evolution Strategy (ES along with a simplified Covariance Matrix Adaptation (CMA based mutation operator is used with a ranking based constraint-handling method. The proposed algorithm is tested on 13 benchmark problems as well as on a real life design problem. The outperformance of the algorithm is significant when compared with conventional ES-based methods.

Cluster-cluster correlations and constraints on the correlation hierarchy

Science.gov (United States)

Hamilton, A. J. S.; Gott, J. R., III

1988-01-01

The hypothesis that galaxies cluster around clusters at least as strongly as they cluster around galaxies imposes constraints on the hierarchy of correlation amplitudes in hierachical clustering models. The distributions which saturate these constraints are the Rayleigh-Levy random walk fractals proposed by Mandelbrot; for these fractal distributions cluster-cluster correlations are all identically equal to galaxy-galaxy correlations. If correlation amplitudes exceed the constraints, as is observed, then cluster-cluster correlations must exceed galaxy-galaxy correlations, as is observed.

Algorithms and ordering heuristics for distributed constraint satisfaction problems

CERN Document Server

Wahbi , Mohamed

2013-01-01

DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence.A wide variety of problems in artificial intelligence are solved using the constraint satisfaction problem paradigm. However, there are several applications in multi-agent coordination that are of a distributed nature. In this type of application, the knowledge about the problem, that is, variables and constraints, may be logically or geographically distributed among physical distributed agents. This distribution is mainly due to p

Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints

DEFF Research Database (Denmark)

Forchhammer, Søren; Vaarby, Torben Strange

2007-01-01

A modified bit-stuffing scheme for two-dimensional (2-D) checkerboard constraints is introduced. The entropy of the scheme is determined based on a probability measure defined by the modified bit-stuffing. Entropy results of the scheme are given for 2-D constraints on a binary alphabet....... The constraints considered are 2-D RLL (d, infinity) for d = 2, 3 and 4 as well as for the constraint with a minimum 1-norm distance of 3 between Is. For these results the entropy is within 1-2% of an upper bound on the capacity for the constraint. As a variation of the scheme, periodic merging arrays are also...

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

Science.gov (United States)

Chien, S.; Gratch, J.

1994-01-01

One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.

Shared access protocol (SAP) in femtocell channel resources for cellular coverage enhancement

KAUST Repository

Magableh, Amer M.

2012-12-01

Femtocells are promising techniques employed in cellular systems to enhance the indoor coverage, especially in areas with high density and high traffic rates. In this paper, we propose an efficient resource utilization protocol, named shared access protocol (SAP), that enables the unlicensed macro-cell user equipments (MC-UE) to communicate with partially closed access femtocell base stations and hence, improves and enhances the overall system performance in closed environments. For the proposed system model, we obtain, in closed-form, the main signal-to-interference plus noise ratio (SINR) characteristics, including the probability density function (PDF) and the cumulative distribution function (CDF). In addition, these expressions are further used to derive several performance metrics in closed-form, such as, the average bit error rate (BER), outage probability, and the average channel capacity for the proposed SAP herein. Furthermore, Monte-carlo simulations as well as numerical results are provided showing a good match that ensures and confirms the correctness of the derived expressions. © 2012 IEEE.

Primordial black holes survive SN lensing constraints

Science.gov (United States)

García-Bellido, Juan; Clesse, Sébastien; Fleury, Pierre

2018-06-01

It has been claimed in [arxiv:1712.02240] that massive primordial black holes (PBH) cannot constitute all of the dark matter (DM), because their gravitational-lensing imprint on the Hubble diagram of type Ia supernovae (SN) would be incompatible with present observations. In this note, we critically review those constraints and find several caveats on the analysis. First of all, the constraints on the fraction α of PBH in matter seem to be driven by a very restrictive choice of priors on the cosmological parameters. In particular, the degeneracy between Ωm and α was ignored and thus, by fixing Ωm, transferred the constraining power of SN magnitudes to α. Furthermore, by considering more realistic physical sizes for the type-Ia supernovae, we find an effect on the SN lensing magnification distribution that leads to significantly looser constraints. Moreover, considering a wide mass spectrum of PBH, such as a lognormal distribution, further softens the constraints from SN lensing. Finally, we find that the fraction of PBH that could constitute DM today is bounded by fPBH < 1 . 09(1 . 38) , for JLA (Union 2.1) catalogs, and thus it is perfectly compatible with an all-PBH dark matter scenario in the LIGO band.

Management of Constraint Generators in Fashion Store Design Processes

DEFF Research Database (Denmark)

Borch Münster, Mia; Haug, Anders

2017-01-01

of the literature and eight case studies of fashion store design projects. Findings: The paper shows that the influence of the constraint generators decreases during the design process except for supplier-generated constraints, which increase in the final stages of the design process. The paper argues...... is on fashion store design, the findings may, to some degree, be applicable to other types of store design projects. Practical implications: The understandings provided by this paper may help designers to deal proactively with constraints, reducing the use of resources to alter design proposals. Originality......Purpose: Retail design concepts are complex designs meeting functional and aesthetic demands from various constraint generators. However, the literature on this topic is sparse and offers only little support for store designers to deal with such challenges. To address this issue, the purpose...

Unitarity constraints on trimaximal mixing

International Nuclear Information System (INIS)

Kumar, Sanjeev

2010-01-01

When the neutrino mass eigenstate ν 2 is trimaximally mixed, the mixing matrix is called trimaximal. The middle column of the trimaximal mixing matrix is identical to tribimaximal mixing and the other two columns are subject to unitarity constraints. This corresponds to a mixing matrix with four independent parameters in the most general case. Apart from the two Majorana phases, the mixing matrix has only one free parameter in the CP conserving limit. Trimaximality results in interesting interplay between mixing angles and CP violation. A notion of maximal CP violation naturally emerges here: CP violation is maximal for maximal 2-3 mixing. Similarly, there is a natural constraint on the deviation from maximal 2-3 mixing which takes its maximal value in the CP conserving limit.

Quantifying Wheat Sensitivities to Environmental Constraints to Dissect Genotype × Environment Interactions in the Field.

Science.gov (United States)

Parent, Boris; Bonneau, Julien; Maphosa, Lance; Kovalchuk, Alex; Langridge, Peter; Fleury, Delphine

2017-07-01

Yield is subject to strong genotype-by-environment (G × E) interactions in the field, especially under abiotic constraints such as soil water deficit (drought [D]) and high temperature (heat [H]). Since environmental conditions show strong fluctuations during the whole crop cycle, geneticists usually do not consider environmental measures as quantitative variables but rather as factors in multienvironment analyses. Based on 11 experiments in a field platform with contrasting temperature and soil water deficit, we determined the periods of sensitivity to drought and heat constraints in wheat ( Triticum aestivum ) and determined the average sensitivities for major yield components. G × E interactions were separated into their underlying components, constitutive genotypic effect (G), G × D, G × H, and G × H × D, and were analyzed for two genotypes, highlighting contrasting responses to heat and drought constraints. We then tested the constitutive and responsive behaviors of two strong quantitative trait loci (QTLs) associated previously with yield components. This analysis confirmed the constitutive effect of the chromosome 1B QTL and explained the G × E interaction of the chromosome 3B QTL by a benefit of one allele when temperature rises. In addition to the method itself, which can be applied to other data sets and populations, this study will support the cloning of a major yield QTL on chromosome 3B that is highly dependent on environmental conditions and for which the climatic interaction is now quantified. © 2017 American Society of Plant Biologists. All Rights Reserved.

Ring power balance observing plasma stability constraints

International Nuclear Information System (INIS)

Campbell, R.B.; Logan, B.G.

1982-01-01

Ring power balance is performed for an E-ring stabilized tandem mirror reactor, taking into account constraints imposed by plasma stability. The two most important criteria are the stability of the core interchange and hot electron interchange modes. The former determines the ring thickness, the latter determines the minimum hot electron temperature; both quantities are important for power balance. The combination of the hot electron interchange constraint and the fact that the barrier density is low places the operating point on the synchrotron dominated branch of power balance. The reference case considered here requires a reasonable 34 MW of heating power deposited in the rings. We also have examined the sensitivity of the required ring power on uncertainties in the numerical coefficients of the stability constraints. We have found that the heating power is strongly affected

Automatic optimization of core loading patterns to maximize cycle energy production within operational constraints

International Nuclear Information System (INIS)

Hobson, G.H.; Turinsky, P.J.

1986-01-01

Computational capability has been developed to automatically determine the core loading pattern which minimizes fuel cycle costs for a pressurized water reactor. Equating fuel cycle cost minimization with core reactivity maximization, the objective is to determine the loading pattern which maximizes core reactivity at end-of-cycle while satisfying the power peaking constraint throughout the cycle and region average discharge burnup limit. The method utilizes a two-dimensional, coarse mesh, finite difference scheme to evaluate core reactivity and fluxes for an initial reference loading pattern as a function of cycle burnup. First order perturbation theory is applied to determine the effects of assembly shuffling on reactivity, power distribution, and end-of-cycle burnup

Credit Constraints, Political Instability, and Capital Accumulation

OpenAIRE

Risto Herrala; Rima Turk-Ariss

2013-01-01

We investigate the complex interactions between credit constraints, political instability, and capital accumulation using a novel approach based on Kiyotaki and Moore’s (1997) theoretical framework. Drawing on a unique firm-level data set from Middle-East and North Africa (MENA), empirical findings point to a large and significant effect of credit conditions on capital accumulation and suggest that continued political unrest worsens credit constraints. The results support the view that financ...

Portfolios with nonlinear constraints and spin glasses

Science.gov (United States)

Gábor, Adrienn; Kondor, I.

1999-12-01

In a recent paper Galluccio, Bouchaud and Potters demonstrated that a certain portfolio problem with a nonlinear constraint maps exactly onto finding the ground states of a long-range spin glass, with the concomitant nonuniqueness and instability of the optimal portfolios. Here we put forward geometric arguments that lead to qualitatively similar conclusions, without recourse to the methods of spin glass theory, and give two more examples of portfolio problems with convex nonlinear constraints.

Spacetime averaging of exotic singularity universes

International Nuclear Information System (INIS)

Dabrowski, Mariusz P.

2011-01-01

Taking a spacetime average as a measure of the strength of singularities we show that big-rips (type I) are stronger than big-bangs. The former have infinite spacetime averages while the latter have them equal to zero. The sudden future singularities (type II) and w-singularities (type V) have finite spacetime averages. The finite scale factor (type III) singularities for some values of the parameters may have an infinite average and in that sense they may be considered stronger than big-bangs.

New Evidence on Measuring Financial Constraints: Moving Beyond the KZ Index

OpenAIRE

Charles J. Hadlock; Joshua R. Pierce

2010-01-01

We collect detailed qualitative information from financial filings to categorize financial constraints for a random sample of firms from 1995 to 2004. Using this categorization, we estimate ordered logit models predicting constraints as a function of different quantitative factors. Our findings cast serious doubt on the validity of the KZ index as a measure of financial constraints, while offering mixed evidence on the validity of other common measures of constraints. We find that firm size a...

q-Virasoro constraints in matrix models

Energy Technology Data Exchange (ETDEWEB)

Nedelin, Anton [Dipartimento di Fisica, Università di Milano-Bicocca and INFN, sezione di Milano-Bicocca, Piazza della Scienza 3, I-20126 Milano (Italy); Department of Physics and Astronomy, Uppsala university,Box 516, SE-75120 Uppsala (Sweden); Zabzine, Maxim [Department of Physics and Astronomy, Uppsala university,Box 516, SE-75120 Uppsala (Sweden)

2017-03-20

The Virasoro constraints play the important role in the study of matrix models and in understanding of the relation between matrix models and CFTs. Recently the localization calculations in supersymmetric gauge theories produced new families of matrix models and we have very limited knowledge about these matrix models. We concentrate on elliptic generalization of hermitian matrix model which corresponds to calculation of partition function on S{sup 3}×S{sup 1} for vector multiplet. We derive the q-Virasoro constraints for this matrix model. We also observe some interesting algebraic properties of the q-Virasoro algebra.

Constraints on hadronically decaying dark matter

Energy Technology Data Exchange (ETDEWEB)

Garny, Mathias [Technische Univ. Muenchen, Garching (Germany). Physik-Department; Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Ibarra, Alejandro [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Tran, David [Technische Univ. Muenchen, Garching (Germany). Physik-Department; Minnesota Univ., Minneapolis, MN (United States). School of Physics and Astronomy

2012-05-15

We present general constraints on dark matter stability in hadronic decay channels derived from measurements of cosmic-ray antiprotons.We analyze various hadronic decay modes in a model-independent manner by examining the lowest-order decays allowed by gauge and Lorentz invariance for scalar and fermionic dark matter particles and present the corresponding lower bounds on the partial decay lifetimes in those channels. We also investigate the complementarity between hadronic and gamma-ray constraints derived from searches for monochromatic lines in the sky, which can be produced at the quantum level if the dark matter decays into quark-antiquark pairs at leading order.

Constraints on hadronically decaying dark matter

International Nuclear Information System (INIS)

Garny, Mathias; Ibarra, Alejandro; Tran, David; Minnesota Univ., Minneapolis, MN

2012-05-01

We present general constraints on dark matter stability in hadronic decay channels derived from measurements of cosmic-ray antiprotons.We analyze various hadronic decay modes in a model-independent manner by examining the lowest-order decays allowed by gauge and Lorentz invariance for scalar and fermionic dark matter particles and present the corresponding lower bounds on the partial decay lifetimes in those channels. We also investigate the complementarity between hadronic and gamma-ray constraints derived from searches for monochromatic lines in the sky, which can be produced at the quantum level if the dark matter decays into quark-antiquark pairs at leading order.

Constraints on Dbar uplifts

International Nuclear Information System (INIS)

Alwis, S.P. de

2016-01-01

We discuss constraints on KKLT/KKLMMT and LVS scenarios that use anti-branes to get an uplift to a deSitter vacuum, coming from requiring the validity of an effective field theory description of the physics. We find these are not always satisfied or are hard to satisfy.

A constraint-based approach to intelligent support of nuclear reactor design

International Nuclear Information System (INIS)

Furuta, Kazuo

1993-01-01

Constraint is a powerful representation to formulate and solve problems in design; a constraint-based approach to intelligent support of nuclear reactor design is proposed. We first discuss the features of the approach, and then present the architecture of a nuclear reactor design support system under development. In this design support system, the knowledge base contains constraints useful to structure the design space as object class definitions, and several types of constraint resolvers are provided as design support subsystems. The adopted method of constraint resolution are explained in detail. The usefulness of the approach is demonstrated using two design problems: Design window search and multiobjective optimization in nuclear reactor design. (orig./HP)

Maximizing Entropy of Pickard Random Fields for 2x2 Binary Constraints

DEFF Research Database (Denmark)

Søgaard, Jacob; Forchhammer, Søren

2014-01-01

This paper considers the problem of maximizing the entropy of two-dimensional (2D) Pickard Random Fields (PRF) subject to constraints. We consider binary Pickard Random Fields, which provides a 2D causal finite context model and use it to define stationary probabilities for 2x2 squares, thus...... allowing us to calculate the entropy of the field. All possible binary 2x2 constraints are considered and all constraints are categorized into groups according to their properties. For constraints which can be modeled by a PRF approach and with positive entropy, we characterize and provide statistics...... of the maximum PRF entropy. As examples, we consider the well known hard square constraint along with a few other constraints....

Supply- and demand-side effects of power sector planning with demand-side management options and SO2 emission constraints

International Nuclear Information System (INIS)

Shrestha, R.M.; Marpaung, C.O.P.

2005-01-01

This paper examines the implications of SO 2 emission mitigation constraints in the power sector planning in Indonesia--a developing country--during 2003-2017 from a long term integrated resource planning perspective. A decomposition model is developed to assess the contributions of supply- and demand-side effects to the total changes in CO 2 , SO 2 and NO x emissions from the power sector due to constraints on SO 2 emissions. The results of the study show that both the supply- and demand-side effects would act towards the reduction of CO 2 , SO 2 and NO x emissions. However, the supply-side effect would play the dominant role in emission mitigations from the power sector in Indonesia. The average incremental SO 2 abatement cost would increase from US$ 970 to US$ 1271 per ton of SO 2 , while electricity price would increase by 2-18% if the annual SO 2 emission reduction target is increased from 10% to 25%

Differential constraints and exact solutions of nonlinear diffusion equations

International Nuclear Information System (INIS)

Kaptsov, Oleg V; Verevkin, Igor V

2003-01-01

The differential constraints are applied to obtain explicit solutions of nonlinear diffusion equations. Certain linear determining equations with parameters are used to find such differential constraints. They generalize the determining equations used in the search for classical Lie symmetries

Spatial, socio-economic, and ecological implications of incorporating minimum size constraints in marine protected area network design.

Science.gov (United States)

Metcalfe, Kristian; Vaughan, Gregory; Vaz, Sandrine; Smith, Robert J

2015-12-01

Marine protected areas (MPAs) are the cornerstone of most marine conservation strategies, but the effectiveness of each one partly depends on its size and distance to other MPAs in a network. Despite this, current recommendations on ideal MPA size and spacing vary widely, and data are lacking on how these constraints might influence the overall spatial characteristics, socio-economic impacts, and connectivity of the resultant MPA networks. To address this problem, we tested the impact of applying different MPA size constraints in English waters. We used the Marxan spatial prioritization software to identify a network of MPAs that met conservation feature targets, whilst minimizing impacts on fisheries; modified the Marxan outputs with the MinPatch software to ensure each MPA met a minimum size; and used existing data on the dispersal distances of a range of species found in English waters to investigate the likely impacts of such spatial constraints on the region's biodiversity. Increasing MPA size had little effect on total network area or the location of priority areas, but as MPA size increased, fishing opportunity cost to stakeholders increased. In addition, as MPA size increased, the number of closely connected sets of MPAs in networks and the average distance between neighboring MPAs decreased, which consequently increased the proportion of the planning region that was isolated from all MPAs. These results suggest networks containing large MPAs would be more viable for the majority of the region's species that have small dispersal distances, but dispersal between MPA sets and spill-over of individuals into unprotected areas would be reduced. These findings highlight the importance of testing the impact of applying different MPA size constraints because there are clear trade-offs that result from the interaction of size, number, and distribution of MPAs in a network. © 2015 Society for Conservation Biology.

Enforcement of entailment constraints in distributed service-based business processes.

Science.gov (United States)

Hummer, Waldemar; Gaubatz, Patrick; Strembeck, Mark; Zdun, Uwe; Dustdar, Schahram

2013-11-01

A distributed business process is executed in a distributed computing environment. The service-oriented architecture (SOA) paradigm is a popular option for the integration of software services and execution of distributed business processes. Entailment constraints, such as mutual exclusion and binding constraints, are important means to control process execution. Mutually exclusive tasks result from the division of powerful rights and responsibilities to prevent fraud and abuse. In contrast, binding constraints define that a subject who performed one task must also perform the corresponding bound task(s). We aim to provide a model-driven approach for the specification and enforcement of task-based entailment constraints in distributed service-based business processes. Based on a generic metamodel, we define a domain-specific language (DSL) that maps the different modeling-level artifacts to the implementation-level. The DSL integrates elements from role-based access control (RBAC) with the tasks that are performed in a business process. Process definitions are annotated using the DSL, and our software platform uses automated model transformations to produce executable WS-BPEL specifications which enforce the entailment constraints. We evaluate the impact of constraint enforcement on runtime performance for five selected service-based processes from existing literature. Our evaluation demonstrates that the approach correctly enforces task-based entailment constraints at runtime. The performance experiments illustrate that the runtime enforcement operates with an overhead that scales well up to the order of several ten thousand logged invocations. Using our DSL annotations, the user-defined process definition remains declarative and clean of security enforcement code. Our approach decouples the concerns of (non-technical) domain experts from technical details of entailment constraint enforcement. The developed framework integrates seamlessly with WS-BPEL and the Web

Institutional constraints on alternative water for energy: a guidebook for regional assessments

Energy Technology Data Exchange (ETDEWEB)

1980-11-01

Basic information is presented about the legal, political, and social constraints faced by energy developers in the acquisition of water from underground, irrigation return flow, municipal waste, and saline sources. It is a guide to those institutional constraints which are general and pronounced enough to be important for regional assessments. First, attention was focused on the acquisition phase of the water use cycle. Second, constraints were analyzed primarily from a regional, rather than state-by-state, perspective. Emphasis was placed generally on the West - particularly the synfuel-rich Rocky Mountain states, the East, and Mid-West, in that order. Alaska and Hawaii were not surveyed. Third, the study focuses on the constraints associated with groundwater, municipal waste, irrigation return flow, and sea water, in that order. The phrase, institutional constraints, as used in the study, means legal, social, economic, and political restrictions, requirements, circumstances, or conditions that must be anticipated or responded to in order to acquire water for energy development. The study focuses primarily on legal constraints and secondarily on political constraints, because they tend to encompass or reflect other forms of institutional constraints.

Constraints on stellar evolution from pulsations

International Nuclear Information System (INIS)

Cox, A.N.

1983-01-01

Consideration of the many types of intrinsic variable stars, that is, those that pulsate, reveals that perhaps a dozen classes can indicate some constraints that affect the results of stellar evolution calculations, or some interpretations of observations. Many of these constraints are not very strong or may not even be well defined yet. In this review we discuss only the case for six classes: classical Cepheids with their measured Wesselink radii, the observed surface effective temperatures of the known eleven double-mode Cepheids, the pulsation periods and measured surface effective temperatures of three R CrB variables, the delta Scuti variable VZ Cnc with a very large ratio of its two observed periods, the nonradial oscillations of our sun, and the period ratios of the newly discovered double-mode RR Lyrae variables. Unfortunately, the present state of knowledge about the exact compositions; mass loss and its dependence on the mass, radius, luminosity, and composition; ;and internal mixing processes, as well as sometimes the more basic parameters such as luminosities and surface effective temperatures prevent us from applying strong constraints for every case where currently the possibility exists

Orthology and paralogy constraints: satisfiability and consistency

OpenAIRE

Lafond, Manuel; El-Mabrouk, Nadia

2014-01-01

Background A variety of methods based on sequence similarity, reconciliation, synteny or functional characteristics, can be used to infer orthology and paralogy relations between genes of a given gene family   G . But is a given set   C of orthology/paralogy constraints possible, i.e., can they simultaneously co-exist in an evolutionary history for   G ? While previous studies have focused on full sets of constraints, here we consider the general case where   C does not necessarily involve a ...

Superconformal Lagrangian without the need to introduce constraints

International Nuclear Information System (INIS)

Pilot, C.H.

1986-01-01

A field Lagrangian invariant under all the symmetries of the superconformal group has been constructed without the need to introduce constraints on the curvatures. We have thus generalized the action of Townsend, van Nieuwenhuizen, and Kaku. We maintain that any and all constraints on the curvatures should result as a consequence of spontaneous symmetry breaking and not be a priori enforced. 14 refs

On quantization of time-dependent systems with constraints

International Nuclear Information System (INIS)

Gadjiev, S A; Jafarov, R G

2007-01-01

The Dirac method of canonical quantization of theories with second-class constraints has to be modified if the constraints depend on time explicitly. A solution of the problem was given by Gitman and Tyutin. In the present work we propose an independent way to derive the rules of quantization for these systems, starting from the physical equivalent theory with trivial non-stationarity

On quantization of time-dependent systems with constraints

International Nuclear Information System (INIS)

Hadjialieva, F.G.; Jafarov, R.G.

1993-07-01

The Dirac method of canonical quantization of theories with second class constraints has to be modified if the constraints depend on time explicitly. A solution of the problem was given by Gitman and Tyutin. In the present work we propose an independent way to derive the rules of quantization for these systems, starting from physical equivalent theory with trivial nonstationarity. (author). 4 refs

On quantization of time-dependent systems with constraints

Energy Technology Data Exchange (ETDEWEB)

Gadjiev, S A; Jafarov, R G [Institute for Physical Problems, Baku State University, AZ11 48 Baku (Azerbaijan)

2007-03-30

The Dirac method of canonical quantization of theories with second-class constraints has to be modified if the constraints depend on time explicitly. A solution of the problem was given by Gitman and Tyutin. In the present work we propose an independent way to derive the rules of quantization for these systems, starting from the physical equivalent theory with trivial non-stationarity.

Combining experimental and cosmological constraints on heavy neutrinos

Directory of Open Access Journals (Sweden)

Marco Drewes

2017-08-01

Full Text Available We study experimental and cosmological constraints on the extension of the Standard Model by three right handed neutrinos with masses between those of the pion and W boson. We combine for the first time direct, indirect and cosmological constraints in this mass range. This includes experimental constraints from neutrino oscillation data, neutrinoless double β decay, electroweak precision data, lepton universality, searches for rare lepton decays, tests of CKM unitarity and past direct searches at colliders or fixed target experiments. On the cosmological side, big bang nucleosynthesis has the most pronounced impact. Our results can be used to evaluate the discovery potential of searches for heavy neutrinos at LHCb, BELLE II, SHiP, ATLAS, CMS or a future lepton collider.

Emergency Diesel Generation System Surveillance Test Policy Optimization Through Genetic Algorithms Using Non-Periodic Intervention Frequencies and Seasonal Constraints

International Nuclear Information System (INIS)

Lapa, Celso M.F.; Pereira, Claudio M.N.A.; Frutuoso e Melo, P.F.

2002-01-01

Nuclear standby safety systems must frequently, be submitted to periodic surveillance tests. The main reason is to detect, as soon as possible, the occurrence of unrevealed failure states. Such interventions may, however, affect the overall system availability due to component outages. Besides, as the components are demanded, deterioration by aging may occur, penalizing again the system performance. By these reasons, planning a good surveillance test policy implies in a trade-off between gains and overheads due to the surveillance test interventions. In order maximize the systems average availability during a given period of time, it has recently been developed a non-periodic surveillance test optimization methodology based on genetic algorithms (GA). The fact of allowing non-periodic tests turns the solution space much more flexible and schedules can be better adjusted, providing gains in the overall system average availability, when compared to those obtained by an optimized periodic tests scheme. The optimization problem becomes, however, more complex. Hence, the use of a powerful optimization technique, such as GAs, is required. Some particular features of certain systems can turn it advisable to introduce other specific constraints in the optimization problem. The Emergency Diesel Generation System (EDGS) of a Nuclear Power Plant (N-PP) is a good example for demonstrating the introduction of seasonal constraints in the optimization problem. This system is responsible for power supply during an external blackout. Therefore, it is desirable during periods of high blackout probability to maintain the system availability as high as possible. Previous applications have demonstrated the robustness and effectiveness of the methodology. However, no seasonal constraints have ever been imposed. This work aims at investigating the application of such methodology in the Angra-II Brazilian NPP EDGS surveillance test policy optimization, considering the blackout probability

On the constraints violation in forward dynamics of multibody systems

Energy Technology Data Exchange (ETDEWEB)

Marques, Filipe [University of Minho, Department of Mechanical Engineering (Portugal); Souto, António P. [University of Minho, Department of Textile Engineering (Portugal); Flores, Paulo, E-mail: pflores@dem.uminho.pt [University of Minho, Department of Mechanical Engineering (Portugal)

2017-04-15

It is known that the dynamic equations of motion for constrained mechanical multibody systems are frequently formulated using the Newton–Euler’s approach, which is augmented with the acceleration constraint equations. This formulation results in the establishment of a mixed set of partial differential and algebraic equations, which are solved in order to predict the dynamic behavior of general multibody systems. The classical solution of the equations of motion is highly prone to constraints violation because the position and velocity constraint equations are not fulfilled. In this work, a general and comprehensive methodology to eliminate the constraints violation at the position and velocity levels is offered. The basic idea of the described approach is to add corrective terms to the position and velocity vectors with the intent to satisfy the corresponding kinematic constraint equations. These corrective terms are evaluated as a function of the Moore–Penrose generalized inverse of the Jacobian matrix and of the kinematic constraint equations. The described methodology is embedded in the standard method to solve the equations of motion based on the technique of Lagrange multipliers. Finally, the effectiveness of the described methodology is demonstrated through the dynamic modeling and simulation of different planar and spatial multibody systems. The outcomes in terms of constraints violation at the position and velocity levels, conservation of the total energy and computational efficiency are analyzed and compared with those obtained with the standard Lagrange multipliers method, the Baumgarte stabilization method, the augmented Lagrangian formulation, the index-1 augmented Lagrangian, and the coordinate partitioning method.

Some general constraints on identical band symmetries

International Nuclear Information System (INIS)

Guidry, M.W.; Strayer, M.R.; Wu, C.; Feng, D.H.

1993-01-01

We argue on general grounds that nearly identical bands observed for superdeformation and less frequently for normal deformation must be explicable in terms of a symmetry having a microscopic basis. We assume that the unknown symmetry is associated with a Lie algebra generated by terms bilinear in fermion creation and annihilation operators. Observed features of these bands and the general properties of Lie groups are then used to place constraints on acceptable algebras. Additional constraints are placed by assuming that the collective spectrum is associated with a dynamical symmetry, and examining the subgroup structure required by phenomenology. We observe that requisite symmetry cannot be unitary, and that the simplest known group structures consistent with these minimal criteria are associated with the Ginocchio algebras employed in the fermion dynamical symmetry model. However, our arguments are general in nature, and we propose that they imply model-independent constraints on any candidate explanation for identical bands

New formulation of Horava-Lifshitz quantum gravity as a master constraint theory

Energy Technology Data Exchange (ETDEWEB)

Soo, Chopin, E-mail: cpsoo@mail.ncku.edu.tw [Department of Physics, National Cheng Kung University, Tainan 70101, Taiwan (China); Yang Jinsong, E-mail: Yangksong@gmail.com [Department of Physics, National Cheng Kung University, Tainan 70101, Taiwan (China); Yu, Hoi-Lai, E-mail: hlyu@phys.sinica.edu.tw [Institute of Physics, Academia Sinica, Nankang, Taipei 11529, Taiwan (China)

2011-07-04

Both projectable and non-projectable versions of Horava-Lifshitz gravity face serious challenges. In the non-projectable version, the constraint algebra is seemingly inconsistent. The projectable version lacks a local Hamiltonian constraint, thus allowing for an extra scalar mode which can be problematic. A new formulation of non-projectable Horava-Lifshitz gravity, naturally realized as a representation of the master constraint algebra studied by loop quantum gravity researchers, is presented. This yields a consistent canonical theory with first class constraints. It captures the essence of Horava-Lifshitz gravity in retaining only spatial diffeomorphisms (instead of full space-time covariance) as the physically relevant non-trivial gauge symmetry; at the same time the local Hamiltonian constraint needed to eliminate the extra mode is equivalently enforced by the master constraint.

Using soft constraints to guide users in flexible business process management systems

DEFF Research Database (Denmark)

Stefansen, Christian; Borch, Signe Ellegård

2008-01-01

Current Business Process Management Systems (BPMS) allow designers to specify processes in highly expressive languages supporting numerous control flow constructs, exceptions, complex predicates, etc., but process specifications are expressed in terms of hard constraints, and this leads...... to an unfortunate trade off: information about preferred practices must either be abandoned or promoted to hard constraints. If abandoned, the BPMS cannot guide its users; if promoted to hard constraints, it becomes a hindrance when unanticipated deviations occur. Soft constraints can make this trade-off less...... painful. Soft constraints specify what rules can be violated and by how much. With soft constraints, the BPMS knows what deviations it can permit, and it can guide the user through the process. The BPMS should allow designers to easily specify soft goals and allow its users to immediately see...

A Selfish Constraint Satisfaction Genetic Algorithms for Planning a Long-Distance Transportation Network

Science.gov (United States)

Onoyama, Takashi; Maekawa, Takuya; Kubota, Sen; Tsuruta, Setuso; Komoda, Norihisa

To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints are imposed on this type of problem. To solve these strict-constraint problems, a selfish constraint satisfaction genetic algorithm (GA) is proposed. In this GA, each gene of an individual satisfies only its constraint selfishly, disregarding the constraints of other genes in the same individuals. Moreover, a constraint pre-checking method is also applied to improve the GA convergence speed. The experimental result shows the proposed method can obtain an accurate solution in a practical response time.

Improving SALT productivity by using the theory of constraints

Science.gov (United States)

Coetzee, Johannes C.; Väisänen, Petri; O'Donoghue, Darragh E.; Kotze, Paul; Romero Colmenero, Encarni; Miszalski, Brent; Crawford, Steven M.; Kniazev, Alexei; Depagne, Éric; Rabe, Paul; Hettlage, Christian

2016-07-01

SALT, the Southern African Large Telescope, is a very cost effective 10 m class telescope. The operations cost per refereed science paper is currently approximately $70,000. To achieve this competitive advantage, specific design tradeoffs had to be made leading to technical constraints. On the other hand, the telescope has many advantages, such as being able to rapidly switch between different instruments and observing modes during the night. We provide details of the technical and operational constraints and how they were dealt with, by applying the theory of constraints, to substantially improve the observation throughput during the last semester.

Finding the optimal Bayesian network given a constraint graph

Directory of Open Access Journals (Sweden)

Jacob M. Schreiber

2017-07-01

Full Text Available Despite recent algorithmic improvements, learning the optimal structure of a Bayesian network from data is typically infeasible past a few dozen variables. Fortunately, domain knowledge can frequently be exploited to achieve dramatic computational savings, and in many cases domain knowledge can even make structure learning tractable. Several methods have previously been described for representing this type of structural prior knowledge, including global orderings, super-structures, and constraint rules. While super-structures and constraint rules are flexible in terms of what prior knowledge they can encode, they achieve savings in memory and computational time simply by avoiding considering invalid graphs. We introduce the concept of a “constraint graph” as an intuitive method for incorporating rich prior knowledge into the structure learning task. We describe how this graph can be used to reduce the memory cost and computational time required to find the optimal graph subject to the encoded constraints, beyond merely eliminating invalid graphs. In particular, we show that a constraint graph can break the structure learning task into independent subproblems even in the presence of cyclic prior knowledge. These subproblems are well suited to being solved in parallel on a single machine or distributed across many machines without excessive communication cost.

Optimal consumption—portfolio problem with CVaR constraints

International Nuclear Information System (INIS)

Zhang, Qingye; Gao, Yan

2016-01-01

The optimal portfolio selection is a fundamental issue in finance, and its two most important ingredients are risk and return. Merton's pioneering work in dynamic portfolio selection emphasized only the expected utility of the consumption and the terminal wealth. To make the optimal portfolio strategy be achievable, risk control over bankruptcy during the investment horizon is an indispensable ingredient. So, in this paper, we consider the consumption-portfolio problem coupled with a dynamic risk control. More specifically, different from the existing literature, we impose a dynamic relative CVaR constraint on it. By the stochastic dynamic programming techniques, we derive the corresponding Hamilton–Jacobi–Bellman (HJB) equation. Moreover, by the Lagrange multiplier method, the closed form solution is provided when the utility function is a logarithmic one. At last, an illustrative empirical study is given. The results show the distinct difference of the portfolio strategies with and without the CVaR constraints: the proportion invested in the risky assets is reduced over time with CVaR constraint instead of being constant without CVaR constraints. This can provide a good decision-making reference for the investors.

Technology for planning and scheduling under complex constraints

Science.gov (United States)

Alguire, Karen M.; Pedro Gomes, Carla O.

1997-02-01

Within the context of law enforcement, several problems fall into the category of planning and scheduling under constraints. Examples include resource and personnel scheduling, and court scheduling. In the case of court scheduling, a schedule must be generated considering available resources, e.g., court rooms and personnel. Additionally, there are constraints on individual court cases, e.g., temporal and spatial, and between different cases, e.g., precedence. Finally, there are overall objectives that the schedule should satisfy such as timely processing of cases and optimal use of court facilities. Manually generating a schedule that satisfies all of the constraints is a very time consuming task. As the number of court cases and constraints increases, this becomes increasingly harder to handle without the assistance of automatic scheduling techniques. This paper describes artificial intelligence (AI) technology that has been used to develop several high performance scheduling applications including a military transportation scheduler, a military in-theater airlift scheduler, and a nuclear power plant outage scheduler. We discuss possible law enforcement applications where we feel the same technology could provide long-term benefits to law enforcement agencies and their operations personnel.

Parents' Reactions to Finding Out That Their Children Have Average or above Average IQ Scores.

Science.gov (United States)

Dirks, Jean; And Others

1983-01-01

Parents of 41 children who had been given an individually-administered intelligence test were contacted 19 months after testing. Parents of average IQ children were less accurate in their memory of test results. Children with above average IQ experienced extremely low frequencies of sibling rivalry, conceit or pressure. (Author/HLM)

Evaluations of average level spacings

International Nuclear Information System (INIS)

Liou, H.I.

1980-01-01

The average level spacing for highly excited nuclei is a key parameter in cross section formulas based on statistical nuclear models, and also plays an important role in determining many physics quantities. Various methods to evaluate average level spacings are reviewed. Because of the finite experimental resolution, to detect a complete sequence of levels without mixing other parities is extremely difficult, if not totally impossible. Most methods derive the average level spacings by applying a fit, with different degrees of generality, to the truncated Porter-Thomas distribution for reduced neutron widths. A method that tests both distributions of level widths and positions is discussed extensivey with an example of 168 Er data. 19 figures, 2 tables

Infrared Constraint on Ultraviolet Theories

Energy Technology Data Exchange (ETDEWEB)

Tsai, Yuhsin [Cornell Univ., Ithaca, NY (United States)

2012-08-01

While our current paradigm of particle physics, the Standard Model (SM), has been extremely successful at explaining experiments, it is theoretically incomplete and must be embedded into a larger framework. In this thesis, we review the main motivations for theories beyond the SM (BSM) and the ways such theories can be constrained using low energy physics. The hierarchy problem, neutrino mass and the existence of dark matter (DM) are the main reasons why the SM is incomplete . Two of the most plausible theories that may solve the hierarchy problem are the Randall-Sundrum (RS) models and supersymmetry (SUSY). RS models usually suffer from strong flavor constraints, while SUSY models produce extra degrees of freedom that need to be hidden from current experiments. To show the importance of infrared (IR) physics constraints, we discuss the flavor bounds on the anarchic RS model in both the lepton and quark sectors. For SUSY models, we discuss the difficulties in obtaining a phenomenologically allowed gaugino mass, its relation to R-symmetry breaking, and how to build a model that avoids this problem. For the neutrino mass problem, we discuss the idea of generating small neutrino masses using compositeness. By requiring successful leptogenesis and the existence of warm dark matter (WDM), we can set various constraints on the hidden composite sector. Finally, to give an example of model independent bounds from collider experiments, we show how to constrain the DM–SM particle interactions using collider results with an effective coupling description.

Robust Neutrino Constraints by Combining Low Redshift Observations with the CMB

CERN Document Server

Reid, Beth A; Jimenez, Raul; Mena, Olga

2010-01-01

We illustrate how recently improved low-redshift cosmological measurements can tighten constraints on neutrino properties. In particular we examine the impact of the assumed cosmological model on the constraints. We first consider the new HST H0 = 74.2 +/- 3.6 measurement by Riess et al. (2009) and the sigma8*(Omegam/0.25)^0.41 = 0.832 +/- 0.033 constraint from Rozo et al. (2009) derived from the SDSS maxBCG Cluster Catalog. In a Lambda CDM model and when combined with WMAP5 constraints, these low-redshift measurements constrain sum mnu<0.4 eV at the 95% confidence level. This bound does not relax when allowing for the running of the spectral index or for primordial tensor perturbations. When adding also Supernovae and BAO constraints, we obtain a 95% upper limit of sum mnu<0.3 eV. We test the sensitivity of the neutrino mass constraint to the assumed expansion history by both allowing a dark energy equation of state parameter w to vary, and by studying a model with coupling between dark energy and dark...

L∞ Variational Problems with Running Costs and Constraints

International Nuclear Information System (INIS)

Aronsson, G.; Barron, E. N.

2012-01-01

Various approaches are used to derive the Aronsson–Euler equations for L ∞ calculus of variations problems with constraints. The problems considered involve holonomic, nonholonomic, isoperimetric, and isosupremic constraints on the minimizer. In addition, we derive the Aronsson–Euler equation for the basic L ∞ problem with a running cost and then consider properties of an absolute minimizer. Many open problems are introduced for further study.

Cosmic microwave background constraints on primordial black hole dark matter

Energy Technology Data Exchange (ETDEWEB)

Aloni, Daniel; Blum, Kfir [Department of Particle Physics and Astrophysics, Weizmann Institute of Science, Herzl 234, Rehovot (Israel); Flauger, Raphael, E-mail: daniel.aloni@weizmann.ac.il, E-mail: kfir.blum@weizmann.ac.il, E-mail: flauger@physics.ucsd.edu [University of California, 9500 Gilman Drive 0319, La Jolla, San Diego, CA, 92093 (United States)

2017-05-01

We revisit cosmic microwave background (CMB) constraints on primordial black hole dark matter. Spectral distortion limits from COBE/FIRAS do not impose a relevant constraint. Planck CMB anisotropy power spectra imply that primordial black holes with m {sub BH}∼> 5 M {sub ⊙} are disfavored. However, this is susceptible to sizeable uncertainties due to the treatment of the black hole accretion process. These constraints are weaker than those quoted in earlier literature for the same observables.

Benefits and constraints in the use of solar cooker

International Nuclear Information System (INIS)

Ilyas, S.Z.

2008-01-01

Women in Pakistan have been overlooked during and after the planning anti implementation of household energy projects for decades. The immediate impact of domestic household energy projects falls on the women first. Since women are the ones who deal mostly with energy at the domestic level A sample of 100 women users of solar cookers was selected randomly. Majority of the respondents were in the age group 30-55 years (80%) and possessed solar cooker for more than one year (74%). Nutritional aspects (preserving nutritive value and food flavors) environmental aspects (keeping environment clean) and economical aspects (saving fuel and money) were perceived at most beneficial. Personal benefits (saving of time me and convenience) ranked low under benefit. Situational constraints like no cooking after evening find seasonal use of the cooker were perceived as severe constraints followed by technical constraints (device not being durable) and personal constraints (shifting of device). The paper also highlights the modification desired in the design of the solar cooker. (author)

Averaged RMHD equations

International Nuclear Information System (INIS)

Ichiguchi, Katsuji

1998-01-01

A new reduced set of resistive MHD equations is derived by averaging the full MHD equations on specified flux coordinates, which is consistent with 3D equilibria. It is confirmed that the total energy is conserved and the linearized equations for ideal modes are self-adjoint. (author)

Cosmological constraints on exotic injection of electromagnetic energy

Energy Technology Data Exchange (ETDEWEB)

Poulin, Vivian; Serpico, Pasquale D. [LAPTh, Université Savoie Mont Blanc and CNRS, 9 Chemin de Bellevue BP 110 Annecy-le-Vieux F-74941 Annecy Cedex (France); Lesgourgues, Julien, E-mail: Vivian.Poulin@lapth.cnrs.fr, E-mail: Pasquale.Serpico@lapth.cnrs.fr, E-mail: Julien.Lesgourgues@physik.rwth-aachen.de [Institute for Theoretical Particle Physics and Cosmology (TTK), RWTH Aachen University, D-52056 Aachen (Germany)

2017-03-01

We compute cosmic microwave background (CMB) anisotropy constraints on exotic forms of energy injection in electromagnetic (e.m.) channels over a large range of timescales. We show that these constraints are very powerful around or just after recombination, although CMB keeps some sensitivity e.g. to decaying species with lifetimes as long as 10{sup 25} s. These bounds are complementary to CMB spectral distortions and primordial nucleosynthesis ones, which dominate at earlier timescales, as we also review here. For the first time, we describe the effects of the e.m. energy injection on the CMB power spectra as a function of the injection epoch , using the lifetime of a decaying particle as proxy. We also identify a suitable on-the-spot approximation, that can be used to derive accurate constraints, and describe its differences with the most up-to-date treatment. Our results are of interest not only for early universe relics constituting (a fraction of) the dark matter, but also for other exotic injection of e.m. radiation. For illustration, we apply our formalism to: i) Primordial black holes of mass 10{sup 13.5} g ∼< M ∼< 10{sup 16.8} g, showing that the constraints are comparable to the ones obtained from gamma-ray background studies and even dominate below ∼ 10{sup 14} g. ii) To a peculiar mass-mixing range in the sterile neutrino parameter space, complementary to other astrophysical and laboratory probes. iii) Finally, we provide a first estimate of the room for improvement left for forthcoming 21 cm experiments, comparing it with the reach of proposed CMB spectral distortion (PiXiE) and CMB angular power spectrum (CORE) missions. We show that the best and most realistic opportunity to look for this signal (or to improve over current constraints) in the 21 cm probe is to focus on the Cosmic Dawn epoch, 15 ∼< z ∼< 30, where the qualitatively unambiguous signature of a spectrum in emission can be expected for models that evade all current constraints.

Constraint and loneliness in agoraphobia: an empirical investigation.

Science.gov (United States)

Pehlivanidis, A; Koulis, S; Papakostas, Y

2014-01-01

While progress in the aetiopathology and treatment of panic disorder is indisputable, research regarding agoraphobia lacks behind. One significant-yet untested- theory by Guidano and Liotti, suggests the existence of inner representations of fear of "constraint" and fear of "loneliness" as two major schemata, important in the pathogenesis and manifestation of agoraphobia. Activation of these schemata may occur in situations in which the patient: (a) feels as in an inescapable trap (constraint) or (b) alone, unprotected and helpless (loneliness). Upon activation, the "constraint" schema elicits such symptoms as asphyxiation, chest pain, difficult breathing, motor agitation and muscular tension, while the "loneliness" schema elicits such symptoms as sensation of tachycardia, weakness of limbs, trembling or fainting. Activation of these schemata by content-compatible stimuli is expected to trigger various, yet distinct, response patterns, both of which are indiscriminately described within the term "agoraphobia". In order to investigate this hypothesis and its possible clinical applications, several mental and physical probes were applied to 20 patients suffering primarily from agoraphobia, and their responses and performance were recorded. Subjects also completed the "10-item Agoraphobia Questionnaire" prepared by our team aiming at assessing cognitions related to Guidano and Liotti's notion of "loneliness" and "constraint". Breath holding (BH) and Hyperventilation (HV) were selected as physical probes. BH was selected as an easily administered hypercapnea - induced clinical procedure, because of its apparent resemblance to the concept of "constraint". Subjects were instructed to hold their breath for as long as they could and stop at will. Similarly, it was hypothesized that HV might represent a physical "loneliness" probe, since it can elicit such symptoms as dizziness, paraesthesias, stiff muscles, cold hands or feet and trembling, reminiscent of a "collapsing

Reproducing multi-model ensemble average with Ensemble-averaged Reconstructed Forcings (ERF) in regional climate modeling

Science.gov (United States)

Erfanian, A.; Fomenko, L.; Wang, G.

2016-12-01

Multi-model ensemble (MME) average is considered the most reliable for simulating both present-day and future climates. It has been a primary reference for making conclusions in major coordinated studies i.e. IPCC Assessment Reports and CORDEX. The biases of individual models cancel out each other in MME average, enabling the ensemble mean to outperform individual members in simulating the mean climate. This enhancement however comes with tremendous computational cost, which is especially inhibiting for regional climate modeling as model uncertainties can originate from both RCMs and the driving GCMs. Here we propose the Ensemble-based Reconstructed Forcings (ERF) approach to regional climate modeling that achieves a similar level of bias reduction at a fraction of cost compared with the conventional MME approach. The new method constructs a single set of initial and boundary conditions (IBCs) by averaging the IBCs of multiple GCMs, and drives the RCM with this ensemble average of IBCs to conduct a single run. Using a regional climate model (RegCM4.3.4-CLM4.5), we tested the method over West Africa for multiple combination of (up to six) GCMs. Our results indicate that the performance of the ERF method is comparable to that of the MME average in simulating the mean climate. The bias reduction seen in ERF simulations is achieved by using more realistic IBCs in solving the system of equations underlying the RCM physics and dynamics. This endows the new method with a theoretical advantage in addition to reducing computational cost. The ERF output is an unaltered solution of the RCM as opposed to a climate state that might not be physically plausible due to the averaging of multiple solutions with the conventional MME approach. The ERF approach should be considered for use in major international efforts such as CORDEX. Key words: Multi-model ensemble, ensemble analysis, ERF, regional climate modeling

Averaging for solitons with nonlinearity management

International Nuclear Information System (INIS)

Pelinovsky, D.E.; Kevrekidis, P.G.; Frantzeskakis, D.J.

2003-01-01

We develop an averaging method for solitons of the nonlinear Schroedinger equation with a periodically varying nonlinearity coefficient, which is used to effectively describe solitons in Bose-Einstein condensates, in the context of the recently proposed technique of Feshbach resonance management. Using the derived local averaged equation, we study matter-wave bright and dark solitons and demonstrate a very good agreement between solutions of the averaged and full equations

Selective constraint on noncoding regions of hominid genomes.

Directory of Open Access Journals (Sweden)

Eliot C Bush

2005-12-01

Full Text Available An important challenge for human evolutionary biology is to understand the genetic basis of human-chimpanzee differences. One influential idea holds that such differences depend, to a large extent, on adaptive changes in gene expression. An important step in assessing this hypothesis involves gaining a better understanding of selective constraint on noncoding regions of hominid genomes. In noncoding sequence, functional elements are frequently small and can be separated by large nonfunctional regions. For this reason, constraint in hominid genomes is likely to be patchy. Here we use conservation in more distantly related mammals and amniotes as a way of identifying small sequence windows that are likely to be functional. We find that putatively functional noncoding elements defined in this manner are subject to significant selective constraint in hominids.

Selective Constraint on Noncoding Regions of Hominid Genomes.

Directory of Open Access Journals (Sweden)

2005-12-01

Full Text Available An important challenge for human evolutionary biology is to understand the genetic basis of human-chimpanzee differences. One influential idea holds that such differences depend, to a large extent, on adaptive changes in gene expression. An important step in assessing this hypothesis involves gaining a better understanding of selective constraint on noncoding regions of hominid genomes. In noncoding sequence, functional elements are frequently small and can be separated by large nonfunctional regions. For this reason, constraint in hominid genomes is likely to be patchy. Here we use conservation in more distantly related mammals and amniotes as a way of identifying small sequence windows that are likely to be functional. We find that putatively functional noncoding elements defined in this manner are subject to significant selective constraint in hominids.

Mining Matters : Natural Resource Extraction and Local Business Constraints

NARCIS (Netherlands)

de Haas, Ralph; Poelhekke, Steven

2016-01-01

We estimate the impact of local mining activity on the business constraints experienced by 22,150 firms across eight resource-rich countries. We find that with the presence of active mines, the business environment in the immediate vicinity (<20 km) of a firm deteriorates but business constraints of

The perceived constraints, motivation, and physical activity levels of ...

African Journals Online (AJOL)

The purpose of this research was threefold; Are Korean youth physically active to promote health during leisure time? What constraints to physical active do youth experience during leisure time? Are there relationships among constraints, motivation, and physical activity level? Of 1 280 youth randomly selected by a ...

Gauge constraints and electromagnetic properties of off-shell particles

NARCIS (Netherlands)

Nagorny, S.I.; Dieperink, A.E.L.

The consequences of the gauge constraints for off-shellness in the electromagnetic (EM) vertices have been considered, using Compton scattering as an example. We have found that even if the gauge constraint for the 3-point EM Green function allows for off-shell effects in the charge (Dirac) form

Finding Deadlocks of Event-B Models by Constraint Solving

DEFF Research Database (Denmark)

Hallerstede, Stefan; Leuschel, Michael

we propose a constraint-based approach to nding deadlocks employing the ProB constraint solver to nd values for the constants and variables of formal models that describe a deadlocking state. We discuss the principles of the technique implemented in ProB's Prolog kernel and present some results...

Cooperative Path Planning and Constraints Analysis for Master-Slave Industrial Robots

Directory of Open Access Journals (Sweden)

Yahui Gan

2012-09-01

Full Text Available A strategy of cooperative path planning for a master-slave multiple robot system is presented in this paper. The path planning method is based on motion constraints between the end-effectors of cooperative robots. Cooperation motions have been classified into three types by relative motions between end-effectors of master and slave robots, which is concurrent cooperation, coupled synchronous cooperation and combined synchronous cooperation. Based on this classification, position /orientation constraints and joint velocity constraints are explored in-depth here. In order to validate the path planning method and the theoretical developments in motion constraints analysis, representative experiments based on two industrial robots, Motoman VA1400 and HP20, are provided at the end of the paper. The experimental results have proved both the effectiveness of the path planning method and the correctness of the constraints analysis.

Operating the Cross Spectral Metric Algorithm with Limited Secondary Data Support

National Research Council Canada - National Science Library

Hale, Todd

1999-01-01

...) techniques is secondary data support for the covariance matrix estimate. Reed has shown the required secondary data support to achieve performance within 3 db of optimal SINR is approximately twice the Degrees Of Freedom (DOF) used...

An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems

Directory of Open Access Journals (Sweden)

Roberto Amadini

2016-06-01

Full Text Available In the context of Constraint Programming, a portfolio approach exploits the complementary strengths of a portfolio of different constraint solvers. The goal is to predict and run the best solver(s of the portfolio for solving a new, unseen problem. In this work we reproduce, simulate, and evaluate the performance of different portfolio approaches on extensive benchmarks of Constraint Satisfaction Problems. Empirical results clearly show the benefits of portfolio solvers in terms of both solved instances and solving time.

Financial constraints and international trade with endogenous mode of competition:

OpenAIRE

Bouët, Antoine; Vaubourg, Anne-Gaël

2015-01-01

The goal of this paper is to examine how financial constraints affect firms’ decisions to export when the mode of intra-sectoral competition is endogenous. We propose an extension of Neary and Tharakan’s (2012) model, in which firms resort to external funders to finance fixed export costs and investments in production capacities. We assume that sectors differ in financial constraint and that the cost of capital increases with the level of financial constraint. We first show that less financia...

Phase-Field Relaxation of Topology Optimization with Local Stress Constraints

DEFF Research Database (Denmark)

Stainko, Roman; Burger, Martin

2006-01-01

inequality constraints. We discretize the problem by finite elements and solve the arising finite-dimensional programming problems by a primal-dual interior point method. Numerical experiments for problems with local stress constraints based on different criteria indicate the success and robustness......We introduce a new relaxation scheme for structural topology optimization problems with local stress constraints based on a phase-field method. In the basic formulation we have a PDE-constrained optimization problem, where the finite element and design analysis are solved simultaneously...

Constraints on CP violating four-fermion interactions

International Nuclear Information System (INIS)

He, X.G.; McKellar, B.

1996-04-01

It has been shown that CP violating electron-nucleon and nucleon-nucleon interactions can induce atomic electric dipole moments and are therefore constrained from experimental data. We show that using the experimental upper bounds on neutron and electron electric dipole moments, one can also obtain constraints, in some cases better ones, on these interactions. In addition stringent constraints can also be obtained for muon-quark and tauon-quark four-fermion CP violating interactions, which cannot be constrained from atomic electric dipole moment experiments. 12 refs., 2 tabs., 1 fig

Correlation-based decimation in constraint satisfaction problems

International Nuclear Information System (INIS)

Higuchi, Saburo; Mezard, Marc

2010-01-01

We study hard constraint satisfaction problems using some decimation algorithms based on mean-field approximations. The message-passing approach is used to estimate, beside the usual one-variable marginals, the pair correlation functions. The identification of strongly correlated pairs allows to use a new decimation procedure, where the relative orientation of a pair of variables is fixed. We apply this novel decimation to locked occupation problems, a class of hard constraint satisfaction problems where the usual belief-propagation guided decimation performs poorly. The pair-decimation approach provides a significant improvement.

Constraints on relaxation rates for N-level quantum systems

International Nuclear Information System (INIS)

Schirmer, S.G.; Solomon, A.I.

2004-01-01

We study the constraints imposed on the population and phase relaxation rates by the physical requirement of completely positive evolution for open N-level systems. The Lindblad operators that govern the evolution of the system are expressed in terms of observable relaxation rates, explicit formulas for the decoherence rates due to population relaxation are derived, and it is shown that there are additional, nontrivial constraints on the pure dephasing rates for N>2. Explicit, experimentally testable inequality constraints for the decoherence rates are derived for three- and four-level systems, and the implications of the results are discussed for generic ladder, Λ, and V systems and transitions between degenerate energy levels

Implications of water constraints for electricity capacity expansion in the United States

Science.gov (United States)

Liu, L.; Hejazi, M. I.; Iyer, G.; Forman, B. A.

2017-12-01

U.S. electricity generation is vulnerable to water supply since water is required for cooling. Constraints on the availability of water will therefore necessitate adaptive planning by the power generation sector. Hence, it is important to integrate restrictions in water availability in electricity capacity planning in order to better understand the economic viability of alternative capacity planning options. The study of the implications of water constraints for the U.S. power generation system is limited in terms of scale and robustness. We extend previous studies by including physical water constraints in a state-level model of the U.S. energy system embedded within a global integrated assessment model (GCAM-USA). We focus on the implications of such constraints for the U.S. electricity capacity expansion, integrating both supply and demand effects under a consistent framework. Constraints on the availability of water have two general effects across the U.S. First, water availability constraints increase the cost of electricity generation, resulting in reduced electrification of end-use sectors. Second, water availability constraints result in forced retirements of water-intensive technologies such as thermoelectric coal- and gas- fired technologies before the end of their natural lifetimes. The demand for electricity is then met by an increase in investments in less water-dependent technologies such as wind and solar photovoltaic. Our results show that the regional patterns of the above effects are heterogeneous across the U.S. In general, the impacts of water constraints on electricity capacity expansion are more pronounced in the West than in the East. This is largely because of lower water availability in the West compared to the East due to lower precipitation in the Western states. Constraints on the availability of water might also have important implications for U.S. electricity trade. For example, under severe constraints on the availability of water

Balancing Structural and Temporal Constraints in Multitasking Contexts

OpenAIRE

Salvucci, Dario D.; Kujala, Tuomo

2016-01-01

Recent research has shown that when people multitask, both the subtask structure and the temporal constraints of the component tasks strongly influence people’s task-switching behavior. In this paper, we propose an integrated theoretical account and associated computational model that aims to quantify how people balance structural and temporal constraints in everyday multitasking. We validate the theory using data from an empirical study in which drivers performed a vi...

Alternative Constraint Handling Technique for Four-Bar Linkage Path Generation

Science.gov (United States)

Sleesongsom, S.; Bureerat, S.

2018-03-01

This paper proposes an extension of a new concept for path generation from our previous work by adding a new constraint handling technique. The propose technique was initially designed for problems without prescribed timing by avoiding the timing constraint, while remain constraints are solving with a new constraint handling technique. The technique is one kind of penalty technique. The comparative study is optimisation of path generation problems are solved using self-adaptive population size teaching-learning based optimization (SAP-TLBO) and original TLBO. In this study, two traditional path generation test problem are used to test the proposed technique. The results show that the new technique can be applied with the path generation problem without prescribed timing and gives better results than the previous technique. Furthermore, SAP-TLBO outperforms the original one.

Using the Theory of Constraints for Effective Supply Chain Management

Directory of Open Access Journals (Sweden)

Archie Lockhamy III

1999-08-01

Full Text Available This article provides methodology and guidelines for employing a 'constraint-based approach for effective supply chain management. The article explores the shortcomings of using a traditional supply chain management as well as an Activity Based Management (ABM approach in the managing of supply chains. In addition, the article introduces a supply chain management methodology based on achieving a global optimum for the entire chain. Examples are provided on how constraint-based techniques are currently being applied to the management of certain subsets of the supply chain. Guidelines are presented for managing supply chains using a constraint-based approach. Finally, the article ends with the discussion of the implications regarding the use of a constraint-based approach to the management of supply chains along with the need for future research in this area.

MatrixPlot: visualizing sequence constraints

DEFF Research Database (Denmark)

Gorodkin, Jan; Stærfeldt, Hans Henrik; Lund, Ole

1999-01-01

MatrixPlot: visualizing sequence constraints. Sub-title Abstract Summary : MatrixPlot is a program for making high-quality matrix plots, such as mutual information plots of sequence alignments and distance matrices of sequences with known three-dimensional coordinates. The user can add information...

Financial Constraints: Explaining Your Position.

Science.gov (United States)

Cargill, Jennifer

1988-01-01

Discusses the importance of educating library patrons about the library's finances and the impact of budget constraints and the escalating cost of serials on materials acquisition. Steps that can be taken in educating patrons by interpreting and publicizing financial information are suggested. (MES)

Constraint-aware interior layout exploration for pre-cast concrete-based buildings

KAUST Repository

Liu, Han

2013-05-03

Creating desirable layouts of building interiors is a complex task as designers have to manually adhere to various local and global considerations arising from competing practical and design considerations. In this work, we present an interactive design tool to create desirable floorplans by computationally conforming to such design constraints. Specifically, we support three types of constraints: (i) functional constraints such as number of rooms, connectivity among the rooms, target room areas, etc.; (ii) design considerations such as user modifications and preferences, and (iii) fabrication constraints such as cost and convenience of manufacturing. Based on user specifications, our system automatically generates multiple floor layouts with associated 3D geometry that all satisfy the design specifications and constraints, thus exposing only the desirable family of interior layouts to the user. In this work, we focus on pre-cast concrete-based constructions, which lead to interesting discrete and continuous optimization possibilities. We test our framework on a range of complex real-world specifications and demonstrate the control and expressiveness of the exposed design space relieving the users of the task of manually adhering to non-local functional and fabrication constraints. © 2013 Springer-Verlag Berlin Heidelberg.

Giant Panda Maternal Care: A Test of the Experience Constraint Hypothesis

Science.gov (United States)

Snyder, Rebecca J.; Perdue, Bonnie M.; Zhang, Zhihe; Maple, Terry L.; Charlton, Benjamin D.

2016-01-01

The body condition constraint and the experience condition constraint hypotheses have both been proposed to account for differences in reproductive success between multiparous (experienced) and primiparous (first-time) mothers. However, because primiparous mothers are typically characterized by both inferior body condition and lack of experience when compared to multiparous mothers, interpreting experience related differences in maternal care as support for either the body condition constraint hypothesis or the experience constraint hypothesis is extremely difficult. Here, we examined maternal behaviour in captive giant pandas, allowing us to simultaneously control for body condition and provide a rigorous test of the experience constraint hypothesis in this endangered animal. We found that multiparous mothers spent more time engaged in key maternal behaviours (nursing, grooming, and holding cubs) and had significantly less vocal cubs than primiparous mothers. This study provides the first evidence supporting the experience constraint hypothesis in the order Carnivora, and may have utility for captive breeding programs in which it is important to monitor the welfare of this species’ highly altricial cubs, whose survival is almost entirely dependent on receiving adequate maternal care during the first few weeks of life. PMID:27272352

Logic-based methods for optimization combining optimization and constraint satisfaction

CERN Document Server

Hooker, John

2011-01-01

A pioneering look at the fundamental role of logic in optimization and constraint satisfaction While recent efforts to combine optimization and constraint satisfaction have received considerable attention, little has been said about using logic in optimization as the key to unifying the two fields. Logic-Based Methods for Optimization develops for the first time a comprehensive conceptual framework for integrating optimization and constraint satisfaction, then goes a step further and shows how extending logical inference to optimization allows for more powerful as well as flexible

On Gupta-Bleuler quantization of systems with second-class constraints

International Nuclear Information System (INIS)

Kalau, Wolfgang.

1992-01-01

In this paper Hamiltonian systems with mixed first and second-class constraints are discussed. The authors prove that in a neighborhood of the constraint surface the complexified constraints can always be split into a holomorphic and an anti-holomorphic set, such that the holomorphic set can be implemented consistently on the ket-states of the corresponding quantum theory. The quantization is performed with BRSY-methods using a non-hermitian BRST-operator. As an example this method is used to quantize the 4-dimensional superparticle. (author). 25 refs

Stochastic optimization under risk constraint and utility functions

International Nuclear Information System (INIS)

Seck, B.

2008-09-01

In a context of concurrence and emergence of energy markets, the production of electricity is affected by the new sources of risks which are the price variations on the energy markets. These new sources of risks generate a new risk: the market risk. In this research, the author explores the possibility of introducing constraints, expressed by measurements of risk, into the process of optimization of electricity production when financial contracts are signed on the energy market. The author makes the distinction between the engineering approach (taking the risk into account by risk measurements) and the economist approach (taking the risk into account by utility functions). After an overview of these both approaches in a static framework, he gives an economical formulation (a Maccheroni type one) for a static optimization problem under a risk constraint when the risk measurement is written under the form of an expected infimum like the variance, the 'conditional value at risk', and so on. The obtained results are then extended to a dynamic optimization framework under risk constraints. A numerical application of this approach is presented to solve a problem of electricity production management under a constraint of 'conditional value at risk' on a middle term

Formulating the Net Gain of MISO-SFN in the Presence of Self-Interferences

Directory of Open Access Journals (Sweden)

S. Jeon

2015-06-01

Full Text Available In this study, an analytical formula for multiple-input single-output single frequency network gain (MISO-SFNG is investigated. To formulate the net MISO-SFNG, we derived the average signal to interference plus noise ratio (SINR where the gain achieved by the distributed MISO diversity as a function of power imbalance is curve-fitted. Further, we analyzed the losses owing to self-interferences resulting from the delay spread and imperfect channel estimation. We verified the accuracy and effectiveness of the derived formula by comparing the measurement results with the analytical results. The derived formula helps to understand how various system factors affect the gain under a given condition. The formula can be used to evaluate the MISO-SFNG and to predict the MISO-SFN coverage in various system configurations.

Proposal of Constraints Analysis Method Based on Network Model for Task Planning

Science.gov (United States)

Tomiyama, Tomoe; Sato, Tatsuhiro; Morita, Toyohisa; Sasaki, Toshiro

Deregulation has been accelerating several activities toward reengineering business processes, such as railway through service and modal shift in logistics. Making those activities successful, business entities have to regulate new business rules or know-how (we call them ‘constraints’). According to the new constraints, they need to manage business resources such as instruments, materials, workers and so on. In this paper, we propose a constraint analysis method to define constraints for task planning of the new business processes. To visualize each constraint's influence on planning, we propose a network model which represents allocation relations between tasks and resources. The network can also represent task ordering relations and resource grouping relations. The proposed method formalizes the way of defining constraints manually as repeatedly checking the network structure and finding conflicts between constraints. Being applied to crew scheduling problems shows that the method can adequately represent and define constraints of some task planning problems with the following fundamental features, (1) specifying work pattern to some resources, (2) restricting the number of resources for some works, (3) requiring multiple resources for some works, (4) prior allocation of some resources to some works and (5) considering the workload balance between resources.

Modeling virtualized downlink cellular networks with ultra-dense small cells

KAUST Repository

Ibrahim, Hazem; Elsawy, Hesham; Nguyen, Uyen T.; Alouini, Mohamed-Slim

2015-01-01

-to-interference-plus-noise-ratio (SINR) performance, hence, increases the spatial spectral efficiency and improves the overall network performance. However, control signaling in such dense networks consumes considerable bandwidth and limits the densification gain. Radio access network

The ESS and replicator equation in matrix games under time constraints.

Science.gov (United States)

Garay, József; Cressman, Ross; Móri, Tamás F; Varga, Tamás

2018-06-01

Recently, we introduced the class of matrix games under time constraints and characterized the concept of (monomorphic) evolutionarily stable strategy (ESS) in them. We are now interested in how the ESS is related to the existence and stability of equilibria for polymorphic populations. We point out that, although the ESS may no longer be a polymorphic equilibrium, there is a connection between them. Specifically, the polymorphic state at which the average strategy of the active individuals in the population is equal to the ESS is an equilibrium of the polymorphic model. Moreover, in the case when there are only two pure strategies, a polymorphic equilibrium is locally asymptotically stable under the replicator equation for the pure-strategy polymorphic model if and only if it corresponds to an ESS. Finally, we prove that a strict Nash equilibrium is a pure-strategy ESS that is a locally asymptotically stable equilibrium of the replicator equation in n-strategy time-constrained matrix games.

40 CFR 600.510-12 - Calculation of average fuel economy and average carbon-related exhaust emissions.

Science.gov (United States)

2010-07-01

... and average carbon-related exhaust emissions. 600.510-12 Section 600.510-12 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) ENERGY POLICY FUEL ECONOMY AND CARBON-RELATED EXHAUST EMISSIONS OF... Transportation. (iv) [Reserved] (2) Average carbon-related exhaust emissions will be calculated to the nearest...

Automatic Constraint Detection for 2D Layout Regularization.

Science.gov (United States)

Jiang, Haiyong; Nan, Liangliang; Yan, Dong-Ming; Dong, Weiming; Zhang, Xiaopeng; Wonka, Peter

2016-08-01

In this paper, we address the problem of constraint detection for layout regularization. The layout we consider is a set of two-dimensional elements where each element is represented by its bounding box. Layout regularization is important in digitizing plans or images, such as floor plans and facade images, and in the improvement of user-created contents, such as architectural drawings and slide layouts. To regularize a layout, we aim to improve the input by detecting and subsequently enforcing alignment, size, and distance constraints between layout elements. Similar to previous work, we formulate layout regularization as a quadratic programming problem. In addition, we propose a novel optimization algorithm that automatically detects constraints. We evaluate the proposed framework using a variety of input layouts from different applications. Our results demonstrate that our method has superior performance to the state of the art.

Automatic Constraint Detection for 2D Layout Regularization

KAUST Repository

Jiang, Haiyong

2015-09-18

In this paper, we address the problem of constraint detection for layout regularization. As layout we consider a set of two-dimensional elements where each element is represented by its bounding box. Layout regularization is important for digitizing plans or images, such as floor plans and facade images, and for the improvement of user created contents, such as architectural drawings and slide layouts. To regularize a layout, we aim to improve the input by detecting and subsequently enforcing alignment, size, and distance constraints between layout elements. Similar to previous work, we formulate the layout regularization as a quadratic programming problem. In addition, we propose a novel optimization algorithm to automatically detect constraints. In our results, we evaluate the proposed framework on a variety of input layouts from different applications, which demonstrates our method has superior performance to the state of the art.

Constraints based analysis of extended cybernetic models.

Science.gov (United States)

Mandli, Aravinda R; Venkatesh, Kareenhalli V; Modak, Jayant M

2015-11-01

The cybernetic modeling framework provides an interesting approach to model the regulatory phenomena occurring in microorganisms. In the present work, we adopt a constraints based approach to analyze the nonlinear behavior of the extended equations of the cybernetic model. We first show that the cybernetic model exhibits linear growth behavior under the constraint of no resource allocation for the induction of the key enzyme. We then quantify the maximum achievable specific growth rate of microorganisms on mixtures of substitutable substrates under various kinds of regulation and show its use in gaining an understanding of the regulatory strategies of microorganisms. Finally, we show that Saccharomyces cerevisiae exhibits suboptimal dynamic growth with a long diauxic lag phase when growing on a mixture of glucose and galactose and discuss on its potential to achieve optimal growth with a significantly reduced diauxic lag period. The analysis carried out in the present study illustrates the utility of adopting a constraints based approach to understand the dynamic growth strategies of microorganisms. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

Constraint theory, singular lagrangians and multitemporal dynamics

International Nuclear Information System (INIS)

Lusanna, L.

1988-01-01

Singular Lagrangians and constraint theory permeate theoretical physics, as shown by the relevance of gauge theories, string models and general relativity. Their study used finite---dimensional models as a guide to develop the theory, but their main use was in classical field theory, due to the necessity of understanding their quantization. The covariant quantization of singular Lagrangians led to the BRST approach and to the theory of the effective action. On the other hand their phase---space formulation, culminated with the BFV approach for first class, second class and reducible constraints. It, in turn, gave new insights in the theory of singular Lagrangians and constraints and in their cohomological aspects. However the Hamiltonian approach to field theory is highly nontrivial, is open to criticism due to its problems with locality, geometry and manifest covariance and its canonical quantization has still to be developed, because there is no proof of the renormalizability of the Schroedinger representation of field theory. This paper discusses how, notwithstanding these developments, there is still a big amount of ambiguity at every level of the theory

Improved averaging for non-null interferometry

Science.gov (United States)

Fleig, Jon F.; Murphy, Paul E.

2013-09-01

Arithmetic averaging of interferometric phase measurements is a well-established method for reducing the effects of time varying disturbances, such as air turbulence and vibration. Calculating a map of the standard deviation for each pixel in the average map can provide a useful estimate of its variability. However, phase maps of complex and/or high density fringe fields frequently contain defects that severely impair the effectiveness of simple phase averaging and bias the variability estimate. These defects include large or small-area phase unwrapping artifacts, large alignment components, and voids that change in number, location, or size. Inclusion of a single phase map with a large area defect into the average is usually sufficient to spoil the entire result. Small-area phase unwrapping and void defects may not render the average map metrologically useless, but they pessimistically bias the variance estimate for the overwhelming majority of the data. We present an algorithm that obtains phase average and variance estimates that are robust against both large and small-area phase defects. It identifies and rejects phase maps containing large area voids or unwrapping artifacts. It also identifies and prunes the unreliable areas of otherwise useful phase maps, and removes the effect of alignment drift from the variance estimate. The algorithm has several run-time adjustable parameters to adjust the rejection criteria for bad data. However, a single nominal setting has been effective over a wide range of conditions. This enhanced averaging algorithm can be efficiently integrated with the phase map acquisition process to minimize the number of phase samples required to approach the practical noise floor of the metrology environment.

Stochastic programming problems with generalized integrated chance constraints

Czech Academy of Sciences Publication Activity Database

Branda, Martin

2012-01-01

Roč. 61, č. 8 (2012), s. 949-968 ISSN 0233-1934 R&D Projects: GA ČR GAP402/10/1610 Grant - others:SVV(CZ) 261315/2010 Institutional support: RVO:67985556 Keywords : chance constraints * integrated chance constraints * penalty functions * sample approximations * blending problem Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.707, year: 2012 http://library.utia.cas.cz/separaty/2012/E/branda-stochastic programming problems with generalized integrated.pdf

New Constraints on the running-mass inflation model

OpenAIRE

Covi, Laura; Lyth, David H.; Melchiorri, Alessandro

2002-01-01

We evaluate new observational constraints on the two-parameter scale-dependent spectral index predicted by the running-mass inflation model by combining the latest Cosmic Microwave Background (CMB) anisotropy measurements with the recent 2dFGRS data on the matter power spectrum, with Lyman $\\alpha $ forest data and finally with theoretical constraints on the reionization redshift. We find that present data still allow significant scale-dependence of $n$, which occurs in a physically reasonabl...

Computing group cardinality constraint solutions for logistic regression problems.

Science.gov (United States)

Zhang, Yong; Kwon, Dongjin; Pohl, Kilian M

2017-01-01

We derive an algorithm to directly solve logistic regression based on cardinality constraint, group sparsity and use it to classify intra-subject MRI sequences (e.g. cine MRIs) of healthy from diseased subjects. Group cardinality constraint models are often applied to medical images in order to avoid overfitting of the classifier to the training data. Solutions within these models are generally determined by relaxing the cardinality constraint to a weighted feature selection scheme. However, these solutions relate to the original sparse problem only under specific assumptions, which generally do not hold for medical image applications. In addition, inferring clinical meaning from features weighted by a classifier is an ongoing topic of discussion. Avoiding weighing features, we propose to directly solve the group cardinality constraint logistic regression problem by generalizing the Penalty Decomposition method. To do so, we assume that an intra-subject series of images represents repeated samples of the same disease patterns. We model this assumption by combining series of measurements created by a feature across time into a single group. Our algorithm then derives a solution within that model by decoupling the minimization of the logistic regression function from enforcing the group sparsity constraint. The minimum to the smooth and convex logistic regression problem is determined via gradient descent while we derive a closed form solution for finding a sparse approximation of that minimum. We apply our method to cine MRI of 38 healthy controls and 44 adult patients that received reconstructive surgery of Tetralogy of Fallot (TOF) during infancy. Our method correctly identifies regions impacted by TOF and generally obtains statistically significant higher classification accuracy than alternative solutions to this model, i.e., ones relaxing group cardinality constraints. Copyright © 2016 Elsevier B.V. All rights reserved.

Branch and bound algorithms to solve semiring constraint satisfaction problems

CSIR Research Space (South Africa)

Leenen, L

2008-12-01

Full Text Available The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. Considerable research has been done in solving SCSPs, but limited work has been done in building...

Constraints to sustainable development of rubber industry in Nigeria ...

African Journals Online (AJOL)

The findings revealed that lack of inputs, lack of credit facilities, high production cost are some of the constraints to sustainable development. The study also revealed among others the causes of the constraints, which include high lending interest rate, diversion of loan by farmers, low exchange rate of the Naira and old age ...

Intertemporal consumption and credit constraints

DEFF Research Database (Denmark)

Leth-Petersen, Søren

2010-01-01

There is continuing controversy over the importance of credit constraints. This paper investigates whether total household expenditure and debt is affected by an exogenous increase in access to credit provided by a credit market reform that enabled Danish house owners to use housing equity...

A time-averaged cosmic ray propagation theory

International Nuclear Information System (INIS)

Klimas, A.J.

1975-01-01

An argument is presented, which casts doubt on our ability to choose an appropriate magnetic field ensemble for computing the average behavior of cosmic ray particles. An alternate procedure, using time-averages rather than ensemble-averages, is presented. (orig.) [de

The poloidal OHM's law and a profile constraint in tokamaks

International Nuclear Information System (INIS)

Segre, S.E.; Zanza, V.

1991-01-01

Explicit use of the poloidal Ohm's law, together with the radial plasma velocity (obtained from the distribution of plasma sources), leads to a very general constraint on the possible radial profiles of plasma density and temperature. The constraint does not require any ad hoc assumption; it can place severe restrictions on the allowed profiles and is independent of energy and particle transport; also, it may be the underlying principle of profile consistency. The constraint is discussed in the framework of neoclassical theory, using results from the Frascati tokamak. (author). 23 refs, 7 figs

About some types of constraints in problems of routing

Science.gov (United States)

Petunin, A. A.; Polishuk, E. G.; Chentsov, A. G.; Chentsov, P. A.; Ukolov, S. S.

2016-12-01

Many routing problems arising in different applications can be interpreted as a discrete optimization problem with additional constraints. The latter include generalized travelling salesman problem (GTSP), to which task of tool routing for CNC thermal cutting machines is sometimes reduced. Technological requirements bound to thermal fields distribution during cutting process are of great importance when developing algorithms for this task solution. These requirements give rise to some specific constraints for GTSP. This paper provides a mathematical formulation for the problem of thermal fields calculating during metal sheet thermal cutting. Corresponding algorithm with its programmatic implementation is considered. The mathematical model allowing taking such constraints into account considering other routing problems is discussed either.

Defect assessments of pipelines based on the FAD approach incorporating constraint effects

Energy Technology Data Exchange (ETDEWEB)

Ruggieri, Claudio; Cravero, Sebastian [Sao Paulo Univ., SP (Brazil)

2005-07-01

This work presents a framework for including constraint effects in the failure assessment diagram (FAD) approach. The procedure builds upon the constraint-based Q methodology to correct measured toughness values using low constraint fracture specimens which modifies the shape of the FAD curve. The approach is applied to predict the failure (burst pressure) of high pressure pipelines with planar defects having different geometries (i.e., crack depth and crack length). The FAD curves are corrected for effects of constraint based on the L{sub r}-Q trajectories for pin-loaded SE(T) specimens. The article shows that inclusion of constraint effects in the FAD approach provides better agreement between experimentally measured burst pressure and predicted values for high pressure pipelines with planar defects. (author)

Constraints Faced by the Dairy Farmers in Nagpur District while Adopting Animal Managenment Practices

Directory of Open Access Journals (Sweden)

A.P.Patil

2009-06-01

Full Text Available The present study was carried out to analyse the constraints faced by the dairy farmers in Nagpur district. This study was conducted in 15 villages from 3 talukas of Nagpur district by personally interviewing 225 dairy farmers. Here, majority of the respondents (72.44% stated their constraint as low milk production from the local breeds, 45.33% as shortage of green fodder and 41.33% as lack of clean water while 25.33% stated lack of preservation facility as their constraint. Referring to the financial constraints, 78.22% respondents stated their constraint as delay in milk payment,63.11% as inadequate money and lack of loan facility whereas high cost of concentrates as the constraint by 56.44% of the respondents. As regards technical constraints, majority of the respondents (68.00% have stated their constraint as inadequate knowledge of diseases, their prevention and control while 56.89% have referred their constraint as non-availability of veterinary services. [Vet. World 2009; 2(3.000: 111-112

Searching for genomic constraints

Energy Technology Data Exchange (ETDEWEB)

Lio` , P [Cambridge, Univ. (United Kingdom). Genetics Dept.; Ruffo, S [Florence, Univ. (Italy). Fac. di Ingegneria. Dipt. di Energetica ` S. Stecco`

1998-01-01

The authors have analyzed general properties of very long DNA sequences belonging to simple and complex organisms, by using different correlation methods. They have distinguished those base compositional rules that concern the entire genome which they call `genomic constraints` from the rules that depend on the `external natural selection` acting on single genes, i. e. protein-centered constraints. They show that G + C content, purine / pyrimidine distributions and biological complexity of the organism are the most important factors which determine base compositional rules and genome complexity. Three main facts are here reported: bacteria with high G + C content have more restrictions on base composition than those with low G + C content; at constant G + C content more complex organisms, ranging from prokaryotes to higher eukaryotes (e.g. human) display an increase of repeats 10-20 nucleotides long, which are also partly responsible for long-range correlations; work selection of length 3 to 10 is stronger in human and in bacteria for two distinct reasons. With respect to previous studies, they have also compared the genomic sequence of the archeon Methanococcus jannaschii with those of bacteria and eukaryotes: it shows sometimes an intermediate statistical behaviour.

Searching for genomic constraints

International Nuclear Information System (INIS)

Lio', P.; Ruffo, S.

1998-01-01

The authors have analyzed general properties of very long DNA sequences belonging to simple and complex organisms, by using different correlation methods. They have distinguished those base compositional rules that concern the entire genome which they call 'genomic constraints' from the rules that depend on the 'external natural selection' acting on single genes, i. e. protein-centered constraints. They show that G + C content, purine / pyrimidine distributions and biological complexity of the organism are the most important factors which determine base compositional rules and genome complexity. Three main facts are here reported: bacteria with high G + C content have more restrictions on base composition than those with low G + C content; at constant G + C content more complex organisms, ranging from prokaryotes to higher eukaryotes (e.g. human) display an increase of repeats 10-20 nucleotides long, which are also partly responsible for long-range correlations; work selection of length 3 to 10 is stronger in human and in bacteria for two distinct reasons. With respect to previous studies, they have also compared the genomic sequence of the archeon Methanococcus jannaschii with those of bacteria and eukaryotes: it shows sometimes an intermediate statistical behaviour

Tilting Saturn without Tilting Jupiter: Constraints on Giant Planet Migration

Science.gov (United States)

Brasser, R.; Lee, Man Hoi

2015-11-01

The migration and encounter histories of the giant planets in our solar system can be constrained by the obliquities of Jupiter and Saturn. We have performed secular simulations with imposed migration and N-body simulations with planetesimals to study the expected obliquity distribution of migrating planets with initial conditions resembling those of the smooth migration model, the resonant Nice model and two models with five giant planets initially in resonance (one compact and one loose configuration). For smooth migration, the secular spin-orbit resonance mechanism can tilt Saturn’s spin axis to the current obliquity if the product of the migration timescale and the orbital inclinations is sufficiently large (exceeding 30 Myr deg). For the resonant Nice model with imposed migration, it is difficult to reproduce today’s obliquity values, because the compactness of the initial system raises the frequency that tilts Saturn above the spin precession frequency of Jupiter, causing a Jupiter spin-orbit resonance crossing. Migration timescales sufficiently long to tilt Saturn generally suffice to tilt Jupiter more than is observed. The full N-body simulations tell a somewhat different story, with Jupiter generally being tilted as often as Saturn, but on average having a higher obliquity. The main obstacle is the final orbital spacing of the giant planets, coupled with the tail of Neptune’s migration. The resonant Nice case is barely able to simultaneously reproduce the orbital and spin properties of the giant planets, with a probability ˜ 0.15%. The loose five planet model is unable to match all our constraints (probability <0.08%). The compact five planet model has the highest chance of matching the orbital and obliquity constraints simultaneously (probability ˜0.3%).

Unlocking the Constraints of Cyanobacterial Productivity: Acclimations Enabling Ultrafast Growth

Energy Technology Data Exchange (ETDEWEB)

Bernstein, Hans C.; McClure, Ryan S.; Hill, Eric A.; Markillie, Lye Meng; Chrisler, William B.; Romine, Margie F.; McDermott, Jason E.; Posewitz, Matthew C.; Bryant, Donald A.; Konopka, Allan E.; Fredrickson, James K.; Beliaev, Alexander S.

2016-07-26

Harnessing the metabolic potential of photosynthetic microbes for next-generation biotechnology objectives requires detailed scientific understanding of the physiological constraints and regulatory controls affecting carbon partitioning between biomass, metabolite storage pools, and bioproduct synthesis. We dissected the cellular mechanisms underlying the remarkable physiological robustness of the euryhaline unicellular cyanobacteriumSynechococcussp. strain PCC 7002 (Synechococcus7002) and identify key mechanisms that allow cyanobacteria to achieve unprecedented photoautotrophic productivities (~2.5-h doubling time). Ultrafast growth ofSynechococcus7002 was supported by high rates of photosynthetic electron transfer and linked to significantly elevated transcription of precursor biosynthesis and protein translation machinery. Notably, no growth or photosynthesis inhibition signatures were observed under any of the tested experimental conditions. Finally, the ultrafast growth inSynechococcus7002 was also linked to a 300% expansion of average cell volume. We hypothesize that this cellular adaptation is required at high irradiances to support higher cell division rates and reduce deleterious effects, corresponding to high light, through increased carbon and reductant sequestration.

IMPORTANCEEfficient coupling between photosynthesis and productivity is central to the development of biotechnology based on solar energy. Therefore, understanding the factors constraining maximum rates of carbon processing is necessary to identify regulatory mechanisms and devise strategies to overcome productivity constraints. Here, we interrogate the molecular mechanisms that operate at a systems level to allow cyanobacteria to achieve ultrafast growth. This was done by considering growth and photosynthetic kinetics with global transcription patterns. We have delineated

A Mobile Application Recommendation Framework by Exploiting Personal Preference with Constraints

Directory of Open Access Journals (Sweden)

Konglin Zhu

2017-01-01

Full Text Available Explosive mobile applications (Apps are proliferating with the popularity of mobile devices (e.g., smartphones, tablets. These Apps are developed to satisfy different function needs of users. Majority of existing App Stores have difficulty in recommending proper Apps for users. Therefore, it is of significance to recommend mobile Apps for users according to personal preference and various constraints of mobile devices (e.g., battery power. In this paper, we propose a mobile App recommendation framework by incorporating different requirements from users. We exploit modern portfolio theory (MPT to combine the popularity of mobile Apps, personal preference, and mobile device constraints for mobile App recommendation. Based on this framework, we discuss the recommendation approaches by constraints of phone power and limited mobile data plan. Extensive evaluations show that the proposed mobile App recommendation framework can well adapt to power and network data plan constraints. It satisfies the user App preference and mobile device constraints.

Wave functions constructed from an invariant sum over histories satisfy constraints

International Nuclear Information System (INIS)

Halliwell, J.J.; Hartle, J.B.

1991-01-01

Invariance of classical equations of motion under a group parametrized by functions of time implies constraints between canonical coordinates and momenta. In the Dirac formulation of quantum mechanics, invariance is normally imposed by demanding that physical wave functions are annihilated by the operator versions of these constraints. In the sum-over-histories quantum mechanics, however, wave functions are specified, directly, by appropriate functional integrals. It therefore becomes an interesting question whether the wave functions so specified obey the operator constraints of the Dirac theory. In this paper, we show for a wide class of theories, including gauge theories, general relativity, and first-quantized string theories, that wave functions constructed from a sum over histories are, in fact, annihilated by the constraints provided that the sum over histories is constructed in a manner which respects the invariance generated by the constraints. By this we mean a sum over histories defined with an invariant action, invariant measure, and an invariant class of paths summed over

Fundamental constraints on some event data

International Nuclear Information System (INIS)

Watson, I.A.

1986-01-01

A modified version of Searle's theory of the structure of human action has been explained and applied to man machine interaction. The comprehensiveness of the theory has been demonstrated, in particular its explanation of human performance and that its consistency with current theories of human error for which it provides an overall setting. The importance of the mental component of human error is highlighted and the constraints that this puts on the collection analysis and use of human error data. Examples have been given to illustrate and apply the theory ranging from considerations of the tenuousness of the link between safety goals and data to simple valve operations. Two approaches which recognise the constraints shown by the theory have been explained. (orig./DG)

Improving consensus structure by eliminating averaging artifacts

Directory of Open Access Journals (Sweden)

KC Dukka B

2009-03-01

Full Text Available Abstract Background Common structural biology methods (i.e., NMR and molecular dynamics often produce ensembles of molecular structures. Consequently, averaging of 3D coordinates of molecular structures (proteins and RNA is a frequent approach to obtain a consensus structure that is representative of the ensemble. However, when the structures are averaged, artifacts can result in unrealistic local geometries, including unphysical bond lengths and angles. Results Herein, we describe a method to derive representative structures while limiting the number of artifacts. Our approach is based on a Monte Carlo simulation technique that drives a starting structure (an extended or a 'close-by' structure towards the 'averaged structure' using a harmonic pseudo energy function. To assess the performance of the algorithm, we applied our approach to Cα models of 1364 proteins generated by the TASSER structure prediction algorithm. The average RMSD of the refined model from the native structure for the set becomes worse by a mere 0.08 Å compared to the average RMSD of the averaged structures from the native structure (3.28 Å for refined structures and 3.36 A for the averaged structures. However, the percentage of atoms involved in clashes is greatly reduced (from 63% to 1%; in fact, the majority of the refined proteins had zero clashes. Moreover, a small number (38 of refined structures resulted in lower RMSD to the native protein versus the averaged structure. Finally, compared to PULCHRA 1, our approach produces representative structure of similar RMSD quality, but with much fewer clashes. Conclusion The benchmarking results demonstrate that our approach for removing averaging artifacts can be very beneficial for the structural biology community. Furthermore, the same approach can be applied to almost any problem where averaging of 3D coordinates is performed. Namely, structure averaging is also commonly performed in RNA secondary prediction 2, which

Generalizing Backtrack-Free Search: A Framework for Search-Free Constraint Satisfaction

Science.gov (United States)

Jonsson, Ari K.; Frank, Jeremy

2000-01-01

Tractable classes of constraint satisfaction problems are of great importance in artificial intelligence. Identifying and taking advantage of such classes can significantly speed up constraint problem solving. In addition, tractable classes are utilized in applications where strict worst-case performance guarantees are required, such as constraint-based plan execution. In this work, we present a formal framework for search-free (backtrack-free) constraint satisfaction. The framework is based on general procedures, rather than specific propagation techniques, and thus generalizes existing techniques in this area. We also relate search-free problem solving to the notion of decision sets and use the result to provide a constructive criterion that is sufficient to guarantee search-free problem solving.

Architectural constraints in IEC 61508: Do they have the intended effect?

International Nuclear Information System (INIS)

Lundteigen, Mary Ann; Rausand, Marvin

2009-01-01

The standards IEC 61508 and IEC 61511 employ architectural constraints to avoid that quantitative assessments alone are used to determine the hardware layout of safety instrumented systems (SIS). This article discusses the role of the architectural constraints, and particularly the safe failure fraction (SFF) as a design parameter to determine the hardware fault tolerance (HFT) and the redundancy level for SIS. The discussion is based on examples from the offshore oil and gas industry, but should be relevant for all applications of SIS. The article concludes that architectural constraints may be required to compensate for systematic failures, but the architectural constraints should not be determined based on the SFF. The SFF is considered to be an unnecessary concept

Constraint Programming versus Mathematical Programming

DEFF Research Database (Denmark)

Hansen, Jesper

2003-01-01

Constraint Logic Programming (CLP) is a relatively new technique from the 80's with origins in Computer Science and Artificial Intelligence. Lately, much research have been focused on ways of using CLP within the paradigm of Operations Research (OR) and vice versa. The purpose of this paper...

Damage approach: A new method for topology optimization with local stress constraints

DEFF Research Database (Denmark)

Verbart, Alexander; Langelaar, Matthijs; van Keulen, Fred

2016-01-01

In this paper, we propose a new method for topology optimization with local stress constraints. In this method, material in which a stress constraint is violated is considered as damaged. Since damaged material will contribute less to the overall performance of the structure, the optimizer...... will promote a design with a minimal amount of damaged material. We tested the method on several benchmark problems, and the results show that the method is a viable alternative for conventional stress-based approaches based on constraint relaxation followed by constraint aggregation....

An Efficient Constraint Boundary Sampling Method for Sequential RBDO Using Kriging Surrogate Model

Energy Technology Data Exchange (ETDEWEB)

Kim, Jihoon; Jang, Junyong; Kim, Shinyu; Lee, Tae Hee [Hanyang Univ., Seoul (Korea, Republic of); Cho, Sugil; Kim, Hyung Woo; Hong, Sup [Korea Research Institute of Ships and Ocean Engineering, Busan (Korea, Republic of)

2016-06-15

Reliability-based design optimization (RBDO) requires a high computational cost owing to its reliability analysis. A surrogate model is introduced to reduce the computational cost in RBDO. The accuracy of the reliability depends on the accuracy of the surrogate model of constraint boundaries in the surrogated-model-based RBDO. In earlier researches, constraint boundary sampling (CBS) was proposed to approximate accurately the boundaries of constraints by locating sample points on the boundaries of constraints. However, because CBS uses sample points on all constraint boundaries, it creates superfluous sample points. In this paper, efficient constraint boundary sampling (ECBS) is proposed to enhance the efficiency of CBS. ECBS uses the statistical information of a kriging surrogate model to locate sample points on or near the RBDO solution. The efficiency of ECBS is verified by mathematical examples.

New constraints on the running-mass inflation model

International Nuclear Information System (INIS)

Covi, L.; Lyth, D.H.; Melchiorri, A.

2002-10-01

We evaluate new observational constraints on the two-parameter scale-dependent spectral index predicted by the running-mass inflation model by combining the latest cosmic microwave background (CMB) anisotropy measurements with the recent 2dFGRS data on the matter power spectrum, with Lyman α forest data and finally with theoretical constraints on the reionization redshift. We find that present data still allow significant scale-dependence of n, which occurs in a physically reasonable regime of parameter space. (orig.)

A compendium of chameleon constraints

Energy Technology Data Exchange (ETDEWEB)

Burrage, Clare [School of Physics and Astronomy, University of Nottingham, Nottingham, NG7 2RD (United Kingdom); Sakstein, Jeremy, E-mail: clare.burrage@nottingham.ac.uk, E-mail: jeremy.sakstein@port.ac.uk [Center for Particle Cosmology, Department of Physics and Astronomy, University of Pennsylvania, 209 S. 33rd St., Philadelphia, PA 19104 (United States)

2016-11-01

The chameleon model is a scalar field theory with a screening mechanism that explains how a cosmologically relevant light scalar can avoid the constraints of intra-solar-system searches for fifth-forces. The chameleon is a popular dark energy candidate and also arises in f ( R ) theories of gravity. Whilst the chameleon is designed to avoid historical searches for fifth-forces it is not unobservable and much effort has gone into identifying the best observables and experiments to detect it. These results are not always presented for the same models or in the same language, a particular problem when comparing astrophysical and laboratory searches making it difficult to understand what regions of parameter space remain. Here we present combined constraints on the chameleon model from astrophysical and laboratory searches for the first time and identify the remaining windows of parameter space. We discuss the implications for cosmological chameleon searches and future small-scale probes.

A compendium of chameleon constraints

International Nuclear Information System (INIS)

Burrage, Clare; Sakstein, Jeremy

2016-01-01

The chameleon model is a scalar field theory with a screening mechanism that explains how a cosmologically relevant light scalar can avoid the constraints of intra-solar-system searches for fifth-forces. The chameleon is a popular dark energy candidate and also arises in f ( R ) theories of gravity. Whilst the chameleon is designed to avoid historical searches for fifth-forces it is not unobservable and much effort has gone into identifying the best observables and experiments to detect it. These results are not always presented for the same models or in the same language, a particular problem when comparing astrophysical and laboratory searches making it difficult to understand what regions of parameter space remain. Here we present combined constraints on the chameleon model from astrophysical and laboratory searches for the first time and identify the remaining windows of parameter space. We discuss the implications for cosmological chameleon searches and future small-scale probes.

Model-based control strategies for systems with constraints of the program type

Science.gov (United States)

Jarzębowska, Elżbieta

2006-08-01

The paper presents a model-based tracking control strategy for constrained mechanical systems. Constraints we consider can be material and non-material ones referred to as program constraints. The program constraint equations represent tasks put upon system motions and they can be differential equations of orders higher than one or two, and be non-integrable. The tracking control strategy relies upon two dynamic models: a reference model, which is a dynamic model of a system with arbitrary order differential constraints and a dynamic control model. The reference model serves as a motion planner, which generates inputs to the dynamic control model. It is based upon a generalized program motion equations (GPME) method. The method enables to combine material and program constraints and merge them both into the motion equations. Lagrange's equations with multipliers are the peculiar case of the GPME, since they can be applied to systems with constraints of first orders. Our tracking strategy referred to as a model reference program motion tracking control strategy enables tracking of any program motion predefined by the program constraints. It extends the "trajectory tracking" to the "program motion tracking". We also demonstrate that our tracking strategy can be extended to a hybrid program motion/force tracking.

In-Home Delivery of Constraint-Induced Movement Therapy via Virtual Reality Gaming

Directory of Open Access Journals (Sweden)

Alexandra L. Borstad

2018-01-01

Full Text Available Purpose: People with chronic hemiparesis are frequently dissatisfied with the recovery of their hand and arm, yet many lack access to effective treatments. Constraint-induced movement therapy (CI therapy effectively increases arm function and spontaneous use in persons with chronic hemiparesis. The purpose of this study was to determine the feasibility and measure safety and outcomes of an in-home model of delivering CI therapy using a custom, avatar-based virtual reality game. Methods: Seventeen individuals with chronic hemiparesis participated in this pretest/posttest quasi-experimental design study. The 10-day intervention had three components: 1 high-repetition motor practice using virtual reality gaming; 2 constraint of the stronger arm via a padded restraint mitt; and 3 a transfer package to reinforce arm use. Feasibility of the intervention was evaluated through comparison to traditional CI therapy and through participants’ subjective responses. The primary outcome measures were the Wolf Motor Function Test (WMFT and the Motor Activity Log quality of movement scale (MAL-QOM. Results: On average, participants completed 17.2 ± 8 hours and 19,436 repetitions of motor practice. No adverse events were reported. Of 7 feasibility criteria, 4 were met. WMFT rate and MAL-QOM increased, with effect size (Cohen’s d of 1.5 and 1.1, respectively. Conclusions: This model of delivering CI therapy using a custom, avatar-based virtual reality game was feasible, well received, and showed preliminary evidence of being a safe intervention to use in the home for persons with chronic hemiparesis.

Constraint-based solver for the Military unit path finding problem

CSIR Research Space (South Africa)

Leenen, L

2010-04-01

Full Text Available -based approach because it requires flexibility in modelling. The authors formulate the MUPFP as a constraint satisfaction problem and a constraint-based extension of the search algorithm. The concept demonstrator uses a provided map, for example taken from Google...

Natural Constraints to Species Diversification.

Directory of Open Access Journals (Sweden)

Eric Lewitus

2016-08-01

Full Text Available Identifying modes of species diversification is fundamental to our understanding of how biodiversity changes over evolutionary time. Diversification modes are captured in species phylogenies, but characterizing the landscape of diversification has been limited by the analytical tools available for directly comparing phylogenetic trees of groups of organisms. Here, we use a novel, non-parametric approach and 214 family-level phylogenies of vertebrates representing over 500 million years of evolution to identify major diversification modes, to characterize phylogenetic space, and to evaluate the bounds and central tendencies of species diversification. We identify five principal patterns of diversification to which all vertebrate families hold. These patterns, mapped onto multidimensional space, constitute a phylogenetic space with distinct properties. Firstly, phylogenetic space occupies only a portion of all possible tree space, showing family-level phylogenies to be constrained to a limited range of diversification patterns. Secondly, the geometry of phylogenetic space is delimited by quantifiable trade-offs in tree size and the heterogeneity and stem-to-tip distribution of branching events. These trade-offs are indicative of the instability of certain diversification patterns and effectively bound speciation rates (for successful clades within upper and lower limits. Finally, both the constrained range and geometry of phylogenetic space are established by the differential effects of macroevolutionary processes on patterns of diversification. Given these properties, we show that the average path through phylogenetic space over evolutionary time traverses several diversification stages, each of which is defined by a different principal pattern of diversification and directed by a different macroevolutionary process. The identification of universal patterns and natural constraints to diversification provides a foundation for understanding the

Natural Constraints to Species Diversification

Science.gov (United States)

Lewitus, Eric; Morlon, Hélène

2016-01-01

Identifying modes of species diversification is fundamental to our understanding of how biodiversity changes over evolutionary time. Diversification modes are captured in species phylogenies, but characterizing the landscape of diversification has been limited by the analytical tools available for directly comparing phylogenetic trees of groups of organisms. Here, we use a novel, non-parametric approach and 214 family-level phylogenies of vertebrates representing over 500 million years of evolution to identify major diversification modes, to characterize phylogenetic space, and to evaluate the bounds and central tendencies of species diversification. We identify five principal patterns of diversification to which all vertebrate families hold. These patterns, mapped onto multidimensional space, constitute a phylogenetic space with distinct properties. Firstly, phylogenetic space occupies only a portion of all possible tree space, showing family-level phylogenies to be constrained to a limited range of diversification patterns. Secondly, the geometry of phylogenetic space is delimited by quantifiable trade-offs in tree size and the heterogeneity and stem-to-tip distribution of branching events. These trade-offs are indicative of the instability of certain diversification patterns and effectively bound speciation rates (for successful clades) within upper and lower limits. Finally, both the constrained range and geometry of phylogenetic space are established by the differential effects of macroevolutionary processes on patterns of diversification. Given these properties, we show that the average path through phylogenetic space over evolutionary time traverses several diversification stages, each of which is defined by a different principal pattern of diversification and directed by a different macroevolutionary process. The identification of universal patterns and natural constraints to diversification provides a foundation for understanding the deep-time evolution of