ppxscal/embedding_network huggingface dataset:
Positive periodic solutions of delay difference equations and applications in population dynamics
Authors: Wan-Tong Li, Hai-Feng Huo
Venue: Journal of Computational and Applied Mathematics (2005)

With the help of continuation theorem based on Mawhin's coincidence degree, the existence of a positive periodic solution of the delay difference equation x(k+1)=x(k) exp[F(k,x(k - τ1),.....,x(k - τn))] is studied. When these results are applied to some special delay population models, some new results are obtained.
Tackling the Complexity of Requirements Engineering Process Improvement by Partitioning the Improvement Task
Authors: Uolevi Nikula, Jorma Sajaniemi
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

Software process improvement is a complex and expensive endeavor requiring extensive resources and long term commitment. In the present study software process improvement (SPI) problems in small organizations were tackled by dividing the overall effort into three subtopics: technical infrastructure, working practices, and management infrastructure. Partitioning the SPI efforts into these three subtopics makes it apparent that all of these topics do not need to be tackled in the same way but some tasks can, e.g., be outsourced. In this paper the results of an investigation into the use of the model above in requirements engineering (RE) process improvement are reported from three industrial case studies. A domain specific method was constructed independently of the utilizing companies, i.e., outsourced, and it was then used in SPI efforts in the companies to establish a solid infrastructure for basic RE in a short period of time, with limited resources, and without previous expertise in RE. It is argued that the suggested partitioning can both lower the threshold for initiating software process improvement efforts in industry and increase the likelihood of successfully completing them.
An Efficient Hierarchical Key Management Scheme Using Symmetric Encryptions
Authors: Chu-Hsing Lin, Wei Lee, Yi-Kang Ho
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

The concept of hierarchical access control is that a higher privileged user (or higher level) has the ability to access data in lower privileged user (or lower level). Hierarchical key management scheme is used to accomplish this concept. Each user has its secret key which is used to protect data. User at higher level can compute the secret key of an user at lower level, but the counter measurement is infeasible. There have been many proposed solutions. In this paper, we introduce an efficient way using symmetric key cryptosystem to reduce the time of generating and deriving keys in hierarchical key management, and we show that the proposed scheme retains the same security level.
A Projector-Camera System with Real-Time Photometric Adaptation for Dynamic Environments
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Projection systems can be used to implement augmented reality, as well as to create both displays and interfaces on ordinary surfaces. Ordinary surfaces have varyingreflectance, color, and geometry. These variations can be accounted for by integrating a camera into the projection system and applying methods from computer vision. The methods currently applied are fundamentally limited since they assume the camera, projector, and scene are static. In this paper, we describe a technique for photometrically adaptive projection that makes it possible to handle a dynamic environment. We begin by presenting a co-axial projector-camera system whose geometric correspondence is independent of changes in the environment. To handle photometric changes, our method uses the errors between the desired and measured appearance of the projected image. A key novel aspect of our algorithm is that we combine a physics-based model with dynamic feedback to achieve real time adaptation to the changing environment. We verify our algorithm through a wide variety of experiments. We show that it is accurate and runs in real-time. Our algorithm can be applied broadly to assist HCI, visualization, shape recovery, and entertainment applications.
Towards a Demand Driven, Autonomous Processing and Streaming Architecture
Authors: Gerald Friedland, Karl Pauls
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

This paper describes SOPA, a component framework that is an essential part of the lecture recording system E-Chalk. It envisages a general processing and streaming architecture featuring autonomous assembly of stream-processing components. The goal is to provide an easy to use framework where dynamically organized processing graphs are constructed from components of various distributed sources. Based on state-of-the-art solutions for component based software development, the system simplifies the implementation and configuration of multimedia streaming applications and associated tools. It supports stream synchronization transparently, while extending components are installed on the fly to meet existing requirements that may change at any time.
Interactive Surgical Simulation through Micro Dome System
Authors: Akihito Sano, Kenta Miyazaki, Masamichi Sakaguchi, Hideo Fujimoto, Shin-ichiro Goma, Hiroyoshi Takeuchi, Hidenori Sakai, Kei Fujita
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In the medical education, a surgery simulator which is effective to train the necessary skills is greatly expected in the current social context (e.g. kindness to animals). To realize an advanced surgery simulator, various technological issues should be overcome. In this research, we are working on the architecture of the total system what is in in the interface originally developed that united the elemental technologies to develop the surgical simulator. In this paper, we discuss the outline of the developed interface, physical and operating modeling for deformable object, reaction force when a deformable object is operated.
Requirements-driven database systems benchmark method
Authors: Jia-Lang Seng, S. Bing Yao, Alan R. Hevner
Venue: Decision Support Systems (2005)

