ppxscal/embedding_network huggingface dataset:
Optimal Parallel and Sequential Algorithms for the Vertex Updating Problem of a Minimum Spanning Tree
Authors: Donald B. Johnson, Panagiotis Metaxas
Venue:  (1991)

We present a set of rules that can be used to give optimal solutions to the vertex updating problem for a minimum spanning tree: Update a given MST when a new vertex z is introducted, along with weighted edges that connect z with the vertices of the graph. These rules lead to simple parallel algorithms that run in O(lg n) parallel time using n/lg n EREW PRAMs. They can also be used to derive simple linear-time sequential algorithms for the same problem. Furthermore, we show how our solution can be used to solve the multiple vertex updating problem.
Orthogonal Rotation to a Partially Specified Target
Authors: Franklin T. Luk
Venue:  (1981)

This paper addresses the problem of finding an orthogonal transformation of an arbitrary factor solution that would lead to a least squares fit of a partially specified target matrix. An iterative computing procedure is presented. Key words: orthogonal rotations, factor analysis, least squares, partially specified target, procrustes problem.
Deep Sub-Micron Static Timing Analysis in Presence of Crosstalk
Authors: Peivand F. Tehrani, Shang Woo Chyou, Uma Ekambaram
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

A complete and accurate method for static timing analysis of deep sub-micron devices in presence of crosstalk is introduced. This scheme provides an efficient platform for fast and accurate static timing verification of large scale transistor and cell level netlists, with coupled interconnects and high switching speeds. This paper presents the solution to the crosstalk problem implemented in the static timing tool PathMill as its crosstalk extension (CTX). A comparison of simulation results between this approach and SPICE is also provided.
Selection Process of Intelligent Decision Support Tool for Real-Time Monitoring System
Authors: Haleh Vafaie, Mark Shaughnessy, Thomas Bethem, Janet Burton
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

