Non-manual cues in automatic sign language recognition

Present work deals with the incorporation of non-manual cues in automatic sign language recognition. More specifically, eye gaze, head pose, and facial expressions are discussed in relation to their grammatical and syntactic function and means of including them in the recognition phase are investigated. Computer vision issues related to extracting facial features, eye gaze, and head pose cues are presented and classification approaches for incorporating these non-manual cues into the overall Sign Language recognition architecture are introduced.     

Efficiently adapting graphical models for selectivity estimation

Query optimizers rely on statistical models that succinctly describe the underlying data. Models are used to derive cardinality estimates for intermediate relations, which in turn guide the optimizer to choose the best query execution plan. The quality of the resulting plan is highly dependent on the accuracy of the statistical model that represents the data. It is well known that small errors in the model estimates propagate exponentially through joins, and may result in the choice of a highly sub-optimal query execution plan. Most commercial query optimizers make the attribute value independence assumption: all attributes are assumed to be statistically independent. This reduces the statistical model of the data to a collection of one-dimensional synopses (typically in the form of histograms), and it permits the optimizer to estimate the selectivity of a predicate conjunction as the product of the selectivities of the constituent predicates. However, this independence assumption is more often than not wrong, and is considered to be the most common cause of sub-optimal query execution plans chosen by modern query optimizers. We take a step towards a principled and practical approach to performing cardinality estimation without making the independence assumption. By carefully using concepts from the field of graphical models, we are able to factor the joint probability distribution over all the attributes in the database into small, usually two-dimensional distributions, without a significant loss in estimation accuracy. We show how to efficiently construct such a graphical model from the database using only two-way join queries, and we show how to perform selectivity estimation in a highly efficient manner. We integrate our algorithms into the PostgreSQL DBMS. Experimental results indicate that estimation errors can be greatly reduced, leading to orders of magnitude more efficient query execution plans in many cases. Optimization time is kept in the range of tens of milliseconds, making this a practical approach for industrial-strength query optimizers.     

Switching networked attitude control of an unmanned quadrotor

In this article, a switching networked attitude controller for an unmanned quadrotor over a wireless sensor network is presented. To deal with the network induced time varying delays, the quadrotor is being modeled as a switching time varying linear system, while the applied switching output feedback control scheme, is calculated based on Linear Matrix Inequalities, and is able to guarantee the stability of the quadrotor under arbitrary changes in the time delays.     

On a class of optimal abstractions of finite-state machines

Anabstraction A of an fsmM consists in partitioning its states, inputs, and outputs into groups, thus turning it into a non-deterministic fsmM _A. For fixed sets of states, inputs, and outputs, and abstraction generally maps a number of machinesM defined on these sets into the sameM _A. We would like to find anoptimal abstractionA ^* which minimizes this number, while lumping the states, inputs, and outputs into a specified number of classes. We extend these ideas to an fsmM operating in a random environment, and show that the abstraction results in a probabilistic fsm . Thinking of changes inM's output map as resulting in machinesM≠MM, we want to find anA ^* that minimizes the number ofMM which are such that the transition probabilities of their abstracted version are identical to those of the specification machine . SuchMM arise from statistically-undetectable output faults inM. Abstractions are directly applicable to the monitoring of a complex system by an observer for deviations from correct behavior (faults). Complex systems are usually accessible through restricted interfaces, which do not allow the observer to distinguish among all states, inputs, and outputs, thus rendering some faulty transitions undetectable. An optimal interface design will minimize the number of such undetectable faults. Assuming that only single-transition output faults occur inM, we show that each of the classes into which the abstraction lumps the outputs contributes a number of undetectable output faults. We then show that the problem of partitioning the outputs into a given number of classes that minimizes the maximum of these numbers is NP-complete. However, we give (a) an approximate minimization algorithm, running in time linear in the number of classes and quadratic in the number ofM's outputs, and (b) a lower bound on the minimum, computable in the same amount of time. The concept of optimal abstractions is illustrated by numerical results on combinational logic circuits that perform arithmetical operations. The results shed light on the trade-off between model simplification and the ability to detect erroneous behaviors in complex systems.     

Distributed information service architecture for overlapping multiaccess networks

Multimedia delivery in mobile multiaccess network environments has emerged as a key area within the future Internet research domain. When network heterogeneity is coupled with the proliferation of multiaccess capabilities in mobile handheld devices, one can expect many new avenues for developing novel services and applications. New mechanisms for audio/video delivery over multiaccess networks will define the next generation of major distribution technologies, but will require significantly more information to operate according to their best potential. In this paper we present and evaluate a distributed information service, which can enhance media delivery over such multiaccess networks. We describe the proposed information service, which is built upon the new distributed control and management framework (DCMF) and the mobility management triggering functionality (TRG). We use a testbed which includes 3G/HSPA, WLAN and WiMAX network accesses to evaluate our proposed architecture and present results that demonstrate its value in enhancing video delivery and minimizing service disruption in an involved scenario.     

