ppxscal/embedding_network huggingface dataset:
A zone-based gaming architecture for ad-hoc networks
Authors: Sebastián Matas Riera, Oliver Wellnitz, Lars Wolf
Venue: Proceedings of the 2nd workshop on Network and system support for games (2003)

Mobile devices are gaining popularity and it is expected that the number of these devices will grow even more in the next few years. While very different types of mobile devices exist, it can be expected that most of them will have sooner or later sufficient processing and communication resources to be used as clients for distributed multi-player games. We expect that ad-hoc networks will be of particular interest for many game scenarios since clients which are in sufficiently close proximity are then able to communicate directly or via a limited number of hops without the need of further, externally provided infrastructure.In this paper we study problems that appear for games in ad-hoc networks and present an architecture designed to address and solve the identified problems. Usual game architectures follow one of two approaches: 1. A central server design where the server receives the state change events from the users, recalculates the overall state and distributes the changes in the game state to the players. 2. A completely distributed model where every player sends state changes directly to all the other players. However, we believe that both approaches have problems, especially for games in adhoc networks.We propose to introduce the concept of a 'Zone Server'. I.e., some players are elected as Zone Servers. Each Zone Server receives the state change of only a group of players. It also communicates with the others to propagate the game state changes to all the players. Issues we are addressing are the location of Zone Servers and the communication between players and Zone Servers.
An examination of the run-time performance of GUI creation frameworks
Authors: Christopher J. Howell, Gregory M. Kapfhammer, Robert S. Roos
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

The graphical user interface (GUI) is an important component of many software systems. Past surveys indicate that the development of a GUI is a significant undertaking and that the GUI's source code often comprises a substantial portion of the program's overall source base. Graphical user interface creation frameworks for popular object-oriented programming languages enable the rapid construction of simple and complex GUIs. In this paper, we examine the run-time performance of two GUI creation frameworks, Swing and Thinlet, that are tailored for the Java programming language. Using a simple model of a Java GUI, we formally define the difficulty of a GUI manipulation event. After implementing a case study application, we conducted experiments to measure the event handling latency for GUI manipulation events of varying difficulties. During our investigation of the run-time performance of the Swing and Thinlet GUI creation frameworks, we also measured the CPU and memory consumption of our candidate application during the selected GUI manipulation events. Our experimental results indicate that Thinlet often outperformed Swing in terms of both event handling latency and memory consumption. However, Swing appears to be better suited, in terms of event handling latency and CPU consumption, for the construction of GUIs that require manipulations of high difficulty levels.
Quantitative evaluation of gender differences, cognitive development differences and software effectiveness for an elementary mathematics intelligent tutoring system
Authors: Ivon M. Arroyo
Venue:  (2003)

This dissertation presents results of a formative evaluation of AnimalWatch, an intelligent tutoring software system for 9&ndash;12 year-olds, which teaches whole numbers and fractions by adapting the difficulty of problems to students' performance. Results come from a macro-analysis of 350 students using AnimalWatch in two different schools during three years. Data from these studies were integrated to analyze the system's overall effectiveness, as well as gender and cognitive development differences in interactions with the system, particularly in relation to the help component. In general, it was found that students reduced their mistakes as they progressed in the tutoring session, and improved their attitudes towards mathematics after using the system. However, a rigorous study of the internal components of AnimalWatch showed that the system can be further improved to maximize its positive impact. Students saw too many easy problems, and this may explain the fact that they hardly reached the last topics in the system. In addition, students benefited differently from within the help component and the amount of help. An analysis of help effectiveness for students of different gender and cognitive development showed that girls in the provided help. On the other hand, boys of low cognitive development about the kinds of help they were willing to see, girls would obediently go through each of the hints provided.
A Review of Metrics for Knowledge Management Systems and Knowledge Management Initiatives
Authors: Atreyi Kankanhalli, Bernard C. Y. Tan
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Metrics are essential for the advancement of research and practice in an area. In knowledge management (KM), the process of measurement and development of metrics is made complex by the intangible nature of the knowledge asset. Further, the lack of standards for KM business metrics and the relative infancy of research on KM metrics points to a need for research in this area. This paper reviews KM metrics for research and practice and identifies areas where there is a gap in our understanding. It classifies existing research based on the units of evaluation such as user of KMS, KMS, project, KM process, KM initiative, and organization as a whole. The paper concludes by suggesting avenues for future research on KM and KMS metrics based on the gaps identified.
Using operational distributions to judge testing progress
Authors: Elaine J. Weyuker
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Although most software test data adequacy criteria proposed as a way to assess the progress of testing rely on the coverage of the code, the coverage of the specification, or the percentage of the input domain that has been exercised, none of these are really good indicators of how thoroughly the software has been tested. Instead we propose that the assessment be based on the percentage of the probability mass associated with the test suite. This requires that data be collected to determine how the software is used in practice over a period of time, so that this can be properly assessed. In that way a project is able to accurately determine how testing is progressing.
Abstract non-interference: parameterizing non-interference by abstract interpretation
Authors: Roberto Giacobazzi, Isabella Mastroeni
Venue: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2004)

