ppxscal/embedding_network huggingface dataset:
A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes
Authors: Ding-Ming Kwai, Behrooz Parhami
Venue: Proceedings of the international Conference on Parallel Processing (1997)

We introduce a pruning scheme to reduce the node degree of k-ary n-cube from 2n to 4. The links corresponding to n - 2 of the n dimensions are removed from each node. One of the remaining dimensions is common to all nodes and the other is selected periodically from the remaining n - 1 dimensions. Despite the removal of a large number of links from the k-ary n-cube, this incomplete version still preserves many of its desirable topological properties. In this paper, we show that this incomplete k-ary n-cube belongs to the class of Cayley graphs, and hence, is node-symmetric. It is 4-connected with diameter close to that of the k-ary n-cube.
Thermal placement for high-performance multichip modules
Authors: Kai-Yuan Chao, D. F. Wong
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

A placement scheme that considers both electrical performance requirements and thermal behavior for the high-performance multichip modules is described in this paper. Practical thermal models are used for placement of high-speed chips in multichip module packages under two different cooling environments: conduction cooling and convection cooling. Placement methods are modified to optimize conventional electrical performance and chip junction temperatures.
An Investigation: Reengineering Sequential Procedure-Driven Software into Object-Oriented Event-Driven Software through UML Diagrams
Authors: Richard Millham
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Reengineering a COBOL legacy system is a difficult multi-step process, particularly when the COBOL legacy system is a sequential procedural-driven system which is being reengineered into an object oriented, event-driven system. In this scenario, it is necessary to analyse the legacy system in order to identify possible objects with their attributes and methods within the code and to determine how the legacy system's variables and procedures interrelate in order to model pseudo-events from strictly sequential code. The focus of reengineering is too often based on theory rather than based on experience gained from real-world examples. This paper hopes to address this imbalance by providing a practical application of reengineering to an actual legacy telecommunications system.
Proving Integrality Gaps without Knowing the Linear Program
Authors: Sanjeev Arora, Béla Bollobás, László Lovász
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic approach. We prove an integrality gap of 2 - o(1) for three families of linear relaxations for vertex cover, and our methods seem relevant to other problems as well.
Three-Dimensional Reconstruction of Urban Scenes from a Single Image
Authors: Fabio Policarpo, Eduardo Azevedo, Aura Conci
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This work presents a method to output the 3D structure of an urban area from only one aerial photo. The reconstruction is based on the inverse process done when a parallel projection is used to construct a two-dimensional image from a three-dimensional object. A new algorithm for reconstruction is developed and implemented. It recovers depth information by identification of object height on the image plane. While the 3D-objects are reconstructed, their original texture is used for rendering, using control points defined by the user. Results show that when seen from the same capture angle, the virtual 3D scene and the original picture are exactly the same. In the virtual environment of this implementation, the user can visualize, visit and interact with the structure of the 3D scenario. The spatial structure of the real world is recovered at real time; it is possible to see the 3D growing out of the 2D images.
Partitionability of the Multistage Interconnection Networks
Authors: Yeimkuan Chang
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Partitionability allows the creation of many physically independent subsystems, each of which retains an identical functionality as its parent network and has no communication interference with other subsystems. We show that different permutation functions connecting the processors and the switches in the last stage of networks result in different partitionability. Based on a novel mapping scheme of MINs onto the hypercube structure, we show that the switches play a more important role on the subsystem availability than the processors. Subsystem fault tolerance of this class of MINs is also analyzed.
An International Masters in Software Engineering: Experience and Prospects
Authors: Alberto Apostolico, Gianfranco Bilardi, Franco Bombi, Richard A. DeMillo
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Describes our experience with a newly-established international partnership between the Software Engineering Research Center (SERC), a university-based National Science Foundation (NSF) sponsored industrial research organization in the United States and an Italian industry-university team based in Padua, Italy.
Efficient Delay-Insensitive RSFQ Circuits
Authors: Priyadarsan Patra, Donald S. Fussell
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

