ppxscal/embedding_network huggingface dataset:
Teleoperation and Java3D Visualization of a Robot Manipulator over the World Wide Web
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

A system for WWW-based remote robot tele-operation is presented in this paper. It addresses important problems of Internet telerobotics such as "how do we make the system reliable?", "how do we make the system fast?", and, finally, "how do we make the system open and portable?".The recent open technologies Java and Java3D are used for developing the system. Key features of the system are (1) the Java3D-based "live" virtual representation of the real robot and its environment, and (2) the use of a powerful tool for the remote programming of the robot.Possible applications of the teleoperation tools developed and methods within VR are also briefly discussed.
iWebDB - Web Site Administration Based on Object-Relational Database Technology
Authors: Henrik Loeser, Norbert Ritter
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Since the emergence of the World Wide Web in the year 1990, the number of accessible Web servers, HTML pages, and, thereby, the amount of accessible data have increased dramatically. Consequently, many people around the world are engaged in maintaining a Web server and its content. While creating HTML pages is getting more and more simple, the administration of a Web site is still a time consuming and demanding task. Available tools for Web Content Management (WCM) only cover some of the relevant aspects of the whole task; an integrated, fully functional solution is missing. Therefore, Web administrators still have to cope with many problems, such as ensuring validity of available documents or keeping hyperlinks consistent. In this paper, we present administrative components of iWebDB, an integrated WCM solution, based on object-relational database technology. By extending an object-relational database system (ORDBS) with WCM functionality, many tasks of WCM, such as validity checks and consistency checks for local hyper-links, can be delegated to the DBS and, thereby, automated. Therefore, iWebDB achieves more effective and easier administration of a Web server and its content by exploiting the extensibility property of ORDBSs.
Aspects of the Implementation of Type Theory
Authors: Robert W. Harper
Venue:  (1985)

NOT SUPPLIED The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Augmented Urban Planning Workbench: Overlaying Drawings, Physical Models and Digital Simulation
Authors: Hiroshi Ishii, Eran Ben-Joseph, John Underkoffler, Luke Yeung, Dan Chak, Zahra Kanji, Ben Piper
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

There is a problem in the spatial and temporal separation between the varying forms of representation used in urban design. Sketches, physical models, and more recently computational simulation, while each serving a useful purpose, tend to be incompatible formsof representation. The contemporary designer is required assimilate these divergent media into a single mental construct and in so doing is distracted from the central process of design.We propose an Augmented Reality Workbench called "Luminous Table" that attempts to address this issue by integrating multiple forms of physical and digital representations. 2D drawings, 3D physical models, and digital simulation are overlaid into a single information space in order to support the urban design process. We describe how the system was used in a graduate design course and discuss how the simultaneous use of physical and digital media allowed for a more holistic design approach. We also discuss the need for future technical improvements.
An Optimal Algorithm for MoJo Distance
Authors: Zhihua Wen, Vassilios Tzerpos
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Effective comparison of different decompositions of a software system is integral for the evaluation of software clustering algorithm . One of the approaches that has been developed to tackle this isssue is the MoJo distance measure.The original algorithm for the computation of MoJo distance was a heuristic one that only approximated the exact value. In this paper, we introduce an algorithm that calculates the exact distance in polynomial time. We also present experiments that showcase that the new algorithm calculates MoJo distance more accurately and efficiently than before.
Phased Scheduling of Continuous Media Tasks to Improve Quality of Service
Authors: Jaeyong Koh, Heonshik Shin
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

To improve the quality of service, a multimedia system needs to accommodate transient overload with minimum deadline misses of time-critical tasks. It also has to minimize the average response time of non-time-critical tasks for smooth, consistent user interactions.The objective of this paper is to present a phased scheduling technique for periodic, continuous media tasks to minimize both the deadline miss ratio and the average response time. Phased scheduling is achieved by varying the phases or points of time at which independent periodic tasks are scheduled for execution. An algorithm is proposed to identify the optimal phase vector. Our discussion focuses on the Earliest Deadline First algorithm, although it can be extended to other scheduling algorithms. Simulation results show that the phase shifting substantially enhances the quality of service.
Pretty-printing within the ASF+SDF Meta-Environment: a generic approach
Authors: Mark Brand, M. Jonge
Venue:  (1999)

