ppxscal/embedding_network huggingface dataset:
Web Page Caricatures: Multimedia Summaries for WWW Documents
Authors: Michael Wynblatt, Dan Benson
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

This paper addresses the problem of rapid browsing of a large set of World Wide Web documents, such as the results of a search engine query or a bookmark list. Traditional presentations of such lists are in the form of text, and require careful attention and often laborious efforts in order to discover relevant documents. We propose a visual representation of documents, called a caricature, which emphasizes the key points of a document in a way which quickly conveys these points to the user, and thus facilitates document selection. We describe a representation-independent WWW document summary, called a feature vector, which includes novel techniques for determining link density and a representative image among other features. An example caricature template for this feature vector is given, along with several examples of caricatures.
All-fault-tolerant embedding of a complete binary tree in a group of Cayley graphs
Authors: Chiun-Chieh Hsu
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

This paper proposes an approach for embedding a complete binary tree with height k X (n-2k+1) + (k-2) X 2k+1, where k = [log n], into an n-dimensional complete transposition graph (CTn), star graph (STn), and bubblesort graph (BSn) with dilations 1,3, and 2n-3 respectively. Furthermore, a fault-tolerant scheme is developed to recover multiple faults, and the dilations after recovery become at most 3,5, and 2n-1 for the CTn, STn, and BSn respectively.
An Overview and Comparison of Voting Methods for Pattern Recognition
Authors: Merijn van Erp, Louis Vuurpijl, Lambert Schomaker
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In pattern recognition, there is a growing use of multiple classifier combinations with the goal to increase recognition performance. In many cases, plurality voting is a part of the combination process. In this article, we discuss and test several well known voting methods from politicsand economics on classifier combination in order to see if an alternative to the simple plurality vote exists. We found that, assuming a number of prerequisites, better methods are available, that are comparatively simple and fast.
Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding
Authors: G P Howard, Scott J Vitter
Venue:  (1994)

We give a detailed algorithm for fast text compression. Our algorithm, related to the PPM method, simplifies the modeling phase by eliminating the {\em escape\/} mechanism, and speeds up coding by using a combination of {\em quasi-arithmetic coding\/} and Rice coding. We provide details of the use of quasi-arithmetic code tables, and analyze their compression performance. Our {\em Fast PPM\/} method is shown experimentally to be almost twice as fast as the PPMC method, while giving comparable compression.
Reliability Analysis of the Systems with Many States on the Basis of the Algebra of Tuples
Authors: B. A. Kulik
Venue: Automation and Remote Control (2003)

A new approach to the modeling and analysis of systems with many states is set out, which makes it possible to perform calculations of probability characteristics of these systems. This approach relies on the algebra of tuples, with the aid of which a system with many states is represented in the form of an aggregate of multiple relations, so that the system proves to be isomorphic to the algebra of sets.
Hypercharts: extended statecharts to support hypermedia specification
Authors: F. B. Paulo, P. C. Masiero, M. C. F. de Oliveira
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

This paper introduces hypercharts, a novel and effective model that extends the well-known statechart formalism to make it suitable for the specification of the temporal and information synchronization requirements of hypermedia applications. Three new definitions are added: timed history, timed transitions and a set of synchronization mechanisms. The proposed extensions are based on the major characteristics of some Petri net based multimedia models, and have their semantics described in the paper in terms of conventional statechart models.
Software Reliability and Maintenance Concept Used for Automatic Call Distributor MEDIO ACD
Authors: M. Popovic, V. Kovacevic, M. Skrbic
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

In the paper we present the software reliability and maintenance concept, which we use in the software development, testing, and maintenance process, for automatic call distributor MEDIO ACD. The concept has been successfully applied on systems, which are installed and operational in Moscow and Saint Petersburg, Russia. In the paper, we have concentrated on two main issues, as follows: (i) Set of fault-tolerant mechanisms needed for the system exploitation (error logging, checkpoint-restart, overload protection and tandem configuration support). (ii) MEDIO ACD software maintenance concept, in which quality of the new software update is predicted on the base of current update's metrics and quality, and new update's metrics. This forecast aids software maintenance efficiency, and costs reduction.
Computational Cost Reduction in Extracting Inductance
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Until now, the miniaturization by scaling law has developed the technology of VLSI circuits. With this miniaturization much faster speed and much better performance circuits have been obtained. This miniaturization is expected to continue and the clock speed will become much faster than now, which means that we have to encounter a problem that is caused by inductance. In these background there are a lot of papers in extraxting inductance. At the same time calculating inductance is considered very tiresome task because it needs a lot of computational cost of that. In this paper we introduce new ideas and new methods to reduce computational cost of calculating inductance. We have developed a frequency dependent inductance calculation simulator for cost reduction of calculating inductance and found that the results of the simulator had a good agreement with those of the conventional methods. With this simulator we also show some effects of inductance in circuit behavior. 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
Comprehending by varying Focal Distance
Authors: Roland T. Mittermeir
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

