Modeling,simulation, and practice of floor control for synchronous and ubiquitous collaboration

Floor control refers to the need for coordinating activities occurred in synchronously cooperating applications shared among collaborators. We address this for ubiquitous collaboration—the capability of multiple users to link together with disparate access device anytime and anywhere. Floor control has been studied for years but most researchers focus on relaxed coordination mechanisms with stationary devices that allow updates by any user on any object and resolve the uncoordinated updates. In this paper we present a floor control mechanism, called XGSP-Floor, which implements a coordination mechanism at application level for enabling users to consistently share the same resource in real time (synchronous collaboration) in ubiquitous collaboration environment. The implementation platform on cell phone devices may not be new. But we believe the implementation and experiment for XGSP-Floor on cell phone devices is a new challenge in ubiquitous collaboration environment even though the coordination mechanism can intuitively impose a tremendous overhead in worst case. We also describe the results of the modeling of XGSP-Floor and formal verification to prove the correctness of the modeling using Colored Petri Nets. We describe lessons learned and discuss future work.     

Subsegmental,segmental and suprasegmental processing of linear prediction residual for speaker information

This work processes linear prediction (LP) residual in the time domain at three different levels, extracts speaker information, and demonstrates their significance and also different nature for text-independent speaker recognition. The subsegmental analysis considers LP residual in blocks of 5 msec with shift of 2.5 msec to extract speaker information. The segmental analysis extracts speaker information by processing in blocks of 20 msec with shift of 2.5 msec. The suprasegmental speaker information is extracted by viewing in blocks of 250 msec with shift of 6.25 msec. The speaker identification and verification studies performed using NIST-99 and NIST-03 databases demonstrate that the segmental analysis provides best performance followed by subsegmental analysis. The suprasegmental analysis gives the least performance. However, the evidences from all the three levels of processing seem to be different and combine well to provide improved performance, demonstrating different speaker information captured at each level of processing. Finally, the combined evidence from all the three levels of processing together with vocal tract information further improves the speaker recognition performance.     

Adaptive control of straight worms without derivative measurement

In this paper we consider an adaptive control problem of finite DoF worm-like locomotion systems (WLLS) which contact the ground with Coulomb dry friction. Using a rough mathematical friction law the system is shown to belong to a system class that allows adaptive control. Gaits from the kinematic theory can be tracked by means of adaptive controllers. For this we introduce two different adaptive controllers for λ-tracking and focus on that one which is not based on the derivative of the output. We pay attention to the analysis of such systems and present some theoretical control investigations including proofs. Numerical simulations of tracking different reference signals under arbitrary choice of the system parameters demonstrate and illustrate that the introduced simple adaptive controllers work successfully and effectively. Current experiments are aimed at the justification of theoretical results.     

Smooth velocity approximation for constrained systems in real-time simulation

The rapidly increasing complexity of multi-body system models in applications like vehicle dynamics, robotics and bio-mechanics requires qualitative new solution methods to slash computing times for the dynamical simulation.     

Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method

Recently, it was shown how the convergence of a class of multigrid methods for computing the stationary distribution of sparse, irreducible Markov chains can be accelerated by the addition of an outer iteration based on iterant recombination. The acceleration was performed by selecting a linear combination of previous fine-level iterates with probability constraints to minimize the two-norm of the residual using a quadratic programming method. In this paper we investigate the alternative of minimizing the one-norm of the residual. This gives rise to a nonlinear convex program which must be solved at each acceleration step. To solve this minimization problem we propose to use a deep-cuts ellipsoid method for nonlinear convex programs. The main purpose of this paper is to investigate whether an iterant recombination approach can be obtained in this way that is competitive in terms of execution time and robustness. We derive formulas for subgradients of the one-norm objective function and the constraint functions, and show how an initial ellipsoid can be constructed that is guaranteed to contain the exact solution and give conditions for its existence. We also investigate using the ellipsoid method to minimize the two-norm. Numerical tests show that the one-norm and two-norm acceleration procedures yield a similar reduction in the number of multigrid cycles. The tests also indicate that one-norm ellipsoid acceleration is competitive with two-norm quadratic programming acceleration in terms of running time with improved robustness.     

Research on the group decision-making about emergency event based on network technology

In order to improve decision-making efficiency about emergency event, this paper proposes a novel concept, i.e., Agile-Delphi Method, which is an integration of agile decision and Delphi Method implicating that the decision-makers instantly deliver, respond, treat, and utilize information via Delphi process while conducting group decision-making about emergency event. The paper details the mechanism of group decision-making about emergency event based on network technology and Agile-Delphi Method. Finally, the paper conducts an empiric analysis taking the “111 event”, i.e., the liquid ammonia spill event happened on November 1, 2006 in a phosphorus chemical company in China, as an example.     

Influences on standards adoption in de facto standardization

In the IT industry, de facto standards emerge from standards competition as firms offer incompatible technologies, and user choices determine the outcome of the competition. The standards literature suggests that strong network effects create a bias toward a standard with a large installed base, leading to a winner-take-all outcome. More recently, several researchers have revealed that the dynamics of standardization are much more complex than the explanation offered by the economic theory of networks. Markets do not always exhibit tipping behavior so there is not always a single winner in de facto standardization; and the size of an overall installed base does not always exert a strong influence on adoption decisions. In contrast, network effects drawn from local social influence may be more salient to user adoption decisions. We ask: (1) Do we always observe a winner-take-all outcome in de facto standards competition? (2) What are the different technology adoption patterns observed in de facto standards competition? (3) What are the implications of network effects, switching costs, pricing, and functionality enhancement strategies on the outcome of de facto standards competition in different user network structures? Drawing on the economic theory of networks, the complex network theory, and previous work in the standards literature, we examine the influence of network effects, switching costs, price, and technology functionality on user adoption decisions using agent-based simulation. We incorporate underlying user network structures frequently observed in the real world as an important determining factor of user adoption decisions. Our results suggest that de facto standardization process does not always follow a three-phased S-shaped pattern. Winner-take-all is not a necessary outcome of standards competition. User network structures have a significant impact on the dynamics and outcomes of standards competition.