ppxscal/embedding_network huggingface dataset:
A Peer-Review Based Approach to Teaching Object-Oriented Framework Development
Authors: Amir Zeid, Moemen Elswidi
Venue: Proceedings of the 18th Conference on Software Engineering Education & Training (2005)

The concept of object-oriented frameworks is not easy to grasp. As a result of the complex nature of frameworks, teaching framework development is a challenging task. Using traditional software engineering methodologies for teaching practical framework development in an academic environment may not be helpful. In addition, there is no standard process to teach framework development. In this paper, we propose a new technique for teaching framework development. We introduce PBA, (a Peer-Review Based Approach) that helps students grasp the concept of framework, conceive the importance of developing frameworks and ensure a well designed and better quality delivered frameworks. We provide a comprehensive presentation of the process; and also present our own experience trying to put the new process into practice.
A Web-Based Bookmark Tool with Ontological Approach for Knowledge Sharing of Special Interest Groups
Authors: Jin Tan David Yang, Wu Lin Lee, Chun-Yen Tsai
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

The purpose of this study is to implement a webbased bookmark (WBB) tool with ontological approach for knowledge sharing of special interest groups (SIG). People at across levels are staggered by the findings and conclusions of thousands of other papers. Yet specialization becomes increasingly necessary for progress, and the effort to bridge between members among a SIG is correspondingly superficial. The ontological approach in this study provides domain-oriented vocabularies for recomendation of the new information to be allocated. The methodology is based on development of RDF/RDFS and application of the Jena API. The contribution of this study has two facets: (a). It extends the bookmark tool into web-based for knowledge sharing; (b). It consists of intelligent algorithm in terms of recommendations of new information allocation by matching the existing domain ontology. Finally, the implications of this study are also included.
Online Latent Variable Detection in Sensor Networks
Authors: Jimeng Sun, Spiros Papadimitriou, Christos Faloutsos
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Sensor networks attract increasing interest, for a broad range of applications. Given a sensor network, one key issue becomes how to utilize it efficiently and effectively. In particular, how can we detect the underlying correlations (latent variables) among many co-evolving sensor measurements? Can we do it incrementally? We present a system that can (1) collect the measurements from the real wireless sensors; (2) process them in real-time; and (3) determine the correlations (latent variables) among the sensor streams on the fly.
Development of distributed bioinformatics applications with GMP: Research Articles
Authors: Bertil Schmidt, Lin Feng, Amey Laud, Yusdi Santoso
Venue: Concurrency and Computation: Practice Experience (2004)

We present the design and use of gMP as a tool for developing distributed bioinformatics applications. gMP is a purely Java-based interface that adds MPI-like message-passing and collective communication to the genomics Research Network Architecture (gRNA). The gRNA is a highly programmable, modular environment specifically designed to invigorate the development of genome-centric tools for life science research. We demonstrate the development of a distributed application to detect regulatory elements using correlation with gene expression data. Its implementation with gMP leads to significant runtime savings on our distributed gRNA system. Copyright &copy; 2004 John Wiley & Sons, Ltd.
On primitivity and reduction for flag-transitive symmetric designs
Authors: Eugenia O'Reilly Regueiro
Venue: Journal of Combinatorial Theory Series A (2005)

We present some results on flag-transitive symmetric designs. First we see what conditions are necessary for a symmetric design to admit an imprimitive, flag-transitive automorphism group. Then we move on to study the possibilities for a primitive, flag-transitive automorphism group, and prove that for λ ≤ 3, the group must be affine or almost simple, and finally we analyse the case in which a biplane admits a primitive, flag-transitive automorphism group of affine type.
A Scalable Dual Mode Arithmetic Unit for Public Key Cryptosystems
Authors: Francis Crowe, Alan Daly, William Marnane
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Elliptic Curve Cryptosystems (ECC) have become popular in recent years due to their smaller key sizes than traditional public key schemes such as RSA. However the gap between the size of these systems is increasing as security requirements become more demanding due to cryptanalytic advances. At current security levels of 80 bits, the corresponding key sizes for ECC and RSA are 160 and 1,024 bits respectively. Although the ECC key size is attractive for embedded applications, the popularity of RSA means that it will remain in legacy applications for the foreseeable future. This paper proposes a dual mode arithmetic unit capable of supporting the underlying field operations performed by both the ECC and RSA public key schemes. A hardware optimised version of the Montgomery algorithm is employed to perform modular multiplication efficiently. The disparity in key sizes is addressed by combining the dual processors to operate in parallel for ECC or in a pipelined series for RSA.
Market equilibrium via the excess demand function
Authors: Bruno Codenotti, Benton McCune, Kasturi Varadarajan
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete version of tâtonnement, and prove that it converges to an approximate equilibrium in polynomial time. This is the first polynomial-time approximation scheme based on a simple atonnement process. It was only recently shown, using vastly more sophisticated techniques, that an approximate equilibrium for this class of economies is computable in polynomial time. (ii) For Fisher's model, we extend the frontier of tractability by developing a polynomial-time algorithm that applies well beyond the homothetic case and the gross substitutes case. (iii) For production economies, we obtain the first polynomial-time algorithms for computing an approximate equilibrium when the consumers' side of the economy satisfies weak gross substitutability and the producers' side is restricted to positive production.
ELA&mdash;A new Approach for Learning Agents
Authors: Fabrício Enembreck, Jean-Paul Brathès
Venue: Autonomous Agents and Multi-Agent Systems (2005)

