ppxscal/embedding_network huggingface dataset:
Transformational partitioning for co-design of multiprocessor systems
Authors: Gilberto Fernandes Marchioro, Jean-Marc Daveau, Ahmed Amine Jerraya
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

This paper presents the underlying methodology of Cosmos, an interactive approach for hardware/software co-design capable of handling multiprocessor systems and distributed architectures. The approach covers the co-design process through a set of user guided transformations allowing semi-automatic partitioning. The transformations are based on a powerful set of primitives for functional partitioning, structural reorganization and communication transformation. It leads to a fast transformation of a system-level specification into an architecture with a short design time and fast exploration of design space. The application of this approach is illustrated using several design examples starting from a system-level specification given in SDL to a distributed hardware/software architecture described in C/VHDL. We show that the use of transformational approach allows: Application of the expertise of the designer during partitioning ; - the user to understand the results of the co-design process ; the process to take into account partial existing solutions ; - large design space exploration ; the designer to start from a very high-level specification language of the system to be designed.
Circuit optimization via adjoint Lagrangians
Authors: Andrew R. Conn, Ruud A. Haring, Chandu Visweswariah, Chai Wah Wu
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

The circuit tuning problem is best approached by means of gradient-based nonlinear optimization algorithms. For large circuits, gradient computation can be the bottleneck in the optimization procedure. Traditionally, when the number of measurements is large relative to the number of tunable parameters, the direct method is used to repeatedly solve the associated sensitivity circuit to obtain all the necessary gradients. Likewise, when the parameters outnumber the measurements, the adjoint method is employed to solve the adjoint circuit repeatedly for each measurement to compute the sensitivities. In this paper, we propose the adjoint Lagrangian method, which computes all the gradients necessary for augmented-Lagrangian-based optimization in a single adjoint analysis. After the nominal simulation of the circuit has been carried out, the gradients of the merit function are expressed as the gradients of a weighted sum of circuit measurements. The weights are dependent on the nominal solution and on optimizer quantities such as Lagrange multipliers. By suitably choosing the excitations of the adjoint circuit, the gradients of the merit function are computed via a single adjoint analysis, irrespective of the number of measurements and the number of parameters of the optimization. This procedure requires close integration between the nonlinear optimization software and the circuit simulation program. The adjoint Lagrangian formulation has been implemented in the JiffyTune tool which optimizes delay, area, slew (transition time) and power measurements by adjusting transistor widths and wire sizes. Speedups of over 35x have been realized in the gradient computation procedure by using the adjoint Lagrangian formulation, leading to speedups of up to 2.5x in the overall optimization procedure. Perhaps more importantly, these speedups have rendered feasible the tuning of large circuits. A circuit with 6,900 transistors was optimized in under two hours of CPU time.
Digital libraries: a brief introduction
Authors: William L. Anderson
Venue: ACM SIGGROUP Bulletin (1997)

One advantage of reading the other domain columns before writing this one on digital libraries is seeing how interdependent all these different SIGGROUP threads really are. The rapid development of internetworking technology generally, and the World Wide Web specifically, simply magnifies these interdependencies. So while this column focuses on digital libraries, and not on cooperation, learning, work practices, or knowledge management, I feel that all these areas are mutually interdependent, and that advances in one will be felt in all. I expect that these domain columns will cross-reference each other.
Solving Polynomial Systems Using a Branch and Prune Approach
Authors: Pascal Van Hentenryck, David McAllester, Deepak Kapur
Venue: SIAM Journal on Numerical Analysis (1997)

This paper presents {\tt Newton}, a branch and prune algorithm used to find all isolated solutions of a system of polynomial constraints. {\tt Newton} can be characterized as a global search method which uses intervals for numerical correctness and for pruning the search space early. The pruning in {\tt Newton} consists of enforcing at each node of the search tree a unique local consistency condition, called box-consistency, which approximates the notion of arc-consistency well known in artificial intelligence. Box-consistency is parametrized by an interval extension of the constraint and can be instantiated to produce the Hansen--Sengupta narrowing operator (used in interval methods) as well as new operators which are more effective when the computation is far from a solution. {\tt Newton} has been evaluated on a variety of benchmarks from kinematics, chemistry, combustion, economics, and mechanics. On these benchmarks, it outperforms the interval methods we are aware of and compares well with \textit{state-of-the-art} continuation methods. Limitations of {\tt Newton} (e.g., a sensitivity to the size of the initial intervals on some problems) are also discussed. Of particular interest is the mathematical and programming simplicity of the method.
Object Pose: The Link between Weak Perspective,Paraperspective, and Full Perspective
Authors: Radu Horaud, Fadi Dornaika, Bart Lamiroy
Venue: International Journal of Computer Vision (1997)

