Results 1  10
of
23
Mn Kedge XANES studies of La1−xAxMnO3 systems (A = Ca,
, 2000
"... We present Mn Kedge XANES data for a number of manganite systems as a function of temperature. The main edge (1s4p transition) for the Ca substituted samples is very sharp, almost featureless, and shifts uniformly upwards with increasing Ca content. The interpretation of this result is controversi ..."
Abstract
 Add to MetaCart
We present Mn Kedge XANES data for a number of manganite systems as a function of temperature. The main edge (1s4p transition) for the Ca substituted samples is very sharp, almost featureless, and shifts uniformly upwards with increasing Ca content. The interpretation of this result
Outline Convex Optimization RealTime Embedded Optimization LargeScale Distributed Optimization Summary Convex Optimization 3
, 2014
"... minimize f0(x) subject to fi (x) ≤ 0, i = 1,...,m Ax = b ◮ variable x ∈ Rn ◮ f0,..., fm are convex: for θ ∈ [0, 1], fi (θx + (1 − θ)y) ≤ θfi (x) + (1 − θ)fi (y) i.e., fi have nonnegative (upward) curvature Convex Optimization 4 Convex optimization — Cone form minimize cT x subject to x ∈ K Ax = b ..."
Abstract
 Add to MetaCart
minimize f0(x) subject to fi (x) ≤ 0, i = 1,...,m Ax = b ◮ variable x ∈ Rn ◮ f0,..., fm are convex: for θ ∈ [0, 1], fi (θx + (1 − θ)y) ≤ θfi (x) + (1 − θ)fi (y) i.e., fi have nonnegative (upward) curvature Convex Optimization 4 Convex optimization — Cone form minimize cT x subject to x ∈ K Ax = b
Up/downward preference aggregation
, 2007
"... The existence of a dictator for the aggregation of strict preferences over a given set A of m alternatives is shown when simpler versions of the following downward and upward procedures are simultaneously used and forced to deliver a social welfare function. Choice functions d1, … , dm, u1, … , um ..."
Abstract
 Add to MetaCart
is the value that d2 associates with the profile of the topranked alternatives in P restricted to A\{x1}. The third alternative in p is the value that d3 associates with the profile of the topranked alternatives in P restricted to A\{x1, x2}. And so on until the m positions are filled. The upward procedure
Onesided Outflows/Jets from Rotating Stars with Complex Magnetic Fields
, 2010
"... We investigate the generation of intrinsically asymmetric or onesided outflows or jets from disk accretion onto rotating stars with complex magnetic fields using axisymmetric (2.5D) magnetohydrodynamic simulations. The intrinsic magnetic field of the star is assumed to consist of a superposition o ..."
Abstract
 Add to MetaCart
We investigate the generation of intrinsically asymmetric or onesided outflows or jets from disk accretion onto rotating stars with complex magnetic fields using axisymmetric (2.5D) magnetohydrodynamic simulations. The intrinsic magnetic field of the star is assumed to consist of a superposition
Recent Advances in Convex Optimization
"... • Convex optimization modeling tools • Largescale convex optimization • Realtime convex optimization UW, 4/5/08 1Optimization opitmization problem with variable x ∈ R n: minimize f0(x) subject to fi(x) ≤ 0, hi(x) = 0, i = 1,..., m i = 1,..., p • our ability to solve varies widely; depends on pro ..."
Abstract
 Add to MetaCart
= b i = 1,..., m • objective and inequality constraint functions fi are convex: for all x, y, θ ∈ [0,1], fi(θx + (1 − θ)y) ≤ θfi(x) + (1 − θ)fi(y) roughly speaking, graphs of fi curve upward • equality constraint functions are affine, so can be written as Ax = b UW, 4/5/08 3Convex optimization • a
190 NIL · A
, 1979
"... Lisp"). It is intended to be a modernization of the programming language LISP suitable in design for implementation on any of the current generation of largeaddressspace, lowcost computers; and maximally upwardcompatible with MACLlSP, the dialect of LISP developed at the M.I.T Laboratory fo ..."
Abstract
 Add to MetaCart
Lisp"). It is intended to be a modernization of the programming language LISP suitable in design for implementation on any of the current generation of largeaddressspace, lowcost computers; and maximally upwardcompatible with MACLlSP, the dialect of LISP developed at the M.I.T Laboratory
Feasible interpolation as games
, 2012
"... This note is a transcript of a lecture given in Prague on December 1st, 2012. Kraj́ıček [4] and Bonet, Pitassi and Raz [2] have independently described a construction of a monotone boolean circuit out of a refutation proving that two NPsets are disjoint. Also known as monotone feasible interpolati ..."
Abstract
 Add to MetaCart
disjoint NP sets A(x, y) and B(x, z), where furthermore the set A is upwardsclosed and the set B is downwardsclosed. For example, x may code the vertices of a graph, y may code a kclique, and z may code a k − 1coloring of the vertices of the graph. The formula A(x, y) states that y represents a clique
Advanced Cordless Telecommunication Services
 IEEE Journal on Selected Areas in Communications
, 1987
"... 5dB greater. (These results have been confirmed by tests in another multistorey building with metal partitioning.) An antenna's effective aperture is related to the inverse of the frequency squared3 and so at l m it would be expected that the path loss, which includes the antenna performance, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
to cover an ofice building. Alternatively, transmitter powers could be raised to compensate for this, but this may then greatly increase the size of the personal terminal, or require more frequent recharging of batteries. The move upwards in frequency will therefore impact system costs, unless technology
Domain specific languages for Convex Optimization
, 2013
"... Convex optimization problem — standard form minimize f0(x) subject to fi(x) ≤ 0, i = 1,...,m Ax = b with variable x ∈ Rn I objective and inequality constraints f0,..., fm are convex for all x, y, θ ∈ [0, 1], fi(θx + (1 − θ)y) ≤ θfi(x) + (1 − θ)fi(y) i.e., graphs of fi curve upward I equality const ..."
Abstract
 Add to MetaCart
Convex optimization problem — standard form minimize f0(x) subject to fi(x) ≤ 0, i = 1,...,m Ax = b with variable x ∈ Rn I objective and inequality constraints f0,..., fm are convex for all x, y, θ ∈ [0, 1], fi(θx + (1 − θ)y) ≤ θfi(x) + (1 − θ)fi(y) i.e., graphs of fi curve upward I equality
CORRECTING FOR PRECIPITATION EFFECTS IN SATELLITEBASED PASSIVE MICROWAVE TROPICAL CYCLONE INTENSITY ESTIMATES
, 2005
"... Public reporting burden for this collection of Information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments ..."
Abstract
 Add to MetaCart
Public reporting burden for this collection of Information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this
Results 1  10
of
23