It is reasonable to project that continuing progress in micro-electronics will lead to computing systems based on circuit elements with switching times on the order of a few picoseconds. Such speeds are likely beyond the capabilities of CMOS. One promising technology is Rapid Single Flux Quantum (RSFQ) circuits based on super-conducting Josephson junction devices. However, for such high-speed technologies, clock skew even over short distances can make synchronous circuit design prohibitively difficult. We have introduced a variant of Delay Insensitive (DI) asynchronous logic called Conservative Delay Insensitive (CDI) logic which has particularly nice properties for use in RSFQ technology. Not only does it solve high-speed clocking problems, but its primitive elements appear to be more efficiently implementable in RSFQ technology than are traditional Boolean logic primitives and its property of minimizing the creation and destruction of signal pulses avoids some difficult implementation issues in RSFQ.
Explicit Unique-Neighbor Expanders
Authors: Noga Alon, Michael R. Capalbo
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We present a simple, explicit construction of an infinite family F of bounded-degree 'unique-neighbor' expanders \Gamma; i.e., there are strictly positive constants \alpha and, such that all \Gamma = (X,E(\Gamma)) \varepsilon F satisfy the following property. For each subset S of X with no more than \alpha|X| vertices, there are at least \varepsilon|S| vertices in X \S that are adjacent in \Gamma to exactly one verte in S. The construction of F is simple to specify, and each \Gamma \varepsilon F is 6-regular. We then extend the technique and present easy to describe explicit infinite families of 4-regular and 3-regular unique-neighbor expanders, as well as explicit families of bipartite graphs with non equal color classes and similar properties.This has several applications and settles an open problem considered by various researchers.
MedMaker: A Mediation System Based on Declarative Specifications
Authors: Yannis Papakonstantinou, Hector Garcia-Molina, Jeffrey D. Ullman
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Mediators are used for integration of heterogeneous information sources. We present a system for declaratively specifying mediators. It is targeted for integration of sources with unstructured or semi-structured data and/or sources with changing schemas. We illustrate the main features of the Mediator Specification Language (MSL), show how they facilitate integration, and describe the implementation of the system that interprets the MSL specifications.
Integrating White- and Black-Box Techniques for Class-Level Regression Testing
Authors: Sami Beydeda, Volker Gruhn
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

In recent years, several techniques have been proposed for class-level regression testing. Most of these techniques focus either on white- or black-box testing, although an integrated approach can have several benefits. As similar tasks have to be carried out for both white- and black-box testing, an integrated approach can improve efficiency and cost effectiveness.This article explains a new approach for class-level regression testing, integrating existing techniques. Particularly, those of Rothermel et al. and Hong et al. for white-box regression testing and black-box testing, respectively, have been integrated into a single technique. The benefits of the resulting technique are shown by example.
A Fast Algorithm to Cluster High Dimensional Basket Data
Authors: Carlos Ordonez, Edward Omiecinski, Norberto Ezquerra
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Clustering is a data mining problem that has received significant attention by the database community. Data set size, dimensionality and sparsity have been identified as aspectsthat make clustering more difficult. This work introduces a fast algorithm to cluster large binary data sets where data points have high dimensionality and most o their coordinates are zero. This is the case with basket data transactions containing items, that can be represented as sparse binary vectors with very high dimensionality. An experimental section shows performance, advantages and limitations of the proposed approach.
Arc Segmentation from Complex Line Environments: A Vector-Based Stepwise Recovery Algorithm
Authors: Dov Dori, Liu Wenyin
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Accurate arc segmentation, essential for high-level engineering drawing understanding is very difficult due to noise, clutter, tangency, and intersections with other geometry objects. We present an application of a generic methodology for recognition of multicomponent graphic objects in engineering drawings to the segmentation of circular arcs. The underlying mechanism is a sequential stepwise recovery of components that are segmented as wire fragments during the sparse-pixel vectorization process and meet a set of continuity conditions. Proper threshold selection and consistent checking of co-circularity of the assumed arc pieces result in an accurate arc segmentation method.
VISUAL: A Graphical Icon-Based Query Language
Authors: Nevzat Hurkan Balkir, E. Sukan, Gultekin Özsoyoglu, Z. Meral Özsoyoglu
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