Recently, DeMenthon and Davis (1992, 1995) proposed a method for determining the pose of a 3-D object with respect to a camera from 3-D to 2-D point correspondences. The method consists of iteratively improving the pose computed with a weak perspective camera model to converge, at the limit, to a pose estimation computed with a perspective camera model. In this paper we give an algebraic derivation of DeMenthon and Davis&lsquo; method and we show that it belongs to a larger class of methods where the perspective camera model is approximated either at zero order (weak perspective) or first order (paraperspective). We describe in detail an iterative paraperspective pose computation method for both non coplanar and coplanar object points. We analyse the convergence of these methods and we conclude that the iterative paraperspective method (proposed in this paper) has better convergence properties than the iterative weak perspective method. We introduce a simple way of taking into account the orthogonality constraint associated with the rotation matrix. We analyse the sensitivity to camera calibration errors and we define the optimal experimental setup with respect to imprecise camera calibration. We compare the results obtained with this method and with a non-linear optimization method.
Using the Matrix Sign Function to Compute Invariant Subspaces
Authors: Zhaojun Bai, James Demmel
Venue: SIAM Journal on Matrix Analysis and Applications (1998)

The matrix sign function has several applications in system theory and matrix computations. However, the numerical behavior of the matrix sign function, and its associated divide-and-conquer algorithm for computing invariant subspaces, are still not completely understood. In this paper, we present a new perturbation theory for the matrix sign function, the conditioning of its computation, the numerical stability of the divide-and-conquer algorithm, and iterative refinement schemes. Numerical examples are also presented. An extension of the matrix-sign-function-based algorithm to compute left and right deflating subspaces for a regular pair of matrices is also described.
End-Effectors for Tomato Harvesting Robot
Authors: M. Monta, N. Kondo, K. C. Ting
Venue: Artificial Intelligence Review (1998)

Two types of robotic end-effectors capable of harvesting tomato fruits were manufactured based on the physical properties of tomato plant and tested. The first prototype end-effector consisted of two parallel plate fingers and a suction pad. The fingers pick a fruit off at the joint of its peduncle after the suction cup singulates it by vacuum from other fruits in the same cluster. From the results of harvesting experiment, the end-effector could not harvest fruits with a short peduncle because the fruits were detached from the suction pad before they were gripped by the fingers. Therefore, the second prototype in which the functions to detect the fruit position and the air pressure in the pad were installed, was made, so that the fruits were harvested regardless of the length of their peduncle. Experimental results using the improved end-effector showed that the fruits were harvested successfully with no damage.
Circuit Switching with Input Queuing: An Analysis for the d-Dimensional Wraparound Mesh and the Hypercube
Authors: Vishal Sharma, Emmanouel A. Varvarigos
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

We analyze circuit switching in a multiprocessor network, where connection requests (or sessions) arrive at each node of the network according to a Poisson process with rate ¿. Each session joins the appropriate input-queue at its source node, and, upon advancing to the head of the queue, transmits a setup packet to establish a connection. If the setup packet is successful, it reserves the links on the path for the duration of the session, and the session is served without interruptions. Otherwise, the connection request remains queued at the source, and subsequent attempts are made to establish the circuit. We analyze the queue of connection requests at the input-buffer of a network link, and obtain analytic expressions for the stability region, the average queuing delay, the average connection time, the average waiting time, and the average total delay, which show how these parameters depend on system variables, such as network dimension and session arrival rate. The queuing analysis focuses on the input-queue of a particular link, and accounts for the interactions with queues of other links through the retrial attempts and the associated probability of success. The queuing analysis is independent of the particular network topology under consideration, as long as the probability that a session arriving at a random time successfully establishes a connection can be calculated for that network. Simulations demonstrate the close agreement between the observed network behavior and that predicted by the analysis.
Switch level random pattern testability analysis
Authors: Mehmet A. Cirit
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

We present a new statistical, probabilistic algorithm for calculating controllability and observability for signal nets assuming the circuit can be described as a directed graph of unidirectional MOS switches. Application of the new algorithms to the testability analysis of CMOS circuits is described.
Language design and standardization
Authors: William Carlson
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