While we are used to vary levels of abstraction during software development and while these variations are at least partially supported by tools, the tools aiding in software comprehension can currently not be understood as zoom lenses providing stereovision. The extended abstract given below addresses the comprehension issue from the perspective of the relationship between forward and backward engineering.
Using object oriented analysis and design in a non-object oriented environment experience report
Authors: K. Williams
Venue: Proceedings of the International Conference on Software Maintenance (1995)

The paper is an experience report about using James Rumbaugh's Object Modeling Technique (OMT) in Allen-Bradley's 6200 Series Programming Software for Programmable Controllers (6200). It explores three stages of subsystem development: analysis, design, and implementation. For each stage, a brief description of the Object Modeling Technique is given. Also included are solutions to obstacles that were overcome while working on the project. Metrics were kept during the development and independent test of the two object oriented subsystems that were introduced into 6200. These metrics compare the object oriented (OO) subsystems to structured analysis/structured design (SA/SD) subsystems of roughly the same complexity and in the same area of the product as the object oriented subsystem. The metrics presented are: number of function points, length of time spent in each development stage, number of lines of code and number of functions for the subsystem, number of defects found by an independent test group (categorized by development stage), and length of time required to fix the defects.
The limits of input-queued switch performance with future packet arrival information
Authors: Timothy X. Brown, Harold N. Gabow
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

This paper investigates the benefit of a hypothetical oracle that gives future packet arrival information in a fixed-size-packet switch. While future information has no effect on output-queued (OQ) switch performance, this paper shows in simulation, the input-queued (IQ) switch with no switch fabric speed up has wait-time and buffer-size performance close to that of the OQ switch even with only a few time slots of future information. This finding suggests that the performance difference between input and OQ switches may be smaller than previous studies suggest. This paper investigates the theoretical aspects of using future information and shows the following. IQ switches are proved equivalent (in number of packets sent) to OQ switches for 2 inputs and 2 outputs. A linear-time algorithm is presented for achieving this equivalence. Larger switches are strictly not equivalent, and optimally using future information is in the worst case NP-hard A heuristic that simplifies using the future information is investigated and found to be sub-optimal in rare instances for larger switches while optimal for 2 × 2 switches.
Algorithms for a Job-Scheduling Problem within a Parallel Digital Library
Authors: Norbert Sensen
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

In this paper we examine a new scheduling problem that shows up in the construction of a parallel digital library. This library performs a large amount of operations on a huge amount of stored data items. As each single operation is sequential, the data items and the sequential operation have to "meet" on one processor. Thus, a scheduling and dynamic mapping problem has to be solved to optimize the overall throughput of the server system.We present a theoretical model of this new scheduling problem and analyze heuristics for it. These heuristics use greedy strategies and local search principles; their performance is valued comparing the results with a lower bound which bases on a lp-relaxation. We have done a large amount of experiments due to get knowledge of the behavior of the heuristics.
Design Techniques for Gate-Leakage Reduction in CMOS Circuits
Authors: Rafik S. Guindi, Farid N. Najm
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

Oxide tunneling current in MOS transistors is fast becominga non-negligible component of power consumptionas gate oxides get thinner, and could become in the futurethe dominant leakage mechanism in sub-100nm CMOS circuits.In this paper, we present an analysis of static CMOScircuits from a gate-leakage point of view. We first considerthe dependence of the gate current on various conditionsfor a single transistor, and identify 3 main regionsin which a MOS transistor will operate between clock transitions.The amount of gate-current differs by several ordersof magnitude from one region to another. Whether atransistor will leak significantly or not is determined by itsposition in relation to other transistors within a structure.By comparing logically equivalent but structurally differentCMOS circuits, we find that the gate current exhibitsa structure dependence'. Also, the total gate-leakage ina given structure varies significantly for different combinationsof inputs, from which we derive "state-dependentgate-leakage tables" that can be used to estimate the totalamount of gate-current for a large circuit. Finally, wesuggest guidelines aimed at reducing the amount of oxide-leakagecurrent based on the presented structure and statedependencies.
A Quorum-Based Commit Protocol
Authors: Dale Skeen
Venue:  (1982)

