ppxscal/embedding_network huggingface dataset:
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Venue: Annual ACM Symposium on Theory of Computing (2005)

The papers in this volume were presented at the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2005), held in Baltimore, Maryland, May 22-24, 2005. The Symposium was sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT).On May 21, the day before STOC, there was a commemoration of Larry Stockmeyer, who died on July 31, 2004. For this tribute, which was organized by Tutorials Chair Cynthia Dwork, there was a tutorial by Nicholas Pippenger on some of Stockmeyer's fundamental results in complexity theory, followed by lectures by Miklos Ajtai, Anne Condon, Cynthia Dwork, Richard Karp, Albert Meyer, and Christopher Umans. On the following day, Lance Fortnow continued the tribute with an invited talk and paper, which appears in these proceedings, on the work and legacy of Larry Stockmeyer.In response to a Call for Papers, 290 submissions were received by the submission deadline of November 4, 2004, 5:59pm EST. All were submitted electronically on the ACM SIGACT server website. One paper was a duplicate, and four papers were eventually withdrawn.The Program Committee began its deliberations electronically on January 4, and continued in that medium until its meeting at the IBM Almaden Research Center, San Jose, California, on January 21-22, where all final decisions were made. Of the 21 Program Committee members, 19 attended the Program Committee meeting in San Jose, and the other two participated through a full-time conference call.The Program Committee selected 84 papers for presentation. The paper "Undirected ST-Connectivity in Log-Space", by Omer Reingold, was selected for the STOC Best Paper Award. The paper "A O(log n log log n) Space Algorithm for Undirected Connectivity", by Vladimir Trifonov, was selected for the Danny Lewin Best Student Paper Award.The submissions were not refereed, and many of these papers represent reports of continuing research. It is expected that most of them will appear in a more polished and complete form in scientific journals.
CICADA: a novel scheme for improving TCP performance over wireless links: Research Articles
Authors: Kaveh Ghaboosi, Babak Hossein Khalaj
Venue: Wireless Communications Mobile Computing (2005)

In this paper, by making slight modifications in protocol stack of wireless access points, the proposed CICADA scheme aims at isolating problems related to wireless section of a transmission control protocol (TCP) connection from its wired portion, using IP spoofing and virtual protocol stack scheme. As the simulation results for an 802.11 based system show, the proposed scheme improves the overall network throughput for both DCF and PCF scenarios, while reducing the mean and variance of end-to-end delay for voice and video flows due to smarter bandwidth allocation to elastic and real-time traffic. In addition, the proposed scheme uses a centralized network address translation (NAT) structure that prevents undesired disconnections during handovers and achieves a smaller handoff delay compared with other schemes. CICADA also improves the privacy of wireless sections by constructing virtual protocol stacks corresponding to mobile stations and using hierarchical two-level NAT structure in infrastructure networks in order to protect the distribution system against outside attacks. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Using Collaborative Haptics in Remote Surgical Training
Authors: Chris Gunn, Matthew Hutchins, Duncan Stevenson, Matt Adcock, Patricia Youngblood
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

We describe the design and trial of a remotely conducted surgical master class, using a haptic virtual environment. The instructor was located in the United States and the class was in Australia. The responses of the audience and participants are presented.
Securing XML data
Authors: Jessica Heasley
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

XML is becoming one of the most important and widely used data formats. XML data in transit over the Internet as well as the data residing on servers must be assessed for XML associated security vulnerabilities and be properly secured from malicious XML specific attacks. There are several options in implementing XML security devices such as firewalls. Users need to understand how XML relates and interacts with Internet applications.
Extremal principles and the limiting capabilities of open thermodynamic and economic macrosystems
Authors: A. M. Tsirlin
Venue: Automation and Remote Control (2005)

General features of the macrosystems were considered, and for the stationary state of the active (controlling) subsystems of the open thermodynamic and microeconomic systems, which differs little from the equilibrium state, the stationary modes and optimal behavior were studied. Validity of the reciprocity conditions and the principle of minimum dissipation were demonstrated not only for the scalar flow in microeconomics, but for the vector flow as well. The ultimate capacity of the thermal separation systems was determined.
A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem
Authors: Boris Goldengorin, Diptesh Ghosh
Venue: Journal of Global Optimization (2005)

