ppxscal/embedding_network huggingface dataset:
Embedding Hierarchical Hypercube Networks into the Hypercube
Authors: Mounir Hamdi, Siang W. Song
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

The embedding of one interconnection network into another is a very important issue in the design and analysis of parallel algorithms. Through such embeddings, the algorithms originally developed for one architecture can be directly mapped to another architecture. This paper describes a new embedding method, based on matrix transformations, for optimally embedding hierarchical hypercube networks (HHNs) into the hypercube (binary n-cube). Thus, this embedding method has practical importance in enhancing the capabilities and extending the usefulness of the hypercube, since hierarchical hypercube networks have proven to be very cost-effective for a wide range of applications.
Applying deductive database technology to network management
Authors: Nalin Sharda, Refyul Fatri, Mohammad Abid
Venue: ACM SIGCOMM Computer Communication Review (1997)

Network Management is essential for successful operation of any communications network. Due to the complexity of modern networks, their management requires application of artificial intelligence based techniques. Two essential aspects of any Network Management system are, a large volume of data, and rules applied to this data. Deductive database systems cater for both. In this paper we examine the suitability of deductive database systems for Network Management application. Fundamentals of Network Management as well as deductive database systems are given. We describe a prototype Network Management system built to test the suitability of deductive database systems for Network Management.
Data Structures' Maxima
Authors: G. Louchard, Claire Kenyon, R. Schott
Venue: SIAM Journal on Computing (1997)

The purpose of this paper is to analyze the maxima properties (value and position) of some data structures. Our theorems concern the distribution of these random variables. Previously known results usually dealt with the mean and sometimes the variance of the random variables. Many of our results rely on diffusion techniques. This is a very powerful tool that has already been used with some success in algorithm complexity analysis.
On the space complexity of randomized synchronization
Authors: Faith Fich, Maurice Herlihy, Nir Shavit
Venue: Journal of the ACM (JACM) (1998)