Benchmarks are the vital tools in the performance measurement, evaluation, and comparison of relational database management systems (RDBMS). Standard benchmarks such as the TP1, TPC-A, TPC-B, TPC-C, TPC-D, TPC-H, TPC-R, TPC-W, Wisconsin, and AS3 Ap benchmarks have been used to assess the performance of relational database management systems. These benchmarks are synthetic and domain-specific. Test results from these benchmarks are estimates of possible system performance for certain pre-determined application types. Database system performance on actual database domain may vary significantly from those in the standard benchmarks. In this paper, we describe a new benchmark method that is computer-assisted and developed from the perspective of the user's requirements.
Nix: A Safe and Policy-Free System for Software Deployment
Authors: Eelco Dolstra, Merijn de Jonge, Eelco Visser
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

Existing systems for software deployment are neither safe nor sufficiently flexible. Primary safety issues are the inability to enforce reliable specification of component dependencies, and the lack of support for multiple versions or variants of a component. This renders deployment operations such as upgrading or deleting components dangerous and unpredictable. A deployment system must also be flexible (i.e., policy-free) enough to support both centralised and local package management, and to allow a variety of mechanisms for transferring components. In this paper we present Nix, a deployment system that addresses these issues through a simple technique of using cryptographic hashes to compute unique paths for component instances.
Early Experience with Scientific Programs on the Cray MTA-2
Authors: Wendell Anderson, Preston Briggs, C. Stephen Hellberg, Daryl W. Hess, Alexei Khokhlov, Marco Lanzagorta, Robert Rosenberg
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

We describe our experiences porting and tuning three scientific programs to the Cray MTA-2, paying particular attention to the problems posed by I/O. We have measured the performance of each of the programs over many different machine configurations and we report on the scalability of each program. In addition, we compare the performance of the MTA with that of an SGI Origin running all three programs.
Report from the text analysis techniques topic session
Authors: Robert E. Stumberger
Venue: Proceedings of the 5th conference on Message understanding (1993)

Presentations in the Text Analysis Techniques session covered areas related to:&bull; disambiguation of temporal expressions (Lois Childs, GE/Martin Marietta),&bull; trainable correction of Japanese word segmentation (Sean Boisen, BBN),&bull; principle-based parsing (Robert Belvin, Language Systems Inc.),&bull; and disambiguating with semantic tags (Jim Cowie, NMSU).
Location-aware visualization of VRML models in GPS-based mobile guides
Authors: Stefano Burigat, Luca Chittaro
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

In this paper, we present LAMP3D, a system for the location-aware presentation of VRML content on mobile devices. We explore the application of LAMP3D in tourist mobile guides: the system is used to provide tourists with a 3D visualization of the environment they are exploring, synchronized with the physical world through the use of GPS data; tourists can easily obtain information on the objects they see in the real world by directly selecting them in the VRML world. We discuss the design and development of the system and report about the feedback obtained from the informal user testing we carried out.
Evolution of a spatial allocation system
Authors: Barry Jackson
Venue: ACM SIGDA Newsletter (1977)

The evolution of methods of finding the "proper" location of a set of architecturally defined spaces runs into unwarranted complexity as the problem approaches "real world" constraints. The problem strains at its boundaries, produces anomalies, does not respond neatly to modeling, and has not produced any change in the architect's concept of built form. It does puzzle analysts and continues to provide both a methodical challenge and a forum for discussion of some of the underlying meanings of "design".
The finite and the infinite in temporal logic
Authors: Riccardo Pucella
Venue: ACM SIGACT News (2005)

At the last TACAS in Barcelona, already almost a year ago, Alur, Etessami, and Madhusudan [2004] introduced CaRet, a temporal logic framework for reasoning about programs with nested procedure calls and returns. The details of the logic were themselves interesting (I will return to them later), but a thought struck me during the presentation, whether an axiomatization might help understand the new temporal operators present in CaRet. Thinking a bit more about this question quickly led to further questions about the notion of finiteness and infinity in temporal logic as it is used in Computer Science. This examination of the properties of temporal logic operators under finite and infinite interpretations is the topic that I would like to discuss here. I will relate the discussion back to CaRet towards the end of the article, and derive a sound and complete axiomatization for an important fragment of the logic.
Virtual network embedding in the cycle
Authors: Sébastien Choplin, Aubin Jarry, Stéphane Pérennes
Venue: Discrete Applied Mathematics (2005)

