ppxscal/embedding_network huggingface dataset:
A peer auditing scheme for cheat elimination in MMOGs
Authors: Josh Goodman, Clark Verbrugge
Venue: Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games (2008)

Although much of the research into massively multiplayer online games (MMOGs) focuses on scalability concerns, other issues such as the existence of cheating have an equally large practical impact on game success. Cheat prevention itself is usually addressed through the use of proprietary, ad-hoc or manual methods, combined with a strong centralized authority as found in a straightforward client/server network model. To improve scalability, however, the use of more extensible, yet less secure, peer-to-peer (P2P) models has become an attractive game design option. Here we present the IRS hybrid game model that efficiently incorporates a centralized authority into a P2P setting for purposes of controlling and eliminating game cheaters. Analysis of our design shows that with any reasonable parametrization malicious clients are purged extremely quickly and with minimal impact on non-cheating clients, while still ensuring continued benefit and scalability from distributed computations. Cheating has a serious impact on the viability of multiplayer games, and our results illustrate the possibility of a system in which scalability and security coexist.
An Automata Based Authorship Identification System
Authors: Tsau Young Lin, Shangxuan Zhang
Venue: New Frontiers in Applied Data Mining: PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers (2009)

This paper uses the learning capability of finite automata to develop an authorship identification system. Based on ALERGIA algorithm, we use writing samples of an author to build a stochastic finite automaton. This automaton represents the writing characteristics of the author. This automaton, then, can be used to test whether an anonymous writing piece belongs to this author. Initial tests are quite successful.
On decidability of LTL model checking for process rewrite systems
Authors: Laura Bozzelli, Mojm&#x00ed;r K&#x0159;et&#x00ed;nsk&#x00fd;, Vojt&#x011b;ch &#x0158;eh&#x00e1;k, Jan Strej&#x010d;ek
Venue: Acta Informatica (2009)

We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (wPRS), and properties described by basic fragments of action-based Linear Temporal Logic (LTL) with both future and past operators. It is known that the problem for general LTL properties is decidable for Petri nets and for pushdown processes, while it is undecidable for PA processes.We show that the problem is decidable for wPRS if we consider properties defined by LTL formulae with only modalities strict eventually, strict always, and their past counterparts. Moreover, we show that the problem remains undecidable for PA processes even with respect to the LTL fragment with the only modality until or the fragment with modalities next and infinitely often.
Enumeration of 2-regular circulant graphs and directed double networks
Authors: Aygul Mamut, Qiongxiang Huang, Liu Fenjin
Venue: Discrete Applied Mathematics (2009)

We present a formula to enumerate non-isomorphic circulant digraphs of order n with connection sets of cardinality 2. This formula simplifies to C(n,2)=3x2^a^-^1-4 in the case when n=2^a(a>=3), and C(n,2)=(p^a-1)(p+1)2(p-1)-a when n=p^a(where p is an odd prime and a>=1). The number of non-isomorphic directed double networks are also enumerated.
Using modes of inquiry and engaging problems to link computer science and mathematics
Authors: Robin Y. Flatland, James R. Matthews
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

In this paper we show how an engaging problem can be used in both a discrete mathematics course and a programming course as a way to expose students to multiple methods of inquiry and to strengthen the links between the two courses. Since students typically take Discrete Mathematics and a programming course simultaneously, this is an opportunity for them to analyze a problem from multiple perspectives during a single semester. We describe how we have accomplished this using a relatively new problem that is easily stated and has a surprising solution that defies intuition. In the programming course, students experienced a design/empirical approach to the problem by implementing simulations of various solutions and collecting experimental results. By adjusting the emphasis of the programming assignment, we show that it can fit naturally into a range of programming courses, i.e. courses on introductory programming, data structures, and object-oriented techniques. In the Discrete Mathematics course, students analyzed solutions using tools from counting, probability, and calculus. We observed that by linking the two courses using a common problem, our students were more cognizant of inquiry methods and student engagement increased.
Transaction-based model for real-time distributed control systems
Authors: Gh. Sebestyen, A. Hangan
Venue: Proceedings of the 2008 IEEE International Conference on Automation, Quality and Testing, Robotics - Volume 02 (2008)