VISUAL is a graphical icon-based query language designed for scientific databases where visualization of the relationships are important for the domain scientist to express queries. Graphical objects are not tied to the underlying formalism; instead, they represent the relationships of the application domain. VISUAL supports relational, nested, and object-oriented models naturally and has formal basis. In addition to set and bag constructs for complex objects, sequences are also supported by the data model. Concepts of external and internal queries are developed as modularization tools. A new parallel/distributed query processing paradigm is presented. VISUAL query processing techniques are also discussed.
Web-Application Development Using the Model/View/Controller Design Pattern
Authors: Avraham Leff, James T. Rayfield
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: The Model/View/Controller design pattern is very useful for architecting interactive software systems. This design pattern is partition-independent, because it is expressed in terms of an interactive application running in a single address space. Applying the Model/View/Controller design pattern to web-applications is therefore complicated by the fact that current technologies encourage developers to partition the application as early as in the design phase. Subsequent changes to that partitioning require considerable changes to the application's implementation -- despite the fact that the application logic has not changed. This paper introduces the concept of Flexible Web-Application Partitioning, a programming model and implementation infrastructure, that allows developers to apply the Model/View/Controller design pattern in a partition-independent manner. Applications are developed and tested in a single address-space; they can then be deployed to various client/server architectures without changing the application's source code. In addition, partitioning decisions can be changed without modifying the application.
Automatic Generation of Provably Correct Parallelizing Compilers
Authors: Gopal Gupta, Enrico Pontelli, Amado Lara-Rodriguez, Roberto Felix-Cardenas
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

We show how parallelizing compilers can be automatically derived from denotational definitions of programming languages. In our approach, the denotational definition is expressed using definite clause grammars (syntax specification) and Horn Logic or Constraint Logic (semantic specification). The conditions for executing two or more statements in parallel (e.g., GCD test, Banerjee test, or exact test) are included as part of the (parallel) denotational semantics of the language. Solutions of Diophantine equations, needed for parallelizing DO loops, can be expressed in constraint logic as well, and are thus easily incorporated in our denotational framework. This parallel denotational specification of the language is executable, and thus automatically yields a parallel interpreter. This interpreter can be partially evaluated with respect to a given program to automatically obtain (provably correct) parallel compiled code. In addition, the various syntactic and semantic restructuring transformations that have been proposed to expose more parallelism in sequential programs can also be expressed in our denotational framework.
Morphological Operators for Segmentation of Color Sequences
Authors: Franklin César Flores, Roberto Hirata,  Jr., Junior Barrera, Roberto de Alencar Lotufo, Fernand Meyer
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

This paper presents a technique for the segmentation of moving objects in color image sequences. The technique is based on Beucher-Meyer paradigm, with markers detected by a morphological operator designed by computational learning (or, equivalently, statistical optimization). Objects in some frames of the video are marked manually and used to train the markers detector. Then, the operator designed is used to mark the objects in the other frames and the paradigm is applied to all frames marked by the detector. Two real world examples illustrate the application of the proposed technique.
A Multi-Version Algorithm for Cooperative Edition of Hierarchically-Structured Documents
Authors: Josep M. Ribó Balust, Xavier Franch
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: Several approaches do exist to solve the problem of editing a text document cooperatively in real time. We believe that those approaches could be improved in two ways: (1) preserving the intention of the participants in a better manner and (2) benefiting from a hierarchical document structure (as in XML). This article presents an algorithm for cooperative edition of documents that (1) achieves intention preservation by keeping different versions of the concurrently accessed document fragments and that (2) reduces concurrency conflicts by restricting them to hierarchically dependent fragments.
An Adaptive Approach to Data Placement
Authors: David K. Lowenthal, Gregory R. Andrews
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Programming distributed-memory machines requires careful placement of data to balance the computational load among the nodes and minimize excess data movement between the nodes. Most current approaches to data placement require the programmer or compiler to place data initially and then possibly to move it explicitly during a computation. This paper describes a new, adaptive approach. It is implemented in the Adapt system, which takes an initial data placement, efficiently monitors how well it performs, and changes the placement whenever the monitoring indicates that a different placement would perform better. Adapt frees the programmer from having to specify data placements, and it can use run-time information to find better placements than compilers. Moreover, Adapt automatically supports a "variable block'' placement, which is especially useful for applications with nearest-neighbor communication but an imbalanced workload. For applications in which the best data placement varies dynamically, using Adapt can lead to better performance than using any statically determined data placement.
Design of an efficient power distribution network for the UltraSPARC-I microprocessor
Authors: Alexander Dalal, Lavi Lev, Sundari Mitra
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