Maximization of submodular functions on a ground set is a NP-hard combinatorial optimization problem. Data correcting algorithms are among the several algorithms suggested for solving this problem exactly and approximately. From the point of view of Hasse diagrams data correcting algorithms use information belonging to only one level in the Hasse diagram adjacent to the level of the solution at hand. In this paper, we propose a data correcting algorithm that looks at multiple levels of the Hasse diagram and hence makes the data correcting algorithm more efficient. Our computations with quadratic cost partition problems show that this multilevel search effects a 8- to 10-fold reduction in computation times, so that some of the dense quadratic partition problem instances of size 500, currently considered as some of the most difficult problems and far beyond the capabilities of current exact methods, are solvable on a personal computer working at 300 MHz within 10 min.
Telerobotic systems design based on real-time CORBA
Authors: Michele Amoretti, Stefano Bottazzi, Stefano Caselli, Monica Reggiani
Venue: Journal of Robotic Systems (2005)

A new class of telerobotic applications is making its way into research laboratories, fine arts or science museums, and industrial installations. Virtual laboratories and remote equipment maintenance are examples of these applications, which are built exploiting distributed computing systems and Internet technologies. Distributed computing technologies provide several advantages to telerobotic applications, such as dynamic and multiuser access to remote resources and arbitrary user locations. Nonetheless, building these applications remains a substantial endeavor, especially when performance requirements must be met. The aim of this paper is to investigate how mainstream and advanced features of the CORBA object-oriented middleware can be put to work to meet the requirements of novel telerobotic applications. We show that Real-Time CORBA extensions and asynchronous method invocation of CORBA services can be relied upon to meet performance and functional requirements, thereby enabling teleoperation on local area networks. Furthermore, CORBA services for concurrency control and large-scale data distribution enable geographic-scale access for robot teleprogramming. Limitations in the currently available implementations of the CORBA standard are also discussed, along with their implications. The effectiveness and suitability for telerobotic applications of several CORBA mechanisms are tested first individually and then by means of a software framework exploiting CORBA services and ensuring component-based development, software reuse, low development cost, fully portable real-time and communication support. A comprehensive telerobotic application built based on the framework is described in the paper and evaluated on both local and wide area networks. The application includes a robot manipulator and several sensory subsystems under concurrent access by multiple competing or collaborating operators, one of which is equipped with a multimodal user interface acting as the master device. &copy; 2005 Wiley Periodicals, Inc.
Pre-Emptive Scheduling Problems with Controllable Processing Times
Authors: Natalia V. Shakhlevich, Vitaly A. Strusevich
Venue: Journal of Scheduling (2005)

We consider a range of single machine and identical parallel machine pre-emptive scheduling models with controllable processing times. For each model we study a single criterion problem to minimize the compression cost of the processing times subject to the constraint that all due dates should be met. We demonstrate that each single criterion problem can be formulated in terms of minimizing a linear function over a polymatroid, and this justifies the greedy approach to its solution. A unified technique allows us to develop fast algorithms for solving both single criterion problems and bicriteria counterparts.
An Architecture for Behavior-Based Reinforcement Learning
Authors: G. D. Konidaris, G. M. Hayes
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2005)

This paper introduces an integration of reinforcement learning and behavior-based control designed to produce real-time learning in situated agents. The model layers a distributed and asynchronous reinforcement learning algorithm over a learned topological map and standard behavioral substrate to create a reinforcement learning complex. The topological map creates a small and task-relevant state space that aims to make learning feasible, while the distributed and asynchronous aspects of the architecture make it compatible with behavior-based design principles.We present the design, implementation and results of an experiment that requires a mobile robot to perform puck foraging in three artificial arenas using the new model, random decision making, and layered standard reinforcement learning. The results show that our model is able to learn rapidly on a real robot in a real environment, learning and adapting to change more quickly than both alternatives. We show that the robot is able to make the best choices it can given its drives and experiences using only local decisions and therefore displays planning behavior without the use of classical planning techniques.
Using OWL for querying an XML/RDF syntax
Authors: Rubén Tous, Jaime Delgado
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Some recent initiatives try to take profit from RDF to make XML documents interoperate at the semantic level. Ontologies are used to establish semantic connections among XML languages, and some mechanisms have been defined to query them with natural XML query languages like XPath and XML Query. Generally structure-mapping approaches define a simple translation between trivial XPath expressions and some RDF query language like RDQL; however some XPath constructs cannot be covered in a structure-mapping strategy. In contrast, our work takes the model-mapping approach, respectful with node order, that allows mapping all XPath axis. The obtained XPath implementation has the properties of schema-awareness and IDREF-awareness, so it can be used to exploit inheritance hierarchies defined in one or more XML schemas.
WaveScheduling: energy-efficient data dissemination for sensor networks
Authors: Niki Trigoni, Yong Yao, Alan Demers, Johannes Gehrke, Rajmohan Rajaraman
Venue: Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004 (2004)

