ppxscal/embedding_network huggingface dataset:
Random Pattern Testability of Control and Address Circuitry of an Embedded Memory with Feed-Forward Data-Path Connections
Authors: Jacob Savir
Venue: Journal of Electronic Testing: Theory and Applications (1999)

Of late some interesting and useful work has been done on the problem of testing logic surrounding embedded memories. This work assumes that the logic surrounding the memory is functionally partitioned and that the different partitions are logically isolated one from the other. This paper expands upon past work using a more flexible design rule which allows feed-forward connections between the data-path Prelogic and Postlogic. The connections are such that there is no feedback from the memory outputs to its inputs, and both the Prelogic and the Postlogic are disconnected from the Address and Control logic. Under this design rule we show the auxiliary circuits used to determine the random pattern testability of faults in the circuitry driving the address inputs and the controls of the two-port memory. The techniques described herein are intended to be used in conjunction with the cutting algorithm for testability measurement in built-in self-test (BIST) designs, but may also be suitable for use with other detection probability tools and simulation tools.
A type system of logic objects
Authors: Dianxiang Xu
Venue: ACM SIGPLAN Notices (1999)

This paper describes the declaration and inference based type system in an object-oriented logic framework, where logic objects are viewed as typed abstractions with state, constraints, behaviors and non-monotonic inheritance. Types are built by ordered constructors with subtyping relationships. As base types, the classes can be applied to complex type construction. Objects are classified according to their method signatures, and subtyping is independent of inheritance.
INFO: interactive APL documentation
Authors: George Mebus
Venue: Proceedings of the conference on APL '99 : On track to the 21st century: On track to the 21st century (1999)

A large body of APL code may be hard to understand and analyze, particularly if you are not its author. A code system that spans multiple workspaces (WSs) compounds that problem.INFO is a Multi-WS system written in APL+Win that provides convenient interactive documentation of APL+Win and APL+DOS multi-WS systems. The User has a variety of displays that give insight into the system structures and relationships within single- or multi-WS systems. An administrator can easily set up and maintain the INFO static analysis data bases for any number of WS groups.This paper demonstrates INFO by showing how INFO documents itself. A distribution package contains the complete code and instructions for setting up this self-documentation.
Compiling object-oriented data intensive applications
Authors: Renato Ferreira, Gagan Agrawal, Joel Saltz
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

Processing and analyzing large volumes of data plays an increasingly important role in many domains of scientific research. High-level language and compiler support for developing applications that analyze and process such datasets has, however, been lacking so far.In this paper, we present a set of language extensions and a prototype compiler for supporting high-level object-oriented programming of data intensive reduction operations over multidimensional data. We have chosen a dialect of Java with data-parallel extensions for specifying collection of objects, a parallel for loop, and reduction variables as our source high-level language. Our compiler analyzes parallel loops and optimizes the processing of datasets through the use of an existing run-time system, called Active Data Repository (ADR). We show how loop fission followed by interprocedural static program slicing can be used by the compiler to extract required information for the run-time system. We present the design of a compiler/n-time interface which allows the compiler to effectively utilize the existing run-time system.A prototype compiler incorporating these techniques has been developed using the Titanium front-end from Berkeley. We have evaluated this compiler by comparing the performance of compiler generated code with hand customized ADR code for three templates, from the areas of digital microscopy and scientific simulations. Our experimental results show that the performance of compiler generated versions is, on the average 21% lower, and in all cases within a factor of two, of the performance of hand coded versions.
The Procrustes Problem for Orthogonal Stiefel Matrices
Authors: A. W. Bojanczyk, A. Lutoborski
Venue: SIAM Journal on Scientific Computing (1999)

In this paper we consider the Procrustes problem on the manifold of orthogonal Stiefel matrices. Given matrices ${\cal A}\in {\Bbb R}^{m\times k},$ ${\cal B}\in {\Bbb R}^{m\times p},$ $m\ge p \ge k,$ we seek the minimum of $\|{\cal A}-{\cal B}Q\|^2$ for all matrices $Q\in {\Bbb R}^{p\times k},$ $Q^TQ=I_{k\times k}$. We introduce a class of relaxation methods for generating sequences of approximations to a minimizer and offer a geometric interpretation of these methods. Results of numerical experiments illustrating the convergence of the methods are given.
Convergence of Subdivision Schemes Associated with Nonnegative Masks
Authors: Rong-Qing Jia, Ding-Xuan Zhou
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

