ppxscal/embedding_network huggingface dataset:
Human Pacman: a sensing-based mobile entertainment system with ubiquitous computing and tangible interaction
Authors: Adrian David Cheok, Siew Wan Fong, Kok Hwee Goh, Xubo Yang, Wei Liu, Farzam Farzbiz
Venue: Proceedings of the 2nd workshop on Network and system support for games (2003)

Human Pacman is an interactive ubiquitous and mobile entertainment system that is built upon position and perspective sensing via Global Positioning System and inertia sensors; and tangible human-computer interfacing with the use of Bluetooth and capacitive sensors. Although these sensing-based subsystems are weaved into the fabric of the game and are therefore translucent to players, they are nevertheless the technical enabling forces behind Human Pacman. The game strives to bring the computer gaming experience to a new level of emotional and sensory gratification by embedding the natural physical world ubiquitously and seamlessly with a fantasy virtual playground. We have progressed from the old days of 2D arcade Pacman on screens, with incremental development, to the popular 3D game console Pacman, and the recent mobile online Pacman. With our novel Human Pacman, we have a physical role-playing computer fantasy together with real human-social and mobile-gaming that emphasizes on collaboration and competition between players in a wide outdoor physical area that allows natural wide-area human-physical movements. Pacmen and Ghosts are now real human players in the real world experiencing mixed computer graphics fantasy-reality provided by using wearable computers that are equipped with GPS and inertia sensors for players' position and perspective tracking. Virtual cookies and actual tangible physical objects with Bluetooth devices and capacitive sensors are incorporated into the game play to provide novel experiences of seamless transitions between real and virtual worlds. In short, we believe Human Pacman is pioneering a new form of gaming that is based on sensing technology and anchored on physicality, mobility, social interaction, and ubiquitous computing.
A New Proxy Caching Scheme for Parallel Video Servers
Authors: Hao Chen, Hai Jin, Jianhua Sun, Xiaofei Liao, Dafu Deng
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

In this paper, we propose an IPC (Intra-movie Popularity-based Caching) scheme for cachingcontinuous multimedia data on proxy server. In this scheme, according to the different access patterns of clients, both the access number and the access duration are taken as two important parameters for the caching scheme design and implementation. Our simulation results show that our proposed caching scheme outperforms other known caching schemes in hit rate, replacement counts and network traffic between video server and proxy server.
Memory Management for Real-Time Java: An Efficient Solution using Hardware Support
Authors: Teresa Higuera, Valérie Issarny, Michel Banâtre, Frédéric Parain
Venue: Real-Time Systems (2004)

This paper addresses the issue of improving the performance of memory management for real-time Java applications, building upon the real-time specification for Java (RTSJ) from the Real-Time Java Expert Group. In a first step, a collecting dynamic memory solution including both a real-time garbage collector and region-based memory management, is proposed. A thorough analysis of the parameters influencing the performance of write barriers in memory management, together with ways of improvement are then presented. Finally, the implementation of a memory management solution compliant with the RTSJ and integrating the proposed improvements is sketched.
The ten commandments for global electronic commerce success in small business
Authors: Nabeel A. Y. Al-Qirim
Venue: Managing globally with information technology (2003)

Small to medium-sized enterprises (SMEs) contribute significantly to national economies and employment levels and represent a viable source for inventions and innovations. The emergence of electronic commerce in the early 90's could provide different opportunities to the small business sector to overcome its inadequacies. However, in view of the electronic commerce/business (EC) literature in organizations in general and in SMEs specifically, EC research is scarce. Available research portrays a gloomy picture about EC uptake and use by SMEs. Therefore, this chapter attempts, by reviewing recent EC research, to depict an agenda for EC success in SMEs made up often influencing factors. Thus, an attempt is made to develop deeper understanding about the factors influencing EC success in SMEs. By following the suggested guidelines in this chapter, SMEs would be in a better position to assess the viability of the new EC perspective to their organizations. The same factors are highly important to researchers, SMEs, professionals (including educational institutions) and policymakers in driving SMEs and EC forward.
Urban planning for low-income groups with developed optimization models
Authors: Adel R. Awad, Mohamed T. Aboul-Ela
Venue: Advances in Engineering Software (2003)

This article presents a methodology and new technique for residential land planning for low-income groups. Several unit design modules for the residential area are suggested and a cost optimization model for obtaining the optimum physical design of one module satisfying the geometric, density, and other constraints has been formulated as a non-linear programming problem. The solution came through a relatively simplified Focus Search and Monte-Carlo Simulation techniques. A second model for the optimal design of the dwelling-layout has been developed with an objective function of maximization of lot dimensions and satisfying some constraints, most important of which is the affordability for low-income groups. The optimum design, based on this model, came by using the relatively simple computer-based Focus Search technique. A practical application of the two models for Syria is illustrated by an example about obtaining a residential neighborhood from several planning modules combined together. A case study revealed how a planner, can achieve directly the desired feasible and optimal design solutions, depending on these new planning techniques.
Prompt partial path optimization in MPLS networks
Authors: Dániel Orincsay, Balázs Szviatovszki, Géza Böhm
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