Sensor networks are being increasingly deployed for diverse monitoring applications. Event data are collected at various sensors and sent to selected storage nodes for further in-network processing. Since sensor nodes have strong constraints on their energy usage, this data transfer needs to be energy-efficient to maximize network lifetime. In this paper, we propose a novel methodology for trading energy versus latency in sensor database systems. We propose a new protocol that carefully schedules message transmissions so as to avoid collisions at the MAC layer. Since all nodes adhere to the schedule, their radios can be off most of the time and they only wake up during well-defined time intervals. We show how routing protocols can be optimized to interact symbiotically with the scheduling decisions, resulting in significant energy savings at the cost of higher latency. We demonstrate the effectiveness of our approach by means of a thorough simulation study.
Building smarter: an interview with Jerry Laiserin
Authors: Ubiquity staff
Venue: Ubiquity (2005)

Architect and industry analyst Jerry Laiserin is an advocate for "building smarter" - the application of information technology to transform the way the built environment is designed, constructed and operated. His technology strategy publication, the LaiserinLetter, can be found at.
Treo Essentials
Authors: Jeff Ishaq
Venue:  (2005)

Make your Treo smartphone live up to its name. Treo Essentials will show you how to get the most out of your Treo 600 or 650 smartphone without making you feel anything but smart. You already know the basics and this book will take you beyond them. You'll learn how to synchronize with a PC, launch applications while making a phone call, and take and share pictures. You'll find out how to use e-mail and instant messaging, and how to secure your Treo with passwords, work over virtual private networks and use anti-virus protection software. There's so much more to your Treo 600 or 650 smartphone than meets the eye. Let Treo Essentials help you uncover its mysteries!
The science of deriving dense linear algebra algorithms
Authors: Paolo Bientinesi, John A. Gunnels, Margaret E. Myers, Enrique S. Quintana-Ortí, Robert A. van de Geijn
Venue: ACM Transactions on Mathematical Software (TOMS) (2005)

In this article we present a systematic approach to the derivation of families of high-performance algorithms for a large set of frequently encountered dense linear algebra operations. As part of the derivation a constructive proof of the correctness of the algorithm is generated. The article is structured so that it can be used as a tutorial for novices. However, the method has been shown to yield new high-performance algorithms for well-studied linear algebra operations and should also be of interest to those who wish to produce best-in-class high-performance codes.
Understanding Object-Oriented Source Code from the Behavioural Perspective
Authors: Neil Walkinshaw, Marc Roper, Murray Wood
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Comprehension is a key activity that underpins a variety of software maintenance and engineering tasks. The task of understanding object-oriented systems is hampered by the fact that the code segments that are related to a user-level function tend to be distributed across the system. We introduce a tool-supported code extraction technique that addresses this issue. Given a minimal amount of information about a behavioural element of the system that is of interest (such as a use-case), it extracts a trail of the methods (and method invocations) through the system that are needed in order to achieve an understanding of the implementation of the element of interest. We demonstrate the feasibility of our approach by implementing it as part of a code extraction tool, presenting a case study and evaluating the approach and tool against a set of established criteria for program comprehension tools.
Complex double precision in association with Fortran 77
Authors: John Reid
Venue: ACM SIGNUM Newsletter (1980)

Many scientific and engineering calculations require the use of complex double precision arithmetic and therefore Fortran 77 compilers are likely to include extensions to provide it. This note suggests a precise form for such an extension in the hope that its wide use will aid portability. It has been discussed by IFIP WG 2.5 on Numerical Software and has been approved by the working group, but does not constitute an official IFIP document.
Digital Signal Processing with Interleaved ADC Systems
Authors: Yih-Chyun Jenq
Venue: Journal of VLSI Signal Processing Systems (2005)

