Augmented Reality (AR) is the evolution of the concept of Virtual Reality (VR). Its goal is to enhance a person's perception of the surrounding world. AR is a fast growing state of the art technology and a variety of implementation tools thereof exist today. Due to the heterogeneity of available technologies, the choice of the appropriate framework for a mobile application is difficult to make....

Until recently, it was not known whether it was possible to sort stably (i.e., keeping equal elements in their initial order) an array of n elements using only O(n) data moves and O(1) extra space. In [13] an algorithm was given to perform this task in O(n2) comparisons in the worst case. Here, we develop a new algorithm for the problem that performs only O(n1+ε) comparisons (0 < ε ≤ 1 is any f...

When designing controllers with robust performance and stabilization requirements, H-infinity synthesis is a common tool to use. These controllers are often obtained by solving mathematical optimization problems. The controllers that result from these algorithms are typically of very high order, which complicates implementation. Low order controllers are usually desired, since they are consider...

As there are many methods designed for augmented reality, it is still hard to really bring augmented reality application to the real life due to the performance constraint of mobile devices. In this project, I tried to implement certain promising algorithms and explore the possibilities of rich augmented reality application. ESM algorithm is chosen for tracking the clue of the scene together wi...

Effective constrained optimization algorithms have been proposed for engineering problems recently. It is common to consider constraint violation and algorithm as two separate parts. In this study, a pbest selection mechanism integrate the current mutation strategy in problems. Based on improved method, an adaptive differential evolution approach proposed, which helps population jump out of inf...

The use of semileptonic decays has become standard in constraining the unitarity triangle. Since precise calculations of these are very challenging, we propose an entirely new approach. The ε{K} constraint, which depends extremely sensitively on |V{cb}|, is replaced by the interplay between ε{K}, BR(B→τν), and ΔM{B{s}}. Improvements on the B→τν branching ratio and on the lattice determinations ...

This paper is aimed toward the definition of a new exact augmented Lagrangian function for two-sided inequality constrained problems. The distinguishing feature of this augmented Lagrangian function is that it employs only one multiplier for each two-sided constraint. We prove that stationary points, local minimizers and global minimizers of the exact augmented Lagrangian function correspond ex...

We investigate the problem of estimating a random variable Y ∈ Y under a privacy constraint dictated by another correlated random variable X ∈ X , where estimation efficiency and privacy are assessed in terms of two different loss functions. In the discrete case, we use the Hamming loss function and express the corresponding utility-privacy tradeoff in terms of the privacy-constrained guessing ...

Frictional contact is one of the most challenging problems in computational mechanics. Typically, it a tough nonlinear problem often requiring several Newton iterations to converge and causing troubles also solution related linear systems. When modeled with aid Lagrange multipliers, impenetrability condition enforced exactly, but associated Jacobian matrix indefinite needs special treatment for...

Data backup in data center networks (DCNs) is critical to minimize the data loss under disaster. This paper considers the cost-efficient data backup for DCNs against a disaster with ε early warning time. Given geo-distributed DCNs and such a ε-time early warning disaster, we investigate the issue of how to back up the data in DCN nodes under risk to other safe DCN nodes within the ε early warni...