In this paper we evaluate approaches that allow the re-routing of a set of already established label switched paths (LSPs) in multiprotocol label switching (MPLS) networks when a new LSP demand faces constrained shortest path first failure. Two optimization algorithms are proposed: one is based on an integer linear programming formulation of the problem, while the other one is a heuristic method based on Dijkstra's shortest path first algorithm: We analyze the efficiency of our algorithms in a dynamic network environment. The simulation experiments show that our method significantly increases the total network throughput. We also investigate the limitations of the applicability of proposed methods considering their running time.
Wavelet-based signal approximation with genetic algorithms
Authors: Marc M. Lankhorst, Marten D. van der Laan, Wolfgang A. Halang
Venue: Systems Analysis Modelling Simulation (2003)

In this article, the usability of genetic algorithms for signal approximation is discussed. Due to recent developments in the field of signal approximation by wavelets, this work concentrates on signal approximation by wavelet-like functions. Signals are approximated by a finite linear combination of elementary functions and a genetic algorithm is employed to find the coefficients to such an approximation. The algorithm maintains a population of different approximations, encoded in the form of 'chromosomes'. From this population 'parents' are selected according to their 'fitness', and the 'children' that constitute the next generation are produced from these parents using mutation and crossover operators.Fitness functions employed to evaluate different approximations are the L1, L2, L4, and L∞ norms. Experiments are carried out on several test signals, using Gabor and spline wavelets, both to evaluate the quality of different fitness functions, encoding schemes, and operators, and to assess the usefulness of genetic algorithms in the realm of signal approximation.Although other existing methods are faster while providing comparable approximation quality, the algorithm offers a great deal of flexibility in terms of different elementary functions, fitness criteria, etc.
Level of Similarity: A Metric for Fault Collapsing
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

We describe a new approach to fault collapsing that extends fault collapsing based on fault equivalence and fault dominance. The new approach is based on a metric called level of similarity between faults. Informally, a fault fj is said to be similar to a fault fi with a level of similarity SLi,j ¡ ¿ 1 if a fraction SLi,j of the tests for fi also detect fj. If SLi,j is high enough, one may exclude fj from the set of target faults and rely on the test for fi (and tests for other faults) to detect fj. We describe a procedure for fault collapsing based on the level of similarity, and study its effectiveness experimentally.
Agent Architectures to Support Collaborative Processes
Authors: I. T. Hawryszkiewycz
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

This paper proposes an approach to developing agents that can be reused in a number of collaborative applications. It particularly concerns those applications that evolve rapidly over time and need continual reconfiguration. This particularly applies to knowledge intensive processes in virtual environments, which requires quick reconfiguration to make then sustainable. It bases the agents architecture on a collaborative metamodel, which provides the ontology for building reusable software agents within collaborative environments. The paper describes the collaborative metamodel, an example and a prototype implementation and ways to integrate the model with agent systems.
FUNCTIONAL PEARL: Unfolding pointer algorithms
Authors: Richard S. Bird
Venue: Journal of Functional Programming (2001)

A fair amount has been written on the subject of reasoning about pointer algorithms. There was a peak about 1980 when everyone seemed to be tackling the formal verification of the Schorr&ndash;Waite marking algorithm, including Gries (1979, Morris (1982) and Topor (1979). Bornat (2000) writes: &ldquo;The Schorr&ndash;Waite algorithm is the first mountain that any formalism for pointer aliasing should climb&rdquo;. Then it went more or less quiet for a while, but in the last few years there has been a resurgence of interest, driven by new ideas in relational algebras (M&ouml;eller, 1993), in data refinement Butler (1999), in type theory (Hofmann, 2000; Walker and Morrisett, 2000), in novel kinds of assertion (Reynolds, 2000), and by the demands of mechanised reasoning (Bornat, 2000). Most approaches end up being based in the Floyd&ndash;Dijkstra&ndash;Hoare tradition with loops and invariant assertions. To be sure, when dealing with any recursively-defined linked structure some declarative notation has to be brought in to specify the problem, but no one to my knowledge has advocated a purely functional approach throughout. Mason (1988) comes close, but his Lisp expressions can be very impure. M&ouml;ller (1999) also exploits an algebraic approach, and the structure of his paper has much in common with what follows.This pearl explores the possibility of a simple functional approach to pointer manipulation algorithms.
Fast and accurate text classification via multiple linear discriminant projections
Authors: Soumen Chakrabarti, Shourya Roy, Mahesh V. Soundalgekar
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2003)