This paper addresses a problem associated with interleaved ADC systems from the digital signal processing algorithm design perspective. The output streams of an interleaved ADC system are inherently in parallel format. It would be nice if DSP algorithms can be designed to take advantage of the inherently parallel signal streams in the interleaved ADC system without the need of a high speed parallel-to-serial multiplexer. Frequency response of a parallel filter bank is derived. It is found that the overall frequency response is the average of each individual interpolated channel filter plus the aliasing components. The aliasing components come from the deviation of each individual channel from the average response.Results are applied to characterize the gain mismatch of ADC arrays. Sinusoidal response is also investigated. The results can be used to characterize the frequency response mismatch of ADC arrays.
Web Visualization of Geo-Spatial Data Using SVG and VRML/X3D
Authors: Jianghui Ying, Denis Gracanin, Chang-Tien Lu
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Data visualization is an important technique that helps in understanding and analysis of complex data. Most of current web-based geo-spatial data visualization products use two-dimensional visualization. A tool that uses the combination of twoand three-dimensional visualization can provide extra spatial dimension as well as flexible usability. Current Web technologies: Scalable Vector Graphics (SVG), Virtual Reality Modeling Language (VRML), and eXtensible 3D (X3D) provide a necessary foundation for such a tool. In this paper, we present a general framework for effective integration and web-based presentation of complex heterogeneous spatial-temporal data sets. This framework facilitates interpretation, exploration and analysis of large volume of data with significant geo-spatial and temporal characteristics. Advantages of this approach include improved visualization of geo-spatial and temporal raw data; better navigation and selection of data; and intuitive user interface. A web-based road traffic visualization system illustrates this approach using the Twin Cities road traffic data.
Natural language processing systems and III-formed input: University of Delaware/Sperry Univac
Authors: Ralph Weischedel, Amir Razi, Sudhir Advani, Norman Sondheimer
Venue: Issue 79 (January 1982) (1982)

The goal of our project is to add robustness to natural language understanding systems by adding rule-based methods of handling illformed input [1,2,3]. This includes both ungrammatical and semantically inappropriate utterances. The method being used consists of the following procedure:
Enhancing service location protocol for efficiency, scalabiliy and advanced discovery
Authors: Weibin Zhao, Henning Schulzrinne
Venue: Journal of Systems and Software (2005)

This paper presents three new mechanisms for the Service Location Protocol (SLP): mesh enhancement, preference filters and global attributes. The mesh enhancement simplifies Service Agent (SA) registrations and improves consistency among Directory Agents (DAs) by defining an interaction scheme for DAs and supporting automatic registration distribution among peer DAs. Preference filters facilitate processing of search results (e.g., finding the best match) in SLP servers (DAs and SAs) to reduce the amount of data transferred to the client for saving network bandwidth. Global attributes allow using a single query to search services across multiple types. These mechanisms can improve SLP efficiency and scalability and support advanced discovery such as discovering multi-access-point services and multi-function devices. We expect that these techniques can also be applied to other service discovery systems.
Adaptive Road Detection through Continuous Environment Learning
Authors: Mike Foedisch, Aya Takeuchi
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

The Intelligent Systems Division of the National Institute of Standards and Technology has been engaged for several years in developing real-time systems for autonomous driving. A road detection program is an essential part of the project. Previously we developed an adaptive road detection system based on color histograms using a neural network. This, however, still required human involvement during the initialization step. As a continuation of the project, we have expanded the system so that it can adapt to the new environment without any human intervention. This system updates the neural network continuously based on the road image structure. In order to reduce the possibility of misclassifying road and non-road, we have implemented an adaptive road feature acquisition method.
Toward the sensor network macroscope
Authors: David E. Culler
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

The Macroscope is a conceptual instrument for perceiving complex interactions, such as what occurs is ecosystems, social systems, and large-scale industrial settings. Sensor networks are a significant step toward such an instrument, because of the fidelity they offer in monitoring large regions of space and large collections of things. This talk describes our experiences in developing and deploying a large sensor network for microclimate monitoring of coastal redwood forests as a basis for studies in redwood ecophysiology. It summarizes the architecture, its implementation, and the many lessons and surprises encountered along the way. The effort produced unprecedented recordings of the microclimate dynamics indicating how these huge organisms interact with their environment.
A Novel Call Admission Control in Multi-Service Wireless LANs
Authors: Danyan Chen, A. K. Elhakeem, Xiaofeng Wang
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

A call admission control algorithm must try to admit as many calls as possible provided their quality of service (QoS) requirements can be met without violating those of previously admitted calls. In this paper, we propose a simple and effective call admission control algorithm and its associated resource allocation mechanism together will be referred to as the flexible call admission control, for recently proposed multi-pattern (MP) wireless local area networks (WLANs). The proposed flexible call admission control effectively takes the advantages of flexible pattern assignment in MP WLANs and the rate-adaptive feature of multimedia services to support multiple classes of traffic with diverse QoS requirements and priority levels. With the use of an innovative performance estimation mechanism, the proposed flexible call admission control and resource allocation algorithm has considerably lower complexity than that of the existing schemes. Simulation results have demonstrated that the use of MP FAC provides much higher system throughput and lower call blocking probability. It should be emphasized that the proposed FAC, although designed for MP WLANs, also works well with existing standard WLANs.