The paper presents a transaction-based task allocation model suitable for real-time distributed control applications. In accordance with the proposed model the autonomous functionalities of a control application are implemented as chains of tasks and messages, called transactions. This model allows the evaluation of worst case response time for transactions and subsequently determines the real-time feasibility of the system. The task allocation strategy assures fault-tolerance and adaptable real-time behavior. As communication infrastructure a general purpose switched Ethernet network was considered. The transaction-based model was validated through simulations made with a Timed Petri-Net tool.
An Improved Way to Facilitate Composition-Oriented Semantic Service Discovery
Authors: Ting Gao, Haiyang Wang, Naihui Zheng, Fei Li
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Services are offered by service providers, which procure service implementations and maintenance, and supply service descriptions. For Web services to become practical, an infrastructure needs to be supported that allows users and applications to discover, deploy, compose and synthesize services automatically. The essence of the Web service is the process on marching between the users’ request and the service. In this paper, we simplify the Web service discovery and composition definition, and present an approach for automatic service discovery and composition based on semantic description of Web services, which is on the foundation of using inverted indexing to facilitate composition-oriented semantic service discovery. We also test the algorithm on repositories of different sizes and present the results. We evaluate the algorithm and it decrease the searching space cost and increase the precision.
Collaborative filtering based on workflow space
Authors: Lu Zhen, George Q. Huang, Zuhua Jiang
Venue: Expert Systems with Applications: An International Journal (2009)

The traditional recommender systems are usually oriented to general situations in daily lives (e.g. recommend movies, books, music, news and etc.), but seldom cover the recommendation scenarios for the collaborative team environments. We have done an explorative study on collaborative filtering mechanism for collaborative team environments, which is some kind of multi-dimensional recommender systems problem with consideration of workflow context. This paper proposed 3-dimensional workflow space model, and investigated the new similarities measure between members in workflow space. Then, the new similarities measure is utilized into collaborative filtering for recommender systems in collaborative team environments. At last, the efficiency and usability of the proposed method are validated by experiments referring to a real-world collaborative team of a manufacturing enterprise.
On path selection and rate allocation for video in wireless mesh networks
Authors: Sastry Kompella, Shiwen Mao, Y. Thomas Hou, Hanif D. Sherali
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Multi-path transport is an important mechanism for supporting video communications in multihop wireless networks. In this paper, we investigate the joint problem of optimal path se-lection and rate allocation for multiple video sessions in a wire-less mesh network. We present a mathematical formulation to op-timize the application level performance (i.e., video distortion) in the context of path selection and rate allocation. For this complex optimization problem, we propose a branch-and-bound based so-lution procedure, embedded with the Reformulation-Linearization Technique (RLT) that can produce (1 - Ε)-optimal solutions for any small Ε. This result is significant as it not only provides the-oretical understanding of this problem, but also offers a perfor-mance benchmark for any future proposed distributed algorithm and protocol for this problem. Simulation results are also provided to demonstrate the efficacy of the solution procedure.
A development framework for component-based agent-oriented business services
Authors: Tai Nguyen, Manuel Kolp, Loris Penserini
Venue: International Journal of Agent-Oriented Software Engineering (2009)

Nowadays, modern applications tend to be open and dynamic since they evolve in a changing organisational and operational environment where components can be added, modified, or removed at any time. Together, service-oriented computing and Multi-Agent Systems (MASs) represent dynamic and evolving structures which can change at run-time to benefit from the capabilities of new system entities or replace obsolete ones. They are particularly useful to define business services that refer to specific electronic business interactions. In this paper, we propose a business service development framework composed of three phases: modelling, design and specification. The modelling phase models two levels of a business service: the services of a business service and the agents of each service. The design phase details a business service with three models: component, structural and interaction. In the interaction model, which expresses the exchange or the communication between services or agents of a business service, there are three levels to model: the component (between services), the agent (between agents) and the message (the structure and ontology of messages). Finally, the specification phase presents information acquired from the modelling and design phases in a machine-readable language. Using the support toolkit, we developed a Multi-criteria Data Integration case study to illustrate the framework application.
Background pass-go (BPG), a new approach for GPS
Authors: L. Y. Por, X. T. Lim, F. Kianoush
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Access to computer systems is most often based on the use of alpha-numeric password until today. The textual passwords or alpha-numeric passwords have been the basis of authentication systems for a long time. Similarly, they have also been the major attractions for crackers and attackers. However, users always face difficulty in remembering a password which is considered as secured password as this type of secured passwords usually has long string of characters and in random appearing [14]. Hence, most of the users tend to create simple, short and insecure passwords. As a consequence, the usability level of passwords has not achieved an optimum level most of the time for a secured password [14]. In order to solve this problem, a new password scheme has been invented. There are a few schemes which have been studied and enhanced based on the initial idea of Greg Blonder. In this paper, we discuss the design and intention of our proposed scheme, called Background Pass-Go (BPG). BPG is an improvement version of Pass-Go, as it keeps most of the advantages of Pass-Go and achieves better usability. We have analyzed the BPG scheme in terms of 1) how BPG is able to improve other schemes of GSP especially in Pass-Go, 2) how BPG acts as a solution to different types of threats to networked computer systems. Though out our literature, we have verified that BPG manages to overcome the shortage of other GPS schemes. Moreover, the BPS also manages to address most of the security threats for the network security system.
Dependent latch identification in the reachable state space
Authors: Chen-Hsuan Lin, Chun-Yao Wang
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

