Gleb Panteleev, International Arctic Research Center, University of Alaska, 930 Koyukuk Dr., P.O.Box 757340, Fairbanks, AK 99775, USA. ([email protected]) Max Yaremchuk, Naval Research Laboratory, Stennis Space Center, MS, USA. Philis J. Stabeno, Pacific Marine Environmental Laboratory, National Atmospheric and Oceanic Administration, USA. Vladimir Luchin, Far Eastern Branch of the Russian Acad...

A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k-d tree. The standard k-d tree uses a tentative backtracking search to identify nearest neighbors. In contrast, the Approximate k-d tree (Ak-d tree) applies a depthfirst nontentative search to the k-d tree structure. T...

We consider processing an n× d matrix A in a stream with row-wise updates according to a recent algorithm called Frequent Directions (Liberty, KDD 2013). This algorithm maintains an l× d matrix Q deterministically, processing each row in O(dl) time; the processing time can be decreased to O(dl) with a slight modification in the algorithm and a constant increase in space. Then for any unit vecto...

The bulk of ATP synthesis in plants is performed by ATP synthase, the main bioenergetics engine of cells, operating both in mitochondria and in chloroplasts. The reaction mechanism of ATP synthase has been studied in detail for over half a century; however, its optimal performance depends also on the steady delivery of ATP synthase substrates and the removal of its products. For mitochondrial A...

OBJECTIVES To report the burden and cost of actinic keratosis (AK) treatment in Australia and to forecast the number of AK treatments and the associated costs to 2020. DESIGN AND SETTING A retrospective study of data obtained from medicare Australia for AK treated by cryotherapy between 1 January 1994 and 31 December 2012, by year and by state or territory. RESULTS The total number of AK cr...

Given two n×n matrices A and A0 and a sequence of subspaces {0}=V0 ⊂ · · · ⊂ Vn = R n with dim(Vk) = k, the k-th subspace-projected approximated matrix Ak is defined as Ak = A + Πk(A0 − A)Πk , where Πk is the orthogonal projection on V ⊥ k . Consequently, Ak v = Av and v Ak = v ∗A for all v ∈ Vk. Thus (Ak) n k≥0 is a sequence of matrices that gradually changes from A0 into An = A. In principle,...

We first present a new security 2-AK protocol, which is more secure and more efficient than previously proposed ones. Meanwhile, we point that Xie’s ID-2-AK protocol modified from McCullagh-Barreto in CT-RSA 2005 doesn’t provide protection against KCI attack likewise, and finally utilize the modular arithmetic, first proposed in MQV and also used in Kim, to get a modified new ID-2-AK protocol. ...

Open Source Software (OSS) is increasingly used in ComponentBased Software Development (CBSD) of large software systems. An important issue in CBSD is selection of suitable components. Various OSS selection methods have been proposed, but most of them do not consider the software architecture aspects of OSS products. The Software Architecture (SA) research community refers to a product’s archit...

We introduce an algorithm aimed to reduce the dimensions of Hilbert space. It is used here in order to study the behaviour of low energy states of strongly interacting quantum many-body systems at first order transitions and avoided crossings. The method is tested on different frustrated quantum spin ladders with two legs. The role and importance of symmetries are investigated by using differen...