This paper is concerned with refinement equations of the type $$ f = \sum_{\alpha\in\bbbz^s} a(\alpha) f({M\kern .12em\cdot}-\alpha), $$ where f is the unknown function defined on the s-dimensional Euclidean space $\bbbr^s$, a is a finitely supported sequence on $\bbbz^s$, and M is an s x s dilation matrix with m := |det M|. The solution of a refinement equation can be obtained by using the subdivision scheme associated with the mask. In this paper we give a characterization for the convergence of the subdivision scheme when the mask is nonnegative. Our method is to relate the problem of convergence to m column-stochastic matrices induced by the mask. In this way, the convergence of the subdivision scheme can be determined in a finite number of steps by checking whether each finite product of those column-stochastic matrices has a positive row. As a consequence of our characterization, we show that the convergence of the subdivision scheme with a nonnegative mask depends only on the location of its positive coefficients. Several examples are provided to demonstrate the power and applicability of our approach.
Readable computer documentation
Authors: George R. Klare
Venue: ACM Journal of Computer Documentation (JCD) (2000)

A retrospective look shows earlier advice still relevant to both predicting and producing readable writing. For prediction, refined readability formulas with stronger criterion passages and updated familiar -word lists have appeared, although the computerization of readability tests sometimes encourages misapplying or misinterpreting them when screening text. For production, attention to sentence construction, word characteristics, and information density remains relevant to both drafting and revising computer documentation for readability, especially since reading speed and reader preference often interact with comprehension in practical settings.
Functional timing optimization
Authors: Alexander Saldanha
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

It is widely believed that any true (or sensitizable) critical path of length &ge; T must be sped up in order for a circuit to have a delay < T. In this paper I demonstrate that this notion is pessimistic. Many true paths can never affect the delay of the circuit &mdash; whenever such a path propagates a signal, some other path that is at least as long also propagates a signal.The theory for a new classification of paths based on the impact on the circuit delay is presented and conditions are given under which a path (or a set of paths) must be sped up in order to improve the circuit delay. The conditions for the categorization are independent of the delays in the circuit and are valid for all delay assignments.This work indicates that the widely employed notions of true and false paths may be misleading both for timing optimization and delay analysis of logic circuits.
Renormalization Group-Based Transport Modeling of Premixed Turbulent Combustion. II. Finite Density Gradient and Direct Heat Release
Authors: Alexandr Konstantinov, Steven A. Orszag, Ilya Staroselsky, Victor Yakhot
Venue: Journal of Scientific Computing (1998)

A new method for numerical simulation of flame propagation in turbulent premixed combustible gaseous mixtures is proposed and tested. The method combines (I) a modified eikonal equation, employed to model the flame front dynamics&semi; (2) a method of front tracking using a strip of computational cells containing the flame&semi; and (3) a formula for turbulent flame propagation speed. The method includes two separate models. The first one obviates the necessity to solve equations for heat release, temperature and enthalpy, and utilizes a model equation of state to accurately render the volumetric effect and related instabilities. The second one provides a model for direct heal release and temperature calculation in the presence of heat-conducting boundaries (walls), in the multi-component combustible mixtures with variable composition and temperature-dependent heat capacities of all species. This model can be used when the heat transport on the walls is of interest, effects of flame quenching are essential and for the especially important case of combustion in a closed volume, e.g., in a cylinder of an internal combustion engine or chemical reactor. This modification is also effective for simulation of ramjet engines. The new method proves to be self-consistent, robust and highly effective.
Readability formulas have even more limitations than Klare discusses
Authors: Janice Redish
Venue: ACM Journal of Computer Documentation (JCD) (2000)

A literature review reveals many technical weaknesses of readability formulas (when compared to direct usability testing with typical readers): they were developed for children s school books, not adult technical documentation;they ignore between-reader differences and the effects of content, layout, and retrieval aids on text usefulness; they emphasize countable features at the expense of more subtle contributors to text comprehension.
Bandera: extracting finite-state models from Java source code
Authors: James C. Corbett, Matthew B. Dwyer, John Hatcliff, Shawn Laubach, Corina S. Păsăreanu, Robby, Hongjun Zheng
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

Finite-state verification techniques, such as model checking, have shown promise as a cost-effective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a finite-state model that approximates the executable behavior of the software system of interest. Current best-practice involves hand-construction of models which is expensive (prohibitive for all but the smallest systems), prone to errors (which can result in misleading verification results), and difficult to optimize (which is necessary to combat the exponential complexity of verification algorithms).In this paper, we describe an integrated collection of program analysis and transformation components, called Bandera, that enables the automatic extraction of safe, compact finite-state models from program source code. Bandera takes as input Java source code and generates a program model in the input language of one of several existing verification tools; Bandera also maps verifier outputs back to the original source code. We discuss the major components of Bandera and give an overview of how it can be used to model check correctness properties of Java programs.
A Subpath Ejection Method for the Vehicle Routing Problem
Authors: Purushottaman Nandakumar, Jeffrey L. Rummel, David Hartvigsen, Cesar Rego
Venue: Management Science (1998)