Herein, we propose a commit protocol and an associated recovery protocol that is resilient to site failures, lost messages, and network partitioning. The protocols do not require that a failure be correctly identified or even detected. The only potential effect of undetected failures is a degradation in performance. The protocols use a weighted voting scheme that supports an arbitrary degree of data replication (including none) and allows unilaterally aborts by any site. This last property facilitates the integration of these protocols with concurrency control protocols. Both protocols are centralized protocols with low message overhead.
Formal definition of self-reproductive systems
Authors: Pavel O. Luksha
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Formal definition of self-reproduction may have importance the Alife research program, especially for application of its achievements outside the discipline. The paper examines two formal definitions of self-reproduction, suggested by McMullin and Löfgren. It is pointed out that these definitions form two major branches of self-reproduction analysis, described by ancestor-progeny and system-environment relationship. The ancestor-progeny definition allows to distinct between the exact / inexact reproduction. The system-environment definition brings in the original classification also allowing to differentiate between major classes of self-reproducers.
A Probabilistic Analysis of Marker-Passing Techniques for Plan Recognition
Authors: Glenn Carroll, Eugene Charniak
Venue:  (1991)

Useless paths are a chronic problem for marker-passing techniques. We use a probabilistic analysis to justify a method for quickly identifying and rejecting useless paths. Using the same analysis, we identify key conditions and assumptions necessary for marker passing to perform well.
Successful studio-based real-world projects in IT education
Authors: Matthew Simpson, Jay Burmeister, Alan Boykiw, Jihan Zhu
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

An important aspect of University teaching is to promote deeper learning by ensuring students have good exposure to problems they will encounter in their working life. While it is not possible to reproduce every situation that will occur in an area of employment, it is possible to provide students with experience from which they can utilise principles and approaches in order to gain the necessary skills to address whatever scenario may arise. This paper looks at the nature of studio-based teaching and the pedagogy that supports it, through examining two case studies as a catalyst for exploring real-world projects. It is through the discussion of aspects such as real-world clients, user involvement, sequencing and integration that the success of studio-based teaching in IT can be revealed.
The mixing evolutionary algorithm - independent selection and allocation of trials -
Authors: Cees H.M. Kemenade
Venue:  (1997)

When using an evolutionary algorithm to solve a problem involving building blocks we have to grow the building blocks and then mix these building blocks to obtain the (optimal) solution. Finding a good balance between the growing and the mixing process is a prerequisite to get a reliable evolutionary algorithm. Different building blocks can have different probabilities of being mixed. Such differences can easily lead to a loss of the building blocks that are difficult to mix and as a result to premature convergence. By allocating relatively many trials to individuals that contain building blocks with a low mixing probability we can prevent such effects. We developed the mixing evolutionary algorithm (mixEA) in which the allocation of trials is a more explicit procedure than in the standard evolutionary algorithms. Experiments indicate that the mixEA is a reliable optimizer on a set of building block problems that are difficult to handle with more traditional genetic algorithms. In the case that the global optimum is not found, the mixEA creates a small population containing a high concentration of building blocks.
D-Stampede: Distributed Programming System for Ubiquitous Computing
Authors: Sameer Adhikari, Arnab Paul, Umakishore Ramachandran
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

We focus on an important problem in the space of ubiquitous computing, namely, programming support for the distributed heterogeneous computing elements that make up this environment. We address the interactive, dynamic, and stream-oriented nature of this application class and develop appropriate computational abstractions in the D-Stampede distributed programming system. The key features of D-Stampede include indexing data streams temporally, correlating different data streams temporally, performing automatic distributed garbage collection of unnecessary stream data, supporting high performance by exploiting hardware parallelism where available, supporting platform and language heterogeneity, and dealing with application level dynamism. We discuss the features of D-Stampede, the programming ease it affords, and its performance.
Balanced Graphs and Network Flows
Authors: S. Penrice
Venue:  (1995)

A graph $G$ is {\em balanced\/} if the maximum ratio of edges to vertices, taken over all subgraphs of $G$, occurs at $G$ itself. This note uses the max-flow/min-cut theorem to prove a good characterization of balanced graphs. This characterization is then applied to some results on how balanced graphs may be combined to form a larger balanced graph. In particular, we show that edge-transitive graphs and complete $m$-partite graphs are balanced, that a product or lexicographic product of balanced graphs is balanced, and that the normal product of a balanced graph and a regular graph is balanced. 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
InDesign for QuarkXPress Users
Authors: Blatner, Christopher Smith, Steve Werner
Venue:  (2003)