Abstract.Support vector machines (SVMs) have shown superb performance for text classification tasks. They are accurate, robust, and quick to apply to test instances. Their only potential drawback is their training time and memory requirement. For n training instances held in memory, the best-known SVM implementations take time proportional to n a, where a is typically between 1.8 and 2.1. SVMs have been trained on data sets with several thousand instances, but Web directories today contain millions of instances that are valuable for mapping billions of Web pages into Yahoo!-like directories. We present SIMPL, a nearly linear-time classification algorithm that mimics the strengths of SVMs while avoiding the training bottleneck. It uses Fisher's linear discriminant, a classical tool from statistical pattern recognition, to project training instances to a carefully selected low-dimensional subspace before inducing a decision tree on the projected instances. SIMPL uses efficient sequential scans and sorts and is comparable in speed and memory scalability to widely used naive Bayes (NB) classifiers, but it beats NB accuracy decisively. It not only approaches and sometimes exceeds SVM accuracy, but also beats the running time of a popular SVM implementation by orders of magnitude. While describing SIMPL, we make a detailed experimental comparison of SVM-generated discriminants with Fisher's discriminants, and we also report on an analysis of the cache performance of a popular SVM implementation. Our analysis shows that SIMPL has the potential to be the method of choice for practitioners who want the accuracy of SVMs and the simplicity and speed of naive Bayes classifiers.
Towards The Complete Elimination of Gate/Switch Level Simulations
Authors: Narayanan Krishnamurthy, Jayanta Bhadra, Magdy S. Abadir, Jacob A. Abraham
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper presents the reasoning behind eliminatingfull-chip gate/switch-level simulations for microprocessors/digital system designs and utilizing RTL models forthe purpose, provided formal boolean equivalence betweenRTL and gate/switch-level models have been establishedusing symbolic simulation for all blocks that comprise thechip. No logic bug should go undetected if only RTLmodels are used for full chip simulations provided existingdesign methodologies are enhanced to incorporate aconstraints checking ow coupled with a rigorous circuitmetastability/contention prevention flow.
An Odyssey into Local Refinement and Multilevel Preconditioning III: Implementation and Numerical Experiments
Authors: Burak Aksoylu, Stephen Bond, Michael Holst
Venue: SIAM Journal on Scientific Computing (2003)

In this paper, we examine a number of additive and multiplicative multilevel iterative methods and preconditioners in the setting of two-dimensional local mesh refinement. While standard multilevel methods are effective for uniform refinement-based discretizations of elliptic equations, they tend to be less effective for algebraic systems, which arise from discretizations on locally refined meshes, losing their optimal behavior in both storage and computational complexity. Our primary focus here is on Bramble, Pasciak, and Xu (BPX)-style additive and multiplicative multilevel preconditioners, and on various stabilizations of the additive and multiplicative hierarchical basis (HB) method, and their use in the local mesh refinement setting. In parts I and II of this trilogy, it was shown that both BPX and wavelet stabilizations of HB have uniformly bounded condition numbers on several classes of locally refined two- and three-dimensional meshes based on fairly standard (and easily implementable) red and red-green mesh refinement algorithms. In this third part of the trilogy, we describe in detail the implementation of these types of algorithms, including detailed discussions of the data structures and traversal algorithms we employ for obtaining optimal storage and computational complexity in our implementations. We show how each of the algorithms can be implemented using standard data types, available in languages such as C and FORTRAN, so that the resulting algorithms have optimal (linear) storage requirements, and so that the resulting multilevel method or preconditioner can be applied with optimal (linear) computational costs. We have successfully used these data structure ideas for both MATLAB and C implementations using the FEtk, an open source finite element software package. We finish the paper with a sequence of numerical experiments illustrating the effectiveness of a number of BPX and stabilized HB variants for several examples requiring local refinement.
Hybrid Error Control Mechanism for Wireless ATM Based on Traffic Type
Authors: Yanying Ren, Wenjun Zhang, Bin Wang
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Since wireless channel is always band-limited with multi-path fading and highly burst errors, flexible error control is needed in wireless asynchronous transfer mode (WATM) networks. This paper proposes a hybrid automatic repeat request (HARQ) architecture which has on-demand quality of services (QoS). By choosing different options in the architecture, we get different error control schemes. In this paper, we investigate the performance of three different errorcontrol schemes, namely HARQ, HARQ with different redundancy, and adaptive HARQ withtraffic-type-dependent redundancy. The simulation results show that the HARQ with FEC adaptation offers the best performance.
Illustrating computer hardware concepts using PIC-based projects
Authors: Nurul I. Sarkar, Trevor M. Craig
Venue: ACM SIGCSE Bulletin (2004)

