Shao-Shin Hung

Online Opponent Modeling for Action Prediction

It is difficult for humans to behave randomly. Over the past decades, psychological research shows that we cannot randomize our responses, even if we specially try. Therefore, predicting a players actions through opponent modelling is essential in design of game AI. For Online games, learning to anticipate one players actions also is a great benefit to play against a completely different player. In this paper, we propose a novel N-Gram based algorithm and use a suffix matching tree to model opponent behaviours. By the model, we can predict the players next style efficiently using the last few actions seen. Compared with our previous data stream mining approaches, naming MSSBE and MSSMB, an approximate 40% improvement is achieved in accuracy of prediction. The proposed method is simple in its implementation and has the potential for parallel processing in GPU.

Serious Game for Haka-Based Cultural Heritage Leraning

Games have been an important activity in human society with a meaningful impact in education. In this context, serious game joins entertainment and education for presentation, simulation or training of activities in several areas. This paper reports the importance of planning in serious games, particularly to identify the best approach to be adopted for the development. The main focus is the design of serious games for Haka-based cultural heritage education for children and adults. By focusing on those cultural heritage artifacts that pertain to the field of arts and archeology, thus driving the reader to reflect on the pedagogical impact that may derive from exploiting serious game potentialities. Serious Game, in fact, on the one hand, offers an easier access and a multi-perspective view of cultural h heritage artifacts, and, on the other, may also enrich and improve cultural heritage education thanks to the adoption of innovative learning and teaching methods.

Clustering spatial data for aggregate query processing in walkthrough: a hypergraph approach

Nowadays, classical 3D object management systems use only direct visible properties and common features to model relationships between objects. In this paper we propose a new Object-oriented HyperGraph-based Clustering (OHGC) approach based on a behavioral walkthrough system that uses traversal patterns to model relationships between users and exploits semantic-based clustering techniques, such as association, intra-relationships, and inter-relationships, to explore additional links throughout the behavioral walkthrough system. The final aim consists in involving these new links in prediction generation, to improve performance of walkthrough system. OHGC is evaluated in terms of response time and number of retrieved objects on a real traversal dataset.

Intelligent-Based Visual Pattern Clustering for Storage Layouts in Virtual Environments

There has been an increased demand for characterizing user access patterns using data mining techniques since the informative knowledge extracted from 3D server log files cannot only offer benefits for web site structure improvement but also for better understanding of user navigational behavior. In this paper, we present hypergraph-based clustering method, which utilize 3D user usage and traversal pattern information to capture user access pattern based on data mining model. This study presents a storage solution called Object-oriented HyperGraph-based Clustering (OHGC) approach, which employs hidden hinting among objects in virtual environments (VE). The OHGC takes frequent patterns for input that are discovered in the traversal databases, but with more efficient data management to assist in performance improvement. Analytical results reveal that the proposed approach for VE-based application hint clustering produces efficiency savings of up to 30% or more over conventional non-OHGC storage solutions, whereas the non-OHGC schemes for retrieve only achieve savings about 20% over conventional storage systems.

Service-Oriented Architecture for Distributed Enterprise Portal for Maintaining Global Patch Consistency

This paper presents the design, implementation of an extensible, scalable, web services ripple propagate routable base, transnational hierarchical global patch consistent model called THGPCM (Transnational Hierarchical Global Patch Consistent Model). Improving the OPDS (Original Patching Data Source) enabled network equipments, capable of updating patch parameter that existed in enterprise with specified OPDS partially dependency relationships. The paper also proposed a new scalable patching replica routing service algorithm, that dynamic reconfiguration distributed forwarding data path within enterprises hierarchical region enterprise portal. On the basis of the ubiquitous replica consistency framework, many active patch flows can be pushed by real time, periodic, reservation, and queuing with priority / degradation / preemption etc. Apply scenario can reduce the global patch service cost of transnational enterprise network equipments and minimum the turnaround time of patch service delay.

An Efficient Data Source Replicas Consistency Mechanism in Global Enterprise Firms

Supply chain management (GSCM) making the interactions between applications much easier, but the service delay and unstable network will block the whole business process. Replicated services are a good choice to resolve this problem. The transparency of information become increasingly important in the GSCM as a result of using caching, middleware and distributed database replication etc. technologies to improve the correctness of replicas in business operations. An efficient real-time replicas updating mechanism was proposed to maintain consistent and correct logistic and market information which was shared by all kinds of application systems in transnational enterprises. However, it is difficult for enterprise copies with local or remote original data source (ODS) object partial dependency relationships to maintain their consistency correctness and availableness. With these models, optimization of the correct copy inputs and switching time of each activity in a recursive routing are calculated to obtain the minimum total cost of the project. Finally, our results can be expanded for enterprise database replicas with correctness maintenance abilities.

An Efficient Framework for Distributed Enterprise Portal for Maintaining Global Patch Consistency

This paper presents the design, implementation of an extensible, scalable, web services ripple propagate routable base, transnational hierarchical global patch consistent model called THGPCM (Transnational Hierarchical Global Patch Consistent Model). Improving the OPDS (Original Patching Data Source) enabled network equipments, capable of updating patch parameter that existed in enterprise with specified OPDS partially dependency relationships. The paper also proposed a new scalable patching replica routing service algorithm, that dynamic reconfiguration distributed forwarding data path within enterprises hierarchical region enterprise portal. On the basis of the ubiquitous replica consistency framework, many active patch flows can be pushed by real time, periodic, reservation, and queuing with priority/degradation/preemption etc. Apply scenario can reduce the global patch service cost of transnational enterprise network equipments and minimum the turnaround time of patch service delay.