The design, implementation, and verification of the power distribution network for the 5.2 million transistor UltraSPARC-I microprocessor is described. A novel simulation method allows rapid identification of exact layout locations with potential electromigration or excessive voltage drop problems. Hierarchical verification capabilities of this approach are utilized to design an efficient and robust distribution of V/sub dd/ and V/sub ss/ across a large die, in the face of stringent IR drop and floorplanning constraints. A comprehensive methodology for power distribution and management, along with seamless integration of the power distribution into existing CAD tools throughout the design cycle results in correct-by-construction power networks for cell libraries and functional blocks, area efficient power interconnections and reduced time-to-market due to correction of all reliability failures in the power networks prior to mask generation.
Automatic Prototype Extracion for Adaptive OCR
Authors: George Nagy, Yihong Xu
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A Bayesian method of isolating character bitmaps from paragraph-length samples of heavily degraded text images is demonstrated. The method requires a transcript of the text, but it is sufficiently robust to tolerate errors in transcripts obtained from multifont commercial OCR software. The resulting prototypes (labeled character images) are used to recognize additional text in the same document.
Agent-Based Holonic Production Control
Authors: Paulo Leitão, Francisco Restivo
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The manufacturing system environment is typically a complex system, involving many variables and constraints, being in certain cases a chaotic system. The introduction of new paradigms to face globalisation, distribution of activities and customer satisfaction requirements,increases the problem complexity. The new manufacturing control approaches should support the agile adaptation to volatile technological and economical environments and should react dynamically and quickly to disturbances. This paper intends to introduce an agent-based approach to the manufacturing problem, that uses holonic concepts, is focused on distributed manufacturing shop floor control for discrete batch production, considers the optimisation of set-up and maintenance operations, and develops mechanisms for agile and fast reaction to disturbances without compromising the global production optimisation.
An Agent-Assisted Document Storage for Software Process Environments
Authors: Jason Jen-Yen Chen, Chun-Yi Lin
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

Traditional software process environment stores documents using either centralized or distributed approach. With the assistance of web agent, this paper presents a new document storage structure that combines the two approaches. In this new approach, all the documents are stored centrally in web server. When a developer modifies a document (data), agent detects those developers who currently need to refer to that document, and sends the modified data to them in a distributed manner. The benefits of this approach are: 1) All the clients (developers) are notified as soon as a piece of data is modified, 2) The amount of communication is reduced, as clients do not need to check periodically whether or not their currently referred data is modified, 3) The load of server is reduced, as the load of notifyingother clients about modification is switched from server to an agent communication media called white board.
Pulse-Driven Delay-Insensitive Circuits using Single-Flux-Quantum Devices
Authors: Yoshio Kameda
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

Recent progress in device technology is disclosing a fundamental limitation in synchronous system design. A natural solution to this problem is the introduction of asynchronous or event-driven computing. Delay-insensitive circuits are a class of asynchronous circuits that operate correctly even in the presence of unbounded gate and wire delays. An interesting application of the delay-insensitive design discipline is the use of the rapid single-flux-quantum (RSFQ) devices which is one of the superconductive Josephson-junction devices. This paper introduces a pulse-driven delay-insensitive logic using RSFQ devices and proposes a set of primitive element models which has been validated by an analog simulation. The paper also discusses several challenges toward dependable and ultra-high performance computing with the pulse-driven logic.
Positioning Technologies in Learning
Authors: Roberto Casas, David Cuartielles, Jorge Falco, Lone Malmborg
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

In the following we discuss how a high precision, indoor positioning system (UNIZAR positioning system) can be part of a general positioning system to fit into different application areas depending on different needs and requirements for precision. Specific focus is put onapplications for learning and training contexts. We argue that many innovative user interfaces for learning are based on digital manipulatives, which could be substantially enhanced by positioning augmentation.
Measuring Abstractness for Reverse Engineering in a Re-engineering Tool
Authors: Hongji Yang, Paul Luker, William C. Chu
Venue: Proceedings of the International Conference on Software Maintenance (1997)

Although metrics have been used in the whole process of software engineering with the ostensible purpose of improving the quality of software, little thought appears to have been given to the use of metrics for reverse engineering. Not surprisingly, there are remarkably few metrics tools available for this purpose. The aim of this study was to investigate the provision of metrics suitable for measuring aspects of software for the process of reverse engineering. It should be noted, however, that the use of these metrics will help not only in reverse engineering for software maintenance but also in re-engineering in software evolution.