ppxscal/embedding_network huggingface dataset:
Quality-delay-and-computation trade-off analysis of acoustic echo cancellation on general-purpose CPU
Authors: J. Song, Jian Li, Yen-Kuang Chen
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

While many previous studies have examined acoustic echo cancellation (AEC) in terms of quality, computation complexity, and implementation issues on DSP processors, this work evaluates quality-delay-computation trade-off of unconstrained frequency-domain recursive-least-square AEC algorithm on general purpose microprocessors. Specially, trade-off among echo cancellation quality, sampling delay, and computation time on Intel Pentium 4 systems is analyzed. Our quantitative analysis shows that the effectiveness of echo cancellation does not depend on availability of CPU as long as CPU can provide sufficient computational power for online real-time processing. Today's general-purpose microprocessor-based AEC can deliver satisfactory echo cancellation quality at a computationally acceptable price (less than 5% CPU usage). On other hand, the effectiveness depends on sampling delay. And no matter how fast a microprocessor would be, it is unlikely to guarantee both smaller sampling delay and larger echo-return-loss-enhancement (ERLE) at the same time. Finally, considering possible application of general-purpose processor-based AEC in laptop, office and meeting room environments, we analyzed acoustic channel delay's influence on both ERLE and CPU computation, showing that general- purpose microprocessor AEC's outstanding ability in tolerating various computing environments. Our experimental results can be used to design good configuration to meet specific quality requirements in terms of quality and sampling delay.
Performance analysis of binary code protection
Authors: David M. Nicol, Hamed Okhravi
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Software protection technology seeks to prevent unauthorized observation or use of applications. Cryptography can be used to provide such protection, but imposes a potentially significant additional computation load. This paper examines the performance impact of two software protection techniques. We develop an analytic model and validate it using a detailed discrete-event simulator applied to memory reference traces of well-known benchmark programs. We find that even though the added workload may be large, that impact is often dominated by inherent costs of disk activity.
Goal types in agent programming
Authors: Mehdi Dastani, M. Birna van Riemsdijk, John-Jules Ch. Meyer
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This paper discusses three types of declarative goals and motivates their integration in logic-based agent-oriented programming languages. These goal types are perform goals, achieve goals, and maintain goals. A goal type is considered as a specific agent attitude towards goals. The semantics for each goal type is explained from an operational perspective. It is argued that the suggested semantics of the goal types ensure some desirable and expected properties.
A Model driven software platform for Network Management Applications
Authors: Prabhu S
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

NMS/EMS applications are designed to perform management tasks such as fault, configuration, performance, accounting and security on the various network elements. Typically network information such as physical, logical inventory, alarms and the like are persisted on the management station's database. The management station also routinely accesses the devices for faults and configurations. Due to the diverse nature of the network, applications need to understand the different management protocols and associated device intricacies to interact with the device. Similarly applications are exposed to the underlying data model and database access mechanisms. This makes the applications hard to evolve and cumbersome to maintain as any changes in the underlying mechanisms warrants a change in the application. Thus there is a need for a uniform model and a component based on it for device as well as database access, which abstracts the underlying details so that applications can focus on providing valuable services. The objective of this paper is to highlight the need for a uniform model and propose a metadata driven approach for device and database access components.
Variance analyses from invariance analyses
Authors: Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Distefano, Peter O'Hearn
Venue: ACM SIGPLAN Notices (2007)

An invariance assertion for a program location l is a statement that always holds at l during execution of the program. Program invariance analyses infer invariance assertions that can be useful when trying to prove safety properties. We use the term variance assertion to mean a statement that holds between any state at l and any previous state that was also at l. This paper is concerned with the development of analyses for variance assertions and their application to proving termination and liveness properties. We describe a method of constructing program variance analyses from invariance analyses. If we change the underlying invariance analysis, we get a different variance analysis. We describe several applications of the method, including variance analyses using linear arithmetic and shape analysis. Using experimental results we demonstrate that these variance analyses give rise to a new breed of termination provers which are competitive with and sometimes better than today's state-of-the-art termination provers.
Agent-Based Semantic Service Discovery for Healthcare: An Organizational Approach
Authors: Cesar Caceres, Alberto Fernandez, Sascha Ossowski, Matteo Vasirani
Venue: IEEE Intelligent Systems (2006)