In this paper we discuss a new incremental learning approach used to implement adaptive behavior in autonomous agents. Adaptive agents must increase their performance based on experience using some learning approach. Often, incremental learning techniques like memory-based reasoning (MBR) are used. However, traditional MBR algorithms require an adequate (generally complex) measure of similarity, need much data and spend much time for computing similarities between examples. Such problems are unacceptable for autonomous agents that live in very dynamic environments, because they have little time to make decisions. Our approach does not use similarity measures between examples, classifies examples very fast and can compact data. We represent data as a concept graph (CG), each node representing a partition of the data. We propose an algorithm that uses the partitions to classify new examples. We compare our results with other techniques and conclude that the method performs quite well. Finally, we apply the approach to an application of adaptive agents for personalizing web search.
Personalizing the visitor experience with dynamic information systems
Authors: Sara Czyzewicz
Venue: Journal of Computing Sciences in Colleges (2005)

Informal education centers, such as museums and aquaria, serve as important educational resources for the broader community and therefore must accommodate a vast diversity of visitors. This diversity typically includes differences in culture, abilities, and motivational interests and is difficult to support when presenting information using standard presentation media such as graphics panel, audio tours and video presentations. The main problem with these media is that the same information is presented to every visitor, only limited information can be presented given the real estate and time available, and therefore the visitor is limited in the information they have access to. In this project, a personalization architecture system was developed for a kiosk style information system for public aquaria in which the interface is adapted based on a visitors personal preferences, therefore supporting a person's cultural and motivation differences, interests and abilities and helping them find more in depth information about the specimens and processes they are most interested in.
Ontology-Based Semantic Indexing for MPEG-7 and TV-Anytime Audiovisual Content
Authors: Chrisa Tsinaraki, Panagiotis Polydoros, Fotis Kazasis, Stavros Christodoulakis
Venue: Multimedia Tools and Applications (2005)

In this paper, we describe a framework that we have developed for the support of ontology-based semantic indexing and retrieval of audiovisual content following the MPEG-7 and TV-Anytime standard specifications for metadata descriptions. Our work aims to provide a methodology to enhance the retrieval effectiveness of audiovisual content, while maintaining compatibility with the international multimedia standards.In our framework, domain-specific ontologies guide the definition of both the application-specific metadata and the instance-description metadata that describe the contents of audiovisual programs and/or their segments. The ontologies are also used in order to provide compatible descriptions in both audiovisual content standards (MPEG-7 and TV-Anytime) for the same content. This approach allows indexing compatibility and interoperability of TV-Anytime and digital library applications.We describe the design and implementation of a system supporting this framework. The components of the system include a segmentation tool for segmenting audiovisual information, which also provides ontology-based semantic indexing capabilities, and an appropriate API for semantic query support. An application testbed for the domain of soccer games has been developed on top of this system. An ontology for soccer games has been defined and used for indexing and retrieval of soccer games that have been stored in the system database.The methodology we developed opens up a wide opportunity for the creation of MPEG-7 and TV-Anytime services offering structured domain-specific ontologies that can be integrated to these standards for enhancing audiovisual content retrieval performance.
An Investigation into Professional Programmers' Mental Representations of Variables
Authors: Jorma Sajaniemi, Raquel Navarro Prieto
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Very little is known about professional programmers' mental representations of variables, yet this information is vital in designing effective tools for program comprehension. In order to find out what types of information programmers have about variables and their relations, we conducted a knowledge elicitation study where professional programmers studied programs and the resulting mental representations were elicited using card sorting and interviews. The mental representations were based on fourteen principles that can be organized in four main categories: domain-based, technology-based, execution-based, and strategy-based. Most frequent information types dealt with two execution-based criteria: behavior and utilization.
MAPNET: a .NET-Based mobile-agent platform
Authors: Dilyana Staneva, Denitsa Dobreva
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Mobile agent-based computing is an attractive model for organizing distributed computations. This paper reveals our experience in developing a specific implementation of this model: the MAPNET mobile-agent platform, based on the .NET Framework. The paper describes the basic functionality of the platform and focuses on the design and implementation of a MAPNET agent and core agent services. Brief directions when and how to use the platform are also given.
Book review: 1-2-3 Database Techniques by Dick Anderson and Bill Neil (Que Corporation, 1989)
Venue: ACM SIGSMALL/PC Notes (1991)