The large number of latches in current designs increase the complexity of formal verification and logic synthesis, since the growth of latch number leads the state space to explode exponentially. One solution to this problem is to find the functional dependencies among these latches. Then, these latches can be identified as dependent latches or essential latches, where the state space can be constructed using only the essential latches. This paper proposes an approach to find the functional dependencies among latches in a sequential circuit by using SAT solvers with the Craig interpolation theorem. In addition, the proposed approach detects sequential functional dependencies existing in the reachable state space only. Experimental results show that our approach could deal with large sequential circuits with up to 1.5K latches in a reasonable time and simultaneously identify the combinational and sequential dependent latches.
Infectious disease control policy: a role for simulation
Authors: Margaret L. Brandeau
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Control of infectious diseases is a key global health priority. This paper describes the role that simulation can play in evaluating policies for infectious disease control. We describe ongoing simulation studies in three different areas: HIV prevention and treatment, contact tracing, and hepatitis B prevention and control.
Transparency analysis and delay compensation scheme for haptic-based networked virtual environments
Authors: Seokhee Lee, JongWon Kim
Venue: Computer Communications (2009)

Haptic-based NVEs (networked virtual environments) with CS (client/server) communication architectures support better consistency but induce larger end-to-end delays than those with P2P (peer-to-peer) communication architectures. Unfortunately, large delay severely deteriorates the transparency (i.e., reality) of haptic interaction. To improve the haptic interaction quality for haptic-based NVEs with CS communication architectures, in this paper the degradation of haptic interaction quality is analyzed according to network delays. Based on the analysis, the maximum allowable delay bound is predicted and unrealistic force feedback caused by the network delay is compensated. Experimental results confirm that the proposed analysis provides an acceptable quantification method about haptic interaction quality and that the proposed delay-compensation scheme effectively improves haptic interaction quality with respect to network delays.
Grid-based asynchronous replica exchange
Authors: Zhen Li, Manish Parashar
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

Replica exchange is a powerful sampling algorithm and can be effectively used for applications such as simulating the structure, function, folding, and dynamics of proteins and drug design. However, Grid-based implementations of the algorithm present significant challenges due to its synchronization and communication requirements. This paper presents an asynchronous formulation of the replica exchange algorithm and the design and implementation of a Grid-based asynchronous replica exchange engine (GARE). GARE is based on CometG, a decentralized computational infrastructure for Desktop Grid environments that provides a scalable communication and interaction substrate and presents a virtual semantically specialized shared space abstraction. It enables the dynamic and asynchronous interactions required by the algorithm to be simply expressed and efficiently implemented. The design and implementation of GARE/CometG and the replica exchange simulations that it enables are presented. Experimental evaluations using the PlanetLab [1] wide-area test bed as well as a campus Grid environment are presented.
An Introduction to BioModel Engineering, Illustrated for Signal Transduction Pathways
Authors: David Gilbert, Rainer Breitling, Monika Heiner, Robin Donaldson
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

