Simultaneous Localization and Recognition of Dynamic Hand Gestures

A framework for the simultaneous localization and recognition of dynamic hand gestures is proposed. At the core of this framework is a dynamic space-time warping (DSTW) algorithm, that aligns a pair of query and model gestures in both space and time. For every frame of the query sequence, feature detectors generate multiple hand region candidates. Dynamic programming is then used to compute both a global matching cost, which is used to recognize the query gesture, and a warping path, which aligns the query and model sequences in time, and also finds the best hand candidate region in every query frame. The proposed framework includes translation invariant recognition of gestures, a desirable property for many HCI systems. The performance of the approach is evaluated on a dataset of hand signed digits gestured by people wearing short sleeve shirts, in front of a background containing other non-hand skin-colored objects. The algorithm simultaneously localizes the gesturing hand and recognizes the hand-signed digit. Although DSTW is illustrated in a gesture recognition setting, the proposed algorithm is a general method for matching time series, that allows for multiple candidate feature vectors to be extracted at each time step.

Dynamic Server Selection in the Internet

As distributed information services like the World Wide Web become increasingly popular on the Internet, problems of scale are clearly evident. A promising technique that addresses many of these problems is service (or document) replication. However, when a service is replicated, clients then need the additional ability to find a "good" provider of that service. In this paper we report on techniques for finding good service providers without a priori knowledge of server location or network topology. We consider the use of two principal metrics for measuring distance in the Internet: hops, and round-trip latency. We show that these two metrics yield very different results in practice. Surprisingly, we show data indicating that the number of hops between two hosts in the Internet is not strongly correlated to round-trip latency. Thus, the distance in hops between two hosts is not necessarily a good predictor of the expected latency of a document transfer. Instead of using known or measured distances in hops, we show that the extra cost at runtime incurred by dynamic latency measurement is well justified based on the resulting improved performance. In addition we show that selection based on dynamic latency measurement performs much better in practice that any static selection scheme. Finally, the difference between the distribution of hops and latencies is fundamental enough to suggest differences in algorithms for server replication. We show that conclusions drawn about service replication based on the distribution of hops need to be revised when the distribution of latencies is considered instead.

Dynamic Server Selection using Bandwidth Probing in Wide-Area Networks

Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server. Prior work has generally assumed that assignment to be static. In contrast, we propose dynamic server selection, and show that it enables application-level congestion avoidance. To make dynamic server selection practical, we demonstrate the use of three tools. In addition to direct measurements of round-trip latency, we introduce and validate two new tools: bprobe, which estimates the maximum possible bandwidth along a given path; and cprobe, which estimates the current congestion along a path. Using these tools we demonstrate dynamic server selection and compare it to previous static approaches. We show that dynamic server selection consistently outperforms static policies by as much as 50%. Furthermore, we demonstrate the importance of each of our tools in performing dynamic server selection.

An Infrastructure for the Dynamic Distribution of Web Applications and Services

This paper presents the design and implementation of an infrastructure that enables any Web application, regardless of its current state, to be stopped and uninstalled from a particular server, transferred to a new server, then installed, loaded, and resumed, with all these events occurring "on the fly" and totally transparent to clients. Such functionalities allow entire applications to fluidly move from server to server, reducing the overhead required to administer the system, and increasing its performance in a number of ways: (1) Dynamic replication of new instances of applications to several servers to raise throughput for scalability purposes, (2) Moving applications to servers to achieve load balancing or other resource management goals, (3) Caching entire applications on servers located closer to clients.

START: A Bridge between Emotion Theory and Neurobiology through Dynamic System Modeling

Lewis proposes "reconceptualization" (p. 1) of how to link the psychology and neurobiology of emotion and cognitive-emotional interactions. His main proposed themes have actually been actively and quantitatively developed in the neural modeling literature for over thirty years. This commentary summarizes some of these themes and points to areas of particularly active research in this area.

Dynamic Binding of Visual Contours Without Temporal Coding

Recognition of objects in complex visual scenes is greatly simplified by the ability to segment features belonging to different objects while grouping features belonging to the same object. This feature-binding process can be driven by the local relations between visual contours. The standard method for implementing this process with neural networks uses a temporal code to bind features together. I propose a spatial coding alternative for the dynamic binding of visual contours, and demonstrate the spatial coding method for segmenting an image consisting of three overlapping objects.

Dynamic Programming for Optimal Control of Set-Up Scheduling with Neural Network Modifications