This book's objective is to provide users of 1-2-3 (versions 2.01, 2.2 amp; 3) with a tutorial which teachers 1-2-3 database design using a variety of 1-2-3's commands and functions - some made specifically for database management. Authors, Anderson and Weil, provide just enough of the database fundamentals for beginners (i. e., someone already having mastered 1-2-3 but lack experience with database applications) as well as advanced techniques (ex.: normalization) for intermediate and advanced database users and/or designers.
A correlation-spectral identification method for quasi-stationary time processes
Authors: A. D. Bushtruk, T. N. Bushtruk
Venue: Automation and Remote Control (2005)

Parametric identification algorithms are designed for a quasi-stationary linear filter, which is an adequate model for the formation of a quasi-stationary time process if noise is fed to the filter input.
Optimal automatic multi-pass shader partitioning by dynamic programming
Authors: Alan Heirich
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2005)

Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem that can be solved by any number of established techniques. One such technique, Dynamic Programming (DP), is commonly used for instruction scheduling and register allocation in the code generation phase of compilers. Since automatic partitioning occurs during the shader compilation process it is natural to ask whether DP is useful for shader partitioning as well as for code generation. This paper demonstrates that these problems are Markovian and can be solved by DP techniques. It presents a DP algorithm for shader partitioning that can be adapted for use with any GPU architecture. Unlike solutions produced by other techniques DP solutions are globally optimal. Experimental results on a set of test cases with a commercial prerelease compiler for a popular high level shading language showed a DP algorithm had an average runtime cost of O(n1.14966) which is less than O(n log n) on the region of interest in n. This demonstrates that efficient and optimal automatic shader partitioning can be an emergent byproduct of a DP-based code generator for a very high performance GPU.
Shunting of Passenger Train Units in a Railway Station
Authors: Richard Freling, Ramon M. Lentink, Leo G. Kroon, Dennis Huisman
Venue: Transportation Science (2005)

In this paper we introduce the problem of shunting passenger train units in a railway station. Shunting occurs whenever train units are temporarily not needed to operate a given timetable. We discuss several aspects of this problem and focus on two subproblems. We propose mathematical models for the problem and both subproblems, one of which is solved with a solution method based on column generation. Furthermore, we introduce a new efficient and speedy solution technique for pricing problems in column generation algorithms. Finally, we present computational results based on real-life instances from Netherlands Railways.
Geotensity constraint for 3D surface reconstruction
Authors: Atsuto Maki, Mutsumi Watanabe, Charles Wiles
Venue: Systems and Computers in Japan (2004)

This paper is about automatically reconstructing the full 3D surface of an object observed in motion by a single static camera. Based on the two paradigms, structure from motion and linear intensity subspaces, we introduce the geotensity constraint that governs the relationship between four or more images of a moving object, and argue that the constraint is more valid under object motion than the conventional one of constant brightness. We first show that it is possible in theory to solve for 3D surface structure for the case of a single point light source. We then propose to adapt the geotensity constraint to the case of multiple point light sources by mathematically segmenting the illumination space into multiple subspaces. The surface may or may not be textured. The theoretical propositions are investigated through experiments using both real and synthetic images. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(4): 72&ndash;83, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.1233
Experimental Result of Feature Extraction Method for Digital Traditional Japanese Crafting System
Authors: Kaoru Sugita, Tomoyuki Ishida, Akihiro Miyakawa, Leonard Barolli, Yoshitaka Shibata
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