As Ada 9X unfolds, it is valuable to examine the evolution of Ada-83 to determine the strengths and weaknesses of both the design process and the language. Ada is the outgrowth of the DoD Language Standardization, Convergence and Modernization program, led by Bill Whitaker and begun in 1974. A broad spectrum of users were involved in setting the original goals for the language which were: A usable language for real-time embedded systems A precisely defined and well-controlled language Improved software reliability and maintainability Commercially available compilers and programming systems An end to the proliferation of unique DoD languages David Fisher led the transformation of user requests into specific technical requirements for the common language. The goals of Ada 83 have been achieved. In the actual use of any language, however, it becomes clear that some users' needs were overlooked in the original goals, some might have been overly optimistic, some are right on target, and others are no longer appropriate. As a result, expectations for the language change. What Ada 9X must accomplish is the fine-tuning of the language to meet expanded expectations without creating difficulty for current users. The revised language must be upwardly-compatible. Using an approach similar to that which was so successful in the original creation of Ada, Ada 9X is listening to the needs of the general user community; is determining, through the Requirements Team, which are the most important; and is mapping the required changes to the language. One of the keys to achieving a consistent language is oversight by a single, principal designer. In the case of the original language this role was filled by Jean Ichbiah; for 9X it is being filled by Tucker Taft. We fully expect Ada 9X to be the best choice for software applications ranging from real-time embedded systems to large distributed information systems; and, we hope, to become the most popular programming language worldwide.
New Extremal Type II Codes Over Z_4
Authors: Masaaki Harada
Venue: Designs, Codes and Cryptography (1998)

Recently Type II codes over Z_4 have been introduced as self-dual codes containing the all-one vector with the property that all Euclidean weights are divisible by eight. The notion of extremality for the Euclidean weight has been also given. In this paper, we give two methods for constructing Type II codes over Z_4. By these methods, new extremal Type II codes of lengths 16, 24, 32 and 40 are constructed from weighing matrices.
Iconic programming proves effective for teaching the first year programming sequence
Authors: Ben A. Calloni, Donald J. Bagert, H. Paul Haiduk
Venue: ACM SIGCSE Bulletin (1997)

Research has been undertaken to answer the following question: Can icon-based programming languages be used to teach first year programming concepts to undergraduate students more effectively than text-based languages? BACCII++ is an iconic environment developed at Texas Tech University for teaching procedural and object-oriented programming concepts and languages. Course materials were developed and used under experimental conditions during the 1995-96 school year at Texas Tech University, with half using BACCII++ to generate C++ code, and the other half using only C++. For each course in each semester the experiment was run, the sections using BACCII++ did significantly better in overall performance.
A case-tool for supporting navigation in the class hierarchy
Authors: A. Putkonen, M. Kiekara
Venue: ACM SIGSOFT Software Engineering Notes (1997)

The central role that class hierarchy plays in object-oriented systems is discussed. The study focuses on design and maintenance stages where the requirements of navigation facilities are greater than at other stages of the systems lifecycle. It will be shown that different kinds of navigation are needed and it is necessary to browse up and down the class hierarchy before it is possible to decide which classes have to be changed. A flexible navigation tool which can support these design and maintenance stages is also presented. The tool helps the designer to navigate the class hierarchy and to investigate the effect of the intended changes on the entire class hierarchy.
Eigenvector Slicing of the Nonnegative Matrices
Authors: D. J. Hartfiel
Venue: SIAM Journal on Matrix Analysis and Applications (1998)

This paper shows how the set of nonnegative matrices can be seen as the union of smaller-dimensional sets called slices. For $2\times 2$ matrices a model is drawn and it is shown how the model can be used to study the eigenvector behavior of a perturbed matrix.
Implant dentistry&mdash;development and current focus
Authors: Beat R. Merz, Franz Sutter, Niklaus Lang
Venue: Technology and Health Care (1997)

Today, implant dentistry plays an important role in the maintenance of chewing function and oral health. For thirty years now oral implants and methods for implantation have been developed further to assure a lifetime stability of these devices and to optimize function and esthetics. Starting with the treatment of fully edentulous patients, oral implants are now used for the reconstruction of partially edentulous patients as well. Thereby, implants not only replace missing teeth but also help to preserve intact remaining teeth. They are usually incorporated to improve the patient's subjective chewing comfort. The present paper gives an overview of the development and the current state of the art of oral implants, as well as their clinical indications.
Pricing of American Contingent Claims with Jump Stock Price and Constrained Portfolios
Authors: Rainer Buckdahn, Ying Hu
Venue: Mathematics of Operations Research (1998)