This paper demonstrates an optimal control solution to change of machine set-up scheduling based on dynamic programming average cost per stage value iteration as set forth by Cararnanis et. al. [2] for the 2D case. The difficulty with the optimal approach lies in the explosive computational growth of the resulting solution. A method of reducing the computational complexity is developed using ideas from biology and neural networks. A real time controller is described that uses a linear-log representation of state space with neural networks employed to fit cost surfaces.

XBATTLE: A Dynamic Distributed Model of Generalized Military Conflict

A dynamic distributed model is presented that reproduces the dynamics of a wide range of varied battle scenarios with a general and abstract representation. The model illustrates the rich dynamic behavior that can be achieved from a simple generic model.

Crush responses of composite cylinder under quasi-static and dynamic loading

Despite the abundance of studies investigating the performance of composite structures under crush loading, disagreement remains in the literature regarding the effect of increased strain rate on the crush response. This study reports an experimental investigation of the behaviour of a carbon-epoxy composite energy absorber under static and dynamic loading with a strain rate of up to 100s^-1. Consistent damage modes and measured force responses were obtained in samples tested under the same strain rate. The energy absorption was found to be independent of strain rate as the total energy absorption appeared to be largely associated with fibre-dominated fracture, which is independent of strain rate within the studied range. The results from this study are beneficial for the design of energy absorbing structures.

Human Perception of Laughter from Context-free Whole Body Motion Dynamic Stimuli

Laughter is a ubiquitous social signal in human interactions yet it remains understudied from a scientific point of view. The need to understand laughter and its role in human interactions has become more pressing as the ability to create conversational agents capable of interacting with humans has come closer to a reality. This paper reports on three aspects of the human perception of laughter when context has been removed and only the body information from the laughter episode remains. We report on ability to categorise the laugh type and the sex of the laugher; the relationship between personality factors with laughter categorisation and perception; and finally the importance of intensity in the perception and categorisation of laughter.

Dynamic data reconciliation for sequential modular simulators: application to a mixing process

This paper describes a method for dynamic data reconciliation of nonlinear systems that are simulated using the sequential modular approach, and where individual modules are represented by a class of differential algebraic equations. The estimation technique consists of a bank of extended Kalman filters that are integrated with the modules. The paper reports a study based on experimental data obtained from a pilot scale mixing process.

Total secondary-electron yield of metals measured by a dynamic method

The secondary electron emission of dielectrics usually is measured by the pulse method, in which the dielectric is irradiated with short pulses of electrons. Attempts to use a dynamic method, in which the dielectric is irradiated continuously, have failed because the dielectric becomes charged and this charge interferes with the emission process. The dynamic method can, however, be applied to metals where volume charges are prevented. This article reports dynamic measurements of the total secondary emission yield from stainless steel, platinum, and aluminum and compares them with results from the current pulse method. In order to apply the dynamic method to metals a simple but important change in the setup was introduced: a dielectric slab was placed between the electrode and the metallic sample, which permitted the sample surface potential and therefore the energy of the incident electrons to change continuously. Unlike for dielectrics, the emission curves for metals are identical when obtained by the two methods. However, for a sample with deliberately oxidized surfaces the total secondary emission yield is smaller when measured with the dynamic method as compared with the pulse method, just as happens for dielectrics. (C) 2000 American Institute of Physics. [S0021-8979(00)03413-7].

Microstructural, physical, and fluid dynamic assessment of spinel-based and phosphate-bonded investments for dental applications

This work reports the experimental evaluation of physical and gas permeation parameters of four spinel-based investments developed with or without inclusion of sacrificial fillers. Data were compared with those of three commercial formulations. Airflow tests were conducted from 27 to 546°C, and permeability coefficients were fitted from Forchheimer's equation. Skeletal densities found for spinel- (ρs = 3635 ± 165 kg/m3) and phosphate-bonded (ρs = 2686 ± 11 kg/m3) samples were in agreement with the literature. The developed investments were more porous and less permeable than commercial brands, and the differences were ascribed to the different pore morphologies and hydraulic pore sizes of ceramic matrices. The inclusion of both fibers and microbeads resulted in increases of total porosity (42.6–56.6%) and of Darcian permeability coefficient k1 (0.76 × 10−14–7.03 × 10−14 m2). Air permeation was hindered by increasing flow temperatures, and the effect was related to the influence of gas viscosity on ΔP, in accordance with Darcy's law. Casting quality with molten titanium (CP Ti) was directly proportional to the permeability level of the spinel-based investments. However, the high reactivity of the silica-based investment RP and the formation of α-case during casting hindered the benefits of the highest permeability level of this commercial brand.