Generically, ejection chains are methods conceived to allow solution transformations to be efficiently carried out by modifying a variable number of their components at each step of a local search algorithm. We consider a subpath ejection chain method for the vehicle routing problem (VRP) under capacity and route length restrictions. The method undertakes the identification of a substructure named the flower reference structure which, besides coordinating moves during an ejection chain construction, allows the creation of neighborhood structures with interesting combinatorial characteristics. Specifically, we base the method on a fundamental property of creating alternating paths and cycles during an ejection chain construction. A new algorithm based on a Tabu search framework is proposed, and computational results on a set of academic and real-world problems indicate that the algorithm may be a good alternative to the best heuristic algorithms for the VRP.
Equivalence of Nonlinear Systems to Prime Systems under Generalized Output Transformations
Authors: E. Aranda-Bricaire, R. M. Hirschorn
Venue: SIAM Journal on Control and Optimization (1999)

Within a linear algebraic framework, we present a new characterization of the class of nonlinear systems which are equivalent to a prime system. We then introduce a class of generalized output transformations that can be thought of as a generalization to the nonlinear setting of a unimodular transformation in the output space. Our main result gives necessary and sufficient conditions for equivalence to a prime system under a certain group of transformations that includes generalized output transformations.
A toolkit for strategic usability: results from workshops, panels, and surveys
Authors: Stephanie Rosenbaum, Janice Anne Rohn, Judee Humburg
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

This paper describes the organizational approaches and usability methodologies considered by HCI professionals to increase the strategic impact of usability research within companies. We collected the data from 134 HCI professionals at three conferences: CHI 98, CHI 99, and the Usability Professionals' Association 1999 conference. The results are the first steps towards a toolkit for the usability community that can help HCI practitioners learn from the experiences of others in similar situations.
Spatial Color Indexing and Applications
Authors: Jing Huang, S. Ravi Kumar, Mandar Mitra, Wei-Jing Zhu, Ramin Zabih
Venue: International Journal of Computer Vision (1999)

We define a new image feature called the color correlogram and use it for image indexing and comparison. This feature distills the spatial correlation of colors and when computed efficiently, turns out to be both effective and inexpensive for content-based image retrieval. The correlogram is robust in tolerating large changes in appearance and shape caused by changes in viewing position, camera zoom, etc. Experimental evidence shows that this new feature outperforms not only the traditional color histogram method but also the recently proposed histogram refinement methods for image indexing/retrieval. We also provide a technique to cut down the storage requirement of the correlogram so that it is the same as that of histograms, with only negligible performance penalty compared to the original correlogram.We also suggest the use of color correlogram as a generic indexing tool to tackle various problems arising from image retrieval and video browsing. We adapt the correlogram to handle the problems of image subregion querying, object localization, object tracking, and cut detection. Experimental results again suggest that the color correlogram is more effective than the histogram for these applications, with insignificant additional storage or processing cost.
Competitive On-Line Algorithms for Distributed Data Management
Authors: Carsten Lund, Nick Reingold, Jeffery Westbrook, Dicky Yan
Venue: SIAM Journal on Computing (1999)

Competitive on-line algorithms for data management in a network of processors are studied in this paper. A data object such as a file or a page of virtual memory is to be read and updated by various processors in the network. The goal is to minimize the communication costs incurred in serving a sequence of such requests. Distributed data management on important classes of networks---trees and bus-based networks---are studied. Optimal algorithms with constant competitive ratios and matching lower bounds are obtained. Our algorithms use different interesting techniques, such as work functions [Chrobak and Larmore, Proc. DIMACS Workshop on On-Line Algorithms, AMS, 1991, pp. 11--64] and "factoring."
Diagnosability of the Möbius Cubes
Authors: Jianxi Fan
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

The recently introduced interconnection networks, the Möbius cubes, are hypercube variants that have some better properties than hypercubes. The n-dimensional Möbius cube Mn is a regular graph with 2n nodes and n2n¿1 edges. The diameter of Mn is about one half that of the n-dimensional hypercube Qn and the average number of steps between nodes for Mn is about two-thirds of the average for Qn, and 1 $-$Mn has dynamic performance superior to that of Qn [1]. Of course, the symmetry of Mn is not superior to that of Qn, i.e., Qn is both node symmetric and edge symmetric [11], whereas Mn is, in general, neither node symmetric (n¿ 4) nor edge symmetric (n¿ 3) [1]. In this paper, we study the diagnosability of Mn. We use two diagnosis strategies, both based on the so-called PMC diagnostic model¿the precise (one-step) diagnosis strategy proposed by Preparata et al. [10] and the pessimistic diagnosis strategy proposed by Friedman [9]. We show that the diagnosability of Mn is the same as that of Qn, i.e., Mn is n-diagnosable under the precise diagnosis strategy and (2n$-$ 2)/(2n$-$ 2)-diagnosable under the pessimistic diagnosis strategy.
Antidiffusive Velocities for Multipass Donor Cell Advection
Authors: Len Margolin, Piotr K. Smolarkiewicz
Venue: SIAM Journal on Scientific Computing (1999)

