We study the sub-Riemannian structure determined by a left-invariant distribution of rank n on a step-2 simply-connected nilpotent Lie group G of dimension n(n+1)/2. We describe a transitive group action that leaves invariant ...

Abstract¿Providing up-to-date input to users' applications is an important data management problem for a distributed computing environment, where each data storage location and intermediate node may have specific data available, storage limitations, ...

The design of appropriate moving target search (MTS) algorithms for computer-generated bots poses serious challenges as they have to satisfy stringent requirements that include computation and execution efficiency. In this paper, we investigate the performance ...

The magnetic dynamics around two square AntiHelmholtz coils and special configuration of electrical circuits is used in order to create the simplest magnetic traps. Section 1 gives the Biot-Savart-Laplace magnetic field H around two square AntiHelmholtz ...

In this paper, we discuss the problem of computing the reachable workspace for redundant manipulators. Algorithms that compute workspace boundary points by using screw theory are presented. These algorithms cannot distinguish holes and voids that are ...

As new Internet technologies emerge, the ability to do full regular expression pattern matching on network packets to support these new technologies is becoming increasingly important. Current technologies that can benefit from high-speed pattern matching ...

This thesis develops a new scalable modeling framework at the interface of game theory and machine learning to recover economic structures from limited slices of data. Inference using economic models has broad applicability in machine learning. Economic ...

The first crucial step of product recovery is disassembly. Some product disassembly is almost always needed in remanufacturing, recycling, and disposal. Since disassembly tends to be expensive, disassembly sequence planning becomes important in minimizing ...

Summary: Recent developments in high-throughput sequencing technologies have generated considerable demand for tools to analyse large datasets of small RNA sequences. Here, we describe a suite of web-based tools for processing plant small RNA ...

This paper presents an analysis of the control overhead involved in clustering and routing for one-hop clustered mobile ad hoc networks. Previous work on the analysis of control overhead incurred by clustering algorithms focused mainly on the derivation ...

We prove by elementary combinatorial methods that the number of factorizations of an n-cycle (with n odd) into the product of two n-cycles is 2(n - 1)!/(n + 1). Moreover, we generalize our method to the factorization ...

Query optimization for relational database systems is a combinatorial optimization problem, which makes exhaustive search unacceptable as the query size grows. Randomized algorithms, such as Simulated Annealing (SA) and Iterative Improvement (II), are ...

In this paper, an adaptive Linear Quadratic Regulator (LQR) with Repetitive (RP) control is applied to Uninterruptible Power Supply (UPS) systems. The RP controller with forgetting parameters is used to attenuate the effects of periodic disturbances. ...

Similarity search is a crucial task in multimedia retrieval and data mining. Most existing work has modelled this problem as the nearest neighbor (NN) problem, which considers the distance between the query object and the data objects over a fixed set ...