This article is part of a special issue on Intelligent Agents in Healthcare. E-health is one of the fastest-growing application areas for intelligent mobile services. The ever-growing number and variety of health-related devices and tasks calls for mechanisms to automatically discover, invoke, and coordinate the corresponding services. This, in turn, requires languages and tools that support a semantically rich description of e-health services. This article focuses on service discovery for medical-emergency management. A new mechanism for semantic service discovery complements existing approaches by considering relevant parts of the organizational context in which e-health services are used, to improve system usability in emergencies. This approach is reusable in other application areas, especially in the medical field.
Training for today's supply chains: an introduction to the distributor game
Authors: Stijn-Pieter A. van Houten, Alexander Verbraeck, Sandor Boyson, Thomas Corsi
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In this paper we present the Distributor Game, which is the first of a series of management games developed for today's supply chain challenges such as globalization, increasing importance of the customer role and mass customization. The learning objective for players of the Distributor Game is centered around globalization and the real-time supply chain. The decision making processes of the distributors in the game are controlled by human players. To confront the human players with a complex and dynamic environment, suppliers and markets are represented by computer-controlled actors. After playing the game for the first time with 32 MBA students, it was evaluated using a detailed questionnaire, the results clearly showed the value of the game. Further research will focus on software services to make game instantiation easier and to enhance the support for development and use of simulation-based supply chain management games.
Judging Time Intervals Using a Model of Perceptuo-Motor Control
Authors: Madeleine A. Grealy, Cathy M. Craig, Christophe Bourdin, Simon G. Coleman
Venue: Journal of Cognitive Neuroscience (2004)

Estimating a time interval and temporally coordinating movements in space are fundamental skills, but the relationships between these different forms of timing, and the neural processes that they incur, are not well understood. While different theories have been proposed to account for time perception, time estimation, and the temporal patterns of coordination, there are no general mechanisms which unify these various timing skills. This study considers whether a model of perceptuo-motor timing, the &tau;GUIDE, can also describe how certain judgements of elapsed time are made. To evaluate this, an equation for determining interval estimates was derived from the &tau;GUIDE model and tested in a task where participants had to throw a ball and estimate when it would hit the floor. The results showed that in accordance with the model, very accurate judgements could be made without vision (mean timing error 19.24 msec), and the model was a good predictor of skilled participants' estimate timing. It was concluded that since the &tau;GUIDE principle provides temporal information in a generic form, it could be a unitary process that links different forms of timing.
Hierarchical verification environment
Authors: Tony Cant, Brendan Mahony, Jim McCarthy, Linh Vu
Venue: Proceedings of the 10th Australian workshop on Safety critical systems and software - Volume 55 (2006)