In this paper, we show the experimental result of feature extraction method for digital traditional Japanese crafting system to provide a user with the desired presentation space. The quantitative feature values are extracted by using Visual Pattern Image Coding (VPIC). These values include the total number, the frequency, the dispersion rate and the deviation rate for different edges. The quantitative feature values for traditional Japanese crafting objects are registered in the multimedia database and the relation between Kansei words and the sensitive feature of traditional Japanese Crafting objects are analyzed by using the questionnaire. Then, the sensitive features are compared with the quantitative feature values. Through the above process, we can find the relation between the design pattern components and edge types using VPIC. We extract quantitative feature value by the VPIC system and evaluate its performance by test patterns and traditional fitting objects. The experimental results show that by finding the relation between the design pattern componentsand the edge types using the VPIC, the KRM can be realized
Intelligent lighting for a better gaming experience
Authors: Magy Seif El-Nasr, Joseph Zupko, Keith Miron
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Lighting assumes many aesthetic and communicative functions in game environments that affect attention, immersion, visibility, and emotions. Game environments are dynamic and highly unpredictable; lighting such experiences to achieve desired visual goals is a very challenging problem. Current lighting methods rely on static manual techniques, which require designers to anticipate and account for all possible situations and user actions. Alternatively, we have developed ELE (Expressive Lighting Engine) -- an intelligent lighting system that automatically sets and adjusts scene lighting in real-time to achieve desired aesthetic and communicative goals. In this paper, we discuss ELE and its utility in dynamically manipulating the lighting in a scene to direct attention, stimulate tension, and maintain visual continuity. ELE has been integrated within Unreal Tournament 2003. The videos shown at [14] shows a demonstration of a first person shooter game developed using the Unreal 2.0 engine, where ELE was configured to dynamically stimulate tension, while maintaining other visual goals.
Motion Synchronization in Virtual Environments with Shared Haptics and Large Time Delays
Authors: Joono Cheong, Silviu-Iulian Niculescu, Anuradha Annaswamy, Mandayam A. Srinivasan
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper deals with a synchronization scheme to achieve a high level of consistency in peer-to-peer based virtual environments (VEs) for shared haptics with large time delays. We mainly focus on the VEs with dynamic objects that show physically realistic behaviors. The synchronization scheme utilizes an advanced feedback controller to compensate for the state error between geographically separated sites. Using feedback control theory of time delay systems, the controller is shown to result in closed loop stability and robust to perturbations in the time delay. The maximum allowable delay is determined using stability analysis, which indicates the allowable bound on the communication delay for the system.
The tools of online community: the first five years of the trAce online writing centre
Authors: Sue Thomas
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

The trAce Writing and Technology Research Project grew out of a small research project called CyberWriting that established in 1995 in the Department of English Media Studies at Nottingham Trent University. It rapidly made close links with arts organisations in Australia and America and operated almost exclusively on the internet, researching information about internet-based writing resources of all kinds including fiction, poetry, hypertexts, cyberculture theory, conferences, journals, and webzines. In May 1996 trAce launched its own website and quickly became a popular and useful resource for the dissemination of information about writers and writing on the net. In 1997 it received a substantial grant from the Arts Council of England Lottery Fund and has continued to grow to the present day. This paper gives an account of the first five years of trAce, 1995-2000, and looks to the future from the vantage point of 2005.
Estimation of anatomical landmark positions from model of 3-dimensional foot by the FFD method
Authors: Hiroki Yahara, Naoki Higuma, Yukio Fukui, Seiichi Nishihara, Masaaki Mochimaru, Makiko Kouchi
Venue: Systems and Computers in Japan (2005)

This paper proposes a method of estimation of the anatomical landmarks that are needed in product design from point clouds of body shape measured by a three-dimensional scanner. The algorithm is described briefly. First, the standard model is defined as the average shape with anatomical landmarks calculated from multiple body data samples with given anatomical landmarks. Then, the matching transformation is applied to the standard model so that it fits the body shape data of the target model. The anatomical landmarks of the target body shape are estimated from the deformed standard model. Free-form deformation (FFD) is used as the matching transformation, in which the deformation control lattice coordinates are determined from an estimation formula derived by multiple regression analysis of the multiple body data sample. This method is applied to a foot model for shoe design. The effectiveness of the proposed method is verified by an experimental evaluation. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(6): 26&ndash;38, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20270