ppxscal/embedding_network huggingface dataset:
An Application Oriented Humanoid Animation System Based on VRML
Authors: Mamoru Endo, Takami Yasuda, Shigeki Yokoi
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Recently, the demand for 3-dimensional humanoid animation on the Internet has increased. We have developed an animation system to generate human actions based on a hierarchic human body description and action library. Using this system, 3D human body structure and behavior can be managed in a unified way and can be used with VRML. We were able to describe human structure model and action information as well as develop methods to generate action animation utilizing libraries in the Internet. This paper explains the concept and the structure of the system and its application on the Internet.
Registration of Images with Dissimilar Contrast using a Hybrid Method Employing Correlation and Mutual Information
Authors: Karolyn A. Abram
Venue:  (2000)

The problem of fitting one image into another is commonly called "registration." Finding the best possible translation and rotation necessary to align two images is one approach to solving this problem. Registration is a crucial component of many remote sensing and medical image interpretation applications. Image alignment techniques aid in volumetric estimations of complicated structures and allow radiologists to accurately identify changes between sequential images. Radiologists require image alignment capabilities to correct for patient motion and/or content displacement between images. Numerous image registration techniques exist for correcting the alignment problems mentioned above. Unfortunately, most of these techniques, such as Correlation, fail to find a good alignment when dealing with images that differ in contrast. The Mutual Information method is able to align images independently of contrast, but it is computationally intensive. We explore a hybrid technique that utilizes both Correlation and Mutual Information. The Hybrid technique hopes to gain greater contrast independence than Correlation alone while achieving a lower running time than a pure Mutual Information technique. 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
Subpolytopes of Cyclic Polytopes
Authors: Tibor Bisztriczky, Gyula Karolyi
Venue:  (1996)

A remarkable result of I. Shemer [4] states that the combinatorial structure of a neighbourly $2m$-polytope determines the combinatorial structure of each of its subpolytopes. From this, it follows that every subpolytope of a cyclic $2m$-polytope is cyclic. In this note, we present a direct proof of this consequence that also yields that certain subpolytopes of a cyclic $(2m+1)$-polytope are cyclic.
Advanced Computing Research Institute, Semi-annual Research Activity Report, October 1992 April 1993
Authors: Thomas F. Coleman
Venue:  (1993)

The Advanced Computing Research Institute (ACRI) is a unit of the Cornell Theory Center and is affiliated with the Cornell Computer Science Department. The ACRI is concerned with research in scientific computation and its application to engineering and scientific problems. Of particular importance is the use and potential of advanced computer architectures and environments. Research areas include parallelizing compilers for scientific computation and the design of algorithms for numerical linear algebra, optimization, and partial differential equations. Currently, ACRI researchers are collaborating on several large-scale applications in the computational sciences, including: protein-folding and related molecular chemistry problems, structural optimization and biomechanics, particle methods for turbulent combustion, discretecontrol problems, and the application of boundary element methods. The parallel computers available to the ACRI for research include the Theory Center machines a 64-node KSR computer, an IBM ES/9000, a network of IBM RS/6000s, as well as Computer Science resources: an 8K CM-200, a 32-node Intel iPSC/860, and a 64-node BBN Butterfly. This report consists of two parts. The first part contains a short summary of the progress made in the last six months on each of the four main projects: parallelizing compilers, computational linear algebra, computational optimization, and numerical methods for partial differential equations. Included are also a list of ACRI researchers and their research interests, a list of technical reports produced in the last six months, and a list of ACRI seminars.
Software Maintenance Types - A Fresh View
Authors: Ned Chapin
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

Compatible with the recently proposed ontology of software maintenance, the paper proposes a fresh view of the types of software maintenance. The paper offers a classification based not on people's intentions, but upon objective evidence of activities based on documentation that may include the source code. The classification includes taking into account evidence of: 1) changes in the character and use of the documentation, 2) changes in the properties of the software, and 3) changes in the in the functionality of the software. The paper provides a hierarchic summary guide to the proposed fresh view of the types of software maintenance.
Rejection Measures for Handwriting Sentence Recognition
Authors: S. Marukatat, T. Artières, P. Gallinari, B. Dorizzi
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In this paper we study the use of confidence measures for an on-line handwriting recognizer. We investigate various confidence measures and their integration in an isolated word recognition system as well as in a sentence recognition system. In isolated word recognition tasks, the rejection mechanism is designed in order to reject the outputs of the recognizer that are possibly wrong, which is the case for badly written words, out-of-vocabulary words or general drawing. In sentence recognition tasks, the rejection mechanism allows rejecting parts of the decoded sentence.
Partitioning and Scheduling Using Graph Decomposition
Authors: Y. Zhu
Venue:  (1993)