We consider a problem motivated by the design of Asynchronous transfer mode (ATM) networks. Given a physical network and an all-to-all traffic, the problem consists in designing a virtual network with a given diameter, which can be embedded in the physical one with a minimum congestion (the congestion is the maximum load of a physical link). Here we solve the problem when the physical network is a ring. We give an almost optimal solution for diameter 2 and bounds for large diameters.
Entity identification for heterogeneous database integration: a multiple classifier system approach and empirical evaluation
Authors: Huimin Zhao, Sudha Ram
Venue: Information Systems (2005)

Entity identification, i.e., detecting semantically corresponding records from heterogeneous data sources, is a critical step in integrating the data sources. The objective of this research is to develop and evaluate a novel multiple classifier system approach that improves entity identification accuracy. We apply various classification techniques drawn from statistical pattern recognition, machine learning, and artificial neural networks to determine whether two records from different data sources represent the same real-world entity. We further employ a variety of ways to combine multiple classifiers for improved classification accuracy. In this paper, we report on some promising empirical results that demonstrate performance improvement by combining multiple classifiers.
Book reviews: Computer-Aided Financial Analysis by Ross M. Miller (Addison-Wesley)
Venue: ACM SIGART Bulletin (1990)

According to the author "This book is designed to serve as a bridge between finance and computer science." It emphasizes "those situations that are sufficiently complex that they cannot be adequately analyzed without a computer." The book is intended as a textbook for courses bridging the gap between computer science and financial analysis. It starts at the basics for each subject and quickly builds to interesting material of useful complexity.
Quadratic optimization in the problems of active control of sound
Authors: J. Lončarić, S. V. Tsynkov
Venue: Applied Numerical Mathematics (2005)

We analyze the problem of suppressing the unwanted component of a time-harmonic acoustic field (noise) on a predetermined region of interest. The suppression is rendered by active means, i.e., by introducing the additional acoustic sources called controls that generate the appropriate anti-sound. Previously, we have obtained general solutions for active controls in both continuous and discrete formulation of the problem. We have also obtained optimal solutions that minimize the overall absolute acoustic source strength of active control sources, which is equivalent to minimization in the sense of L1.By contrast, in the current paper we formulate and study optimization problems that involve quadratic functions of merit. Specifically, we minimize the L2 norm of the control sources, and we consider both the unconstrained and constrained minimization. The unconstrained L2 minimization is an easy problem to address numerically. On the other hand, the constrained approach allows one to analyze sophisticated geometries. In a special case, we can compare our finite-difference optimal solutions to the continuous optimal solutions obtained previously using a semi-analytic technique. We also show that the optima obtained in the sense of L2 differ drastically from those obtained in the sense of L1.
A Lagrange multiplier method for the finite element solution of elliptic interface problems using non-matching meshes
Authors: Peter Hansbo, Carlo Lovadina, Ilaria Perugia, Giancarlo Sangalli
Venue: Numerische Mathematik (2005)

In this paper we propose a Lagrange multiplier method for the finite element solution of multi-domain elliptic partial differential equations using non-matching meshes. The interface Lagrange multiplier is chosen with the purpose of avoiding the cumbersome integration of products of functions on unrelated meshes (e.g, we will consider global polynomials as multiplier). The ideas are illustrated using Poisson&#x2019;s equation as a model, and the proposed method is shown to be stable and optimally convergent. Numerical experiments demonstrating the theoretical results are also presented.
Software reuse for scientific computing through program generation
Authors: Martin Erwig, Zhe Fu
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2005)