The &ldquo;waite-free hierarchy&rdquo; provides a classification of multiprocessor synchronization primitives based on the values of n for which there are deterministic wait-free implementations of n-process consensus using instances of these objects and read-write registers. In a randomized wait-free setting, this classification is degenerate, since n-process consensus can be solved using only O(n) read-write registers.In this paper, we propose a classification of synchronization primitives based on the space complexity of randomized solutions to n-process consensus. A historyless object, such as a read-write register, a swap register, or a test set register, is an object whose state depends only on the lost nontrivial operation thate was applied to it. We show that, using historyless objects, &OHgr;(n object instances are necessary to solve n-process consensus. This lower bound holds even if the objects have unbounded size and the termination requirement is nondeterministic solo termination, a property strictly weaker than randomized wait-freedom.We then use this result to related the randomized space complexity of basic multiprocessor synchronization primitives such as shared counters, fetch add registers, and compare swap registers. Viewed collectively, our results imply that there is a separation based on space complexity for synchronization primitives in randomized computation, and that this separation differs from that implied by the deterministic &ldquo;wait-free hierarchy.&rdquo;
Approximation of Myopic Systems Whose Inputs Need Not BeContinuous
Authors: Irwin W. Sandberg, Lilian Xu
Venue: Multidimensional Systems and Signal Processing (1998)

Our main result is a theorem that gives, in a certain setting, a necessary and sufficient condition under which multidimensional shift-invariant maps with vector-valued inputs drawn from a certain large set can be uniformly approximated arbitrarily well using a structure consisting of a linear preprocessing stage followed by a memoryless nonlinear network. The inputs considered need not be continuous, and noncausal as well as causal maps are addressed. Approximations for noncausal maps for which inputs and outputs are functions of more than one variable are of current interest in connection with, for example, image processing.
The automatic generation of sparse primitives
Authors: Aart J. C. Bik, Peter J. H. Brinkhaus, Peter M. W. Knijnenburg, Harry A. G. Wijshoff
Venue: ACM Transactions on Mathematical Software (TOMS) (1998)

Primitives in mathematical software are usually written and optimized by hand. With the implementation of a &ldquo;sparse compiler&rdquo; that is capable of automatically converting a dense program into sparse code, however, a completely different approach to the generation of sparse primitives can be taken. A dense implementation of a particular primitive is supplied to the sparse compiler, after which it can be converted into many different sparse versions of this primitive. Each version is specifically tailored to a class of sparse matrices having a specific nonzero structure. In this article, we discuss some of our experiences with this new approach.
Asserting beliefs in MLS relational models
Authors: Nenad A. Jukic, Susan V. Vrbsky
Venue: ACM SIGMOD Record (1997)

Multilevel relations, based on the current multilevel secure (MLS) relational data models, can present a user with information that is difficult to interpret and may display an inconsistent outlook about the views of other users. Such ambiguity is due to the lack of a comprehensive method for asserting and interpreting beliefs about lower level information. In this paper we identify different beliefs that can be held by higher level users about lower level information, and we introduce the new concept of a mirage tuple. We present a mechanism for asserting beliefs about all accessible tuples, including lower level tuples. This mechanism provides every user of an MLS database with an unambiguous interpretation of all viewable information and presents a consistent account of the views at all levels below the user's level.
A practical subtyping system for Erlang
Authors: Simon Marlow, Philip Wadler
Venue: Proceedings of the second ACM SIGPLAN international conference on Functional programming (1997)

We present a type system for the programming language Erlang. The type system supports subtyping and declaration-free recursive types, using subtyping constraints. Our system is similar to one explored by Aiken and Wimmers, though it sacrifices expressive power in favour of simplicity. We cover our techniques for type inference, type simplification, and checking when an inferred type conforms to a user-supplied type signature, and report on early experience with our prototype.
Fault Diameter of k-ary n-cube Networks
Authors: Khaled Day, Abdel-Elah Al-Ayyoub
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

We obtain the fault diameter of k-ary n-cube interconnection networks (also known as n-dimensional k-torus networks). We start by constructing a complete set of node-disjoint paths (i.e., as many paths as the degree) between any two nodes of a k-ary n-cube. Each of the obtained paths is of length zero, two, or four plus the minimum length except for one path in a special case (when the Hamming distance between the two nodes is one) where the increase over the minimum length may attain eight. These results improve those obtained in [8] where the length of some of the paths has a variable increase (which can be arbitrarily large) over the minimum length. These results are then used to derive the fault diameter of the k-ary n-cube, which is shown to be ¿ + 1 where ¿ is the fault free diameter.
MING-I: a distributed interactive multimedia document development mechanism
Authors: Chung-Ming Huang, Jyh-Shiou Chen, Chih-Hao Lin, Chian Wang
Venue: Multimedia Systems (1998)

The next generation of interactive multimedia documents can contain both static media, e.g., text, graph, image, and continuous media, e.g., audio and video, and can provide user interactions in distributed environments. However, the temporal information of multimedia documents cannot be described using traditional document structures, e.g., Open Document Architecture (ODA) and Standard Generalized Mark-up Language (SGML); the continuous transmission of media units also raises some new synchronization problems, which have not been met before, for processing user interactions. Thus, developing a distributed interactive multimedia document system should resolve the issues of document model, presentation control architecture, and control scheme. In this paper, we (i) propose a new multimedia document model that contains the logical structure, the layout structure, and the temporal structure to formally describe multimedia documents, and (ii) point out main interaction-based synchronization problems, and propose a control architecture and a token-based control scheme to solve these interaction-based synchronization problems. Based on the proposed document model, control architecture, and control scheme, a distributed interactive multimedia document development mechanism, which is called MING-I, is developed on SUN workstations.
The OMG, CORBA, Orbix and Ada
Authors: David Clarke
Venue: ACM SIGAda Ada Letters (1997)

An Object Request Broker (ORB) mediates between applications - including distributed ones. This document presents the design goals and philosophy that lead IONA Technologies to produce the object request broker, Orbix. The Ada language binding is described, and some simple programming examples are given to illustrate its operation.The introduction discusses the needs for ORBs and the industry initiatives that arose from that need - culminating in the OMG's CORBA specifications.
Experience programming applets with Ada95
Authors: Charles W. Kann, Michael B. Feldman, John Sibert
Venue: ACM SIGAda Ada Letters (1997)

Because of its ability to provide platform independent programs and active content on web pages, Java has created much excitement in the computer science community. However, much of the computer science community does not have a good understanding of the Java technology. Java is much more than simply a language for developing programs which run on web pages. It is an environment for developing programs which take advantage of the Internet, and the use of the Java language is only one piece of that environment. That other languages can be used to write programs which can take advantage of the Java environment is shown by the existence of two such languages, NetRexx [1] from IBM and AppletMagic(tm) [2], an implementation of Ada95 for the Java VM, from Intermetrics.George Washington University obtained a Beta copy of the AppletMagic(tm) compiler in January of 1996. Since that time, we have been attempting to include AppletMagic and Java in a Data Structures (CS2) course and a course on Design of User Interface Software. During this time we have developed some experience in using Ada95 to develop Java programs and applets, and some insights into how students use the Java environment. This paper will report on those experiences.We will first present an overview of the Java environment. Intended to provide readers who are unfamiliar with Java enough background to be able to understand the relationship of AppletMagic(tm) and the Java environment. The third section will cover the structure of applets, and how to create an applet in Ada. The fourth section will cover issues concerning using classes written in Java from Ada, and some of the experiences we have had in using Ada to develop Java programs and applets, Finally the fifth section will present conclusions we have drawn from using AppletMagic(tm) in our courses.
On (p^a, p^b, p^a, p^a-b)-Relative DifferenceSets
Authors: Bernhard Schmidt
Venue: Journal of Algebraic Combinatorics: An International Journal (1997)

This paper provides new exponent and rank conditions for the existence of abelian relative (p^a,p^b,p^a,p^a-b) -difference sets. It is also shown that no splitting relative (2^2c,2^d,2^2c,2^2c-d)-difference set exists if d > c and the forbidden subgroup is abelian. Furthermore, abelian relative (16, 4, 16, 4)-difference sets are studied in detail; in particular, it is shown that a relative (16, 4, 16, 4)-difference set in an abelian group G\not\cong Z_8\times Z_4\times Z_2 exists if and only if \exp(G)\le 4 or G= Z_8\times ( Z_2)^3 with N\cong Z_2\times Z_2.
An Edge Detection Technique Using the Facet Model and Parameterized Relaxation Labeling
Authors: Ioannis Matalas, Ralph Benjamin, Richard Kitney
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

We present a method for detecting and labeling the edge structures in digital gray-scale images in two distinct stages: First, a variant of the cubic facet model is applied to detect the location, orientation and curvature of the putative edge points. Next, a relaxation labeling network is used to reinforce meaningful edge structures and suppress noisy edges. Each node label of this network is a 3D vector parameterizing the orientation and curvature information of the corresponding edge point. A hysterisis step in the relaxation process maximizes connected contours. For certain types of images, prefiltering by adaptive smoothing improves robustness against noise and spatial blurring.
On the Development of Analogue Sampled-Data Signal Processing
Authors: Gerson A. S. Machado, Nicholas C. Battersby, Chris Toumazou
Venue: Analog Integrated Circuits and Signal Processing (1997)

This paper provides a historical perspective on the development of analogue sampled-data signal processing circuits and systems. The evolution, role and current trends in the development of analogue sampled-data signal processing systems is surveyed. Firstly, the evolution of integrated circuit based techniques, culminating in the ubiquitous switched-capacitor technique is traced. Then the role that analogue sampled-data systems play within the context of a general information processing environment is examined and the required characteristics are identified. Trends in silicon integrated circuit processing technology are summarised and their impact on sampled analogue circuits are identified. Finally, the application of analogue current-mode techniques, and in particular switched-currents, to overcome some of the limitations of previous voltage based approaches, is discussed.
Distance learning of the management of software projects
Authors: Marie-Michèle Boulet
Venue: Proceedings of the 2nd conference on Integrating technology into computer science education (1997)

In this paper, the content of the television distance education course Management of software projects is presented. The course is linked with the undergraduate program of computer science from University Laval. The first part of this paper comments on the needs analysis that drives us to design and develop this kind of distance learning material. The second part gives an idea of the knowledge that students must acquire and describe the use of television programs to share parts of the professional lives of forty experienced managers of software projects.
Comments on "Towards a Framework for Software Measurement Validation"
Authors: Sandro Morasca, Lionel C. Briand, Elaine J. Weyuker, Victor R. Basili, Marvin V. Zelkowitz
Venue: IEEE Transactions on Software Engineering (1997)

A view of software measurement that disagrees with the model presented in a recent paper by Kitchenham, Pfleeger, and Fenton, is given. Whereas Kitchenham, Pfleeger, and Fenton argue that properties used to define measures should not constrain the scale type of measures, we contend that that is an inappropriate restriction. In addition, a misinterpretation of Weyuker's properties is noted.
A collection of tools for making automata theory and formal languages come alive
Authors: Susan H. Rodger, Anna O. Bilska, Kenneth H. Leider, Magdalena Procopiuc, Octavian Procopiuc Jason R. Salemme, Edwin Tsang
Venue: ACM SIGCSE Bulletin (1997)

We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating and simulating finite automata, pushdown automata and Turing machines; P acirc;t eacute; for parsing restricted and unrestricted grammars and transforming context-free grammars to Chomsky Normal Form; and PumpLemma for proving specific languages are not regular. Enhancements to previous tools LLparse and LRparse, instructional tools for parsing LL(1) and LR(1) grammars, include parsing LL(2) grammars, displaying parse trees, and parsing any context-free grammar with conflict resolution.
A Variational Approach to Recovering Depth From Defocused Images
Authors: A. N. Rajagopalan, S. Chaudhuri
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

In this paper, we propose a regularized solution to the depth from defocus (DFD) problem using the space-frequency representation (SFR) framework. A smoothness constraint is imposed on the estimates of the blur parameter, and a variational approach to the DFD problem is developed. Among the numerous SFRs, we study the applicability of the complex spectrogram and the Wigner distribution, in particular, for depth recovery. The performance of the proposed variational method is tested on both synthetic and real images. The method yields good results, and the quality of the estimates is significantly better than that obtained without the smoothness constraint on the blur parameter.
Value profiling
Authors: Brad Calder, Peter Feller, Alan Eustace
Venue: Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture (1997)

Identifying variables as invariant or constant at compile-time allows the compiler to perform optimizations including constant folding, code specialization, and partial evaluation. Some variables, which cannot be labeled as constants, may exhibit semi-invariant behavior. A "semi-invariant" variable is one that cannot be identified as a constant at compile-time, but has a high degree of invariant behavior at run-time. If run-time information was available to identify these variables as semi-invariant, they could then benefit from invariant-based compiler optimizations. In this paper we examine the invariance found from profiling instruction values, and show that many instructions have semi-invariant values even across different inputs. We also investigate the ability to estimate the invariance for all instructions in a program from only profiling load instructions. In addition, we propose a new type of profiling called "Convergent Profiling". Estimating the invariance from loads and convergent profiling are used to reduce the profiling time needed to generate an accurate value profile. The value profile can then be used to automatically guide code generation for dynamic compilation, adaptive execution, code specialization, partial evaluation and other compiler optimizations.
The Critical Sets of Lines for Camera Displacement Estimation: A MixedEuclidean-Projective and Constructive Approach
Authors: Nassir Navab, Olivier D. Faugeras
Venue: International Journal of Computer Vision (1997)

The problem of the recovery of the motion, and the structure from motion is relevant to many computer vision applications. Many algorithms have been proposed to solve this problem. Some of these use line correspondences. For obvious practical reasons, it is important to study the limitation of such algorithms. In this paper, we are concerned with the problem of recovering the relative displacements of a camera by using line matches in three views. In particular, we want to know whether there exist sets of 3D lines such that no matter how many lines we observe there will always be several solutions to the relative displacement estimation problem. Such sets of lines may be called critical in the sense that they defeat the corresponding algorithm. This question has been studied in detail in the case of point matches by early-century Austrian photogrammeters and, independently, in the mid-seventies and early-eighties by computer vision scientists. The answer lies in the idea of a critical surface.The case of lines has been much less studied. Recently, Buchanan (1992a, 1992b) provided a first analysis of the problem in which he gave a positive answer: there exist critical sets of lines and they are pretty big (&infin;&sup2; lines). In general these sets are algorithm dependent, for example the critical set of lines for the Liu-Huang algorithm introduced in (Buchanan, 1992a), but Buchanan has shown that there is a critical set that defeats any algorithm. This paper is an attempt to build on his work and extend it in several directions. First, we cast his purely projective analysis in a more euclidean framework better suited to applications and, currently, more familiar to most of the computer vision community. Second, we clearly relate his critical set to those of previously published algorithms, in particular (Liu and Huang, 1988a, 1988b). Third, we provide an effective, i.e., computational, approach for describing these critical sets in terms of simple geometric properties. This has allowed us to scrutinize the structure of the critical sets which we found to be both intricate and beautiful.
An extended entity-relationship model for geographic applications
Authors: Thanasis Hadzilacos, Nectaria Tryfona
Venue: ACM SIGMOD Record (1997)

A special-purpose extension of the Entity-Relationship model for the needs of conceptual modeling of geographic applications, called the Geo-ER Model, is presented. Handling properties associated to objects not because of the objects' nature but because of the objects' position, calls for dealing -at the semantic modeling level-with space, location and dimensionality of objects, spatial relationships, space-depending attributes, and scale and generalization of representations. In order to accomplish this in the framework of ER and its derivatives, we introduce special entity sets, relationships, and add new constructs. The rationale as well as examples of usage of the Geo-ER model from actual projects are presented.
Parallel Coarse Grain Computing of Boltzmann Machines
Authors: Julio Ortega, Ignacio Rojas, Antonio F. Diaz, Alberto Prieto
Venue: Neural Processing Letters (1998)

The resolution of combinatorial optimization problems can greatly benefit from the parallel and distributed processing which is characteristic of neural network paradigms. Nevertheless, the fine grain parallelism of the usual neural models cannot be implemented in an entirely efficient way either in general-purpose multicomputers or in networks of computers, which are nowadays the most common parallel computer architectures. Therefore, we present a parallel implementation of a modified Boltzmann machine where the neurons are distributed among the processors of the multicomputer, which asynchronously compute the evolution of their subset of neurons using values for the other neurons that might not be updated, thus reducing the communication requirements. Several alternatives to allow the processors to work cooperatively are analyzed and their performance detailed. Among the proposed schemes, we have identified one that allows the corresponding Boltzmann Machine to converge to solutions with high quality and which provides a high acceleration over the execution of the Boltzmann machine in uniprocessor computers.