14850996
Effects of network characteristics on task performance in a desktop CVE system
The influences of network characteristics on the task performance in a desktop collaborative virtual environment (CVE) system were studied. In the experiment, two participants worked together to accomplish a collaborative task and a network emulator was utilized to simulate real network characteristics. The task used in the experiment was designed to be highly interactive and had rigid requirements on network characteristics (e.g. latency and packet loss). The objective performance and subjective assessment were recorded and analyzed quantitatively as a function of network latency and packet loss rate. The experiment results show that network latency has no distinct effect on task performance when network latency is less than 200 ms and lightly affect task performance when network latency is between 200 and 600 ms; packet loss has no effect on task performance when there are 40 state update messages received per second and lightly affect task performance when there are between 15 and 40 state update messages received per second.
40616325
A Color Bar Based Affective Annotation Method for Media Player
Multimedia technology has been developing quickly since the computer was invented. Nowadays, more and more people use media players to watch movies and TV shows on their computer. But it seems that we are too busy sometimes to spare nearly two hours watching a movie from beginning to end. We’d like to find and watch the most exciting episodes that we are interested in as soon as possible. The media players we use often only provide a slider bar for locating, which is rather low in efficiency. Respecting this, an affective annotation method for video clips is proposed in this paper and the method is implemented in an affectively annotated media player. In addition, two experiments were set up to evaluate the proposed method. Experiment results indicate that affective annotation facilitates the subjects in quick locating target events and helps them understand the scenarios better.
11794423
An adaptive consistency maintenance approach for replicated continuous applications
Consistency maintenance is a key problem to replicated continuous applications and dead reckoning (DR) algorithm is widely used in this area. In order to eliminate short-term inconsistency caused by DR algorithm, local-lag approach was proposed. For the purpose of simplicity, fixed lag value is used by local-lag approach and the performance of the approach is greatly deteriorated. In this paper, an adaptive consistency maintenance approach, which is based on local-lag approach, is proposed. The new approach can adjust lag value according to the estimated typical network latency. In order to ensure the criterion of consistency correctness, a lag value adjustment method is also proposed. Through two experiments, the performance of the new approach is evaluated and the results indicate that it is feasible and can greatly improve the performance of the application.
17619661
Your way your missions: from location-based to route-based pervasive gaming
In this paper, we describe the design and implementation of a route-based pervasive game named Your Way Your Missions (YWYM). Since the game obtains the planned routes of players and returns missions in the routes, players can play the game in a casual way, without changing their routes to respond to picked up missions. A self-reporting method is proposed to obtain the planned routes of players, and a corresponding route defining tool is developed upon Google Maps. Two approaches to realize route-based mission adaptation with spatial databases are presented.
4274853
Lifting based discrete wavelet transform architecture for JPEG2000
A lifting based 1-D discrete wavelet transform (DWT) core is proposed. It is re-configurable for 5/3 and 9/7 filters in JPEG2000. Folded architecture is adopted to reduce the hardware cost and achieve the higher hardware utilization. Multiplication is realized in hardwired multiplier with coefficients represented in canonic signed-digit (CSD) form. It is a compact and efficient DWT core for the hardware implementation of JPEG2000 encoder.
441449
A novel ant clustering algorithm based on cellular automata
Based on the principle of cellular automata in artificial life, an artificial ant sleeping model (ASM) and an ant algorithm for cluster analysis (A4C) are presented. Inspired by the behaviors of gregarious ant colonies, we use the ant agent to represent a data object. In ASM, each ant has two states: a sleeping state and an active state. The ant's state is controlled by a function of the ant's fitness to the environment it locates and a probability for the ants becoming active. The state of an ant is determined only by its local information. By moving dynamically, the ants form different subgroups adaptively, and hence the data objects they represent are clustered. Experimental results show that the A4C algorithm on ASM is significantly better than other clustering methods in terms of both speed and quality. It is adaptive, robust and efficient, achieving high autonomy, simplicity and efficiency.
4792658
Active Page Generation via Customizing XML for Data Beans in E-Commerce Applications
In this paper, we analyze enabling technologies for typical e-business applications in terms of their multi-tier system architecture and their Model-Control-View (MCV) programming model. Based on observed limitations of the JSP (Java Server Page) technique commonly adopted for dynamic page generation (the view logic), we instead propose an alternative solution approach, namely, a generic schema mapping strategy to generate XML documents and DTDs from enterprise data beans. First, we describe in detail the XML generation process for the content composition logic. We also outline the XSL processing for the transformation logic. The separation of these two logics results in a generic solution to the bean viewing problem. In particular, it improves the bean reusability via its XML representative compared to the rigid strategy of hard-coding logics into JSP. Our proposed XML mapping solution represents a potentially valuable addition to future versions of the enterprise data beans specification. The trade-off between performance and flexibility of these alternative solutions is discussed. Lastly, we survey the state-of-art research results and emerging stardards related to this XML model mapping approach.
2673173
State Aware Data Dissemination over Structured Overlays
We describe the problem of data dissemination in stream-oriented applications where the required filter is a function of the current state. We call such functions dynamic filters. A state aware data dissemination network (SA-DDN) is proposed to support dynamic filters. Two approaches single-level filtering (SF) and multilevel filter decomposition (MFD) are proposed to facilitate the data dissemination. We show how MFD improves performance over SF. We then describe a realization of SA-DDN on top of an improved bi-directional Chord overlay with a built-in multicast mechanism. An application of stock price monitoring is implemented based on SA-DDN and real life stock quotes are collected to demonstrate the feasibility of our system. Extensive simulations are performed to compare the performance of both approaches and provide insight into the advantages of MFD
3257950
Robustness of Regional Matching Scheme over Global Matching Scheme
Analyzing the effect of concentrated noise on a typical decision-making process of a simplified two-candidate voting model, we have demonstrated that a local approach using a regional matching process is more robust and stable than a direct approach using a global matching process, by establishing that the former is capable of accommodating a higher level of noise than the latter before the result of the decision overturns. To extend the theory to imagery analysis, we pose a conjecture that our conclusion on the robustness of the regional matching processes remains valid not only for the simpler vote counting schemes but also for practically more important decision-making schemes in image analysis which involve dimension-reducing transforms or other features extraction processes such as principal component analysis or Gablor transforms. Two convincing experimental verifications are provided, supporting not only the theory by a white-black flag recognition problem on a pixel-by-pixel basis, but also the validity of the conjecture by a facial recognition problem in the presence of localized noise typically represented by clutter or occlusion in imagery.