ppxscal/embedding_network huggingface dataset:
H3: laying out large directed graphs in 3D hyperbolic space
Authors: T. Munzner
Venue: Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97) (1997)

We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using traditional techniques for drawing general graphs because we assume a hierarchical nature of the data. We impose a hierarchy on the graph by using domain-specific knowledge to find an appropriate spanning tree. Links which are not part of the spanning tree do not influence the layout but can be selectively drawn by user request. The volume of hyperbolic 3-space increases exponentially, as opposed to the familiar geometric increase of euclidean 3-space. We exploit this exponential amount of room by computing the layout according to the hyperbolic metric. We optimize the cone tree layout algorithm for 3D hyperbolic space by placing children on a hemisphere around the cone mouth instead of on its perimeter. Hyperbolic navigation affords a Focus+Context view of the structure with minimal visual clutter. We have successfully laid out hierarchies of over 20,000 nodes. Our implementation accommodates navigation through graphs too large to be rendered interactively by allowing the user to explicitly prune or expand subtrees.
Access Control in Parallel Programs
Authors: James R. McGraw, Gregory R. Andrews
Venue:  (1978)

An important component of a programming language for writing operating systems, or other large parallel systems, is the set of access control facilities. Two principles for access control, expressive power and access validation, are discussed. Then two new language mechanisms are presented: one for expressing the static structure and access rights of parallel systems, the other for controlling dynamic access to shared objects (monitors). The use of the proposed mechanisms is illustrated by message passing and file systems. Finally, the relationship between the mechanisms and access validation is discussed and a solution to the safety problem for the facilities is given. Key Words and Phrases: access control, programming language, protection, security, processes, monitors, access safety. CR Categories: 4.20, 4.32, 4.35
Dialogue Processing with Neural Networks
Authors: Ye Wang, Alex Waibel
Venue:  (1992)

This paper describes a novel connectionist system for dialogue processing. Based on a script-like formalism, the system consists of several modular neural networks which can track the semantic flow of a dialogue. The system can be extended to understand and translate dialogues in a fixed domain.
Total Order Multicast to Multiple Groups
Authors: Rachid Guerraoui, Andre Schiper
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

We present a fault-tolerant algorithm that ensures total order delivery of messages sent to multiple groups of processes. Our algorithm is a multiple group ``genuine'' multicast algorithm in the sense that (1) any process can send a message to any set of process groups, and (2) only the sender and the receivers of a message take part in the algorithm needed to deliver the message. The correctness of our algorithm does not require reliable failure detectors, but requires causal order delivery of messages. This establishes a new and interesting link between causal order delivery and fault-tolerance with unreliable failure detectors.
Detecting & exploiting positive goal interaction in intelligent agents
Authors: John Thangarajah, Lin Padgham, Michael Winikoff
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Rational agents typically pursue multiple goals in parallel. However most existing agent systems do not have any infrastructure support for reasoning about either positive or negative interactions between goals. Negative interactions include such things as competition for resources, which if unrecognised can lead to unnecessary failure of both goals requiring the resource. Positive interactions include situations where there is potentially a common subgoal of two goals. This paper looks at mechanisms for identifying potential common subgoals, and attempting to schedule the actions of the agent to take advantage of this. Potential common subgoals are identified by maintaining summaries of definite and potential effects of goals and plans to achieve those goals. Template summaries for goal types are produced at compile time, while instance summaries are maintained and updated at execution time to allow the agent to choose and schedule its plans to take advantage of potential commonality where possible. This increases the ability of the agent to act in a rational manner, where rational is loosely defined as the sensible behaviour exhibited by humans.
A Parabolic Theory of Load Balance
Authors: Alan Heirich, Stephen Taylor
Venue:  (1993)

We derive analytical results for a dynamic load balancing algorithm modeled by the heat equation ut = V2u. The model is appropriate for quickly diffusing disturbances in a local region of a computational domain without affecting other parts of the domain. The algorithm is useful for problems in computational fluid dynamics which involve moving boundaries and adaptive grids implemented on mesh connected multicomputers. The algorithm preserves task locality and uses only local communication. Resulting load distributions approximate time asymptotic solutions of the heat equation. As a consequence it is possible to predict both the rate of convergence and the quality of the final load distribution. These predictions suggest that a typical imbalance on a multicomputer with over a million processors can be reduced by one order of magnitude after 105 arithmetic operations at each processor. For large n the time complexity to reduce the expected imbalance is effectively independent of n.
Rational Handling of Multiple Goals for Mobile Robots
Authors: Richard Goodwin, Reid Simmons
Venue:  (1993)