This paper describes The HIVE (Hierarchical Verification Environment), currently under development by DSTO. The HIVE is a new approach to the development, evaluation and certification of complex critical systems. The HIVE aims to provide a unified framework in which entire design projects can be described.
AChord: Topology-Aware Chord in Anycast-Enabled Networks
Authors: Le Hai Dao, JongWon Kim
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Chord is a scalable peer-to-peer (P2P) lookup protocol that solves the problem of efficiently locating nodes with designed data items. However, Chord is known to be limited in routing efficiency since all nodes are placed on the overlay without taking into account the underlying network topology. In this paper, we introduce AChord, a topology-aware version of Chord that utilizes anycast, along with additional modifications, to achieve higher routing efficiency. Simutation results show that the proposed approach achieves better performance than the original Chord in the sense of end-to-end lookup latency and average path length.
A taxonomy of application scheduling tools for high performance cluster computing
Authors: Jiannong Cao, Alvin T. Chan, Yudong Sun, Sajal K. Das, Minyi Guo
Venue: Cluster Computing (2006)

Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper presents a survey on the software tools for the graph-based scheduling on cluster systems with the focus on task scheduling. The tasks of a parallel or distributed application can be properly scheduled onto multi-processors in order to optimize the performance of the program (e.g., execution time or resource utilization). In general, scheduling algorithms are designed based on the notion of task graph that represents the relationship of parallel tasks. The scheduling algorithms map the nodes of a graph to the processors in order to minimize overall execution time. Although many scheduling algorithms have been proposed in the literature, surprisingly not many practical tools can be found in practical use. After discussing the fundamental scheduling techniques, we propose a framework and taxonomy for the scheduling tools on clusters. Using this framework, the features of existing scheduling tools are analyzed and compared. We also discuss the important issues in improving the usability of the scheduling tools.
A Model of Open Source Software Style R&D on Business
Authors: Masashi Ueda
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Now open source style R&D is not only community based R&D but also adoptable for business. But each open source projects have their own licences. We analyse open source licenses by cluster analysis and find the importance of standards. This means that standards for license like creative commons need for easy adoption of open source programs as a part of legacy business programs. On the other hand patent pool or other frameworks starts to adopt for sharing intellectual property rights among companies, organisations, and universities. Then we show the new model for open based R&D on business.
Dual-Mode Quadruple Precision Floating-Point Adder
Authors: Ahmet Akkas
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Many scientific applications require more accurate computations than double precision or doubleextended precision floating-point arithmetic. This paper presents a dual-mode quadruple precision floating-point adder that also supports two parallel double precision additions. A technique and modifications used to design the dual-mode quadruple precision adder are also applied to implement a dualmode double precision adder, which supports one double precision and two parallel single precision operations. To estimate area and worst case delay, the conventional and the dual-mode double and quadruple precision adders are implemented in VHDL and synthesized. The correctness of all the designs is also tested and verified through extensive simulation. Synthesis results show that the dual-mode quadruple precision adder requires roughly 14% more area than the conventional quadruple precision adder and a worst case delay is 9% longer.
Developing a technology of use for collaborative project-based learning
Authors: Esther L. Tiessen, Douglas R. Ward
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

We have designed and developed technologies to make it simpler for teachers and students to take educational advantage of the WWW for collaborative project-based learning. Recognizing that technologies alone are insufficient to effect educational change, we have also directed considerable effort toward working with teachers to construct principled understanding of what supports are required to make effective use of our technologies--a "technology of use." This paper describes the technology we have provided for teachers to support collaborative project-based learning, and through examples of one teacher's experiences with three Zebu projects we illustrate the needs and challenges in supporting more effective use. Building on what we have learned about supporting teachers in designing, planning, and implementing project structures that will support students in engaging in collaborative project-based learning, we have been working towards the design of a technology of use. This technology of use includes a representational scheme for helping teachers to portray, analyze, plan, design, share, and implement collaborative projects.
Spin systems and minimal switching decompositions
Authors: J. Clemente-Gallardo, F. S. Leite
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

The control of spin chains represents a very interesting problem from the point of view of quantum computation. The problem consists in defining a procedure to obtain any possible evolution operator of the spin chain by means of in external magnetic field. The set of possible evolution operators of the system corresponds to the unitary group SU(2/sup N/) (where N is the number of atoms in the chain) and the interactions involved can he set to correspond to elements in the corresponding Lie algebra. As a consequence, the whole problem can be formulated in Lie algebraic terms and the design issues be reduced to a suitable decomposition of the group elements. The goal of this paper is to introduce a Cartan decomposition for the unitary group based on a minimal switching decomposition of the special orthogonal group. We analyze its implications from the point of view of time optimality in the construction of a program as a sequence of quantum gates.
Revision of Australian defence standard def (Aust) 5679
Authors: Tony Cant, Brendan Mahony, Brenton Atchison
Venue: Proceedings of the 10th Australian workshop on Safety critical systems and software - Volume 55 (2006)

The Australian Defence Standard Def (Aust) 5679, entitled "The Procurement of Computer-Based Safety-Critical Systems", was originally published in August, 1998. Def (Aust) 5679 is currently undergoing revision. This paper describes the standard and discusses the issues that have been highlighted during the revision process.
Knowledge-based Multi-agent Architecture
Authors: Munir Merdan, Vedran Kordic, Alois Zoitl, Aleksandar Lazinica
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

