Variability of neutron rich isotopes in meteorites can yield information about early solar system processes, and the nucleosynthetic sources the accreted to form the solar system. Excesses of neutron rich nuclides in bulk meteorite analyses of iron peak elements were initially reported for Ti [1; 2] and later augmented by similar observations for Cr [3]. This early work has been supported by se...

Proof. We apply Lemma 3.1 of (Jayram & Woodruff, 2013) with parameters α = 2, p = 1, b = 1, ε = δ, and δ = . This encodes inputs from a problem they prove is hard (augmented indexing on large domains) to inputs appropriate for Hamming estimation. In particular, for n′ = O( 1 δ2 log(1/ )) it gives a distribution on (a, b) ∈ {0, 1} n′ × {0, 1}n that are divided into “NO” and “YES” instances, such...

in this research, efficiency of iranian forest and rangeland decision making unit was assessed using non-parametric method. inputs and outputs determined by field research and with applying a delphi method the final input and output variables selected. forty five wood-producing units (forestry plans) in three northern iranian province were studied using data envelopment analysis. the efficiency...

Abstract. Augmented Lagrangian method (ALM) has been popularly used for solving constrained optimization problems. Its convergence and local convergence speed have been extensively studied. However, its global convergence rate is still open for problems with nonlinear inequality constraints. In this paper, we work on general constrained convex programs. For these problems, we establish the glob...

Recently a novel reinforcement learning algorithm called event-learning or E-learning was introduced. The algorithm based on events, which are defined as ordered pairs of states. In this setting, the agent optimizes the selection of desired sub-goals by a traditional value-policy function iteration, and utilizes a separated algorithm called the controller to achieve these goals. The advantage o...

Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between any pair of nodes in a graph, with only a partial knowledge of distances. Following this seminal work, a major challenge was to extend this model to larger classes of graphs than regular meshes, introducing the concept...

The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair (H,φ), where H is a graph in which inter-node distances are supposed to be easy to compute or at least easy to estimate. This graph is ”augmented” by links, called long range links, which are selected according to the...