We present a program-generation approach to address a software-reuse challenge in the area of scientific computing. More specifically, we describe the design of a program generator for the specification of subroutines that can be generic in the dimensions of arrays, parameter lists, and called subroutines. We describe the application of that approach to a real-world problem in scientific computing which requires the generic description of inverse ocean modeling tools. In addition to a compiler that can transform generic specifications into efficient Fortran code for models, we have also developed a type system that can identify possible errors already in the specifications. This type system is important for the acceptance of the program generator among scientists because it prevents a large class of errors in the generated code.
Faces of emotion in human-computer interaction
Authors: Pedro Branco, Peter Firth, L. Miguel Encarnação, Paolo Bonato
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The study of users' emotional behavior in the Human-Computer Interaction (HCI) field has received increasing attention during the last few years. Our work in this area focuses on the relationship between user emotions and perceived usability problems. Specifically, we propose to observe users' spontaneous facial expressions as a method to identify adverse-event occurrences at the user interface level.This paper reports on the results of an experiment designed to investigate the association between adverse-event occurrences during a word processing task and users' facial expressions monitored using electromyogram (EMG) sensor devices. The results suggest that an increase of task difficulty is related to an increase in specific facial muscle activity, thus creating a baseline for future developments using camera-based monitoring of facial activities.
People Tracking using Robust Motion Detection and Estimation
Authors: Markus Latzel, Emilie Darcourt, John K. Tsotsos
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Real world computer vision systems highly depend on reliable, robust retrieval of motion cues to make accurate decisions about their surroundings. In this paper, we present a simple, yet high performance low-level filter for motion tracking in digitized video signals. The algorithm is based on constant characteristics of a common, 2-frame interlaced video signal, yet results presented in this paper show its applicability to highly compressed, noisy image sequences as well. In general, our approach uses a computationally low-cost solution to define the area of interest for tracking of multiple, moving objects. Despite its simplicity, it compares very well to exisiting approaches due to its robustness towards environmental changes. To demonstrate this, we present results of processing a sequence of JPEG-compressed monocular images of a parking lot in order to track pedestrians, cars and bicycles. Despite a high level of noise and changing lighting conditions, the algorithm successfully segments a moving object and tracks its position along a trajectory.
Grid-Based Galaxy Morphology Analysis for the National Virtual Observatory
Authors: Ewa Deelman, Raymond Plante, Carl Kesselman, Gurmeet Singh, Mei-Hui Su, Gretchen Greene, Robert Hanisch, Niall Gaffney, Antonio Volpicelli, James Annis, Vijay Sekhri, Tamas Budavari, Maria Nieto-Santisteban, William O'Mullane, David Bohlender, Tom McGlynn, Arnold Rots, Olga Pevunova
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

As part of the development of the National Virtual Observatory (NVO), a Data Grid for astronomy, we have developed a prototype science application to explore the dynamical history of galaxy clusters by analyzing the galaxies' morphologies. The purpose of the prototype is to investigate how Grid-based technologies can be used to provide specialized computational services within the NVO environment. In this paper we focus on the key enabling technology components, particularly Chimera and Pegasus which are used to create and manage the computational workflow that must be present to deal with the challenging application requirements. We illustrate how the components interplay with each other and can be driven from a special purpose application portal.
Reliable computation of minimum-time motions for manipulators moving in obstacle fields using a successive search for minimum-overload trajectories
Authors: Jong-Keun Park, James E. Bobrow
Venue: Journal of Robotic Systems (2005)

In this paper we present a practical method for finding obstacle-free minimum-time motions for manipulators subject to the limits of velocity-dependent actuator forces. An optimal motion-planning problem is converted into a finite-dimensional nonlinear programming problem by means of parameter optimization with quintic B-splines. We introduce the concept of the minimum-overload trajectory in which the motion time is specified to be faster than the actuators can handle, and the actuator overloads are minimized with the motion time fixed. By successive searches for minimum-overload trajectories, minimum-time motions are determined for three example manipulators without simplifying any of the kinematic, dynamic or geometric properties of the manipulators or the obstacles. In the resultant minimum-time motions, almost all of the joint actuators are close to saturation during the motions. &copy; 2005 Wiley Periodicals, Inc.
Cryptanalysis of Hwang-Yang scheme for controlling access in large partially ordered hierarchies
Authors: Shyh-Yih Wang, Chi-Sung Laih
Venue: Journal of Systems and Software (2005)

Recently, Hwang and Yang [J. Syst. Software 67 (2003) 99] proposed a cryptographic key assignment scheme for access control in large partially ordered hierarchies. In this paper, we show that their scheme is insecure against the collusion attack whereby some security classes conspire to derive the secret keys of other leaf security classes, which is not allowed according to the scheme.
Supporting Complex Multi-Dimensional Queries in P2P Systems
Authors: Bin Liu, Wang-Chien Lee, Dik Lun Lee
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

More and more applications require peer-to-peer (P2P) systems to support complex queries over multi-dimensional data. For example, a P2P auction network for real estate frequently needs to answer queries such as "select five available buildings closest to the airport". Such queries are not efficiently supported in current P2P systems. Towards an efficient and scalable P2P system capable of processing complex multi-dimensional queries, we first propose a comprehensive framework for sharing, indexing, and querying multi-dimensional data, where (i) peers with more computational power coordinate indexing and query processing, and (ii) other peers participate in part of the computation in order to achieve scalability and load-balance. Based on this framework, we propose Network-R-tree (NR-tree), a P2P adaptation of the dominant spatial index - R*-tree. NR-tree, indexing spatial data at clustered peers, is capable of processing complex queries such as range queries and k-nearest neighbor queries. We propose query processing algorithms for range and k-nearest neighbor queries and experimentally prove the effectiveness of proposed techniques with real data.