Multidimensional positive definite advection transport algorithm (MPDATA) is an iterative process for approximating the advection equation, which uses a donor cell approximation to compensate for the truncation error of the originally specified donor cell scheme. This step may be repeated an arbitrary number of times, leading to successively more accurate solutions to the advection equation. In this paper, we show how to sum the successive approximations analytically to find a single antidiffusive velocity that represents the effects of an arbitrary number of passes. The analysis is first done in one dimension to illustrate the method and then is repeated in two dimensions. The existence of cross terms in the truncation analysis of the two-dimensional equations introduces an extra complication into the calculation. We discuss the implementation of our new antidiffusive velocities and provide some examples of applications, including a third-order accurate scheme.
The practical management of information ethics problems: test your appropriate use policy, part IV
Authors: John W. Smith
Venue: ACM SIGUCCS Newsletter (1998)

The previous "Practical Management" article (Volume 29, No. 1--3, September 1998, pgs. 12--14) explored ethical questions that come from the distributed computing environment. It used four examples to explore issues associated with the physical domain - ownership, support, supplies, etc. This article will use the same examples to explore questions of intellectual property in the distributed environment.
The role graph model and conflict of interest
Authors: Matunda Nyanchama, Sylvia Osborn
Venue: ACM Transactions on Information and System Security (TISSEC) (1999)

We describe in more detail than before the reference model for role-based access control introduced by Nyanchama and Osborn, and the role-graph model with its accompanying algorithms, which is one way of implementing role-role relationships. An alternative role insertion algorithm is added, and it is shown how the role creation policies of Fernandez et al. correspond to role addition algorithms in our model. We then use our reference model to provide a taxonomy for kinds of conflict. We then go on to consider in some detail privilege-privilege and and role-role conflicts in conjunction with the role graph model. We show how role-role conflicts lead to a partitioning of the role graph into nonconflicting collections that can together be safely authorized to a given user. Finally, in an appendix, we present the role graph algorithms with additional logic to disallow roles that contain conflicting privileges.
A bipartition-codec architecture to reduce power in pipelined circuits
Authors: Shanq-Jang Ruan, Rung-Ji Shang, Feipei Lai, Shyh-Jong Chen, Xian-Jun Huang
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper proposes a new bipatition-codec architecture that may reduce power consumption of pipelined circuits. We treat each output value of a pipelined circuit as one state of a FSM. If the output of a pipelined circuit transit mainly among few states, we could partition the combinational portion of a pipelined circuit into two blocks: one that contains the few states of high activity is small and the other that contains the remainder of low activity is big. Consequently, the state transitions will be confined to the small block in most of the time. Then we replace the small block with a codec circuit, which consists of an encoder and a decoder, to reduce the internal switching activity of the block. The encoder minimizes the number of bit changes during state transitions thus the switching which propagates into decoder is reduced considerably. We present experimental results on several MCNC benchmarks and get up to 63.7% power savings by using our new architecture.
Managing service level agreements
Authors: Nathan J. Muller
Venue: International Journal of Network Management (1999)

Service level agreements are increasingly being used in enterprise networks and are contracts that specify the performance parameters within which a network service is provided. In this article their application, preparation, and effects on IT departments are considered. Copyright &copy; 1999 John Wiley Sons, Ltd.
The Ring Loading Problem
Authors: Alexander Schrijver, Paul Seymour, Peter Winkler
Venue: SIAM Review (1999)

The following problem arose in the planning of optical communications networks which use bidirectional SONET rings. Traffic demands di,j are given for each pair of nodes in an $n$-node ring; each demand must be routed one of the two possible ways around the ring. The object is to minimize the maximum load on the cycle, where the load of an edge is the sum of the demands routed through that edge.We provide a fast, simple algorithm which achieves a load that is guaranteed to exceed the optimum by at most 3/2 times the maximum demand, and that performs even better in practice. En route we prove the following curious lemma: for any $x_1, \dots, x_n \in [0,1]$ there exist $y_1, \dots, y_n$ such that for each $k$, $|y_k|=x_k$ and $$ \left| \sum_{i=1}^k y_i - \sum_{i=k+1}^n y_i \right| \le 2. $$ [This article is reprinted here (with updates) from SIAM J. Discrete Math., 11 (1998), pp. 1--14. New developments include a $1+\varepsilon$ approximation algorithm and a variation of ring loading in the setting of wavelength division multiplexing; remarks added for this printing, about these and other issues, are enclosed in brackets.]