As the availability of parallel computers increases, and as the Multiple Instruction/Multiple Data (MIMD) style architecture gains popularity, the need for parallelizing compilers becomes evident. The automatic translation of serial code into parallel code would ease the burden of the programmer. Many years worth of serial code could be parallelized with minimal manual intervention. One important issue of the design of a parallelizing compiler is scheduling. Once the potential for parallelism is identified in a program, the scheduler must decide the cost effectiveness of parallelization. If communication costs are relatively high, a decision to parallelize could easily increase the cost of execution. A good scheduling algorithm is therefore very important in the design of a parallelizing compiler. The scheduling problem has been proven intractable; consequently, good local decision-making heuristics must be used by the scheduler. Scheduling based on graph decomposition has potential for producing fast schedules. This paper introduces a scheduling algorithm based on graph decomposition, and analyzes its performance on program dependence graphs. 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
Building Segment Trees in Parallel
Authors: Peter Su, Robert L. S Drysdale
Venue:  (1992)

The segment tree is a simple and important data structure in computational geometry [7,11]. We present an experimental study of parallel algorithms for building segment trees. We analyze the algorithms in the context of both the PRAM (Parallel Random Access Machine) and hypercube architectures. In addition, we present performance data for implementations developed on the Connection Machine. We compare two different parallel alforitms, and we also compare our parallel algorithms to a good sequential algorithm for doing the same job. In this way, we evaluate the overall efficiency of our parallel methods. Our performance results illustrates the problems involved in using popular machine models(PRAM) and analysis techniques (asymptotic efficiency) to predict the performance of parallel algorithms on real machines. We present two different analyses of our algorithms and show that neither is effective in predicting the actual performance numbers that we obtained.
How "Useful" is Multimedia on the WWW for Enhancing Teaching and Learning?
Authors: S. K. Adhvaryu, I. Balbin
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

The proliferation of multimedia-based educational presentations on the WWW which are designed to enhance teaching and learning is a recent phenomenon. Although some impetus has occurred because institutions seek to broaden and increase their student population and sources of revenue there is an undercurrent that suggests that new Web-based modes of presentation are more "useful" or "better." Educationalists have proposed several methods for measuring how "good" a multimedia-based educational presentation is. The purpose of this paper is not to compare these measures or assess them. Rather, we focus on the seminal work of Laurillard [19] and apply her methodology to a broad spectrum of 112 web sites. We present the results of our research and show that more attention needs to be paid to the effective modelling and transmission of "the state of a student's interaction" in order to better support the educational objectives of Laurillard's methodology.
In Pursuit of Correct Paradigms for Object-Oriented Real-Time Distributed Systems
Authors: Patrice Carrére, Jean-François Hermant, Gérard Le Lann
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Real-time distributed applications based on object-oriented technology raise many complex issues, most of them still open.We elaborate on the reasons why traditional paradigms, found adequate for tackling simple problems, cannot help in addressing these complex issues. A detailed illustration is given with a problem in modular avionics, which has been addressed by resorting to proof-based system engineering, an emerging discipline aimed at coping with real-world problems complexity. Drawing from our experience with partners in industry, we report on why such paradigms and technologies as object-orientation, distributed transactions, distributed architectures, transactional monitors, can be contemplated for the construction of real-time distributed systems, provided that appropriate on-line decision-making algorithms and protocols are resorted to.
Model of Electric Market Operation Support System Based on UML
Authors: Qingdong Feng, Xiuping Bai, Yijia Cao, YeJin Jin, Tianshu Huang
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

This paper presents an electric market operation support system model developed by visual tool rational rose2000. Use cases such as TMR, TMS, EMS, SBS, CMS, SIS, SPDnet and GBS are formed according to the system requirements. Use case view and main class view of the system are formed at the same time. As for various UML view of the system, this paper focuses the discussion on the class view, the component view, the sequence view and deployment view of the system, and for these model views, corresponding C++ codes are generated, these codes are useful for developing software of the electric market operation support system.
Quality-Based Compensation of Multimedia Objects
Authors: Tetsuo Kanezuka, Hiroaki Higaki, Makoto Takizawa
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