BioModel Engineering is the science of designing, constructing and analyzing computational models of biological systems. It is inspired by concepts from software engineering and computing science.This paper illustrates a major theme in BioModel Engineering, namely that identifying a quantitative model of a dynamic system means building the structure, finding an initial state, and parameter fitting. In our approach, the structure is obtained by piecewise construction of models from modular parts, the initial state is obtained by analysis of the structure and parameter fitting comprises determining the rate parameters of the kinetic equations. We illustrate this with an example in the area of intracellular signalling pathways.
An algorithm to generate representations of system identification errors
Authors: Wancheng Zhang, Patrick A. Naylor
Venue: Research Letters in Signal Processing (2008)

An algorithm to generate representations of system identification (SI) errors, which enables systematic testing of the performance of system equalization techniques, is proposed. With this algorithm, the normalized projection misalignment (NPM) of the generated error representation can be chosen to suit the particular characteristics of the application under test. Additionally, the generated error representation can represent all the error vectors corresponding to different scaling factors in the estimates of the system impulse response (SIR), without influencing the signal-to-distortion ratio (SDR) of the equalized impulse response.
A new approach to building histogram for selectivity estimation in query processing optimization
Authors: Xin Lu, Jihong Guan
Venue: Computers Mathematics with Applications (2009)

Recently, histograms have been considered as an effective way to produce quick approximate answers to decision support queries. They are also taken as a basic tool for data visualization and analysis. In this paper, we propose a new approach to constructing histograms for selectivity estimation in query processing optimization. Our approach uses a new criterion, i.e., aggregate error minimization, to direct the construction of the target histogram. We develop the algorithm of aggregate error minimization based histogram construction, and demonstrate the effectiveness and efficiency of the proposed approach by experiments over both real-world and synthetic datasets.
Improving the Believability of Virtual Characters Using Qualitative Gesture Analysis
Authors: Barbara Mazzarino, Manuel Peinado, Ronan Boulic, Gualtiero Volpe, Marcelo M. Wanderley
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

This paper describes preliminary results of a research performed in the framework of the Enactive project (EU IST NoE Enactive). The aim of this research is to improve believability of a virtual character using qualitative analysis of gesture. Using techniques developed for human gesture analysis, we show it is possible to extract high-level motion features from reconstructed motion and to compare them with the same features extracted from the corresponding real motions. Moreover this method allows us to evaluate whether the virtual character conveys the same high level expressive content as the real motion does, and makes it possible to compare different rendering techniques in order to assess which one better maintains such information.
Revisiting district six: a case study of digital heritage reconstruction from archival photographs
Authors: Christopher de Kadt, James Gain, Patrick Marais
Venue: Proceedings of the 6th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa (2009)

This paper investigates the digital reconstruction of destroyed buildings from small sets of old, uncalibrated photographs. The application domain is the heritage preservation of District Six -- a mixed race area in Cape Town that was leveled during the South African Apartheid regime and whose residents were forcibly removed. Our framework uses a combination of semi-automatic camera calibration, model-based architecture-specific photogrammetry, and texture synthesis to reconstruct the geometry and texture of a building so that it can be incorporated into a heritage-based virtual environment, such as a museum display. These techniques are well established in isolation; the purpose here is to discover if they can be adapted to damaged and uncalibrated photographs, where the time periods and chromatic schemes differ or where, in the worst case, only a single photograph is available. To test the effectiveness of the reconstruction framework we consider three representative cases of District Six architecture. All three cases were reconstructed successfully with some provisos concerning uneven ground, intricate building features, and unfavourable camera angles.
Numerical Solution of the Discrete-Time Coupled Algebraic Riccati Equations
Authors: Ivan Ganchev Ivanov
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

We consider the numerical solution of a set of discrete-time coupled algebraic Riccati equations that arise in quadratic optimal control. Several iterations for computing a symmetric solution of this system are investigated and compared. New iterations are based on the properties of a Stein equation. It is necessary to solve a Stein equation at each step of considered algorithms. We will compare the corresponding solvers in regard of accuracy, number of iterations and time of executing. Several sets of test examples are used to demonstrate the performance.
Resource management system for a broadband multipoint bridge
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: The use of a bridge (also known as a multipoint central unit) to enable multipoint communications over point to point narrowband-ISDN connections is well established. We deal with multipoint bridging for a broadband network environment. We explain the benefits of employing a bridge in that context and highlight the new design problems and challenges. Of particular importance is the need for a bridge resource management system which can be used in conjunction with end to end contracts for quality of service. We describe a model for managing bridge resources based on the estimated requirements of audio and video processing functions. Aspects of the initial system design are presented.