The mobile robot planning domain is dynamic, with goals becoming active asynchronously. In order to successfully operate in this environment, a robot must be able to interrupt and reformulate its plan of action on-the-fly. This report investigates a method for incorporating the accomplishment of a new goal into a partially executed plan. A decision theoretic approach using net present value as the decision criterion serves as the basis for determining goal ordering dynamically. The appropriateness of net present value over other criteria is argued. The approach has been implemented on a robot operating in an office setting. Examples from this domain and a planetary exploration domain are used to show the advantages of the approach with respect to fixed priority and heuristic approaches.
Software Interoperability of Telemedicine Systems: A CSCW Perspective
Authors: Pronab Ganguly, Pradeep Ray
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Computer Supported Cooperative Work (CSCW) provides a fusion of the understanding of organizational processes with communication technologies. Telemedicine involves an integration of networking technologies with health-care processes. Since different modalities of patient care, require applications running on heterogeneous computing environment, interoperability is a major issue in telemedicine. Software interoperability provides two distinctly classified benefits - benefits for the users of the system and benefits to the development and maintenance of the system. Software interoperability between different applications can be modeled at different levels of abstractions such as physical interoperability, data-type interoperability, specification-level interoperability and semantic interoperability. Various mechanisms exist to resolve the problem at different levels. This paper presents the design issues of an interoperable CSCW system in a distributed health-care environment through an illustrative study in the area of telecardiology.
Efficient Two-Level Mesh based Simulation of PRAMs
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

We consider time-processor optimal simulations of PRAM models on coated block meshes. A coated block mesh consists of \pi-processor blocks and \pi \times \pi or \sqrt{\pi} \times \sqrt{\pi} \times \sqrt{\pi} router blocks. The router blocks form a 2-dimensional or a 3-dimensional regular mesh, and the processor & memory blocks are located on the surface of the block mesh. As a generalization of the coated mesh, the 2-dimensional and 3-dimensional coated block meshes simulate EREW, CREW, and CRCW PRAM models time-processor optimally with moderate simulation cost. Using proper amount of parallel slackness, the cost can be decreased clearly below 2 routing steps per simulated PRAM processor.The coated block mesh is actually an instance of a more general two-level construction technique, which uses a seemingly inefficient but scalable solution on top of a non-scalable but efficient solution. Within blocks (chips) brute force techniques are applied, whereas the mesh structure on top makes the whole construction modular, simple, and scalable. The parameter \pi provides a method to balance the construction with respect to the two techniques.
Definition of the links and subsets for verbs
Authors: Antonietta Alonge
Venue:  (1996)

This deliverable reports on the work carried out within Task 4.1, assigned to WP4. The objectives of this task were i) the definition of the relations to be encoded for verbs; ii) the identification of criteria for verification of such relations for each language; iii) the definition of the subsets of verbs for which relations will be encoded in the database. The document also reports on the experiments carried out ons specific semantic domains in order to foresee the main issues and problems to be dealt with when building the whole EuroWordNet database for verbs. TEL:: +39 50 560481
Multiresolution Decimation based on Global Error
Authors: Andrea Ciampalini, Paolo Cignoni, Claudio Montani, Roberto Scopigno
Venue:  (1996)

Due to the surface meshes produced at increasing complexity in many applications, interest in efficient simplification algorithms and multiresolution representation is very high. An enhanced simplification approach together with a general multiresolution data scheme are presented here. Jade, a new simplification solution based on the Mesh Decimation approach has been designed to provide both increased approximation precision, based on global error management, and multiresolution output. Moreover, we show that with a small increase in memory, which is needed to store the multiresolution data representation, we are able to extract any level of detail representation from the simplification results in an extremely efficient way. Results are reported on empirical time complexity, approximation quality, and simplification power. TEL:: +39 050 593304
Jerry Hofmann on Final Cut Pro
Authors: Jerry Hofmann, Jim Heid
Venue:  (2002)

