In the recent work of Nakariakov et al. (2004), it has been shown that the time dependences of density and velocity in a flaring loop contain pronounced quasi-harmonic oscillations associated with the 2nd harmonic of a standing slow magnetoacoustic wave. That model used a symmetric heating function (heat deposition was strictly at the apex). This left outstanding questions: A) is the generation...

The nutritional impact of the recession and the SCN The subject of this note is the impact of high food prices and the global financial crisis on the hunger and malnutrition targets of the MDG1, as well as their likely repercussions with regard to other MDGs, especially MDG4 and 5, and actions needed to mitigate these effects. As the policy harmonization body for nutrition of the UN, the SCN is...

Global Optimization and Mixed-Integer Nonlinear Programming problems such as min{f(x) | g ≤ g(x) ≤ g ∧ x ≤ x ≤ x ∧ ∀j ∈ Z (xj ∈ Z)}, where f : R → R, g : R → R, g, g ∈ R, x, x, x ∈ R and Z ⊆ {1, . . . , n}, ⋆ Financial support by grants System@tic “EDONA”, ANR 07-JCJC-0151 “Ars”, ANR 08-SEGI-023 “Asopt”, Digiteo Emergence “Paso” is gratefully acknowledged. ∗ Corresponding author. Email addresse...

Let G = GLN or SLN as reductive linear algebraic group over a field k of characteristic p > 0. We prove several results that were previously established only when N ≤ 5 or p > 2 : Let G act rationally on a finitely generated commutative k-algebra A and let grA be the Grosshans graded ring. We show that the cohomology algebra H(G, grA) is finitely generated over k. If moreover A has a good filtr...

A dominating set S of graph G is called metric-locating-dominating if it is also locating, that is, if every vertex v is uniquely determined by its vector of distances to the vertices in S . If moreover, every vertex v not in S is also uniquely determined by the set of neighbors of v belonging to S , then it is said to be locating-dominating. Locating, metric-locating-dominating and locatingdom...

Abstract Global Navigation Satellite System carrier phase ambiguity resolution is the key to high precision positioning and navigation. In this contribution a brief review is given of the probabilistic theory of integer carrier phase ambiguity estimation. Various ambiguity estimators are discussed. Among them are the estimators of integer rounding, integer bootstrapping, integer least-squares a...

Successful integer estimation of carrier phase ambiguities of Global Navigation Satellite Systems (GNSS) is the key to many high precision positioning applications. In order to describe the quality of the positioning results rigorously, one needs to know the probabilistic properties of both the integer and noninteger parameters in the GNSS model. In this contribution these probability distribut...

Geometric branch-and-bound techniques are well-known solution algorithms for non-convex global optimization problems. Several approaches can be found in the literature differing mainly in the bounds used. The aim of this paper is to extend geometric branch-and-bound methods to mixed integer optimization problems, i.e. to objective functions with some continuous and some integer variables. We de...

Making a new market is a challenge. It requires creation of a new form of value and sustainable capture of a fair market share for the new-market makers. The author’s mission is to initiate the creation of the Mobile Process Service (MPS) market in the Northern Dimension (ND) that consists of Canada, Nordic/Baltics and North-West Russia – hence NDMPS. Mission, Segmentation, Differentiation and ...

Carrier phase ambiguity resolution is the key to fast and high precision GPS positioning. Critical in the application of ambiguity resolution is the quality of the computed integer ambiguities. Unsuccessful ambiguity resolution, when passed unnoticed, will too often lead to unacceptable errors in the positioning results. The success or failure of carrier phase ambiguity resolution can be predic...