The decision support tool market has seen exponential growth in recent years, with introduction of different tools for various applications and domains. These include tools that can perform data mining, on-line analysis and reporting, and expert systems (rule-based, and case-based systems.This paper presents an approach for evaluating and selecting intelligent decision supports tools suitable for capturing expert's knowledge and deploying this knowledge where applicable.
ESD: Design For IC Chip Quality and Reliability
Authors: Charvaka Duvvury
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

ESD is a major concern for IC chip quality both as as building-in-reliability requirement and as a need for long-term field operation requirement. The damage phenomena, either from human handling or machine contact, could appear as thermal damage and oxide rupture. In this paper, the IC damage phenomena due to ESD, the effects on the IC functionality, the proper methods to overcome these with on-chip protection designs, and the challenges facing these protection methods with the advanced process and package technologies will be presented. Simulation and modeling methods that are currently used to improve the protection designs will also be reviewed.
A Program Behavior Model and Its Evaluation
Authors: A M Holliday
Venue:  (1990)

We propose a program behavior model that generates address reference strings including the interreference durations. This method views a trace as the sample path of a semi-Markov process. The transition probability and sojourn matrices of that process are inferred. Though equally applicable to traces from sequential programs, we experimentally evaluate the model on the shared data traces of the individual processes of a range of realistic parallel programs executing on a shared memory multiprocessor. The results are encouraging not only in that the model generates traces that closely approximate the original, but also in that the model is fairly parsimonious in that the order of the embedded Markov chain is low and the associated matrices are very sparse. 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
Good Features to Track
Authors: Jianbo Shi, Carlo Tomasi
Venue:  (1993)

No feature-based vision system can work until good features can be identified and tracked from frame to frame. Although tracking itself is by and large a solved problem, selecting features that can be tracked well and correspond to physical points in the world is still an open problem. We propose a feature selection criterion that is optimal by construction because it is based on how the tracker works, as well as a feature monitoring method that can detect occlusions, disocclusions, and features that do not correspond to points in the world. These methods are based on a new tracking algorithm that extends previous Newton-Raphson style search methods to work under affine image transformations. We test performance with several simulations and experiments on real images.
Developments in System Architecting
Authors: M. W. Maier
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Systems Architecting is an approach to complex and multi-disciplinary system development inspired by the insights of civil and naval architecting. The architect is responsible for establishing a satisfactory and feasible system concept at the earliest stage of system development, for maintaining the integrity of that concept throughout development, and for certifying the fitness of the resulting system for use by the client or customer. The twentieth century history of unprecedented system development indicates that gifted individuals, following an architectural approach, were at the center of successful systems developments. As this paradigm has gained attention, new developments have taken place. Among them are an emerging formalization of architecting methods, identification of research needs, and new education programs.
An Approximate Max-flow Min-cut Relation for Multicommodity Flow and its Applications
Authors: Philip Klein, Ajit Agrawal, R. Ravi, Satish Rao
Venue:  (1991)

In this paper, we prove the first approximate max-flow min-cut theorem for general multicommodity flow. We show that for a feasible flow to exist in a multicommodity problem, it is sufficient that every cut''s capacity exceeds its demand by a factor of $\mbox{O}(\log C \log D)$, where $C$ is the sum of edge capacities and $D$ is the sum of demands. Moreover, our theorem yields an algorithm for finding a cut that is approximately minimum {\it relative} to the flow that must cross it. We use this result to obtain approximation algorithms for minimum deletion of clauses of a 2-CNF$\equiv$ formula, via minimization, and other problems.
On Sparse Sets in NP-P
Authors: Juris Hartmanis
Venue:  (1982)

The main result of this note shows that there exist sparse sets in $NP$ that are not in $P$ if and only if NEXPTIME differs from EXPTIME. Several other results are derived about the complexity of very sparse sets in $NP-P$ and an interpretation of the meaning of these results is given in terms of the complexity of solving ``individual instances'''' of problems in $NP-P$.
Magnetic susceptibility: solutions, emulsions, and cells
Authors: P. W. Kuchel, B. E. Chapman, W. A. Bubb, P. E. Hansen, C. J. Durrant, M. P. Hertzberg
Venue: Concepts in Magnetic Resonance: an Educational Journal (2003)

Differences in magnetic susceptibility between various compartments in heterogeneous samples can introduce unanticipated complications to NMR spectra. On the other hand, an understanding of these effects at the level of the underlying physical principles has led to the development of several experimental techniques that provide data on cellular function that are unique to NMR spectroscopy. To illustrate some key features of susceptibility effects we present, among a more general overview, results obtained with red blood cells and a recently described model system involving diethyl phthalate in water. This substance forms a relatively stable emulsion in water and yet it has a significant solubility of ∼5 mmol L-1 at room temperature; thus, the NMR spectrum has twice as many resonances as would be expected for a simple solution. What determines the relative intensities of the two families of peaks and can their frequencies be manipulated experimentally in a predictable way? The theory used to interpret the NMR spectra from the model system and cells was first developed in the context of electrostatics nearly a century ago, and yet some of its underlying assumptions now warrant closer scrutiny. While this insight is used in a practical way in this article, the accompanying article deals with the mathematics and physics behind this new analysis.
Geodesic Active Regions for Supervised Texture Segmentation
Authors: Nikos Paragios, Rachid Deriche
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

This paper presents a novel variational method for supervised texture segmentation. The textured feature space is generated by filtering the given textured images using isotropic and anisotropic filters, and analyzing their responses as multi-component conditional probability density functions.The texture segmentation is obtained by unifying region and boundary-based information as an improved Geodesic Active Contour Model. The defined objective function is minimized using a gradient-descent method where a level set approach is used to implement the obtained PDE.According to this PDE, the curve propagation towards the final solution is guided by boundary and region-based segmentation forces, and is constrained by a regularity force. The level set implementation is performed using a fast front propagation algorithm where topological changes are naturally handled. The performance of our method is demonstrated on a variety of synthetic and real textured frames.
Ink Texture Analysis for Writer Identification
Authors: Katrin Franke, Ottmar Bünnemeyer, Thorsten Sy
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper presents an approach for ink type recognition. Ink type classes will be derived from the physical properties of ink. Ink specific trace morphologies are considered as textures. From these discriminant texture features of the cooccurrence matrix will be derived. The proposed method for automated ink type recognition was tested using 62 different kinds of pens andrefills. The achieved recognition result of 99.7% for 600 dpi and 98.4% for 300 dpi handwritings further promotes the study of trace morphologies in particular for application in forensic writer identification.
A Hardware/Software Co-Design Method of ITS Image Processing Development
Authors: Yu Endo, Hisao Koizumi
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In this article, a hardware and software co-design method for the Intelligent Transport Systems (ITS) image processing system is proposed. The objective of this method is to optimize the division of functions between hardware and software by the optimum trade-off. Under this method, first, the targeted overall system is modeled by software, and then functions and structures are adjusted. The performance of each function of software and hardware in the model is evaluated by simulation, and the optimized division of functions between hardware and software is obtained. Each functionally divided process of hardware and software is re-designed and fine-tuned and then the co-design test board in order to quickly design and construct a system, which satisfies the design objectives, verifies operations. The ITS image processing development area is chosen as an application example for this method and its effectiveness is verified by evaluating the construction of a safe driving support system.
A Separator Theorem for Graphs of Bounded Genus
Authors: John R. Gilbert, Joan P. Hutchinson, Robert E Tarjan
Venue:  (1982)

Many divide-and-conquer algorithms on graphs are based on finding a small set of vertices or edges whose removal divides the graph roughly in half. Most graphs do not have the necessary small separators, but some useful classes do. One such class is planar graphs: If we can draw an n-vertex graph on the plane, then we can bisect it by removing $O(\sqrt{n})$ vertices [Lipt79b]. The main result of this paper is that if we can draw a graph on a surface of genus g, then we can bisect it by removing $O(\sqrt{gn})$ vertices. This bound is best possible to within a constant factor. We give an algorithm for finding the separator that takes time linear in the number of edges in the graph, given an embedding of the graph in its genus surface. We discuss some extensions and applications of these results.
Interactive Animation of Fault-Tolerant Parallel Algorithms
Authors: Scott W. Apgar
Venue:  (1992)

Animation of algorithms makes understanding them intuitively easier. This paper describes the software tool Raft (Robust Animator of Fault-Tolerant Algorithms). The Raft system allows the user to animate a number of parallel algorithms that achieve fault-tolerant execution. In particular, we use it to illustrate the key WRITE-ALL problem. It has an extensive user interface which allows a choice of the number of processors, the number of elements in the WRITE-ALL array and the adversary to control the processor failures. The novelty of the system is that the interface allows the user to create new online adversaries as the algorithm executes.
Transmission scheduling for fieldbus: a strategy to schedule data and messages on the bus with end-to-end constraints
Authors: L. R. H. R. Franco
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

The transmission scheduling for fieldbus has been addressed until now to minimize the number of data. It does not take into account the temporal dependency of data. Usually, the approaches of transmission scheduling for fieldbus let to the application processes to decide whether to use old values or not. The objective of this paper is to show how to adapt Gerber's methodology to generate a scheduling table of a set of periodic and aperiodic data from application processes to be transmitted through a fieldbus, guaranteeing their end-to-end constraints; and how this can be done in according to IEC 1158. This strategy obviates the transmission of old and useless data to application, thus optimizing the fieldbus scheduling.
A Parallel Algorithm with Embedded Load Balancing for Autocorrelation Matrix Computation
Authors: S. R. Subramanya
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

The computation of autocorrelation matrix is used heavily in several areas including signal and image processing, where parallel and application-specific architectures are also being increasingly used. Therefore, an efficient scheme to compute autocorrelation matrix on parallel architectures has tremendous benefits. In this paper, a parallel algorithm for the computation of autocorrelation matrix on 2-D mesh is presented. The computation requirements for the elements of the autocorrelation matrix is highly skewed and the proposed algorithm attempts to balance the computation load, without requiring an external load balancing algorithm or processor. In this sense, the load balancing is embedded within the algorithm. The exact number of computation steps are derived. The time complexity of the proposed algorithm is shown to be within twice the optimal (or lowerbound). It is also shown to have twice the speedup of a straight-forward parallel algorithm.
Making Mail Friendlier: Adding Macintosh features and multimedia documents in UNIX mail
Authors: John R. Meier
Venue:  (1986)

This paper describes a Macintosh application which acts as a front-end to Unix mail. Features of the Macintosh interface such as icons, menus, and windows replace the command driven interface. Complicated editing commands are replaced with mouse selection and cut, copy, and paste. Message can be composed of text, pictures, and any Macintosh file, because they are encoded into plain text, sent through the mail system,and then unencoded by the receiving end. The designs of the mail server and communications interface are such that mail servers and communications other than Unix mail and a serial line may be easily implemented.
An Operating System Development Environment
Authors: Robert Boyer
Venue:  (1991)

An operating system development environment has been created that allows prototype operating systems to be built, debugged, and executed as user-mode applications running on a host workstation. Operating system code can be written entirely in a high-level language, and the host system''s compilers, debuggers, profilers, and any other available development tools can be used throughout the development process. The environment presents a conceptual machine to the operating system developer consisting of a single processor with virtual memory support, a priority interrupt scheme, kernel and user-mode stacks, and simulated peripheral devices. Special instructions present in most machine architectures, such as traps and privileged processor instructions, are emulated by having the prototype operating system call special-purpose library procedures. Priority-driven device interrupts are simulated by altering the context of the running operating system to directly invoke interrupt handlers and to restore the interrupted context upon handler exit. 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
High-quality FPGA Designs through Functional Decomposition with Sub-function Input Support Selection Based on Information Relationship Measures
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Functional decomposition seems to be the most effective circuit synthesis approach for look-up table (LUT) FPGAs, (C)PLDs and complex gates. Since LUT FPGAs are used in numerous important applications and constitute a foundation for the novel re-configurable system-on-a-chip platforms, an adequate synthesis for this target is of primary importance for the modern system industry. In the functional decomposition targeting LUT FPGAs, the circuit is constructed by recursively decomposing a given function and its sub-functions until each of the resulting sub-functions can be directly implemented with a LUT. The input support selection for the sub-functions that are constructed in this process decides the quality of the resulting multi-level circuit to a high degree. In this paper, we propose a new effective method for the sub-function input support selection and discuss its application in our circuit synthesis tool that targets LUT-based FPGAs. The experimental results demonstrate that the proposed approach leads to extremely fast and very small circuits. The circuits consume on average over 2 times less logic blocks (CLBs) and are over 1.5 times faster than the circuits produced by the best state-of-the-art commercial tools.
Shape nature of error-control codes
Authors: Janak Sodha, Adrian Als
Venue: Signal Processing (2003)

In this paper we demonstrate that the perception of a shape property within error-control codes provides an alternative insight to their error-control capability. This insight may lead to the development of a new class of error-control codes based on shapes. To demonstrate the concept of shape, we illustrate the shape nature of convolutional codes within the Viterbi, maximum a posteriori, and Turbo decoding algorithms. We also introduce the concept of shape codes, in which binary information digits are mapped onto predefined imaginary shapes within a given signal constellation, and make use of these predefined shapes to provide a coding gain at very low signal-to-noise ratios, with a penalty of a reduction in the information throughput.
A Case for Economy Grid Architecture for Service Oriented Grid Computing
Authors: Rajkumar Buyya, David Abramson, Jonathan Giddy
Venue: Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2 (2001)

Computational Grids are a promising platform for executinglarge-scale resource intensive applications. However, resource management and scheduling in the Grid environment is a complex undertaking as resources are (geographically) distributed, heterogeneous in nature, owned by different individuals or organizations with their own policies, have different access and cost models, and have dynamically varying loads and availability. This introduces a number of challenging issues such as site autonomy, heterogeneous interaction, policy extensibility, resource allocation or co-allocation, online control, scalability, transparency, resource brokering, and "computational economy".A number of Grid systems (such as Globus and Legion)have addressed many of these issues with exception of acomputational economy. We argue that a computationaleconomy is required in order to create a real world scalableGrid because it provides a mechanism for regulating the Gridresources demand and supply. It offers incentive for resourceowners to be part of the Grid and encourages consumers tooptimally utilize resources and balance timeframe and accesscosts. We propose a 'computational economy framework' thatbuilds on the existing Grid middleware systems and offers aninfrastructure for resource management and trading in theGrid environment. We discuss the usage economic models forresource trading in the Nimrod/G resource broker and presentdeadline and cost-based scheduling experimental results onthe Grid.
X-MAS: Mobile Agent Platform for Workflow Systems with Time Constraints
Authors: Jeong-Joon Yoo, Dong-Ik Lee
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Mobile agents have many useful properties in workflow systems. Nevertheless, not much work of mobile agent systems for agent-based workflow systems has been done. In this paper, we describe some components to be considered in mobile agent platforms for workflow systems with time constraints.