:Currently in version 3, Final Cut Pro is the only nonlinear editing tool available that supports the entire range of editing formats. Jerry Hoffman on Final Cut Pro is broken up into a collection of hands-on seminars that focus on teaching a specific aspect of Final Cut Pro. Dealing with both Final Cut Pro 3 and Final Cut Pro X, each seminar begins with a lesson that covers the concepts and techniques contained in that seminar. Hofmann then guides the reader step-by-step by applying those concepts and techniques to edit an award winning short film, The Midnight Sun. With this book, users will learn to convert footage from many different sources, manage their footage, edit the content, adjust sound, and output to different sources. If the reader chooses to work through the book cover-to-cover, they will put together an entire short film that includes basic editing, audio, compositing, and various effects. However, if the reader just wishes to learn a specific aspect of Final Cut Pro, they will be able to go right to the seminar that covers it, open the source files from the CD, and pick it right up.
An Iterative Method of Task Temporal Parameter Adjustment in Hard Real-Time Systems
Authors: F. Cottet, J.-Ph. Babau
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

The purpose of this work is to provide to the designer an iterative method of task temporal parameter adjustment in order to select the fitting characteristics for all the tasks obtained during the architectural design phase. We then present a method to analyse and to set the temporal parameters of tasks in a Rate Monotonic scheduling environment. So we have introduced a graphical representation for tasks based on a classical temporal model. This approach is particularly useful in situations in which the designer has to build a task set parameters iteratively, to add a task to a set of tasks with already fixed parameters or to modify the task parameters in order to improve time characteristics. This methodology permits the designer to enhance the temporal performance of the application in terms of task response time, processor idle time, number of processor context switches, etc..
A Novel Scheme of Transporting Pre-Stored MPEG Video in ATM Networks
Authors: Huirong Fu, Liren Zhang, Chee Hock Ng, K. R. Subramanian
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

This paper focuses on the optimization of network bandwidth allocation and buffer dimensioning in the transporting of pre-stored MPEG video data from a source to a playback destination. This is one of the most important issues to support video-on-demand service. This paper provides a novel scheme in the dynamic allocation of bandwidth to segments of video using ABR mode to ensure that the playback buffer neither underflows nor overflows. The proposed scheme is tested with real-life MPEG video traces. The obtained results have shown its significant performance improvement on the required capacity of playback buffer, the start-up playback delay, and the network multiplexing gain.
Reliability Optimization of Redundant Software with Correlated Failures
Authors: Walter J. Gutjahr
Venue: Proceedings of the The Ninth International Symposium on Software Reliability Engineering (1998)

Several authors have addressed the problem of reliability optimization of modular software with redundancy. At present, these approaches seem to be limited by the fact that they use statistical independence assumptions for different program versions. In view of strong empirical evidence of positive failure correlations between program versions, it is desirable to generalize these reliability optimization techniques by taking such correlations explicitly into consideration. In the presented paper, this is done based on a multiversion software failure correlation model tracing back to Eckhard and Lee. We show how taking failure correlation into account extends the corresponding optimization problems, and how they can be treated computationally. In particular, in the (practically relevant) case of components with relatively high reliability, the optimization problems reduce to knapsack-type problems which can, for relevant problem sizes, be solved with rather low computational effort. Also for the general case, solution techniques are outlined.
On Hamiltonian Cycles in Strong Products of Graphs
Authors: Kral Daniel, Maxova Jana, Podbrdsky Pavel, Samal Robert
Venue:  (2001)

We prove that the strong product $G_1\times\cdots\times G_n$ contains a hamiltonian cycle for $n\ge\Delta$ whenever all $G_i$ are connected graphs of maximum degree at most $\Delta$; in particular $G^{\Delta(G)}$ contains a hamiltonian cycle. For large $\Delta$ we prove the same statement for $n\approx c\Delta$ for any $c<\ln (25/12) +1/60$. The research was done as a part of Research Experience for Undergraduates programme; this is a joint programme of DIMACS at Rutgers University and DIMATIA at Charles University. The REU supervisors were J\''anos Koml\''os and Endre Szemer\''edi from Rutgers and Jan Kratochv\''{\i}l and Jaroslav Ne\v{s}et\v{r}il from Charles University.
A Study of Automatic Indexing for Patent Examination
Authors: Yohichi Ohmoli
Venue:  (1977)

NO 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
Formalization and Evaluation of Linear Relevance Feedback
Authors: S. K. M. Wong, Y. Y. Yao, Gerard Salton, Chris Buckley
Venue:  (1989)

This study outlines an adaptive method which constructs improved query vectors based on the user preference judgments on sample document pairs. In particular, the user states that some documents are preferred to other documents and the system is then expected to rank the preferred documents ahead of the others. In the adaptive system, all needed parameter values are provided within the model, and a solution query vector is constructed under well defined conditions. Certain relationships between the new adaptive and the conventional relevance feedback systems are discussed and evaluation data are provided to demonstrate the effectiveness of the system.
Graph Minimal Uncolorability is $D_{p}$-Complete
Authors: Jin Cai, Gabriele E. Meyer
Venue:  (1985)