The automatic generation of formatters for (programming) languages within the Asf+Sdf Meta-Environment is a research topic that is concerned with the construction of language specific formatters (or pretty-printers) given a language definition in Sdf. In this paper, we give an overview of pretty-printers that have been developed within this project and observe that these pretty-printers are either language dependent or non-customizable. Language independence and customizability are inevitable properties of pretty-printers however, when faced with the problem of formatting many different, evolving languages. Therefore, we introduce in this paper a generic framework for pretty-printing and describe an instantiation of the framework that forms a language independent and customizable pretty-printer.
Integration of Virtual Reality and Multimedia Data in Databases
Authors: K. Walczak
Venue: Proceedings of the 1996 International Workshop on Multi-Media Database Management Systems (IW-MMDBMS '96) (1996)

Increasing capabilities of computer systems enable development of new, better ways of data visualization and interaction between users and computers. One of the most powerful mechanisms of data visualization and interaction is Virtual Reality. In this paper the use of Virtual Reality as a platform for multimedia presentations is proposed. A technique which enable common storage and retrieval of Virtual Reality and multimedia data in databases is presented. Appropriate modeling method ,for Virtual Reality data in databases and dynamic synthesis of their presentations is discussed. As an example application a Geographic Information System is described. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An Efficient Algorithm for Polymer Sequence Design
Authors: Jon Kleinberg
Venue:  (1998)

Polymer sequence design is a natural inverse problem to protein structure prediction: given a target structure in three dimensions, we wish to design an amino acid sequence that will fold to it. A model of Sun, Brem, Chan, and Dill casts this problem as an optimization on a space of sequences of hydrophobic (H) and polar (P) monomers; the goal is to find a sequence which achieves a dense hydrophobic core with few solvent-exposed hydrophobic residues. Sun et al. developed a heuristic method to search the space of sequences, without a guarantee of optimality or near-optimality; Hart subsequently raised the computational tractability of constructing an optimal sequence in this model as an open question. Here we answer this question by providing an efficient algorithm to construct optimal sequences; the method has a polynomial running time, and performs very efficiently in practice. We illustrate the implementation of our method on structures drawn from the Protein Data Bank, and discuss some possible extensions of the model.
Mining System-User Interaction Traces for Use Case Models
Authors: Mohammad El-Ramly, Eleni Stroulia, Paul Sorenson
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

While code understanding is the primary program comprehension activity, it is quite challenging to recognize the application requirements from code, since they have usually been occluded by a set of layers of later implementation decisions. An alternative source ofevidence, especially valuable for understanding the purposes for which the application was built, can be the dynamic behavior of the system, and more specifically the system-user interaction. We have developed a method for modeling the application behavior from the user's perspective in the form of use case models, using recorded traces of system-user interaction. We use data mining and pattern matching methods to mine these traces for frequently occurring user tasks. When interesting patterns are discovered, they are augmented with semantic information and they are used to build use case models. We demonstrate a successful application of this method to recover use case models from interaction traces with legacy 3270 systems to serve user interface reengineering activities.
A Prolog compiler and its extension for OR-parallelism
Authors: Mats Carlsson
Venue:  (1990)

This report describes algorithms for the compiler component of the Aurora Or-Parallel Prolog system. The compiler translates one Prolog clause at a time into a sequence of abstract instructions. The instruction set is based on the sequential Warren Ab- stract Machine (WAM) with extensions for full Prolog, shallow backtracking, memory management and garbage collection, and for the SRI model of or-parallel execution of Prolog. Most of the described algorithms apply to compilation of sequential Prolog programs. The extensions introduced to support or-parallelism are minor, and concern pruning operators (cut and commit) and compile-time allocation of binding array offsets for permanent variables (generalised environment trimming). Code generation proper is kept separate from register allocation, and uses heuristics for finding a compilation order which minimises the number of register-register copies. After such copies have been coalesced where possible, register allocation is performed in a single pass over the intermediate code. The various compilation phases are described in detail, and the implementation is compared with some other compilers.
Implementing a Learning System for Subsumption Architectures
Authors: John Shewchuk, Paul Viola
Venue:  (1989)

chuk We have built a robot that wanders about the environment and learns from novel experiences. The robot learns to perform those actions that bring about a predetermined desirable state. We argue that some of the difficulties associated with learning are reduced by embedding those modules capable of learning within a subsumption architecture. The claim that subsumption architectures are well suited to the creation of real-time robust control systems is not new. However, until now little has been said regarding the incorporation of learning. We claim, and hope to demonstrate, that an augmented subsumption architecture is especially well suited to the task of learning behaviors. We have found that a simple learning algorithm guided by a utility function can enable a robot to discover and exhibit new behaviors. In addition, by calculating a certainty factor associated with every learned response, the robot can moderate the effects of learning on its behavior.
A Model for Active Entities in Software Systems
Authors: Manojit Sarkar
Venue:  (1995)

We develop a model for active entities in software systems. An active entity or simply an entity is an active object with a private state and one or more independent threads of control. Entities communicate with each other by message passing. A collection of communicating entities constitute a concurrent and distributed systems. We present a language for describing entities. The semantics and implementation of the language are also discussed.
A performance analysis of PIM, stream processing, and tiled processing on memory-intensive signal processing kernels
Authors: Jinwoo Suh, Eun-Gyu Kim, Stephen P. Crago, Lakshmi Srinivasan, Matthew C. French
Venue: ACM SIGARCH Computer Architecture News (2003)

Trends in microprocessors of increasing die size and clock speed and decreasing feature sizes have fueled rapidly increasing performance. However, the limited improvements in DRAM latency and bandwidth and diminishing returns of increasing superscalar ILP and cache sizes have led to the proposal of new microprocessor architectures that implement processor-in- memory, stream processing, and tiled processing. Each architecture is typically evaluated separately and compared to a baseline architecture. In this paper, we evaluate the performance of processors that implement these architectures on a common set of signal processing kernels.The implementation results are compared with the measured performance of a conventional system based on the PowerPC with Altivec. The results show that these new processors show significant improvements over conventional systems and that each architecture has its own strengths and weaknesses.
Toward a Definition of Modeling Power for Stochastic Petri Net Models
Authors: Gianfranco Ciardo
Venue:  (1987)

Some insight on the meaning of ``modeling power'''' for Stochastic Petri Net models is given. Extensions characterizing a Stochastic Petri Net are categorized as logical or stochastic. Three logical constructs are shown to be equivalent: inhibitor arcs, transition priorities, and enabling functions associated with the transitions. A direct transformation of Petri Nets with inhibitor arcs into Petri Nets with transition priorities and vice versa is given, determining a bound on the size of equivalent nets in the two models. As a consequence, the higher priority of immediate transitions over timed transitions in the GSPN model is shown to provide the full power of Turing machines.
Macromedia Flash MX: The Complete Reference
Authors: Brian Underdahl
Venue:  (2002)

:It's almost impossible to spend any time online and not encounter the brilliance of Macromedia Flash. Whether it's in showcasing graphics or text, animation or movies, sound or interactivity, Flash is among a small handful of elite applications that have fueled the spectacular emergence of the Web. Macromedia Flash MX: The Complete Reference contains seven distinct sections and 30 chapters devoted to delivering information on every aspect of this powerful tool. From graphics and animation, to interactivity, to the ActionScript language, learn to use all aspects of Flash -- and see for yourself why Flash is among the most successful and popular Web applications.
Post-pass compaction techniques
Authors: Bruno De Bus, Daniel Kästner, Dominique Chanet, Ludo Van Put, Bjorn De Sutter
Venue: Communications of the ACM (2003)

Seeking to resolve many of the problems related to code size in traditional program development environments.
On the Optimum Checkpoint Selection Problem
Authors: Sam Toueg, Ozalp Babaoglu
Venue:  (1983)

We consider a model of computation consisting of a sequence of $n$ tasks. In the absence of failures, each task $i$ has a known completion time $t_{i}$. Checkpoints can be placed between any two consecutive tasks. At a checkpoint, the state of the computation is saved on a reliable storage medium. Establishing a checkpoint immediately before task $i$ is known to cost $s_{i}$. This is the time spent in saving the state of the computation. When a failure is detected, the computation is restarted at the most recent checkpoint. Restarting the computation at checkpoint $i$ requires restoring the state to the previously saved value. The time necessary for this action is given by $r_{i}$. We derive an $O(n^{3})$ algorithm to select out of the $n-i$ potential checkpoint locations those that result in the smallest expected time to complete all the tasks. An $O(n^{2})$ algorithm is described for the reasonable case where $s_{i} < s_{j}$ implies $r_{i} < r_{j}$. These algorithms are applied to two models of failure. In the first one, each task $i$ has a given probability $p_{i}$ of completing without a failure, i.e., in time $t_{i}$. Furthermore, failures occur independently and are detected at the end of the task during which they occur. The second model admits a continuous time failure mode where the failure intervals are independent and identically distributed random variables drawn from any given distribution. In this model, failures are detected immediately. In both models, the algorithm also gives the expected value of the overall completion time and we show how to derive all the other moments.
P-immune sets with holes lack self-reducibility properties
Authors: Lane A. Hemaspaandra, Harald Hempel
Venue: Theoretical Computer Science (2003)

No P-immune set having exponential gaps is positive-Turing self-reducible.
The Use of Task Graphs for Modeling Complex System Behavior
Authors: Ami Silberman, Karthik Sundaram, Alexander D. Stoyen
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Task graphs have been used for the specification and analysis of real-time systems for some time. We are currently developing a mobile code management system that uses such a representation for specification, analysis, and execution time scheduling, dispatch, and resource allocation decisions.In this paper, we describe our three level limited-hierarchical task-graph model. We discuss graph topology, the use of task-graphs for both specification and description, and planned softwareengineering tools that will take advantage of our model. We will concentrate on the use of task-graphs to model iteration, branching structures, optional execution, and parallelism within a function execution.
Rapid prototyping of information visualizations using VANISH
Authors: R. Kazman, J. Carriere
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

Discusses a software tool called VANISH (Visualizing And Navigating Information Structured Hierarchically), which supports the rapid prototyping of interactive 2D and 3D information visualizations. VANISH supports rapid prototyping through a special-purpose visual language called VaPL (VANISH Programming Language) tailored for visualizations, through a software architecture that insulates visualization-specific code from changes in both the domain being visualized and the presentation toolkit used, and through the reuse of visualization techniques between application domains. The generality of VANISH is established by showing how it is able to re-create a wide variety of "standard" visualization techniques. VANISH's support for prototyping is shown through an extended example, where we build a C++ class browser, exploring many visualization alternatives in the process.
Performing Binary-Categorization on Multiple-Record Web Documents Using Information Retrieval Models and Application Ontologies
Authors: Linus W. Kwong, Yiu-Kai Ng
Venue: World Wide Web (2003)

To retrieve Web documents of interest, most of the Web users rely on Web search engines. All existing search engines provide query facility for users to search for the desired documents using search-engine keywords. However, when a search engine retrieves a long list of Web documents, the user might need to browse through each retrieved document in order to determine which document is of interest. We observe that there are two kinds of problems involved in the retrieval of Web documents: (1) an inappropriate selection of keywords specified by the user; and (2) poor precision in the retrieved Web documents. In solving these problems, we propose an automatic binary-categorization method that is applicable for recognizing multiple-record Web documents of interest, which appear often in advertisement Web pages. Our categorization method uses application ontologies and is based on two information retrieval models, the Vector Space Model (VSM) and the Clustering Model (CM). We analyze and cull Web documents to just those applicable to a particular application ontology. The culling analysis (i) uses CM to find a virtual centroid for the records in a Web document, (ii) computes a vector in a multi-dimensional space for this centroid, and (iii) compares the vector with the predefined ontology vector of the same multi-dimensional space using VSM, which we consider the magnitudes of the vectors, as well as the angle between them. Our experimental results show that we have achieved an average of 90% recall and 97% precision in recognizing Web documents belonged to the same category (i.e., domain of interest). Thus our categorization discards very few documents it should have kept and keeps very few it should have discarded.
Generalized Fitting Subgroups and p-Layers of Finite Groups
Authors: Lyons Richard
Venue:  (2001)

The similarities between Bender''s generalized Fitting subgroup, Bender''s E(G) subgroup and the Gorenstein-Walter $p$-layer of a finite group are axiomatized. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Professional Techniques for Digital Wedding Photography, 2 edition
Authors: Jeff Hawkins, Kathleen Hawkins
Venue:  (2003)

:Wedding photographers competing for clients have much to learn about staying on top of changing technology. This timely guide explores the reservations many photographers have about digital wedding photography and explains the outstanding benefits of this new technology, including saved labor and cost and quick turnaround time. Topics include selecting and using equipment, addressing client concerns and potential objections, pricing images, using digital proofs, and using digital imaging software.Jeff Hawkins has been a professional photographer for 20 years. Kathleen Hawkins is president of Wedding Professionals of Central Florida. They are the authors of Professional Marketing & Selling Techniques for Wedding Photographers. They live in Longwood, Florida.
A Virtual Lab-Notebook for Multidimensional Microscopic Images
Authors: A. de Vos, B. Buitendijk, E. J. Van Raaij, F. J. Verbeek
Venue: Proceedings of the International Conference on Information Visualisation (2000)

This paper discusses the use of XML as an intermediate format for storage of information on microscope images and the different techniques to visualize this information. In this manner, we have explored XML and build several applications for image management. The XML-files generated by these applications are defined as the lab-notebook. A crucial feature of such lab-notebook stored in XML is that it directly relates to the Internet so that a modern web-browser can be used to present the data in a user-friendly manner. We will discuss how we used XSL and Java applets to accomplish this.