A multimedia object supports methods to manipulate the multimedia data in the object. A method changes not only the state of the object but also QoS of the state. We discuss new equivalent and compatible relations among methods with respect to QoS. By using the relations, we newly discuss a QoS-based compensating way to undo the computation. We also discuss a locking scheme for objects.
Smart Fabric, or "Wearable Clothing"
Authors: E. Rehmi Post, Margaret Orth
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

Wearable computers can now merge seamlessly into ordinary clothing. Using various conductive textiles, data and power distribution as well as sensing circuitry can be incorporated directly into wash-and-wear clothing. This paper describes some of the techniques used to build circuits from commercially available fabrics, yarns, fasteners, and components.
Animated Exploration of Dynamic Graphs with Radial Layout
Authors: Ka-Ping Yee, Danyel Fisher, Rachna Dhamija, Marti Hearst
Venue: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01) (2001)

We describe a new animation technique for supporting interactive exploration of a graph. We use the well-known radial tree layout method, in which the view is determined by the selection of a focus node. Our main contribution is a method for animating the transition to a new layout when a new focus node is selected. In order to keep the transition easy to follow, the animation linearly interpolates the polar coordinates of the nodes, while enforcing ordering and orientation constraints. We apply this technique to visualizations of social networks and of the Gnutella file-sharing network, and discuss the results from our informal usability tests.
Submicron Systems Architecture: Semiannual Technical Report
Authors: Charles L. Seitz
Venue:  (1991)

No abstract available.
Representations and Metrics for Off-Line Handwriting Segmentation
Authors: Thomas M. Breuel
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Segmentation is a key step in many off-line handwriting recognition systems but, to date, there are almost no ground truth segmentation databases and no widely accepted and formally defined metrics for segmentation performance. This paper proposes a representation of segmentations and presegmentations in terms of color images. Such representations allow convenient interchange of ground truth and hypothesized segmentations in the form ofstandard image formats. The paper formally defines the notions of oversegmentation and undersegmentation in terms of the maximal bipartite match between corresponding pixels.It also defines a number of metrics that quantify the frequency and extent of events in handwriting like kerning, splitting, and merging of characters. It is hoped that these metrics and representations will find wider use in the community and serve as a basis for creating standard training and test databases of segmentation data.
Hypercube Network Fault Tolerance: A Probabilistic Approach
Authors: Jianer Chen, Iyad A. Kanj, Guojun Wang
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Extensive experience has shown that hypercube networks are highly fault tolerant. What is frustrating is that it seems very difficult to properly formulate and formally prove this important fact, despite extensive research efforts in the past two decades. Most proposed fault tolerance models for hypercube networks are only able to characterize very rare extreme situations thus significantly underestimating the fault tolerance power of hypercube networks,while for more realistic fault tolerance models, the analysis becomes much more complicated. In this paper, we develop new techniques to analyze a realistic fault tolerance model and derive lower bounds for the probability of hypercube network fault tolerance. Our results are both theoretically significant and practically important. Theoretically, our method offers very general and powerful techniques for formally proving lower bounds on the probability of network connectivity, while practically, our results provide formally proven and precisely given upper bounds on node failure probabilities for manufacturers to achieve a desired probabilityfor network connectivity. Our techniques are also useful for analysis of the performance of routing algorithms.
Lower bounds for on-line single-machine scheduling
Authors: L. Epstein, Rob Stee
Venue:  (2001)

The problem of scheduling jobs that arrive over time on a single machine is well-studied. We study the preemptive model and the model with restarts. We provide lower bounds for deterministic and randomized algorithms for several optimality criteria: weighted and unweighted total completion time, and weighted and unweighted total flow time. By using new techniques, we provide the first lower bounds for several of these problems, and we significantly improve the bounds that were known.
A Fault-Tolerant Adaptive and Minimal Routing Approach in 3-D Meshes
Authors: Jie Wu
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