A new method preserving the positive definiteness of a second order tensor variable in flow simulations with application to viscoelastic turbulence

We present a new numerical method for the simulation of the flow of complex fluids with internal microstructure that is described by a second order, positive definite, internal structural parameter, so that its positive definiteness is preserved in the simulations. An example of such an internal structural parameter is the conformation tensor, used in the modeling of viscoelastic flows, which characterizes the flow-induced molecular deformation. Numerical methods that guarantee the preservation of the positive definiteness of the conformation tensor help both the physical interpretation of the results and the numerical stability of the simulations. The new method presented here is based on the log-conformation representation of a second order tensor. It is implemented through the application of the Cayley-Hamilton theorem for second order tensors. When necessary, we also use an additional mapping that ensures the boundness of the conformation tensor. This approach has been applied in Direct Numerical Simulations (DNS) of viscoelastic turbulent channel flow, which has received great attention since the mid 1990s with ultimate goal to understand the phenomenon of maximum drag reduction. The algorithm uses a full 3D spectral representation of the spatial dependence for the flow and conformation variables and a second order accurate backward differentiation formula for the integration of the governing equations in time. The key issue for the successful implementation of the proposed scheme is a second order finite difference multigrid diffusion applied to the conformation field. Numerical diffusion has been always added to the hyperbolic evolution equations for the conformation tensor in spectral DNS of viscoelastic turbulent flows in order to remove a-physical high wavenumber instabilities induced due to the chaotic nature of the flow. The main advantage of the finite-difference implementation (as opposed to a spectral implementation as done before) is that it allows for the preservation of the positive definiteness of the conformation tensor.     

Information Flow for Optimized Management of Spectrum and Radio Resources in Cognitive B3G Wireless Networks

The Beyond 3G (B3G) radio landscape will consist of cognitive heterogeneous wireless networks, operating in the framework of diverse co-operative associations among different classes of operators and providers, for the accommodation of the demands of users with multimode and/or multihoming enabled terminals. In this context, the optimized spectrum and radio resource utilization will be key factor for accomplishment of the purposes of both users and operators/providers, namely the satisfaction of user’s needs and the augmentation of profit, respectively. In this paper, we focus on an architecture for the management and optimization of spectrum and radio resource utilization in such composite wireless environments, and we analytically present the respective information flow among and from/to the functional entities involved in this architecture. The proposed management architecture can operate in the framework of different business scenarios and is based on related work that has been conducted within the IEEE 1900.4 standard.     

A market-based approach to managing the risk of peer-to-peer transactions

Market-based principles can be used to manage the risk of distributed peer-to-peer transactions. This is demonstrated by Ptrim, a system that builds a transaction default market on top of a main transaction processing system, within which peers offer to underwrite the transaction risk for a slight increase in the transaction cost. The insurance cost, determined through market-based mechanisms, is a way of identifying untrustworthy peers and perilous transactions. The risk of the transactions is contained, and at the same time members of the peer-to-peer network capitalise on their market knowledge by profiting as transaction insurers. We evaluated the approach through trials with the deployed Ptrim prototype, as well as composite experiments involving real online transaction data and real subjects participating in the transaction default market. We examine the efficacy of our approach both from a theoretical and an experimental perspective. Our findings suggest that the Ptrim market layer functions in an efficient manner, and is able to support the transaction processing system through the insurance offers it produces, thus acting as an effective means of reducing the risk of peer-to-peer transactions. In our conclusions we discuss how a system like Ptrim assimilates properties of real world markets, and its potential exposure and possible countermeasures to events such as those witnessed in the recent global financial turmoil.     

Maintaining consistent results of continuous queries under diverse window specifications

Continuous queries applied over nonterminating data streams usually specify windows in order to obtain an evolving–yet restricted–set of tuples and thus provide timely and incremental results. Although sliding windows get frequently employed in many user requests, additional types like partitioned or landmark windows are also available in stream processing engines. In this paper, we set out to study the existence of monotonic-related semantics for a rich set of windowing constructs in order to facilitate a more efficient maintenance of their changing contents. After laying out a formal foundation for expressing windowed queries, we investigate update patterns observed in most common window variants as well as their impact on adaptations of typical operators (like windowed join, union or aggregation), thus offering more insight towards design and implementation of stream processing mechanisms. Furthermore, we identify syntactic equivalences in algebraic expressions involving windows, to the potential benefit of query optimizations. Finally, this framework is validated for several windowed operations against streaming datasets with simulations at diverse arrival rates and window specifications, providing concrete evidence of its significance.