:While QuarkXPress is the most-widely used page-layout program in the world, Adobe InDesign is rapidly gaining ground with better typography and transparency features, speedier performance, and more overall control. Plus, InDesign 2 is Mac OS X native, QuarkXPress 5 isn't. But if you're a QuarkXPress user thinking of making the switch to InDesign, you know you can't afford to lose time and productivity at the office while learning a new program. Thanks to InDesign for QuarkXPress Users, you don't have to.InDesign for QuarkXPress Users is the only book on the market that shows experienced graphic designers how to use InDesign from a QuarkXPress user's perspective. Using an easy-to-read and easy-to-digest style, this unique title focuses on common tasks, giving you quick solutions rather than bogging you down with lengthy theory. Written by well-known experts in the field, the book is abundantly illustrated and covers topics such as using InDesign's transparency features (possible in QuarkXPress only by unwieldy workarounds), and making the most of master pages and style sheets. It's also loaded with real-world tips on how you can apply your QuarkXPress know-how to this up-and-coming software.
Dreamweaver MX: Advanced Asp Web Development
Authors: Edward Apostol, Omar Elbaga, Rob Turnbull, Daniel G. Short
Venue:  (2003)

:This book will take your existing knowledge of ASP and Dreamweaver and develop it further. Using the knowledge contained in this book, you'll be able to take your web applications to the next level. This book is for web professionals who want to further their knowledge of creating ASP web applications using Macromedia Dreamweaver MX, and learn professional techniques to make more powerful and efficient code. It assumes that reader has some experience of using Dreamweaver MX to create ASP web sites
Three-dimensional DCT video compression technique based on adaptive quantizers
Authors: R. Westwater, B. Furht
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

In this paper, we describe a real-time video compression algorithm, based on Three-Dimensional Discrete Cosine Transform. The algorithm, called XYZ video compression, takes advantage of statistical behavior of video data both in spatial and temporal domains. We develop an algorithm for determining optimal quantizers for the three-dimensional DCT. We also add human visual factors into the optimal quantizers. The obtained results show a significant superiority of the proposed algorithm compared to the MPEG standard in term of the duality of the video, compression ratios, and its real-time implementation.
Nonlinear Wave Equations for Relativity
Authors: Maurice H. P. M. van Putten, Douglas M. Eardley
Venue:  (1995)

Gravitational radiation is described by canonical Yang-Mills wave equations on the curved space-time manifold, together with evolution equations for the metric in the tangent bundle. The initial data problem is described in Yang-Mills scalar and vector potentials, resulting in Lie-constraints in addition to the familiar Gauss-Codacci relations
Nuprl as a Generic Theorem Prover
Authors: Roderick Moten
Venue:  (1996)

Logical Frameworks are one way to provide generic theorem provers. This paper describes another method using loose semantics. In the paper, we explain loose semantics, describes its use in building a programming calculus in the style of Back''s refinement calculus, and relates the idea to Logical Framework or General Logic. Viewing Nuprl as a generic theorem prover using loose semantics can be used to describe the inference engine of Nuprl 4. This is the first attempt to explain the system design of Nuprl and relate it to the code. 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
Justifying Calculational Logic by a Conventional Metalinguistic Semanti cs
Authors: Eric Aaron, Stuart Allen
Venue:  (1999)

We provide a metalinguistic formalization of calculational logic, an alternative to higher-order logic for escaping the restrictions of first-order logic. We show that conventional semantic techniques can provide an adequate foundation for calculational logic, even its atypical metalinguistic features.
Simulation of welding and stress relief heat treatment of an aero engine component
Authors: D. Berglund, H. Alberg, H. Runnemalm
Venue: Finite Elements in Analysis and Design (2003)

It is important to control key dimensions in aero engine components during manufacture. This is achieved by finding a stable process-parameter window for each manufacturing operation and to choose an order of manufacture which give an adequate result. Production planning has traditionally been carried out from experience and experiments. However, in order to reduce lead-time and cost, computer based numerical simulations using the finite element method is increasingly being used. Simulations can give valuable information about component dimensions, shape, and residual stresses after each manufacturing process. This paper presents a method and the results of a simulation where welding and stress relief heat treatment operations are combined. Computational fluid dynamics was also used to estimate the heat transfer coefficient of the component's surface during the heat treatment.