This paper presents a knowledge-intensive multiagent architecture that enables ontology-based communication and cooperation among a set of autonomous and heterogeneous agents. An agent, the main core of our architecture, acts based on his knowledge, by sensing the manufacturing environment, triggering the reasoning process, which selects the proper actions to be executed and that will affect the manufacturing environment. The ontology is shared among agents and serves as the instrument to define the vocabulary used by the agents during their interactions, and to support "understanding of the message content in the sense of its correct interpretation.
An improved block dependent fragile image watermark
Authors: Liu Feilong, Wang Yangsheng
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Surrounding neighbor blocks dependent fragile watermark scheme has its disadvantages, which couldn't successfully distinguish where the image has been tampered. In this paper, we propose a random block dependant fragile image watermark scheme. Two series, one is generated by this block and its prior block, the other is generated by this block itself, are embedded into the LSBs of this image block to keep itself secure and dependent on its prior block, which make VQ attack impossible. Decision strategy is implemented to detect whether the image blocks are authentic in tamper detection. Analysis and experimental results demonstrate that our algorithm can detect even one bit image alteration with graceful localization, and successfully resist vector quantization attack simultaneously without the need of any unique keys or image indexes.
Mining web logs to debug distant connectivity problems
Authors: Emre Kiciman, David A. Maltz, Moises Goldszmidt, John C. Platt
Venue: Proceedings of the 2006 SIGCOMM workshop on Mining network data (2006)

Content providers base their business on their ability to receive and answer requests from clients distributed across the Internet. Since disruptions in the flow of these requests directly translate into lost revenue, there is tremendous incentive to diagnose why some requests fail and prod the responsible parties into corrective action. However, a content provider has only limited visibility into the state of the Internet outside its domain. Instead, it must mine failure diagnoses from available information sources to infer what is going wrong and who is responsible.Our ultimate goal is to help Internet content providers resolve reliability problems in the wide-area network that are affecting end-user perceived reliability. We describe two algorithms that represent our first steps towards enabling content providers to extract actionable debugging information from content provider logs, and we present the results of applying the algorithms to a week's worth of logs from a large content provider, during which time it handled over 1 billion requests originating from over 10 thousand ASes.
The combination of finite-length geometric equalization and bandwidth optimization for multicarrier transceivers
Authors: N. Al-Dhahir, J. Cioffi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

A bandwidth-optimized and equalized multicarrier transceiver that achieves near-optimum performance at a practical complexity level is described. The equalizer used is a relatively short FIR filter whose taps and delay are set to optimize the performance of the multicarrier transceiver. Simulation results on a set of carrier-serving-area subscriber loops are also presented to demonstrate the separate and joint effects of bandwidth optimization and equalization on performance. Finally, the intriguing idea of using a pole-zero equalizer to achieve the high performance of infinite-complexity FIR equalizers at a much lower implementation cost is investigated.
Vertical Parallax from Moving Shadows
Authors: Yaron Caspi, Michael Werman
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

This paper presents a method for capturing and computing 3D parallax. 3D parallax, as used here, refers to vertical offset from the ground plane, height. The method is based on analyzing shadows of vertical poles (e.g., a tall building's contour) that sweep the object. Unlike existing beam-scanning approaches, such as shadow or structured light, that recover the distance of a point from the camera, our approach measures the height from the ground plane directly. Previous methods compute the distance from the camera using triangulation between rays outgoing from the light-source and the camera. Such a triangulation is difficult when the objects are far from the camera, and requires accurate knowledge of the light source position. In contrast, our approach intersects two (unknown) planes generated separately by two casting objects. This omits the need to precompute the location of the light source. Furthermore, it allows a moving light source to be used. The proposed setup is particularly useful when the camera cannot directly face the scene or when the object is far away from the camera. A good example is an urban scene captured by a single webcam.
Finding Qualitative Patterns in Ozone Behavior
Authors: Angela Nebot, Violeta Mugica
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

Air pollution is one of the most important environmental problems in urban areas, being extremely critical in Mexico City. The main air pollution problem that has been identified in Mexico City metropolitan area is the formation of photochemical smog, primarily ozone. This toxic gas can produce harmful effects on the population's health, especially children's health. The study and developement of modeling methodologies that allow the capturing of time series behavior becomes an important task when it is intended to predict the future behavior of the system under study. This paper presents the Visual-FIR tool, a new platform for the Fuzzy Inductive Reasoning (FIR) methodology. FIR offers a model-based approach to modeling and predicting either univariate or multivariate time series. Visual-FIR is used in this research for long term prediction of maximum ozone concentration in the centre region of Mexico City metropolitan area.