In their excellent paper, C.H. Papadimitriou and M. Yannakakis [PY] asked whether the minimal-3-uncolorability problem is, among other Critical Problems, $D_{p}$-complete. This paper gives an affirmative answer to the above question. We show that minimal-$k$-uncolorability is $D_{p}$-complete, for all fixed $k \geq 3$. Furthermore, for $k$ = 3, the reduction can be modified by using ``sensitive'''' gadgets to resolve the planar case, bounded vertex degree case and their combination.
Introduction to MPEG-7: Multimedia Content Description Interface
Authors: Phillipe Salembier, Thomas Sikora
Venue:  (2002)

:The MPEG standards are an evolving set of standards for video and audio compression. MPEG 7 technology covers the most recent developments in multimedia search and retreival, designed to standardise the description of multimedia content supporting a wide range of applications including DVD, CD and HDTV.Multimedia content description, search and retrieval is a rapidly expanding research area due to the increasing amount of audiovisual (AV) data available. The wealth of practical applications available and currently under development (for example, large scale multimedia search engines and AV broadcast servers) has lead to the development of processing tools to create the description of AV material or to support the identification or retrieval of AV documents. Written by experts in the field, this book has been designed as a unique tutorial in the new MPEG 7 standard covering content creation, content distribution and content consumption. At present there are no books documenting the available technologies in such a comprehensive way.Presents a comprehensive overview of the principles and concepts involved in the complete range of Audio Visual material indexing, metadata description, information retrieval and browsingDetails the major processing tools used for indexing and retrieval of images and video sequencesIndividual chapters, written by experts who have contributed to the development of MPEG 7, provide clear explanations of the underlying tools and technologies contributing to the standardDemostration software offering step-by-step guidance to the multi-media system components and eXperimentation model (XM) MPEG reference softwareCoincides with the release of the ISO standard in late 2001.A valuable reference resource for practising electronic and communications engineers designing and implementing MPEG 7 compliant systems, as well as for researchers and students working with multimedia database technology.
Convergence and new operations in SDM
Authors: Gunnar Sjodin
Venue:  (2001)

A new method for converging in the SDM memory, utilizing the Jaeckel/Karlsson activation mechanism, is presented. A set of new operations to utilize the memory is introduced.
Exploring Fact Verbalisations for Conceptual Query Formulation
Authors: A. H.M. ter Hofstede, H. A. Proper, Th van der Winde
Venue:  (1996)

An increasing number of conceptual modelling techniques use verbalisation of sample data to derive a model for the given universe of discourse (the problem domain). The underlying assumption is that by elaborate verbalisation of samples taken from the universe of discourse one can elicit an overview of the concepts relevant for the universe of discourse and their interrelationships. In each of these approaches, information modelling is considered as a process leading to some form of an information grammar that describes the expert language; the language used to communicate in the universe of discourse. In this article we start by discussing a mechanism to support these verbalisations in the context of a conceptual query language. It is shown how these verbalisations lead to formulations that closely resemble the expert language.
More on Merging and Selection
Authors: Jeremy Gibbons
Venue:  (1997)

In his paper "On Merging and Selection" (Journal of Functional Programming 7(3), 1997), Bird considers the problem of computing the nth element of the list resulting from merging the two sorted lists x and y. Representing x and y by trees, Bird derives an algorithm for the problem taking time proportional to the sum of their depths. Bird''s derivation is more complicated than necessary. By the simple tactic of delaying a design decision (in this case, the decision to represent the lists as trees) as long as possible, we obtain a much simpler solution.
Optimizing TCP Start-up Performance
Authors: Yin Zhang, Lili Qiu, Srinivasan Keshav
Venue:  (1999)

The performance of many networking protocols is dependent on a handful of tuning parameters. However, it is not obvious how to set or adapt these parameters to optimize performance. We believe that this optimization task can benefit from passive monitoring of current network performance. In this paper, we apply this methodology for initializing TCP parameters, such as initial congestion window size and slow start threshold for short connections. We analytically derive the optimal initial parameters, and use simulations to study its effectiveness. Our innovations include: (i) derivation of optimal TCP initial parameters as a function of link characteristics; (ii) abstract a communication path as a virtual link and model cross traffic as perturbation on it; (iii) an efficient architecture for network performance discovery; (iv) a new pacing algorithm that combines leaky bucket flow control with traditional window-based flow control. Our results show this approach leads to significant performance improvement.