We propose a sufficient condition for minimal routing in 3-dimensional (3-D) meshes with faulty nodes. Unlike many traditional models that assume all the nodes know global fault distribution or just adjacent fault information, our approach is based on the concept of {limited global fault information}. First, we propose a fault model called {faulty cube} in which all faulty nodes in the system are contained in a set of faulty cubes. Fault information is then distributed to limited number of nodes while it is still sufficient to support minimal routing. A vector called extended safety level represents the limited fault information collected at each node. The extended safety level associated with a node can be used to determine the existence of a minimal path from this node to a given destination. Our results show that any minimal routing that is partially adaptive can be applied in our model as long as the destination node meets a certain condition. We also propose a dynamic planar adaptive routing scheme that offers better fault tolerance and adaptivity than the planar adaptive routing scheme in 3-D meshes. {Our approach is the first attempt to address adaptive and minimal routing in 3-D meshes with faulty nodes using limited fault information.
An In-Service Agent Monitoring and Analysis System
Authors: Zhan Cui, Brian Odgers, Michael Schroeder
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Multi Agent Systems (MAS) have been experimented in building a variety of applications. Several agent-building tools are available to assist with the tasks of building agent-based systems. However the issues on how to visualize and monitor the behaviors, and to analyze the performance of in-service agents have largely not been addressed. This paper describes the system we have developed for visualizing, monitoring and analyzing MAS activities both on-line and off-line. Our system uses an agent-based infrastructure in dealing with various service requirements from agent-based application systems concerning visualization, monitoring and analysis. There are three types of agents: 1) an information management agent for collecting and storing data from MAS, and for making service agreements with MAS, 2) a visualization agent for constructing and presenting various views, and 3) an analysis agent for analyzing MAS activities and for making recommendations with a view to optimize the in-service agent performance.
Behavioral Subtyping Relations for Active Objects
Authors: Heike Wehrheim
Venue: Formal Methods in System Design (2003)

In this paper we investigate the object-oriented notion of subtyping in the context of behavioral formalisms. Behavioral formalisms are used to describe the dynamic behavior of active objects, viz. the protocols of interaction that active objects have to obey.Subtyping in OO-formalisms is closely related to the concept of inheritance. The central issue in the choice of subtyping relations among classes is the principle of substitutability: an instance of the subtype should be usable wherever an instance of the supertype was expected. Depending on the interpretation of &ldquo;usable&rdquo;, we obtain a variety of subtyping relations: stronger relations, allowing sharing of subtype instances among different clients, and weaker relations, restricting the possibilities of interference of different clients on the subtype instance. The subtyping relations are taxonomically ordered in a hierarchy. Substitutability is formalized via testing scenarios, which provide alternative characterizations for the subtyping relations.
Optimization of Multi-Valued Multi-Level Networks
Authors: R. Brayton, M. Gao, J-H. Jiang, Y. Jiang, Y. Li, A. Mishchenko, S. Sinha, T. Villa
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

A program called MVSIS has been developed which optimizesmulti-level multi-valued networks (MV networks).We describe what such a network is and the capabilitiescontained in MVSIS. MVSIS is modeled after SIS, whichsynthesizes binary multi-level networks, but the logic networkof MVSIS is such that all variables can be multi-valuedeach with its own range. Included in MVSIS arealmost all the technology-independent transformations ofSIS for combinational and sequential logic synthesis aswell as transformations specific to multi-valued nodes suchas merge, pair decode, encode. MVSIS can readand write BLIF-MV and BLIF files which describe MV-networksand binary networks respectively.
A Low Power Pseudo-Random BIST Technique
Authors: Nadir Z. Basturkmen, Sudhakar M. Reddy, Irith Pomeranz
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

Peak power consumption during testing is an important concern. For scan designs, a high level of switching activity is created in the circuit during scan shifts, which increases power consumption considerably. In this paper we propose a pseudo-random BIST scheme for scan designs, which reduces the peak power consumption as well as the average power consumption as measured by the switching activity in the circuit. The method reduces the switching activity in the scan chains and the activity in the circuit under test by limiting the scan shifts to a portion of the scan chain structure using scan chain disable. Experimental results on various benchmark circuits demonstrate that the technique reduces the switching activity caused byscan shifts.
10 Minute Guide to Pocket PC 2002
Authors: Michael Miller
Venue:  (2002)

:10 Minute Guide to Pocket PC 2002 offers simple, practical help for busy people who need results fast. Through goal-oriented, 10-minute lessons, you'll learn all the essential tasks for getting productive with the latest version of Pocket PC. 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