We are developing a series of interesting projects that give students a hands-on introduction to computer hardware concepts. Our projects are designed around the PIC16F84, a powerful 8-bit microcontroller chip that sells for less than $10. The projects are suitable for classroom use in introductory level courses about computer hardware. The effectiveness of these projects has been evaluated both formally by students (student evaluation forms) and informally - through discussion within the teaching team. The feedback from students indicates that the development and implementation of the projects were successful. This paper describes the details of the projects completed to date, their overall effectiveness and our plans for further projects.
SDL Specification of a Security Architecture for WorldFIP
Authors: Miguel León Chávez, Francisco Rodríguez Henríquez
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

This paper discusses the security in the fieldbuses,and presents a security architecture for the centralizedfieldbuses, such as WorldFIP. The discussion takesinto account, on one hand, the security servicesdefined by the OSI Security Architecture, and on theother hand, the security mechanisms defined byWorldFIP. The discussion shows that there are twocritical points for attacking this network: the BusArbitrator and the bus. This paper presents then thespecification, using the Specification and DescriptionLanguage (SDL), of a security architecture forWorldFIP based on the RC4 algorithm, which is alightweight cryptographic stream cipher.
Caveats from a dyed-in-the-wool futurist
Authors: Rosemary Mountain
Venue: Organised Sound (2001)

It is recommended that we collaborate with science and industry in the search for technological innovation in media-related fields, in order to help design a future environment that will benefit a healthy musical culture. Since those of us who are already immersed in the technology are accustomed to its less attractive attributes as well as its potentials, we can consult with colleagues about essential characteristics of the old-fashioned world which we and they do not want to lose. With our collective imaginations, it should be possible to preserve many of these aspects by transforming them, with sensitivity, to fit new contexts. A few diverse examples are given of features that might be considered both attractive and endangered. Suggestions ranging from the practical to the whimsical illustrate some possibilities for injecting the essence of these experiences into a more technological world, thereby enriching it.
Adaptive tree similarity learning for image retrieval
Authors: Tao Wang, Yong Rui, Shi-min Hu, Jia-guang Sun
Venue: Multimedia Systems (2003)

Learning-enhanced relevance feedback is one of the most promising and active research directions in content-based image retrieval in recent years. However, the existing approaches either require prior knowledge of the data or converge slowly and are thus not coneffective. Motivated by the successful history of optimal adaptive filters, we present a new approach to interactive image retrieval based on an adaptive tree similarity model to solve these difficulties. The proposed tree model is a hierarchical nonlinear Boolean representation of a user query concept. Each path of the tree is a clustering pattern of the feedback samples, which is small enough and local in the feature space that it can be approximated by a linear model nicely. Because of the linearity, the parameters of the similartiy model are better learned by the optimal adaptive filter, which does not require any prior knowledge of the data and supports incremental learning with a fast convergence rate. The proposed approach is simple to implement and achieves better performance than most approaches. To illustrate the performance of the proposed approach, extensive experiments have been carded out on a large heterogeneous image collection with 17,000 images, which render promising results on a wide variety of queries.
Inference via Fuzzy Belief Petri Nets
Authors: Carl G. Looney, Lily R. Liang
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

The fuzzy belief Petri net we propose in this paper propagates fuzzy beliefs from observations at nodes that represent measured parameters to fuzzy beliefs of the truths of parameters at hidden and decision nodes. The fuzzy influences spread from the observation nodes throughout our new enhanced bidirectional fuzzy belief Petri net. Compared with Bayesian belief networks, it is simpler and faster in that it needs neither the conditional probability tables that are difficult or impossible to obtain nor is it overly constrained by the mathematical axiomatic structure that makes Bayesian belief inferencing NP-hard. Compared with our previous fuzzy belief networks, it is more flexible in modeling particular situations. We develop here the concept, data structures and algorithm for this network, while future work will make comparative runs.
Improving image retrieval effectiveness in query-by-example environment
Authors: Khanh Vu, Kien A. Hua, Ning Jiang
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Query-by-example is the most popular query model for today's image retrieval systems. A typical query image contains not only relevant objects (e.g., Eiffel Tower), but also irrelevant image areas (e.g., the background). The latter, referred to as noise in this paper, has limited the effectiveness of existing image retrieval systems. We present here a similarity model for noise-free queries (NFQs), and investigate indexing techniques for this new environment. Our query model is more expressive than the standard query-by-example. The user can draw a contour around a number of objects to specify spatial (relative distance) and scaling (relative size) constraints among them, or use separate contours to disassociate these objects. Our experimental results confirm that traditional approaches, such as Local Color Histogram and Correlogram, suffer from noisy queries. In contrast, our method can leverage NFQs to offer significantly better performance. This is achieved using only a fraction of the storage overhead required by the compared techniques.