In this paper we generalize the notion of non-interference making it parametric relatively to what an attacker can analyze about the input/output information flow. The idea is to consider attackers as data-flow analyzers, whose task is to reveal properties of confidential resources by analyzing public ones. This means that no unauthorized flow of information is possible from confidential to public data, relatively to the degree of precision of an attacker. We prove that this notion can be fully specified in standard abstract interpretation framework, making the degree of security of a program a property of its semantics. This provides a comprehensive account of non-interference features for language-based security. We introduce systematic methods for extracting attackers from programs, providing domain-theoretic characterizations of the most precise attackers which cannot violate the security of a given program. These methods allow us both to compare attackers and program secrecy by comparing the corresponding abstractions in the lattice of abstract interpretations, and to design automatic program certification tools for language-based security by abstract interpretation.
Design by similarity using transaction modeling and statistical techniques
Authors: Anas Kabbaj, Eduard Cerny, Michel Dagenais, François Bouthillier
Venue: Proceedings of the conference on European design automation (1991)

This paper presents a new VLSI design management system. Unlike existing systems it models and stores not only the design data but also a description of the design process itself. This information is accumulated and used to present the designer with alternative design methodologies and to suggest the most promising one, based on previous designs. Experimental results on 22 simple designs indicate that the system selected the most appropriate methodology in 81% of the cases.
Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman--Morrison Formula
Authors: R. Bru, J. Cerdán, J. Marín, J. Mas
Venue: SIAM Journal on Scientific Computing (2003)

Let Ax=b be a large, sparse, nonsymmetric system of linear equations. A new sparse approximate inverse preconditioning technique for such a class of systems is proposed. We show how the matrix A0-1 - A-1, where A0 is a nonsingular matrix whose inverse is known or easy to compute, can be factorized in the form $U\Omega V^T$ using the Sherman--Morrison formula. When this factorization process is done incompletely, an approximate factorization may be obtained and used as a preconditioner for Krylov iterative methods. For A0=sIn, where In is the identity matrix and s is a positive scalar, the existence of the preconditioner for M-matrices is proved. In addition, some numerical experiments obtained for a representative set of matrices are presented. Results show that our approach is comparable with other existing approximate inverse techniques.
Modeling virtual worlds in databases
Authors: Krzysztof Walczak, Wojciech Cellary
Venue: Information Processing Letters (2003)

A method of modeling virtual worlds in databases is presented. The virtual world model is conceptually divided into several distinct elements, which are separately represented in a database. The model permits to dynamically generate virtual scenes.
Recent progress on selected topics in database research: a report by nine young Chinese researchers working in the United States
Authors: Zhiyuan Chen, Chen Li, Jian Pei, Yufei Tao, Haixun Wang, Wei Wang, Jiong Yang, Jun Yang, Donghui Zhang
Venue: Journal of Computer Science and Technology (2003)

The study on database technologies, or more generally, the technologies of data and information management, is an important and active research field. Recently, many exciting results have been reported. In this fast growing field, Chinese researchers play more and more active roles. Research papers from Chinese scholars, both in China and abroad, appear in prestigious academic forums.In this paper, we, nine young Chinese researchers working in the United States, present concise surveys and report our recent progress on the selected fields that we are working on. Although the paper covers only a small number of topics and the selection of the topics is far from balanced, we hope that such an effort would attract more and more researchers, especially those in China, to enter the frontiers of database research and promote collaborations. For the obvious reason, the authors are listed alphabetically, while the sections are arranged in the order of the author list.
A System for Change Documentation Based on a Spatiotemporal Database
Authors: M. A. Peerbocus, C. Bauzer Medeiros, G. Jomier, A. Voisard
Venue: Geoinformatica (2004)