In this paper, we study the problem of pricing American contingent claims in an incomplete market where the stock price process is supposed to be driven by both a Wiener process and a Poisson random measure and the portfolios are constrained. We formulate this problem as to find the minimal solution of a backward stochastic differential equation (BSDE) with constraints. We use the penalization method to construct a sequence of BSDEs with respect to Wiener process and Poisson random measure, and we show that the solutions of these equations converge to the minimal solution we are interested in. Finally, in the Markovian case, we characterize the minimal hedging price as the minimal viscosity supersolution of an integral-partial differential inequality with constraints.
New Techniques for Data Reduction in a Database System for Knowledge Discovery Applications
Authors: Akhil Kumar
Venue: Journal of Intelligent Information Systems (1998)

Databases store large amounts of information about consumer transactions and other kinds of transactions. This information can be used to deduce rules about consumer behavior, and the rules can in turn be used to determine company policies, for instance with regards to production, marketing and in several other areas. Since databases typically store millions of records, and each record could have up to 100 or more attributes, as an initial step it is necessary to reduce the size of the database by eliminating attributes that do not influence the decision at all or do so very minimally. In this paper we present techniques that can be employed effectively for exact and approximate reduction in a database system. These techniques can be implemented efficiently in a database system using SQL (structured query language) commands. We tested their performance on a real data set and validated them. The results showed that the classification performance actually improved with a reduced set of attributes as compared to the case when all the attributes were present. We also discuss how our techniques differ from statistical methods and other data reduction methods such as rough sets.
Reducing "Structure From Motion": A General Framework for Dynamic Vision Part 2: Implementation and Experimental Assessment
Authors: Stefano Soatto, Pietro Perona
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)

A number of methods have been proposed in the literature for estimating scene-structure and ego-motion from a sequence of images using dynamical models. Despite the fact that all methods may be derived from a "natural" dynamical model within a unified framework, from an engineering perspective there are a number of trade-offs that lead to different strategies depending upon the applications and the goals one is targeting. We want to characterize and compare the properties of each model such that the engineer may choose the one best suited to the specific application. We analyze the properties of filters derived from each dynamical model under a variety of experimental conditions, assess the accuracy of the estimates, their robustness to measurement noise, sensitivity to initial conditions and visual angle, effects of the bas-relief ambiguity and occlusions, dependence upon the number of image measurements and their sampling rate.
Connectivity biased channel construction and ordering for building-block layout
Authors: H. Cai
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

A number of techniques are presented for the construction and ordering of routing channels for building-block layout. First, before the routing channels are defined the placement is modified such that proper routing space is assigned between the circuit blocks. Second, a channel graph is constructed on which the global routing will be performed. Finally, after the global routing a feasible routing order is assigned to the channels. In contrast to other works, the algorithms use both the geometrical data (the placement) and the topological data (the connectivity) to decide which channel structure should be chosen from the feasible set.
Managing level of detail through peripheral degradation: effects on search performance with a head-mounted display
Authors: Benjamin Watson, Neff Walker, Larry F. Hodges, Aileen Worden
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (1997)

Two user studies were performed to evaluate the effect of level-of-detail (LOD) degradation in the periphery of head-mounted displays on visual search performance. In the first study, spatial detail was degraded by reducing resolution. In the second study, detail was degraded in the color domain by using grayscale in the periphery. In each study, 10 subjects were given a complex search task that required users to indicate whether or not a target object was present among distracters. Subjects used several different displays varying in the amount of detail presented. Frame rate, object location, subject input method, and order of display use were all controlled. The primary dependent measures were search time on correctly performed trials and the percentage of all trials correctly performed. Results indicated that peripheral LOD degradation can be used to reduce color or spatial visual complexity by almost half in some search tasks with out significantly reducing performance.
Constructing Symmetric Ciphers Using the CAST Design Procedure
Authors: Carlisle M. Adams
Venue: Designs, Codes and Cryptography (1997)

This paper describes the CAST design procedure for constructing a family of DES-like Substitution-Permutation Network (SPN) cryptosystems which appear to have good resistance to differential cryptanalysis, linear cryptanalysis, and related-key cryptanalysis, along with a number of other desirable cryptographic properties. Details of the design choices in the procedure are given, including those regarding the component substitution boxes (s-boxes), the overall framework, the key schedule, and the round function. An example CAST cipher, an output of this design procedure, is presented as an aid to understanding the concepts and to encourage detailed analysis by the cryptologic community.