Xu, Mengjie; Chen, Guangming; Zhang, Cunhai; Zhang, Shaozhi
2017-01-01
The concentration of maximally freeze-concentrated solutions [Formula: see text] and the corresponding glass transition temperature [Formula: see text] and ante-melting temperature [Formula: see text] of lyoprotectant solutions, are critical parameters for developing lyophilization process. Usually, the lyoprotectant solutions are multicomponent solutions composed of electrolytes, sugars, proteins, polymers, and other chemicals. In this article, the Wg(') values of several multicomponent solutions including trehalose/NaCl, bovine serum albumin/NaCl, and hydroxyethyl starch/NaCl with water were determined by differential scanning calorimetry. A linear relationship between the unfrozen water fraction Wun and the initial solute concentrations Wi was found: Wun = ∑(ai·Wi), which suggested that in the multicomponent solutions each solute could hydrate a certain amount of water ai (g water/g solute) that could not be frozen. The hypothesis was compared with more literature data. For the same solute in different solutions, variation in the fitted coefficient ai is noticed and discussed. If a "universal" value ai for each solute is adopted, both [Formula: see text] and [Formula: see text] for a multicomponent solution could be predicted if Couchman-Karasz equation is adopted for calculating glass transition temperature at the same time. The prediction discrepancies for [Formula: see text] with experimental data were less than 2°C. The finding is discussed about its molecular basis and applicability. Copyright © 2016 American Pharmacists Association®. Published by Elsevier Inc. All rights reserved.
Pansare, Swapnil K; Patel, Sajal Manubhai
2016-08-01
Glass transition temperature is a unique thermal characteristic of amorphous systems and is associated with changes in physical properties such as heat capacity, viscosity, electrical resistance, and molecular mobility. Glass transition temperature for amorphous solids is referred as (T g), whereas for maximally freeze concentrated solution, the notation is (T g'). This article is focused on the factors affecting determination of T g' for application to lyophilization process design and frozen storage stability. Also, this review provides a perspective on use of various types of solutes in protein formulation and their effect on T g'. Although various analytical techniques are used for determination of T g' based on the changes in physical properties associated with glass transition, the differential scanning calorimetry (DSC) is the most commonly used technique. In this article, an overview of DSC technique is provided along with brief discussion on the alternate analytical techniques for T g' determination. Additionally, challenges associated with T g' determination, using DSC for protein formulations, are discussed. The purpose of this review is to provide a practical industry perspective on determination of T g' for protein formulations as it relates to design and development of lyophilization process and/or for frozen storage; however, a comprehensive review of glass transition temperature (T g, T g'), in general, is outside the scope of this work.
Yamazaki, Y.; Shinozaki, K. [Fujisawa Pharmaceutical Co. Ltd., Osaka (Japan); Hirata, Y. [Osaka University, Osaka (Japan)
1997-07-10
The mechanism of solute incorporation into an ice-layer in freeze concentration with ice-lining was studied by changing the impeller speed N and the difference between the brine temperature and the freezing point of the feed solution {Delta}T in 10 kg/m{sup 3} CCNa solution. The effect of N on the apparent partition coefficient of the solute K, is more serious than that of {Delta}T. The growth rate of the ice layer is 10{sup -7} - 10{sup -6}m/s under the condition of {Delta}T=2.8 - 7.9degC and N = 20-400 min{sup -1}. The growth rate had a little effect on solute incorporation into the ice-layer. K values depended on the surface condition of the ice layer, which is effected by the mixing speed of the impeller. The ice layer formed at low mixing speed has a complex rough shape, and has much solute because of adhesion to a large surface area. Therefore, it is recommended that freeze concentration is performed by making an ice layer with smooth surface at high mixing speed. 9 refs., 6 figs.
Freeze concentration of lime juice
Ampawan Tansakul
2008-11-01
Full Text Available The main objective of this research was to study the effects of processing conditions, i.e. cooling medium temperature (-6, -12 and -18C and scraper blade rotational speed (50, 100 and 150 rpm on the freeze concentration of lime juice. The initial soluble solid content of lime juice was 7.6 Brix. Results showed that soluble solid content of lime juice increased as cooling medium temperature decreased while scraper blade rotational speed increased. It was also found that the processing condition with -18˚C cooling medium temperature and 150 rpm rotational speed of the scraper blade was the best among all studied conditions, although the loss of the soluble solids with ice crystals during ice separation was relatively high at 35%.
P. Orellana-Palma
2017-01-01
Full Text Available Freeze concentration of liquid foods produces high-quality concentrates while retaining the heat-labile compounds found in fresh samples. Centrifugal freeze concentration is a cryoconcentration method assisted by an external force, centrifugation, to enhance the separation of concentrate from the ice. When applying centrifugal freeze concentration to orange juice, after the third cryoconcentration cycle, the ascorbic acid content in the concentrate showed retention close to 70% of the initial value. After the third cycle, the solutes in the concentrate increased 4 times the initial value of the fresh sample with 70% efficiency. The color evaluation showed that the final concentrated fraction was darker than the fresh juice. The centrifugal freeze concentration in orange juice was effective for obtaining a high-quality concentrate with a higher concentration of solids and ascorbic acid retention.
Freeze concentration of dairy products Phase 2. Final report
Best, D.E.; Vasavada, K.C.
1993-09-01
An efficient, electrically driven freeze concentration system offers potential for substantially increasing electricity demand while providing the mature dairy industry with new products for domestic and export markets together with enhanced production efficiencies. Consumer tests indicate that dairy products manufactured from freeze-concentrated ingredients are either preferred or considered equivalent in quality to fresh milk-based products. Economic analyses indicate that this technology should be competitive with thermal evaporation processes on a commercial basis.
DNA solution of the maximal clique problem.
Ouyang, Q; Kaplan, P D; Liu, S; Libchaber, A
1997-10-17
The maximal clique problem has been solved by means of molecular biology techniques. A pool of DNA molecules corresponding to the total ensemble of six-vertex cliques was built, followed by a series of selection processes. The algorithm is highly parallel and has satisfactory fidelity. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.
Using magnetic nanoparticles to probe protein damage in ferritin caused by freeze concentration
E. F. Chagas
2015-11-01
Full Text Available We demonstrate a method for monitoring the damage caused to a protein during freeze-thawing in the presence of glycerol, a cryo-protectant. For this work we synthesized magnetite nanoparticles doped with 2.5% cobalt inside the protein ferritin (CMF, dissolved them in different concentration glycerol solutions and measured their magnetization after freezing in a high applied field (5 T. As the temperature was raised, a step-like decrease in the sample magnetization was observed, corresponding to the onset of Brownian relaxation as the viscosity of the freeze-concentrated glycerol solution decreased. The position of the step reveals changes to the protein hydrodynamic radius that we attribute to protein unfolding, while its height depends on how much protein is trapped by ice during freeze concentration. Changes to the protein hydrodynamic radius are confirmed by dynamic light scattering (DLS measurements, but unlike DLS, the magnetic measurements can provide hydrodynamic data while the solution remains mainly frozen.
A New Freeze Concentration Process for Minimum Effluent Process in Bleached Pulp
Qian, Ru-Ying; Botsaris, Gregory D.
2001-03-06
This project researches freeze concentration as a primary volume reduction technology for bleaching plant effluents from paper-pulp mills before they are treated by expensive technologies, such as incineration, for the destruction of the adsorbable organic halogens. Previous laboratory studies show that freeze concentration has a greater than 99.5% purification efficiency for volatile, semivolatile, and nonprocess elements, or any other solute, thus producing pure ice that can be reused in the mill as water. The first section evaluates the anticipated regulatory and public pressures associated with implementing the technology; the remaining sections deal with the experimental results from a scaled-up freeze concentration process in a 100-liter pilot-plant at Tufts University. The results of laboratory scale experiments confirmed that the freeze concentration technology could be an efficient volume reduction technology for the above elements and for removing adsorbable organic hologens and or nonprocess elements from recycled water. They also provide the necessary data for designing and operating a larger pilot plant, and identify the technical problems encountered in the scale-up and the way they could be addressed in the larger scale plants. This project was originally planned to include the operation of a large pilot plant in the facilities of Swenson Process Equipment Inc., and a field test at a pulp mill, but the paper company withdrew its financial support for the field test. In place of a final economic evaluation after the field test, a preliminary evaluation based on the small pilot plant data predicts an economically reasonable freeze concentration process in the case of reduction of the bleaching-effluent flow to less than 5 m3/kkg pulp, a target anticipated in the near future.
A New Freeze Concentration Process for Minimum Effluent Process in Bleached Pulp
Qian, Ru-Ying; Botsaris, Gregory D.
2001-03-06
This project researches freeze concentration as a primary volume reduction technology for bleaching plant effluents from paper-pulp mills before they are treated by expensive technologies, such as incineration, for the destruction of the adsorbable organic halogens. Previous laboratory studies show that freeze concentration has a greater than 99.5% purification efficiency for volatile, semivolatile, and nonprocess elements, or any other solute, thus producing pure ice that can be reused in the mill as water. The first section evaluates the anticipated regulatory and public pressures associated with implementing the technology; the remaining sections deal with the experimental results from a scaled-up freeze concentration process in a 100-liter pilot-plant at Tufts University. The results of laboratory scale experiments confirmed that the freeze concentration technology could be an efficient volume reduction technology for the above elements and for removing adsorbable organic hologens and or nonprocess elements from recycled water. They also provide the necessary data for designing and operating a larger pilot plant, and identify the technical problems encountered in the scale-up and the way they could be addressed in the larger scale plants. This project was originally planned to include the operation of a large pilot plant in the facilities of Swenson Process Equipment Inc., and a field test at a pulp mill, but the paper company withdrew its financial support for the field test. In place of a final economic evaluation after the field test, a preliminary evaluation based on the small pilot plant data predicts an economically reasonable freeze concentration process in the case of reduction of the bleaching-effluent flow to less than 5 m3/kkg pulp, a target anticipated in the near future.
Gelatinization and freeze-concentration effects on recrystallization in corn and potato starch gels.
Ronda, Felicidad; Roos, Yrjö H
2008-04-07
Freeze-concentration of starch gels was controlled by temperature and gelatinization with glucose and lactose. The aim of the study was to evaluate the effects of freezing temperature and gel composition on starch recrystallization behaviour of corn and potato starch gels (water content 70%, w/w) in water or glucose or lactose (10%, w/w) solutions. Starch gels were obtained by heating in differential scanning calorimetry (DSC). Samples of starch gels were frozen at -10 degrees C, -20 degrees C and -30 degrees C for 24h and, after thawing, stored at +2 degrees C for 0, 1, 2, 4 and 8 days. The extent of starch recrystallization was taken from the enthalpy of melting of the recrystallized starch by DSC. Freezing temperatures, glucose, lactose and the origin of the starch affected the recrystallization behaviour greatly. The recrystallization of amorphous starch during storage was enhanced by freeze-concentration of gels at temperatures above T'(m). Molecular mobility was enhanced by unfrozen water and consequently molecular rearrangements for nucleation could take place. Further storage at a higher temperature enhanced the growth and the maturation of crystals. In particular, glucose decreased the T'(m) of the gels and consequently lower freezing temperatures were needed to reduce enhanced recrystallization during storage. Freeze-concentration temperatures also showed a significant effect on the size and the perfection of crystals formed in starch recrystallization.
Ulrich Roessl
2015-06-01
Full Text Available To examine effects of varied freezing conditions on the development of spatial heterogeneity in the frozen protein solution, macroscopic freeze concentration and micro-segregation of bovine serum albumin (BSA were investigated in a temperature-controlled 200-ml freeze container. Freezing to −40 °C promoted formation of protein concentration gradients (69–114 μg ml−1 in frozen samples taken from 12 different freezer positions, whereby slow freezing in 4 h or longer facilitated the evolution of strong spatial heterogeneities and caused local concentration increases by 1.15-fold relative to the initial protein concentration (100 μg ml−1. To visualize protein micro-segregation during phase separation, BSA was conjugated with fluorescein isothiocyanate and confocal laser scanning fluorescence microscopy was used to localize and size the freeze-concentrated protein regions. Slow freezing resulted in distinctly fewer and larger protein domains in the frozen bulk than fast freezing. Surface stress on the protein during freezing would therefore be minimized at low cooling rates; microscopic freeze concentration would however be highest under these conditions, potentially favoring protein aggregation.
Factors affecting ice crystal purity during freeze concentration process for urine treatment
无
2007-01-01
Freeze concentration has great potential in treating wastewaters containing soluble pollutions. It is important for freeze concentration process to produce ice crystals with large size and high purity. In this work raw urines of 4660-7914 mg/L in COD,512.71-872.41 mg/L in NH3-N and 22600-28800μs/cm in e lectric conductivity were studied. Urines were frozen by a digital refrigerated circulator bath. Ice crystals were purified by ice-water steep and vacuum filtration. The COD,NH3-N,and electric conductivity levels of the melted ices were measured to reflect ice crystal purity. Effects of coolant temperature, ice crystal shape, initial solution temperature, solution concentration, ice seeding, re-crystallization process and crystallization time on ice crystal purity were analyzed. The results show that an appropriate coolant temperature, suspended ice crystals,an initial solution temperature of about 6 C, introduction of seed ice, addition of re-crystallization process. And crystallization time of less than 30 min are in favor of producing ice crystals with hith purity.Under such conditions, more than 99 percent of inorganic salts, COD and NH3-N sources in raw urine could be removed.
A new solution for maximal clique problem based sticker model.
Darehmiraki, Majid
2009-02-01
In this paper, we use stickers to construct a solution space of DNA for the maximal clique problem (MCP). Simultaneously, we also apply the DNA operation in the sticker-based model to develop a DNA algorithm. The results of the proposed algorithm show that the MCP is resolved with biological operations in the sticker-based model for the solution space of the sticker. Moreover, this work presents clear evidence of the ability of DNA computing to solve the NP-complete problem. The potential of DNA computing for the MCP is promising given the operational time complexity of O(nxk).
Influence Maximization in Social Networks: Towards an Optimal Algorithmic Solution
Borgs, Christian; Chayes, Jennifer; Lucier, Brendan
2012-01-01
Diffusion is a fundamental graph process, underpinning such phenomena as epidemic disease contagion and the spread of innovation by word-of-mouth. We address the algorithmic problem of finding a set of k initial seed nodes in a network so that the expected size of the resulting cascade is maximized, under the standard independent cascade model of network diffusion. Our main result is an algorithm for the influence maximization problem that obtains the near-optimal approximation factor of (1 - 1/e - epsilon), for any epsilon > 0, in time O((m+n)log(n) / epsilon^3) where n and m are the number of vertices and edges in the network. Our algorithm is nearly runtime-optimal (up to a logarithmic factor) as we establish a lower bound of Omega(m+n) on the runtime required to obtain a constant approximation. Our method also allows a provable tradeoff between solution quality and runtime: we obtain an O(1/beta)-approximation in time O(n log^3(n) * a(G) / beta) for any beta > 1, where a(G) denotes the arboricity of the d...
Maximizing ammonium nitrogen removal from solution using different zeolites.
Penn, Chad J; Warren, Jason G; Smith, Savannah
2010-01-01
Zeolite minerals are ideal for removing ammonium nitrogen (NH4(+)-N) from animal wastes, leachates, and industrial effluents. The objectives of this study were to compare NH4+ removal and kinetics among several commercially available zeolites under various conditions and determine if calorimetry could provide information regarding kinetics of NH4+ removal. Ammonium sorption onto potassium (K) saturated zeolites was compared using synthetic vs. natural swine effluent and with either traditional batch-shaken system or a "tea bag" approach in which zeolites were contained in a mesh sack and suspended in a solution of swine effluent. Ammonium sorption was measured at four retention times using a flow-through system, and the resulting heat response was measured using isothermal calorimetry. Ammonium removal was not significantly different in synthetic vs. natural swine effluent. Ammonium removal was lower in batch-stirred compared to batch-shaken systems, suggesting that diffusion between particles was rate-limiting in the former system. Flow-through cells possessing contact times > 100 s displayed greater NH4+ sorption than batch systems, suggesting that maintaining high NH4+ concentration in solution, removal of exchange products, and sufficient reaction time are critical to maximizing NH4+ removal by zeolites. Within 100 s after NH4+ addition, endothermic heat responses indicated that NH4(+)-K+ exchange had peaked; this was followed by significant heat rate reduction for 50 min. This confirmed findings of an initial fast NH4(+)-K+ exchange followed by a slower one and suggests the 100-s period of rapid reaction is an indicator of the minimum flow through retention time required to optimize NH4+ sorption to zeolites used in this study.
Maximal Saddle Solution of a Nonlinear Elliptic Equation Involving the -Laplacian
Huahui Yan; Zhuoran Du
2014-02-01
A saddle solution is called maximal saddle solution if its absolute value is not smaller than those absolute values of any solutions that vanish on the Simons cone $\\mathcal{C} = \\{s = t\\}$ and have the same sign as - . We prove the existence of a maximal saddle solution of the nonlinear elliptic equation involving the -Laplacian, by using the method of monotone iteration, $$-_{p^u}=f(u) \\quad \\text{in} \\quad R^{2m},$$ where $2m≥ p > 2$.
Achieving Maximal Speed of Solution Exchange for Patch Clamp Experiments
Auzmendi, Jerónimo; Fernández Do Porto, Darío; Pallavicini, Carla; Moffatt, Luciano
2012-01-01
Background Resolving the kinetics of agonist binding events separately from the subsequent channel gating processes requires the ability of applying and removing the agonist before channel gating occurs. No reported system has yet achieved pulses shorter than 100 µs, necessary to study nicotinic ACh receptor or AMPA receptor activation. Methodology/Principal Findings Solution exchange systems deliver short agonist pulses by moving a sharp interface between a control and an experimental solution across a channel preparation. We achieved shorter pulses by means of an exchange system that combines a faster flow velocity, narrower partition between the two streams, and increased velocity and bandwidth of the movement of the interface. The measured response of the entire system was fed back to optimize the voltage signal applied to the piezoelectric actuator overcoming the spurious oscillations arising from the mechanical resonances when a high bandwidth driving function was applied. Optimization was accomplished by analyzing the transfer function of the solution exchange system. When driven by optimized command pulses the enhanced system provided pulses lasting 26 ± 1 µs and exchanging 93 ± 1% of the solution, as measured in the open tip of a patch pipette. Conclusions/Significance Pulses of this duration open the experimental study of the molecular events that occur between the agonist binding and the opening of the channel. PMID:22879927
Symmetries, Integrals and Solutions of Ordinary Differential Equations of Maximal Symmetry
P G L Leach; R R Warne; N Caister; V Naicker; N Euler
2010-02-01
Second-and third-order scalar ordinary differential equations of maximal symmetry in the traditional sense of point, respectively contact, symmetry are examined for the mappings they produce in solutions and fundamental first integrals. The properties of the `exceptional symmetries’, i.e. those not considered to be generic to scalar equations of maximal symmetry, can be recast into a form which is applicable to all such equations of maximal symmetry. Some properties of these symmetries are demonstrated.
Matchett, Karin
2013-01-01
"Seeking Solutions: Maximizing American Talent by Advancing Women of Color in Academia is the summary of a 2013 conference convened by the Committee on Women in Science, Engineering and Medicine of the National Research...
A Simple General Solution for Maximal Horizontal Range of Projectile Motion
Busic, B
2005-01-01
A convenient change of variables in the problem of maximizing the horizontal range of the projectile motion, with an arbitrary initial vertical position of the projectile, provides a simple, straightforward solution.
Development of a Vacuum Crystallizer for the Freeze Concentration of Industrial Waste Water
Roos, A.C.; Verschuur, R.-J.; Schreurs, B.; Scholz, R.; Jansens, P.J.
2003-01-01
Freeze concentration has proven to be a viable technology for the concentration of hazardous industrial waste waters before incineration. Owing to the relatively high investment cost of the technology, its applicability has been limited until now. This paper investigates the feasibility of a vacuum
MAXIMAL ATTRACTORS OF CLASSICAL SOLUTIONS FOR REACTION DIFFUSION EQUATIONS WITH DISPERSION
Li Yanling; Ma Yicheng
2005-01-01
The paper first deals with the existence of the maximal attractor of classical solution for reaction diffusion equation with dispersion, and gives the sup-norm estimate for the attractor. This estimate is optimal for the attractor under Neumann boundary condition. Next, the same problem is discussed for reaction diffusion system with uniformly contracting rectangle, and it reveals that the maximal attractor of classical solution for such system in the whole space is only necessary to be established in some invariant region.Finally, a few examples of application are given.
All timelike supersymmetric solutions of three-dimensional half-maximal supergravity
Deger, Nihat Sadik; Samtleben, Henning; Sarioglu, Ozgur
2015-01-01
We first classify all supersymmetric solutions of the 3-dimensional half-maximal ungauged supergravity that possess a timelike Killing vector coming from the Killing spinor bilinear by considering their identification under the complexification of the local symmetry of the theory. It is found that only solutions that preserve $16/2^n, 1 \\leq n \\leq 3$ real supersymmetries are allowed. We then classify supersymmetric solutions under the real local symmetry of the theory and we are able to solve the equations of motion for all of them. It is shown that all such solutions can be expressed as a direct sum of solutions of the integrable Liouville and SU(3) Toda systems. This completes the construction of all supersymmetric solutions of the model since the null case has already been solved.
Maximizing Influence in an Ising Network: A Mean-Field Optimal Solution
Lynn, Christopher
2016-01-01
The problem of influence maximization in social networks has typically been studied in the context of contagion models and irreversible processes. In this paper, we consider an alternate model that treats individual opinions as spins in an Ising network at dynamic equilibrium. We formalize the Ising influence maximization (IIM) problem, which has a physical interpretation as the maximization of the magnetization given a budget of external magnetic field. Under the mean-field (MF) approximation, we develop a number of sufficient conditions for when the problem is convex and exactly solvable, and we provide a gradient ascent algorithm that efficiently achieves an $\\epsilon$-approximation to the optimal solution. We show that optimal strategies exhibit a phase transition from focusing influence on high-degree individuals at high interaction strengths to spreading influence among low-degree individuals at low interaction strengths. We also establish a number of novel results about the structure of steady-states i...
Viability of bi-maximal solution of the Zee mass matrix
Brahmachari, B; Brahmachari, Biswajoy; Choubey, Sandhya
2002-01-01
We know $L_e-L_\\mu-L_\\tau$ symmetry gives $m^2_1= m^2_2 >> m^2_3$ pattern in Zee model. $\\Delta m^2_\\odot$ emerges from a small breaking of this symmetry. Because this symmetry is broken very weakly $\\theta_\\odot$ does not deviate much from $\\tan^2 \\theta_\\odot=1$ which is its value in the symmetric limit. This gives a mismatch with LMA solution where mixing is large but not exactly maximal. We confront this property of Zee mass matrix by phenomenologically analyzing recent results from solar and atmospheric neutrino oscillation experiments at various confidence levels. We conclude that LOW type solution is compatible with the Zee mass matrix at 99% confidence level when atmospheric neutrino deficit is explained by maximal $\
Sahadevan, R.; Prakash, P.
2017-01-01
We show how invariant subspace method can be extended to time fractional coupled nonlinear partial differential equations and construct their exact solutions. Effectiveness of the method has been illustrated through time fractional Hunter-Saxton equation, time fractional coupled nonlinear diffusion system, time fractional coupled Boussinesq equation and time fractional Whitman-Broer-Kaup system. Also we explain how maximal dimension of the time fractional coupled nonlinear partial differential equations can be estimated.
Z. Denton
2017-01-01
Full Text Available In this work we investigate integro-differential initial value problems with Riemann Liouville fractional derivatives where the forcing function is a sum of an increasing function and a decreasing function. We will apply the method of lower and upper solutions and develop two monotone iterative techniques by constructing two sequences that converge uniformly and monotonically to minimal and maximal solutions. In the first theorem we will construct two natural sequences and in the second theorem we will construct two intertwined sequences. Finally, we illustrate our results with an example.
On the maximal cut of Feynman integrals and the solution of their differential equations
Primo, Amedeo
2016-01-01
The standard procedure for computing scalar multi-loop Feynman integrals consists in reducing them to a basis of so-called master integrals, derive differential equations in the external invariants satisfied by the latter and, finally, try to solve them as a Laurent series in $\\epsilon = (4-d)/2$, where $d$ are the space-time dimensions. The differential equations are, in general, coupled and can be solved using Euler's variation of constants, provided that a set of homogeneous solutions is known. Given an arbitrary differential equation of order higher than one, there exist no general method for finding its homogeneous solutions. In this paper we show that the maximal cut of the integrals under consideration provides one set of homogeneous solutions, simplifying substantially the solution of the differential equations.
On the maximal cut of Feynman integrals and the solution of their differential equations
Amedeo Primo
2017-03-01
Full Text Available The standard procedure for computing scalar multi-loop Feynman integrals consists in reducing them to a basis of so-called master integrals, derive differential equations in the external invariants satisfied by the latter and, finally, try to solve them as a Laurent series in ϵ=(4−d/2, where d are the space–time dimensions. The differential equations are, in general, coupled and can be solved using Euler's variation of constants, provided that a set of homogeneous solutions is known. Given an arbitrary differential equation of order higher than one, there exists no general method for finding its homogeneous solutions. In this paper we show that the maximal cut of the integrals under consideration provides one set of homogeneous solutions, simplifying substantially the solution of the differential equations.
Genetic algorithm in DNA computing:A solution to the maximal clique problem
LI Yuan; FANG Chen; OUYANG Qi
2004-01-01
Genetic algorithm is one of the possible ways to break the limit of brute-force method in DNA computing. Using the idea of Darwinian evolution, we introduce a genetic DNA computing algorithm to solve the maximal clique problem. All the operations in the algorithm are accessible with today's molecular biotechnology. Our computer simulations show that with this new computing algorithm, it is possible to get a solution from a very small initial data pool, avoiding enumerating all candidate solutions. For randomly generated problems, genetic algorithm can give correct solution within a few cycles at high probability. Although the current speed of a DNA computer is slow compared with silicon computers, our simulation indicates that the number of cycles needed in this genetic algorithm is approximately a linear function of the number of vertices in the network. This may make DNA computers more powerfully attacking some hard computational problems.
MAXIMAL SUBSPACES FOR SOLUTIONS OF THE SECOND ORDER ABSTRACT CAUCHY PROBLEM
无
2007-01-01
For a continuous, increasing function ω: R+ → R+\\{0} of finite exponential type, this paper introduces the set Z(A, ω) of all x in a Banach space X for which the second order abstract differential equation (2) has a mild solution such that [ω(t)]-1u(t,x) is uniformly continues on R+, and show that Z(A, ω) is a maximal Banach subspace continuously embedded in X, where A ∈ B(X) is closed. Moreover, A|z(A,ω) generates an O(ω(t))strongly continuous cosine operator function family.
Uamporn Witthayarat
2012-01-01
Full Text Available The aim of this paper is to introduce an iterative algorithm for finding a common solution of the sets (A+M2−1(0 and (B+M1−1(0, where M is a maximal accretive operator in a Banach space and, by using the proposed algorithm, to establish some strong convergence theorems for common solutions of the two sets above in a uniformly convex and 2-uniformly smooth Banach space. The results obtained in this paper extend and improve the corresponding results of Qin et al. 2011 from Hilbert spaces to Banach spaces and Petrot et al. 2011. Moreover, we also apply our results to some applications for solving convex feasibility problems.
Huber, Markus Q; Schwenzer, Kai
2011-01-01
Functional equations like exact renormalization group and Dyson-Schwinger equations have contributed to a better understanding of non-perturbative phenomena in quantum field theories in terms of the underlying Green functions. In Yang-Mills theory especially the Landau gauge has been used, as it is the most accessible gauge for these methods. The growing understanding obtained in this gauge allows to proceed to other gauges in order to obtain more information about the relation of different realizations of the confinement mechanism. In the maximally Abelian gauge first results are very encouraging as a variant of Abelian infrared dominance is found: The Abelian part of the gauge field propagator is enhanced at low momenta and thereby dominates the dynamics in the infrared. Its role is therefore similar to that of the ghost propagator in the Landau gauge, where one denotes the corresponding phenomenon as ghost dominance. Also the ambiguity of two different types of solutions (decoupling and scaling) exists in ...
Carathéodory系统的最大解%Maximal Solutions of Carathéodory Systems
马学敏
2012-01-01
By using the Henstock-Kurzweil integral,the maximal solutions and its properties of continuous and bounded variation solutions for Carathéodory systems are discussed.%利用Henstock-kurzweil积分,讨论了Carathéodory系统的连续有界变差解的最大解及其性质.
Is bi-maximal mixing compatible with the large angle MSW solution of the solar neutrino problem?
1998-01-01
It is shown that the large angle MSW solution of the solar neutrino problem with a bi-maximal neutrino mixing matrix implies an energy-independent suppression of the solar nu_e flux. The present solar neutrino data exclude this solution of the solar neutrino problem at 99.6% CL.
On the paradox of Hawking radiation in a maximally extended Schwarzschild solution
Ellis, George F R
2013-01-01
This paper considers the effect of Hawking radiation on an eternal black hole - that is. a maximally extended Schwarzschild solution. Symmetry considerations that hold independent of the details of the emission mechanism show there is an inconsistency in the claim that such a blackhole evaporates away in a finite time. In essence: because the external domain is static, there is an infinite time available for the process to take place, so whenever the evaporation process is claimed to come to completion, it should have happened earlier. The problem is identified to lie in the claim that the locus of emission of Hawking radiation lies just outside the globally defined event horizon. Rather, the emission domain must be mainly located inside the event horizon, so most of the Hawking radiation ends up at this singularity rather than at infinity and the black hole never evaporates away. This result supports a previous claim [arXiv:1310.4771] that astrophysical black holes do not evaporate.
Jason Kreitler
2014-12-01
Full Text Available Quantitative methods of spatial conservation prioritization have traditionally been applied to issues in conservation biology and reserve design, though their use in other types of natural resource management is growing. The utility maximization problem is one form of a covering problem where multiple criteria can represent the expected social benefits of conservation action. This approach allows flexibility with a problem formulation that is more general than typical reserve design problems, though the solution methods are very similar. However, few studies have addressed optimization in utility maximization problems for conservation planning, and the effect of solution procedure is largely unquantified. Therefore, this study mapped five criteria describing elements of multifunctional agriculture to determine a hypothetical conservation resource allocation plan for agricultural land conservation in the Central Valley of CA, USA. We compared solution procedures within the utility maximization framework to determine the difference between an open source integer programming approach and a greedy heuristic, and find gains from optimization of up to 12%. We also model land availability for conservation action as a stochastic process and determine the decline in total utility compared to the globally optimal set using both solution algorithms. Our results are comparable to other studies illustrating the benefits of optimization for different conservation planning problems, and highlight the importance of maximizing the effectiveness of limited funding for conservation and natural resource management.
Kreitler, Jason; Stoms, David M; Davis, Frank W
2014-01-01
Quantitative methods of spatial conservation prioritization have traditionally been applied to issues in conservation biology and reserve design, though their use in other types of natural resource management is growing. The utility maximization problem is one form of a covering problem where multiple criteria can represent the expected social benefits of conservation action. This approach allows flexibility with a problem formulation that is more general than typical reserve design problems, though the solution methods are very similar. However, few studies have addressed optimization in utility maximization problems for conservation planning, and the effect of solution procedure is largely unquantified. Therefore, this study mapped five criteria describing elements of multifunctional agriculture to determine a hypothetical conservation resource allocation plan for agricultural land conservation in the Central Valley of CA, USA. We compared solution procedures within the utility maximization framework to determine the difference between an open source integer programming approach and a greedy heuristic, and find gains from optimization of up to 12%. We also model land availability for conservation action as a stochastic process and determine the decline in total utility compared to the globally optimal set using both solution algorithms. Our results are comparable to other studies illustrating the benefits of optimization for different conservation planning problems, and highlight the importance of maximizing the effectiveness of limited funding for conservation and natural resource management.
Mol, Igor
2014-01-01
In this pedagogical note, the differences between the Schwarzschild and the Hilbert-Droste solutions of Einstein equation are scrutinized through a rigorous mathematical approach, based on the idea of warped product of manifolds. It will be shown that those solutions are indeed different because the topologies of the manifolds corresponding to them are different. After establishing this fact beyond any doubt, the maximal extension of the Hilbert-Droste solution (the Kruskal-Szekeres spacetime) is derived with details and its topology compared with the ones of the Schwazschild and the Hilbert-Droste solution. We also study the problem of the imbedding of the Hilbert-Droste solution in a vector manifold, hopefully clarifying the work of Kasner and Fronsdal on the subject. In an Appendix, we present a rigorous discussion of the Einstein-Rosen Bridge. A comprehensive bibliography of the historical papers involved in our work is given at the end.
Solutions of Maximal Compatible Granules and Approximations in Rough Set Models
Chen Wu,
2015-06-01
Full Text Available Abstract—This paper emphasizes studying on a new method to rough set theory by obtaining granules with maximal compatible classes as primitive ones in which any two objects are mutually compatible, proposes the upper and lower approximation computations to extend rough set models for further building multi-granulation rough set theory in incomplete information systems, discusses the properties and relationships of granules and approximations, designs algorithms to solve maximal compatible classes, the lower and upper approximations. It verifies the correctness of algorithms by an example.
Maximal admissible faces and asymptotic bounds for the normal surface solution space
Burton, Benjamin A
2010-01-01
The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dimensional polytope, where admissibility is a powerful but non-linear and non-convex constraint. The main results of this paper are significant improvements upon the best known asymptotic bounds on the number of admissible vertices, using polytopes in both the standard normal surface coordinate system and the streamlined quadrilateral coordinate system. To achieve these results we examine the layout of admissible points within these polytopes. We show that these points correspond to well-behaved substructures of the face lattice, and we study properties of the corresponding "admissible faces". Key lemmata include upper bounds on the number of maximal admissible faces of each dimension, and a bijection between the maximal admissible faces in the two coordinate systems mentioned above.
A solid solution to a conjecture on the maximal energy of bipartite bicyclic graphs
Huo, Bofeng; Li, Xueliang; Shi, Yongtang
2011-01-01
The energy of a simple graph $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let $C_n$ denote the cycle of order $n$ and $P^{6,6}_n$ the graph obtained from joining two cycles $C_6$ by a path $P_{n-12}$ with its two leaves. Let $\\mathscr{B}_n$ denote the class of all bipartite bicyclic graphs but not the graph $R_{a,b}$, which is obtained from joining two cycles $C_a$ and $C_b$ ($a, b\\geq 10$ and $a \\equiv b\\equiv 2\\, (\\,\\textmd{mod}\\, 4)$) by an edge. In [I. Gutman, D. Vidovi\\'{c}, Quest for molecular graphs with maximal energy: a computer experiment, {\\it J. Chem. Inf. Sci.} {\\bf41}(2001), 1002--1005], Gutman and Vidovi\\'{c} conjectured that the bicyclic graph with maximal energy is $P^{6,6}_n$, for $n=14$ and $n\\geq 16$. In [X. Li, J. Zhang, On bicyclic graphs with maximal energy, {\\it Linear Algebra Appl.} {\\bf427}(2007), 87--98], Li and Zhang showed that the conjecture is true for graphs in the class $\\mathscr{B}_n$. However, they could not...
Zhong Wan
2013-01-01
Full Text Available In accord with the practical engineering design conditions, a nonlinear programming model is constructed for maximizing the fatigue life of V-belt drive in which some polymorphic uncertainties are incorporated. For a given satisfaction level and a confidence level, an equivalent formulation of this uncertain optimization model is obtained where only interval parameters are involved. Based on the concepts of maximal and minimal range inequalities for describing interval inequality, the interval parameter model is decomposed into two standard nonlinear programming problems, and an algorithm, called two-step based sampling algorithm, is developed to find an interval optimal solution for the original problem. Case study is employed to demonstrate the validity and practicability of the constructed model and the algorithm.
Caciotta, G
2016-01-01
The main goal of this work consists in showing that the analytic solutions for a class of characteristic problems for the Einstein vacuum equations have an existence region larger than the one provided by the Cauchy-Kowalevski theorem, due to the intrinsic hyperbolicity of the Einstein equations. The magnitude of this region depends only on suitable $H_s$ Sobolev norms of the initial data for a fixed $s\\leq 7$ and if the initial data are sufficiently small the analytic solution is global. In a previous paper, hereafter "I", we have described a geometric way of writing the vacuum Einstein equations for the characteristic problems we are considering and a local solution in a suitable "double null cone gauge" characterized by the use of a double null cone foliation of the spacetime.
Maximizing adhesion of auxin solutions to stem cuttings using sodium cellulose glycolate
Auxin solutions prepared with sodium cellulose glycolate (SCG; a thickening agent, also known as sodium carboxymethylcellulose) and applied to stem cuttings using a basal quick-dip extend the duration of exposure of cuttings to the auxin and have previously been shown to increase root number and/or ...
Kovalevsky D. V.
2014-12-01
Full Text Available The Structural Dynamic Economic Model SDEM-2 is essentially a model of a closed economy growing under conditions of conflict of interests of two powerful aggregate actors: entrepreneurs and wage-earners. We study the economic growth within SDEM-2 both in system dynamic and optimization model setups. For the system dynamic model setup, four alternative control strategies of entrepreneurs are considered in detail: the “altruistic” control strategy, the “moderate output growth” control strategy, the “here and now” control strategy, and the “moderate dividend growth” control strategy. In the optimization setup the Pontryagin's maximum principle is applied to SDEM-2 to solve the linear and logarithmic utility maximization problems. The degree of sub-optimality of system dynamic solutions is evaluated
陈锦权; 李彦杰; 孙沈鲁; 方婷
2014-01-01
solid-phase micro-extraction (SPME), the differences of the tea soup extracted by pulse electric field (PEF) and hot water on the aroma composition were investigated respectively, the same analysis was done for concentrated tea soup by freeze concentration and vacuum evaporation,. The optimal conditions of PEF extraction were given as; pulse width of 2.5 µs, electric field strength of 37 kV/cm, pulse number of 10, pulse frequency of 2 700 Hz and solid-liquid ratio of 1:30. The results of freeze concentration were best under the following conditions:initial solution temperature at 4℃, scraper speed at 150 r/min and coolant temperature at -15~-18℃. Compared with the hot water extraction, extraction of tea polyphenols by PEF was almost the same. The method of GC-MS with SPME was used to analyze aroma compounds of tea soup extracted by PEF and hot water respectively. The results indicated that PEF extraction technology could effectively keep the main aroma of tea soup. It was better than hot water extraction. The results of SPME /GC-MS indicated that freeze concentration technology could effectively keep most of aroma compounds of tea soup. It was better than vacuum evaporation. Both methods have potential applications in industrial production.
2014-01-01
© 2014 Kreitler et al. Quantitative methods of spatial conservation prioritization have traditionally been applied to issues in conservation biology and reserve design, though their use in other types of natural resource management is growing. The utility maximization problemis one formof a covering problemwheremultiple criteria can represent the expected social benefits of conservation action. This approach allows flexibility with a problem formulation that is more general than typical reser...
Ebrahimi Zade, Amir; Sadegheih, Ahmad; Lotfi, Mohammad Mehdi
2014-07-01
Hubs are centers for collection, rearrangement, and redistribution of commodities in transportation networks. In this paper, non-linear multi-objective formulations for single and multiple allocation hub maximal covering problems as well as the linearized versions are proposed. The formulations substantially mitigate complexity of the existing models due to the fewer number of constraints and variables. Also, uncertain shipments are studied in the context of hub maximal covering problems. In many real-world applications, any link on the path from origin to destination may fail to work due to disruption. Therefore, in the proposed bi-objective model, maximizing safety of the weakest path in the network is considered as the second objective together with the traditional maximum coverage goal. Furthermore, to solve the bi-objective model, a modified version of NSGA-II with a new dynamic immigration operator is developed in which the accurate number of immigrants depends on the results of the other two common NSGA-II operators, i.e. mutation and crossover. Besides validating proposed models, computational results confirm a better performance of modified NSGA-II versus traditional one.
Brendle, Joerg
2016-01-01
We show that, consistently, there can be maximal subtrees of P (omega) and P (omega) / fin of arbitrary regular uncountable size below the size of the continuum. We also show that there are no maximal subtrees of P (omega) / fin with countable levels. Our results answer several questions of Campero, Cancino, Hrusak, and Miranda.
Cappa, G.; Ferrari, S.
2016-12-01
Let X be a separable Banach space endowed with a non-degenerate centered Gaussian measure μ. The associated Cameron-Martin space is denoted by H. Let ν =e-U μ, where U : X → R is a sufficiently regular convex and continuous function. In this paper we are interested in the W 2 , 2 regularity of the weak solutions of elliptic equations of the type
Dubart, Philippe; Hautot, Felix [AREVA Group, 1 route de la Noue, Gif sur Yvette (France); Morichi, Massimo; Abou-Khalil, Roger [AREVA Group, Tour AREVA-1, place Jean Millier, Paris (France)
2015-07-01
Good management of dismantling and decontamination (D and D) operations and activities is requiring safety, time saving and perfect radiological knowledge of the contaminated environment as well as optimization for personnel dose and minimization of waste volume. In the same time, Fukushima accident has imposed a stretch to the nuclear measurement operational approach requiring in such emergency situation: fast deployment and intervention, quick analysis and fast scenario definition. AREVA, as return of experience from his activities carried out at Fukushima and D and D sites has developed a novel multi-sensor solution as part of his D and D research, approach and method, a system with real-time 3D photo-realistic spatial radiation distribution cartography of contaminated premises. The system may be hand-held or mounted on a mobile device (robot, drone, e.g). In this paper, we will present our current development based on a SLAM technology (Simultaneous Localization And Mapping) and integrated sensors and detectors allowing simultaneous topographic and radiological (dose rate and/or spectroscopy) data acquisitions. This enabling technology permits 3D gamma activity cartography in real-time. (authors)
K B Athreya
2009-09-01
It is shown that (i) every probability density is the unique maximizer of relative entropy in an appropriate class and (ii) in the class of all pdf that satisfy $\\int fh_id_=_i$ for $i=1,2,\\ldots,\\ldots k$ the maximizer of entropy is an $f_0$ that is proportional to $\\exp(\\sum c_i h_i)$ for some choice of $c_i$. An extension of this to a continuum of constraints and many examples are presented.
何松; 胡卓炎; 孙福在; 赵廷昌; 钟士清
2001-01-01
介绍了冰核细菌促进成冰的机制，并结合国外有关报道和我们的研究结果，论述了冰核细菌在食品冷冻浓缩中导致冰晶形成的结构、冷冻效率、应用前的预处理及食用级冰核细菌在果汁中的应用情况，最后展望了未来的研究方向。%Freeze concentration of foods using ice-nucleation active bacteria was reviewed, including the ice formation mechanism, freezing texture, freezing efficiency, preliminary treatments of this bacterium before it was applied, and applications of food-gradeice-nucleation active bacteria in freeze concentration of fruit juice.
Application of Ice-nucleation Active Bacteria in Freeze Concentration of Foods%冰核活性细菌及其在食品冻结浓缩中的应用
胡卓炎; 何松; 孙福在; 赵廷昌; 钟士清
2001-01-01
Freeze concentration of foods using ice-nucleation active bacteria was reviewed. It indicated that bacterial ice nuclei can not only increase the freezing point, but also shorten the freezing time of the treated foods. Furthermore, larger ice crystals can be made during the freezing. It suggested that this bacteria should be applied to freeze concentration of foods to obtain a concentrated product for efficient freezing and retaining its original flavor. This paper reviewed the ice-made mechanism, preliminary treatments, freezing efficiency, freezing texture and applications of ice-nucleation active bacteria in freeze concentration of foods. Finally, it looked ahead the prospects of this technique in the future.%介绍冰核细菌的成冰机制、预处理工艺及在食品中的冷冻效率、冰晶形成结构与应用方面的最新进展，最后展望未来的发展趋势。
Izutsu, Ken-ichi; Rimando, Annie; Aoyagi, Nobuo; Kojima, Shigeo
2003-06-01
The effect of sodium tetraborate (Na(2)B(4)O(7), borax) on the thermal property of frozen aqueous sugar and polyol solutions was studied through thermal analysis. Addition of borax raised the thermal transition temperature (glass transition temperature of maximally freeze-concentrated solutes; T(g)') of frozen sucrose solutions depending on the borax/sucrose concentration ratios. Changes in the T(g)' of frozen mono- and disaccharide solutions suggested various forms of complexes, including those of a borate ion and two saccharide molecules. Borax exerted the maximum effect to raise the oligosaccharide and dextran T(g)'s at borax/saccharide molar ratios of approximately 1-2 (maltose and maltooligosaccharides), 2 (dextran 1060), 5 (dextran 4900), and 10 (dextran 10200). Further addition of borax lowered T(g)'s of the saccharide solutions. Borax also raised T(g) and T(g)' temperatures of frozen aqueous glycerol solutions. The decreased solute mobility in frozen solutions by the borate-polyol complexes suggested higher collapse temperature in the freeze-drying process and improved stability of biological systems in frozen solutions.
Zak, Michail
2008-01-01
A report discusses an algorithm for a new kind of dynamics based on a quantum- classical hybrid-quantum-inspired maximizer. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen 'computational' potential. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables, using classical methods. Such optimal combination of characteristics is a perfect match for quantum-inspired computing. As an application, an algorithm for global maximum of an arbitrary integrable function is proposed. The idea of the proposed algorithm is very simple: based upon the Quantum-inspired Maximizer (QIM), introduce a positive function to be maximized as the probability density to which the solution is attracted. Then the larger value of this function will have the higher probability to appear. Special attention is paid to simulation of integer programming and NP-complete problems. It is demonstrated that the problem of global maximum of an integrable function can be found in polynomial time by using the proposed quantum- classical hybrid. The result is extended to a constrained maximum with applications to integer programming and TSP (Traveling Salesman Problem).
Studies on Freeze Concentrated Loquat Juice Treated by Pulsed Electric Field%高压脉冲电场处理冷冻浓缩枇杷汁的研究
方婷; 钟海荣; 陈锦权
2011-01-01
The conductivity of liquid foods will directly influence the strength of Pulsed Electric Field （PEF）. The conductivity of liquid foods treated by freeze concentration will decrease which will benefit for sterilization effect of PEF. In this article, freeze concentrated Loquat juice was treated by PEF and the effects of different conditions on liquid foods conductivity were investigated. The results showed that in pretreatments homogeneity and degassing could improve the stabilization and reliability of PEF instrument. After pre - cooling, the conductivity of different concentration Loquat juice was decreasing with the temperature fell down. The sterilization effect of PEF on freeze concentrated Loquat juice was nearly equal to original Loquat juice was only treated by PEF.%液体食品电导率的高低直接影响高压脉冲电场（Pulsed Electric Field,PEF）的电场强度,冷冻浓缩后的液体食品电导率降低,有利于高压脉冲电场的杀菌效果。本研究将冷冻浓缩后的枇杷汁通过高压脉冲电场处理,并探讨不同条件对冷冻浓缩枇杷汁电导率的影响,结果表明：在前处理时,均质、脱气可有效地提高高压脉冲杀菌过程中仪器的稳定性和可靠性;经预冷后的不同浓度枇杷汁的电导率随着温度的降低而逐渐减小,PEF处理冷冻浓缩后枇杷汁的杀菌效果与仅用PEF处理效果相当。
Maximizing and customer loyalty: Are maximizers less loyal?
Linda Lai
2011-06-01
Full Text Available Despite their efforts to choose the best of all available solutions, maximizers seem to be more inclined than satisficers to regret their choices and to experience post-decisional dissonance. Maximizers may therefore be expected to change their decisions more frequently and hence exhibit lower customer loyalty to providers of products and services compared to satisficers. Findings from the study reported here (N = 1978 support this prediction. Maximizers reported significantly higher intentions to switch to another service provider (television provider than satisficers. Maximizers' intentions to switch appear to be intensified and mediated by higher proneness to regret, increased desire to discuss relevant choices with others, higher levels of perceived knowledge of alternatives, and higher ego involvement in the end product, compared to satisficers. Opportunities for future research are suggested.
Rasmussen, Peter Have; Jørgensen, Bo; Nielsen, Jette
1997-01-01
The hydration properties of proline are studied by differential scanning calorimetry (DSC) in aqueous solutions during freezing to -60 degrees C and subsequent heating to +20 degrees C. The concentration of proline in the freeze concentrated solution was estimated to approximately 50 wt% (w/w) in...
Khabbazibasmenj, Arash; Vorobyov, Sergiy A; Haardt, Martin
2012-01-01
Sum-rate maximization in two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relaying belongs to the class of difference-of-convex functions (DC) programming problems. DC programming problems occur as well in other signal processing applications and are typically solved using different modifications of the branch-and-bound method. This method, however, does not have any polynomial time complexity guarantees. In this paper, we show that a class of DC programming problems, to which the sum-rate maximization in two-way MIMO relaying belongs, can be solved very efficiently in polynomial time, and develop two algorithms. The objective function of the problem is represented as a product of quadratic ratios and parameterized so that its convex part (versus the concave part) contains only one (or two) optimization variables. One of the algorithms is called POlynomial-Time DC (POTDC) and is based on semi-definite programming (SDP) relaxation, linearization, and an iterative search over a single para...
Profit maximization mitigates competition
Dierker, Egbert; Grodal, Birgit
1996-01-01
We consider oligopolistic markets in which the notion of shareholders' utility is well-defined and compare the Bertrand-Nash equilibria in case of utility maximization with those under the usual profit maximization hypothesis. Our main result states that profit maximization leads to less price...... competition than utility maximization. Since profit maximization tends to raise prices, it may be regarded as beneficial for the owners as a whole. Moreover, if profit maximization is a good proxy for utility maximization, then there is no need for a general equilibrium analysis that takes the distribution...... of profits among consumers fully into account and partial equilibrium analysis suffices...
Maximally incompatible quantum observables
Heinosaari, Teiko, E-mail: teiko.heinosaari@utu.fi [Turku Centre for Quantum Physics, Department of Physics and Astronomy, University of Turku, FI-20014 Turku (Finland); Schultz, Jussi, E-mail: jussi.schultz@gmail.com [Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, I-20133 Milano (Italy); Toigo, Alessandro, E-mail: alessandro.toigo@polimi.it [Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, I-20133 Milano (Italy); Istituto Nazionale di Fisica Nucleare, Sezione di Milano, Via Celoria 16, I-20133 Milano (Italy); Ziman, Mario, E-mail: ziman@savba.sk [RCQI, Institute of Physics, Slovak Academy of Sciences, Dúbravská cesta 9, 84511 Bratislava (Slovakia); Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno (Czech Republic)
2014-05-01
The existence of maximally incompatible quantum observables in the sense of a minimal joint measurability region is investigated. Employing the universal quantum cloning device it is argued that only infinite dimensional quantum systems can accommodate maximal incompatibility. It is then shown that two of the most common pairs of complementary observables (position and momentum; number and phase) are maximally incompatible.
Parker, Andrew M.; Wandi Bruine de Bruin; Baruch Fischhoff
2007-01-01
Our previous research suggests that people reporting a stronger desire to maximize obtain worse life outcomes (Bruine de Bruin et al., 2007). Here, we examine whether this finding may be explained by the decision-making styles of self-reported maximizers. Expanding on Schwartz et al. (2002), we find that self-reported maximizers are more likely to show problematic decision-making styles, as evidenced by self-reports of less behavioral coping, greater dependence on others when making decisions...
Ming Yi WANG; Guo ZHAO
2005-01-01
A right R-module E over a ring R is said to be maximally injective in case for any maximal right ideal m of R, every R-homomorphism f : m → E can be extended to an R-homomorphism f' : R → E. In this paper, we first construct an example to show that maximal injectivity is a proper generalization of injectivity. Then we prove that any right R-module over a left perfect ring R is maximally injective if and only if it is injective. We also give a partial affirmative answer to Faith's conjecture by further investigating the property of maximally injective rings. Finally, we get an approximation to Faith's conjecture, which asserts that every injective right R-module over any left perfect right self-injective ring R is the injective hull of a projective submodule.
Andrew M. Parker
2007-12-01
Full Text Available Our previous research suggests that people reporting a stronger desire to maximize obtain worse life outcomes (Bruine de Bruin et al., 2007. Here, we examine whether this finding may be explained by the decision-making styles of self-reported maximizers. Expanding on Schwartz et al. (2002, we find that self-reported maximizers are more likely to show problematic decision-making styles, as evidenced by self-reports of less behavioral coping, greater dependence on others when making decisions, more avoidance of decision making, and greater tendency to experience regret. Contrary to predictions, self-reported maximizers were more likely to report spontaneous decision making. However, the relationship between self-reported maximizing and worse life outcomes is largely unaffected by controls for measures of other decision-making styles, decision-making competence, and demographic variables.
Brüstle, Thomas; Pérotin, Matthieu
2012-01-01
Maximal green sequences are particular sequences of quiver mutations which were introduced by Keller in the context of quantum dilogarithm identities and independently by Cecotti-Cordova-Vafa in the context of supersymmetric gauge theory. Our aim is to initiate a systematic study of these sequences from a combinatorial point of view. Interpreting maximal green sequences as paths in various natural posets arising in representation theory, we prove the finiteness of the number of maximal green sequences for cluster finite quivers, affine quivers and acyclic quivers with at most three vertices. We also give results concerning the possible numbers and lengths of these maximal green sequences. Finally we describe an algorithm for computing maximal green sequences for arbitrary valued quivers which we used to obtain numerous explicit examples that we present.
Constraint Propagation as Information Maximization
Abdallah, A Nait
2012-01-01
Dana Scott used the partial order among partial functions for his mathematical model of recursively defined functions. He interpreted the partial order as one of information content. In this paper we elaborate on Scott's suggestion of regarding computation as a process of information maximization by applying it to the solution of constraint satisfaction problems. Here the method of constraint propagation can be interpreted as decreasing uncertainty about the solution -- that is, as gain in information about the solution. As illustrative example we choose numerical constraint satisfaction problems to be solved by interval constraints. To facilitate this approach to constraint solving we formulate constraint satisfaction problems as formulas in predicate logic. This necessitates extending the usual semantics for predicate logic so that meaning is assigned not only to sentences but also to formulas with free variables.
Maximizing the Range of a Projectile.
Brown, Ronald A.
1992-01-01
Discusses solutions to the problem of maximizing the range of a projectile. Presents three references that solve the problem with and without the use of calculus. Offers a fourth solution suitable for introductory physics courses that relies more on trigonometry and the geometry of the problem. (MDH)
Rudiger Bubner
1998-12-01
Full Text Available Even though the maxims' theory is not at thecenter of Kant's ethics, it is the unavoidable basis of the categoric imperative's formulation. Kant leanson the transmitted representations of modem moral theory. During the last decades, the notion of maxims has deserved more attention, due to the philosophy of language's debates on rules, and due to action theory's interest in this notion. I here by brietly expound my views in these discussions.
Robust utility maximization in a discontinuous filtration
Jeanblanc, Monique; Ngoupeyou, Armand
2012-01-01
We study a problem of utility maximization under model uncertainty with information including jumps. We prove first that the value process of the robust stochastic control problem is described by the solution of a quadratic-exponential backward stochastic differential equation with jumps. Then, we establish a dynamic maximum principle for the optimal control of the maximization problem. The characterization of the optimal model and the optimal control (consumption-investment) is given via a forward-backward system which generalizes the result of Duffie and Skiadas (1994) and El Karoui, Peng and Quenez (2001) in the case of maximization of recursive utilities including model with jumps.
Maria de Hoyos Guajardo, Ph.D. Candidate, M.Sc., B.Eng.
2004-11-01
Full Text Available The theory that is presented below aims to conceptualise how a group of undergraduate students tackle non-routine mathematical problems during a problem-solving course. The aim of the course is to allow students to experience mathematics as a creative process and to reflect on their own experience. During the course, students are required to produce a written ‘rubric’ of their work, i.e., to document their thoughts as they occur as well as their emotionsduring the process. These ‘rubrics’ were used as the main source of data.Students’ problem-solving processes can be explained as a three-stage process that has been called ‘solutioning’. This process is presented in the six sections below. The first three refer to a common area of concern that can be called‘generating knowledge’. In this way, generating knowledge also includes issues related to ‘key ideas’ and ‘gaining understanding’. The third and the fourth sections refer to ‘generating’ and ‘validating a solution’, respectively. Finally, once solutions are generated and validated, students usually try to improve them further before presenting them as final results. Thus, the last section deals with‘improving a solution’. Although not all students go through all of the stages, it may be said that ‘solutioning’ considers students’ main concerns as they tackle non-routine mathematical problems.
Maximally Symmetric Spacetimes emerging from thermodynamic fluctuations
Bravetti, A; Quevedo, H
2015-01-01
In this work we prove that the maximally symmetric vacuum solutions of General Relativity emerge from the geometric structure of statistical mechanics and thermodynamic fluctuation theory. To present our argument, we begin by showing that the pseudo-Riemannian structure of the Thermodynamic Phase Space is a solution to the vacuum Einstein-Gauss-Bonnet theory of gravity with a cosmological constant. Then, we use the geometry of equilibrium thermodynamics to demonstrate that the maximally symmetric vacuum solutions of Einstein's Field Equations -- Minkowski, de-Sitter and Anti-de-Sitter spacetimes -- correspond to thermodynamic fluctuations. Moreover, we argue that these might be the only possible solutions that can be derived in this manner. Thus, the results presented here are the first concrete examples of spacetimes effectively emerging from the thermodynamic limit over an unspecified microscopic theory without any further assumptions.
Janusz Brzozowski
2014-05-01
Full Text Available The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language and on the quotient complexities of atoms are known. We introduce a new class of regular languages, called the maximally atomic languages, consisting of all languages meeting these bounds. We prove the following result: If L is a regular language of quotient complexity n and G is the subgroup of permutations in the transition semigroup T of the minimal DFA of L, then L is maximally atomic if and only if G is transitive on k-subsets of 1,...,n for 0 <= k <= n and T contains a transformation of rank n-1.
Andersen, Klaus Ejner
1985-01-01
Guinea pig maximization tests (GPMT) with chlorocresol were performed to ascertain whether the sensitization rate was affected by minor changes in the Freund's complete adjuvant (FCA) emulsion used. Three types of emulsion were evaluated: the oil phase was mixed with propylene glycol, saline with...... to the saline/oil emulsion. Placing of the challenge patches affected the response, as simultaneous chlorocresol challenge on the flank located 2 cm closer to the abdomen than the usual challenge site gave decreased reactions....
Knowledge discovery by accuracy maximization.
Cacciatore, Stefano; Luchinat, Claudio; Tenori, Leonardo
2014-04-01
Here we describe KODAMA (knowledge discovery by accuracy maximization), an unsupervised and semisupervised learning algorithm that performs feature extraction from noisy and high-dimensional data. Unlike other data mining methods, the peculiarity of KODAMA is that it is driven by an integrated procedure of cross-validation of the results. The discovery of a local manifold's topology is led by a classifier through a Monte Carlo procedure of maximization of cross-validated predictive accuracy. Briefly, our approach differs from previous methods in that it has an integrated procedure of validation of the results. In this way, the method ensures the highest robustness of the obtained solution. This robustness is demonstrated on experimental datasets of gene expression and metabolomics, where KODAMA compares favorably with other existing feature extraction methods. KODAMA is then applied to an astronomical dataset, revealing unexpected features. Interesting and not easily predictable features are also found in the analysis of the State of the Union speeches by American presidents: KODAMA reveals an abrupt linguistic transition sharply separating all post-Reagan from all pre-Reagan speeches. The transition occurs during Reagan's presidency and not from its beginning.
Social group utility maximization
Gong, Xiaowen; Yang, Lei; Zhang, Junshan
2014-01-01
This SpringerBrief explains how to leverage mobile users' social relationships to improve the interactions of mobile devices in mobile networks. It develops a social group utility maximization (SGUM) framework that captures diverse social ties of mobile users and diverse physical coupling of mobile devices. Key topics include random access control, power control, spectrum access, and location privacy.This brief also investigates SGUM-based power control game and random access control game, for which it establishes the socially-aware Nash equilibrium (SNE). It then examines the critical SGUM-b
Brandes, U; Gaertler, M; Goerke, R; Hoefer, M; Nikoloski, Z; Wagner, D
2006-01-01
Several algorithms have been proposed to compute partitions of networks into communities that score high on a graph clustering index called modularity. While publications on these algorithms typically contain experimental evaluations to emphasize the plausibility of results, none of these algorithms has been shown to actually compute optimal partitions. We here settle the unknown complexity status of modularity maximization by showing that the corresponding decision version is NP-complete in the strong sense. As a consequence, any efficient, i.e. polynomial-time, algorithm is only heuristic and yields suboptimal partitions on many instances.
Maximizing without difficulty: A modified maximizing scale and its correlates
Linda Lai
2010-01-01
This article presents several studies that replicate and extend previous research on maximizing. A modified scale for measuring individual maximizing tendency is introduced. The scale has adequate psychometric properties and reflects maximizers' aspirations for high standards and their preference for extensive alternative search, but not the decision difficulty aspect included in several previous studies. Based on this scale, maximizing is positively correlated with optimism, need for cogniti...
A Maximally Supersymmetric Kondo Model
Harrison, Sarah; Kachru, Shamit; Torroba, Gonzalo; /Stanford U., Phys. Dept. /SLAC
2012-02-17
We study the maximally supersymmetric Kondo model obtained by adding a fermionic impurity to N = 4 supersymmetric Yang-Mills theory. While the original Kondo problem describes a defect interacting with a free Fermi liquid of itinerant electrons, here the ambient theory is an interacting CFT, and this introduces qualitatively new features into the system. The model arises in string theory by considering the intersection of a stack of M D5-branes with a stack of N D3-branes, at a point in the D3 worldvolume. We analyze the theory holographically, and propose a dictionary between the Kondo problem and antisymmetric Wilson loops in N = 4 SYM. We perform an explicit calculation of the D5 fluctuations in the D3 geometry and determine the spectrum of defect operators. This establishes the stability of the Kondo fixed point together with its basic thermodynamic properties. Known supergravity solutions for Wilson loops allow us to go beyond the probe approximation: the D5s disappear and are replaced by three-form flux piercing a new topologically non-trivial S3 in the corrected geometry. This describes the Kondo model in terms of a geometric transition. A dual matrix model reflects the basic properties of the corrected gravity solution in its eigenvalue distribution.
HEMI: Hyperedge Majority Influence Maximization
Gangal, Varun; Narayanam, Ramasuri
2016-01-01
In this work, we consider the problem of influence maximization on a hypergraph. We first extend the Independent Cascade (IC) model to hypergraphs, and prove that the traditional influence maximization problem remains submodular. We then present a variant of the influence maximization problem (HEMI) where one seeks to maximize the number of hyperedges, a majority of whose nodes are influenced. We prove that HEMI is non-submodular under the diffusion model proposed.
Andersen, Klaus Ejner
1985-01-01
Guinea pig maximization tests (GPMT) with chlorocresol were performed to ascertain whether the sensitization rate was affected by minor changes in the Freund's complete adjuvant (FCA) emulsion used. Three types of emulsion were evaluated: the oil phase was mixed with propylene glycol, saline...... with 30% (v/v) ethanol or saline, respectively. Relative viscosity was used as one measure of physical properties of the emulsion. Higher degrees of sensitization (but not rates) were obtained at the 48 h challenge reading with the oil/propylene glycol and oil/saline + ethanol emulsions compared...... to the saline/oil emulsion. Placing of the challenge patches affected the response, as simultaneous chlorocresol challenge on the flank located 2 cm closer to the abdomen than the usual challenge site gave decreased reactions....
Polyploidy Induction of Pteroceltis tatarinowii Maxim
Lin ZHANG; Feng WANG; Zhongkui SUN; Cuicui ZHU; Rongwei CHEN
2015-01-01
3%Objective] This study was conducted to obtain tetraploid Pteroceltis tatari-nowi Maxim. with excel ent ornamental traits. [Method] The stem apex growing points of Pteroceltis tatarinowi Maxim. were treated with different concentrations of colchicine solution for different hours to figure out a proper method and obtain poly-ploids. [Result] The most effective induction was obtained by treatment with 0.6%-0.8% colchicine for 72 h with 34.2% mutation rate. Flow cytometry and chromosome observation of the stem apex growing point of P. tatarinowi Maxim. proved that the tetraploid plants were successful y obtained with chromosome number 2n=4x=36. [Conclusion] The result not only fil s the blank of polyploid breeding of P. tatarinowi , but also provides an effective way to broaden the methods of cultivation of fast-growing, high-quality, disease-resilience, new varieties of Pteroceltis.
MAXIMS VIOLATIONS IN LITERARY WORK
Widya Hanum Sari Pertiwi
2015-12-01
Full Text Available This study was qualitative research action that focuses to find out the flouting of Gricean maxims and the functions of the flouting in the tales which are included in collection of children literature entitled My Giant Treasury of Stories and Rhymes. The objective of the study is generally to identify the violation of maxims of quantity, quality, relevance, and manner in the data sources and also to analyze the use of the flouting in the tales which are included in the book. Qualitative design using categorizing strategies, specifically coding strategy, was applied. Thus, the researcher as the instrument in this investigation was selecting the tales, reading them, and gathering every item which reflects the violation of Gricean maxims based on some conditions of flouting maxims. On the basis of the data analysis, it was found that the some utterances in the tales, both narration and conversation, flouting the four maxims of conversation, namely maxim of quality, maxim of quantity, maxim of relevance, and maxim of manner. The researcher has also found that the flouting of maxims has one basic function that is to encourage the readers’ imagination toward the tales. This one basic function is developed by six others functions: (1 generating specific situation, (2 developing the plot, (3 enlivening the characters’ utterance, (4 implicating message, (5 indirectly characterizing characters, and (6 creating ambiguous setting. Keywords: children literature, tales, flouting maxims
Swanepoel, Konrad J
2011-01-01
A subset of a normed space X is called equilateral if the distance between any two points is the same. Let m(X) be the smallest possible size of an equilateral subset of X maximal with respect to inclusion. We first observe that Petty's construction of a d-dimensional X of any finite dimension d >= 4 with m(X)=4 can be generalised to show that m(X\\oplus_1\\R)=4 for any X of dimension at least 2 which has a smooth point on its unit sphere. By a construction involving Hadamard matrices we then show that both m(\\ell_p) and m(\\ell_p^d) are finite and bounded above by a function of p, for all 1 1 such that m(X) <= d+1 for all d-dimensional X with Banach-Mazur distance less than c from \\ell_p^d. Using Brouwer's fixed-point theorem we show that m(X) <= d+1 for all d-\\dimensional X with Banach-Mazur distance less than 3/2 from \\ell_\\infty^d. A graph-theoretical argument furthermore shows that m(\\ell_\\infty^d)=d+1. The above results lead us to conjecture that m(X) <= 1+\\dim X.
Unified Maximally Natural Supersymmetry
Huang, Junwu
2016-01-01
Maximally Natural Supersymmetry, an unusual weak-scale supersymmetric extension of the Standard Model based upon the inherently higher-dimensional mechanism of Scherk-Schwarz supersymmetry breaking (SSSB), possesses remarkably good fine tuning given present LHC limits. Here we construct a version with precision $SU(2)_{\\rm L} \\times U(1)_{\\rm Y} $ unification: $\\sin^2 \\theta_W(M_Z) \\simeq 0.231$ is predicted to $\\pm 2\\%$ by unifying $SU(2)_{\\rm L} \\times U(1)_{\\rm Y} $ into a 5D $SU(3)_{\\rm EW}$ theory at a Kaluza-Klein scale of $1/R_5 \\sim 4.4\\,{\\rm TeV}$, where SSSB is simultaneously realised. Full unification with $SU(3)_{\\rm C}$ is accommodated by extending the 5D theory to a $N=4$ supersymmetric $SU(6)$ gauge theory on a 6D rectangular orbifold at $1/R_6 \\sim 40 \\,{\\rm TeV}$. TeV-scale states beyond the SM include exotic charged fermions implied by $SU(3)_{\\rm EW}$ with masses lighter than $\\sim 1.2\\,{\\rm TeV}$, and squarks in the mass range $1.4\\,{\\rm TeV} - 2.3\\,{\\rm TeV}$, providing distinct signature...
Maximal subgroups of finite groups
S. Srinivasan
1990-01-01
Full Text Available In finite groups maximal subgroups play a very important role. Results in the literature show that if the maximal subgroup has a very small index in the whole group then it influences the structure of the group itself. In this paper we study the case when the index of the maximal subgroups of the groups have a special type of relation with the Fitting subgroup of the group.
Finding Maximal Quasiperiodicities in Strings
Brodal, Gerth Stølting; Pedersen, Christian N. S.
2000-01-01
of length n in time O(n log n) and space O(n). Our algorithm uses the suffix tree as the fundamental data structure combined with efficient methods for merging and performing multiple searches in search trees. Besides finding all maximal quasiperiodic substrings, our algorithm also marks the nodes......Apostolico and Ehrenfeucht defined the notion of a maximal quasiperiodic substring and gave an algorithm that finds all maximal quasiperiodic substrings in a string of length n in time O(n log2 n). In this paper we give an algorithm that finds all maximal quasiperiodic substrings in a string...
Maximizing Entropy over Markov Processes
Biondi, Fabrizio; Legay, Axel; Nielsen, Bo Friis
2013-01-01
computation reduces to finding a model of a specification with highest entropy. Entropy maximization for probabilistic process specifications has not been studied before, even though it is well known in Bayesian inference for discrete distributions. We give a characterization of global entropy of a process...... as a reward function, a polynomial algorithm to verify the existence of an system maximizing entropy among those respecting a specification, a procedure for the maximization of reward functions over Interval Markov Chains and its application to synthesize an implementation maximizing entropy. We show how...
Maximizing entropy over Markov processes
Biondi, Fabrizio; Legay, Axel; Nielsen, Bo Friis
2014-01-01
computation reduces to finding a model of a specification with highest entropy. Entropy maximization for probabilistic process specifications has not been studied before, even though it is well known in Bayesian inference for discrete distributions. We give a characterization of global entropy of a process...... as a reward function, a polynomial algorithm to verify the existence of a system maximizing entropy among those respecting a specification, a procedure for the maximization of reward functions over Interval Markov Chains and its application to synthesize an implementation maximizing entropy. We show how...
Gonzalez-Sanchez, Jon
2010-01-01
Let $w = w(x_1,..., x_n)$ be a word, i.e. an element of the free group $F =$ on $n$ generators $x_1,..., x_n$. The verbal subgroup $w(G)$ of a group $G$ is the subgroup generated by the set $\\{w (g_1,...,g_n)^{\\pm 1} | g_i \\in G, 1\\leq i\\leq n \\}$ of all $w$-values in $G$. We say that a (finite) group $G$ is $w$-maximal if $|G:w(G)|> |H:w(H)|$ for all proper subgroups $H$ of $G$ and that $G$ is hereditarily $w$-maximal if every subgroup of $G$ is $w$-maximal. In this text we study $w$-maximal and hereditarily $w$-maximal (finite) groups.
Measurable Maximal Energy and Minimal Time Interval
Dahab, Eiman Abou El
2014-01-01
The possibility of finding the measurable maximal energy and the minimal time interval is discussed in different quantum aspects. It is found that the linear generalized uncertainty principle (GUP) approach gives a non-physical result. Based on large scale Schwarzshild solution, the quadratic GUP approach is utilized. The calculations are performed at the shortest distance, at which the general relativity is assumed to be a good approximation for the quantum gravity and at larger distances, as well. It is found that both maximal energy and minimal time have the order of the Planck time. Then, the uncertainties in both quantities are accordingly bounded. Some physical insights are addressed. Also, the implications on the physics of early Universe and on quantized mass are outlined. The results are related to the existence of finite cosmological constant and minimum mass (mass quanta).
Modularity maximization using completely positive programming
Yazdanparast, Sakineh; Havens, Timothy C.
2017-04-01
Community detection is one of the most prominent problems of social network analysis. In this paper, a novel method for Modularity Maximization (MM) for community detection is presented which exploits the Alternating Direction Augmented Lagrangian (ADAL) method for maximizing a generalized form of Newman's modularity function. We first transform Newman's modularity function into a quadratic program and then use Completely Positive Programming (CPP) to map the quadratic program to a linear program, which provides the globally optimal maximum modularity partition. In order to solve the proposed CPP problem, a closed form solution using the ADAL merged with a rank minimization approach is proposed. The performance of the proposed method is evaluated on several real-world data sets used for benchmarks community detection. Simulation results shows the proposed technique provides outstanding results in terms of modularity value for crisp partitions.
Maximizing without difficulty: A modified maximizing scale and its correlates
Lai, Linda
2010-01-01
... included in several previous studies. Based on this scale, maximizing is positively correlated with optimism, need for cognition, desire for consistency, risk aversion, intrinsic motivation, self-efficacy and perceived workload, whereas...
Are maximizers really unhappy? The measurement of maximizing tendency,
Dalia L. Diab
2008-06-01
Full Text Available Recent research suggesting that people who maximize are less happy than those who satisfice has received considerable fanfare. The current study investigates whether this conclusion reflects the construct itself or rather how it is measured. We developed an alternative measure of maximizing tendency that is theory-based, has good psychometric properties, and predicts behavioral outcomes. In contrast to the existing maximization measure, our new measure did not correlate with life (dissatisfaction, nor with most maladaptive personality and decision-making traits. We conclude that the interpretation of maximizers as unhappy may be due to poor measurement of the construct. We present a more reliable and valid measure for future researchers to use.
Principles of maximally classical and maximally realistic quantum mechanics
S M Roy
2002-08-01
Recently Auberson, Mahoux, Roy and Singh have proved a long standing conjecture of Roy and Singh: In 2-dimensional phase space, a maximally realistic quantum mechanics can have quantum probabilities of no more than + 1 complete commuting cets (CCS) of observables coexisting as marginals of one positive phase space density. Here I formulate a stationary principle which gives a nonperturbative deﬁnition of a maximally classical as well as maximally realistic phase space density. I show that the maximally classical trajectories are in fact exactly classical in the simple examples of coherent states and bound states of an oscillator and Gaussian free particle states. In contrast, it is known that the de Broglie–Bohm realistic theory gives highly nonclassical trajectories.
Witten spinors on maximal, conformally flat hypersurfaces
Frauendiener, Jörg; Szabados, László B
2011-01-01
The boundary conditions that exclude zeros of the solutions of the Witten equation (and hence guarantee the existence of a 3-frame satisfying the so-called special orthonormal frame gauge conditions) are investigated. We determine the general form of the conformally invariant boundary conditions for the Witten equation, and find the boundary conditions that characterize the constant and the conformally constant spinor fields among the solutions of the Witten equations on compact domains in extrinsically and intrinsically flat, and on maximal, intrinsically globally conformally flat spacelike hypersurfaces, respectively. We also provide a number of exact solutions of the Witten equation with various boundary conditions (both at infinity and on inner or outer boundaries) that single out nowhere vanishing spinor fields on the flat, non-extreme Reissner--Nordstr\\"om and Brill--Lindquist data sets. Our examples show that there is an interplay between the boundary conditions, the global topology of the hypersurface...
Neural network approach for solving the maximal common subgraph problem.
Shoukry, A; Aboutabl, M
1996-01-01
A new formulation of the maximal common subgraph problem (MCSP), that is implemented using a two-stage Hopfield neural network, is given. Relative merits of this proposed formulation, with respect to current neural network-based solutions as well as classical sequential-search-based solutions, are discussed.
Maximizing ROI with yield management
Neil Snyder
2001-01-01
.... the technology is based on the concept of yield management, which aims to sell the right product to the right customer at the right price and the right time therefore maximizing revenue, or yield...
Are CEOs Expected Utility Maximizers?
John List; Charles Mason
2009-01-01
Are individuals expected utility maximizers? This question represents much more than academic curiosity. In a normative sense, at stake are the fundamental underpinnings of the bulk of the last half-century's models of choice under uncertainty. From a positive perspective, the ubiquitous use of benefit-cost analysis across government agencies renders the expected utility maximization paradigm literally the only game in town. In this study, we advance the literature by exploring CEO's preferen...
Gaussian maximally multipartite entangled states
Facchi, Paolo; Lupo, Cosmo; Mancini, Stefano; Pascazio, Saverio
2009-01-01
We introduce the notion of maximally multipartite entangled states (MMES) in the context of Gaussian continuous variable quantum systems. These are bosonic multipartite states that are maximally entangled over all possible bipartitions of the system. By considering multimode Gaussian states with constrained energy, we show that perfect MMESs, which exhibit the maximum amount of bipartite entanglement for all bipartitions, only exist for systems containing n=2 or 3 modes. We further numerically investigate the structure of MMESs and their frustration for n <= 7.
All maximally entangling unitary operators
Cohen, Scott M. [Department of Physics, Duquesne University, Pittsburgh, Pennsylvania 15282 (United States); Department of Physics, Carnegie-Mellon University, Pittsburgh, Pennsylvania 15213 (United States)
2011-11-15
We characterize all maximally entangling bipartite unitary operators, acting on systems A and B of arbitrary finite dimensions d{sub A}{<=}d{sub B}, when ancillary systems are available to both parties. Several useful and interesting consequences of this characterization are discussed, including an understanding of why the entangling and disentangling capacities of a given (maximally entangling) unitary can differ and a proof that these capacities must be equal when d{sub A}=d{sub B}.
Salvio, Alberto; Strumia, Alessandro; Urbano, Alfredo
2016-01-01
Motivated by the 750 GeV diphoton excess found at LHC, we compute the maximal width into $\\gamma\\gamma$ that a neutral scalar can acquire through a loop of charged fermions or scalars as function of the maximal scale at which the theory holds, taking into account vacuum (meta)stability bounds. We show how an extra gauge symmetry can qualitatively weaken such bounds, and explore collider probes and connections with Dark Matter.
A. Garmroodi Asil
2017-09-01
To further reduce the sulfur dioxide emission of the entire refining process, two scenarios of acid gas or air preheats are investigated when either of them is used simultaneously with the third enrichment scheme. The maximum overall sulfur recovery efficiency and highest combustion chamber temperature is slightly higher for acid gas preheats but air preheat is more favorable because it is more benign. To the best of our knowledge, optimization of the entire GTU + enrichment section and SRU processes has not been addressed previously.
Algebraic curves of maximal cyclicity
Caubergh, Magdalena; Dumortier, Freddy
2006-01-01
The paper deals with analytic families of planar vector fields, studying methods to detect the cyclicity of a non-isolated closed orbit, i.e. the maximum number of limit cycles that can locally bifurcate from it. It is known that this multi-parameter problem can be reduced to a single-parameter one, in the sense that there exist analytic curves in parameter space along which the maximal cyclicity can be attained. In that case one speaks about a maximal cyclicity curve (mcc) in case only the number is considered and of a maximal multiplicity curve (mmc) in case the multiplicity is also taken into account. In view of obtaining efficient algorithms for detecting the cyclicity, we investigate whether such mcc or mmc can be algebraic or even linear depending on certain general properties of the families or of their associated Bautin ideal. In any case by well chosen examples we show that prudence is appropriate.
BOUNDEDNESS OF MAXIMAL SINGULAR INTEGRALS
CHEN JIECHENG; ZHU XIANGRONG
2005-01-01
The authors study the singular integrals under the Hormander condition and the measure not satisfying the doubling condition. At first, if the corresponding singular integral is bounded from L2 to itseff, it is proved that the maximal singu lar integral is bounded from L∞ to RBMO except that it is infinite μ-a.e. on Rd. A sufficient condition and a necessary condition such that the maximal singular integral is bounded from L2 to itself are also obtained. There is a small gap between the two conditions.
Effect of inorganic salts on crystallization of poly(ethylene glycol) in frozen solutions.
Izutsu, Ken-ichi; Aoyagi, Nobuo
2005-01-06
The effect of inorganic salts on eutectic crystallization of poly(ethylene glycol) (PEG) 1500-20,000 in frozen solution was studied to model the polymer and inorganic salt interaction in freeze-dried formulations. Thermal analysis of an aqueous PEG 3000 solution showed a eutectic PEG crystallization exotherm at approximately -47 degrees C and a subsequent PEG crystal melting endotherm at -14.9 degrees C. Addition of sodium chloride prevented the PEG crystallization in the freeze-concentrated solution surrounding ice crystals. Higher concentration NaCl was required to retain higher molecular weight PEG in the amorphous state. Various inorganic salts prevented the PEG crystallization to varying degrees depending mainly on the position of the anion in the Hofmeister's lyotropic series. Some salting-in and 'intermediate' salts (NaSCN, NaI, NaBr, NaCl, LiCl, KCl, and RbCl) inhibited the crystallization of PEG 7500 in frozen solutions. On the other hand, salting-out salts (NaH2PO4, Na2HPO4, Na2SO4, and NaF) did not show an apparent effect on the PEG crystallization. Some salting-out salts induced PEG crystallization in PEG and sucrose combination frozen solutions. The varying abilities of salts to prevent the PEG crystallization in frozen solutions strongly suggested that the solutes had different degrees of miscibility in the freeze-concentrates.
Understanding maximal repetitions in strings
Crochemore, Maxime
2008-01-01
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simple proof of this result. As a consequence of our approach, the stronger result concerning the linearity of the sum of exponents of all runs follows easily.
Note on maximal distance separable codes
YANG Jian-sheng; WANG De-xiu; JIN Qing-fang
2009-01-01
In this paper, the maximal length of maximal distance separable(MDS)codes is studied, and a new upper bound formula of the maximal length of MDS codes is obtained. Especially, the exact values of the maximal length of MDS codes in some parameters are given.
Maximization, learning, and economic behavior.
Erev, Ido; Roth, Alvin E
2014-07-22
The rationality assumption that underlies mainstream economic theory has proved to be a useful approximation, despite the fact that systematic violations to its predictions can be found. That is, the assumption of rational behavior is useful in understanding the ways in which many successful economic institutions function, although it is also true that actual human behavior falls systematically short of perfect rationality. We consider a possible explanation of this apparent inconsistency, suggesting that mechanisms that rest on the rationality assumption are likely to be successful when they create an environment in which the behavior they try to facilitate leads to the best payoff for all agents on average, and most of the time. Review of basic learning research suggests that, under these conditions, people quickly learn to maximize expected return. This review also shows that there are many situations in which experience does not increase maximization. In many cases, experience leads people to underweight rare events. In addition, the current paper suggests that it is convenient to distinguish between two behavioral approaches to improve economic analyses. The first, and more conventional approach among behavioral economists and psychologists interested in judgment and decision making, highlights violations of the rational model and proposes descriptive models that capture these violations. The second approach studies human learning to clarify the conditions under which people quickly learn to maximize expected return. The current review highlights one set of conditions of this type and shows how the understanding of these conditions can facilitate market design.
Maximal Regularity of the Discrete Harmonic Oscillator Equation
Airton Castro
2009-01-01
Full Text Available We give a representation of the solution for the best approximation of the harmonic oscillator equation formulated in a general Banach space setting, and a characterization of lp-maximal regularity—or well posedness—solely in terms of R-boundedness properties of the resolvent operator involved in the equation.
Zhao, Li-Shan; Cao, Ze-Xian; Wang, Qiang
2015-10-27
Liquid-liquid transition of water is an important concept in condensed-matter physics. Recently, it was claimed to have been confirmed in aqueous solutions based on annealing-induced upshift of glass-liquid transition temperature, T(g) . Here we report a universal water-content, X(aqu) , dependence of T(g) for aqueous solutions. Solutions with X(aqu)>X(cr)(aqu)vitrify/devitrify at a constant temperature, ~T(g) , referring to freeze-concentrated phase with X(aqu)left behind ice crystallization. Those solutions with X(aqu)recrystallization is stabilized at . Experiments on aqueous glycerol and 1,2,4-butanetriol solutions in literature were repeated, and the same samples subject to other annealing treatments equally reproduce the result. The upshift of T(g) by annealing is attributable to freeze-concentrated phase of solutions instead of 'liquid II phase of water'. Our work also provides a reliable method to determine hydration formula and to scrutinize solute-solvent interaction in solution.
Maximally reliable Markov chains under energy constraints.
Escola, Sean; Eisele, Michael; Miller, Kenneth; Paninski, Liam
2009-07-01
Signal-to-noise ratios in physical systems can be significantly degraded if the outputs of the systems are highly variable. Biological processes for which highly stereotyped signal generations are necessary features appear to have reduced their signal variabilities by employing multiple processing steps. To better understand why this multistep cascade structure might be desirable, we prove that the reliability of a signal generated by a multistate system with no memory (i.e., a Markov chain) is maximal if and only if the system topology is such that the process steps irreversibly through each state, with transition rates chosen such that an equal fraction of the total signal is generated in each state. Furthermore, our result indicates that by increasing the number of states, it is possible to arbitrarily increase the reliability of the system. In a physical system, however, an energy cost is associated with maintaining irreversible transitions, and this cost increases with the number of such transitions (i.e., the number of states). Thus, an infinite-length chain, which would be perfectly reliable, is infeasible. To model the effects of energy demands on the maximally reliable solution, we numerically optimize the topology under two distinct energy functions that penalize either irreversible transitions or incommunicability between states, respectively. In both cases, the solutions are essentially irreversible linear chains, but with upper bounds on the number of states set by the amount of available energy. We therefore conclude that a physical system for which signal reliability is important should employ a linear architecture, with the number of states (and thus the reliability) determined by the intrinsic energy constraints of the system.
Asymptotics of robust utility maximization
Knispel, Thomas
2012-01-01
For a stochastic factor model we maximize the long-term growth rate of robust expected power utility with parameter $\\lambda\\in(0,1)$. Using duality methods the problem is reformulated as an infinite time horizon, risk-sensitive control problem. Our results characterize the optimal growth rate, an optimal long-term trading strategy and an asymptotic worst-case model in terms of an ergodic Bellman equation. With these results we propose a duality approach to a "robust large deviations" criterion for optimal long-term investment.
Multivariate residues and maximal unitarity
Søgaard, Mads; Zhang, Yang
2013-12-01
We extend the maximal unitarity method to amplitude contributions whose cuts define multidimensional algebraic varieties. The technique is valid to all orders and is explicitly demonstrated at three loops in gauge theories with any number of fermions and scalars in the adjoint representation. Deca-cuts realized by replacement of real slice integration contours by higher-dimensional tori encircling the global poles are used to factorize the planar triple box onto a product of trees. We apply computational algebraic geometry and multivariate complex analysis to derive unique projectors for all master integral coefficients and obtain compact analytic formulae in terms of tree-level data.
Beeping a Maximal Independent Set
Afek, Yehuda; Alon, Noga; Bar-Joseph, Ziv; Cornejo, Alejandro; Haeupler, Bernhard; Kuhn, Fabian
2012-01-01
We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on carrier sensing. The model consists of an anonymous broadcast network in which nodes have no knowledge about the topology of the network or even an upper bound on its size. Furthermore, it is assumed that an adversary chooses at which time slot each node wakes up. At each time slot a node can either beep, that is, emit a signal, or be silent. At a particular time slot...
Maximal Congruences on Some Semigroups
Jintana Sanwong; R.P. Sullivan
2007-01-01
In 1976 Howie proved that a finite congruence-free semigroup is a simple group if it has at least three elements but no zero elementInfinite congruence-free semigroups are far more complicated to describe, but some have been constructed using semigroups of transformations (for example, by Howie in 1981 and by Marques in 1983)Here, forcertain semigroups S of numbers and of transformations, we determine all congruences p on S such that S/p is congruence-free, that is, we describe all maximal congruences on such semigroups S.
A New Augmentation Based Algorithm for Extracting Maximal Chordal Subgraphs.
Bhowmick, Sanjukta; Chen, Tzu-Yi; Halappanavar, Mahantesh
2015-02-01
A graph is chordal if every cycle of length greater than three contains an edge between non-adjacent vertices. Chordal graphs are of interest both theoretically, since they admit polynomial time solutions to a range of NP-hard graph problems, and practically, since they arise in many applications including sparse linear algebra, computer vision, and computational biology. A maximal chordal subgraph is a chordal subgraph that is not a proper subgraph of any other chordal subgraph. Existing algorithms for computing maximal chordal subgraphs depend on dynamically ordering the vertices, which is an inherently sequential process and therefore limits the algorithms' parallelizability. In this paper we explore techniques to develop a scalable parallel algorithm for extracting a maximal chordal subgraph. We demonstrate that an earlier attempt at developing a parallel algorithm may induce a non-optimal vertex ordering and is therefore not guaranteed to terminate with a maximal chordal subgraph. We then give a new algorithm that first computes and then repeatedly augments a spanning chordal subgraph. After proving that the algorithm terminates with a maximal chordal subgraph, we then demonstrate that this algorithm is more amenable to parallelization and that the parallel version also terminates with a maximal chordal subgraph. That said, the complexity of the new algorithm is higher than that of the previous parallel algorithm, although the earlier algorithm computes a chordal subgraph which is not guaranteed to be maximal. We experimented with our augmentation-based algorithm on both synthetic and real-world graphs. We provide scalability results and also explore the effect of different choices for the initial spanning chordal subgraph on both the running time and on the number of edges in the maximal chordal subgraph.
Inapproximability of maximal strip recovery
Jiang, Minghui
2009-01-01
In comparative genomic, the first step of sequence analysis is usually to decompose two or more genomes into syntenic blocks that are segments of homologous chromosomes. For the reliable recovery of syntenic blocks, noise and ambiguities in the genomic maps need to be removed first. Maximal Strip Recovery (MSR) is an optimization problem proposed by Zheng, Zhu, and Sankoff for reliably recovering syntenic blocks from genomic maps in the midst of noise and ambiguities. Given $d$ genomic maps as sequences of gene markers, the objective of \\msr{d} is to find $d$ subsequences, one subsequence of each genomic map, such that the total length of syntenic blocks in these subsequences is maximized. For any constant $d \\ge 2$, a polynomial-time 2d-approximation for \\msr{d} was previously known. In this paper, we show that for any $d \\ge 2$, \\msr{d} is APX-hard, even for the most basic version of the problem in which all gene markers are distinct and appear in positive orientation in each genomic map. Moreover, we provi...
Maximal right smooth extension chains
Huang, Yun Bao
2010-01-01
If $w=u\\alpha$ for $\\alpha\\in \\Sigma=\\{1,2\\}$ and $u\\in \\Sigma^*$, then $w$ is said to be a \\textit{simple right extension}of $u$ and denoted by $u\\prec w$. Let $k$ be a positive integer and $P^k(\\epsilon)$ denote the set of all $C^\\infty$-words of height $k$. Set $u_{1},\\,u_{2},..., u_{m}\\in P^{k}(\\epsilon)$, if $u_{1}\\prec u_{2}\\prec ...\\prec u_{m}$ and there is no element $v$ of $P^{k}(\\epsilon)$ such that $v\\prec u_{1}\\text{or} u_{m}\\prec v$, then $u_{1}\\prec u_{2}\\prec...\\prec u_{m}$ is said to be a \\textit{maximal right smooth extension (MRSE) chains}of height $k$. In this paper, we show that \\textit{MRSE} chains of height $k$ constitutes a partition of smooth words of height $k$ and give the formula of the number of \\textit{MRSE} chains of height $k$ for each positive integer $k$. Moreover, since there exist the minimal height $h_1$ and maximal height $h_2$ of smooth words of length $n$ for each positive integer $n$, we find that \\textit{MRSE} chains of heights $h_1-1$ and $h_2+1$ are good candidates t...
D2-brane Chern-Simons theories: F-maximization = a-maximization
Fluder, Martin
2015-01-01
We study a system of N D2-branes probing a generic Calabi-Yau three-fold singularity in the presence of a non-zero quantized Romans mass n. We argue that the low-energy effective N = 2 Chern-Simons quiver gauge theory flows to a superconformal fixed point in the IR, and construct the dual AdS_4 solution in massive IIA supergravity. We compute the free energy F of the gauge theory on S^3 using localization. In the large N limit we find F = c(nN)^{1/3}a^{2/3}, where c is a universal constant and a is the a-function of the "parent" four-dimensional N = 1 theory on N D3-branes probing the same Calabi-Yau singularity. It follows that maximizing F over the space of admissible R-symmetries is equivalent to maximizing a for this class of theories. Moreover, we show that the gauge theory result precisely matches the holographic free energy of the supergravity solution, and provide a similar matching of the VEV of a BPS Wilson loop operator.
The maximal D = 4 supergravities
Wit, Bernard de [Institute for Theoretical Physics and Spinoza Institute, Utrecht University, Postbus 80.195, NL-3508 TD Utrecht (Netherlands); Samtleben, Henning [Laboratoire de Physique, ENS Lyon, 46 allee d' Italie, F-69364 Lyon CEDEX 07 (France); Trigiante, Mario [Dept. of Physics, Politecnico di Torino, Corso Duca degli Abruzzi 24, I-10129 Turin (Italy)
2007-06-15
All maximal supergravities in four space-time dimensions are presented. The ungauged Lagrangians can be encoded in an E{sub 7(7)}-Sp(56; R)/GL(28) matrix associated with the freedom of performing electric/magnetic duality transformations. The gauging is defined in terms of an embedding tensor {theta} which encodes the subgroup of E{sub 7(7)} that is realized as a local invariance. This embedding tensor may imply the presence of magnetic charges which require corresponding dual gauge fields. The latter can be incorporated by using a recently proposed formulation that involves tensor gauge fields in the adjoint representation of E{sub 7(7)}. In this formulation the results take a universal form irrespective of the electric/magnetic duality basis. We present the general class of supersymmetric and gauge invariant Lagrangians and discuss a number of applications.
Maximizing profit using recommender systems
Das, Aparna; Ricketts, Daniel
2009-01-01
Traditional recommendation systems make recommendations based solely on the customer's past purchases, product ratings and demographic data without considering the profitability the items being recommended. In this work we study the question of how a vendor can directly incorporate the profitability of items into its recommender so as to maximize its expected profit while still providing accurate recommendations. Our approach uses the output of any traditional recommender system and adjust them according to item profitabilities. Our approach is parameterized so the vendor can control how much the recommendation incorporating profits can deviate from the traditional recommendation. We study our approach under two settings and show that it achieves approximately 22% more profit than traditional recommendations.
The maximal D=5 supergravities
de Wit, Bernard; Trigiante, M; Wit, Bernard de; Samtleben, Henning; Trigiante, Mario
2007-01-01
The general Lagrangian for maximal supergravity in five spacetime dimensions is presented with vector potentials in the \\bar{27} and tensor fields in the 27 representation of E_6. This novel tensor-vector system is subject to an intricate set of gauge transformations, describing 3(27-t) massless helicity degrees of freedom for the vector fields and 3t massive spin degrees of freedom for the tensor fields, where the (even) value of t depends on the gauging. The kinetic term of the tensor fields is accompanied by a unique Chern-Simons coupling which involves both vector and tensor fields. The Lagrangians are completely encoded in terms of the embedding tensor which defines the E_6 subgroup that is gauged by the vectors. The embedding tensor is subject to two constraints which ensure the consistency of the combined vector-tensor gauge transformations and the supersymmetry of the full Lagrangian. This new formulation encompasses all possible gaugings.
On the local existence of maximal slicings in spherically symmetric spacetimes
Cordero-Carrión, Isabel; Morales-Lladosa, Juan Antonio
2010-01-01
In this talk we show that any spherically symmetric spacetime admits locally a maximal spacelike slicing. The above condition is reduced to solve a decoupled system of first order quasi-linear partial differential equations. The solution may be accomplished analytical or numerically. We provide a general procedure to construct such maximal slicings.
On the local existence of maximal slicings in spherically symmetric spacetimes
Cordero-Carrion, Isabel; Ibanez, Jose MarIa; Morales-Lladosa, Juan Antonio, E-mail: isabel.cordero@uv.e, E-mail: jose.m.ibanez@uv.e, E-mail: antonio.morales@uv.e [Departamento de AstronomIa y Astrofisica, Universidad de Valencia, C/ Dr. Moliner 50, E-46100 Burjassot, Valencia (Spain)
2010-05-01
In this talk we show that any spherically symmetric spacetime admits locally a maximal spacelike slicing. The above condition is reduced to solve a decoupled system of first order quasi-linear partial differential equations. The solution may be accomplished analytical or numerically. We provide a general procedure to construct such maximal slicings.
Beeping a Maximal Independent Set
Afek, Yehuda; Bar-Joseph, Ziv; Cornejo, Alejandro; Haeupler, Bernhard; Kuhn, Fabian
2012-01-01
We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on carrier sensing. The model consists of an anonymous broadcast network in which nodes have no knowledge about the topology of the network or even an upper bound on its size. Furthermore, it is assumed that an adversary chooses at which time slot each node wakes up. At each time slot a node can either beep, that is, emit a signal, or be silent. At a particular time slot, beeping nodes receive no feedback, while silent nodes can only differentiate between none of its neighbors beeping, or at least one of its neighbors beeping. We start by proving a lower bound that shows that in this model, it is not possible to locally converge to an MIS in sub-polynomial time. We then study four different relaxations of the model which allow us to circumvent the lower bound and find an MIS in polylogarithmic time. First, we show that if a polynomial upper bound on the network size is known, it is possi...
Maximal switchability of centralized networks
Vakulenko, Sergei; Morozov, Ivan; Radulescu, Ovidiu
2016-08-01
We consider continuous time Hopfield-like recurrent networks as dynamical models for gene regulation and neural networks. We are interested in networks that contain n high-degree nodes preferably connected to a large number of N s weakly connected satellites, a property that we call n/N s -centrality. If the hub dynamics is slow, we obtain that the large time network dynamics is completely defined by the hub dynamics. Moreover, such networks are maximally flexible and switchable, in the sense that they can switch from a globally attractive rest state to any structurally stable dynamics when the response time of a special controller hub is changed. In particular, we show that a decrease of the controller hub response time can lead to a sharp variation in the network attractor structure: we can obtain a set of new local attractors, whose number can increase exponentially with N, the total number of nodes of the nework. These new attractors can be periodic or even chaotic. We provide an algorithm, which allows us to design networks with the desired switching properties, or to learn them from time series, by adjusting the interactions between hubs and satellites. Such switchable networks could be used as models for context dependent adaptation in functional genetics or as models for cognitive functions in neuroscience.
Maximal inequalities for bessel processes
Graversen SE
1998-01-01
Full Text Available It is proved that the uniform law of large numbers (over a random parameter set for the -dimensional ( Bessel process started at 0 is valid: for all stopping times for . The rate obtained (on the right-hand side is shown to be the best possible. The following inequality is gained as a consequence: for all stopping times for , where the constant satisfies as . This answers a question raised in [4]. The method of proof relies upon representing the Bessel process as a time changed geometric Brownian motion. The main emphasis of the paper is on the method of proof and on the simplicity of solution.
Maximal inequalities for demimartingales and their applications
WANG XueJun; HU ShuHe
2009-01-01
In this paper,we establish some maximal inequalities for demimartingales which generalize and improve the results of Christofides.The maximal inequalities for demimartingales are used as key inequalities to establish other results including Doob's type maximal inequality for demimartingales,strong laws of large numbers and growth rate for demimartingales and associated random variables.At last,we give an equivalent condition of uniform integrability for demisubmartingales.
Maximal inequalities for demimartingales and their applications
无
2009-01-01
In this paper, we establish some maximal inequalities for demimartingales which generalize and improve the results of Christofides. The maximal inequalities for demimartingales are used as key inequalities to establish other results including Doob’s type maximal inequality for demimartingales, strong laws of large numbers and growth rate for demimartingales and associated random variables. At last, we give an equivalent condition of uniform integrability for demisubmartingales.
Maximally Flat Waveforms with Finite Number of Harmonics in Class-F Power Amplifiers
Anamarija Juhas
2013-01-01
Full Text Available In this paper general solution to the problem of finding maximally flat waveforms with finite number of harmonics (maximally flat trigonometric polynomials is provided. Waveform coefficients are expressed in closed form as functions of harmonic orders. Two special cases of maximally flat waveforms (so-called maximally flat even harmonic and maximally flat odd harmonic waveforms, which proved to play an important role in class-F and inverse class-F power amplifier (PA operations, are also considered. For these two special types of waveforms, coefficients are expressed as functions of two parameters only. Closed form expressions for efficiency and power output capability of class-F and inverse class-F PA operations with maximally flat waveforms are also provided as explicit functions of number of a harmonics.
Task-oriented maximally entangled states
Agrawal, Pankaj; Pradhan, B, E-mail: agrawal@iopb.res.i, E-mail: bpradhan@iopb.res.i [Institute of Physics, Sachivalaya Marg, Bhubaneswar, Orissa 751 005 (India)
2010-06-11
We introduce the notion of a task-oriented maximally entangled state (TMES). This notion depends on the task for which a quantum state is used as the resource. TMESs are the states that can be used to carry out the task maximally. This concept may be more useful than that of a general maximally entangled state in the case of a multipartite system. We illustrate this idea by giving an operational definition of maximally entangled states on the basis of communication tasks of teleportation and superdense coding. We also give examples and a procedure to obtain such TMESs for n-qubit systems.
Inflation in maximal gauged supergravities
Kodama, Hideo [Theory Center, KEK,Tsukuba 305-0801 (Japan); Department of Particles and Nuclear Physics,The Graduate University for Advanced Studies,Tsukuba 305-0801 (Japan); Nozawa, Masato [Dipartimento di Fisica, Università di Milano, and INFN, Sezione di Milano,Via Celoria 16, 20133 Milano (Italy)
2015-05-18
We discuss the dynamics of multiple scalar fields and the possibility of realistic inflation in the maximal gauged supergravity. In this paper, we address this problem in the framework of recently discovered 1-parameter deformation of SO(4,4) and SO(5,3) dyonic gaugings, for which the base point of the scalar manifold corresponds to an unstable de Sitter critical point. In the gauge-field frame where the embedding tensor takes the value in the sum of the 36 and 36’ representations of SL(8), we present a scheme that allows us to derive an analytic expression for the scalar potential. With the help of this formalism, we derive the full potential and gauge coupling functions in analytic forms for the SO(3)×SO(3)-invariant subsectors of SO(4,4) and SO(5,3) gaugings, and argue that there exist no new critical points in addition to those discovered so far. For the SO(4,4) gauging, we also study the behavior of 6-dimensional scalar fields in this sector near the Dall’Agata-Inverso de Sitter critical point at which the negative eigenvalue of the scalar mass square with the largest modulus goes to zero as the deformation parameter s approaches a critical value s{sub c}. We find that when the deformation parameter s is taken sufficiently close to the critical value, inflation lasts more than 60 e-folds even if the initial point of the inflaton allows an O(0.1) deviation in Planck units from the Dall’Agata-Inverso critical point. It turns out that the spectral index n{sub s} of the curvature perturbation at the time of the 60 e-folding number is always about 0.96 and within the 1σ range n{sub s}=0.9639±0.0047 obtained by Planck, irrespective of the value of the η parameter at the critical saddle point. The tensor-scalar ratio predicted by this model is around 10{sup −3} and is close to the value in the Starobinsky model.
Patel, Mehulkumar; Munjal, Bhushan; Bansal, Arvind K
2014-08-25
The purpose of this study was to evaluate the differential effect of buffering agents on the crystallization of gemcitabine hydrochloride (GHCl) in frozen solutions. Four buffering agents, viz. citric acid (CA), malic acid (MA), succinic acid (SA) and tartaric acid (TA) were selected and their effect on GHCl crystallization was monitored using standard DSC and low temperature XRD. Onset of GHCl crystallization during heating run in DSC was measured to compare the differential effect of buffering agents. Glass transition temperature (Tg'), unfrozen water content in the freeze concentrate and crystallization propensity of the buffering agents was also determined for mechanistic understanding of the underlying effects. CA and MA inhibited while SA facilitated crystallization of GHCl even at 25 mM concentration. Increasing the concentration enhanced their effect. However, TA inhibited GHCl crystallization at concentrations crystallization could be explained by consideration of two opposing factors: (i) their own crystallization tendency and (ii) unfrozen water content in the freeze concentrate. In conclusion, it was established that API crystallization in frozen solution is affected by the type and concentration of the buffering agents.
Computing Maximally Supersymmetric Scattering Amplitudes
Stankowicz, James Michael, Jr.
This dissertation reviews work in computing N = 4 super-Yang--Mills (sYM) and N = 8 maximally supersymmetric gravity (mSUGRA) scattering amplitudes in D = 4 spacetime dimensions in novel ways. After a brief introduction and overview in Ch. 1, the various techniques used to construct amplitudes in the remainder of the dissertation are discussed in Ch. 2. This includes several new concepts such as d log and pure integrand bases, as well as how to construct the amplitude using exactly one kinematic point where it vanishes. Also included in this chapter is an outline of the Mathematica package on shell diagrams and numerics.m (osdn) that was developed for the computations herein. The rest of the dissertation is devoted to explicit examples. In Ch. 3, the starting point is tree-level sYM amplitudes that have integral representations with residues that obey amplitude relations. These residues are shown to have corresponding residue numerators that allow a double copy prescription that results in mSUGRA residues. In Ch. 4, the two-loop four-point sYM amplitude is constructed in several ways, showcasing many of the techniques of Ch. 2; this includes an example of how to use osdn. The two-loop five-point amplitude is also presented in a pure integrand representation with comments on how it was constructed from one homogeneous cut of the amplitude. On-going work on the two-loop n-point amplitude is presented at the end of Ch. 4. In Ch. 5, the three-loop four-point amplitude is presented in the d log representation and in the pure integrand representation. In Ch. 6, there are several examples of four- through seven-loop planar diagrams that illustrate how considerations of the singularity structure of the amplitude underpin dual-conformal invariance. Taken with the previous examples, this is additional evidence that the structure known to exist in the planar sector extends to the full theory. At the end of this chapter is a proof that all mSUGRA amplitudes have a pole at
A Revenue Maximization Approach for Provisioning Services in Clouds
Li Pan
2015-01-01
Full Text Available With the increased reliability, security, and reduced cost of cloud services, more and more users are attracted to having their jobs and applications outsourced into IAAS data centers. For a cloud provider, deciding how to provision services to clients is far from trivial. The objective of this decision is maximizing the provider’s revenue, while fulfilling its IAAS resource constraints. The above problem is defined as IAAS cloud provider revenue maximization (ICPRM problem in this paper. We formulate a service provision approach to help a cloud provider to determine which combination of clients to admit and in what Quality-of-Service (QoS levels and to maximize provider’s revenue given its available resources. We show that the overall problem is a nondeterministic polynomial- (NP- hard one and develop metaheuristic solutions based on the genetic algorithm to achieve revenue maximization. The experimental simulations and numerical results show that the proposed approach is both effective and efficient in solving ICPRM problems.
Statistical mechanics of influence maximization with thermal noise
Lynn, Christopher W.; Lee, Daniel D.
2017-03-01
The problem of optimally distributing a budget of influence among individuals in a social network, known as influence maximization, has typically been studied in the context of contagion models and deterministic processes, which fail to capture stochastic interactions inherent in real-world settings. Here, we show that by introducing thermal noise into influence models, the dynamics exactly resemble spins in a heterogeneous Ising system. In this way, influence maximization in the presence of thermal noise has a natural physical interpretation as maximizing the magnetization of an Ising system given a budget of external magnetic field. Using this statistical mechanical formulation, we demonstrate analytically that for small external-field budgets, the optimal influence solutions exhibit a highly non-trivial temperature dependence, focusing on high-degree hub nodes at high temperatures and on easily influenced peripheral nodes at low temperatures. For the general problem, we present a projected gradient ascent algorithm that uses the magnetic susceptibility to calculate locally optimal external-field distributions. We apply our algorithm to synthetic and real-world networks, demonstrating that our analytic results generalize qualitatively. Our work establishes a fruitful connection with statistical mechanics and demonstrates that influence maximization depends crucially on the temperature of the system, a fact that has not been appreciated by existing research.
Are all maximally entangled states pure?
Cavalcanti, D; Terra-Cunha, M O
2005-01-01
In this Letter we study if all maximally entangled states are pure through several entanglement monotones. Our conclusions allow us to generalize the idea of monogamy of entanglement. Then we propose a polygamy of entanglement, which express that if a general multipartite state is maximally entangled it is necessarily factorized by any other system.
Sampling and Representation Complexity of Revenue Maximization
Dughmi, Shaddin; Han, Li; Nisan, Noam
2014-01-01
We consider (approximate) revenue maximization in auctions where the distribution on input valuations is given via "black box" access to samples from the distribution. We observe that the number of samples required -- the sample complexity -- is tightly related to the representation complexity of an approximately revenue-maximizing auction. Our main results are upper bounds and an exponential lower bound on these complexities.
Lisonek, Petr
1996-01-01
our classifications confirmthe maximality of previously known sets, the results in E^7 and E^8are new. Their counterpart in dimension larger than 10is a set of unit vectors with only two values of inner products in the Lorentz space R^{d,1}.The maximality of this set again follows from a bound due...
An ethical justification of profit maximization
Koch, Carsten Allan
2010-01-01
In much of the literature on business ethics and corporate social responsibility, it is more or less taken for granted that attempts to maximize profits are inherently unethical. The purpose of this paper is to investigate whether an ethical argument can be given in support of profit maximizing b...
Alternative trailer configurations for maximizing payloads
Jason D. Thompson; Dana Mitchell; John Klepac
2017-01-01
In order for harvesting contractors to stay ahead of increasing costs, it is imperative that they employ all options to maximize productivity and efficiency. Transportation can account for half the cost to deliver wood to a mill. Contractors seek to maximize truck payload to increase productivity. The Forest Operations Research Unit, Southern Research Station, USDA...
Cohomology of Weakly Reducible Maximal Triangular Algebras
董浙; 鲁世杰
2000-01-01
In this paper, we introduce the concept of weakly reducible maximal triangular algebras φwhich form a large class of maximal triangular algebras. Let B be a weakly closed algebra containing 5φ, we prove that the cohomology spaces Hn(φ, B) (n≥1) are trivial.
Inclusive fitness maximization: An axiomatic approach.
Okasha, Samir; Weymark, John A; Bossert, Walter
2014-06-07
Kin selection theorists argue that evolution in social contexts will lead organisms to behave as if maximizing their inclusive, as opposed to personal, fitness. The inclusive fitness concept allows biologists to treat organisms as akin to rational agents seeking to maximize a utility function. Here we develop this idea and place it on a firm footing by employing a standard decision-theoretic methodology. We show how the principle of inclusive fitness maximization and a related principle of quasi-inclusive fitness maximization can be derived from axioms on an individual׳s 'as if preferences' (binary choices) for the case in which phenotypic effects are additive. Our results help integrate evolutionary theory and rational choice theory, help draw out the behavioural implications of inclusive fitness maximization, and point to a possible way in which evolution could lead organisms to implement it. Copyright © 2014 Elsevier Ltd. All rights reserved.
Maximal Hypersurfaces in Spacetimes with Translational Symmetry
Bulawa, Andrew
2016-01-01
We consider four-dimensional vacuum spacetimes which admit a free isometric spacelike R-action. Taking a quotient with respect to the R-action produces a three-dimensional quotient spacetime. We establish several results regarding maximal hypersurfaces (spacelike hypersurfaces of zero mean curvature) in quotient spacetimes. First, we show that complete noncompact maximal hypersurfaces must either be flat cylinders S^1 x R or conformal to the Euclidean plane. Second, we establish a positive mass theorem for certain maximal hypersurfaces. Finally, while it is meaningful to use a bounded lapse when adopting the maximal hypersurface gauge condition in the four-dimensional (asymptotically flat) setting, it is shown here that nontrivial quotient spacetimes admit the maximal hypersurface gauge only with an unbounded lapse.
Dynamics of hydrogen-like atom bounded by maximal acceleration
Friedman, Yaakov
2012-01-01
The existence of a maximal acceleration for massive objects was conjectured by Caianiello 30 years ago based on the Heisenberg uncertainty relations. Many consequences of this hypothesis have been studied, but until now, there has been no evidence that boundedness of the acceleration may lead to quantum behavior. In previous research, we predicted the existence of a universal maximal acceleration and developed a new dynamics for which all admissible solutions have an acceleration bounded by the maximal one. Based on W. K\\"{u}ndig's experiment, as reanalyzed by Kholmetskii et al, we estimated its value to be of the order $10^{19}m/s^2$. We present here a solution of our dynamical equation for a classical hydrogen-like atom and show that this dynamics leads to some aspects of quantum behavior. We show that the position of an electron in a hydrogen-like atom can be described only probabilistically. We also show that in this model, the notion of "center of mass" must be modified. This modification supports the no...
Maximally entangled mixed states for qubit-qutrit systems
Mendonça, Paulo E. M. F.; Marchiolli, Marcelo A.; Hedemann, Samuel R.
2017-02-01
We consider the problems of maximizing the entanglement negativity of X-form qubit-qutrit density matrices with (i) a fixed spectrum and (ii) a fixed purity. In the first case, the problem is solved in full generality whereas, in the latter, partial solutions are obtained by imposing extra spectral constraints such as rank deficiency and degeneracy, which enable a semidefinite programming treatment for the optimization problem at hand. Despite the technically motivated assumptions, we provide strong numerical evidence that threefold degenerate X states of purity P reach the highest entanglement negativity accessible to arbitrary qubit-qutrit density matrices of the same purity, hence characterizing a sparse family of likely qubit-qutrit maximally entangled mixed states.
Maximizing Cloud Providers Revenues via Energy Aware Allocation Policies
Mazzucco, Michele; Deters, Ralph
2011-01-01
Cloud providers, like Amazon, offer their data centers' computational and storage capacities for lease to paying customers. High electricity consumption, associated with running a data center, not only reflects on its carbon footprint, but also increases the costs of running the data center itself. This paper addresses the problem of maximizing the revenues of Cloud providers by trimming down their electricity costs. As a solution allocation policies which are based on the dynamic powering servers on and off are introduced and evaluated. The policies aim at satisfying the conflicting goals of maximizing the users' experience while minimizing the amount of consumed electricity. The results of numerical experiments and simulations are described, showing that the proposed scheme performs well under different traffic conditions.
Maximal Dissipation and Well-posedness for the Compressible Euler System
Feireisl, Eduard
2014-09-01
We discuss the problem of well-posedness of the compressible (barotropic) Euler system in the framework of weak solutions. The principle of maximal dissipation introduced by C.M. Dafermos is adapted and combined with the concept of admissible weak solutions. We use the method of convex integration in the spirit of the recent work of C.DeLellis and L.Székelyhidi to show various counterexamples to well-posedness. On the other hand, we conjecture that the principle of maximal dissipation should be retained as a possible criterion of uniqueness as it is violated by the oscillatory solutions obtained in the process of convex integration.
Jois, Manjunath Holaykoppa Nanjunda
The conventional Influence Maximization problem is the problem of finding such a team (a small subset) of seed nodes in a social network that would maximize the spread of influence over the whole network. This paper considers a lottery system aimed at maximizing the awareness spread to promote energy conservation behavior as a stochastic Influence Maximization problem with the constraints ensuring lottery fairness. The resulting Multi-Team Influence Maximization problem involves assigning the probabilities to multiple teams of seeds (interpreted as lottery winners) to maximize the expected awareness spread. Such a variation of the Influence Maximization problem is modeled as a Linear Program; however, enumerating all the possible teams is a hard task considering that the feasible team count grows exponentially with the network size. In order to address this challenge, we develop a column generation based approach to solve the problem with a limited number of candidate teams, where new candidates are generated and added to the problem iteratively. We adopt a piecewise linear function to model the impact of including a new team so as to pick only such teams which can improve the existing solution. We demonstrate that with this approach we can solve such influence maximization problems to optimality, and perform computational study with real-world social network data sets to showcase the efficiency of the approach in finding lottery designs for optimal awareness spread. Lastly, we explore other possible scenarios where this model can be utilized to optimally solve the otherwise hard to solve influence maximization problems.
Radially Symmetric Solutions of
William C. Troy
2012-01-01
Full Text Available We investigate solutions of and focus on the regime and . Our advance is to develop a technique to efficiently classify the behavior of solutions on , their maximal positive interval of existence. Our approach is to transform the nonautonomous equation into an autonomous ODE. This reduces the problem to analyzing the phase plane of the autonomous equation. We prove the existence of new families of solutions of the equation and describe their asymptotic behavior. In the subcritical case there is a well-known closed-form singular solution, , such that as and as . Our advance is to prove the existence of a family of solutions of the subcritical case which satisfies for infinitely many values . At the critical value there is a continuum of positive singular solutions, and a continuum of sign changing singular solutions. In the supercritical regime we prove the existence of a family of “super singular” sign changing singular solutions.
Are all maximally entangled states pure?
Cavalcanti, D.; Brandão, F. G. S. L.; Terra Cunha, M. O.
2005-10-01
We study if all maximally entangled states are pure through several entanglement monotones. In the bipartite case, we find that the same conditions which lead to the uniqueness of the entropy of entanglement as a measure of entanglement exclude the existence of maximally mixed entangled states. In the multipartite scenario, our conclusions allow us to generalize the idea of the monogamy of entanglement: we establish the polygamy of entanglement, expressing that if a general state is maximally entangled with respect to some kind of multipartite entanglement, then it is necessarily factorized of any other system.
An ethical justification of profit maximization
Koch, Carsten Allan
2010-01-01
In much of the literature on business ethics and corporate social responsibility, it is more or less taken for granted that attempts to maximize profits are inherently unethical. The purpose of this paper is to investigate whether an ethical argument can be given in support of profit maximizing...... behaviour. It is argued that some form of consequential ethics must be applied, and that both profit seeking and profit maximization can be defended from a rule-consequential point of view. It is noted, however, that the result does not apply unconditionally, but requires that certain form of profit (and...
HEALTH INSURANCE: CONTRIBUTIONS AND REIMBURSEMENT MAXIMAL
HR Division
2000-01-01
Affected by both the salary adjustment index on 1.1.2000 and the evolution of the staff members and fellows population, the average reference salary, which is used as an index for fixed contributions and reimbursement maximal, has changed significantly. An adjustment of the amounts of the reimbursement maximal and the fixed contributions is therefore necessary, as from 1 January 2000.Reimbursement maximalThe revised reimbursement maximal will appear on the leaflet summarising the benefits for the year 2000, which will soon be available from the divisional secretariats and from the AUSTRIA office at CERN.Fixed contributionsThe fixed contributions, applicable to some categories of voluntarily insured persons, are set as follows (amounts in CHF for monthly contributions):voluntarily insured member of the personnel, with complete coverage:815,- (was 803,- in 1999)voluntarily insured member of the personnel, with reduced coverage:407,- (was 402,- in 1999)voluntarily insured no longer dependent child:326,- (was 321...
Maximizing throughput by evaluating critical utilization paths
Weeda, P.J.
1991-01-01
Recently the relationship between batch structure, bottleneck machine and maximum throughput has been explored for serial, convergent and divergent process configurations consisting of two machines and three processes. In three of the seven possible configurations a multiple batch structure maximize
Relationship between maximal exercise parameters and individual ...
Relationship between maximal exercise parameters and individual time trial ... It is widely accepted that the ventilatory threshold (VT) is an important ... This study investigated whether the physiological responses during a 20km time trial (TT) ...
Simple technique for maximal thoracic muscle harvest.
Marshall, M Blair; Kaiser, Larry R; Kucharczuk, John C
2004-04-01
We present a modification of technique for standard muscle flap harvest, the placement of cutaneous traction sutures. This technique allows for maximal dissection of the thoracic muscles even through minimal incisions. Through improved exposure and traction, complete dissection of the muscle bed can be performed and the tissue obtained maximized. Because more muscle bulk is obtained with this technique, the need for a second muscle may be prevented.
MAXIMAL POINTS OF A REGULAR TRUTH FUNCTION
Every canonical linearly separable truth function is a regular function, but not every regular truth function is linearly separable. The most...promising method of determining which of the regular truth functions are linearly separable r quires finding their maximal and minimal points. In this...report is developed a quick, systematic method of finding the maximal points of any regular truth function in terms of its arithmetic invariants. (Author)
Maximal Subgroups of Skew Linear Groups
M. Mahdavi-Hezavehi
2002-01-01
Let D be an infinite division algebra of finite dimension over its centre Z(D) = F, and n a positive integer. The structure of maximal subgroups of skew linear groups are investigated. In particular, assume N is a normal subgroup of GLn(D) and M is a maximal subgroup of N containing Z(N). It is shown that if M/Z(N) is finite, then N is central.
Additive Approximation Algorithms for Modularity Maximization
Kawase, Yasushi; Matsui, Tomomi; Miyauchi, Atsushi
2016-01-01
The modularity is a quality function in community detection, which was introduced by Newman and Girvan (2004). Community detection in graphs is now often conducted through modularity maximization: given an undirected graph $G=(V,E)$, we are asked to find a partition $\\mathcal{C}$ of $V$ that maximizes the modularity. Although numerous algorithms have been developed to date, most of them have no theoretical approximation guarantee. Recently, to overcome this issue, the design of modularity max...
Maximal Frequent Itemset Generation Using Segmentation Apporach
M.Rajalakshmi
2011-09-01
Full Text Available Finding frequent itemsets in a data source is a fundamental operation behind Association Rule Mining.Generally, many algorithms use either the bottom-up or top-down approaches for finding these frequentitemsets. When the length of frequent itemsets to be found is large, the traditional algorithms find all thefrequent itemsets from 1-length to n-length, which is a difficult process. This problem can be solved bymining only the Maximal Frequent Itemsets (MFS. Maximal Frequent Itemsets are frequent itemsets whichhave no proper frequent superset. Thus, the generation of only maximal frequent itemsets reduces thenumber of itemsets and also time needed for the generation of all frequent itemsets as each maximal itemsetof length m implies the presence of 2m-2 frequent itemsets. Furthermore, mining only maximal frequentitemset is sufficient in many data mining applications like minimal key discovery and theory extraction. Inthis paper, we suggest a novel method for finding the maximal frequent itemset from huge data sourcesusing the concept of segmentation of data source and prioritization of segments. Empirical evaluationshows that this method outperforms various other known methods.
Natural selection and the maximization of fitness.
Birch, Jonathan
2016-08-01
The notion that natural selection is a process of fitness maximization gets a bad press in population genetics, yet in other areas of biology the view that organisms behave as if attempting to maximize their fitness remains widespread. Here I critically appraise the prospects for reconciliation. I first distinguish four varieties of fitness maximization. I then examine two recent developments that may appear to vindicate at least one of these varieties. The first is the 'new' interpretation of Fisher's fundamental theorem of natural selection, on which the theorem is exactly true for any evolving population that satisfies some minimal assumptions. The second is the Formal Darwinism project, which forges links between gene frequency change and optimal strategy choice. In both cases, I argue that the results fail to establish a biologically significant maximization principle. I conclude that it may be a mistake to look for universal maximization principles justified by theory alone. A more promising approach may be to find maximization principles that apply conditionally and to show that the conditions were satisfied in the evolution of particular traits.
Maximizing the Spread of Cascades Using Network Design
Sheldon, Daniel; Elmachtoub, Adam N; Finseth, Ryan; Sabharwal, Ashish; Conrad, Jon; Gomes, Carla P; Shmoys, David; Allen, William; Amundsen, Ole; Vaughan, William
2012-01-01
We introduce a new optimization framework to maximize the expected spread of cascades in networks. Our model allows a rich set of actions that directly manipulate cascade dy- namics by adding nodes or edges to the net- work. Our motivating application is one in spatial conservation planning, where a cas- cade models the dispersal of wild animals through a fragmented landscape. We propose a mixed integer programming (MIP) formu- lation that combines elements from network design and stochastic optimization. Our ap- proach results in solutions with stochastic op- timality guarantees and points to conserva- tion strategies that are fundamentally dier- ent from naive approaches.
Improved Algorithms OF CELF and CELF++ for Influence Maximization
Jiaguo Lv
2014-06-01
Full Text Available Motivated by the wide application in some fields, such as viral marketing, sales promotion etc, influence maximization has been the most important and extensively studied problem in social network. However, the most classical KK-Greedy algorithm for influence maximization is inefficient. Two major sources of the algorithm’s inefficiency were analyzed in this paper. With the analysis of algorithms CELF and CELF++, all nodes in the influenced set of u would never bring any marginal gain when a new seed u was produced. Through this optimization strategy, a lot of redundant nodes will be removed from the candidate nodes. Basing on the strategy, two improved algorithms of Lv_CELF and Lv_CELF++ were proposed in this study. To evaluate the two algorithms, the two algorithms with their benchmark algorithms of CELF and CELF++ were conducted on some real world datasets. To estimate the algorithms, influence degree and running time were employed to measure the performance and efficiency respectively. Experimental results showed that, compared with benchmark algorithms of CELF and CELF++, matching effects and higher efficiency were achieved by the new algorithms Lv_CELF and Lv_CELF++. Solutions with the proposed optimization strategy can be useful for the decisionmaking problems under the scenarios related to the influence maximization problem.
Welfare-maximizing and revenue-maximizing tariffs with a few domestic firms
Bruno Larue; Jean-Philippe Gervais
2002-01-01
In this paper we compare the orthodox optimal tariff formula with the appropriate welfare-maximizing tariff when there are a few producing or importing firms. The welfare-maximizing tariff can be very low, voire negative in some cases, while in others it can even exceed the maximum-revenue tariff. The relationship between the welfare-maximizing tariff and the number of firms need not be monotonically increasing, because the tariff is not strictly used to internalize terms of trade externality...
Maximizing Complementary Quantities by Projective Measurements
M. Souza, Leonardo A.; Bernardes, Nadja K.; Rossi, Romeu
2017-04-01
In this work, we study the so-called quantitative complementarity quantities. We focus in the following physical situation: two qubits ( q A and q B ) are initially in a maximally entangled state. One of them ( q B ) interacts with a N-qubit system ( R). After the interaction, projective measurements are performed on each of the qubits of R, in a basis that is chosen after independent optimization procedures: maximization of the visibility, the concurrence, and the predictability. For a specific maximization procedure, we study in detail how each of the complementary quantities behave, conditioned on the intensity of the coupling between q B and the N qubits. We show that, if the coupling is sufficiently "strong," independent of the maximization procedure, the concurrence tends to decay quickly. Interestingly enough, the behavior of the concurrence in this model is similar to the entanglement dynamics of a two qubit system subjected to a thermal reservoir, despite that we consider finite N. However, the visibility shows a different behavior: its maximization is more efficient for stronger coupling constants. Moreover, we investigate how the distinguishability, or the information stored in different parts of the system, is distributed for different couplings.
Multiple Sink Positioning and Routing to Maximize the Lifetime of Sensor Networks
Kim, Haeyong; Kwon, Taekyoung; Mah, Pyeongsoo
In wireless sensor networks, the sensor nodes collect data, which are routed to a sink node. Most of the existing proposals address the routing problem to maximize network lifetime in the case of a single sink node. In this paper, we extend this problem into the case of multiple sink nodes. To maximize network lifetime, we consider the two problems: (i) how to position multiple sink nodes in the area, and (ii) how to route traffic flows from sensor nodes to sink nodes. In this paper, the solutions to these problems are formulated into a Mixed Integer Linear Programming (MILP) model. However, it is computationally difficult to solve the MILP formulation as the size of sensor network grows because MILP is NP-hard. Thus, we propose a heuristic algorithm, which produces a solution in polynomial time. From our experiments, we found out that the proposed heuristic algorithm provides a near-optimal solution for maximizing network lifetime in dense sensor networks.
The performance of modularity maximization in practical contexts
Good, Benjamin H; Clauset, Aaron
2009-01-01
Although widely used in practice, the behavior and accuracy of the popular module identification technique called modularity maximization is not well understood. Here, we present a broad and systematic characterization of its performance in practical situations. First, we generalize and clarify the recently identified resolution limit phenomenon. Second, we show that the modularity function Q exhibits extreme degeneracies: that is, the modularity landscape admits an exponential number of distinct high-scoring solutions and does not typically exhibit a clear global maximum. Third, we derive the limiting behavior of the maximum modularity Q_max for infinitely modular networks, showing that it depends strongly on the size of the network and the number of module-like subgraphs it contains. Finally, using three real-world examples of metabolic networks, we show that the degenerate solutions can fundamentally disagree on the composition of even the largest modules. Together, these results significantly extend and c...
Bayesian tracking of multiple point targets using expectation maximization
Selvan, Raghavendra
The range of applications where target tracking is useful has grown well beyond the classical military and radar-based tracking applications. With the increasing enthusiasm in autonomous solutions for vehicular and robotics navigation, much of the maneuverability can be provided based on solutions...... the measurements from sensors to choose the best data association hypothesis, from which the estimates of target trajectories can be obtained. In an ideal world, we could maintain all possible data association hypotheses from observing all measurements, and pick the best hypothesis. But, it turns out the number...... joint density is maximized over the data association variables, or over the target state variables, two EM-based algorithms for tracking multiple point targets are derived, implemented and evaluated. In the first algorithm, the data association variable is integrated out, and the target states...
Quantum theory allows for absolute maximal contextuality
Amaral, Barbara; Cunha, Marcelo Terra; Cabello, Adán
2015-12-01
Contextuality is a fundamental feature of quantum theory and a necessary resource for quantum computation and communication. It is therefore important to investigate how large contextuality can be in quantum theory. Linear contextuality witnesses can be expressed as a sum S of n probabilities, and the independence number α and the Tsirelson-like number ϑ of the corresponding exclusivity graph are, respectively, the maximum of S for noncontextual theories and for the theory under consideration. A theory allows for absolute maximal contextuality if it has scenarios in which ϑ /α approaches n . Here we show that quantum theory allows for absolute maximal contextuality despite what is suggested by the examination of the quantum violations of Bell and noncontextuality inequalities considered in the past. Our proof is not constructive and does not single out explicit scenarios. Nevertheless, we identify scenarios in which quantum theory allows for almost-absolute-maximal contextuality.
The maximal process of nonlinear shot noise
Eliazar, Iddo; Klafter, Joseph
2009-05-01
In the nonlinear shot noise system-model shots’ statistics are governed by general Poisson processes, and shots’ decay-dynamics are governed by general nonlinear differential equations. In this research we consider a nonlinear shot noise system and explore the process tracking, along time, the system’s maximal shot magnitude. This ‘maximal process’ is a stationary Markov process following a decay-surge evolution; it is highly robust, and it is capable of displaying both a wide spectrum of statistical behaviors and a rich variety of random decay-surge sample-path trajectories. A comprehensive analysis of the maximal process is conducted, including its Markovian structure, its decay-surge structure, and its correlation structure. All results are obtained analytically and in closed-form.
Energy Band Calculations for Maximally Even Superlattices
Krantz, Richard; Byrd, Jason
2007-03-01
Superlattices are multiple-well, semiconductor heterostructures that can be described by one-dimensional potential wells separated by potential barriers. We refer to a distribution of wells and barriers based on the theory of maximally even sets as a maximally even superlattice. The prototypical example of a maximally even set is the distribution of white and black keys on a piano keyboard. Black keys may represent wells and the white keys represent barriers. As the number of wells and barriers increase, efficient and stable methods of calculation are necessary to study these structures. We have implemented a finite-element method using the discrete variable representation (FE-DVR) to calculate E versus k for these superlattices. Use of the FE-DVR method greatly reduces the amount of calculation necessary for the eigenvalue problem.
Absence of parasympathetic reactivation after maximal exercise.
de Oliveira, Tiago Peçanha; de Alvarenga Mattos, Raphael; da Silva, Rhenan Bartels Ferreira; Rezende, Rafael Andrade; de Lima, Jorge Roberto Perrout
2013-03-01
The ability of the human organism to recover its autonomic balance soon after physical exercise cessation has an important impact on the individual's health status. Although the dynamics of heart rate recovery after maximal exercise has been studied, little is known about heart rate variability after this type of exercise. The aim of this study is to analyse the dynamics of heart rate and heart rate variability recovery after maximal exercise in healthy young men. Fifteen healthy male subjects (21·7 ± 3·4 years; 24·0 ± 2·1 kg m(-2) ) participated in the study. The experimental protocol consisted of an incremental maximal exercise test on a cycle ergometer, until maximal voluntary exhaustion. After the test, recovery R-R intervals were recorded for 5 min. From the absolute differences between peak heart rate values and the heart rate values at 1 and 5 min of the recovery, the heart rate recovery was calculated. Postexercise heart rate variability was analysed from calculations of the SDNN and RMSSD indexes, in 30-s windows (SDNN(30s) and RMSSD(30s) ) throughout recovery. One and 5 min after maximal exercise cessation, the heart rate recovered 34·7 (±6·6) and 75·5 (±6·1) bpm, respectively. With regard to HRV recovery, while the SDNN(30s) index had a slight increase, RMSSD(30s) index remained totally suppressed throughout the recovery, suggesting an absence of vagal modulation reactivation and, possibly, a discrete sympathetic withdrawal. Therefore, it is possible that the main mechanism associated with the fall of HR after maximal exercise is sympathetic withdrawal or a vagal tone restoration without vagal modulation recovery. © 2012 The Authors Clinical Physiology and Functional Imaging © 2012 Scandinavian Society of Clinical Physiology and Nuclear Medicine.
Maximizing band gaps in plate structures
Halkjær, Søren; Sigmund, Ole; Jensen, Jakob Søndergaard
2006-01-01
Band gaps, i.e., frequency ranges in which waves cannot propagate, can be found in elastic structures for which there is a certain periodic modulation of the material properties or structure. In this paper, we maximize the band gap size for bending waves in a Mindlin plate. We analyze an infinite...... periodic plate using Bloch theory, which conveniently reduces the maximization problem to that of a single base cell. Secondly, we construct a finite periodic plate using a number of the optimized base cells in a postprocessed version. The dynamic properties of the finite plate are investigated...
Maximal and Minimal Congruences on Some Semigroups
Jintana SANWONG; Boorapa SINGHA; R.P.SULLIVAN
2009-01-01
In 2006,Sanwong and Sullivan described the maximal congruences on the semigroup N consisting of all non-negative integers under standard multiplication,and on the semigroup T(X) consisting of all total transformations of an infinite set X under composition. Here,we determine all maximal congruences on the semigroup Zn under multiplication modulo n. And,when Y X,we do the same for the semigroup T(X,Y) consisting of all elements of T(X) whose range is contained in Y. We also characterise the minimal congruences on T(X,Y).
Maximizing oil yields may not optimize economics
1987-03-01
The Los Alamos National Laboratory has used the ASPEN computer code to calculate the economics of different hydroretorting conditions. When the oil yield was maximized and a oil shale plant designed around this process, the costs turned out much higher than expected. However, calculations based on runs of less than maximum yields showed lower cost estimates. It is recommended that future efforts should be concentrated on minimizing production costs rather than maximizing yields. An oil shale plant has been designed around minimum production cost, but has not been able to be tested experimentally.
Maximal Inequalities for Dependent Random Variables
Hoffmann-Jorgensen, Jorgen
2016-01-01
Maximal inequalities play a crucial role in many probabilistic limit theorem; for instance, the law of large numbers, the law of the iterated logarithm, the martingale limit theorem and the central limit theorem. Let X-1, X-2,... be random variables with partial sums S-k = X-1 + ... + X-k. Then a......Maximal inequalities play a crucial role in many probabilistic limit theorem; for instance, the law of large numbers, the law of the iterated logarithm, the martingale limit theorem and the central limit theorem. Let X-1, X-2,... be random variables with partial sums S-k = X-1 + ... + X...
Singularity Structure of Maximally Supersymmetric Scattering Amplitudes
Arkani-Hamed, Nima; Bourjaily, Jacob L.; Cachazo, Freddy
2014-01-01
We present evidence that loop amplitudes in maximally supersymmetric (N=4) Yang-Mills theory (SYM) beyond the planar limit share some of the remarkable structures of the planar theory. In particular, we show that through two loops, the four-particle amplitude in full N=4 SYM has only logarithmic ...... singularities and is free of any poles at infinity—properties closely related to uniform transcendentality and the UV finiteness of the theory. We also briefly comment on implications for maximal (N=8) supergravity theory (SUGRA)....
Maximal dissipation and well-posedness for the compressible Euler system
Feireisl, Eduard
2014-01-01
We discuss the problem of well-posedness of the compressible (barotropic) Euler system in the framework of weak solutions. The principle of maximal dissipation introduced by C.M. Dafermos is adapted and combined with the concept of admissible weak solutions. We use the method of convex integration in the spirit of the recent work of C.DeLellis and L.Sz´ekelyhidi to show various counterexamples to well-posedness. On the other hand, we conjecture that the principle of maximal dissipation should...
Wireless multi-hop network scenario emulation by controlling maximal error
Huizhou ZHAO; Xiaoming LI; Wei YAN
2009-01-01
A fundamental problem about Ad-hoc network emulation is how to emulate a wireless multi-hop network scenario in a fixed testbed, which, however, is scarcely discussed in depth by existing radio frequency (RF)control wireless network emulators. Therefore, in this article, we first formulate the wireless multi-hop scenario emulation problem based on RF-control, take controlling the maximal error as the solution mentality, and present an algorithm called the matching exact-solution condition algorithm. The experiment results show that the algorithm can solve the wireless multi-hop network scenario emulation problem and maximal error can be achieved.
Cycle-maximal triangle-free graphs
Durocher, Stephane; Gunderson, David S.; Li, Pak Ching;
2015-01-01
Abstract We conjecture that the balanced complete bipartite graph K ⌊ n / 2 ⌋ , ⌈ n / 2 ⌉ contains more cycles than any other n -vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds...
Gradient dynamics and entropy production maximization
Janečka, Adam
2016-01-01
Gradient dynamics describes irreversible evolution by means of a dissipation potential, which leads to several advantageous features like Maxwell--Onsager relations, distinguishing between thermodynamic forces and fluxes or geometrical interpretation of the dynamics. Entropy production maximization is a powerful tool for predicting constitutive relations in engineering. In this paper, both approaches are compared and their shortcomings and advantages are discussed.
Robust Utility Maximization Under Convex Portfolio Constraints
Matoussi, Anis, E-mail: anis.matoussi@univ-lemans.fr [Université du Maine, Risk and Insurance institut of Le Mans Laboratoire Manceau de Mathématiques (France); Mezghani, Hanen, E-mail: hanen.mezghani@lamsin.rnu.tn; Mnif, Mohamed, E-mail: mohamed.mnif@enit.rnu.tn [University of Tunis El Manar, Laboratoire de Modélisation Mathématique et Numérique dans les Sciences de l’Ingénieur, ENIT (Tunisia)
2015-04-15
We study a robust maximization problem from terminal wealth and consumption under a convex constraints on the portfolio. We state the existence and the uniqueness of the consumption–investment strategy by studying the associated quadratic backward stochastic differential equation. We characterize the optimal control by using the duality method and deriving a dynamic maximum principle.
Maximizing the Motivated Mind for Emergent Giftedness.
Rea, Dan
2001-01-01
This article explains how the theory of the motivated mind conceptualizes the productive interaction of intelligence, creativity, and achievement motivation and how this theory can help educators to maximize students' emergent potential for giftedness. It discusses the integration of cold-order thinking and hot-chaotic thinking into fluid-adaptive…
The Winning Edge: Maximizing Success in College.
Schmitt, David E.
This book offers college students ideas on how to maximize their success in college by examining the personal management techniques a student needs to succeed. Chapters are as follows: "Getting and Staying Motivated"; "Setting Goals and Tapping Your Resources"; "Conquering Time"; "Think Yourself to College Success"; "Understanding and Remembering…
MAXIMAL ELEMENTS AND EQUILIBRIUM OF ABSTRACT ECONOMY
刘心歌; 蔡海涛
2001-01-01
An existence theorem of maximal elements for a new type of preference correspondences which are Qθ-majorized is given. Then some existence theorems of equilibrium for abstract economy and qualitative game in which the constraint or preference correspondences are Qθ-majorized are obtained in locally convex topological vector spaces.
Maximal workload capacity on moving platforms
Heus, R.; Wertheim, A.H.
1996-01-01
Physical tasks on a moving platform required more energy than the same tasks on a non-moving platform. In this study the maximum aerobic performance (defined as V_O2max) of people working on a moving floor was established compared to the maximal aerobic performance on a non-moving floor. The main
Maximal workload capacity on moving platforms
Heus, R.; Wertheim, A.H.
1996-01-01
Physical tasks on a moving platform required more energy than the same tasks on a non-moving platform. In this study the maximum aerobic performance (defined as V_O2max) of people working on a moving floor was established compared to the maximal aerobic performance on a non-moving floor. The main qu
Maximizing Resource Utilization in Video Streaming Systems
Alsmirat, Mohammad Abdullah
2013-01-01
Video streaming has recently grown dramatically in popularity over the Internet, Cable TV, and wire-less networks. Because of the resource demanding nature of video streaming applications, maximizing resource utilization in any video streaming system is a key factor to increase the scalability and decrease the cost of the system. Resources to…
Maximizing throughput in an automated test system
朱君
2007-01-01
@@ Overview This guide is collection of whitepapers designed to help you develop test systems that lower your cost, increase your test throughput, and can scale with future requirements. This whitepaper provides strategies for maximizing system throughput. To download the complete developers guide (120 pages), visit ni. com/automatedtest.
The gaugings of maximal D=6 supergravity
Bergshoeff, E.; Samtleben, H.; Sezgin, E.
2008-01-01
We construct the most general gaugings of the maximal D = 6 supergravity. The theory is ( 2, 2) supersymmetric, and possesses an on-shell SO( 5, 5) duality symmetry which plays a key role in determining its couplings. The field content includes 16 vector fields that carry a chiral spinor representat
WEIGHTED BOUNDEDNESS OF A ROUGH MAXIMAL OPERATOR
无
2000-01-01
In this note the authors give the weighted Lp-boundedness fora class of maximal singular integral operators with rough kernel.The result in this note is an improvement and extension ofthe result obtained by Chen and Lin in 1990.
Ehrenfest's Lottery--Time and Entropy Maximization
Ashbaugh, Henry S.
2010-01-01
Successful teaching of the Second Law of Thermodynamics suffers from limited simple examples linking equilibrium to entropy maximization. I describe a thought experiment connecting entropy to a lottery that mixes marbles amongst a collection of urns. This mixing obeys diffusion-like dynamics. Equilibrium is achieved when the marble distribution is…
Testing maximality in muon neutrino flavor mixing
Choubey, S; Choubey, Sandhya; Roy, Probir
2003-01-01
The small difference between the survival probabilities of muon neutrino and antineutrino beams, traveling through earth matter in a long baseline experiment such as MINOS, is shown to be an important measure of any possible deviation from maximality in the flavor mixing of those states.
Average utility maximization: A preference foundation
A.V. Kothiyal (Amit); V. Spinu (Vitalie); P.P. Wakker (Peter)
2014-01-01
textabstractThis paper provides necessary and sufficient preference conditions for average utility maximization over sequences of variable length. We obtain full generality by using a new algebraic technique that exploits the richness structure naturally provided by the variable length of the sequen
On the Hardy-Littlewood maximal theorem
Shinji Yamashita
1982-01-01
Full Text Available The Hardy-Littlewood maximal theorem is extended to functions of class PL in the sense of E. F. Beckenbach and T. Radó, with a more precise expression of the absolute constant in the inequality. As applications we deduce some results on hyperbolic Hardy classes in terms of the non-Euclidean hyperbolic distance in the unit disk.
Maximal Cartel Pricing and Leniency Programs
Houba, H.E.D.; Motchenkova, E.; Wen, Q.
2008-01-01
For a general class of oligopoly models with price competition, we analyze the impact of ex-ante leniency programs in antitrust regulation on the endogenous maximal-sustainable cartel price. This impact depends upon industry characteristics including its cartel culture. Our analysis disentangles the
How to Generate Good Profit Maximization Problems
Davis, Lewis
2014-01-01
In this article, the author considers the merits of two classes of profit maximization problems: those involving perfectly competitive firms with quadratic and cubic cost functions. While relatively easy to develop and solve, problems based on quadratic cost functions are too simple to address a number of important issues, such as the use of…
Ehrenfest's Lottery--Time and Entropy Maximization
Ashbaugh, Henry S.
2010-01-01
Successful teaching of the Second Law of Thermodynamics suffers from limited simple examples linking equilibrium to entropy maximization. I describe a thought experiment connecting entropy to a lottery that mixes marbles amongst a collection of urns. This mixing obeys diffusion-like dynamics. Equilibrium is achieved when the marble distribution is…
Maximally entangled mixed states made easy
Aiello, A; Voigt, D; Woerdman, J P
2006-01-01
We show that, contrarily to a recent claim [M. Ziman and V. Bu\\v{z}ek, Phys. Rev. A. \\textbf{72}, 052325 (2005)], it is possible to achieve maximally entangled mixed states of two qubits from the singlet state via the action of local nonunital quantum channels. Moreover, we present a simple, feasible linear optical implementation of one of such channels.
Maximizing Resource Utilization in Video Streaming Systems
Alsmirat, Mohammad Abdullah
2013-01-01
Video streaming has recently grown dramatically in popularity over the Internet, Cable TV, and wire-less networks. Because of the resource demanding nature of video streaming applications, maximizing resource utilization in any video streaming system is a key factor to increase the scalability and decrease the cost of the system. Resources to…
Maximizing scientific knowledge from randomized clinical trials
Gustafsson, Finn; Atar, Dan; Pitt, Bertram
2010-01-01
Trialists have an ethical and financial responsibility to plan and conduct clinical trials in a manner that will maximize the scientific knowledge gained from the trial. However, the amount of scientific information generated by randomized clinical trials in cardiovascular medicine is highly...
Maximal Heat Generation in Nanoscale Systems
ZHOU Li-Ling; LI Shu-Shen; ZENG Zhao-Yang
2009-01-01
We investigate the heat generation in a nanoscale system coupled to normal leads and find that it is maximal when the average occupation of the electrons in the nanoscale system is 0.5,no matter what mechanism induces the heat generation.
Understanding violations of Gricean maxims in preschoolers and adults.
Okanda, Mako; Asada, Kosuke; Moriguchi, Yusuke; Itakura, Shoji
2015-01-01
This study used a revised Conversational Violations Test to examine Gricean maxim violations in 4- to 6-year-old Japanese children and adults. Participants' understanding of the following maxims was assessed: be informative (first maxim of quantity), avoid redundancy (second maxim of quantity), be truthful (maxim of quality), be relevant (maxim of relation), avoid ambiguity (second maxim of manner), and be polite (maxim of politeness). Sensitivity to violations of Gricean maxims increased with age: 4-year-olds' understanding of maxims was near chance, 5-year-olds understood some maxims (first maxim of quantity and maxims of quality, relation, and manner), and 6-year-olds and adults understood all maxims. Preschoolers acquired the maxim of relation first and had the greatest difficulty understanding the second maxim of quantity. Children and adults differed in their comprehension of the maxim of politeness. The development of the pragmatic understanding of Gricean maxims and implications for the construction of developmental tasks from early childhood to adulthood are discussed.
Understanding Violations of Gricean Maxims in Preschoolers and Adults
Mako eOkanda
2015-07-01
Full Text Available This study used a revised Conversational Violations Test to examine Gricean maxim violations in 4- to 6-year-old Japanese children and adults. Participants’ understanding of the following maxims was assessed: be informative (first maxim of quantity, avoid redundancy (second maxim of quantity, be truthful (maxim of quality, be relevant (maxim of relation, avoid ambiguity (second maxim of manner, and be polite (maxim of politeness. Sensitivity to violations of Gricean maxims increased with age: 4-year-olds’ understanding of maxims was near chance, 5-year-olds understood some maxims (first maxim of quantity and maxims of quality, relation, and manner, and 6-year-olds and adults understood all maxims. Preschoolers acquired the maxim of relation first and had the greatest difficulty understanding the second maxim of quantity. Children and adults differed in their comprehension of the maxim of politeness. The development of the pragmatic understanding of Gricean maxims and implications for the construction of developmental tasks from early childhood to adulthood are discussed.
Optimal Energy Management for a Smart Grid using Resource-Aware Utility Maximization
Abegaz, Brook W.; Mahajan, Satish M.; Negeri, Ebisa O.
2016-06-01
Heterogeneous energy prosumers are aggregated to form a smart grid based energy community managed by a central controller which could maximize their collective energy resource utilization. Using the central controller and distributed energy management systems, various mechanisms that harness the power profile of the energy community are developed for optimal, multi-objective energy management. The proposed mechanisms include resource-aware, multi-variable energy utility maximization objectives, namely: (1) maximizing the net green energy utilization, (2) maximizing the prosumers' level of comfortable, high quality power usage, and (3) maximizing the economic dispatch of energy storage units that minimize the net energy cost of the energy community. Moreover, an optimal energy management solution that combines the three objectives has been implemented by developing novel techniques of optimally flexible (un)certainty projection and appliance based pricing decomposition in an IBM ILOG CPLEX studio. A real-world, per-minute data from an energy community consisting of forty prosumers in Amsterdam, Netherlands is used. Results show that each of the proposed mechanisms yields significant increases in the aggregate energy resource utilization and welfare of prosumers as compared to traditional peak-power reduction methods. Furthermore, the multi-objective, resource-aware utility maximization approach leads to an optimal energy equilibrium and provides a sustainable energy management solution as verified by the Lagrangian method. The proposed resource-aware mechanisms could directly benefit emerging energy communities in the world to attain their energy resource utilization targets.
Maximizing influence in a social network: Improved results using a genetic algorithm
Zhang, Kaiqi; Du, Haifeng; Feldman, Marcus W.
2017-07-01
The influence maximization problem focuses on finding a small subset of nodes in a social network that maximizes the spread of influence. While the greedy algorithm and some improvements to it have been applied to solve this problem, the long solution time remains a problem. Stochastic optimization algorithms, such as simulated annealing, are other choices for solving this problem, but they often become trapped in local optima. We propose a genetic algorithm to solve the influence maximization problem. Through multi-population competition, using this algorithm we achieve an optimal result while maintaining diversity of the solution. We tested our method with actual networks, and our genetic algorithm performed slightly worse than the greedy algorithm but better than other algorithms.
Maximal temperature in a simple thermodynamical system
Dai, De-Chang
2016-01-01
Temperature in a simple thermodynamical system is not limited from above. It is also widely believed that it does not make sense talking about temperatures higher than the Planck temperature in the absence of the full theory of quantum gravity. Here, we demonstrate that there exist a maximal achievable temperature in a system where particles obey the laws of quantum mechanics and classical gravity before we reach the realm of quantum gravity. Namely, if two particles with a given center of mass energy come at the distance shorter than the Schwarzschild diameter apart, according to classical gravity they will form a black hole. It is possible to calculate that a simple thermodynamical system will be dominated by black holes at a critical temperature which is about three times lower than the Planck temperature. That represents the maximal achievable temperature in a simple thermodynamical system.
Hamiltonian formalism and path entropy maximization
Davis, Sergio; González, Diego
2015-10-01
Maximization of the path information entropy is a clear prescription for constructing models in non-equilibrium statistical mechanics. Here it is shown that, following this prescription under the assumption of arbitrary instantaneous constraints on position and velocity, a Lagrangian emerges which determines the most probable trajectory. Deviations from the probability maximum can be consistently described as slices in time by a Hamiltonian, according to a nonlinear Langevin equation and its associated Fokker-Planck equation. The connections unveiled between the maximization of path entropy and the Langevin/Fokker-Planck equations imply that missing information about the phase space coordinate never decreases in time, a purely information-theoretical version of the second law of thermodynamics. All of these results are independent of any physical assumptions, and thus valid for any generalized coordinate as a function of time, or any other parameter. This reinforces the view that the second law is a fundamental property of plausible inference.
Predicting Contextual Sequences via Submodular Function Maximization
Dey, Debadeepta; Hebert, Martial; Bagnell, J Andrew
2012-01-01
Sequence optimization, where the items in a list are ordered to maximize some reward has many applications such as web advertisement placement, search, and control libraries in robotics. Previous work in sequence optimization produces a static ordering that does not take any features of the item or context of the problem into account. In this work, we propose a general approach to order the items within the sequence based on the context (e.g., perceptual information, environment description, and goals). We take a simple, efficient, reduction-based approach where the choice and order of the items is established by repeatedly learning simple classifiers or regressors for each "slot" in the sequence. Our approach leverages recent work on submodular function maximization to provide a formal regret reduction from submodular sequence optimization to simple cost-sensitive prediction. We apply our contextual sequence prediction algorithm to optimize control libraries and demonstrate results on two robotics problems: ...
Nonlinear trading models through Sharpe Ratio maximization.
Choey, M; Weigend, A S
1997-08-01
While many trading strategies are based on price prediction, traders in financial markets are typically interested in optimizing risk-adjusted performance such as the Sharpe Ratio, rather than the price predictions themselves. This paper introduces an approach which generates a nonlinear strategy that explicitly maximizes the Sharpe Ratio. It is expressed as a neural network model whose output is the position size between a risky and a risk-free asset. The iterative parameter update rules are derived and compared to alternative approaches. The resulting trading strategy is evaluated and analyzed on both computer-generated data and real world data (DAX, the daily German equity index). Trading based on Sharpe Ratio maximization compares favorably to both profit optimization and probability matching (through cross-entropy optimization). The results show that the goal of optimizing out-of-sample risk-adjusted profit can indeed be achieved with this nonlinear approach.
Consistent 4-form fluxes for maximal supergravity
Godazgar, Hadi; Krueger, Olaf; Nicolai, Hermann
2015-01-01
We derive new ansaetze for the 4-form field strength of D=11 supergravity corresponding to uplifts of four-dimensional maximal gauged supergravity. In particular, the ansaetze directly yield the components of the 4-form field strength in terms of the scalars and vectors of the four-dimensional maximal gauged supergravity---in this way they provide an explicit uplift of all four-dimensional consistent truncations of D=11 supergravity. The new ansaetze provide a substantially simpler method for uplifting d=4 flows compared to the previously available method using the 3-form and 6-form potential ansaetze. The ansatz for the Freund-Rubin term allows us to conjecture a `master formula' for the latter in terms of the scalar potential of d=4 gauged supergravity and its first derivative. We also resolve a long-standing puzzle concerning the antisymmetry of the flux obtained from uplift ansaetze.
Utility maximization in incomplete markets with default
Lim, Thomas
2008-01-01
We adress the maximization problem of expected utility from terminal wealth. The special feature of this paper is that we consider a financial market where the price process of risky assets can have a default time. Using dynamic programming, we characterize the value function with a backward stochastic differential equation and the optimal portfolio policies. We separately treat the cases of exponential, power and logarithmic utility.
Operational Modal Analysis using Expectation Maximization Algorithm
Cara Cañas, Francisco Javier; Carpio Huertas, Jaime; Juan Ruiz, Jesús; Alarcón Álvarez, Enrique
2011-01-01
This paper presents a time-domain stochastic system identification method based on Maximum Likelihood Estimation and the Expectation Maximization algorithm. The effectiveness of this structural identification method is evaluated through numerical simulation in the context of the ASCE benchmark problem on structural health monitoring. Modal parameters (eigenfrequencies, damping ratios and mode shapes) of the benchmark structure have been estimated applying the proposed identification method...
Revenue Maximizing Head Starts in Contests
Franke, Jörg; Leininger, Wolfgang; Wasser, Cédric
2014-01-01
We characterize revenue maximizing head starts for all-pay auctions and lottery contests with many heterogeneous players. We show that under optimal head starts all-pay auctions revenue-dominate lottery contests for any degree of heterogeneity among players. Moreover, all-pay auctions with optimal head starts induce higher revenue than any multiplicatively biased all-pay auction or lottery contest. While head starts are more effective than multiplicative biases in all-pay auctions, they are l...
Approximate Revenue Maximization in Interdependent Value Settings
Chawla, Shuchi; Fu, Hu; Karlin, Anna
2014-01-01
We study revenue maximization in settings where agents' values are interdependent: each agent receives a signal drawn from a correlated distribution and agents' values are functions of all of the signals. We introduce a variant of the generalized VCG auction with reserve prices and random admission, and show that this auction gives a constant approximation to the optimal expected revenue in matroid environments. Our results do not require any assumptions on the signal distributions, however, ...
Maximal supersymmetry and B-mode targets
Kallosh, Renata; Linde, Andrei; Wrase, Timm; Yamada, Yusuke
2017-04-01
Extending the work of Ferrara and one of the authors [1], we present dynamical cosmological models of α-attractors with plateau potentials for 3 α = 1, 2, 3, 4, 5, 6, 7. These models are motivated by geometric properties of maximally supersymmetric theories: M-theory, superstring theory, and maximal N = 8 supergravity. After a consistent truncation of maximal to minimal supersymmetry in a seven-disk geometry, we perform a two-step procedure: 1) we introduce a superpotential, which stabilizes the moduli of the seven-disk geometry in a supersymmetric minimum, 2) we add a cosmological sector with a nilpotent stabilizer, which breaks supersymmetry spontaneously and leads to a desirable class of cosmological attractor models. These models with n s consistent with observational data, and with tensor-to-scalar ratio r ≈ 10-2 - 10-3, provide natural targets for future B-mode searches. We relate the issue of stability of inflationary trajectories in these models to tessellations of a hyperbolic geometry.
Maximal respiratory pressures among adolescent swimmers.
Rocha Crispino Santos, M A; Pinto, M L; Couto Sant'Anna, C; Bernhoeft, M
2011-01-01
Maximal inspiratory pressures (MIP) and maximal expiratory pressures (MEP) are useful indices of respiratory muscle strength in athletes. The aims of this study were: to describe the strength of the respiratory muscles of Olympic junior swim team, at baseline and after a standard physical training; and to determine if there is a differential inspiratory and expiratory pressure response to the physical training. A cross-sectional study evaluated 28 international-level swimmers with ages ranging from 15 to 17 years, 19 (61 %) being males. At baseline, MIP was found to be lower in females (P = .001). The mean values reached by males and females were: MIP(cmH2O) = M: 100.4 (± 26.5)/F: 67.8 (± 23.2); MEP (cmH2O) = M: 87.4 (± 20.7)/F: 73.9 (± 17.3). After the physical training they reached: MIP (cmH2O) = M: 95.3 (± 30.3)/F: 71.8 (± 35.6); MEP (cmH2O) = M: 82.8 (± 26.2)/F: 70.4 (± 8.3). No differential pressure responses were observed in either males or females. These results suggest that swimmers can sustain the magnitude of the initial maximal pressures. Other studies should be developed to clarify if MIP and MEP could be used as a marker of an athlete's performance.
An Optimization Problem for Predicting the Maximal Effect of Degradation of Mechanical Structures
Achtziger, W.; Bendsøe, Martin P.; Taylor, J. E.
2000-01-01
matrices, b is a vector, and x, y are the vectors of unknowns. The linear objective function to be maximized is (x, y) bar right arrow b(T)x. In a first step we investigate the problem properties such as existence of solutions and the differentiability of related marginal functions. As a by-product...
Generation of Maximally Entangled Bell State in a Coupled Quantum Dot
ZHANG Ping; FAN Wen-Bin; DUAN Su-Qing; ZHAO Xian-Geng
2001-01-01
We show how the two interacting electrons in a field-driven coupled quantum dot can be used to prepare maximally entangled Bell states. The time durations of the oscillatory electric field for producing and maintaining such highly entangled states are identified by both analytic and exact numerical solutions of the quantum dynamical equations.
M Sakawa; Kato, K.
2009-01-01
This paper considers stochastic two-level linear programming problems. Using the concept of chance constraints and probability maximization, original problems are transformed into deterministic ones. An interactive fuzzy programming method is presented for deriving a satisfactory solution efficiently with considerations of overall satisfactory balance.
A duality result between the minimal surface equation and the maximal surface equation
ALÍAS LUIS J.
2001-01-01
Full Text Available In this note we show how classical Bernstein's theorem on minimal surfaces in the Euclidean space can be seen as a consequence of Calabi-Bernstein's theorem on maximal surfaces in the Lorentz-Minkowski space (and viceversa. This follows from a simple but nice duality between solutions to their corresponding differential equations.
Power Utility Maximization in an Exponential Lévy Model Without a Risk-free Asset
Qing Zhou
2005-01-01
We consider the problem of maximizing the expected power utility from terminal wealth in a market where logarithmic securities prices follow a Levy process. By Girsanov's theorem, we give explicit solutions for power utility of undiscounted terminal wealth in terms of the Levy-Khintchine triplet.
Maximizing mutagenesis with solubilized CRISPR-Cas9 ribonucleoprotein complexes.
Burger, Alexa; Lindsay, Helen; Felker, Anastasia; Hess, Christopher; Anders, Carolin; Chiavacci, Elena; Zaugg, Jonas; Weber, Lukas M; Catena, Raul; Jinek, Martin; Robinson, Mark D; Mosimann, Christian
2016-06-01
CRISPR-Cas9 enables efficient sequence-specific mutagenesis for creating somatic or germline mutants of model organisms. Key constraints in vivo remain the expression and delivery of active Cas9-sgRNA ribonucleoprotein complexes (RNPs) with minimal toxicity, variable mutagenesis efficiencies depending on targeting sequence, and high mutation mosaicism. Here, we apply in vitro assembled, fluorescent Cas9-sgRNA RNPs in solubilizing salt solution to achieve maximal mutagenesis efficiency in zebrafish embryos. MiSeq-based sequence analysis of targeted loci in individual embryos using CrispRVariants, a customized software tool for mutagenesis quantification and visualization, reveals efficient bi-allelic mutagenesis that reaches saturation at several tested gene loci. Such virtually complete mutagenesis exposes loss-of-function phenotypes for candidate genes in somatic mutant embryos for subsequent generation of stable germline mutants. We further show that targeting of non-coding elements in gene regulatory regions using saturating mutagenesis uncovers functional control elements in transgenic reporters and endogenous genes in injected embryos. Our results establish that optimally solubilized, in vitro assembled fluorescent Cas9-sgRNA RNPs provide a reproducible reagent for direct and scalable loss-of-function studies and applications beyond zebrafish experiments that require maximal DNA cutting efficiency in vivo.
Cardiorespiratory Coordination in Repeated Maximal Exercise
Sergi Garcia-Retortillo
2017-06-01
Full Text Available Increases in cardiorespiratory coordination (CRC after training with no differences in performance and physiological variables have recently been reported using a principal component analysis approach. However, no research has yet evaluated the short-term effects of exercise on CRC. The aim of this study was to delineate the behavior of CRC under different physiological initial conditions produced by repeated maximal exercises. Fifteen participants performed 2 consecutive graded and maximal cycling tests. Test 1 was performed without any previous exercise, and Test 2 6 min after Test 1. Both tests started at 0 W and the workload was increased by 25 W/min in males and 20 W/min in females, until they were not able to maintain the prescribed cycling frequency of 70 rpm for more than 5 consecutive seconds. A principal component (PC analysis of selected cardiovascular and cardiorespiratory variables (expired fraction of O2, expired fraction of CO2, ventilation, systolic blood pressure, diastolic blood pressure, and heart rate was performed to evaluate the CRC defined by the number of PCs in both tests. In order to quantify the degree of coordination, the information entropy was calculated and the eigenvalues of the first PC (PC1 were compared between tests. Although no significant differences were found between the tests with respect to the performed maximal workload (Wmax, maximal oxygen consumption (VO2 max, or ventilatory threshold (VT, an increase in the number of PCs and/or a decrease of eigenvalues of PC1 (t = 2.95; p = 0.01; d = 1.08 was found in Test 2 compared to Test 1. Moreover, entropy was significantly higher (Z = 2.33; p = 0.02; d = 1.43 in the last test. In conclusion, despite the fact that no significant differences were observed in the conventionally explored maximal performance and physiological variables (Wmax, VO2 max, and VT between tests, a reduction of CRC was observed in Test 2. These results emphasize the interest of CRC
Cardiorespiratory Coordination in Repeated Maximal Exercise.
Garcia-Retortillo, Sergi; Javierre, Casimiro; Hristovski, Robert; Ventura, Josep L; Balagué, Natàlia
2017-01-01
Increases in cardiorespiratory coordination (CRC) after training with no differences in performance and physiological variables have recently been reported using a principal component analysis approach. However, no research has yet evaluated the short-term effects of exercise on CRC. The aim of this study was to delineate the behavior of CRC under different physiological initial conditions produced by repeated maximal exercises. Fifteen participants performed 2 consecutive graded and maximal cycling tests. Test 1 was performed without any previous exercise, and Test 2 6 min after Test 1. Both tests started at 0 W and the workload was increased by 25 W/min in males and 20 W/min in females, until they were not able to maintain the prescribed cycling frequency of 70 rpm for more than 5 consecutive seconds. A principal component (PC) analysis of selected cardiovascular and cardiorespiratory variables (expired fraction of O2, expired fraction of CO2, ventilation, systolic blood pressure, diastolic blood pressure, and heart rate) was performed to evaluate the CRC defined by the number of PCs in both tests. In order to quantify the degree of coordination, the information entropy was calculated and the eigenvalues of the first PC (PC1) were compared between tests. Although no significant differences were found between the tests with respect to the performed maximal workload (Wmax), maximal oxygen consumption (VO2 max), or ventilatory threshold (VT), an increase in the number of PCs and/or a decrease of eigenvalues of PC1 (t = 2.95; p = 0.01; d = 1.08) was found in Test 2 compared to Test 1. Moreover, entropy was significantly higher (Z = 2.33; p = 0.02; d = 1.43) in the last test. In conclusion, despite the fact that no significant differences were observed in the conventionally explored maximal performance and physiological variables (Wmax, VO2 max, and VT) between tests, a reduction of CRC was observed in Test 2. These results emphasize the interest of CRC evaluation in
Optimal deployment of resources for maximizing impact in spreading processes.
Lokhov, Andrey Y; Saad, David
2017-09-26
The effective use of limited resources for controlling spreading processes on networks is of prime significance in diverse contexts, ranging from the identification of "influential spreaders" for maximizing information dissemination and targeted interventions in regulatory networks, to the development of mitigation policies for infectious diseases and financial contagion in economic systems. Solutions for these optimization tasks that are based purely on topological arguments are not fully satisfactory; in realistic settings, the problem is often characterized by heterogeneous interactions and requires interventions in a dynamic fashion over a finite time window via a restricted set of controllable nodes. The optimal distribution of available resources hence results from an interplay between network topology and spreading dynamics. We show how these problems can be addressed as particular instances of a universal analytical framework based on a scalable dynamic message-passing approach and demonstrate the efficacy of the method on a variety of real-world examples.
Maximal atmospheric neutrino mixing in an SU(5) model
Grimus, W.; Lavoura, L.
2003-05-01
We show that maximal atmospheric and large solar neutrino mixing can be implemented in SU(5) gauge theories, by making use of the U(1) F symmetry associated with a suitably defined family number F, together with a Z2 symmetry which does not commute with F. U(1) F is softly broken by the mass terms of the right-handed neutrino singlets, which are responsible for the seesaw mechanism; in additio n, U(1) F is also spontaneously broken at the electroweak scale. In our scenario, lepton mixing stems exclusively from the right-handed-neutrino Majorana mass matrix, whereas the CKM matrix originates solely in the up-type-quark sector. We show that, despite the non-supersymmetric character of our model, unification of the gauge couplings can be achieved at a scale 1016 GeV particula r solution to this problem which yields results almost identical to the ones of the minimal supersymmetric standard model.
Optimal Deployment of Resources for Maximizing Impact in Spreading Processes
Lokhov, Andrey Y
2016-01-01
The effective use of limited resources for controlling spreading processes on networks is of prime significance in diverse contexts, ranging from the identification of "influential spreaders" for maximizing information dissemination and targeted interventions in regulatory networks, to the development of mitigation policies for infectious diseases and financial contagion in economic systems. Solutions for these optimization tasks that are based purely on topological arguments are not fully satisfactory; in realistic settings the problem is often characterized by heterogeneous interactions and requires interventions over a finite time window via a restricted set of controllable nodes. The optimal distribution of available resources hence results from an interplay between network topology and spreading dynamics. We show how these problems can be addressed as particular instances of a universal analytical framework based on a scalable dynamic message-passing approach and demonstrate the efficacy of the method on...
Maximizing sparse matrix vector product performance in MIMD computers
McLay, R.T.; Kohli, H.S.; Swift, S.L.; Carey, G.F.
1994-12-31
A considerable component of the computational effort involved in conjugate gradient solution of structured sparse matrix systems is expended during the Matrix-Vector Product (MVP), and hence it is the focus of most efforts at improving performance. Such efforts are hindered on MIMD machines due to constraints on memory, cache and speed of memory-cpu data transfer. This paper describes a strategy for maximizing the performance of the local computations associated with the MVP. The method focuses on single stride memory access, and the efficient use of cache by pre-loading it with data that is re-used while bypassing it for other data. The algorithm is designed to behave optimally for varying grid sizes and number of unknowns per gridpoint. Results from an assembly language implementation of the strategy on the iPSC/860 show a significant improvement over the performance using FORTRAN.
Expectation Maximization for Hard X-ray Count Modulation Profiles
Benvenuto, Federico; Piana, Michele; Massone, Anna Maria
2013-01-01
This paper is concerned with the image reconstruction problem when the measured data are solar hard X-ray modulation profiles obtained from the Reuven Ramaty High Energy Solar Spectroscopic Imager (RHESSI)} instrument. Our goal is to demonstrate that a statistical iterative method classically applied to the image deconvolution problem is very effective when utilized for the analysis of count modulation profiles in solar hard X-ray imaging based on Rotating Modulation Collimators. The algorithm described in this paper solves the maximum likelihood problem iteratively and encoding a positivity constraint into the iterative optimization scheme. The result is therefore a classical Expectation Maximization method this time applied not to an image deconvolution problem but to image reconstruction from count modulation profiles. The technical reason that makes our implementation particularly effective in this application is the use of a very reliable stopping rule which is able to regularize the solution providing, ...
Postactivation Potentiation Biases Maximal Isometric Strength Assessment
Leonardo Coelho Rabello Lima
2014-01-01
Full Text Available Postactivation potentiation (PAP is known to enhance force production. Maximal isometric strength assessment protocols usually consist of two or more maximal voluntary isometric contractions (MVCs. The objective of this study was to determine if PAP would influence isometric strength assessment. Healthy male volunteers (n=23 performed two five-second MVCs separated by a 180-seconds interval. Changes in isometric peak torque (IPT, time to achieve it (tPTI, contractile impulse (CI, root mean square of the electromyographic signal during PTI (RMS, and rate of torque development (RTD, in different intervals, were measured. Significant increases in IPT (240.6 ± 55.7 N·m versus 248.9 ± 55.1 N·m, RTD (746 ± 152 N·m·s−1versus 727 ± 158 N·m·s−1, and RMS (59.1 ± 12.2% RMSMAX versus 54.8 ± 9.4% RMSMAX were found on the second MVC. tPTI decreased significantly on the second MVC (2373 ± 1200 ms versus 2784 ± 1226 ms. We conclude that a first MVC leads to PAP that elicits significant enhancements in strength-related variables of a second MVC performed 180 seconds later. If disconsidered, this phenomenon might bias maximal isometric strength assessment, overestimating some of these variables.
Maximizing versus satisficing: happiness is a matter of choice.
Schwartz, Barry; Ward, Andrew; Monterosso, John; Lyubomirsky, Sonja; White, Katherine; Lehman, Darrin R
2002-11-01
Can people feel worse off as the options they face increase? The present studies suggest that some people--maximizers--can. Study 1 reported a Maximization Scale, which measures individual differences in desire to maximize. Seven samples revealed negative correlations between maximization and happiness, optimism, self-esteem, and life satisfaction, and positive correlations between maximization and depression, perfectionism, and regret. Study 2 found maximizers less satisfied than nonmaximizers (satisficers) with consumer decisions, and more likely to engage in social comparison. Study 3 found maximizers more adversely affected by upward social comparison. Study 4 found maximizers more sensitive to regret and less satisfied in an ultimatum bargaining game. The interaction between maximizing and choice is discussed in terms of regret, adaptation, and self-blame.
Cycle-maximal triangle-free graphs
Durocher, Stephane; Gunderson, David S.; Li, Pak Ching
2015-01-01
Abstract We conjecture that the balanced complete bipartite graph K ⌊ n / 2 ⌋ , ⌈ n / 2 ⌉ contains more cycles than any other n -vertex triangle-free graph, and we make some progress toward proving this. We give equivalent conditions for cycle-maximal triangle-free graphs; show bounds...... on the numbers of cycles in graphs depending on numbers of vertices and edges, girth, and homomorphisms to small fixed graphs; and use the bounds to show that among regular graphs, the conjecture holds. We also consider graphs that are close to being regular, with the minimum and maximum degrees differing...
ON THE SPACES OF THE MAXIMAL POINTS
梁基华; 刘应明
2003-01-01
For a continuous domain D, some characterization that the convex powerdomain CD is adomain hull of Max(CD) is given in terms of compact subsets of D. And in this case, it isproved that the set of the maximal points Max(CD) of CD with the relative Scott topology ishomeomorphic to the set of all Scott compact subsets of Max(D) with the topology induced bythe Hausdorff metric derived from a metric on Max(D) when Max(D) is metrizable.
Understanding of English Contracts though Relation Maxims
XU Chi-ying; JIANG Li-hui
2013-01-01
Contract is the legal evidence of the concerning parties of business. And this lead to its unique characteristics:technical terms, archaism, borrowed words, juxtaposition, and abbreviation. The understanding of contracts is of vital importance for each party, because it concerns the share of interests. In order to avoid ambiguity that some words or sentence in English contracts may lead to, and achieve“best relevance and least effort”of communication, this paper, by applying relation maxim, deeply analyze how to understand English contracts though selection of words, modification, the complexity and simplicity of sentence.
Maximizing results in reconstruction of cheek defects.
Mureau, Marc A M; Hofer, Stefan O P
2009-07-01
The face is exceedingly important, as it is the medium through which individuals interact with the rest of society. Reconstruction of cheek defects after trauma or surgery is a continuing challenge for surgeons who wish to reliably restore facial function and appearance. Important in aesthetic facial reconstruction are the aesthetic unit principles, by which the face can be divided in central facial units (nose, lips, eyelids) and peripheral facial units (cheeks, forehead, chin). This article summarizes established options for reconstruction of cheek defects and provides an overview of several modifications as well as tips and tricks to avoid complications and maximize aesthetic results.
Maximizing policy learning in international committees
Nedergaard, Peter
2007-01-01
, this article demonstrates that valuable lessons can be learned about policy learning, in practice and theoretically, by analysing the cooperation in the OMC committees. Using the Advocacy Coalition Framework as the starting point of analysis, 15 hypotheses on policy learning are tested. Among other things......, it is concluded that in order to maximize policy learning in international committees, empirical data should be made available to committees and provided by sources close to the participants (i.e. the Commission). In addition, the work in the committees should be made prestigious in order to attract well...
Existence of Solution for Fractional Differential Problem with a Parameter
Shi Ai-ling; Zhang Shu-qin
2014-01-01
We apply the method of lower and upper solutions combined with mono-tone iterations to fractional differential problem with a parameter. The existence of minimal and maximal solutions is proved for the fractional differential problem with a parameter.
Solving Maximal Clique Problem through Genetic Algorithm
Rajawat, Shalini; Hemrajani, Naveen; Menghani, Ekta
2010-11-01
Genetic algorithm is one of the most interesting heuristic search techniques. It depends basically on three operations; selection, crossover and mutation. The outcome of the three operations is a new population for the next generation. Repeating these operations until the termination condition is reached. All the operations in the algorithm are accessible with today's molecular biotechnology. The simulations show that with this new computing algorithm, it is possible to get a solution from a very small initial data pool, avoiding enumerating all candidate solutions. For randomly generated problems, genetic algorithm can give correct solution within a few cycles at high probability.
Maximal imaginery eigenvalues in optimal systems
David Di Ruscio
1991-07-01
Full Text Available In this note we present equations that uniquely determine the maximum possible imaginary value of the closed loop eigenvalues in an LQ-optimal system, irrespective of how the state weight matrix is chosen, provided a real symmetric solution of the algebraic Riccati equation exists. In addition, the corresponding state weight matrix and the solution to the algebraic Riccati equation are derived for a class of linear systems. A fundamental lemma for the existence of a real symmetric solution to the algebraic Riccati equation is derived for this class of linear systems.
Maximal subbundles, quot schemes, and curve counting
Gillam, W D
2011-01-01
Let $E$ be a rank 2, degree $d$ vector bundle over a genus $g$ curve $C$. The loci of stable pairs on $E$ in class $2[C]$ fixed by the scaling action are expressed as products of $\\Quot$ schemes. Using virtual localization, the stable pairs invariants of $E$ are related to the virtual intersection theory of $\\Quot E$. The latter theory is extensively discussed for an $E$ of arbitrary rank; the tautological ring of $\\Quot E$ is defined and is computed on the locus parameterizing rank one subsheaves. In case $E$ has rank 2, $d$ and $g$ have opposite parity, and $E$ is sufficiently generic, it is known that $E$ has exactly $2^g$ line subbundles of maximal degree. Doubling the zero section along such a subbundle gives a curve in the total space of $E$ in class $2[C]$. We relate this count of maximal subbundles with stable pairs/Donaldson-Thomas theory on the total space of $E$. This endows the residue invariants of $E$ with enumerative significance: they actually \\emph{count} curves in $E$.
Maximal coherence in a generic basis
Yao, Yao; Dong, G. H.; Ge, Li; Li, Mo; Sun, C. P.
2016-12-01
Since quantum coherence is an undoubted characteristic trait of quantum physics, the quantification and application of quantum coherence has been one of the long-standing central topics in quantum information science. Within the framework of a resource theory of quantum coherence proposed recently, a fiducial basis should be preselected for characterizing the quantum coherence in specific circumstances, namely, the quantum coherence is a basis-dependent quantity. Therefore, a natural question is raised: what are the maximum and minimum coherences contained in a certain quantum state with respect to a generic basis? While the minimum case is trivial, it is not so intuitive to verify in which basis the quantum coherence is maximal. Based on the coherence measure of relative entropy, we indicate the particular basis in which the quantum coherence is maximal for a given state, where the Fourier matrix (or more generally, complex Hadamard matrices) plays a critical role in determining the basis. Intriguingly, though we can prove that the basis associated with the Fourier matrix is a stationary point for optimizing the l1 norm of coherence, numerical simulation shows that it is not a global optimal choice.
Symmetry and approximability of submodular maximization problems
Vondrak, Jan
2011-01-01
A number of recent results on optimization problems involving submodular functions have made use of the multilinear relaxation of the problem. These results hold typically in the value oracle model, where the objective function is accessible via a black box returning f(S) for a given S. We present a general approach to deriving inapproximability results in the value oracle model, based on the notion of symmetry gap. Our main result is that for any fixed instance that exhibits a certain symmetry gap in its multilinear relaxation, there is a naturally related class of instances for which a better approximation factor than the symmetry gap would require exponentially many oracle queries. This unifies several known hardness results for submodular maximization, and implies several new ones. In particular, we prove that there is no constant-factor approximation for the problem of maximizing a non-negative submodular function over the bases of a matroid. We also provide a closely matching approximation algorithm for...
Maximal Attractors for the m-Dimensional Cahn-Hilliard System
Wei Nian ZHANG
2004-01-01
In this paper we discuss maximal attractors of the m-dimensional Cahn-Hilliard System in the product spaces (L2(Ω))m and (H2(Ω))m in terms of D. Henry's general theory and from the viewpoint of compactness and absorptivity of semigroups as R. Temam did. After giving the existence and uniqueness of global solutions, we technically restrict our discussion to some subspaces, give estimates with a new graph norm, and obtain the existence of maximal attractors and some properties of them.
Maximal lattice free bodies, test sets and the Frobenius problem
Jensen, Anders Nedergaard; Lauritzen, Niels; Roune, Bjarke Hammersholt
Maximal lattice free bodies are maximal polytopes without interior integral points. Scarf initiated the study of maximal lattice free bodies relative to the facet normals in a fixed matrix. In this paper we give an efficient algorithm for computing the maximal lattice free bodies of an integral...... method is inspired by the novel algorithm by Einstein, Lichtblau, Strzebonski and Wagon and the Groebner basis approach by Roune....
Maximizing scientific knowledge from randomized clinical trials
Gustafsson, Finn; Atar, Dan; Pitt, Bertram;
2010-01-01
Trialists have an ethical and financial responsibility to plan and conduct clinical trials in a manner that will maximize the scientific knowledge gained from the trial. However, the amount of scientific information generated by randomized clinical trials in cardiovascular medicine is highly...... variable. Generation of trial databases and/or biobanks originating in large randomized clinical trials has successfully increased the knowledge obtained from those trials. At the 10th Cardiovascular Trialist Workshop, possibilities and pitfalls in designing and accessing clinical trial databases were......, in particular with respect to collaboration with the trial sponsor and to analytic pitfalls. The advantages of creating screening databases in conjunction with a given clinical trial are described; and finally, the potential for posttrial database studies to become a platform for training young scientists...
Characterizing maximally singular phase-space distributions
Sperling, J.
2016-07-01
Phase-space distributions are widely applied in quantum optics to access the nonclassical features of radiations fields. In particular, the inability to interpret the Glauber-Sudarshan distribution in terms of a classical probability density is the fundamental benchmark for quantum light. However, this phase-space distribution cannot be directly reconstructed for arbitrary states, because of its singular behavior. In this work, we perform a characterization of the Glauber-Sudarshan representation in terms of distribution theory. We address important features of such distributions: (i) the maximal degree of their singularities is studied, (ii) the ambiguity of representation is shown, and (iii) their dual space for nonclassicality tests is specified. In this view, we reconsider the methods for regularizing the Glauber-Sudarshan distribution for verifying its nonclassicality. This treatment is supported with comprehensive examples and counterexamples.
Maximization of eigenvalues using topology optimization
Pedersen, Niels Leergaard
2000-01-01
Topology optimization is used to optimize the eigenvalues of plates. The results are intended especially for MicroElectroMechanical Systems (MEMS) but call be seen as more general. The problem is not formulated as a case of reinforcement of an existing structure, so there is a problem related...... to localized modes in low density areas. The topology optimization problem is formulated using the SIMP method. Special attention is paid to a numerical method for removing localized eigenmodes in low density areas. The method is applied to numerical examples of maximizing the first eigenfrequency, One example...... is a practical MEMS application; a probe used in an Atomic Force Microscope (AFM). For the AFM probe the optimization is complicated by a constraint on the stiffness and constraints on higher order eigenvalues....
MAXIMIZING THE BENEFITS OF ERP SYSTEMS
Paulo André da Conceição Menezes
2010-04-01
Full Text Available The ERP (Enterprise Resource Planning systems have been consolidated in companies with different sizes and sectors, allowing their real benefits to be definitively evaluated. In this study, several interactions have been studied in different phases, such as the strategic priorities and strategic planning defined as ERP Strategy; business processes review and the ERP selection in the pre-implementation phase, the project management and ERP adaptation in the implementation phase, as well as the ERP revision and integration efforts in the post-implementation phase. Through rigorous use of case study methodology, this research led to developing and to testing a framework for maximizing the benefits of the ERP systems, and seeks to contribute for the generation of ERP initiatives to optimize their performance.
MAXIMIZING THE BENEFITS OF ERP SYSTEMS
Paulo André Da Conceiçao Menezes
2010-04-01
Full Text Available The ERP (Enterprise Resource Planning systems have been consolidated in companies with different sizes and sectors, allowing their real benefits to be definitively evaluated. In this study, several interactions have been studied in different phases, such as the strategic priorities and strategic planning defined as ERP Strategy; business processes review and the ERP selection in the pre-implementation phase, the project management and ERP adaptation in the implementation phase, as well as the ERP revision and integration efforts in the post-implementation phase. Through rigorous use of case study methodology, this research led to developing and to testing a framework for maximizing the benefits of the ERP systems, and seeks to contribute for the generation of ERP initiatives to optimize their performance.
Reflection Quasilattices and the Maximal Quasilattice
Boyle, Latham
2016-01-01
We introduce the concept of a {\\it reflection quasilattice}, the quasiperiodic generalization of a Bravais lattice with irreducible reflection symmetry. Among their applications, reflection quasilattices are the reciprocal (i.e. Bragg diffraction) lattices for quasicrystals and quasicrystal tilings, such as Penrose tilings, with irreducible reflection symmetry and discrete scale invariance. In a follow-up paper, we will show that reflection quasilattices can be used to generate tilings in real space with properties analogous to those in Penrose tilings, but with different symmetries and in various dimensions. Here we prove that reflection quasilattices only exist in dimensions two, three and four, and we prove that there is a unique reflection quasilattice in dimension four: the "maximal reflection quasilattice" in terms of dimensionality and symmetry. We further show that, unlike crystallographic Bravais lattices, all reflection quasilattices are invariant under rescaling by certain discrete scale factors. W...
Distributed Maximality based CTL Model Checking
Djamel Eddine Saidouni
2010-05-01
Full Text Available In this paper we investigate an approach to perform a distributed CTL Model checker algorithm on a network of workstations using Kleen three value logic, the state spaces is partitioned among the network nodes, We represent the incomplete state spaces as a Maximality labeled Transition System MLTS which are able to express true concurrency. we execute in parallel the same algorithm in each node, for a certain property on an incomplete MLTS , this last compute the set of states which satisfy or which if they fail are assigned the value .The third value mean unknown whether true or false because the partial state space lacks sufficient information needed for a precise answer concerning the complete state space .To solve this problem each node exchange the information needed to conclude the result about the complete state space. The experimental version of the algorithm is currently being implemented using the functional programming language Erlang.
Evolution of correlated multiplexity through stability maximization
Dwivedi, Sanjiv K
2016-01-01
Investigating relation between various structural patterns found in real-world networks and stability of underlying systems is crucial to understand importance and evolutionary origin of such patterns. We evolve multiplex networks, comprising of anti-symmetric couplings in one layer, depicting predator-prey relation, and symmetric couplings in the other, depicting mutualistic (or competitive) relation, based on stability maximization through the largest eigenvalue. We find that the correlated multiplexity emerges as evolution progresses. The evolved values of the correlated multiplexity exhibit a dependence on the inter-link coupling strength. Furthermore, the inter-layer coupling strength governs the evolution of disassortativity property in the individual layers. We provide analytical understanding to these findings by considering star like networks in both the layers. The model and tools used here are useful for understanding the principles governing the stability as well as importance of such patterns in ...
Greedy Maximal Scheduling in Wireless Networks
Li, Qiao
2010-01-01
In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling, where the priorities are computed using queue lengths, and 2) Static Priority (SP) scheduling, where the priorities are pre-assigned. We first propose a closed-form lower bound stability region for LQF scheduling, and discuss the tightness result in some scenarios. We then propose an lower bound stability region for SP scheduling with multiple priority vectors, as well as a heuristic priority assignment algorithm, which is related to the well-known Expectation-Maximization (EM) algorithm. The performance gain of the proposed heuristic algorithm is finally confirmed by simulations.
Dispatch Scheduling to Maximize Exoplanet Detection
Johnson, Samson; McCrady, Nate; MINERVA
2016-01-01
MINERVA is a dedicated exoplanet detection telescope array using radial velocity measurements of nearby stars to detect planets. MINERVA will be a completely robotic facility, with a goal of maximizing the number of exoplanets detected. MINERVA requires a unique application of queue scheduling due to its automated nature and the requirement of high cadence observations. A dispatch scheduling algorithm is employed to create a dynamic and flexible selector of targets to observe, in which stars are chosen by assigning values through a weighting function. I designed and have begun testing a simulation which implements the functions of a dispatch scheduler and records observations based on target selections through the same principles that will be used at the commissioned site. These results will be used in a larger simulation that incorporates weather, planet occurrence statistics, and stellar noise to test the planet detection capabilities of MINERVA. This will be used to heuristically determine an optimal observing strategy for the MINERVA project.
A New Biflavone from Selaginella pulvinata Maxim
XU Kang-Ping; XU Zhi; DENG Yin-Hua; LI Fu-Shuang; ZHOU Ying-Jun; HU Gao-Yun; TAN Gui-Shan
2003-01-01
@@ Selaginella pulvinata Maxim. distributes all over the country of China and is used for the treatment for haemor rhage. [1] We studied on the chemical constituents of S. pulvinata in order to find the active compounds. Dried stems and leaves of S. pulvinata (6.5 kg) were extracted with 70% ethanol twice. The extract was evaporated under vacuum and than suspended in water, extracted with petroleum and EtOAc sequentially. The EtOAc extract was chromatographed on silica gel, eluted with CHCl3-MeOH. As a result, a novel biflavone, named pulvinatabiflavone, was obtained from fractions 75 ～ 78. Its structure was determined on the basis of spectroscopic analysis as 5,5″, 4′″ trihydroxy-7,7″-dimethoxy-[4′-O-6″]-biflavone (compound 1).
Maximal energy extraction under discrete diffusive exchange
Hay, M. J., E-mail: hay@princeton.edu [Department of Astrophysical Sciences, Princeton University, Princeton, New Jersey 08544 (United States); Schiff, J. [Department of Mathematics, Bar-Ilan University, Ramat Gan 52900 (Israel); Fisch, N. J. [Department of Astrophysical Sciences, Princeton University, Princeton, New Jersey 08544 (United States); Princeton Plasma Physics Laboratory, Princeton, New Jersey 08543 (United States)
2015-10-15
Waves propagating through a bounded plasma can rearrange the densities of states in the six-dimensional velocity-configuration phase space. Depending on the rearrangement, the wave energy can either increase or decrease, with the difference taken up by the total plasma energy. In the case where the rearrangement is diffusive, only certain plasma states can be reached. It turns out that the set of reachable states through such diffusive rearrangements has been described in very different contexts. Building upon those descriptions, and making use of the fact that the plasma energy is a linear functional of the state densities, the maximal extractable energy under diffusive rearrangement can then be addressed through linear programming.
Maximal energy extraction under discrete diffusive exchange
Hay, Michael J; Fisch, Nathaniel J
2015-01-01
Waves propagating through a bounded plasma can rearrange the densities of states in the six-dimensional velocity-configuration phase space. Depending on the rearrangement, the wave energy can either increase or decrease, with the difference taken up by the total plasma energy. In the case where the rearrangement is diffusive, only certain plasma states can be reached. It turns out that the set of reachable states through such diffusive rearrangements has been described in very different contexts. Building upon those descriptions, and making use of the fact that the plasma energy is a linear functional of the state densities, the maximal extractable energy under diffusive rearrangement can then be addressed through linear programming.
Wyse, Adam E.; Babcock, Ben
2016-01-01
A common suggestion made in the psychometric literature for fixed-length classification tests is that one should design tests so that they have maximum information at the cut score. Designing tests in this way is believed to maximize the classification accuracy and consistency of the assessment. This article uses simulated examples to illustrate…
From entropy-maximization to equality-maximization: Gauss, Laplace, Pareto, and Subbotin
Eliazar, Iddo
2014-12-01
The entropy-maximization paradigm of statistical physics is well known to generate the omnipresent Gauss law. In this paper we establish an analogous socioeconomic model which maximizes social equality, rather than physical disorder, in the context of the distributions of income and wealth in human societies. We show that-on a logarithmic scale-the Laplace law is the socioeconomic equality-maximizing counterpart of the physical entropy-maximizing Gauss law, and that this law manifests an optimized balance between two opposing forces: (i) the rich and powerful, striving to amass ever more wealth, and thus to increase social inequality; and (ii) the masses, struggling to form more egalitarian societies, and thus to increase social equality. Our results lead from log-Gauss statistics to log-Laplace statistics, yield Paretian power-law tails of income and wealth distributions, and show how the emergence of a middle-class depends on the underlying levels of socioeconomic inequality and variability. Also, in the context of asset-prices with Laplace-distributed returns, our results imply that financial markets generate an optimized balance between risk and predictability.
THE EFFECTS MAXIMAL AND SUB MAXIMAL AEROBIC EXERCISE ON THE BRONCHOSPASM INDICES IN NON ATHLETIC
Amir GANJİ
2012-08-01
Full Text Available Background: Exercise-induced bronchospasm (EIB is a transient airway obstruction that occurs during and after the exercise. Exercise-induced bronchospasm is observed in healthy individuals as well as the asthmatic and allergic rhinitis patients. Research question: The study compared the effects of one session of submaximal aerobic exercise and a maximal one on the prevalence of exercise-induced bronchospasm in non-athletic students. Type of study: An experimental study, using human subjects, was designed. Methods: 20 non-athletic male students participated in two sessions of aerobic exercise. The prevalence of EIB was investigated among them. The criteria for assessing exercise-induced bronchospasm were ≥10% fall in FEV1, ≥15% fall in FEF25-75%, or ≥25% fall in PEFR. Results: The results revealed that the maximal exercise did not affect FEF25-75% and PEF, but it led to a meaningful reduction in FEV1. Contrarily, the submaximal exercise affected none of these indices. That is, in both protocols the same result was obtained for PEF and FEF25-75. Moreover, the prevalence of EIB was 15% in the submaximal exercise and 20% in the maximal one. Actually, this difference was significant. Conclusion: This study demonstrated that in contrast to the subjects who performed submaximal exercise, those who participated in the maximal protocol showed more changes in the pulmonary function indices and the prevalence of EIB was greater among them.
Maximal elements of non necessarily acyclic binary relations
Josep Enric Peris Ferrando; Begoña Subiza Martínez
1992-01-01
The existence of maximal elements for binary preference relations is analyzed without imposing transitivity or convexity conditions. From each preference relation a new acyclic relation is defined in such a way that some maximal elements of this new relation characterize maximal elements of the original one. The result covers the case whereby the relation is acyclic.
Global haplotype partitioning for maximal associated SNP pairs
Pezeshk Hamid
2009-08-01
Full Text Available Abstract Background Global partitioning based on pairwise associations of SNPs has not previously been used to define haplotype blocks within genomes. Here, we define an association index based on LD between SNP pairs. We use the Fisher's exact test to assess the statistical significance of the LD estimator. By this test, each SNP pair is characterized as associated, independent, or not-statistically-significant. We set limits on the maximum acceptable proportion of independent pairs within all blocks and search for the partitioning with maximal proportion of associated SNP pairs. Essentially, this model is reduced to a constrained optimization problem, the solution of which is obtained by iterating a dynamic programming algorithm. Results In comparison with other methods, our algorithm reports blocks of larger average size. Nevertheless, the haplotype diversity within the blocks is captured by a small number of tagSNPs. Resampling HapMap haplotypes under a block-based model of recombination showed that our algorithm is robust in reproducing the same partitioning for recombinant samples. Our algorithm performed better than previously reported models in a case-control association study aimed at mapping a single locus trait, based on simulation results that were evaluated by a block-based statistical test. Compared to methods of haplotype block partitioning, we performed best on detection of recombination hotspots. Conclusion Our proposed method divides chromosomes into the regions within which allelic associations of SNP pairs are maximized. This approach presents a native design for dimension reduction in genome-wide association studies. Our results show that the pairwise allelic association of SNPs can describe various features of genomic variation, in particular recombination hotspots.
Expectation-Maximization Binary Clustering for Behavioural Annotation.
Joan Garriga
Full Text Available The growing capacity to process and store animal tracks has spurred the development of new methods to segment animal trajectories into elementary units of movement. Key challenges for movement trajectory segmentation are to (i minimize the need of supervision, (ii reduce computational costs, (iii minimize the need of prior assumptions (e.g. simple parametrizations, and (iv capture biologically meaningful semantics, useful across a broad range of species. We introduce the Expectation-Maximization binary Clustering (EMbC, a general purpose, unsupervised approach to multivariate data clustering. The EMbC is a variant of the Expectation-Maximization Clustering (EMC, a clustering algorithm based on the maximum likelihood estimation of a Gaussian mixture model. This is an iterative algorithm with a closed form step solution and hence a reasonable computational cost. The method looks for a good compromise between statistical soundness and ease and generality of use (by minimizing prior assumptions and favouring the semantic interpretation of the final clustering. Here we focus on the suitability of the EMbC algorithm for behavioural annotation of movement data. We show and discuss the EMbC outputs in both simulated trajectories and empirical movement trajectories including different species and different tracking methodologies. We use synthetic trajectories to assess the performance of EMbC compared to classic EMC and Hidden Markov Models. Empirical trajectories allow us to explore the robustness of the EMbC to data loss and data inaccuracies, and assess the relationship between EMbC output and expert label assignments. Additionally, we suggest a smoothing procedure to account for temporal correlations among labels, and a proper visualization of the output for movement trajectories. Our algorithm is available as an R-package with a set of complementary functions to ease the analysis.
Expectation-Maximization Binary Clustering for Behavioural Annotation.
Garriga, Joan; Palmer, John R B; Oltra, Aitana; Bartumeus, Frederic
2016-01-01
The growing capacity to process and store animal tracks has spurred the development of new methods to segment animal trajectories into elementary units of movement. Key challenges for movement trajectory segmentation are to (i) minimize the need of supervision, (ii) reduce computational costs, (iii) minimize the need of prior assumptions (e.g. simple parametrizations), and (iv) capture biologically meaningful semantics, useful across a broad range of species. We introduce the Expectation-Maximization binary Clustering (EMbC), a general purpose, unsupervised approach to multivariate data clustering. The EMbC is a variant of the Expectation-Maximization Clustering (EMC), a clustering algorithm based on the maximum likelihood estimation of a Gaussian mixture model. This is an iterative algorithm with a closed form step solution and hence a reasonable computational cost. The method looks for a good compromise between statistical soundness and ease and generality of use (by minimizing prior assumptions and favouring the semantic interpretation of the final clustering). Here we focus on the suitability of the EMbC algorithm for behavioural annotation of movement data. We show and discuss the EMbC outputs in both simulated trajectories and empirical movement trajectories including different species and different tracking methodologies. We use synthetic trajectories to assess the performance of EMbC compared to classic EMC and Hidden Markov Models. Empirical trajectories allow us to explore the robustness of the EMbC to data loss and data inaccuracies, and assess the relationship between EMbC output and expert label assignments. Additionally, we suggest a smoothing procedure to account for temporal correlations among labels, and a proper visualization of the output for movement trajectories. Our algorithm is available as an R-package with a set of complementary functions to ease the analysis.
Maximally Minimal Preons in Four Dimensions
Grover, J; Sabra, W A; Grover, Jai; Gutowski, Jan B.; Sabra, Wafic A.
2006-01-01
Killing spinors of N=2, D=4 supergravity are examined using the spinorial geometry method, in which spinors are written as differential forms. Using this method, we show that there are no exactly 3/4 supersymmetric solutions of minimal N=2, D=4 gauged supergravity.
Maximal pore size in UF membranes
Arkhangelsky, E.; Duek, A.; Gitis, V.
2012-01-01
The ultrafiltration membrane rejection capability is most often characterized by molecular weight cutoff (MWCO). The value is found by rejection of organic solutes and the evaluation of particle retention requires a conversion of either MWCO to pore size or particle diameter to molecular weight. The
Maximization Paradox: Result of Believing in an Objective Best.
Luan, Mo; Li, Hong
2017-05-01
The results from four studies provide reliable evidence of how beliefs in an objective best influence the decision process and subjective feelings. A belief in an objective best serves as the fundamental mechanism connecting the concept of maximizing and the maximization paradox (i.e., expending great effort but feeling bad when making decisions, Study 1), and randomly chosen decision makers operate similar to maximizers once they are manipulated to believe that the best is objective (Studies 2A, 2B, and 3). In addition, the effect of a belief in an objective best on the maximization paradox is moderated by the presence of a dominant option (Study 3). The findings of this research contribute to the maximization literature by demonstrating that believing in an objective best leads to the maximization paradox. The maximization paradox is indeed the result of believing in an objective best.
EXPLANATORY VARIANCE IN MAXIMAL OXYGEN UPTAKE
Jacalyn J. Robert McComb
2006-06-01
Full Text Available The purpose of this study was to develop a prediction equation that could be used to estimate maximal oxygen uptake (VO2max from a submaximal water running protocol. Thirty-two volunteers (n =19 males, n = 13 females, ages 18 - 24 years, underwent the following testing procedures: (a a 7-site skin fold assessment; (b a land VO2max running treadmill test; and (c a 6 min water running test. For the water running submaximal protocol, the participants were fitted with an Aqua Jogger Classic Uni-Sex Belt and a Polar Heart Rate Monitor; the participants' head, shoulders, hips and feet were vertically aligned, using a modified running/bicycle motion. A regression model was used to predict VO2max. The criterion variable, VO2max, was measured using open-circuit calorimetry utilizing the Bruce Treadmill Protocol. Predictor variables included in the model were percent body fat (% BF, height, weight, gender, and heart rate following a 6 min water running protocol. Percent body fat accounted for 76% (r = -0.87, SEE = 3.27 of the variance in VO2max. No other variables significantly contributed to the explained variance in VO2max. The equation for the estimation of VO2max is as follows: VO2max ml.kg-1·min-1 = 56.14 - 0.92 (% BF.
Reflection quasilattices and the maximal quasilattice
Boyle, Latham; Steinhardt, Paul J.
2016-08-01
We introduce the concept of a reflection quasilattice, the quasiperiodic generalization of a Bravais lattice with irreducible reflection symmetry. Among their applications, reflection quasilattices are the reciprocal (i.e., Bragg diffraction) lattices for quasicrystals and quasicrystal tilings, such as Penrose tilings, with irreducible reflection symmetry and discrete scale invariance. In a follow-up paper, we will show that reflection quasilattices can be used to generate tilings in real space with properties analogous to those in Penrose tilings, but with different symmetries and in various dimensions. Here we explain that reflection quasilattices only exist in dimensions two, three, and four, and we prove that there is a unique reflection quasilattice in dimension four: the "maximal reflection quasilattice" in terms of dimensionality and symmetry. Unlike crystallographic Bravais lattices, all reflection quasilattices are invariant under rescaling by certain discrete scale factors. We tabulate the complete set of scale factors for all reflection quasilattices in dimension d >2 , and for all those with quadratic irrational scale factors in d =2 .
Viral quasispecies assembly via maximal clique enumeration.
Töpfer, Armin; Marschall, Tobias; Bull, Rowena A; Luciani, Fabio; Schönhuth, Alexander; Beerenwinkel, Niko
2014-03-01
Virus populations can display high genetic diversity within individual hosts. The intra-host collection of viral haplotypes, called viral quasispecies, is an important determinant of virulence, pathogenesis, and treatment outcome. We present HaploClique, a computational approach to reconstruct the structure of a viral quasispecies from next-generation sequencing data as obtained from bulk sequencing of mixed virus samples. We develop a statistical model for paired-end reads accounting for mutations, insertions, and deletions. Using an iterative maximal clique enumeration approach, read pairs are assembled into haplotypes of increasing length, eventually enabling global haplotype assembly. The performance of our quasispecies assembly method is assessed on simulated data for varying population characteristics and sequencing technology parameters. Owing to its paired-end handling, HaploClique compares favorably to state-of-the-art haplotype inference methods. It can reconstruct error-free full-length haplotypes from low coverage samples and detect large insertions and deletions at low frequencies. We applied HaploClique to sequencing data derived from a clinical hepatitis C virus population of an infected patient and discovered a novel deletion of length 357±167 bp that was validated by two independent long-read sequencing experiments. HaploClique is available at https://github.com/armintoepfer/haploclique. A summary of this paper appears in the proceedings of the RECOMB 2014 conference, April 2-5.
Network channel allocation and revenue maximization
Hamalainen, Timo; Joutsensalo, Jyrki
2002-09-01
This paper introduces a model that can be used to share link capacity among customers under different kind of traffic conditions. This model is suitable for different kind of networks like the 4G networks (fast wireless access to wired network) to support connections of given duration that requires a certain quality of service. We study different types of network traffic mixed in a same communication link. A single link is considered as a bottleneck and the goal is to find customer traffic profiles that maximizes the revenue of the link. Presented allocation system accepts every calls and there is not absolute blocking, but the offered data rate/user depends on the network load. Data arrival rate depends on the current link utilization, user's payment (selected CoS class) and delay. The arrival rate is (i) increasing with respect to the offered data rate, (ii) decreasing with respect to the price, (iii) decreasing with respect to the network load, and (iv) decreasing with respect to the delay. As an example, explicit formula obeying these conditions is given and analyzed.
Evolution of correlated multiplexity through stability maximization
Dwivedi, Sanjiv K.; Jalan, Sarika
2017-02-01
Investigating the relation between various structural patterns found in real-world networks and the stability of underlying systems is crucial to understand the importance and evolutionary origin of such patterns. We evolve multiplex networks, comprising antisymmetric couplings in one layer depicting predator-prey relationship and symmetric couplings in the other depicting mutualistic (or competitive) relationship, based on stability maximization through the largest eigenvalue of the corresponding adjacency matrices. We find that there is an emergence of the correlated multiplexity between the mirror nodes as the evolution progresses. Importantly, evolved values of the correlated multiplexity exhibit a dependence on the interlayer coupling strength. Additionally, the interlayer coupling strength governs the evolution of the disassortativity property in the individual layers. We provide analytical understanding to these findings by considering starlike networks representing both the layers. The framework discussed here is useful for understanding principles governing the stability as well as the importance of various patterns in the underlying networks of real-world systems ranging from the brain to ecology which consist of multiple types of interaction behavior.
Viral quasispecies assembly via maximal clique enumeration.
Armin Töpfer
2014-03-01
Full Text Available Virus populations can display high genetic diversity within individual hosts. The intra-host collection of viral haplotypes, called viral quasispecies, is an important determinant of virulence, pathogenesis, and treatment outcome. We present HaploClique, a computational approach to reconstruct the structure of a viral quasispecies from next-generation sequencing data as obtained from bulk sequencing of mixed virus samples. We develop a statistical model for paired-end reads accounting for mutations, insertions, and deletions. Using an iterative maximal clique enumeration approach, read pairs are assembled into haplotypes of increasing length, eventually enabling global haplotype assembly. The performance of our quasispecies assembly method is assessed on simulated data for varying population characteristics and sequencing technology parameters. Owing to its paired-end handling, HaploClique compares favorably to state-of-the-art haplotype inference methods. It can reconstruct error-free full-length haplotypes from low coverage samples and detect large insertions and deletions at low frequencies. We applied HaploClique to sequencing data derived from a clinical hepatitis C virus population of an infected patient and discovered a novel deletion of length 357±167 bp that was validated by two independent long-read sequencing experiments. HaploClique is available at https://github.com/armintoepfer/haploclique. A summary of this paper appears in the proceedings of the RECOMB 2014 conference, April 2-5.
Maximal respiratory pressure in healthy Japanese children
Tagami, Miki; Okuno, Yukako; Matsuda, Tadamitsu; Kawamura, Kenta; Shoji, Ryosuke; Tomita, Kazuhide
2017-01-01
[Purpose] Normal values for respiratory muscle pressures during development in Japanese children have not been reported. The purpose of this study was to investigate respiratory muscle pressures in Japanese children aged 3–12 years. [Subjects and Methods] We measured respiratory muscle pressure values using a manovacuometer without a nose clip, with subjects in a sitting position. Data were collected for ages 3–6 (Group I: 68 subjects), 7–9 (Group II: 86 subjects), and 10–12 (Group III: 64 subjects) years. [Results] The values for respiratory muscle pressures in children were significantly higher with age in both sexes, and were higher in boys than in girls. Correlation coefficients were significant at values of 0.279 to 0.471 for each gender relationship between maximal respiratory pressure and age, height, and weight, respectively. [Conclusion] In this study, we showed pediatric respiratory muscle pressure reference value for each age. In the present study, values for respiratory muscle pressures were lower than Brazilian studies. This suggests that differences in respiratory muscle pressures vary with ethnicity. PMID:28356644
Maximizing exosome colloidal stability following electroporation.
Hood, Joshua L; Scott, Michael J; Wickline, Samuel A
2014-03-01
Development of exosome-based semisynthetic nanovesicles for diagnostic and therapeutic purposes requires novel approaches to load exosomes with cargo. Electroporation has previously been used to load exosomes with RNA. However, investigations into exosome colloidal stability following electroporation have not been considered. Herein, we report the development of a unique trehalose pulse media (TPM) that minimizes exosome aggregation following electroporation. Dynamic light scattering (DLS) and RNA absorbance were employed to determine the extent of exosome aggregation and electroextraction post electroporation in TPM compared to common PBS pulse media or sucrose pulse media (SPM). Use of TPM to disaggregate melanoma exosomes post electroporation was dependent on both exosome concentration and electric field strength. TPM maximized exosome dispersal post electroporation for both homogenous B16 melanoma and heterogeneous human serum-derived populations of exosomes. Moreover, TPM enabled heavy cargo loading of melanoma exosomes with 5nm superparamagnetic iron oxide nanoparticles (SPION5) while maintaining original exosome size and minimizing exosome aggregation as evidenced by transmission electron microscopy. Loading exosomes with SPION5 increased exosome density on sucrose gradients. This provides a simple, label-free means of enriching exogenously modified exosomes and introduces the potential for MRI-driven theranostic exosome investigations in vivo.
Alabbasi, Abdulrahman
2014-06-01
In this paper we consider a cognitive radio multi-input multi-output environment in which we adapt our beamformer to maximize both energy efficiency and signal to interference plus noise ratio (SINR) metrics. Our design considers an underlaying communication using adaptive beamforming schemes combined with the sensing information to achieve an optimal energy efficient system. The proposed schemes maximize the energy efficiency and SINR metrics subject to cognitive radio and quality of service constraints. Since the optimization of energy efficiency problem is not a convex problem, we transform it into a standard semi-definite programming (SDP) form to guarantee a global optimal solution. Analytical solution is provided for one scheme, while the other scheme is left in a standard SDP form. Selected numerical results are used to quantify the impact of the sensing information on the proposed schemes compared to the benchmark ones.
An Integer Programming-based Local Search for Large-scale Maximal Covering Problems
Junha Hwang
2011-02-01
Full Text Available Maximal covering problem (MCP is classified as a linear integer optimization problem which can be effectively solved by integer programming technique. However, as the problem size grows, integerprogramming requires excessive time to get an optimal solution. This paper suggests a method for applying integer programming-based local search (IPbLS to solve large-scale maximal covering problems. IPbLS, which is a hybrid technique combining integer programming and local search, is a kind of local search using integer programming for neighbor generation. IPbLS itself is very effective for MCP. In addition, we improve the performance of IPbLS for MCP through problem reduction based on the current solution. Experimental results show that the proposed method considerably outperforms any other local search techniques and integer programming.
All supersymmetric solutions of minimal supergravity in five dimensions
Gauntlett, Jerome P; Gutowski, Jan B; Hull, Christopher M; Pakis, Stathis; Reall, Harvey S [Department of Physics, Queen Mary, University of London, Mile End Rd, London E1 4NS (United Kingdom)
2003-11-07
All purely bosonic supersymmetric solutions of minimal supergravity in five dimensions are classified. The solutions preserve either one half or all of the supersymmetry. Explicit examples of new solutions are given, including a large family of plane-fronted waves and a maximally supersymmetric analogue of the Goedel universe which lifts to a solution of 11-dimensional supergravity that preserves 20 supersymmetries.
All supersymmetric solutions of minimal supergravity in five dimensions
Gauntlett, J P; Hull, C M; Pakis, S; Reall, H S; Gauntlett, Jerome P.; Gutowski, Jan B.; Hull, Christopher M.; Pakis, Stathis; Reall, Harvey S.
2003-01-01
All purely bosonic supersymmetric solutions of minimal supergravity in five dimensions are classified. The solutions preserve either one half or all of the supersymmetry. Explicit examples of new solutions are given, including a large family of plane-fronted waves and a maximally supersymmetric analogue of the G\\"odel universe which lifts to a solution of eleven dimensional supergravity that preserves 20 supersymmetries.
A Maximal Tractable Class of Soft Constraints
Cohen, D; Jeavons, P; Krokhin, A; 10.1613/jair.1400
2011-01-01
Many researchers in artificial intelligence are beginning to explore the use of soft constraints to express a set of (possibly conflicting) problem requirements. A soft constraint is a function defined on a collection of variables which associates some measure of desirability with each possible combination of values for those variables. However, the crucial question of the computational complexity of finding the optimal solution to a collection of soft constraints has so far received very little attention. In this paper we identify a class of soft binary constraints for which the problem of finding the optimal solution is tractable. In other words, we show that for any given set of such constraints, there exists a polynomial time algorithm to determine the assignment having the best overall combined measure of desirability. This tractable class includes many commonly-occurring soft constraints, such as 'as near as possible' or 'as soon as possible after', as well as crisp constraints such as 'greater than'. F...
Plubtieng Somyot
2009-01-01
Full Text Available Abstract We introduce an iterative scheme for finding a common element of the solution set of a maximal monotone operator and the solution set of the variational inequality problem for an inverse strongly-monotone operator in a uniformly smooth and uniformly convex Banach space, and then we prove weak and strong convergence theorems by using the notion of generalized projection. The result presented in this paper extend and improve the corresponding results of Kamimura et al. (2004, and Iiduka and Takahashi (2008. Finally, we apply our convergence theorem to the convex minimization problem, the problem of finding a zero point of a maximal monotone operator and the complementary problem.
Somyot Plubtieng
2009-01-01
Full Text Available We introduce an iterative scheme for finding a common element of the solution set of a maximal monotone operator and the solution set of the variational inequality problem for an inverse strongly-monotone operator in a uniformly smooth and uniformly convex Banach space, and then we prove weak and strong convergence theorems by using the notion of generalized projection. The result presented in this paper extend and improve the corresponding results of Kamimura et al. (2004, and Iiduka and Takahashi (2008. Finally, we apply our convergence theorem to the convex minimization problem, the problem of finding a zero point of a maximal monotone operator and the complementary problem.
Increasing Efficiency by Maximizing Electrical Output
2016-08-01
installation without the need for further demonstration. This project both (1) allows us to roll out this solution to other installations, and (2...While the requirements of our system are not that demanding, i.e. we have 4 hoses and a wire that connect to the outside world, the ease with which...was limited run time. This precluded any steady state running that allows for more reliable efficiency results. The ORCA system draws more power
Joshi, Pushkar S; Ghosh, Kunal K
2016-11-02
In this era of technology-driven global neuroscience initiatives, the role of the neurotechnology industry remains woefully ambiguous. Here, we explain why industry is essential to the success of these global initiatives, and how it can maximize the scientific impact of these efforts by (1) scaling and ultimately democratizing access to breakthrough neurotechnologies, and (2) commercializing technologies as part of integrated, end-to-end solutions that accelerate neuroscientific discovery. Copyright © 2016 Elsevier Inc. All rights reserved.
Iterative Schemes for Generalized Equilibrium Problem and Two Maximal Monotone Operators
Yao JC
2009-01-01
Full Text Available The purpose of this paper is to introduce and study two new hybrid proximal-point algorithms for finding a common element of the set of solutions to a generalized equilibrium problem and the sets of zeros of two maximal monotone operators in a uniformly smooth and uniformly convex Banach space. We established strong and weak convergence theorems for these two modified hybrid proximal-point algorithms, respectively.
Parametric image alignment using enhanced correlation coefficient maximization.
Evangelidis, Georgios D; Psarakis, Emmanouil Z
2008-10-01
In this work we propose the use of a modified version of the correlation coefficient as a performance criterion for the image alignment problem. The proposed modification has the desirable characteristic of being invariant with respect to photometric distortions. Since the resulting similarity measure is a nonlinear function of the warp parameters, we develop two iterative schemes for its maximization, one based on the forward additive approach and the second on the inverse compositional method. As it is customary in iterative optimization, in each iteration, the nonlinear objective function is approximated by an alternative expression for which the corresponding optimization is simple. In our case we propose an efficient approximation that leads to a closed-form solution (per iteration) which is of low computational complexity, the latter property being particularly strong in our inverse version. The proposed schemes are tested against the Forward Additive Lucas-Kanade and the Simultaneous Inverse Compositional (SIC) algorithm through simulations. Under noisy conditions and photometric distortions, our forward version achieves more accurate alignments and exhibits faster convergence whereas our inverse version has similar performance as the SIC algorithm but at a lower computational complexity.
A Novel Multithreaded Algorithm For Extracting Maximal Chordal Subgraphs
Halappanavar, Mahantesh; Feo, John T.; Dempsey, Kathryn; Ali, Hesham; Bhowmick, Sanjukta
2012-10-25
Chordal graphs are triangulated graphs where any cycle larger than three is bisected by a chord. Many combinatorial optimization problems such as computing the minimum fill-in, the size of the maximum clique and the chromatic number are NP-hard on general graphs but have polynomial time solutions on chordal graphs. In this paper, we present a novel multithreaded algorithm to extract a maximal chordal subgraph from a general graph. Our algorithm is based on an iterative approach where each thread can asynchronously update a subset of edges that are dynamically assigned to it. We implement our algorithm on two different multithreaded architectures – Cray XMT, a massively multithreaded platform, and AMD Magny-Cours, a shared memory multicore platform. In addition to the proof of correctness, we present the performance of our algorithm using a testset of carefully generated synthetical graphs with up to half-a-billion edges and real world networks from gene correlation studies. We demonstrate that our algorithm achieves high scalability for all inputs on both types of architectures.
Plant regeneration from protoplasts of Gentiana straminea Maxim
Shi Guomin
2016-04-01
Full Text Available A protocol is described for plant regeneration from protoplasts of Gentiana straminea Maxim. via somatic embryogenesis. Protoplasts were isolated from embryogenic calli in an enzyme solution composed of 2% Cellulase Onozuka R-10, 0.5% Macerozyme R-10, 0.5% Hemicellulase, and 0.5 M sorbitol with a yield of 3.0 × 106 protoplasts per gram of fresh weight. Liquid, solid-liquid double layer (sLD and agar-pool (aPL culture systems were used for protoplast culture. The aPL culture was the only method that produced embryogenic, regenerative calli. With aPL culture, the highest frequencies of protoplast cell division and colony formation were 39.6% and 16.9%, respectively, on MS medium supplemented with 2 mg/L 2,4-dichlorophenoxyacetic acid (2,4-D and 0.5 mg/L N6-benzylaminopurine (BA. Microcalli were transferred to solid MS medium containing a reduced concentration of 2,4-D (0.5 mg/L to promote the formation of embryogenic calli. Somatic embryos developed into plantlets on MS medium supplemented with 2 mg/L BA at a rate of 43.7%.
Lifshitz and Schrodinger Vacua, Superstar Resolution in Gauged Maximal Supergravities
Liu, Hai-Shan
2013-01-01
We consider the subset of gauged maximal supergravities that consists of the SO(n+1) gauge fields A^{ij} and the scalar deformation T^{ij} of the S^n in the spherical reduction of M-theory or type IIB. We focus on the Abelian Cartan subgroup and the diagonal entries of T^{ij}. The resulting theories can be viewed as the STU models with additional hyperscalars. We find that the theories with only one or two such vectors can be generalized naturally to arbitrary dimensions. The same is true for the D=4 or 5 Einstein-Maxwell theory with such a hyperscalar. The gauge fields become massive, determined by stationary points of the hyperscalars a la the analogous Abelian Higgs mechanism. We obtain classes of Lifshitz and Schrodinger vacua in these theories. The scaling exponent z turns out to be rather restricted, taking fractional or irrational numbers. Tweaking the theories by relaxing the mass parameter or making a small change of the superpotential, we find that solutions with z=2 can emerge. In a different appli...
Network architecture underlying maximal separation of neuronal representations
Ron A Jortner
2013-01-01
Full Text Available One of the most basic and general tasks faced by all nervous systems is extracting relevant information from the organism’s surrounding world. While physical signals available to sensory systems are often continuous, variable, overlapping and noisy, high-level neuronal representations used for decision-making tend to be discrete, specific, invariant, and highly separable. This study addresses the question of how neuronal specificity is generated. Inspired by experimental findings on network architecture in the olfactory system of the locust, I construct a highly simplified theoretical framework which allows for analytic solution of its key properties. For generalized feed-forward systems, I show that an intermediate range of connectivity values between source- and target-populations leads to a combinatorial explosion of wiring possibilities, resulting in input spaces which are, by their very nature, exquisitely sparsely populated. In particular, connection probability ½, as found in the locust antennal-lobe–mushroom-body circuit, serves to maximize separation of neuronal representations across the target Kenyon-cells, and explains their specific and reliable responses. This analysis yields a function expressing response specificity in terms of lower network-parameters; together with appropriate gain control this leads to a simple neuronal algorithm for generating arbitrarily sparse and selective codes and linking network architecture and neural coding. I suggest a way to easily construct ecologically meaningful representations from this code.
Generation and Identification of Ordinary Differential Equations of Maximal Symmetry Algebra
J. C. Ndogmo
2016-01-01
Full Text Available An effective method for generating linear ordinary differential equations of maximal symmetry in their most general form is found, and an explicit expression for the point transformation reducing the equation to its canonical form is obtained. New expressions for the general solution are also found, as well as several identification and other results and a direct proof of the fact that a linear ordinary differential equation is iterative if and only if it is reducible to the canonical form by a point transformation. New classes of solvable equations parameterized by an arbitrary function are also found, together with simple algebraic expressions for the corresponding general solution.
Maximally random jamming of one-component and binary hard-disk fluids in two dimensions.
Xu, Xinliang; Rice, Stuart A
2011-02-01
We report calculations of the density of maximally random jamming of one-component and binary hard-disk fluids. The theoretical structure used provides a common framework for description of the hard-disk liquid-to-hexatic, the liquid-to-hexagonal crystal, and the liquid to maximally random jammed state transitions. Our analysis is based on locating a particular bifurcation of the solutions of the integral equation for the inhomogeneous single-particle density at the transition between different spatial structures. The bifurcation of solutions we study is initiated from the dense metastable fluid, and we associate it with the limit of stability of the fluid, which we identify with the transition from the metastable fluid to a maximally random jammed state. For the one-component hard-disk fluid the predicted packing fraction at which the metastable fluid to maximally random jammed state transition occurs is 0.84, in excellent agreement with the experimental value 0.84 ± 0.02. The corresponding analysis of the limit of stability of a binary hard-disk fluid with specified disk-diameter ratio and disk composition requires extra approximations in the representations of the direct correlation function, the equation of state, and the number of order parameters accounted for. Keeping only the order parameter identified with the largest peak in the structure factor of the highest-density regular lattice with the same disk- diameter ratio and disk composition as the binary fluid, the predicted density of maximally random jamming is found to be 0.84-0.87, depending on the equation of state used, and very weakly dependent on the ratio of disk diameters and the fluid composition, in agreement with both experimental data and computer simulation data.
Poker, Gilad; Zarai, Yoram; Margaliot, Michael; Tuller, Tamir
2014-11-06
Translation is an important stage in gene expression. During this stage, macro-molecules called ribosomes travel along the mRNA strand linking amino acids together in a specific order to create a functioning protein. An important question, related to many biomedical disciplines, is how to maximize protein production. Indeed, translation is known to be one of the most energy-consuming processes in the cell, and it is natural to assume that evolution shaped this process so that it maximizes the protein production rate. If this is indeed so then one can estimate various parameters of the translation machinery by solving an appropriate mathematical optimization problem. The same problem also arises in the context of synthetic biology, namely, re-engineer heterologous genes in order to maximize their translation rate in a host organism. We consider the problem of maximizing the protein production rate using a computational model for translation-elongation called the ribosome flow model (RFM). This model describes the flow of the ribosomes along an mRNA chain of length n using a set of n first-order nonlinear ordinary differential equations. It also includes n + 1 positive parameters: the ribosomal initiation rate into the mRNA chain, and n elongation rates along the chain sites. We show that the steady-state translation rate in the RFM is a strictly concave function of its parameters. This means that the problem of maximizing the translation rate under a suitable constraint always admits a unique solution, and that this solution can be determined using highly efficient algorithms for solving convex optimization problems even for large values of n. Furthermore, our analysis shows that the optimal translation rate can be computed based only on the optimal initiation rate and the elongation rate of the codons near the beginning of the ORF. We discuss some applications of the theoretical results to synthetic biology, molecular evolution, and functional genomics.
Catalan Number and Enumeration of Maximal Outerplanar Graphs
无
2000-01-01
Catalan number is an important class of combinatorial numbers. The maximal outerplanar graphs are important in graph theory. In this paper some formulas to enumerate the numbers of maximal outerplanar graphs by means of the compressing graph and group theory method are given first. Then the relationships between Catalan numbers and the numbers of labeled and unlabeled maximal outerplanar graphs are presented. The computed results verified these formulas.
Maximality-Based Structural Operational Semantics for Petri Nets
Saīdouni, Djamel Eddine; Belala, Nabil; Bouneb, Messaouda
2009-03-01
The goal of this work is to exploit an implementable model, namely the maximality-based labeled transition system, which permits to express true-concurrency in a natural way without splitting actions on their start and end events. One can do this by giving a maximality-based structural operational semantics for the model of Place/Transition Petri nets in terms of maximality-based labeled transition systems structures.
Relative advantage, queue jumping, and welfare maximizing wealth distribution
2006-01-01
Suppose individuals get utilities from the total amount of wealth they hold and from their wealth relative to those immediately below them. This paper studies the distribution of wealth that maximizes an additive welfare function made up of these utilities. It interprets wealth distribution in a control theory framework to show that the welfare maximizing distribution may have unexpected properties. In some circumstances it requires that inequality be maximized at the poorest and richest ends...
Maximizers versus satisficers: Decision-making styles, competence, and outcomes
Parker, Andrew M.; Wändi Bruine de Bruin; Baruch Fischhoff
2007-01-01
Our previous research suggests that people reporting a stronger desire to maximize obtain worse life outcomes (Bruine de Bruin et al., 2007). Here, we examine whether this finding may be explained by the decision-making styles of self-reported maximizers. Expanding on Schwartz et al.\\ (2002), we find that self-reported maximizers are more likely to show problematic decision-making styles, as evidenced by self-reports of less behavioral coping, greater dependence on others when making decision...
Maximally entangled states in pseudo-telepathy games
Mančinska, Laura
2015-01-01
A pseudo-telepathy game is a nonlocal game which can be won with probability one using some finite-dimensional quantum strategy but not using a classical one. Our central question is whether there exist two-party pseudo-telepathy games which cannot be won with probability one using a maximally entangled state. Towards answering this question, we develop conditions under which maximally entangled states suffice. In particular, we show that maximally entangled states suffice for weak projection...
Maximal stochastic transport in the Lorenz equations
Agarwal, Sahil, E-mail: sahil.agarwal@yale.edu [Program in Applied Mathematics, Yale University, New Haven (United States); Wettlaufer, J.S., E-mail: john.wettlaufer@yale.edu [Program in Applied Mathematics, Yale University, New Haven (United States); Departments of Geology & Geophysics, Mathematics and Physics, Yale University, New Haven (United States); Mathematical Institute, University of Oxford, Oxford (United Kingdom); Nordita, Royal Institute of Technology and Stockholm University, Stockholm (Sweden)
2016-01-08
We calculate the stochastic upper bounds for the Lorenz equations using an extension of the background method. In analogy with Rayleigh–Bénard convection the upper bounds are for heat transport versus Rayleigh number. As might be expected, the stochastic upper bounds are larger than the deterministic counterpart of Souza and Doering [1], but their variation with noise amplitude exhibits interesting behavior. Below the transition to chaotic dynamics the upper bounds increase monotonically with noise amplitude. However, in the chaotic regime this monotonicity depends on the number of realizations in the ensemble; at a particular Rayleigh number the bound may increase or decrease with noise amplitude. The origin of this behavior is the coupling between the noise and unstable periodic orbits, the degree of which depends on the degree to which the ensemble represents the ergodic set. This is confirmed by examining the close returns plots of the full solutions to the stochastic equations and the numerical convergence of the noise correlations. The numerical convergence of both the ensemble and time averages of the noise correlations is sufficiently slow that it is the limiting aspect of the realization of these bounds. Finally, we note that the full solutions of the stochastic equations demonstrate that the effect of noise is equivalent to the effect of chaos.
Weighted-Sum-Rate-Maximizing Linear Transceiver Filters for the K-User MIMO Interference Channel
Shin, Joonwoo
2012-01-01
This letter is concerned with transmit and receive filter optimization for the K-user MIMO interference channel. Specifically, linear transmit and receive filter sets are designed which maximize the weighted sum rate while allowing each transmitter to utilize only the local channel state information. Our approach is based on extending the existing method of minimizing the weighted mean squared error (MSE) for the MIMO broadcast channel to the K-user interference channel at hand. For the case of the individual transmitter power constraint, however, a straightforward generalization of the existing method does not reveal a viable solution. It is in fact shown that there exists no closed-form solution for the transmit filter but simple one-dimensional parameter search yields the desired solution. Compared to the direct filter optimization using gradient-based search, our solution requires considerably less computational complexity and a smaller amount of feedback resources while achieving essentially the same lev...
Calbet, J A L; Lundby, C; Sander, M
2006-01-01
During maximal whole body exercise VO2 peak is limited by O2 delivery. In turn, it is though that blood flow at near-maximal exercise must be restrained by the sympathetic nervous system to maintain mean arterial pressure. To determine whether enhancing vasodilation across the leg results in higher...... O2 delivery and leg VO2 during near-maximal and maximal exercise in humans, seven men performed two maximal incremental exercise tests on the cycle ergometer. In random order, one test was performed with and one without (control exercise) infusion of ATP (8 mg in 1 ml of isotonic saline solution......) into the right femoral artery at a rate of 80 microg.kg body mass-1.min-1. During near-maximal exercise (92% of VO2 peak), the infusion of ATP increased leg vascular conductance (+43%, P...
Sums of magnetic eigenvalues are maximal on rotationally symmetric domains
Laugesen, Richard S; Roy, Arindam
2011-01-01
The sum of the first n energy levels of the planar Laplacian with constant magnetic field of given total flux is shown to be maximal among triangles for the equilateral triangle, under normalization of the ratio (moment of inertia)/(area)^3 on the domain. The result holds for both Dirichlet and Neumann boundary conditions, with an analogue for Robin (or de Gennes) boundary conditions too. The square similarly maximizes the eigenvalue sum among parallelograms, and the disk maximizes among ellipses. More generally, a domain with rotational symmetry will maximize the magnetic eigenvalue sum among all linear images of that domain. These results are new even for the ground state energy (n=1).
Sums of Laplace eigenvalues - rotationally symmetric maximizers in the plane
Laugesen, R S
2010-01-01
The sum of the first $n \\geq 1$ eigenvalues of the Laplacian is shown to be maximal among triangles for the equilateral triangle, maximal among parallelograms for the square, and maximal among ellipses for the disk, provided the ratio $\\text{(area)}^3/\\text{(moment of inertia)}$ for the domain is fixed. This result holds for both Dirichlet and Neumann eigenvalues, and similar conclusions are derived for Robin boundary conditions and Schr\\"odinger eigenvalues of potentials that grow at infinity. A key ingredient in the method is the tight frame property of the roots of unity. For general convex plane domains, the disk is conjectured to maximize sums of Neumann eigenvalues.
Maximizing collections from patient services billing.
Orenstein, Gil C; Kaye, Alan David; Fox, Charles J; Urman, Richard D
2014-01-01
The field of medical billing and collections continues to evolve along with current developments in U.S. healthcare reform. Although there has been a significant shift of payment responsibility from third-party payers to patients, many practices are not equipped to handle this change. As patients' financial obligations increase, the physician's ability to collect from patients will become increasingly important. Inability to collect bills receivable can adversely affect the revenue cycle of the practice. Solutions include improvement of the point-of-service collection processes, properly trained office staff, written financial policies, and the use of technology to facilitate online payments. Patients should fully understand their financial responsibilities and options available to them for payment of services rendered.
Trend of maximal inspiratory pressure in mechanically ventilated patients: predictors
Pedro Caruso
2008-01-01
Full Text Available INTRODUCTION: It is known that mechanical ventilation and many of its features may affect the evolution of inspiratory muscle strength during ventilation. However, this evolution has not been described, nor have its predictors been studied. In addition, a probable parallel between inspiratory and limb muscle strength evolution has not been investigated. OBJECTIVE: To describe the variation over time of maximal inspiratory pressure during mechanical ventilation and its predictors. We also studied the possible relationship between the evolution of maximal inspiratory pressure and limb muscle strength. METHODS: A prospective observational study was performed in consecutive patients submitted to mechanical ventilation for > 72 hours. The maximal inspiratory pressure trend was evaluated by the linear regression of the daily maximal inspiratory pressure and a logistic regression analysis was used to look for independent maximal inspiratory pressure trend predictors. Limb muscle strength was evaluated using the Medical Research Council score. RESULTS: One hundred and sixteen patients were studied, forty-four of whom (37.9% presented a decrease in maximal inspiratory pressure over time. The members of the group in which maximal inspiratory pressure decreased underwent deeper sedation, spent less time in pressure support ventilation and were extubated less frequently. The only independent predictor of the maximal inspiratory pressure trend was the level of sedation (OR=1.55, 95% CI 1.003 - 2.408; p = 0.049. There was no relationship between the maximal inspiratory pressure trend and limb muscle strength. CONCLUSIONS: Around forty percent of the mechanically ventilated patients had a decreased maximal inspiratory pressure during mechanical ventilation, which was independently associated with deeper levels of sedation. There was no relationship between the evolution of maximal inspiratory pressure and the muscular strength of the limb.
A Low-Dimensional Model for the Maximal Amplification Factor of Bichromatic Wave Groups
W. N. Tan
2003-11-01
Full Text Available We consider a low-dimensional model derived from the nonlinear-Schrödinger equation that describes the evolution of a special class of surface gravity wave groups, namely bichromatic waves. The model takes only two modes into account, namely the primary mode and the third order mode which is known to be most relevant for bichromatic waves with small frequency difference. Given an initial condition, an analytical expression for the maximal amplitude of the evolution of this initial wave group according to the model can be readily obtained. The aim of this investigation is to predict the amplification factor defined as the quotient between the maximal amplitude over all time & space and the initial maximal amplitude. Although this is a problem of general interest, as a case study, initial conditions in the form of a bichromatic wave group are taken. Using the low dimensional model it is found that the least upper bound of the maximal amplification factor for this bichromatic wave group is √2. To validate the analytical results of this model, a numerical simulation on the full model is also performed. As can be expected, good agreement is observed between analytical and numerical solutions for a certain range of parameters; when the initial amplitude is not too large, or when the difference of frequency is not too small. The results are relevant and motivated for the generation of waves in hydrodynamic laboratories.
Detrimental Relations of Maximization with Academic and Career Attitudes
Dahling, Jason J.; Thompson, Mindi N.
2013-01-01
Maximization refers to a decision-making style that involves seeking the single best option when making a choice, which is generally dysfunctional because people are limited in their ability to rationally evaluate all options and identify the single best outcome. The vocational consequences of maximization are examined in two samples, college…
An Overview of Maximal Unitarity at Two Loops
Johansson, Henrik; Larsen, Kasper J.
2012-01-01
We discuss the extension of the maximal-unitarity method to two loops, focusing on the example of the planar double box. Maximal cuts are reinterpreted as contour integrals, with the choice of contour fixed by the requirement that integrals of total derivatives vanish on it. The resulting formulae, like their one-loop counterparts, can be applied either analytically or numerically.
The Negative Consequences of Maximizing in Friendship Selection.
Newman, David B; Schug, Joanna; Yuki, Masaki; Yamada, Junko; Nezlek, John B
2017-02-27
Previous studies have shown that the maximizing orientation, reflecting a motivation to select the best option among a given set of choices, is associated with various negative psychological outcomes. In the present studies, we examined whether these relationships extend to friendship selection and how the number of options for friends moderated these effects. Across 5 studies, maximizing in selecting friends was negatively related to life satisfaction, positive affect, and self-esteem, and was positively related to negative affect and regret. In Study 1, a maximizing in selecting friends scale was created, and regret mediated the relationships between maximizing and well-being. In a naturalistic setting in Studies 2a and 2b, the tendency to maximize among those who participated in the fraternity and sorority recruitment process was negatively related to satisfaction with their selection, and positively related to regret and negative affect. In Study 3, daily levels of maximizing were negatively related to daily well-being, and these relationships were mediated by daily regret. In Study 4, we extended the findings to samples from the U.S. and Japan. When participants who tended to maximize were faced with many choices, operationalized as the daily number of friends met (Study 3) and relational mobility (Study 4), the opportunities to regret a decision increased and further diminished well-being. These findings imply that, paradoxically, attempts to maximize when selecting potential friends is detrimental to one's well-being. (PsycINFO Database Record (c) 2017 APA, all rights reserved).
Haemodynamics during maximal exercise after coronary bypass surgery
P.W.J.C. Serruys (Patrick); M.F. Rousseau (Francois); J. Cosyns; R. Ponlot; L.A. Brasseur; J-M.R. Detry (Jean-Marie)
1978-01-01
textabstractFifty patients underwent an objective measurement of physical working capacity by means of a multistage test of maximally tolerated exertion before and after coronary bypass surgery; 29 patients also had haemodynamic measurements during maximal exercise before and after coronary bypass s
Utility maximization under solvency constraints and unhedgeable risks
T. Kleinow; A. Pelsser
2008-01-01
We consider the utility maximization problem for an investor who faces a solvency or risk constraint in addition to a budget constraint. The investor wishes to maximize her expected utility from terminal wealth subject to a bound on her expected solvency at maturity. We measure solvency using a solv
Detrimental Relations of Maximization with Academic and Career Attitudes
Dahling, Jason J.; Thompson, Mindi N.
2013-01-01
Maximization refers to a decision-making style that involves seeking the single best option when making a choice, which is generally dysfunctional because people are limited in their ability to rationally evaluate all options and identify the single best outcome. The vocational consequences of maximization are examined in two samples, college…
On a discrete version of Tanaka's theorem for maximal functions
Bober, Jonathan; Hughes, Kevin; Pierce, Lillian B
2010-01-01
In this paper we prove a discrete version of Tanaka's Theorem \\cite{Ta} for the Hardy-Littlewood maximal operator in dimension $n=1$, both in the non-centered and centered cases. For the discrete non-centered maximal operator $\\wM $ we prove that, given a function $f: \\Z \\to \\R$ of bounded variation,
Haemodynamics during maximal exercise after coronary bypass surgery
P.W.J.C. Serruys (Patrick); M.F. Rousseau (Francois); J. Cosyns; R. Ponlot; L.A. Brasseur; J-M.R. Detry (Jean-Marie)
1978-01-01
textabstractFifty patients underwent an objective measurement of physical working capacity by means of a multistage test of maximally tolerated exertion before and after coronary bypass surgery; 29 patients also had haemodynamic measurements during maximal exercise before and after coronary bypass
A Class of Maximal Functions with Oscillating Kernels
Ahmad AL-SALMAN
2007-01-01
The author studies the Lp mapping properties of a class of maximal functions that are related to oscillatory singular integral operators. Lp estimates, as well as the corresponding weighted estimates of such maximal functions, are obtained. Moreover, several applications of our results are highlighted.
ESTIMATES FOR THE MAXIMAL MULTILINEAR SINGULAR INTEGRAL OPERATORS
Yulan Jiao
2010-01-01
In this paper,some mapping properties are considered for the maximal multilinear singular integral operator whose kernel satisfies certain minimum regularity condition.It is proved that certain uniform local estimate for doubly truncated operators implies the LP(Rn)(1
maximal operator.
Maximally Flat Waveforms Operation of Class-F Power Amplifiers
V. Krizhanovski
2001-04-01
Full Text Available The requirements to output network's impedance on higher harmoniccomponents and appropriate input driving for formation maximally flatwaveforms of drain current and voltage were presented. Using suchwaveforms allows obtaining maximal efficiency and output powercapability of class-F power amplifiers.
Entanglement of Superpositions of Orthogonal Maximally Entangled States
ZHANG Dao-Hua; ZHOU Duan-Lu; FAN Heng
2010-01-01
@@ We study the entanglement properties of the superposed state of orthogonal maximally entangled states.It is shown that the superposed state is maximally entangled and the superposed state is separable.The relation between the superposed state and the mutually unbiased state is discussed.
CHROMATIC NUMBER OF SQUARE OF MAXIMAL OUTERPLANAR GRAPHS
Luo Xiaofang
2007-01-01
Let χ(G2) denote the chromatic number of the square of a maximal outerplanar graph G and Q denote a maximal outerplanar graph obtained by adding three chords and χ(G2) = Δ + 2 if and only if G is Q, where Δ represents the maximum degree of G.
SAR image target segmentation based on entropy maximization and morphology
柏正尧; 刘洲峰; 何佩琨
2004-01-01
Entropy maximization thresholding is a simple, effective image segmentation method. The relation between the histogram entropy and the gray level of an image is analyzed. An approach, which speeds the computation of optimal threshold based on entropy maximization, is proposed. The suggested method has been applied to the synthetic aperture radar (SAR) image targets segmentation. Mathematical morphology works well in reducing the residual noise.
Effect of Age and Other Factors on Maximal Heart Rate.
Londeree, Ben R.; Moeschberger, Melvin L.
1982-01-01
To reduce confusion regarding reported effects of age on maximal exercise heart rate, a comprehensive review of the relevant English literature was conducted. Data on maximal heart rate after exercising with a bicycle, a treadmill, and after swimming were analyzed with regard to physical fitness and to age, sex, and racial differences. (Authors/PP)
Maximal aggregation of polynomial dynamical systems.
Cardelli, Luca; Tribastone, Mirco; Tschaikowski, Max; Vandin, Andrea
2017-09-19
Ordinary differential equations (ODEs) with polynomial derivatives are a fundamental tool for understanding the dynamics of systems across many branches of science, but our ability to gain mechanistic insight and effectively conduct numerical evaluations is critically hindered when dealing with large models. Here we propose an aggregation technique that rests on two notions of equivalence relating ODE variables whenever they have the same solution (backward criterion) or if a self-consistent system can be written for describing the evolution of sums of variables in the same equivalence class (forward criterion). A key feature of our proposal is to encode a polynomial ODE system into a finitary structure akin to a formal chemical reaction network. This enables the development of a discrete algorithm to efficiently compute the largest equivalence, building on approaches rooted in computer science to minimize basic models of computation through iterative partition refinements. The physical interpretability of the aggregation is shown on polynomial ODE systems for biochemical reaction networks, gene regulatory networks, and evolutionary game theory.
On the maximal efficiency of the collisional Penrose process
Leiderschneider, Elly
2015-01-01
The center of mass (CM) energy in a collisional Penrose process - a collision taking place within the ergosphere of a Kerr black hole - can diverge under suitable extreme conditions (maximal Kerr, near horizon collision and suitable impact parameters). We present an analytic expression for the CM energy, refining expressions given in the literature. Even though the CM energy diverges, we show that the maximal energy attained by a particle that escapes the black hole's gravitational pull and reaches infinity is modest. We obtain an analytic expression for the energy of an escaping particle resulting from a collisional Penrose process, and apply it to derive the maximal energy and the maximal efficiency for several physical scenarios: pair annihilation, Compton scattering, and the elastic scattering of two massive particles. In all physically reasonable cases (in which the incident particles initially fall from infinity towards the black hole) the maximal energy (and the corresponding efficiency) are only one o...
Maximally Distant Codes Allocation Using Chemical Reaction Optimization with Enhanced Exploration
Taisir Eldos
2016-01-01
Full Text Available Error correcting codes, also known as error controlling codes, are sets of codes with redundancy that provides for error detection and correction, for fault tolerant operations like data transmission over noisy channels or data retention using storage media with possible physical defects. The challenge is to find a set of m codes out of 2n available n-bit combinations, such that the aggregate hamming distance among those codewords and/or the minimum distance is maximized. Due to the prohibitively large solution spaces of practically sized problems, greedy algorithms are used to generate quick and dirty solutions. However, modern evolutionary search techniques like genetic algorithms, swarm particles, gravitational search, and others, offer more feasible solutions, yielding near optimal solutions in exchange for some computational time. The Chemical Reaction Optimization (CRO, which is inspired by the molecular reactions towards a minimal energy state, emerged recently as an efficient optimization technique. However, like the other techniques, its internal dynamics are hard to control towards convergence, yielding poor performance in many situations. In this research, we proposed an enhanced exploration strategy to overcome this problem, and compared it with the standard threshold based exploration strategy in solving the maximally distant codes allocation problem. Test results showed that the enhancement provided better performance on most metrics.
The Median Solution of the Newsvendor Problem and Some Observations
Sinha Pritibhushan
2015-09-01
Full Text Available We consider the median solution of the Newsvendor Problem. Some properties of such a solution are shown through a theoretical analysis and a numerical experiment. Sometimes, though not often, median solution may be better than solutions maximizing expected profit, or maximizing minimum possible, over distribution with the same average and standard deviation, expected profit, according to some criteria. We discuss the practical suitability of the objective function set and the solution derived, for the Newsvendor Problem, and other such random optimization problems.
Chair Talk: Resources to Maximize Administrative Efforts
MacDonald, H.; Chan, M. A.; Bierly, E. W.; Manduca, C. A.; Ormand, C. J.
2009-12-01
, dealing with difficult situations, working with alumni). Through the Association for Women Geoscientists, we have offered annual one-hour lunch discussions at AGU and GSA meetings on issues facing women chairs and deans. Focusing on a different topic each year, these discussions include sharing good solutions, problem solving on various case scenarios, and so forth. In addition, the Building Strong Geoscience Departments program has offered workshops on different aspects of building strong geoscience departments, distributed reports, and made a variety of materials that would be useful to geoscience chairs available on their website. These programs and resources should continue and build to provide more continuity within departments and to increase a broader experience base of faculty. One of the greatest resources for chairs is to have personal connections with other chairs (via these programs), who can be called upon for advice, ideas, or general support. The sense of collective community could act in a powerful way to inspire and encourage more innovations and creative solutions to promote stronger departments.
Berthon, P; Fellmann, N
2002-09-01
The maximal aerobic velocity concept developed since eighties is considered as either the minimal velocity which elicits the maximal aerobic consumption or as the "velocity associated to maximal oxygen consumption". Different methods for measuring maximal aerobic velocity on treadmill in laboratory conditions have been elaborated, but all these specific protocols measure V(amax) either during a maximal oxygen consumption test or with an association of such a test. An inaccurate method presents a certain number of problems in the subsequent use of the results, for example in the elaboration of training programs, in the study of repeatability or in the determination of individual limit time. This study analyzes 14 different methods to understand their interests and limits in view to propose a general methodology for measuring V(amax). In brief, the test should be progressive and maximal without any rest period and of 17 to 20 min total duration. It should begin with a five min warm-up at 60-70% of the maximal aerobic power of the subjects. The beginning of the trial should be fixed so that four or five steps have to be run. The duration of the steps should be three min with a 1% slope and an increasing speed of 1.5 km x h(-1) until complete exhaustion. The last steps could be reduced at two min for a 1 km x h(-1) increment. The maximal aerobic velocity is adjusted in relation to duration of the last step.
Listing All Maximal Cliques in Large Sparse Real-World Graphs
Eppstein, David
2011-01-01
We implement a new algorithm for listing all maximal cliques in sparse graphs due to Eppstein, L\\"offler, and Strash (ISAAC 2010) and analyze its performance on a large corpus of real-world graphs. Our analysis shows that this algorithm is the first to offer a practical solution to listing all maximal cliques in large sparse graphs. All other theoretically-fast algorithms for sparse graphs have been shown to be significantly slower than the algorithm of Tomita et al. (Theoretical Computer Science, 2006) in practice. However, the algorithm of Tomita et al. uses an adjacency matrix, which requires too much space for large sparse graphs. Our new algorithm opens the door for fast analysis of large sparse graphs whose adjacency matrix will not fit into working memory.
OPTUM : Optimum Portfolio Tool for Utility Maximization documentation and user's guide.
VanKuiken, J. C.; Jusko, M. J.; Samsa, M. E.; Decision and Information Sciences
2008-09-30
The Optimum Portfolio Tool for Utility Maximization (OPTUM) is a versatile and powerful tool for selecting, optimizing, and analyzing portfolios. The software introduces a compact interface that facilitates problem definition, complex constraint specification, and portfolio analysis. The tool allows simple comparisons between user-preferred choices and optimized selections. OPTUM uses a portable, efficient, mixed-integer optimization engine (lp-solve) to derive the optimal mix of projects that satisfies the constraints and maximizes the total portfolio utility. OPTUM provides advanced features, such as convenient menus for specifying conditional constraints and specialized graphical displays of the optimal frontier and alternative solutions to assist in sensitivity visualization. OPTUM can be readily applied to other nonportfolio, resource-constrained optimization problems.
Throughput maximization for buffer-aided hybrid half-/full-duplex relaying with self-interference
Khafagy, Mohammad Galal
2015-06-01
In this work, we consider a two-hop cooperative setting where a source communicates with a destination through an intermediate relay node with a buffer. Unlike the existing body of work on buffer-aided half-duplex relaying, we consider a hybrid half-/full-duplex relaying scenario with loopback interference in the full-duplex mode. Depending on the channel outage and buffer states that are assumed available at the transmitters, the source and relay may either transmit simultaneously or revert to orthogonal transmission. Specifically, a joint source/relay scheduling and relaying mode selection mechanism is proposed to maximize the end-to-end throughput. The throughput maximization problem is converted to a linear program where the exact global optimal solution is efficiently obtained via standard convex/linear numerical optimization tools. Finally, the theoretical findings are corroborated with event-based simulations to provide the necessary performance validation.
Inquiry in bibliography some of the bustan`s maxim
sajjad rahmatian
2016-12-01
Full Text Available Sa`di is on of those poets who`s has placed a special position to preaching and guiding the people and among his works, allocated throughout the text of bustan to advice and maxim on legal and ethical various subjects. Surely, sa`di on the way of to compose this work and expression of its moral point, direct or indirect have been affected by some previous sources and possibly using their content. The main purpose of this article is that the pay review of basis and sources of bustan`s maxims and show that sa`di when expression the maxims of this work has been affected by which of the texts and works. For this purpose is tried to with search and research on the resources that have been allocated more or less to the aphorisms, to discover and extract traces of influence sa`di from their moral and didactic content. From the most important the finding of this study can be mentioned that indirect effect of some pahlavi books of maxim (like maxims of azarbad marespandan and bozorgmehr book of maxim and also noted sa`di directly influenced of moral and ethical works of poets and writers before him, and of this, sa`di`s influence from abo- shakur balkhi maxims, ferdowsi and keikavus is remarkable and noteworthy.
Distributive Network Utility Maximization (NUM) over Time-Varying Fading Channels
Chen, Junting; Lau, Vincent K N
2011-01-01
Distributed network utility maximization (NUM) has received an increasing intensity of interest over the past few years. Distributed solutions (e.g., the primal-dual gradient method) have been intensively investigated under fading channels. As such distributed solutions involve iterative updating and explicit message passing, it is unrealistic to assume that the wireless channel remains unchanged during the iterations. Unfortunately, the behavior of those distributed solutions under time-varying channels is in general unknown. In this paper, we shall investigate the convergence behavior and tracking errors of the iterative primal-dual scaled gradient algorithm (PDSGA) with dynamic scaling matrices (DSC) for solving distributive NUM problems under time-varying fading channels. We shall also study a specific application example, namely the multi-commodity flow control and multi-carrier power allocation problem in multi-hop ad hoc networks. Our analysis shows that the PDSGA converges to a limit region rather tha...
Attractors, black objects and holographic RG flows in 5d maximal gauged supergravities
Hristov, Kiril; Rota, Andrea [Dipartimento di Fisica, Università di Milano-Bicocca,and INFN, sezione di Milano-Bicocca,I-20126 Milano (Italy)
2014-03-12
We perform a systematic search for static solutions in different sectors of 5d N=8 supergravities with compact and non-compact gauged R-symmetry groups, finding new and listing already known backgrounds. Due to the variety of possible gauge groups and resulting scalar potentials, the maximally symmetric vacua we encounter in these theories can be Minkowski, de Sitter, or anti-de Sitter. There exist BPS and non-BPS near-horizon geometries and full solutions with all these three types of asymptotics, corresponding to black holes, branes, strings, rings, and other black objects with more exotic horizon topologies, supported by U(1) and SU(2) charges. The asymptotically AdS{sub 5} solutions also have a clear holographic interpretation as RG flows of field theories on D3 branes, wrapped on compact 2- and 3-manifolds.
Malley, Philip P A; Grossman, Jarod N; Kahan, Tara F
2017-09-27
We measured photolysis kinetics of the PAH anthracene in aqueous solution, in bulk ice, and at ice surfaces in the presence and absence of chromophoric dissolved organic matter (CDOM). Self-association, which occurs readily at ice surfaces, may be responsible for the faster anthracene photolysis observed there. Photolysis rate constants in liquid water increased under conditions where anthracene self-association was observed. Concomitantly, kinetics changed from first-order to second-order, indicating that the photolysis mechanism at ice surfaces might be different than that in aqueous solution. Other factors that could lead to faster photolysis at ice surfaces were also investigated. Increased photon fluxes due to scattering in the ice samples can account for at most 20% of the observed rate increase, and other factors including singlet oxygen ((1)O2*) production and changes in pH and polarity were determined not to be responsible for the faster photolysis. CDOM (in the form of fulvic acid (FA)) did not affect anthracene photolysis kinetics in aqueous solution but suppressed photolysis in ice cubes and ice granules (by 30% and 56%, respectively). This was primarily due to competitive photon absorption (the inner filter effect). Freeze-concentration (or "salting out") appears to slightly increase the suppressing effects of FA on anthracene photolysis. This may be due to increased competitive photon absorption or to physical interactions between anthracene and FA.
Maximal strength training improves cycling economy in competitive cyclists.
Sunde, Arnstein; Støren, Oyvind; Bjerkaas, Marius; Larsen, Morten H; Hoff, Jan; Helgerud, Jan
2010-08-01
The purpose of the present study was to investigate the effect of maximal strength training on cycling economy (CE) at 70% of maximal oxygen consumption (Vo2max), work efficiency in cycling at 70% Vo2max, and time to exhaustion at maximal aerobic power. Responses in 1 repetition maximum (1RM) and rate of force development (RFD) in half-squats, Vo2max, CE, work efficiency, and time to exhaustion at maximal aerobic power were examined. Sixteen competitive road cyclists (12 men and 4 women) were randomly assigned into either an intervention or a control group. Thirteen (10 men and 3 women) cyclists completed the study. The intervention group (7 men and 1 woman) performed half-squats, 4 sets of 4 repetitions maximum, 3 times per week for 8 weeks, as a supplement to their normal endurance training. The control group continued their normal endurance training during the same period. The intervention manifested significant (p < 0.05) improvements in 1RM (14.2%), RFD (16.7%), CE (4.8%), work efficiency (4.7%), and time to exhaustion at pre-intervention maximal aerobic power (17.2%). No changes were found in Vo2max or body weight. The control group exhibited an improvement in work efficiency (1.4%), but this improvement was significantly (p < 0.05) smaller than that in the intervention group. No changes from pre- to postvalues in any of the other parameters were apparent in the control group. In conclusion, maximal strength training for 8 weeks improved CE and efficiency and increased time to exhaustion at maximal aerobic power among competitive road cyclists, without change in maximal oxygen uptake, cadence, or body weight. Based on the results from the present study, we advise cyclists to include maximal strength training in their training programs.
The Maximal Graded Left Quotient Algebra of a Graded Algebra
Gonzalo ARANDA PINO; Mercedes SILES MOLINA
2006-01-01
We construct the maximal graded left quotient algebra of every graded algebra A without homogeneous total right zero divisors as the direct limit of graded homomorphisms (of left A-modules)from graded dense left ideals of A into a graded left quotient algebra of A. In the case of a superalgebra,and with some extra hypothesis, we prove that the component in the neutral element of the group of the maximal graded left quotient algebra coincides with the maximal left quotient algebra of the component in the neutral element of the group of the superalgebra.
Maximal regularity of second order delay equations in Banach spaces
无
2010-01-01
We give necessary and sufficient conditions of Lp-maximal regularity(resp.B sp ,q-maximal regularity or F sp ,q-maximal regularity) for the second order delay equations:u″(t)=Au(t) + Gu’t + F u t + f(t), t ∈ [0, 2π] with periodic boundary conditions u(0)=u(2π), u′(0)=u′(2π), where A is a closed operator in a Banach space X,F and G are delay operators on Lp([-2π, 0];X)(resp.Bsp ,q([2π, 0];X) or Fsp,q([-2π, 0;X])).
Building hospital TQM teams: effective polarity analysis and maximization.
Hurst, J B
1996-09-01
Building and maintaining teams require careful attention to and maximization of such polar opposites (¿polarities¿) as individual and team, directive and participatory leadership, task and process, and stability and change. Analyzing systematic elements of any polarity and listing blocks, supports, and flexible ways to maximize it will prevent the negative consequences that occur when treating a polarity like a solvable problem. Flexible, well-timed shifts from pole to pole result in the maximization of upside and minimization of downside consequences.
People believe each other to be selfish hedonic maximizers.
De Vito, Stefania; Bonnefon, Jean-François
2014-10-01
Current computational models of theory of mind typically assume that humans believe each other to selfishly maximize utility, for a conception of utility that makes it indistinguishable from personal gains. We argue that this conception is at odds with established facts about human altruism, as well as the altruism that humans expect from each other. We report two experiments showing that people expect other agents to selfishly maximize their pleasure, even when these other agents behave altruistically. Accordingly, defining utility as pleasure permits us to reconcile the assumption that humans expect each other to selfishly maximize utility with the fact that humans expect each other to behave altruistically.
Lp Estimates of Rough Maximal Functions Along Surfaces with Applications
Ahmad AL-SALMAN; Abdulla M. JARRAH
2016-01-01
In this paper, we study the Lp mapping properties of certain class of maximal oscillatory singular integral operators. We prove a general theorem for a class of maximal functions along surfaces. As a consequence of such theorem, we establish the Lp boundedness of various maximal oscillatory singular integrals provided that their kernels belong to the natural space L log L(Sn−1). Moreover, we highlight some additional results concerning operators with kernels in certain block spaces. The results in this paper substantially improve previously known results.
2006-01-01
Radio frequency identification (RFID) is one of today s most anticipated technologies for a broad range of enterprises. Based on the promise of lower operating costs combined with more accurate product and asset information, organizations .Rfrom manufacturers to government agencies, retailers to healthcare providers , Rare introducing RFID technologies in the supply chain, for asset tracking and management, and for security and regulatory purposes.
Quevedo, Hernando
2012-01-01
A class of exact solutions of the Einstein-Maxwell equations is presented which contains infinite sets of gravitoelectric, gravitomagnetic and electromagnetic multipole moments. The multipolar structure of the solutions indicates that they can be used to describe the exterior gravitational field of an arbitrarily rotating mass distribution endowed with an electromagnetic field. The presence of gravitational multipoles completely changes the structure of the spacetime because of the appearance of naked singularities in a confined spatial region. The possibility of covering this region with interior solutions is analyzed in the case of a particular solution with quadrupole moment.
Maximally entangled state can be a mixed state
Li, Zong-Guo; Fei, Shao-Ming; Fan, Heng; Liu, W M
2009-01-01
We present mixed maximally entangled states in d\\otimes d' (d'\\geq 2d) spaces. This result is beyond the generally accepted fact that all maximally entangled states are pure. These states possess important properties of the pure maximally entangled states in $d\\otimes d$ systems, for example, they can be used as a resource for faithful teleportation, their local distinguishability property is also the same as the pure states case. On the other hand, one advantage of these mixed maximally entangled states is that the decoherence induced by certain noisy quantum channel does not destroy their entanglement. Thus one party of these mixed states can be sent through this channel to arbitrary distance while still keeping them as a valuable resource for quantum information processing. We also propose a scheme to prepare these states and confirm their advantage in NMR physical system.
Groups Satisfying the Maximal Condition on Non-modular Subgroups
Maria De Falco; Carmela Musella
2005-01-01
In this paper, (generalized) soluble groups for which the set of non-modular subgroups verifies the maximal condition and groups for which the set of non-permutable subgroups satisfies the same property are classified.
Maximizing antimalarial efficacy and the importance of dosing strategies
Beeson, James G; Boeuf, Philippe; Fowkes, Freya J I
2015-01-01
.... Without new drugs to replace artemisinins, it is essential to define dosing strategies that maximize therapeutic efficacy, limit the spread of resistance, and preserve the clinical value of ACTs...
Maximal entanglement versus entropy for mixed quantum states
Wei, T C; Goldbart, P M; Kwiat, P G; Munro, W J; Verstraete, F; Wei, Tzu-Chieh; Nemoto, Kae; Goldbart, Paul M.; Kwiat, Paul G.; Munro, William J.; Verstraete, Frank
2003-01-01
Maximally entangled mixed states are those states that, for a given mixedness, achieve the greatest possible entanglement. For two-qubit systems and for various combinations of entanglement and mixedness measures, the form of the corresponding maximally entangled mixed states is determined primarily analytically. As measures of entanglement, we consider entanglement of formation, relative entropy of entanglement, and negativity; as measures of mixedness, we consider linear and von Neumann entropies. We show that the forms of the maximally entangled mixed states can vary with the combination of (entanglement and mixedness) measures chosen. Moreover, for certain combinations, the forms of the maximally entangled mixed states can change discontinuously at a specific value of the entropy.
Carnot cycle at finite power: attainability of maximal efficiency.
Allahverdyan, Armen E; Hovhannisyan, Karen V; Melkikh, Alexey V; Gevorkian, Sasun G
2013-08-01
We want to understand whether and to what extent the maximal (Carnot) efficiency for heat engines can be reached at a finite power. To this end we generalize the Carnot cycle so that it is not restricted to slow processes. We show that for realistic (i.e., not purposefully designed) engine-bath interactions, the work-optimal engine performing the generalized cycle close to the maximal efficiency has a long cycle time and hence vanishing power. This aspect is shown to relate to the theory of computational complexity. A physical manifestation of the same effect is Levinthal's paradox in the protein folding problem. The resolution of this paradox for realistic proteins allows to construct engines that can extract at a finite power 40% of the maximally possible work reaching 90% of the maximal efficiency. For purposefully designed engine-bath interactions, the Carnot efficiency is achievable at a large power.
Maximal induced paths and minimal percolating sets in hypercubes
Anil M. Shende
2015-01-01
Full Text Available For a graph $G$, the \\emph{$r$-bootstrap percolation} process can be described as follows: Start with an initial set $A$ of "infected'' vertices. Infect any vertex with at least $r$ infected neighbours, and continue this process until no new vertices can be infected. $A$ is said to \\emph{percolate in $G$} if eventually all the vertices of $G$ are infected. $A$ is a \\emph{minimal percolating set} in $G$ if $A$ percolates in $G$ and no proper subset of $A$ percolates in $G$. An induced path, $P$, in a hypercube $Q_n$ is maximal if no induced path in $Q_n$ properly contains $P$. Induced paths in hypercubes are also called snakes. We study the relationship between maximal snakes and minimal percolating sets (under 2-bootstrap percolation in hypercubes. In particular, we show that every maximal snake contains a minimal percolating set, and that every minimal percolating set is contained in a maximal snake.
Sensitivity to conversational maxims in deaf and hearing children.
Surian, Luca; Tedoldi, Mariantonia; Siegal, Michael
2010-09-01
We investigated whether access to a sign language affects the development of pragmatic competence in three groups of deaf children aged 6 to 11 years: native signers from deaf families receiving bimodal/bilingual instruction, native signers from deaf families receiving oralist instruction and late signers from hearing families receiving oralist instruction. The performance of these children was compared to a group of hearing children aged 6 to 7 years on a test designed to assess sensitivity to violations of conversational maxims. Native signers with bimodal/bilingual instruction were as able as the hearing children to detect violations that concern truthfulness (Maxim of Quality) and relevance (Maxim of Relation). On items involving these maxims, they outperformed both the late signers and native signers attending oralist schools. These results dovetail with previous findings on mindreading in deaf children and underscore the role of early conversational experience and instructional setting in the development of pragmatics.
Classification of conformal representations induced from the maximal cuspidal parabolic
Dobrev, V. K., E-mail: dobrev@inrne.bas.bg [Scuola Internazionale Superiore di Studi Avanzati (Italy)
2017-03-15
In the present paper we continue the project of systematic construction of invariant differential operators on the example of representations of the conformal algebra induced from the maximal cuspidal parabolic.
IMRank: Influence Maximization via Finding Self-Consistent Ranking
Cheng, Suqi; Shen, Hua-Wei; Huang, Junming; Chen, Wei; Cheng, Xue-Qi
2014-01-01
Influence maximization, fundamental for word-of-mouth marketing and viral marketing, aims to find a set of seed nodes maximizing influence spread on social network. Early methods mainly fall into two paradigms with certain benefits and drawbacks: (1)Greedy algorithms, selecting seed nodes one by one, give a guaranteed accuracy relying on the accurate approximation of influence spread with high computational cost; (2)Heuristic algorithms, estimating influence spread using efficient heuristics,...
Probing the deviation from maximal mixing of atmospheric neutrinos
Choubey, S; Choubey, Sandhya; Roy, Probir
2006-01-01
Pioneering atmospheric muon neutrino experiments have demonstrated the near-maximal magnitude of the flavor mixing angle $\\theta_{23}$. But the precise value of the deviation $D \\equiv 1/2 - \\sin^2 \\theta_{23}$ from maximality (if nonzero) needs to be known, being of great interest -- especially to builders of neutrino mass and mixing models. We quantitatively investigate in a three generation framework the feasibility of determining $D$ in a statistically significant manner from studies of the atmospheric $\
Shareholder, stakeholder-owner or broad stakeholder maximization
Mygind, Niels
2004-01-01
including the shareholders of a company. Although it may be the ultimate goal for Corporate Social Responsibility to achieve this kind of maximization, broad stakeholder maximization is quite difficult to give a precise definition. There is no one-dimensional measure to add different stakeholder benefits...... by other stakeholders' interests. These constraints vary for dif-ferent stakeholder owners and new standards for Corporate Social Responsibility and more active political consumers will strengthen these constraints....
Maximal speed of particles in super-Lévy process
LIN Zheng-yan; CHENG Zong-mao
2008-01-01
We introduce a super-Lévy process and study maximal speed of all particles process is a measure on the set of paths.We study the maximal speed of all particles during a given time period,which turns out to be a function of the packing dimension of the time period.We calculate the Hausdorff dimension of the set of a-fast patlls in the support and the range of the historical super-lévy process.
Evolution of Shanghai STOCK Market Based on Maximal Spanning Trees
Yang, Chunxia; Shen, Ying; Xia, Bingying
2013-01-01
In this paper, using a moving window to scan through every stock price time series over a period from 2 January 2001 to 11 March 2011 and mutual information to measure the statistical interdependence between stock prices, we construct a corresponding weighted network for 501 Shanghai stocks in every given window. Next, we extract its maximal spanning tree and understand the structure variation of Shanghai stock market by analyzing the average path length, the influence of the center node and the p-value for every maximal spanning tree. A further analysis of the structure properties of maximal spanning trees over different periods of Shanghai stock market is carried out. All the obtained results indicate that the periods around 8 August 2005, 17 October 2007 and 25 December 2008 are turning points of Shanghai stock market, at turning points, the topology structure of the maximal spanning tree changes obviously: the degree of separation between nodes increases; the structure becomes looser; the influence of the center node gets smaller, and the degree distribution of the maximal spanning tree is no longer a power-law distribution. Lastly, we give an analysis of the variations of the single-step and multi-step survival ratios for all maximal spanning trees and find that two stocks are closely bonded and hard to be broken in a short term, on the contrary, no pair of stocks remains closely bonded for a long time.
Dividend Maximization when Cash Reserves Follow a Jump-diffusion Process
LI LI-LI; FENG JIN-GHAI; SONG LI-XIN
2009-01-01
This paper deals with the dividend optimization problem for an insur-ance company, whose surplus follows a jump-diffusion process. The objective of the company is to maximize the expected total discounted dividends paid out until the time of ruin. Under concavity assumption on the optimal value function, the paper states some general properties and, in particular, smoothness results on the optimal value function, whose analysis mainly relies on viscosity solutions of the associated Hamilton-Jacobi-Bellman (HJB) equations. Based on these properties, the explicit expression of the optimal value function is obtained. And some numerical calculations are presented as the application of the results.
Entropy Maximization as a Basis for Information Recovery in Dynamic Economic Behavioral Systems
George Judge
2015-02-01
Full Text Available As a basis for information recovery in open dynamic microeconomic systems, we emphasize the connection between adaptive intelligent behavior, causal entropy maximization and self-organized equilibrium seeking behavior. This entropy-based causal adaptive behavior framework permits the use of information-theoretic methods as a solution basis for the resulting pure and stochastic inverse economic-econometric problems. We cast the information recovery problem in the form of a binary network and suggest information-theoretic methods to recover estimates of the unknown binary behavioral parameters without explicitly sampling the configuration-arrangement of the sample space.
Maurice Schiff
1995-03-01
Full Text Available The traditional literature derives optimum and revenue-maximizing export taxes within two-country models. with one exporter and one importer (Johnson 1950-51, Tower 1977. In reality, most products, including primary products. are exported by several countries. In this paper, we present a theory of trade taxes in a three-country framework. This enables us to deal with strategic interactions among exporting countries. We show that (i if one of the countries is a Stackelberg leader, both countries improve their welfare relative to Nash equilibrium, and in the symmetric case, the follower's welfare is higher than that of the leader; (ii the revenue-maximizing Nash tax is larger than the optimum tax for each country; and (iii welfare may be higher in the revenue-maximizing Nash equilibrium than in the welfare-maximizing Nash equilibrium, a result which cannot arise in two-country models. The traditional literature derives optimum and revenue-maximizing export taxes within two-country models. with one exporter and one importer (Johnson 1950-51, Tower 1977. In reality, most products, including primary products. are exported by several countries. In this paper, we present a theory of trade taxes in a three-country framework. This enables us to deal with strategic interactions among exporting countries. We show that (i if one of the countries is a Stackelberg leader, both countries improve their welfare relative to Nash equilibrium, and in the symmetric case, the follower's welfare is higher than that of the leader; (ii the revenue-maximizing Nash tax is larger than the optimum tax for each country; and (iii welfare may be higher in the revenue-maximizing Nash equilibrium than in the welfare-maximizing Nash equilibrium, a result which cannot arise in two-country models.
Eleutherococcus senticosus (Rupr. & Maxim.) Maxim. (Araliaceae) as an adaptogen: a closer look.
Davydov, M; Krikorian, A D
2000-10-01
The adaptogen concept is examined from an historical, biological, chemical, pharmacological and medical perspective using a wide variety of primary and secondary literature. The definition of an adaptogen first proposed by Soviet scientists in the late 1950s, namely that an adaptogen is any substance that exerts effects on both sick and healthy individuals by 'correcting' any dysfunction(s) without producing unwanted side effects, was used as a point of departure. We attempted to identify critically what an adaptogen supposedly does and to determine whether the word embodies in and of itself any concept(s) acceptable to western conventional (allopathic) medicine. Special attention was paid to the reported pharmacological effects of the 'adaptogen-containing plant' Eleutherococcus senticosus (Rupr. & Maxim.) Maxim. (Araliaceae), referred to by some as 'Siberian ginseng', and to its secondary chemical composition. We conclude that so far as specific pharmacological activities are concerned there are a number of valid arguments for equating the action of so-called adaptogens with those of medicinal agents that have activities as anti-oxidants, and/or anti-cancerogenic, immunomodulatory and hypocholesteroletic as well as hypoglycemic and choleretic action. However, 'adaptogens' and 'anti-oxidants' etc. also show significant dissimilarities and these are discussed. Significantly, the classical definition of an adaptogen has much in common with views currently being invoked to describe and explain the 'placebo effect'. Nevertheless, the chemistry of the secondary compounds of Eleutherococcus isolated thus far and their pharmacological effects support our hypothesis that the reported beneficial effects of adaptogens derive from their capacity to exert protective and/or inhibitory action against free radicals. An inventory of the secondary substances contained in Eleutherococcus discloses a potential for a wide range of activities reported from work on cultured cell lines
Seitz, M.G.
1982-01-01
Reviewed in this statement are methods of preparing solutions to be used in laboratory experiments to examine technical issues related to the safe disposal of nuclear waste from power generation. Each approach currently used to prepare solutions has advantages and any one approach may be preferred over the others in particular situations, depending upon the goals of the experimental program. These advantages are highlighted herein for three approaches to solution preparation that are currently used most in studies of nuclear waste disposal. Discussion of the disadvantages of each approach is presented to help a user select a preparation method for his particular studies. Also presented in this statement are general observations regarding solution preparation. These observations are used as examples of the types of concerns that need to be addressed regarding solution preparation. As shown by these examples, prior to experimentation or chemical analyses, laboratory techniques based on scientific knowledge of solutions can be applied to solutions, often resulting in great improvement in the usefulness of results.
Moving multiple sinks through wireless sensor networks for lifetime maximization.
Petrioli, Chiara (Universita di Roma); Carosi, Alessio (Universita di Roma); Basagni, Stefano (Northeastern University); Phillips, Cynthia Ann
2008-01-01
Unattended sensor networks typically watch for some phenomena such as volcanic events, forest fires, pollution, or movements in animal populations. Sensors report to a collection point periodically or when they observe reportable events. When sensors are too far from the collection point to communicate directly, other sensors relay messages for them. If the collection point location is static, sensor nodes that are closer to the collection point relay far more messages than those on the periphery. Assuming all sensor nodes have roughly the same capabilities, those with high relay burden experience battery failure much faster than the rest of the network. However, since their death disconnects the live nodes from the collection point, the whole network is then dead. We consider the problem of moving a set of collectors (sinks) through a wireless sensor network to balance the energy used for relaying messages, maximizing the lifetime of the network. We show how to compute an upper bound on the lifetime for any instance using linear and integer programming. We present a centralized heuristic that produces sink movement schedules that produce network lifetimes within 1.4% of the upper bound for realistic settings. We also present a distributed heuristic that produces lifetimes at most 25:3% below the upper bound. More specifically, we formulate a linear program (LP) that is a relaxation of the scheduling problem. The variables are naturally continuous, but the LP relaxes some constraints. The LP has an exponential number of constraints, but we can satisfy them all by enforcing only a polynomial number using a separation algorithm. This separation algorithm is a p-median facility location problem, which we can solve efficiently in practice for huge instances using integer programming technology. This LP selects a set of good sensor configurations. Given the solution to the LP, we can find a feasible schedule by selecting a subset of these configurations, ordering them
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
Chekuri, Chandra; Zenklusen, Rico
2011-01-01
We consider the problem of maximizing a non-negative submodular set function $f:2^N \\rightarrow \\mathbb{R}_+$ over a ground set $N$ subject to a variety of packing type constraints. In this paper we develop a general framework leading to a number of new results, in particular when $f$ may be a {\\em non-monotone} function. Our algorithms are based on (approximately) maximizing the multilinear extension $F$ of $f$ \\cite{CCPV07} over a polytope $P$ that represents the constraints, and then effectively rounding the fractional solution. Although this approach has been used quite successfully in some settings \\cite{CCPV09,KulikST09,LeeMNS09,CVZ10,BansalKNS10}, it has been limited in some important ways. We overcome these limitations as follows. First, we give constant factor approximation algorithms to maximize $F$ over any down-closed polytope $P$ that has an efficient separation oracle. Previously this was known only for monotone functions \\cite{Vondrak08}. For non-monotone functions, a constant factor was known ...
Singh, Brijesh; Mahanty, Ranjit; Singh, S. P.
2013-05-01
This paper presents a framework to achieve an optimal power flow solution in a decentralized bilateral multitransaction-based market. An independent optimal dispatch solution has been used for each market. The interior point (IP)-based optimization technique has been used for finding a global economic optimal solution of the whole system. In this method, all the participants try to maximize their own profits with the help of system information announced by the operator. In the present work, a parallel algorithm has been used to find out a global optimum solution in decentralized market model. The study has been carried out on a modified IEEE-30 bus system. The results show that the suggested decentralized approach can provide a better optimal solution. The obtained results show the effectiveness of IP optimization-based optimal generator schedule and congestion management in the decentralized market.
Garbarino, Sara; Massone, Anna Maria; Sannino, Alessia; Boselli, Antonella; Wang, Xuan; Spinelli, Nicola; Piana, Michele
2016-01-01
We consider the problem of retrieving the aerosol extinction coefficient from Raman lidar measurements. This is an ill--posed inverse problem that needs regularization, and we propose to use the Expectation--Maximization (EM) algorithm to provide stable solutions. Indeed, EM is an iterative algorithm that imposes a positivity constraint on the solution, and provides regularization if iterations are stopped early enough. We describe the algorithm and propose a stopping criterion inspired by a statistical principle. We then discuss its properties concerning the spatial resolution. Finally, we validate the proposed approach by using both synthetic data and experimental measurements; we compare the reconstructions obtained by EM with those obtained by the Tikhonov method, by the Levenberg-Marquardt method, as well as those obtained by combining data smoothing and numerical derivation.
Jiang, Jonathan Q
2011-01-01
We show here that the problem of maximizing a family of quantitative functions, encompassing both the modularity (Q-measure) and modularity density (D-measure), for community detection can be uniformly understood as a combinatoric optimization involving the trace of a matrix called modularity Laplacian. Instead of using traditional spectral relaxation, we apply additional nonnegative constraint into this graph clustering problem and design efficient algorithms to optimize the new objective. With the explicit nonnegative constraint, our solutions are very close to the ideal community indicator matrix and can directly assign nodes into communities. The near-orthogonal columns of the solution can be reformulated as the posterior probability of corresponding node belonging to each community. Therefore, the proposed method can be exploited to identify the fuzzy or overlapping communities and thus facilitates the understanding of the intrinsic structure of networks. Experimental results show that our new algorithm ...
Garbarino, Sara; Sorrentino, Alberto; Massone, Anna Maria; Sannino, Alessia; Boselli, Antonella; Wang, Xuan; Spinelli, Nicola; Piana, Michele
2016-09-19
We consider the problem of retrieving the aerosol extinction coefficient from Raman lidar measurements. This is an ill-posed inverse problem that needs regularization, and we propose to use the Expectation-Maximization (EM) algorithm to provide stable solutions. Indeed, EM is an iterative algorithm that imposes a positivity constraint on the solution, and provides regularization if iterations are stopped early enough. We describe the algorithm and propose a stopping criterion inspired by a statistical principle. We then discuss its properties concerning the spatial resolution. Finally, we validate the proposed approach by using both synthetic data and experimental measurements; we compare the reconstructions obtained by EM with those obtained by the Tikhonov method, by the Levenberg-Marquardt method, as well as those obtained by combining data smoothing and numerical derivation.
Oliver, Jonathan M.; Almada, Anthony L.; Van Eck, Leighsa E.; Shah, Meena; Mitchell, Joel B.; Jones, Margaret T.; Jagim, Andrew R.; Rowlands, David S.
2016-01-01
Athletes in sports demanding repeat maximal work outputs frequently train concurrently utilizing sequential bouts of intense endurance and resistance training sessions. On a daily basis, maximal work within subsequent bouts may be limited by muscle glycogen availability. Recently, the ingestion of a unique high molecular weight (HMW) carbohydrate was found to increase glycogen re-synthesis rate and enhance work output during subsequent endurance exercise, relative to low molecular weight (LMW) carbohydrate ingestion. The effect of the HMW carbohydrate, however, on the performance of intense resistance exercise following prolonged-intense endurance training is unknown. Sixteen resistance trained men (23±3 years; 176.7±9.8 cm; 88.2±8.6 kg) participated in a double-blind, placebo-controlled, randomized 3-way crossover design comprising a muscle-glycogen depleting cycling exercise followed by ingestion of placebo (PLA), or 1.2 g•kg•bw-1 of LMW or HMW carbohydrate solution (10%) with blood sampling for 2-h post-ingestion. Thereafter, participants performed 5 sets of 10 maximal explosive repetitions of back squat (75% of 1RM). Compared to PLA, ingestion of HMW (4.9%, 90%CI 3.8%, 5.9%) and LMW (1.9%, 90%CI 0.8%, 3.0%) carbohydrate solutions substantially increased power output during resistance exercise, with the 3.1% (90% CI 4.3, 2.0%) almost certain additional gain in power after HMW-LMW ingestion attributed to higher movement velocity after force kinematic analysis (HMW-LMW 2.5%, 90%CI 1.4, 3.7%). Both carbohydrate solutions increased post-exercise plasma glucose, glucoregulatory and gut hormones compared to PLA, but differences between carbohydrates were unclear; thus, the underlying mechanism remains to be elucidated. Ingestion of a HMW carbohydrate following prolonged intense endurance exercise provides superior benefits to movement velocity and power output during subsequent repeated maximal explosive resistance exercise. This study was registered with
The Automorphism Groups of a Family of Maximal Curves
Guralnick, Robert; Pries, Rachel
2011-01-01
The Hasse Weil bound restricts the number of points of a curve which are defined over a finite field; if the number of points meets this bound, the curve is called maximal. Giulietti and Korchmaros introduced a curve C_3 which is maximal over F_{q^6} and determined its automorphism group. Garcia, Guneri, and Stichtenoth generalized this construction to a family of curves C_n, indexed by an odd integer n greater than or equal to 3, such that C_n is maximal over F_{q^{2n}}. In this paper, we determine the automorphism group Aut(C_n) when n > 3; in contrast with the case n=3, it fixes the point at infinity on C_n. The proof requires a new structural result about automorphism groups of curves in characteristic p such that each Sylow p-subgroup has exactly one fixed point. MSC:11G20, 14H37.
Online Learning of Assignments that Maximize Submodular Functions
Golovin, Daniel; Streeter, Matthew
2009-01-01
Which ads should we display in sponsored search in order to maximize our revenue? How should we dynamically rank information sources to maximize value of information? These applications exhibit strong diminishing returns: Selection of redundant ads and information sources decreases their marginal utility. We show that these and other problems can be formalized as repeatedly selecting an assignment of items to positions to maximize a sequence of monotone submodular functions that arrive one by one. We present an efficient algorithm for this general problem and analyze it in the no-regret model. Our algorithm possesses strong theoretical guarantees, such as a performance ratio that converges to the optimal constant of 1-1/e. We empirically evaluate our algorithm on two real-world online optimization problems on the web: ad allocation with submodular utilities, and dynamically ranking blogs to detect information cascades.
Optimal bounded control for maximizing reliability of Duhem hysteretic systems
Ming XU; Xiaoling JIN; Yong WANG; Zhilong HUANG
2015-01-01
The optimal bounded control of stochastic-excited systems with Duhem hysteretic components for maximizing system reliability is investigated. The Duhem hysteretic force is transformed to energy-depending damping and stiffness by the energy dissipation balance technique. The controlled system is transformed to the equivalent non-hysteretic system. Stochastic averaging is then implemented to obtain the Itˆo stochastic equation associated with the total energy of the vibrating system, appropriate for eval-uating system responses. Dynamical programming equations for maximizing system re-liability are formulated by the dynamical programming principle. The optimal bounded control is derived from the maximization condition in the dynamical programming equa-tion. Finally, the conditional reliability function and mean time of first-passage failure of the optimal Duhem systems are numerically solved from the Kolmogorov equations. The proposed procedure is illustrated with a representative example.
Eccentric exercise decreases maximal insulin action in humans
Asp, Svend; Daugaard, J R; Kristiansen, S
1996-01-01
1. Unaccustomed eccentric exercise decreases whole-body insulin action in humans. To study the effects of one-legged eccentric exercise on insulin action in muscle and systemically, the euglycaemic clamp technique combined with arterial and bilateral femoral venous catheterization was used. Seven...... subjects participated in two euglycaemic clamps, performed in random order. One clamp was preceded 2 days earlier by one-legged eccentric exercise (post-eccentric exercise clamp (PEC)) and one was without the prior exercise (control clamp (CC)). 2. During PEC the maximal insulin-stimulated glucose uptake......) necessary to maintain euglycaemia during maximal insulin stimulation was lower during PEC compared with CC (15.7%, 81.3 +/- 3.2 vs. 96.4 +/- 8.8 mumol kg-1 min-1, P eccentric exercise, muscle and whole-body insulin action is impaired at maximal...
Cross-Order Integral Relations from Maximal Cuts
Johansson, Henrik; Larsen, Kasper J.; Søgaard, Mads
2015-01-01
We study the ABDK relation using maximal cuts of one- and two-loop integrals with up to five external legs. We show how to find a special combination of integrals that allows the relation to exist, and how to reconstruct the terms with one-loop integrals squared. The reconstruction relies on the observation that integrals across different loop orders can have support on the same generalized unitarity cuts and can share global poles. We discuss the appearance of nonhomologous integration contours in multivariate residues. Their origin can be understood in simple terms, and their existence enables us to distinguish contributions from different integrals. Our analysis suggests that maximal and near-maximal cuts can be used to infer the existence of integral identities more generally.
Cycle length maximization in PWRs using empirical core models
Okafor, K.C.; Aldemir, T.
1987-01-01
The problem of maximizing cycle length in nuclear reactors through optimal fuel and poison management has been addressed by many investigators. An often-used neutronic modeling technique is to find correlations between the state and control variables to describe the response of the core to changes in the control variables. In this study, a set of linear correlations, generated by two-dimensional diffusion-depletion calculations, is used to find the enrichment distribution that maximizes cycle length for the initial core of a pressurized water reactor (PWR). These correlations (a) incorporate the effect of composition changes in all the control zones on a given fuel assembly and (b) are valid for a given range of control variables. The advantage of using such correlations is that the cycle length maximization problem can be reduced to a linear programming problem.
The F-Theorem and F-Maximization
Pufu, Silviu S
2016-01-01
This contribution contains a review of the role of the three-sphere free energy F in recent developments related to the F-theorem and F-maximization. The F-theorem states that for any Lorentz-invariant RG trajectory connecting a conformal field theory CFT_UV in the ultraviolet to a conformal field theory CFT_IR, the F-coefficient decreases: F_UV > F_IR. I provide many examples of CFTs where one can compute F, approximately or exactly, and discuss various checks of the F-theorem. F-maximization is the principle that in an N=2 SCFT, viewed as the deep IR limit of an RG trajectory preserving N=2 supersymmetry, the superconformal R-symmetry maximizes F within the set of all R-symmetries preserved by the RG trajectory. I review the derivation of this result and provide examples.
Viscosity and density dependence during maximal flow in man.
Staats, B A; Wilson, T A; Lai-Fook, S J; Rodarte, J R; Hyatt, R E
1980-02-01
Maximal expiratory flow curves were obtained from ten healthy subjects white breathing air and three other gas mixtures with different densities and viscosities. From these data, the magnitudes of the dependence of maximal flow on gas density and viscosity were obtained. The scaling laws of fluid mechanics, together with a model for the flow-limiting mechanism, were used to obtain a prediction of the relationship between the density dependence and the viscosity dependence of maximal flow. Although the data for individual subjects were too variable to allow a precise comparison with this prediction, the relationship between the mean density dependence and the mean viscosity dependence of all usbjects agreed with the theoretic prediction. This agreement supports the assumption, which is frequently made, that flow resistance rather than tissue visoelasticity is the dominant contributor to peripheral resistance. Information on the relationships between the pressure drop to the flow-limiting segment and flow, gas density and viscosity, and lung volume were also obtained.
Maximal supports and Schur-positivity among connected skew shapes
McNamara, Peter R W
2011-01-01
The Schur-positivity order on skew shapes is defined by B \\leq A if the difference s_A - s_B is Schur-positive. It is an open problem to determine those connected skew shapes that are maximal with respect to this ordering. A strong sufficient condition for the Schur-positivity of s_A - s_B is that the support of B is contained in that of A, where the support of B is defined to be the set of partitions lambda for which s_lambda appears in the Schur expansion of s_B. We show that to determine the maximal connected skew shapes in the Schur-positivity order and this support containment order, it suffices to consider a special class of ribbon shapes. We explicitly determine the support for these ribbon shapes, thereby determining the maximal connected skew shapes in the support containment order.
Hamza, Doha
2015-02-13
We propose a three-message superposition coding scheme in a cognitive radio relay network exploiting active cooperation between primary and secondary users. The primary user is motivated to cooperate by substantial benefits it can reap from this access scenario. Specifically, the time resource is split into three transmission phases: The first two phases are dedicated to primary communication, while the third phase is for the secondary’s transmission. We formulate two throughput maximization problems for the secondary network subject to primary user rate constraints and per-node power constraints with respect to the time durations of primary transmission and the transmit power of the primary and the secondary users. The first throughput maximization problem assumes a partial power constraint such that the secondary power dedicated to primary cooperation, i.e. for the first two communication phases, is fixed apriori. In the second throughput maximization problem, a total power constraint is assumed over the three phases of communication. The two problems are difficult to solve analytically when the relaying channel gains are strictly greater than each other and strictly greater than the direct link channel gain. However, mathematically tractable lowerbound and upperbound solutions can be attained for the two problems. For both problems, by only using the lowerbound solution, we demonstrate significant throughput gains for both the primary and the secondary users through this active cooperation scheme. We find that most of the throughput gains come from minimizing the second phase transmission time since the secondary nodes assist the primary communication during this phase. Finally, we demonstrate the superiority of our proposed scheme compared to a number of reference schemes that include best relay selection, dual-hop routing, and an interference channel model.
Cardiovascular consequences of bed rest: effect on maximal oxygen uptake
Convertino, V. A.
1997-01-01
Maximal oxygen uptake (VO2max) is reduced in healthy individuals confined to bed rest, suggesting it is independent of any disease state. The magnitude of reduction in VO2max is dependent on duration of bed rest and the initial level of aerobic fitness (VO2max), but it appears to be independent of age or gender. Bed rest induces an elevated maximal heart rate which, in turn, is associated with decreased cardiac vagal tone, increased sympathetic catecholamine secretion, and greater cardiac beta-receptor sensitivity. Despite the elevation in heart rate, VO2max is reduced primarily from decreased maximal stroke volume and cardiac output. An elevated ejection fraction during exercise following bed rest suggests that the lower stroke volume is not caused by ventricular dysfunction but is primarily the result of decreased venous return associated with lower circulating blood volume, reduced central venous pressure, and higher venous compliance in the lower extremities. VO2max, stroke volume, and cardiac output are further compromised by exercise in the upright posture. The contribution of hypovolemia to reduced cardiac output during exercise following bed rest is supported by the close relationship between the relative magnitude (% delta) and time course of change in blood volume and VO2max during bed rest, and also by the fact that retention of plasma volume is associated with maintenance of VO2max after bed rest. Arteriovenous oxygen difference during maximal exercise is not altered by bed rest, suggesting that peripheral mechanisms may not contribute significantly to the decreased VO2max. However reduction in baseline and maximal muscle blood flow, red blood cell volume, and capillarization in working muscles represent peripheral mechanisms that may contribute to limited oxygen delivery and, subsequently, lowered VO2max. Thus, alterations in cardiac and vascular functions induced by prolonged confinement to bed rest contribute to diminution of maximal oxygen uptake
Data-Driven Engineering of Social Dynamics: Pattern Matching and Profit Maximization.
Huan-Kai Peng
Full Text Available In this paper, we define a new problem related to social media, namely, the data-driven engineering of social dynamics. More precisely, given a set of observations from the past, we aim at finding the best short-term intervention that can lead to predefined long-term outcomes. Toward this end, we propose a general formulation that covers two useful engineering tasks as special cases, namely, pattern matching and profit maximization. By incorporating a deep learning model, we derive a solution using convex relaxation and quadratic-programming transformation. Moreover, we propose a data-driven evaluation method in place of the expensive field experiments. Using a Twitter dataset, we demonstrate the effectiveness of our dynamics engineering approach for both pattern matching and profit maximization, and study the multifaceted interplay among several important factors of dynamics engineering, such as solution validity, pattern-matching accuracy, and intervention cost. Finally, the method we propose is general enough to work with multi-dimensional time series, so it can potentially be used in many other applications.
Energy Efficiency and SINR Maximization Beamformers for Spectrum Sharing With Sensing Information
Alabbasi, Abdulrahman
2014-09-01
In this paper, we consider a cognitive radio multi-input-multi-output environment, in which we adapt our beamformer to maximize both energy efficiency (EE) and signal-to-interference-plus-noise ratio (SINR) metrics. Our design considers an underlaying communication using adaptive beamforming schemes combined with sensing information to achieve optimal energy-efficient systems. The proposed schemes maximize EE and SINR metrics subject to cognitive radio and quality-of-service constraints. The analysis of the proposed schemes is classified into two categories based on knowledge of the secondary-transmitter-to-primary-receiver channel. Since the optimizations of EE and SINR problems are not convex problems, we transform them into a standard semidefinite programming (SDP) form to guarantee that the optimal solutions are global. An analytical solution is provided for one scheme, while the second scheme is left in a standard SDP form. Selected numerical results are used to quantify the impact of the sensing information on the proposed schemes compared to the benchmark ones.
Data-Driven Engineering of Social Dynamics: Pattern Matching and Profit Maximization.
Peng, Huan-Kai; Lee, Hao-Chih; Pan, Jia-Yu; Marculescu, Radu
2016-01-01
In this paper, we define a new problem related to social media, namely, the data-driven engineering of social dynamics. More precisely, given a set of observations from the past, we aim at finding the best short-term intervention that can lead to predefined long-term outcomes. Toward this end, we propose a general formulation that covers two useful engineering tasks as special cases, namely, pattern matching and profit maximization. By incorporating a deep learning model, we derive a solution using convex relaxation and quadratic-programming transformation. Moreover, we propose a data-driven evaluation method in place of the expensive field experiments. Using a Twitter dataset, we demonstrate the effectiveness of our dynamics engineering approach for both pattern matching and profit maximization, and study the multifaceted interplay among several important factors of dynamics engineering, such as solution validity, pattern-matching accuracy, and intervention cost. Finally, the method we propose is general enough to work with multi-dimensional time series, so it can potentially be used in many other applications.
Method Maximizing the Spread of Influence in Directed Signed Weighted Graphs
Alexander Nikolaevich Tselykh
2017-01-01
Full Text Available We propose a new method for maximizing the spread of influence, based on the identification of significant factors of the total energy of a control system. The model of a socio-economic system can be represented in the form of cognitive maps that are directed signed weighted graphs with cause-and-effect relationships and cycles. Identification and selection of target factors and effective control factors of a system is carried out as a solution to the optimal control problem. The influences are determined by the solution to optimization problem of maximizing the objective function, leading to matrix symmetrization. The gear-ratio symmetrization is based on computing the similarity extent of fan-beam structures of the influence spread of vertices v_i and v_j to all other vertices. This approach provides the real computational domain and correctness of solving the optimal control problem. In addition, it does not impose requirements for graphs to be ordering relationships, to have a matrix of special type or to fulfill stability conditions. In this paper, determination of new metrics of vertices, indicating and estimating the extent and the ability to effectively control, are likewise offered. Additionally, we provide experimental results over real cognitive models in support.
Joint Throughput Maximization and Fair Uplink Transmission Scheduling in CDMA Systems
Li Chengzhou
2009-01-01
Full Text Available We study the fundamental problem of optimal transmission scheduling in a code-division multiple-access wireless system in order to maximize the uplink system throughput, while satisfying the users quality-of-service (QoS requirements and maintaining fairness among them. The corresponding problem is expressed as a weighted throughput maximization problem, under certain power and QoS constraints, where the weights are the control parameters reflecting the fairness constraints. With the introduction of the power index capacity, it is shown that this optimization problem can be converted into a binary knapsack problem, where all the corresponding constraints are replaced by the power index capacities at some certain system power index. A two-step approach is followed to obtain the optimal solution. First, a simple method is proposed to find the optimal set of users to receive service for a given fixed target system load, and then the optimal solution is obtained as a global search within a certain range. Furthermore, a stochastic approximation method is presented to effectively identify the required control parameters. The performance evaluation reveals the advantages of our proposed policy over other existing ones and confirms that it achieves very high throughput while maintains fairness among the users, under different channel conditions and requirements.
Munch, G D W; Svendsen, J H; Damsgaard, R; Secher, N H; González-Alonso, J; Mortensen, S P
2014-01-15
In humans, maximal aerobic power (VO2 max ) is associated with a plateau in cardiac output (Q), but the mechanisms regulating the interplay between maximal heart rate (HRmax) and stroke volume (SV) are unclear. To evaluate the effect of tachycardia and elevations in HRmax on cardiovascular function and capacity during maximal exercise in healthy humans, 12 young male cyclists performed incremental cycling and one-legged knee-extensor exercise (KEE) to exhaustion with and without right atrial pacing to increase HR. During control cycling, Q and leg blood flow increased up to 85% of maximal workload (WLmax) and remained unchanged until exhaustion. SV initially increased, plateaued and then decreased before exhaustion (P rate pressure product and RAP (P heart can be paced to a higher HR than observed during maximal exercise, suggesting that HRmax and myocardial work capacity do not limit VO2 max in healthy individuals. A limited left ventricular filling and possibly altered contractility reduce SV during atrial pacing, whereas a plateau in LVFP appears to restrict Q close to VO2 max .
Kakeya sets and directional maximal operators in the plane
Bateman, Michael
2009-01-01
We completely characterize the boundedness of planar directional maximal operators on $L^p$ . More precisely, if $\\Omega$ is a set of directions, we show that $M_{\\Omega}$ , the maximal operator associated to line segments in the directions $\\Omega$ , is unbounded on $L^p$ for all $p \\lt \\infty$ precisely when $\\Omega$ admits Kakeya-type sets. In fact, we show that if $\\Omega$ does not admit Kakeya sets, then $\\Omega$ is a generalized lacunary set, and hence, $M_{\\Omega}$ is bounded on $L^p$ ...
Maximal slicings in spherical symmetry: local existence and construction
Cordero-Carrión, Isabel; Morales-Lladosa, Juan Antonio; 10.1063/1.3658864
2011-01-01
We show that any spherically symmetric spacetime locally admits a maximal spacelike slicing and we give a procedure allowing its construction. The construction procedure that we have designed is based on purely geometrical arguments and, in practice, leads to solve a decoupled system of first order quasi-linear partial differential equations. We have explicitly built up maximal foliations in Minkowski and Friedmann spacetimes. Our approach admits further generalizations and efficient computational implementation. As by product, we suggest some applications of our work in the task of calibrating Numerical Relativity complex codes, usually written in Cartesian coordinates.
How High Might the Revenue-maximizing Tax Rate Be?
Usher, Dan
2014-01-01
Through tax evasion, through the labour-leisure choice or in other ways, taxpayers reduce the tax base in response to an increase in the tax rate. The process is commonly-believed to generate a humped Laffer curve with a revenue-maximizing tax rate well short of 100%. That need not be so. In the â€œnew tax responsiveness literatureâ€ , the revenue-maximizing tax rate is inferred from the observed â€œelasticity of taxable incomeâ€ . It is shown in this article 1) that the inference is unwarran...
Maximizing opto‐mechanical interaction using topology optimization
Gersborg, Allan Roulund; Sigmund, Ole
2011-01-01
This paper studies topology optimization of a coupled opto‐mechanical problem with the goal of finding the material layout which maximizes the optical modulation, i.e. the difference between the optical response for the mechanically deformed and undeformed configuration. The optimization is perfo......This paper studies topology optimization of a coupled opto‐mechanical problem with the goal of finding the material layout which maximizes the optical modulation, i.e. the difference between the optical response for the mechanically deformed and undeformed configuration. The optimization...
Constraining Torsion in Maximally symmetric (sub)spaces
Sur, Sourav
2013-01-01
We look into the general aspects of space-time symmetries in presence of torsion, and how the latter is affected by such symmetries. Focusing in particular to space-times which either exhibit maximal symmetry on their own, or could be decomposed to maximally symmetric subspaces, we work out the constraints on torsion in two different theoretical schemes. We show that at least for a completely antisymmetric torsion tensor (for e.g. the one motivated from string theory), an equivalence is set between these two schemes, as the non-vanishing independent torsion tensor components turn out to be the same.
Adaptive maximal poisson-disk sampling on surfaces
Yan, Dongming
2012-01-01
In this paper, we study the generation of maximal Poisson-disk sets with varying radii on surfaces. Based on the concepts of power diagram and regular triangulation, we present a geometric analysis of gaps in such disk sets on surfaces, which is the key ingredient of the adaptive maximal Poisson-disk sampling framework. Moreover, we adapt the presented sampling framework for remeshing applications. Several novel and efficient operators are developed for improving the sampling/meshing quality over the state-of-theart. © 2012 ACM.
Gap processing for adaptive maximal Poisson-disk sampling
Yan, Dongming
2013-09-01
In this article, we study the generation of maximal Poisson-disk sets with varying radii. First, we present a geometric analysis of gaps in such disk sets. This analysis is the basis for maximal and adaptive sampling in Euclidean space and on manifolds. Second, we propose efficient algorithms and data structures to detect gaps and update gaps when disks are inserted, deleted, moved, or when their radii are changed.We build on the concepts of regular triangulations and the power diagram. Third, we show how our analysis contributes to the state-of-the-art in surface remeshing. © 2013 ACM.
Approximation algorithms for indefinite complex quadratic maximization problems
无
2010-01-01
In this paper,we consider the following indefinite complex quadratic maximization problem: maximize zHQz,subject to zk ∈ C and zkm = 1,k = 1,...,n,where Q is a Hermitian matrix with trQ = 0,z ∈ Cn is the decision vector,and m 3.An (1/log n) approximation algorithm is presented for such problem.Furthermore,we consider the above problem where the objective matrix Q is in bilinear form,in which case a 0.7118 cos mπ 2approximation algorithm can be constructed.In the context of quadratic optimization,various extensions and connections of the model are discussed.
Anatomy of maximal stop mixing in the MSSM
Bruemmer, Felix [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Kraml, Sabine; Kulkarni, Suchita [CNRS/IN2P3, INPG, Grenoble (France). Laboratoire de Physique Subatomique et de Cosmologie
2012-05-15
A Standard Model-like Higgs near 125 GeV in the MSSM requires multi-TeV stop masses, or a near-maximal contribution to its mass from stop mixing. We investigate the maximal mixing scenario, and in particular its prospects for being realized it in potentially realistic GUT models. We work out constraints on the possible GUT-scale soft terms, which we compare with what can be obtained from some well-known mechanisms of SUSY breaking mediation. Finally, we analyze two promising scenarios in detail, namely gaugino mediation and gravity mediation with non-universal Higgs masses.
Greedy SINR Maximization in Collaborative Multibase Wireless Systems
Popescu Otilia
2004-01-01
Full Text Available We present a codeword adaptation algorithm for collaborative multibase wireless systems. The system is modeled with multiple inputs and multiple outputs (MIMO in which information is transmitted using multicode CDMA, and codewords are adapted based on greedy maximization of the signal-to-interference-plus-noise ratio. The procedure monotonically increases the sum capacity and, when repeated iteratively for all codewords in the system, converges to a fixed point. Fixed-point properties and a connection with sum capacity maximization, along with a discussion of simulations that corroborate the basic analytic results, are included in the paper.
Weighted Inequalities for the Generalized Maximal Operator in Martingale Spaces
Wei CHEN; Peide LIU
2011-01-01
The generalized maximal operator M in martingale spaces is considered.For 1 ＜ p ≤ q ＜ ∞,the authors give a necessary and sufficient condition on the pair (（μ),v)for M to be a bounded operator from martingale space LP(v) into Lq(（μ）) or weak-Lq(（μ）),where （μ） is a measure on Ω× N and v a weight on Ω.Moreover,the similar inequalities for usual maximal operator are discussed.
Simulating Entangling Unitary Operator Using Non-maximally Entangled States
LI Chun-Xian; WANG Cheng-Zhi; NIE Liu-Ying; LI Jiang-Fan
2009-01-01
We use non-maximally entangled states (NMESs) to simulate an entangling unitary operator (EUO) w/th a certain probability. Given entanglement resources, the probability of the success we achieve is a decreasing function of the parameters of the EUO. Given an EUO, for certain entanglement resources the result is optimal, i.e., the probability obtains a maximal value, and for optimal result higher parameters of the EUO match more amount of entanglement resources. The probability of the success we achieve is higher than the known results under some condition.
Has the Brain Maximized its Information Storage Capacity?
Stepanyants, A L
2003-01-01
Learning and memory may rely on the ability of neuronal circuits to reorganize by dendritic spine remodeling. We have looked for geometrical parameters of cortical circuits, which maximize information storage capacity associated with this mechanism. In particular, we calculated optimal volume fractions of various neuropil components. The optimal axonal and dendritic volume fractions are not significantly different from anatomical measurements in the mouse and rat neocortex, and the rat hippocampus. This has led us to propose that the maximization of information storage capacity associated with dendritic spine remodeling may have been an important driving force in the evolution of the cortex.
Maximal expiratory flow volume curve in quarry workers.
Subhashini, Arcot Sadagopa; Satchidhanandam, Natesa
2002-01-01
Maximal Expiratory Flow Volume (MEFV) curves were recorded with a computerized Spirometer (Med Spiror). Forced Vital Capacity (FVC), Forced Expiratory Volumes (FEV), mean and maximal flow rates were obtained in 25 quarry workers who were free from respiratory disorders and 20 healthy control subjects. All the functional values are lower in quarry workers than in the control subject, the largest reduction in quarry workers with a work duration of over 15 years, especially for FEF75. The effects are probably due to smoking rather than dust exposure.
Efficient maximal Poisson-disk sampling and remeshing on surfaces
Guo, Jianwei
2015-02-01
Poisson-disk sampling is one of the fundamental research problems in computer graphics that has many applications. In this paper, we study the problem of maximal Poisson-disk sampling on mesh surfaces. We present a simple approach that generalizes the 2D maximal sampling framework to surfaces. The key observation is to use a subdivided mesh as the sampling domain for conflict checking and void detection. Our approach improves the state-of-the-art approach in efficiency, quality and the memory consumption.
Positive solutions of quasilinear parabolic systems with nonlinear boundary conditions
Pao, C. V.; Ruan, W. H.
2007-09-01
The aim of this paper is to investigate the existence, uniqueness, and asymptotic behavior of solutions for a coupled system of quasilinear parabolic equations under nonlinear boundary conditions, including a system of quasilinear parabolic and ordinary differential equations. Also investigated is the existence of positive maximal and minimal solutions of the corresponding quasilinear elliptic system as well as the uniqueness of a positive steady-state solution. The elliptic operators in both systems are allowed to be degenerate in the sense that the density-dependent diffusion coefficients Di(ui) may have the property Di(0)=0 for some or all i. Our approach to the problem is by the method of upper and lower solutions and its associated monotone iterations. It is shown that the time-dependent solution converges to the maximal solution for one class of initial functions and it converges to the minimal solution for another class of initial functions; and if the maximal and minimal solutions coincide then the steady-state solution is unique and the time-dependent solution converges to the unique solution. Applications of these results are given to three model problems, including a porous medium type of problem, a heat-transfer problem, and a two-component competition model in ecology. These applications illustrate some very interesting distinctive behavior of the time-dependent solutions between density-independent and density-dependent diffusions.
2010-04-01
... Employment and Training Administration Maxim Integrated Products, Formerly Known as Dallas Semiconductor...). Information shows that Maxim Integrated Products was formerly known as Dallas Semiconductor. Some workers... insurance (UI) tax accounts under the names Maxim Integrated Products, Inc. and Dallas...
Christov, Ivan C
2012-01-01
In classical continuum physics, a wave is a mechanical disturbance. Whether the disturbance is stationary or traveling and whether it is caused by the motion of atoms and molecules or the vibration of a lattice structure, a wave can be understood as a specific type of solution of an appropriate mathematical equation modeling the underlying physics. Typical models consist of partial differential equations that exhibit certain general properties, e.g., hyperbolicity. This, in turn, leads to the possibility of wave solutions. Various analytical techniques (integral transforms, complex variables, reduction to ordinary differential equations, etc.) are available to find wave solutions of linear partial differential equations. Furthermore, linear hyperbolic equations with higher-order derivatives provide the mathematical underpinning of the phenomenon of dispersion, i.e., the dependence of a wave's phase speed on its wavenumber. For systems of nonlinear first-order hyperbolic equations, there also exists a general ...
Lillo, F
2006-01-01
I consider the problem of the optimal limit order price of a financial asset in the framework of the maximization of the utility function of the investor. The analytical solution of the problem gives insight on the origin of the recently empirically observed power law distribution of limit order prices. In the framework of the model, the most likely proximate cause of this power law is a power law heterogeneity of traders' investment time horizons .
Efeoglu, Arkin; Møller, Charles; Serie, Michel
2013-01-01
This paper outlines an artifact building and evaluation proposal. Design Science Research (DSR) studies usually consider encapsulated artifact that have relationships with other artifacts. The solution prototype as a composed artifact demands for a more comprehensive consideration in its systematic...... environment. The solution prototype that is composed from blending product and service prototype has particular impacts on the dualism of DSR’s “Build” and “Evaluate”. Since the mix between product and service prototyping can be varied, there is a demand for a more agile and iterative framework. Van de Ven...
Kim, Kitae; Yabushita, Akihiro; Okumura, Masanori; Saiz-Lopez, Alfonso; Cuevas, Carlos A; Blaszczak-Boxe, Christopher S; Min, Dae Wi; Yoon, Ho-Il; Choi, Wonyong
2016-02-01
The chemistry of reactive halogens in the polar atmosphere plays important roles in ozone and mercury depletion events, oxidizing capacity, and dimethylsulfide oxidation to form cloud-condensation nuclei. Among halogen species, the sources and emission mechanisms of inorganic iodine compounds in the polar boundary layer remain unknown. Here, we demonstrate that the production of tri-iodide (I3(-)) via iodide oxidation, which is negligible in aqueous solution, is significantly accelerated in frozen solution, both in the presence and the absence of solar irradiation. Field experiments carried out in the Antarctic region (King George Island, 62°13'S, 58°47'W) also showed that the generation of tri-iodide via solar photo-oxidation was enhanced when iodide was added to various ice media. The emission of gaseous I2 from the irradiated frozen solution of iodide to the gas phase was detected by using cavity ring-down spectroscopy, which was observed both in the frozen state at 253 K and after thawing the ice at 298 K. The accelerated (photo-)oxidation of iodide and the subsequent formation of tri-iodide and I2 in ice appear to be related with the freeze concentration of iodide and dissolved O2 trapped in the ice crystal grain boundaries. We propose that an accelerated abiotic transformation of iodide to gaseous I2 in ice media provides a previously unrecognized formation pathway of active iodine species in the polar atmosphere.
Munjal, Bhushan; Bansal, Arvind K
2015-01-15
In this study, the effect of four non-crystallizing sugars, namely fructose, trehalose, sucrose and raffinose, was assessed on the crystallization of gemcitabine hydrochloride (GHCl) in frozen solutions. Aqueous solutions containing GHCl (50 mg/mL) and a sugar at varying concentrations (10-60 mg/mL) were frozen in situ in DSC and analyzed in the subsequent heating run. Crystallization propensity of GHCl was quantified in terms of reduced crystallization temperature (RCT) as a function of sugar type and concentration. Multivariate analysis option in JMP(®) software was employed for calculating correlation between the variables. All sugars inhibited GHCl crystallization in a concentration dependent manner. At equal concentration, fructose (with the lowest Tg') exerted the strongest inhibitory effect, whereas raffinose (with the highest Tg') exerted the weakest inhibitory effect. Additionally, RCT showed a poor correlation with Tg' (r=0.2327). Thus, the inhibitory effect of sugars could not be described by their anti-plasticization effect. This counter-intuitive behavior was explained by the inhibitory effect of sugars on ice crystallization, which increased the unfrozen water content (UWC) in the freeze concentrate, thereby lowering the supersaturation of GHCl. This was established by observing a good correlation (r=0.9666) between RCT and ln(1/UWC). Additionally, reduced diffusion kinetics of GHCl in presence of sugar molecules was also postulated. This study highlights the importance of unfrozen water towards governing the crystallization behavior of solutes in multi-component frozen systems.
Twitch interpolation technique in testing of maximal muscle strength
Bülow, P M; Nørregaard, J; Danneskiold-Samsøe, B
1993-01-01
The aim was to study the methodological aspects of the muscle twitch interpolation technique in estimating the maximal force of contraction in the quadriceps muscle utilizing commercial muscle testing equipment. Six healthy subjects participated in seven sets of experiments testing the effects on...
Octonionization of three player, two strategy maximally entangled quantum games
Ahmed, Aden; Bleiler, Steve; Khan, Faisal Shah
2008-01-01
We develop an octonionic representation of the payoff function for three player, two strategy, maximally entangled quantum games in order to obtain computationally friendly version of this function. This computational capability is then exploited to analyze and potentially classify the Nash equilibria in the quantum games.
Neuromuscular fatigue after maximal exercise in patients with cystic fibrosis.
Vallier, J M; Gruet, M; Mely, L; Pensini, M; Brisswalter, J
2011-04-01
The aim of this study was to determine whether patients with cystic fibrosis (CF), despite their ventilatory limitation, would develop neuromuscular fatigue of quadriceps muscles following a maximal cycling exercise. Eleven adults with CF (age=26.8±6.9years; forced expiratory volume in 1s=54.1±12.8% predicted) and 11 age-matched healthy subjects performed a maximal incremental cycle test with respiratory gas exchange measurements. Maximal voluntary contraction (MVC) and electromyographic (EMG) activity of the vastus medialis muscle were recorded before and after exercise. Neural and contractile properties of the quadriceps were also investigated using femoral nerve electrical stimulation. Patients had lower exercise capacity, peak oxygen uptake and MVC than controls. MVC fell significantly postexercise in both groups (CF: -20±10%, controls: -19±6%; ppattern (-38.4±14.4%, -42.1±14.7% and -15±20.4%) but the statistical significance was not reached for the maximal rate of twitch torque relaxation. In conclusion, CF patients demonstrated lower limb fatigue following symptom-limited cycle exercise, which was comparable to that exhibited by healthy controls. This fatigue may be due to contractile impairments and not to transmission failure. Further studies should be conducted in a larger sample to confirm these preliminary results.
Applications of expectation maximization algorithm for coherent optical communication
Carvalho, L.; Oliveira, J.; Zibar, Darko
2014-01-01
In this invited paper, we present powerful statistical signal processing methods, used by machine learning community, and link them to current problems in optical communication. In particular, we will look into iterative maximum likelihood parameter estimation based on expectation maximization al...
Joint Iterative Carrier Synchronization and Signal Detection Employing Expectation Maximization
Zibar, Darko; de Carvalho, Luis Henrique Hecker; Estaran Tolosa, Jose Manuel
2014-01-01
In this paper, joint estimation of carrier frequency, phase, signal means and noise variance, in a maximum likelihood sense, is performed iteratively by employing expectation maximization. The parameter estimation is soft decision driven and allows joint carrier synchronization and data detection...
Maximal exercise performance in patients with postcancer fatigue
Prinsen, H.; Hopman, M.T.E.; Zwarts, M.J.; Leer, J.W.H.; Heerschap, A.; Bleijenberg, G.; Laarhoven, H.W.M. van
2013-01-01
PURPOSE: The aim of this study is to examine whether physical fitness of severely fatigued and non-fatigued cancer survivors, as measured by maximal exercise performance, is different between both groups and, if so, whether this difference can be explained by differences in physical activity, self-e
Quantitative approaches for profit maximization in direct marketing
van der Scheer, H.R.
1998-01-01
An effective direct marketing campaign aims at selecting those targets, offer and communication elements - at the right time - that maximize the net profits. The list of individuals to be mailed, i.e. the targets, is considered to be the most important component. Therefore, a large amount of direct
The Boundary Crossing Theorem and the Maximal Stability Interval
Jorge-Antonio López-Renteria
2011-01-01
useful tools in the study of the stability of family of polynomials. Although both of these theorem seem intuitively obvious, they can be used for proving important results. In this paper, we give generalizations of these two theorems and we apply such generalizations for finding the maximal stability interval.
Optimal technique for maximal forward rotating vaults in men's gymnastics.
Hiley, Michael J; Jackson, Monique I; Yeadon, Maurice R
2015-08-01
In vaulting a gymnast must generate sufficient linear and angular momentum during the approach and table contact to complete the rotational requirements in the post-flight phase. This study investigated the optimization of table touchdown conditions and table contact technique for the maximization of rotation potential for forwards rotating vaults. A planar seven-segment torque-driven computer simulation model of the contact phase in vaulting was evaluated by varying joint torque activation time histories to match three performances of a handspring double somersault vault by an elite gymnast. The closest matching simulation was used as a starting point to maximize post-flight rotation potential (the product of angular momentum and flight time) for a forwards rotating vault. It was found that the maximized rotation potential was sufficient to produce a handspring double piked somersault vault. The corresponding optimal touchdown configuration exhibited hip flexion in contrast to the hyperextended configuration required for maximal height. Increasing touchdown velocity and angular momentum lead to additional post-flight rotation potential. By increasing the horizontal velocity at table touchdown, within limits obtained from recorded performances, the handspring double somersault tucked with one and a half twists, and the handspring triple somersault tucked became theoretically possible. Copyright © 2015 Elsevier B.V. All rights reserved.
Two-Loop Maximal Unitarity with External Masses
Johansson, Henrik; Larsen, Kasper J
2013-01-01
We extend the maximal unitarity method at two loops to double-box basis integrals with up to three external massive legs. We use consistency equations based on the requirement that integrals of total derivatives vanish. We obtain unique formulae for the coefficients of the master double-box integrals. These formulae can be used either analytically or numerically.
The influence of body position on maximal performance in cycling.
Welbergen, E; Clijsen, L P
1990-01-01
Six healthy male subjects performed a 3-min supramaximal test in four different cycling positions: two with different trunk angles and two with different saddle-tube angles. Maximal power output and maximal oxygen uptake (VO2max) were measured. Maximal power output was significantly higher in a standard sitting (SS, 381 W, SD 49) upright position compared to all other positions: standard racing (SR, 364 W, SD 49), recumbent backwards (RB, 355 W, SD 44) and recumbent forwards (RF, 341 W, SD 54). Although VO2max was also highest in SS (4.31 l.min-1, SD 0.5) upright position, the differences in VO2max were not significant (SR, 4.2 l.min-1, SD 0.53; RB, 4.17 l.min-1, SD 0.58; RF, 4.11 l.min-1, SD 0.66). It is concluded that (supra)maximal tests on a cycle ergometer should be performed in a sitting upright position and not in a racing position. In some cases when cycling on the road, higher speeds can be attained when sitting upright. This is especially true when cycling uphill when high power must be generated to overcome gravity but the road speed, and hence the power required to overcome air resistance, is relatively low.
Teacher Praise: Maximizing the Motivational Impact. Teaching Strategies.
McVey, Mary D.
2001-01-01
Recognizes the influence of praise on human behavior, and provides specific suggestions on how to maximize the positive effects of praise when intended as positive reinforcement. Examines contingency, specificity, and selectivity aspects of praise. Cautions teachers to avoid the controlling effects of praise and the possibility that praise may…
Maximizing Access, Equity, and Inclusion in General and Special Education
Obiakor, Festus E.
2011-01-01
The goal of any educational program is to help its students to maximize their fullest potential in inclusive environments. For many students with disabilities, having an inclusive environment seems to be an ideal policy. Ironically, this policy continues to be debatable and controversial. Sometimes, the controversy or debate dominates the real…
How to Maximize Learning for Gifted Math Students
Chamberlin, Scott A.
2008-01-01
Having a gifted math or science student in the family or classroom is a fascination as well as a significant challenge and responsibility for many parents and teachers. In order to help maximize student learning, several questions need to be asked. What should be the role of technology? How well do traditional schools serve gifted students? What…
Curriculum and Testing Strategies to Maximize Special Education STAAR Achievement
Johnson, William L.; Johnson, Annabel M.; Johnson, Jared W.
2015-01-01
This document is from a presentation at the 2015 annual conference of the Science Teachers Association of Texas (STAT). The two sessions (each listed as feature sessions at the state conference) examined classroom strategies the presenter used in his chemistry classes to maximize Texas end-of-course chemistry test scores for his special population…
Simplicity and maximal commutative subalgebras of twisted generalized Weyl algebras
Hartwig, J.T.; Öinert, Per Johan
2013-01-01
conditions for certain TGWAs to be simple, in the case when R is commutative. We illustrate our theorems by considering some special classes of TGWAs and providing concrete examples. We also discuss how simplicity of a TGWA is related to the maximal commutativity of R and the (non-)existence of non...
Lifetime maximization routing with network coding in wireless multihop networks
DING LiangHui; WU Ping; WANG Hao; PAN ZhiWen; YOU XiaoHu
2013-01-01
In this paper, we consider the lifetime maximization routing with network coding in wireless mul- tihop networks. We first show that lifetime maximization with network coding is different from pure routing, throughput maximization with network coding and energy minimization with network coding. Then we formulate lifetime maximization problems in three different cases of （i） no network coding, （ii） two-way network coding, and （iii） overhearing network coding. To solve these problems, we use flow augmenting routing （FA） for the first case, and then extend the FA with network coding （FANC） by using energy minimized one-hop network coding. After that, we investigate the influence of parameters of FANC, evaluate the performance of FANC with two-way and overhearing network coding schemes and compare it with that without network coding under two different power control models, namely, protocol and physical ones. The results show that the lifetime can be improved significantly by using network coding, and the performance gain of network coding decreases with the increase of flow asymmetry and the power control ability.
The Long Conversation Maximizing Business Value from Information Technology Investment
Lorenzo, Oswaldo; González, Gastón; Ramdani, Boumediene
2011-01-01
For many years companies have been investing in enterprise systems and IT initiatives but they are now struggling to achieve the desired results. It takes a long time to make the best of your enterprise systems so businesses must stop looking for the next technology 'silver bullet' and instead maximize the value of existing IT investments.
5D Maximally Supersymmetric Yang-Mills on the Lattice
Joseph, Anosh
2016-01-01
We provide details of the lattice construction of five-dimensional maximally supersymmetric Yang-Mills theory. The lattice theory is supersymmetric, gauge invariant and free from spectrum doublers. Such a supersymmetric lattice formulation is interesting as it can be used for non-perturbative explorations of the five-dimensional theory, which has a known gravitational dual.
Entropy Maximization and the Spatial Distribution of Species
Haegeman, Bart; Etienne, Rampal S.
2010-01-01
Entropy maximization (EM, also known as MaxEnt) is a general inference procedure that originated in statistical mechanics. It has been applied recently to predict ecological patterns, such as species abundance distributions and species-area relationships. It is well known in physics that the EM resu
AN EXISTENCE THEOREM FOR MAXIMAL ELEMENTS AND ITS APPLICATIONS
Hou Jicheng; He Wei
2007-01-01
An existence theorem of maximal elements for an L*-majorized correspondence de-fined on a non-paracompact H-space is established. As applications of the result, an equilibrium existence theorem for a non-paracompact generalized game in H-spaces with infinitely many players and with L*-majorized correspondences is given.
Successive superalgebraic truncations from the four-dimensional maximal supergravity
Kim, C H; Kim, K Y; Kim, Y; Kim, Chang Ho; Park, Young Jai; Kim, Kee Yong; Kim, Yongduk
1994-01-01
We study the four-dimensional {\\it N}=8 maximal supergravity in the context of Lie superalgebra SU(8/1). All possible successive superalgebraic truncations from four-dimensional {\\it N}=8 theory to {\\it N}=7, 6, \\cdots, 1 supergravity theories are systematically realized as sub-superalgebra chains of SU(8/1) by using the Kac-Dynkin weight techniques.
Determinants of maximally attained level of pulmonary function
Wang, XB; Mensinga, TT; Schouten, JP; Rijcken, B; Weiss, ST
2004-01-01
This study investigated the determinants of sex-specific maximally attained levels of FEV1, VC, and the ratio of FEV1 to VC. Subjects were between the ages of 15 and 35 years (1,818 males and 1,732 females), participating in the Vlagtwedde/Vlaardingen study in The Netherlands. The subjects were foll
Modifying Softball for Maximizing Learning Outcomes in Physical Education
Brian, Ali; Ward, Phillip; Goodway, Jacqueline D.; Sutherland, Sue
2014-01-01
Softball is taught in many physical education programs throughout the United States. This article describes modifications that maximize learning outcomes and that address the National Standards and safety recommendations. The modifications focus on tasks and equipment, developmentally appropriate motor-skill acquisition, increasing number of…
Should I Stay or Should I Go? Maximizers versus Satisficers
Buri, John R.; Gunty, Amy; King, Stephanie L.
2008-01-01
In the present study, university students were presented a scenario in which a married couple was struggling in their marriage. These students were asked how likely it is that they would stay in a difficult marriage like the one described in the scenario. Each student also completed Schwartz's (2004) Maximization Scale. High scorers on this scale…
Nursing Students' Awareness and Intentional Maximization of Their Learning Styles
Mayfield, Linda Riggs
2012-01-01
This small, descriptive, pilot study addressed survey data from four levels of nursing students who had been taught to maximize their learning styles in a first-semester freshman success skills course. Bandura's Agency Theory supports the design. The hypothesis was that without reinforcing instruction, the students' recall and application of that…
The Effects of Leniency on Maximal Cartel Pricing
Houba, H.E.D.; Motchenkova, E.; Wen, Q.
2009-01-01
We analyze maximal cartel prices in infnitely-repeated oligopoly models under leniency where fines are linked to illegal gains, as often outlined in existing antitrust regulation, and detection probabilities depend on the degree of collusion. We introduce cartel culture that describes how likely car
A Data-Based Approach to Social Influence Maximization
Goyal, Amit; Lakshmanan, Laks V S
2011-01-01
Influence maximization is the problem of finding a set of users in a social network, such that by targeting this set, one maximizes the expected spread of influence in the network. Most of the literature on this topic has focused exclusively on the social graph, overlooking historical data, i.e., traces of past action propagations. In this paper, we study influence maximization from a novel data-based perspective. In particular, we introduce a new model, which we call credit distribution, that directly leverages available propagation traces to learn how influence flows in the network and uses this to estimate expected influence spread. Our approach also learns the different levels of influenceability of users, and it is time-aware in the sense that it takes the temporal nature of influence into account. We show that influence maximization under the credit distribution model is NP-hard and that the function that defines expected spread under our model is submodular. Based on these, we develop an approximation ...
Principle of Entropy Maximization for Nonequilibrium Steady States
Shapiro, Alexander; Stenby, Erling Halfdan
2002-01-01
The goal of this contribution is to find out to what extent the principle of entropy maximization, which serves as a basis for the equilibrium thermodynamics, may be generalized onto non-equilibrium steady states. We prove a theorem that, in the system of thermodynamic coordinates, where entropy...
Optoelectronic plethysmography compared to spirometry during maximal exercise.
Layton, Aimee M; Moran, Sienna L; Garber, Carol Ewing; Armstrong, Hilary F; Basner, Robert C; Thomashow, Byron M; Bartels, Matthew N
2013-01-15
The purpose of this study was to compare simultaneous measurements of tidal volume (Vt) by optoelectronic plethysmography (OEP) and spirometry during a maximal cycling exercise test to quantify possible differences between methods. Vt measured simultaneously by OEP and spirometry was collected during a maximal exercise test in thirty healthy participants. The two methods were compared by linear regression and Bland-Altman analysis at submaximal and maximal exercise. The average difference between the two methods and the mean percentage discrepancy were calculated. Submaximal exercise (SM) and maximal exercise (M) Vt measured by OEP and spirometry had very good correlation, SM R=0.963 (pspirometry. OEP could measure exercise Vt as much as 0.188 L above and -0.017 L below that of spirometry. The discrepancy between measurements was -2.0 ± 7.2% at SM and -2.4 ± 3.9% at M. In conclusion, Vt measurements at during exercise by OEP and spirometry are closely correlated and the difference between measurements was insignificant.
Entropy Maximization and the Spatial Distribution of Species
Haegeman, Bart; Etienne, Rampal S.
Entropy maximization (EM, also known as MaxEnt) is a general inference procedure that originated in statistical mechanics. It has been applied recently to predict ecological patterns, such as species abundance distributions and species-area relationships. It is well known in physics that the EM
On Maximal Subgroups of a Finite Solvable Group
Gritsuk, D V
2011-01-01
The following result is received: Let $H$ be a non-normal maximal subgroup of a finite solvable group $G$ and let $q \\in \\pi(F(H/\\mathrm{Core}_GH))$, then $G$ has a Sylow $q$-subgroup $Q$ such that $N_{G}(Q) \\subseteq H$.
The Effects of Leniency on Maximal Cartel Pricing
Houba, H.E.D.; Motchenkova, E.; Wen, Q.
2009-01-01
We analyze maximal cartel prices in infnitely-repeated oligopoly models under leniency where fines are linked to illegal gains, as often outlined in existing antitrust regulation, and detection probabilities depend on the degree of collusion. We introduce cartel culture that describes how likely
Emotional Control and Instructional Effectiveness: Maximizing a Timeout
Andrews, Staci R.
2015-01-01
This article provides recommendations for best practices for basketball coaches to maximize the instructional effectiveness of a timeout during competition. Practical applications are derived from research findings linking emotional intelligence to effective coaching behaviors. Additionally, recommendations are based on the implications of the…
Quantitative approaches for profit maximization in direct marketing
van der Scheer, H.R.
1998-01-01
An effective direct marketing campaign aims at selecting those targets, offer and communication elements - at the right time - that maximize the net profits. The list of individuals to be mailed, i.e. the targets, is considered to be the most important component. Therefore, a large amount of direct
The Bianchi classification of maximal D=8 gauged supergravities
Bergshoeff, E; Gran, U; Linares, R; Nielsen, M; Ortin, T; Roest, D
2004-01-01
We construct maximal D = 8 gauged supergravities by the reduction of D = 11 supergravity over three-dimensional group manifolds. Such manifolds have been classified by Bianchi. We divide the corresponding gauged supergravities into two classes: class A (with a Lagrangian) and class B (without a Lagr
The Bianchi classification of maximal D = 8 gauged supergravities
Bergshoeff, E.; Gran, U.; Linares, R.; Nielsen, M.; Ortín, T.; Roest, D.
2004-01-01
We construct maximal D = 8 gauged supergravities by the reduction of D = 11 supergravity over three-dimensional group manifolds. Such manifolds have been classified by Bianchi. We divide the corresponding gauged supergravities into two classes: class A (with a Lagrangian) and class B (without a Lagr
Minimal fusion systems with a unique maximal parabolic
Henke, Ellen
2011-01-01
We define minimal fusion systems in a way that every non-solvable fusion system has a section which is minimal. Minimal fusion systems can also be seen as analogs of Thompson's N-groups. In this paper, we consider a minimal fusion system F on a finite p-group S that has a unique maximal p-local s...
Maximally parallel attribute on P Systems:Properties and applications
Chunyi Huang; Xiaoju Dong
2008-01-01
In this paper,we investigate the maximally parallel attribute of P Systems.Some properties of P Systems are introduced,which are the filter property and the enumeration property.The two properties are applied to solving the sorting problem and the Hamilton cycle problem.respectively.
Effect of freezing and thawing rates on denaturation of proteins in aqueous solutions.
Cao, Enhong; Chen, Yahuei; Cui, Zhanfeng; Foster, Peter R
2003-06-20
The freeze denaturation of model proteins, LDH, ADH, and catalase, was investigated in absence of cryoprotectants using a microcryostage under well-controlled freezing and thawing rates. Most of the experimental data were obtained from a study using a dilute solution with an enzyme concentration of 0.025 g/l. The dependence of activity recovery of proteins on the freezing and thawing rates showed a reciprocal and independent effect, that is, slow freezing (at a freezing rate about 1 degrees C/min) and fast thawing (at a thawing rate >10 degrees C/min) produced higher activity recovery, whereas fast freezing with slow thawing resulted in more severe damage to proteins. With minimizing the freezing concentration and pH change of buffer solution by using a potassium phosphate buffer, this phenomenon could be ascribed to surface-induced denaturation during freezing and thawing process. Upon the fast freezing (e.g., when the freezing rate >20 degrees C/min), small ice crystals and a relatively large surface area of ice-liquid interface are formed, which increases the exposure of protein molecules to the ice-liquid interface and hence increases the damage to the proteins. During thawing, additional damage to proteins is caused by recrystallization process. Recrystallization exerts additional interfacial tension or shear on the entrapped proteins and hence causes additional damage to the latter. When buffer solutes participated during freezing, the activity recovery of proteins after freezing and thawing decreased due to the change of buffer solution pH during freezing. However, the patterns of the dependence on freezing and thawing rates of activity recovery did not change except for that at extreme low freezing rates (solutions could be reduced by changing the buffer type and composition and by optimizing the freezing-thawing protocol.
Maximal isometric strength of the cervical musculature in 100 healthy volunteers
Jordan, A; Mehlsen, J; Bülow, P M
1999-01-01
A descriptive study involving maximal isometric strength measurements of the cervical musculature.......A descriptive study involving maximal isometric strength measurements of the cervical musculature....
Geoghegan, Michael W
2005-01-01
Podcasting is the art of recording radio show style audio tracks, then distributing them to listeners on the Web via podcasting software such as iPodder. From downloading podcasts to producing a track for fun or profit, ""Podcast Solutions"" covers the entire world of podcasting with insight, humor, and the unmatched wisdom of experience.
Sonneveld, C.; Voogt, W.
2009-01-01
The characteristics of the soil solution in the root environment in the greenhouse industry differ much from those for field grown crops. This is caused firstly by the growing conditions in the greenhouse, which strongly differ from those in the field and secondly the function attributed to the soil
Reza A Zoroofi
2007-08-01
Full Text Available Medal Electronic (ME Engineering Company provides high quality systems, software and services in medical image management, processing and visualization. We assist health care professionals to improve and extend the efficiency of their practices with cost effective solutions. ME is the developer of several medical software including MEDAL-PACS, 3D-Sonosoft, Analytical-Electrophoresis, CBONE and Rhino-Plus. ME is also the exclusive distributor of PACSPLUS in Iran. PACSPLUS is an international, standard, scalable and enterprise PACS solution. PACSPLUS is of ISO, CE and FDA-510 approvals. It is now operational in more than 1000 clinical environment throughout the globe. We discuss about the key features of PACSPLUS system for dealing with real world challenge in PACS as well as the PACS solu-tions needed to fulfill the demands of the clinicians in Iran. Our experience in developing high-end medical software confirms our capability in providing the PACSPLUS as an ultimate PACS solution in Iran.
Tomashevskiy, L.P.; Boldin, V.M.; Borovikov, P.A.; Fedorova, G.G.; Koshelova, I.F.; Krivoshchekova, N.P.; Prokhorevich, L.D.; Prudnikova, N.N.; Vin, L.R.
1982-01-01
This solution is designed to quickly harden in a cool environment. Phenoformaldyhyde tar is used as a hardening agent along with a modified diethyleneglycol in the amounts of (part by weight): phenoformaldyhyde tar and diethyleneglycol=1oo; acidic hardener=8-16; water=2-4.
LU LING
2010-01-01
@@ World Expo's China Pavilion is a large crimson building,but it's green at heart.The pavilion,a magnificent symbol of Chinese culture,is also a "green landmark" on the world stage,thanks to German company Siemens' energy-saving solutions.
Kriengsak Wattanawitoon
2011-01-01
Full Text Available We prove strong and weak convergence theorems of modified hybrid proximal-point algorithms for finding a common element of the zero point of a maximal monotone operator, the set of solutions of equilibrium problems, and the set of solution of the variational inequality operators of an inverse strongly monotone in a Banach space under different conditions. Moreover, applications to complementarity problems are given. Our results modify and improve the recently announced ones by Li and Song (2008 and many authors.
Jasmine2000 the Comprehemsive e-Business Solution
无
2001-01-01
@@Fujitsu presents the next generation of infomation management software Solution for the e-Business era.Jasminne2000 based on the leading edge object database technology has the flexibility and robustness to operate successfully in a wide variety of business solution areas and promises to maximize business opportunities.Jasmine2000 technology has proven itself in the fields of Retail
Gowdy-Symmetric Vacuum and Electrovacuum Solutions
Hennig, Jörg
2015-01-01
"Smooth Gowdy-symmetric generalized Taub-NUT solutions" are a class of inhomogeneous cosmological vacuum models with a past and a future Cauchy horizon. In this proceedings contribution, we present families of exact solutions within that class, which contain the Taub solution as a special case, and discuss their properties. In particular, we show that, for a special choice of the parameters, the solutions have a curvature singularity with directional behaviour. For other parameter choices, the maximal globally hyperbolic region is singularity-free. We also construct extensions through the Cauchy horizons and analyse the causal structure of the solutions. Finally, we discuss the generalization from vacuum to electrovacuum and present an exact family of solutions for that case.
New Insights into Enhancing Maximal Exercise Performance Through the Use of a Bitter Tastant.
Gam, Sharon; Guelfi, Kym J; Fournier, Paul A
2016-10-01
It is generally acknowledged that for an orally administered ergogenic aid to enhance exercise performance it must first be absorbed by the gastrointestinal tract before exerting its effects. Recently, however, it has been reported that some ergogenic aids can affect exercise performance without prior absorption by the gastrointestinal tract. This is best illustrated by studies that have shown that rinsing the mouth with a carbohydrate (CHO) solution, without swallowing it, significantly improves exercise performance. The ergogenic effects of CHO mouth rinsing in these studies have been attributed to the activation of the brain by afferent taste signals, but the specific mechanisms by which this brain activation translates to enhanced exercise performance have not yet been elucidated. Given the benefits of CHO mouth rinsing for exercise performance, this raises the issue of whether other types of tastants, such as bitter-tasting solutions, may also improve exercise performance. Recently, we performed a series of studies investigating whether the bitter tastant quinine can improve maximal sprint performance in competitive male cyclists, and, if so, to examine some of the possible mechanisms whereby this effect may occur. These studies have shown that mouth rinsing and ingesting a bitter-tasting quinine solution can significantly improve the performance of a maximal cycling sprint. There is also evidence that the ergogenic effect of quinine is mediated, at least in part, by an increase in autonomic nervous system activation and/or corticomotor excitability. The purpose of this article is to discuss the results and implications of these recent studies and to suggest avenues for further research, which may add to the understanding of the way the brain integrates signals from the oral cavity with motor behaviour, as well as uncover novel strategies to improve exercise performance.
Cohen, Sarah P; Orenstein, David M
2014-12-01
Disease progression in cystic fibrosis (CF) is marked by worsening exercise tolerance. Further, maximal exercise capacity (VO2 peak) correlates with survival in CF, but maximal tests are uncomfortable and resource-intensive. A three-minute step test (STEP) has been validated in CF. Heart rate (HR) recovery after exercise correlates with all-cause mortality in adult non-CF populations. We compared HR recovery after the three-minute step test with VO2 peak in children with CF. Twenty-four children with CF performed STEP and a maximal exercise test. Correlation between the tests was assessed. Maximum HR on STEP was lower than on the maximal test (140 vs. 190, p<0.01). Peak HR during STEP correlated inversely with VO2 peak. In subjects with mild lung disease, faster HR recovery after STEP correlated with higher VO2 peak. The three-minute step test is a feasible submaximal test in this patient population. HR during and after a three-minute step test may reflect VO2 peak in children with CF. Copyright © 2014 European Cystic Fibrosis Society. Published by Elsevier B.V. All rights reserved.
Epigallocatechin-3-gallate increases maximal oxygen uptake in adult humans.
Richards, Jennifer C; Lonac, Mark C; Johnson, Tyler K; Schweder, Melani M; Bell, Christopher
2010-04-01
Epigallocatechin-3-gallate (EGCG), a component of green tea, increases endurance performance in animals and promotes fat oxidation during cycle ergometer exercise in adult humans. We have investigated the hypothesis that short-term consumption of EGCG delays the onset of the ventilatory threshold (VT) and increases maximal oxygen uptake (VO2max). In this randomized, repeated-measures, double-blind study, 19 healthy adults (11 males and 8 females, age = 26 ± 2 yr (mean ± SE)) received seven placebo or seven EGCG (135-mg) pills. Forty-eight hours before data collection, participants began consuming three pills per day; the last pill was taken 2 h before exercise testing. VT and VO2max were determined from breath-by-breath indirect calorimetry data collected during continuous incremental stationary cycle ergometer exercise (20-35 W·min(-1)), from rest until volitional fatigue. Each condition/exercise test was separated by a minimum of 14 d. Compared with placebo, short-term EGCG consumption increased VO2max (3.123 ± 0.187 vs 3.259 ± 0.196 L·min(-1), P = 0.04). Maximal work rate (301 ± 15 vs 301 ± 16 W, P = 0.98), maximal RER (1.21 ± 0.01 vs 1.22 ± 0.02, P = 0.27), and maximal HR were unaffected (180 ± 3 vs 180 ± 3 beats·min(-1), P = 0.87). In a subset of subjects (n = 11), maximal cardiac output (determined via open-circuit acetylene breathing) was also unaffected by EGCG (29.6 ± 2.2 vs 30.2 ± 1.4 L·min(-1), P = 0.70). Contrary to our hypothesis, EGCG decreased VO2 at VT (1.57 ± 0.11 vs 1.48 ± 0.10 L·min(-1)), but this change was not significant (P = 0.06). Short-term consumption of EGCG increased VO2max without affecting maximal cardiac output, suggesting that EGCG may increase arterial-venous oxygen difference.
Jung, Halim; Jung, SangWoo; Joo, Sunghee; Song, Changho
2016-01-01
[Purpose] The purpose of this study was to compare changes in the mobility of the pelvic floor muscle during the abdominal drawing-in maneuver, maximal expiration, and pelvic floor muscle maximal contraction. [Subjects] Thirty healthy adults participated in this study (15 men and 15 women). [Methods] All participants performed a bridge exercise and abdominal curl-up during the abdominal drawing-in maneuver, maximal expiration, and pelvic floor muscle maximal contraction. Pelvic floor mobility...
Positive solutions of quasilinear parabolic systems with Dirichlet boundary condition
Pao, C. V.; Ruan, W. H.
Coupled systems for a class of quasilinear parabolic equations and the corresponding elliptic systems, including systems of parabolic and ordinary differential equations are investigated. The aim of this paper is to show the existence, uniqueness, and asymptotic behavior of time-dependent solutions. Also investigated is the existence of positive maximal and minimal solutions of the corresponding quasilinear elliptic system. The elliptic operators in both systems are allowed to be degenerate in the sense that the density-dependent diffusion coefficients D(u) may have the property D(0)=0 for some or all i=1,…,N, and the boundary condition is u=0. Using the method of upper and lower solutions, we show that a unique global classical time-dependent solution exists and converges to the maximal solution for one class of initial functions and it converges to the minimal solution for another class of initial functions; and if the maximal and minimal solutions coincide then the steady-state solution is unique and the time-dependent solution converges to the unique solution. Applications of these results are given to three model problems, including a scalar polynomial growth problem, a coupled system of polynomial growth problem, and a two component competition model in ecology.
Document Classification Using Expectation Maximization with Semi Supervised Learning
Nigam, Bhawna; Salve, Sonal; Vamney, Swati
2011-01-01
As the amount of online document increases, the demand for document classification to aid the analysis and management of document is increasing. Text is cheap, but information, in the form of knowing what classes a document belongs to, is expensive. The main purpose of this paper is to explain the expectation maximization technique of data mining to classify the document and to learn how to improve the accuracy while using semi-supervised approach. Expectation maximization algorithm is applied with both supervised and semi-supervised approach. It is found that semi-supervised approach is more accurate and effective. The main advantage of semi supervised approach is "Dynamically Generation of New Class". The algorithm first trains a classifier using the labeled document and probabilistically classifies the unlabeled documents. The car dataset for the evaluation purpose is collected from UCI repository dataset in which some changes have been done from our side.
Efficient Conservation in a Utility-Maximization Framework
Frank W. Davis
2006-06-01
Full Text Available Systematic planning for biodiversity conservation is being conducted at scales ranging from global to national to regional. The prevailing planning paradigm is to identify the minimum land allocations needed to reach specified conservation targets or maximize the amount of conservation accomplished under an area or budget constraint. We propose a more general formulation for setting conservation priorities that involves goal setting, assessing the current conservation system, developing a scenario of future biodiversity given the current conservation system, and allocating available conservation funds to alter that scenario so as to maximize future biodiversity. Under this new formulation for setting conservation priorities, the value of a site depends on resource quality, threats to resource quality, and costs. This planning approach is designed to support collaborative processes and negotiation among competing interest groups. We demonstrate these ideas with a case study of the Sierra Nevada bioregion of California.
Origin of Constrained Maximal CP Violation in Flavor Symmetry
He, Hong-Jian; Xu, Xun-Jie
2015-01-01
Current data from neutrino oscillation experiments are in good agreement with $\\delta=-\\pi/2$ and $\\theta_{23} = \\pi/4$. We define the notion of "constrained maximal CP violation" for these features and study their origin in flavor symmetry models. We give various parametrization-independent definitions of constrained maximal CP violation and present a theorem on how it can be generated. This theorem takes advantage of residual symmetries in the neutrino and charged lepton mass matrices, and states that, up to a few exceptions, $\\delta=\\pm\\pi/2$ and $\\theta_{23} = \\pi/4$ are generated when those symmetries are real. The often considered $\\mu$-$\\tau$ reflection symmetry, as well as specific discrete subgroups of $O(3)$, are special case of our theorem.
Maximizing production rates of the Linde Hampson machine
Maytal, B.-Z.
2006-01-01
In contrast to the ideal case of unlimited size recuperator, any real Linde-Hampson machine of finite size recuperator can be optimized to reach the extreme rates of performance. The group of cryocoolers sharing the same size recuperator is optimized in a closed form by determining the corresponding flow rate which maximizes its rate of cold production. For a similar group of liquefiers an optimal flow rate is derived to maximize the rate of production of liquid cryogen. The group of cryocoolers sharing a constant and given flow rate is optimized by shortening the recuperator for reaching a maximum compactness measured by the cooling power per unit size of the recuperator. The optimum conditions are developed for nitrogen and argon. The relevance of this analysis is discussed in the context of practice of fast cooldown Joule-Thomson cryocooling.
String partition functions in Rindler space and maximal acceleration
Mertens, Thomas G; Zakharov, Valentin I
2015-01-01
We revisit non-interacting string partition functions in Rindler space by summing over fields in the spectrum. Using recent results of JHEP 1505 (2015) 106, this construction, first done by Emparan, can be put on much firmer ground. For open strings, we demonstrate that surface contributions to the higher spin fields correspond to open strings piercing the Rindler origin, unifying the higher spin surface contributions in string language. We generalize the construction of these partition functions to type II and heterotic superstrings and demonstrate modular invariance for the resulting partition functions. Also, explicit signs of spacetime supersymmetry are visible. All of these exhibit an IR divergence that can be interpreted as a maximal acceleration with $T_{\\text{crit}} = T_{H}/\\pi$ close to the black hole horizon. Ultimately, these partition functions are not physical, and divergences here should not be viewed as a failure of string theory: maximal acceleration is a feature of a faulty treatment of the h...
Neuromuscular fatigue during dynamic maximal strength and hypertrophic resistance loadings.
Walker, Simon; Davis, Lisa; Avela, Janne; Häkkinen, Keijo
2012-06-01
The purpose of this study was to compare the acute neuromuscular fatigue during dynamic maximal strength and hypertrophic loadings, known to cause different adaptations underlying strength gain during training. Thirteen healthy, untrained males performed two leg press loadings, one week apart, consisting of 15 sets of 1 repetition maximum (MAX) and 5 sets of 10 repetition maximums (HYP). Concentric load and muscle activity, electromyography (EMG) amplitude and median frequency, was assessed throughout each set. Additionally, maximal bilateral isometric force and muscle activity was assessed pre-, mid-, and up to 30 min post-loading. Concentric load during MAX was decreased after set 10 (Pmuscle activity during HYP loading. Copyright © 2011 Elsevier Ltd. All rights reserved.
Integral circulant graphs of prime power order with maximal energy
Sander, Jürgen W; 10.1016/j.laa.2011.05.039
2011-01-01
The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count n and a set D of divisors of n in such a way that they have vertex set Zn and edge set {{a, b} : a, b in Zn; gcd(a - b, n) in D}. Using tools from convex optimization, we study the maximal energy among all integral circulant graphs of prime power order ps and varying divisor sets D. Our main result states that this maximal energy approximately lies between s(p - 1)p^(s-1) and twice this value. We construct suitable divisor sets for which the energy lies in this interval. We also characterize hyperenergetic integral circulant graphs of prime power order and exhibit an interesting topological property of their divisor sets.
Resistance maximization principle for defending networks against virus attack
Li, Angsheng; Zhang, Xiaohui; Pan, Yicheng
2017-01-01
We investigate the defending of networks against virus attack. We define the resistance of a network to be the maximum number of bits required to determine the code of the module that is accessible from random walk, from which random walk cannot escape. We show that for any network G, R(G) =H1(G) -H2(G) , where R(G) is the resistance of G, H1(G) and H2(G) are the one- and two-dimensional structural information of G, respectively, and that resistance maximization is the principle for defending networks against virus attack. By using the theory, we investigate the defending of real world networks and of the networks generated by the preferential attachment and the security models. We show that there exist networks that are defensible by a small number of controllers from cascading failure of any virus attack. Our theory demonstrates that resistance maximization is the principle for defending networks against virus attacks.
WEIGHTED INEQUALITIES FOR THE GEOMETRIC MAXIMAL OPERATOR ON MARTINGALE SPACES
无
2008-01-01
In this article, the authors introduce two operators-geometrical maximal operator Mo and the closely related limiting operator M*O, then they give sufficient conditions under which the equality MO = M*O holds, and characterize the equivalent relations between the weak or strong type weighted inequality and the property of W∞-weight or W*∞-weight for the geometrical maximal operator in the case of two-weight condition. What should be mentioned is that the new operator-the geometrical minimal operator is equal to the limitation of the minimal operator sequence, and the results for the minimal operator proved in [12] makes the proof elegant and evident.
Maximal-acceleration phase space relativity from Clifford algebras
Castro, C
2002-01-01
We present a new physical model that links the maximum speed of light with the minimal Planck scale into a maximal-acceleration Relativity principle in the spacetime tangent bundle and in phase spaces (cotangent bundle). Crucial in order to establish this link is the use of Clifford algebras in phase spaces. The maximal proper-acceleration bound is a = c^2/ \\Lambda in full agreement with the old predictions of Caianiello, the Finslerian geometry point of view of Brandt and more recent results in the literature. We present the reasons why an Extended Scale Relativity based on Clifford spaces is physically more appealing than those based on kappa-deformed Poincare algebras and the inhomogeneous quantum groups operating in quantum Minkowski spacetimes. The main reason being that the Planck scale should not be taken as a deformation parameter to construct quantum algebras but should exist already as the minimum scale in Clifford spaces.
Identities on Maximal Subgroups of GLn(D)
D. Kiani; M. Mahdavi-Hezavehi
2005-01-01
Let D be a division ring with centre F. Assume that M is a maximal subgroup of GLn(D) (n ≥ 1) such that Z(M) is algebraic over F. Group identities on M and polynomial identities on the F-linear hull F[M] are investigated. It is shown that if F[M]is a PI-algebra, then [D: F] ＜∞. When D is non-commutative and F is infinite, it is also proved that if M satisfies a group identity and F[M] is algebraic over F, then we have either M = K* where K is a field and [D: F] ＜∞, or M is absolutely irreducible. For a finite dimensional division algebra D, assume that N is a subnormal subgroup of GLn(D)and M is a maximal subgroup of N. If M satisfies a group identity, it is shown that M is abelian-by-finite.
Dynamically Disordered Quantum Walk as a Maximal Entanglement Generator
Vieira, Rafael; Amorim, Edgard P. M.; Rigolin, Gustavo
2013-11-01
We show that the entanglement between the internal (spin) and external (position) degrees of freedom of a qubit in a random (dynamically disordered) one-dimensional discrete time quantum random walk (QRW) achieves its maximal possible value asymptotically in the number of steps, outperforming the entanglement attained by using ordered QRW. The disorder is modeled by introducing an extra random aspect to QRW, a classical coin that randomly dictates which quantum coin drives the system’s time evolution. We also show that maximal entanglement is achieved independently of the initial state of the walker, study the number of steps the system must move to be within a small fixed neighborhood of its asymptotic limit, and propose two experiments where these ideas can be tested.
Maximal injective and mixing masas in group factors
Jolissaint, Paul
2010-01-01
We present families of pairs of finite von Neumann algebras $A\\subset M$ where $A$ is a maximal injective masa in the type $\\mathrm{II}_1$ factor $M$ with separable predual. Our results make use of the strong mixing and the asymptotic orthogonality properties of $A$ in $M$ and are borrowed from ideas of S. Popa who proved that if $G$ is a non abelian free group and if $a$ is one of its generators, then the von Neumann algebra generated by $a$ is maximal injective in the factor $L(G)$. Our results apply to pairs $H
Fredriksson, Albin, E-mail: albin.fredriksson@raysearchlabs.com; Hårdemark, Björn [RaySearch Laboratories, Sveavägen 44, Stockholm SE-111 34 (Sweden); Forsgren, Anders [Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, Stockholm SE-100 44 (Sweden)
2015-07-15
Purpose: This paper introduces a method that maximizes the probability of satisfying the clinical goals in intensity-modulated radiation therapy treatments subject to setup uncertainty. Methods: The authors perform robust optimization in which the clinical goals are constrained to be satisfied whenever the setup error falls within an uncertainty set. The shape of the uncertainty set is included as a variable in the optimization. The goal of the optimization is to modify the shape of the uncertainty set in order to maximize the probability that the setup error will fall within the modified set. Because the constraints enforce the clinical goals to be satisfied under all setup errors within the uncertainty set, this is equivalent to maximizing the probability of satisfying the clinical goals. This type of robust optimization is studied with respect to photon and proton therapy applied to a prostate case and compared to robust optimization using an a priori defined uncertainty set. Results: Slight reductions of the uncertainty sets resulted in plans that satisfied a larger number of clinical goals than optimization with respect to a priori defined uncertainty sets, both within the reduced uncertainty sets and within the a priori, nonreduced, uncertainty sets. For the prostate case, the plans taking reduced uncertainty sets into account satisfied 1.4 (photons) and 1.5 (protons) times as many clinical goals over the scenarios as the method taking a priori uncertainty sets into account. Conclusions: Reducing the uncertainty sets enabled the optimization to find better solutions with respect to the errors within the reduced as well as the nonreduced uncertainty sets and thereby achieve higher probability of satisfying the clinical goals. This shows that asking for a little less in the optimization sometimes leads to better overall plan quality.
Maximizing Protein Translation Rate in the Ribosome Flow Model: The Homogeneous Case.
Zarai, Yoram; Margaliot, Michael; Tuller, Tamir
2014-01-01
Gene translation is the process in which intracellular macro-molecules, called ribosomes, decode genetic information in the mRNA chain into the corresponding proteins. Gene translation includes several steps. During the elongation step, ribosomes move along the mRNA in a sequential manner and link amino-acids together in the corresponding order to produce the proteins. The homogeneous ribosome flow model (HRFM) is a deterministic computational model for translation-elongation under the assumption of constant elongation rates along the mRNA chain. The HRFM is described by a set of n first-order nonlinear ordinary differential equations, where n represents the number of sites along the mRNA chain. The HRFM also includes two positive parameters: ribosomal initiation rate and the (constant) elongation rate. In this paper, we show that the steady-state translation rate in the HRFM is a concave function of its parameters. This means that the problem of determining the parameter values that maximize the translation rate is relatively simple. Our results may contribute to a better understanding of the mechanisms and evolution of translation-elongation. We demonstrate this by using the theoretical results to estimate the initiation rate in M. musculus embryonic stem cell. The underlying assumption is that evolution optimized the translation mechanism. For the infinite-dimensional HRFM, we derive a closed-form solution to the problem of determining the initiation and transition rates that maximize the protein translation rate. We show that these expressions provide good approximations for the optimal values in the n-dimensional HRFM already for relatively small values of n. These results may have applications for synthetic biology where an important problem is to re-engineer genomic systems in order to maximize the protein production rate.
Profit maximization with customer satisfaction control for electric vehicle charging in smart grids
Edwin Collado
2017-05-01
Full Text Available As the market of electric vehicles is gaining popularity, large-scale commercialized or privately-operated charging stations are expected to play a key role as a technology enabler. In this paper, we study the problem of charging electric vehicles at stations with limited charging machines and power resources. The purpose of this study is to develop a novel profit maximization framework for station operation in both offline and online charging scenarios, under certain customer satisfaction constraints. The main goal is to maximize the profit obtained by the station owner and provide a satisfactory charging service to the customers. The framework includes not only the vehicle scheduling and charging power control, but also the managing of user satisfaction factors, which are defined as the percentages of finished charging targets. The profit maximization problem is proved to be NPcomplete in both scenarios (NP refers to “nondeterministic polynomial time”, for which two-stage charging strategies are proposed to obtain efficient suboptimal solutions. Competitive analysis is also provided to analyze the performance of the proposed online two-stage charging algorithm against the offline counterpart under non-congested and congested charging scenarios. Finally, the simulation results show that the proposed two-stage charging strategies achieve performance close to that with exhaustive search. Also, the proposed algorithms provide remarkable performance gains compared to the other conventional charging strategies with respect to not only the unified profit, but also other practical interests, such as the computational time, the user satisfaction factor, the power consumption, and the competitive ratio.
Minimal length, maximal momentum and thermodynamics of black body radiation
Shababi, Homa
2013-01-01
In this paper we study thermodynamics of black body radiation in the presence of quantum gravitational effects through a Generalized Uncertainty Principle that admits both a minimal measurable length and a maximal momentum. We focus on quantum gravity induced modifications of thermodynamical quantities in this framework. Some important issues such as the generalized Planck distribution, Wien s law and Dulong Petit law are studied in this setup with details.
Oncoplastic Breast Reduction: Maximizing Aesthetics and Surgical Margins
Michelle Milee Chang
2012-01-01
Full Text Available Oncoplastic breast reduction combines oncologically sound concepts of cancer removal with aesthetically maximized approaches for breast reduction. Numerous incision patterns and types of pedicles can be used for purposes of oncoplastic reduction, each tailored for size and location of tumor. A team approach between reconstructive and breast surgeons produces positive long-term oncologic results as well as satisfactory cosmetic and functional outcomes, rendering oncoplastic breast reduction a favorable treatment option for certain patients with breast cancer.
Maximal Subsemigroups of Finite Transformation Semigroups K(n, r)
Hao Bo YANG; Xiu Liang YANG
2004-01-01
Let Tn be the full transformation semigroup on the n-element set Xn. For an arbitrary integer r such that 2 ≤ r ≤ n - 1, we completely describe the maximal subsemigroups of the semigroup K(n, r) = {α∈ Tn: |im α| ≤ r}. We also formulate the cardinal number of such subsemigroups which is an answer to Problem 46 of Tetrad in 1969, concerning the number of subsemigroups of Tn.
LOAD THAT MAXIMIZES POWER OUTPUT IN COUNTERMOVEMENT JUMP
Pedro Jimenez-Reyes
2016-02-01
Full Text Available ABSTRACT Introduction: One of the main problems faced by strength and conditioning coaches is the issue of how to objectively quantify and monitor the actual training load undertaken by athletes in order to maximize performance. It is well known that performance of explosive sports activities is largely determined by mechanical power. Objective: This study analysed the height at which maximal power output is generated and the corresponding load with which is achieved in a group of male-trained track and field athletes in the test of countermovement jump (CMJ with extra loads (CMJEL. Methods: Fifty national level male athletes in sprinting and jumping performed a CMJ test with increasing loads up to a height of 16 cm. The relative load that maximized the mechanical power output (Pmax was determined using a force platform and lineal encoder synchronization and estimating the power by peak power, average power and flight time in CMJ. Results: The load at which the power output no longer existed was at a height of 19.9 ± 2.35, referring to a 99.1 ± 1% of the maximum power output. The load that maximizes power output in all cases has been the load with which an athlete jump a height of approximately 20 cm. Conclusion: These results highlight the importance of considering the height achieved in CMJ with extra load instead of power because maximum power is always attained with the same height. We advise for the preferential use of the height achieved in CMJEL test, since it seems to be a valid indicative of an individual's actual neuromuscular potential providing a valid information for coaches and trainers when assessing the performance status of our athletes and to quantify and monitor training loads, measuring only the height of the jump in the exercise of CMJEL.
Cereal Crop Farm Planning for Profit Maximization in Afghanistan
Ahmadzai, Najeebullah; Nanseki, Teruaki; Chomei, Yosuke
2016-01-01
Cereal crops are the major component of agriculture sector in Afghanistan by generating income and providing food dietary of subsistence to the farm family. The sector which is dominated by small scale farmer across the country is facing numerous problems such as inefficient use of resources, poor production technology, low labor productivity and high production costs. This study was carried out to maximize farm income by optimization resource allocation and developing an optimal farm plan fo...
Maximizing Immune Response to Carbohydrate Antigens on Breast Tumors
2005-08-01
Emmons, Ph.D. CONTRACTING ORGANIZATION: University of Arkansas for Medical Sciences Little Rock, Arkansas 72205 REPORT DATE: August 2005 TYPE OF REPORT...SUBTITLE 5a. CONTRACT NUMBER Maximizing Immune Response to Carbohydrate Antigens on Breast Tumors 5b. GRANT NUMBER DAMD17-01-1-0366 5c. PROGRAM...binding affinities of peptide and carbohyd- Hollingsworth, M. A. 1997. Oligosaccharides expressed on MUCl rate with I-A’ will be illuminating. However
Muscle mitochondrial capacity exceeds maximal oxygen delivery in humans
Boushel, Robert Christopher; Gnaiger, Erich; Calbet, Jose A L
2011-01-01
Across a wide range of species and body mass a close matching exists between maximal conductive oxygen delivery and mitochondrial respiratory rate. In this study we investigated in humans how closely in-vivo maximal oxygen consumption (VO(2) max) is matched to state 3 muscle mitochondrial...... respiration. High resolution respirometry was used to quantify mitochondrial respiration from the biopsies of arm and leg muscles while in-vivo arm and leg VO(2) were determined by the Fick method during leg cycling and arm cranking. We hypothesized that muscle mitochondrial respiratory rate exceeds...... that of systemic oxygen delivery. The state 3 mitochondrial respiration of the deltoid muscle (4.3±0.4 mmol o(2)kg(-1) min(-1)) was similar to the in-vivo VO(2) during maximal arm cranking (4.7±0.5 mmol O(2) kg(-1) min(-1)) with 6 kg muscle. In contrast, the mitochondrial state 3 of the quadriceps was 6.9±0.5 mmol...
Computing a Clique Tree with the Algorithm Maximal Label Search
Anne Berry
2017-01-01
Full Text Available The algorithm MLS (Maximal Label Search is a graph search algorithm that generalizes the algorithms Maximum Cardinality Search (MCS, Lexicographic Breadth-First Search (LexBFS, Lexicographic Depth-First Search (LexDFS and Maximal Neighborhood Search (MNS. On a chordal graph, MLS computes a PEO (perfect elimination ordering of the graph. We show how the algorithm MLS can be modified to compute a PMO (perfect moplex ordering, as well as a clique tree and the minimal separators of a chordal graph. We give a necessary and sufficient condition on the labeling structure of MLS for the beginning of a new clique in the clique tree to be detected by a condition on labels. MLS is also used to compute a clique tree of the complement graph, and new cliques in the complement graph can be detected by a condition on labels for any labeling structure. We provide a linear time algorithm computing a PMO and the corresponding generators of the maximal cliques and minimal separators of the complement graph. On a non-chordal graph, the algorithm MLSM, a graph search algorithm computing an MEO and a minimal triangulation of the graph, is used to compute an atom tree of the clique minimal separator decomposition of any graph.
Cut-off Grade Optimization for Maximizing the Output Rate
A. Khodayari
2012-12-01
Full Text Available In the open-pit mining, one of the first decisions that must be made in production planning stage, after completing the design of final pit limits, is determining of the processing plant cut-off grade. Since this grade has an essential effect on operations, choosing the optimum cut-off grade is of considerable importance. Different goals may be used for determining optimum cut-off grade. One of these goals may be maximizing the output rate (amount of product per year, which is very important, especially from marketing and market share points of view. Objective of this research is determining the optimum cut-off grade of processing plant in order to maximize output rate. For performing this optimization, an Operations Research (OR model has been developed. The object function of this model is output rate that must be maximized. This model has two operational constraints namely mining and processing restrictions. For solving the model a heuristic method has been developed. Results of research show that the optimum cut-off grade for satisfying pre-stated goal is the balancing grade of mining and processing operations, and maximum production rate is a function of the maximum capacity of processing plant and average grade of ore that according to the above optimum cut-off grade must be sent to the plant.
The Parallel Maximal Cliques Algorithm for Protein Sequence Clustering
Khalid Jaber
2009-01-01
Full Text Available Problem statement: Protein sequence clustering is a method used to discover relations between proteins. This method groups the proteins based on their common features. It is a core process in protein sequence classification. Graph theory has been used in protein sequence clustering as a means of partitioning the data into groups, where each group constitutes a cluster. Mohseni-Zadeh introduced a maximal cliques algorithm for protein clustering. Approach: In this study we adapted the maximal cliques algorithm of Mohseni-Zadeh to find cliques in protein sequences and we then parallelized the algorithm to improve computation times and allowed large protein databases to be processed. We used the N-Gram Hirschberg approach proposed by Abdul Rashid to calculate the distance between protein sequences. The task farming parallel program model was used to parallelize the enhanced cliques algorithm. Results: Our parallel maximal cliques algorithm was implemented on the stealth cluster using the C programming language and a hybrid approach that includes both the Message Passing Interface (MPI library and POSIX threads (PThread to accelerate protein sequence clustering. Conclusion: Our results showed a good speedup over sequential algorithms for cliques in protein sequences.
Budget Allocation for Maximizing Viral Advertising in Social Networks
Bo-Lei Zhang; Zhu-Zhong Qian; Wen-Zhong Li; Bin Tang; Xiaoming Fu
2016-01-01
Viral advertising in social networks has arisen as one of the most promising ways to increase brand awareness and product sales. By distributing a limited budget, we can incentivize a set of users as initial adopters so that the advertising can start from the initial adopters and spread via social links to become viral. Despite extensive researches in how to target the most influential users, a key issue is often neglected: how to incentivize the initial adopters. In the problem of influence maximization, the assumption is that each user has a fixed cost for being initial adopters, while in practice, user decisions for accepting the budget to be initial adopters are often probabilistic rather than deterministic. In this paper, we study optimal budget allocation in social networks to maximize the spread of viral advertising. In particular, a concave probability model is introduced to characterize each user’s utility for being an initial adopter. Under this model, we show that it is NP-hard to find an optimal budget allocation for maximizing the spread of viral advertising. We then present a novel discrete greedy algorithm with near optimal performance, and further propose scaling-up techniques to improve the time-eﬃciency of our algorithm. Extensive experiments on real-world social graphs are implemented to validate the effectiveness of our algorithm in practice. The results show that our algorithm can outperform other intuitive heuristics significantly in almost all cases.
Reference values of maximal oxygen uptake for polish rowers.
Klusiewicz, Andrzej; Starczewski, Michał; Ładyga, Maria; Długołęcka, Barbara; Braksator, Wojciech; Mamcarz, Artur; Sitkowski, Dariusz
2014-12-09
The aim of this study was to characterize changes in maximal oxygen uptake over several years and to elaborate current reference values of this index based on determinations carried out in large and representative groups of top Polish rowers. For this study 81 female and 159 male rowers from the sub-junior to senior categories were recruited from the Polish National Team and its direct backup. All the subjects performed an incremental exercise test on a rowing ergometer. During the test maximal oxygen uptake was measured with the BxB method. The calculated reference values for elite Polish junior and U23 rowers allowed to evaluate the athletes' fitness level against the respective reference group and may aid the coach in controlling the training process. Mean values of VO2max achieved by members of the top Polish rowing crews who over the last five years competed in the Olympic Games or World Championships were also presented. The results of the research on the "trainability" of the maximal oxygen uptake may lead to a conclusion that the growth rate of the index is larger in case of high-level athletes and that the index (in absolute values) increases significantly between the age of 19-22 years (U23 category).
Polarity related influence maximization in signed social networks.
Dong Li
Full Text Available Influence maximization in social networks has been widely studied motivated by applications like spread of ideas or innovations in a network and viral marketing of products. Current studies focus almost exclusively on unsigned social networks containing only positive relationships (e.g. friend or trust between users. Influence maximization in signed social networks containing both positive relationships and negative relationships (e.g. foe or distrust between users is still a challenging problem that has not been studied. Thus, in this paper, we propose the polarity-related influence maximization (PRIM problem which aims to find the seed node set with maximum positive influence or maximum negative influence in signed social networks. To address the PRIM problem, we first extend the standard Independent Cascade (IC model to the signed social networks and propose a Polarity-related Independent Cascade (named IC-P diffusion model. We prove that the influence function of the PRIM problem under the IC-P model is monotonic and submodular Thus, a greedy algorithm can be used to achieve an approximation ratio of 1-1/e for solving the PRIM problem in signed social networks. Experimental results on two signed social network datasets, Epinions and Slashdot, validate that our approximation algorithm for solving the PRIM problem outperforms state-of-the-art methods.
Maximal mixing as a `sum' of small mixings
Chakrabortty, Joydeep; Mehta, Poonam; Vempati, Sudhir K
2009-01-01
In models with two sources of neutrino masses, we look at the possibility of generating maximal/large mixing angles in the total mass matrix, where both the sources have only small mixing angles. We show that in the two generation case, maximal mixing can naturally arise only when the total neutrino mass matrix has a quasi-degenerate pattern. The best way to demonstrate this is by decomposing the quasi-degenerate spectrum in to hierarchial and inverse-hierarchial mass matrices, both with small mixing. Such a decomposition of the quasi-degenerate spectra is in fact very general and can be done irrespective of the mixing present in the mass matrices. With three generations, and two sources, we show that only one or all the three small mixing angles in the total neutrino mass matrix can be converted to maximal/large mixing angles. The decomposition of the degenerate pattern in this case is best realised in to sub-matrices whose dominant eigenvalues have an alternating pattern. On the other hand, it is possible t...
Polarity related influence maximization in signed social networks.
Li, Dong; Xu, Zhi-Ming; Chakraborty, Nilanjan; Gupta, Anika; Sycara, Katia; Li, Sheng
2014-01-01
Influence maximization in social networks has been widely studied motivated by applications like spread of ideas or innovations in a network and viral marketing of products. Current studies focus almost exclusively on unsigned social networks containing only positive relationships (e.g. friend or trust) between users. Influence maximization in signed social networks containing both positive relationships and negative relationships (e.g. foe or distrust) between users is still a challenging problem that has not been studied. Thus, in this paper, we propose the polarity-related influence maximization (PRIM) problem which aims to find the seed node set with maximum positive influence or maximum negative influence in signed social networks. To address the PRIM problem, we first extend the standard Independent Cascade (IC) model to the signed social networks and propose a Polarity-related Independent Cascade (named IC-P) diffusion model. We prove that the influence function of the PRIM problem under the IC-P model is monotonic and submodular Thus, a greedy algorithm can be used to achieve an approximation ratio of 1-1/e for solving the PRIM problem in signed social networks. Experimental results on two signed social network datasets, Epinions and Slashdot, validate that our approximation algorithm for solving the PRIM problem outperforms state-of-the-art methods.
An inverse-source problem for maximization of pore-fluid oscillation within poroelastic formations
Jeong, C.
2016-07-04
This paper discusses a mathematical and numerical modeling approach for identification of an unknown optimal loading time signal of a wave source, atop the ground surface, that can maximize the relative wave motion of a single-phase pore fluid within fluid-saturated porous permeable (poroelastic) rock formations, surrounded by non-permeable semi-infinite elastic solid rock formations, in a one-dimensional setting. The motivation stems from a set of field observations, following seismic events and vibrational tests, suggesting that shaking an oil reservoir is likely to improve oil production rates. This maximization problem is cast into an inverse-source problem, seeking an optimal loading signal that minimizes an objective functional – the reciprocal of kinetic energy in terms of relative pore-fluid wave motion within target poroelastic layers. We use the finite element method to obtain the solution of the governing wave physics of a multi-layered system, where the wave equations for the target poroelastic layers and the elastic wave equation for the surrounding non-permeable layers are coupled with each other. We use a partial-differential-equation-constrained-optimization framework (a state-adjoint-control problem approach) to tackle the minimization problem. The numerical results show that the numerical optimizer recovers optimal loading signals, whose dominant frequencies correspond to amplification frequencies, which can also be obtained by a frequency sweep, leading to larger amplitudes of relative pore-fluid wave motion within the target hydrocarbon formation than other signals.
Polyakov, Felix
2017-02-01
Neuroscientific studies of drawing-like movements usually analyze neural representation of either geometric (e.g., direction, shape) or temporal (e.g., speed) parameters of trajectories rather than trajectory's representation as a whole. This work is about identifying geometric building blocks of movements by unifying different empirically supported mathematical descriptions that characterize relationship between geometric and temporal aspects of biological motion. Movement primitives supposedly facilitate the efficiency of movements' representation in the brain and comply with such criteria for biological movements as kinematic smoothness and geometric constraint. The minimum-jerk model formalizes criterion for trajectories' maximal smoothness of order 3. I derive a class of differential equations obeyed by movement paths whose nth-order maximally smooth trajectories accumulate path measurement with constant rate. Constant rate of accumulating equi-affine arc complies with the 2/3 power-law model. Candidate primitive shapes identified as equations' solutions for arcs in different geometries in plane and in space are presented. Connection between geometric invariance, motion smoothness, compositionality and performance of the compromised motor control system is proposed within single invariance-smoothness framework. The derived class of differential equations is a novel tool for discovering candidates for geometric movement primitives.
Nurse Scheduling System based on Dynamic Weighted Maximal Constraint Satisfaction Problem
Hattori, Hiromitsu; Isomura, Atsushi; Ito, Takayuki; Ozono, Tadachika; Shintani, Toramatsu
Scheduling has been an important research field in Artificial Intelligence. Because typical scheduling problems could be modeled as a Constraint Satisfaction Problem(CSP), several constraint satisfaction techniques have been proposed. In order to handle the different levels of importance of the constraints, solving a problem as a Weighted Maximal Constraint Satisfaction Problem(W-MaxCSP) is an promising approach. However, there exists the case where unexpected events are added and some sudden changes are required, i.e., the case with dynamic changes in scheduling problems. In this paper, we describe such dynamic scheduling problem as a Dynamic Weighted Maximal Constraint Satisfaction Problem(DW-MaxCSP) in which constraints would changes dynamically. Generally, it is undesirable to determine vastly modified schedule even if re-scheduling is needed. A new schedule should be close to the current one as much as possible. In order to obtain stable solutions, we propose the methodology to maintain portions of the current schedule using the provisional soft constraints, which explicitly penalize the changes from the current schedule. We have experimentally confirmed the efficacy of re-scheduling based on our method with provisional constraints. In this paper, we construct the nurse scheduling system for applying the proposed scheduling method.
Grognard, Frédéric; Bernard, Olivier
2012-01-01
We address the question of optimization of the microalgal biomass long term productivity in the framework of production in photobioreactors under the influence of day/night cycles. For that, we propose a simple bioreactor model accounting for light attenuation in the reactor due to biomass density and obtain the control law that optimizes productivity over a single day through the application of Pontryagin's maximum principle, with the dilution rate being the main control. An important constraint on the obtained solution is that the biomass in the reactor should be at the same level at the beginning and at the end of the day so that the same control can be applied everyday and optimizes some form of long term productivity. Several scenarios are possible depending on the microalgae's strain parameters and the maximal admissible value of the dilution rate: bang-bang or bang-singular-bang control or, if the growth rate of the algae is very strong in the presence of light, constant maximal dilution. A bifurcation...
Insight into the ten-penny problem: guiding search by constraints and maximization.
Öllinger, Michael; Fedor, Anna; Brodt, Svenja; Szathmáry, Eörs
2017-09-01
For a long time, insight problem solving has been either understood as nothing special or as a particular class of problem solving. The first view implicates the necessity to find efficient heuristics that restrict the search space, the second, the necessity to overcome self-imposed constraints. Recently, promising hybrid cognitive models attempt to merge both approaches. In this vein, we were interested in the interplay of constraints and heuristic search, when problem solvers were asked to solve a difficult multi-step problem, the ten-penny problem. In three experimental groups and one control group (N = 4 × 30) we aimed at revealing, what constraints drive problem difficulty in this problem, and how relaxing constraints, and providing an efficient search criterion facilitates the solution. We also investigated how the search behavior of successful problem solvers and non-solvers differ. We found that relaxing constraints was necessary but not sufficient to solve the problem. Without efficient heuristics that facilitate the restriction of the search space, and testing the progress of the problem solving process, the relaxation of constraints was not effective. Relaxing constraints and applying the search criterion are both necessary to effectively increase solution rates. We also found that successful solvers showed promising moves earlier and had a higher maximization and variation rate across solution attempts. We propose that this finding sheds light on how different strategies contribute to solving difficult problems. Finally, we speculate about the implications of our findings for insight problem solving.