The evolution of geographic phenomena has been one of the concerns of spatiotemporal database research. However, in a large spectrum of geographical applications, users need more than a mere representation of data evolution. For instance, in urban management applications&mdash;e.g., cadastral evolution&mdash;users often need to know why, how, and by whom certain changes have been performed as well as their possible impact on the environment. Answers to such queries are not possible unless supplementary information concerning real world events is associated with the corresponding changes in the database and is managed efficiently. This paper proposes a solution to this problem, which is based on extending a spatiotemporal database with a mechanism for managing documentation on the evolution of geographic information. This solution has been implemented in a GIS-based prototype, which is also discussed in the paper.
Updating the Self-Scaling Symmetric Rank One Algorithm with Limited Memory for Large-Scale Unconstrained Optimization
Authors: Sun Linping
Venue: Computational Optimization and Applications (2004)

A new limited memory quasi-Newton algorithm is developed, in which the self-scaling symmetric rank one update with Davidon's optimal condition is applied. Preliminary numerical tests show that the new algorithm is very efficient for large-scale problems as well as general nonlinear optimization.
On Arithmetic Progressions of Cycle Lengths in Graphs
Authors: Jacques Verstraëte
Venue: Combinatorics, Probability and Computing (2000)

A question recently posed by H&auml;ggkvist and Scott asked whether or not there exists a constant c such that, if G is a graph of minimum degree ck, then G contains cycles of k consecutive even lengths. In this paper we answer the question by proving that, for k > 2, a bipartite graph of average degree at least 4k and girth g contains cycles of (g&#x002F;2 &minus; 1)k consecutive even lengths. We also obtain a short proof of the theorem of Bondy and Simonovits, that a graph of order n and size at least 8(k &minus; 1)n1+1&#x002F;k has a cycle of length 2k.
On the complexity of schema inference from web pages in the presence of nullable data attributes
Authors: Guizhen Yang, I. V. Ramakrishnan, Michael Kifer
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

An increasingly large number of Web pages are machine-generated by filling in templates with data stored in backend databases. These templates can be viewed as the implicit schemas of those Web pages. The ability to infer the implicit schema from a collection of Web pages is important for scalable data extraction, since the inferred schema can be used to automatically identify schema attributes that are "encoded" in Web pages.However, the task of inferring a "good" schema is complicated due to the existence of nullable (missing) data attributes. Usually if an attribute contains a null value, then it will be omitted in the generated Web page, giving rise to different variations and permutations of layout structures in Web pages that are generated from the same template.In this paper we investigate the complexity of schema inference from Web pages in the presence of nullable data attributes. We introduce the notion of unambiguity as a quality measure for inferred schemas and prove that the problem of inferring "good" (unambiguous) schemas is NP-complete. Our complexity results imply that ambiguity resolution is one of the root causes of the computational difficulty underlying schema inference from Web pages.
Visual Exploration of Large Relational Data Sets through 3D Projections and Footprint Splatting
Authors: Li Yang
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

This paper discusses 3D visualization and interactive exploration of large relational data sets through the integration of several well-chosen multidimensional data visualization techniques and for the purpose of visual data mining and exploratory data analysis. The basic idea is to combine the techniques of grand tour, direct volume rendering, and data aggregation in databases to deal with both the high dimensionality of data and a large number of relational records. Each technique has been enhanced or modified for this application. Specifically, positions of data clusters are used to decide the path of a grand tour. This cluster-guided tour makes intercluster-distance-preserving projections in which data clusters are displayed as separate as possible. A tetrahedral mapping method applied to cluster centroids helps in choosing interesting cluster-guided projections. Multidimensional footprint splatting is used to directly render large relational data sets. This approach abandons the rendering techniques that enhance 3D realism and focuses on how to efficiently produce real-time explanatory images that give comprehensive insights into global features such as data clusters and holes. Examples are given where the techniques are applied to large (more than a million records) relational data sets.
Particle filters for mixture models with an unknown number of components
Authors: Paul Fearnhead
Venue: Statistics and Computing (2004)

We consider the analysis of data under mixture models where the number of components in the mixture is unknown. We concentrate on mixture Dirichlet process models, and in particular we consider such models under conjugate priors. This conjugacy enables us to integrate out many of the parameters in the model, and to discretize the posterior distribution. Particle filters are particularly well suited to such discrete problems, and we propose the use of the particle filter of Fearnhead and Clifford for this problem. The performance of this particle filter, when analyzing both simulated and real data from a Gaussian mixture model, is uniformly better than the particle filter algorithm of Chen and Liu. In many situations it outperforms a Gibbs Sampler. We also show how models without the required amount of conjugacy can be efficiently analyzed by the same particle filter algorithm.
What makes a Web site popular?
Authors: Petros Kavassalis, Stelios Lelis, Mahmoud Rafea, Seif Haridi
Venue: Communications of the ACM (2004)

To ensure a constant increase in user interest, clicks, recommendations, loyalty, and market share, first understand the information flows and connection networks surrounding each Web site in cyberspace.
A User-driven and Quality-oriented Visualization for Mining Association Rules
Authors: Julien Blanchard, Fabrice Guillet, Henri Briand
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

On account of the enormous amounts of rules that canbe produced by data mining algorithms, knowledgevalidation is one of the most problematic steps in anassociation rule discovery process.In order to findrelevant knowledge for decision-making, the user needs toreally rummage through the rules.Visualization can bevery beneficial to support him/her in this task byimproving the intelligibility of the large rule sets andenabling the user to navigate inside them.In this article,we propose to answer the association rule validationproblem by designing a human-centered visualizationmethod for the rule rummaging task.This new approachbased on a specific rummaging model relies on ruleinterestingness measures and on interactive rule subsetfocusing and mining.We have implemented ourrepresentation by developing a first experimentalprototype called ARVis.
Symbolic algorithms for embedded system design
Authors: Giovanni De Micheli
Venue:  (2003)

The growing market of digital signal processing and multi-media applications requires development of complex embedded systems with significant data-path portions. However, current hardware synthesis and software optimizations tools and methodologies do not support arithmetic-level optimizations necessary for data intensive applications. In particular, most high-level synthesis tools cannot automatically synthesize data paths such that complex arithmetic library blocks are intelligently used. Thus, the data paths of such circuits are often manually designed and mapped to pre-optimized library elements. Similarly, current compilers and software optimization methods are frequently incapable of optimizations required by software designers. Namely, most high-level arithmetic optimizations and use of complex instructions and pre-optimized embedded library functions are left to the designers' ingenuity. Furthermore, a growing number of embedded systems are using application-specific embedded processors. The design of these processors requires manual specialization of processors based on an application. The new complex instructions added to the application specific processor are used by manual insertion of intrinsic functions in the computation intensive sections of the code. In this thesis, symbolic polynomial manipulation techniques are used to develop algorithms, tools, and methodologies that cover all aspects of embedded systems design including hardware, software, and processor design. High-level data-path synthesis, embedded-software optimization, and application specific embedded processor design are automated by using algorithms from symbolic computer algebra that enable high-level arithmetic optimizations. Results of the high-level data-path synthesis tool show significant improvements in delay and area of the synthesized circuits compared to standalone commercial high-level synthesis tools. The algorithmic-level description of a set of examples is optimized for a portable embedded system using the software optimization methodology. In addition to improving productivity, the number of instructions and memory accesses are lowered and thus the system power consumption is reduced. Finally, new instructions are automatically added to configurable processors to reduce execution time and efficiently specialize embedded processors for a given set of applications.
X4CP32: A New Parallel/Reconfigurable General-Purpose Processor
Authors: Rodrigo Soares, Arnaldo Azevedo, Ivan Saraiva Silva
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

The X4CP32 is a parallel/reconfigurable microprocessor with 2 programming levels. Although itis a general-purpose microprocessor, it has the reliable performance of a reconfigurable architecture. This paper exposes its architecture and programming levels, and discusses the powerful interaction between parallel programming and reconfiguration. It shows twoperformance-optimized implementations of matrix multiplication using both parallel and reconfigurable paradigms and a parallel implementation of miner intelligent agents.