ppxscal/embedding_network huggingface dataset:
Built-In Self-Diagnosis for Repairable Embedded RAMs
Authors: Robert Treuer, Vinod K. Agarwal
Venue: IEEE Design Test (1993)

A method of built-in self-diagnosis (BISD) for repairable, embedded static RAMs (SRAMs) is presented. The BISD circuit, with self-repair, requires about 5% extra area in a 64-kb SRAM. The circuit contains a small reduced-instruction-set processor, which executes diagnosis algorithms stored in a ROM. These algorithms employ hybrid serial/parallel operations when external repair is available or modular operations when self-repair is required. The algorithms, hardware design, and design costs and tradeoffs are discussed.
Computer service rates and user support
Authors: Douglas E. Van Houweling
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

The meteoric decline in hardware costs now in progress will result in computing becoming a personnel-intensive enterprise. Most of this personnel will be devoted to software development and support of computing users. The financing and budgeting in most university computing centers is centered on hardware and computing cycles. How, then, can university computing best adapt to the changing economic structure of the information processing industry?Who should provide user support services? The central computing service center? Individual departments and/or colleges? Are there significant economies of scale in user support? If there are, do they outweigh the responsiveness that can be provided by a decentralized network of user support services?Who should pay for user support services? The users? The university? If the university pays, should centralized or decentralized arrangements be made for the services?Who should determine the level of expenditure on user support services? The market? The departments and colleges? The central administration? The computing center management?What will be the policy implications of the alternate answers to the questions above? Will they enhance or retard the decentralization of computing services? Will they encourage users to depend on internal or external facilities? Will they lead to a growth or decline of user support activity within the computing center?All of the above questions are now and have been debated strenuously regarding the provision of computing cycles. There is every reason to believe that the same debate will take place regarding support services. Strong user support services will be the sine qua non of high quality university computing in the future, and it will not be available unless we deal promptly with the issues of pricing, budgeting, and organization outlined above.
A Random Walk Down the Genomes: DNA Evolution in Valis
Authors: Salvatore Paxia, Archisman Rudra, Yi Zhou, Bud Mishra
Venue: Computer (2002)

A better understanding of biology will come through information-theoretic studies of genomes that pro-vide insights into DNA's role in governing metabolic and regulatory pathways.Understanding the evolutionary processes that act on these "codes of life" requiresthe ability to analyze vast amounts of continually generated genomic data.Researchers in the emerging bioinformatics discipline require more complex mechanisms to investigate the full ensemble of available biological facts. To meet this challenge, New York University's Bioinformatics Group is creating a computational environment called Valis--the vast active living intelligent system. Valis is designed to solve the immediate genomic and proteomic problems that the biological community currently faces, while remaining flexible enough to adapt to the maturing bioinformatics field.
A procedure for map updating using digital mono-plotting
Authors: Manuel Jauregui, José Vílchez, Leira Chacón
Venue: Computers Geosciences (2002)

Aerial photographs can be used to produce and update terrain surface maps. This procedure, however, requires the use of expensive equipment which is not readily available to most offices which use such maps. Advances in computer science and the availability of low cost equipment for digitizing and digital processing of aerial photographs, allows for a wide range of applications for the production of cartographic information of the terrain surface by digital means, one of them being digital mono-plotting. This is the production of planimetric information of a terrain surface by direct vectorization on a digital aerial photograph, using an image display for digitizing all significant features of the terrain, and afterwards performing an analytical transformation on those vectors in order to correct the deformations intrinsic to the aerial photographs.In the situation of non-flat terrain, a rigorous transformation has to be performed on the digitized lines (vectors), using colinearity equations based on control points of known coordinates and the digital elevation model (DEM) of the terrain. In such a way, deformations due to relief displacement and photographic tilt are corrected, obtaining a map free of deformations, at a known scale and referenced to a terrain coordinate system. To obtain the planimetric position of an image point on the terrain surface, the intersection point of the corresponding projective ray with the DEM of the terrain must be determined. In general, this is an iterative and time-consuming procedure. In this paper an alternative direct solution to this problem is presented with an example application.
Toward Self-Healing Infrastructure Systems
Authors: Massoud Amin
Venue: Computer (2000)

The Internet, computer networks, and the digital economy have increased the demand for reliable and disturbance-free electricity. Banking and finance depend on the robustness of electric power, cable, and wireless telecommunications. Links between the power grid and telecommunications and between electrical power and oil, water, and gas pipelines continue to be a linchpin of energy supply networks.This strong interdependence means that an action in one part of one infrastructure network can rapidly create global effects by cascading throughout the same network or into other networks.The author explains how the Complex Interactive Network/Systems Initiative (CIN/SI), a joint industry-government initiative, is developing a mathematical basis and practical tools for improving the security, performance, reliability, and robustness of energy, financial, telecommunications, and transportation networks. One challenge is to develop appropriate models for this degree of complexity and create tools that let components adaptively reconfigure the network as needed.
What is the limit of energy saving by dynamic voltage scaling?
Authors: Gang Qu
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Dynamic voltage scaling (DVS) is a technique that varies the supply voltage and clock frequency based on the computation load to provide desired performance with the minimal amount of energy consumption. It has been demonstrated as one of the most effective low power system design techniques, in particular for real time systems. Previously, there are works on both ends of the DVS systems: the ideal variable voltage system which can change its voltage with no physical constraints, and the multiple voltage system which has a number of discrete voltages available simultaneously. In this paper, we study the DVS systems between these two extreme cases. We consider systems that can vary the operating voltage dynamically under various real-life physical constraints. Based on the system's different behavior during voltage transition, we define the feasible DVS system and the practical DVS system. We build mathematical model to analyze the potential of DVS on energy saving for these different systems. Finally, we simulate the behavior of a secure wireless communication networks with DVS systems. The results show that DVS results in energy reduction from 36% to 79%, and the real life DVS systems can be very close to the ideal system in energy saving.
Support for Implementation of Evolutionary Concurrent Systems
Authors: Raju Pandey, James C. Browne
Venue: International Journal of Parallel Programming (2001)

Concurrent programs that embed specifications of synchronizations in the body of their component are difficult to extend and modify. Small changes in a concurrent program, particularly changes in the interactions among components, may require re-implementation of a large number of components. Even specifications of components cannot be reused easily. This paper presents a concurrent program composition mechanism in which both specification and implementation of computations and interactions are completely separated. Separation of specifications and implementations facilitates extensions and modifications of programs by allowing one to separately change the implementations of computations and interactions. It also supports their reusability. The paper also describes the design and implementation of a concurrent object-oriented programming language based on this model, including a compiler for the language, and reports on the execution behavior of programs written in the language.
A Note on Aliasing Probability for Multiple Input Signature Analyzer
Authors: M. Morii, K. Iwasaki
Venue: IEEE Transactions on Computers (1993)

Recently D.K. Pradhan, S.K. Gupta and M.G. Karpovsky (1990) affirmed that the codes generated by (x- alpha )(x- beta ) were not Reed-Solomon, where alpha and beta were roots of the distinct primitive polynomials of degree m. It was assumed that beta = alpha /sup 8/, where s-1 and 2/sup m/-1 were mutually prime. The authors show that under the above assumption the respective codes are Reed-Solomon codes.
Detection and Separation of Ring-Shaped Clusters Using Fuzzy Clustering
Authors: Y. Man, I. Gath
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

A new fuzzy clustering algorithm, designed to detect and characterize ring-shaped clusters and combinations of ring-shaped and compact spherical clusters, has been developed. This FKR algorithm includes automatic search for proper initial conditions in the two cases of concentric and excentric (intersected) combinations of clusters. Validity criteria based on total fuzzy area and fuzzy density are used to estimate the optimal number of substructures in the data set. The FKR algorithm has been tested on a variety of simulated combinations of ring-shaped and compact spherical clusters, and its performance proved to be very good, both in identifying the input shapes and in recovering the input parameters. Application of the FKR algorithm to an MRI image of the heart's left ventricle was used to investigate the possibility of using this algorithm as an aid in image processing.
Displaying 3D Images: Algorithms for Single-Image Random-Dot Stereograms
Authors: Harold W. Thimbleby, Stuart Inglis, Ian H. Witten
Venue: Computer (1994)

A new, simple, and symmetric algorithm can be implemented that results in higher levels of detail in solid objects than previously possible with autostereograms. In a stereoscope, an optical instrument similar to binoculars, each eye views a different picture and thereby receives the specific image that would have arisen naturally. An early suggestion for a color stereo computer display involved a rotating filter wheel held in front of the eyes. In contrast, this article describes a method for viewing on paper or on an ordinary computer screen without special equipment, although it is limited to the display of 3D monochromatic objects. (The image can be colored, say, for artistic reasons, but the method we describe does not allow colors to be allocated in a way that corresponds to an arbitrary coloring of the solid object depicted.) The image can easily be constructed by computer from any 3D scene or solid object description.
Addendum to "Hierarchical Scalable Photonic Architectures for High-Performance Processor Interconnection"
Authors: P. W. Dowd, K. K. Bogineni, K. A. Aly, J. A. Perreault
Venue: IEEE Transactions on Computers (1994)

The above paper by L. Bhuyan and D.P. Agrawal (1984) described a hierarchical, all-optical wavelength division multiplexed (WDM) network that is being built to support the communication requirements of a large distributed shared memory system. Dynamically adaptable bandwidth allocation is supported, both within and between levels of the hierarchy, and is highly scalable through wavelength re-use at each hierarchical level. The mixed radix scheme introduced was used for processor numbering, but was not specified. The system was described in term of a time multiplexed access protocol, generalized to the multichannel WDM environment, which has static slot assignment that provides excellent throughput but long latencies due to cycle synchronization. The actual system implementation will use a hybrid WDMA strategy, which is collisionless, provides low latency support, dynamic bandwidth allocation within a hierarchical level, and a fast reliable broadcast.
Modeling of stratigraphic architectural patterns in extensional settings-towards a conceptual model
Authors: Istvan Csato, Christopher G. St. C. Kendall
Venue: Computers Geosciences (2002)

Our earlier studies on active continental extensional basins revealed that high-frequency changes in sea/lake-level, spatially heterogeneous subsidence/uplift and multiple sources of sediment supply with varying rates and directions are the main factors that influence the formation of stratigraphic architectural patterns. Thus, the evolving stratal geometry results from the sea/lake-level--[time], subsidence [time, space] and sediment supply--[time, space, direction, composition] functions. The stratigraphic simulation results presented here demonstrate that Type 1 and 2 unconformities and conformities may develop in segments of an extensional basin during a sea/lake-level fall depending on the local subsidence rates. These different surfaces can be time-equivalent along the basin margin. A sea/ lake-level rise can either form a highstand systems tract (HST) or a transgressive and an overlying highstand systems tract (HST), depending on the sediment supply. A decrease and a subsequent increase in sediment supply during a stable base level stand can produce the same architectural patterns (backstepping of transgressive systems tract (TST) and aggradational or progradational patterns of HST) as a rise in the base level at constant sediment supply. Stratigraphic architectures built from multiple sediment sources show a variety of patterns as responses to spatial and temporal changes in intensities of individual sediment supply sources. Some of the possible end members of these interfingering architectural patterns have been simulated and classified. Changes in direction of sediment supply may lead to the formation of onlap-surfaces similar to unconformities.
Data management and transfer in high-performance computational grid environments
Authors: Bill Allcock, Joe Bester, John Bresnahan, Ann L. Chervenak, Ian Foster, Carl Kesselman, Sam Meder, Veronika Nefedova, Darcy Quesnel, Steven Tuecke
Venue: Parallel Computing (2002)

An emerging class of data-intensive applications involve the geographically dispersed extraction of complex scientific information from very large collections of measured or computed data. Such applications arise, for example, in experimental physics, where the data in question is generated by accelerators, and in simulation science, where the data is generated by supercomputers. So-called Data Grids provide essential infrastructure for such applications, much as the Internet provides essential services for applications such as e-mail and the Web. We describe here two services that we believe are fundamental to any Data Grid: reliable, high-speed transport and replica management. Our high-speed transport service, GridFTP, extends the popular FTP protocol with new features required for Data Grid applications, such as striping and partial file access. Our replica management service integrates a replica catalog with Grid-FTP transfers to provide for the creation, registration, location, and management of dataset replicas. We present the design of both services and also preliminary performance results. Our implementations exploit security and other services provided by the Globus Toolkit.
On isometric subgraphs of infinite bridged graphs and geodesic convexity
Authors: Norbert Polat
Venue: Discrete Mathematics (2002)

A subgraph H of a graph G is isometric if the distance between any pair of vertices in H is the same as that in G. A subset K of the vertex set of a graph G is (geodesically) convex if it contains all vertices of every shortest path joining vertices in K. In this paper we investigate some properties of the isometric subgraphs of an infinite bridged graph G containing no infinite simplices (i.e., complete subgraphs), and in particular of those whose vertex sets are convex in G. We prove that every finite set of vertices of G is contained in a finite isometric subgraph of G. Several results highlight the important role played by the dominated vertices of G (a vertex x is dominated by a vertex y if y is adjacent to x and to all neighbors of x). In particular we show that G is finite whenever the set D(G) of its dominated vertices is finite. If, however, every ray of G contains an infinite bounded subset, then V(G) is the convex hull of D(G). From this, we deduce that for every convex set K in G, there is an enumeration (xα)α > σ of the vertices of G - K such that, for every α > σ, xα is dominated in the subgraph of G induced by {xβ: α ≤ β > σ} ∪ K. Finally, if, in addition, G is bounded, then every subgraph whose vertex set is convex in G is a (discrete) deformation retract of G.
Object-Based Selective Materialization for Efficient Implementation of Spatial Data Cubes
Authors: Nebojsa Stefanovic, Jiawei Han, Krzysztof Koperski
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

With a huge amount of data stored in spatial databases and the introduction of spatial components to many relational or object-relational databases, it is important to study the methods for spatial data warehousing and OLAP of spatial data. In this paper, we study methods for spatial OLAP, by integration of nonspatial OLAP methods with spatial database implementation techniques. A spatial data warehouse model, which consists of both spatial and nonspatial dimensions and measures, is proposed. Methods for computation of spatial data cubes and analytical processing on such spatial data cubes are studied, with several strategies proposed, including approximation and selective materialization of the spatial objects resulted from spatial OLAP operations. The focus of our study is on a method for spatial cube construction, called object-based selective materialization, which is different from cuboid-based selective materialization proposed in previous studies of nonspatial data cube construction. Rather than using a cuboid as an atomic structure during the selective materialization, we explore granularity on a much finer level, that of a single cell of a cuboid. Several algorithms are proposed for object-based selective materialization of spatial data cubes and the performance study has demonstrated the effectiveness of these techniques.
Measuring the Accuracy of ROM Reciprocal Tables
Authors: D. DasSarma, D. W. Matula
Venue: IEEE Transactions on Computers (1994)

We prove that a convenient ROM reciprocal table construction algorithm generates tables that minimize the relative error. The worst case relative errors realized for such optimally computed k-bits-in, m-bits-out ROM reciprocal tables are then determined for all table sizes 3/spl les/k,m/spl les/12. We next prove the table construction algorithm always generates a k-bits-in, k-bits-out table with relative errors never any greater than 3/4 2/sup -k/, and more generally with g guard bits that for (k+g)-bits-out the relative error is never any greater than 2-(k+1)(1+1/(2g+1)). To provide for determining extreme case test data and to compute the precision of a reciprocal table without prior construction of the full ROM reciprocal table, we describe a procedure that requires generation and inspection of only a small portion of such a table to identify input values guaranteed to include the worst case relative errors in the table.
Managing Object-Oriented Framework Reuse
Authors: Steve Sparks, Kevin Benner, Chris Faris
Venue: Computer (1996)

Reusing frameworks instead of libraries can cause subtle architectural changes in an application, calling for innovative management solutions. We relate our experience managing the Knowledge-Based Software Assistant project and offer tips for buying, building, and using frameworks. One of the promises of object-oriented software development is that organizations can get a significant return on development investment because the code is easier to reuse. Software project managers are often eager to take the OO plunge for that reason, but are uncertain about the management issues they will face. There is also the problem of choosing the best form of reuse. Library-based reuse, the traditional reuse form, is more popular than framework-based reuse, but we have found that framework-based reuse offers many more benefits with the right management approach. In this article, we describe the lessons we learned building the Knowledge-Based Software Assistant/Advanced Development Model.
Jacobi Polynomials, Type II Codes, and Designs
Authors: Alexis Bonnecaze
Venue: Designs, Codes and Cryptography (1999)

Jacobi polynomials were introduced by Ozeki in analogy with Jacobi forms of lattices. They are useful to compute coset weight enumerators, and weight enumerators of children. We determine them in most interesting cases in length at most 32, and in some cases in length 72. We use them to construct group divisible designs, packing designs, covering designs, and (t,r)-designs in the sense of Calderbank-Delsarte. A major tool is invariant theory of finite groups, in particular simultaneous invariants in the sense of Schur, polarization, and bivariate Molien series. A combinatorial interpretation of the Aronhold polarization operator is given. New rank parameters for spaces of coset weight distributions and Jacobi polynomials are introduced and studied here.
Fault Sampling Revisited
Authors: Vishwani D. Agrawal, Hatsuyoshi Kato
Venue: IEEE Design Test (1990)

In the text, Test Generation for VLSI Chips (see IEEE Computer Society Press, 1988), V. Agrawal and S. Seth gave a formula for estimating fault coverage from the coverage analysis of randomly sampled faults that contains an error. A corrected formula for the sample size required for a given error tolerance in the measurement of fault coverage is given. Easy-to-use guidelines for analyzing fault coverage are presented.
Linear One-Sided Stability of MAT for Weakly Injective Domain
Authors: Sung Woo Choi, Hans-Peter Seidel
Venue: Journal of Mathematical Imaging and Vision (2002)

Medial axis transform (MAT) is very sensitive to noise, in the sense that, even if a shape is perturbed only slightly, the Hausdorff distance between the MATs of the original shape and the perturbed one may be large. But it turns out that MAT is stable, if we view this phenomenon with the one-sided Hausdorff distance, rather than with the two-sided Hausdorff distance. In this paper, we show that, if the original domain is weakly injective, which means that the MAT of the domain has no end point which is the center of an inscribed circle osculating the boundary at only one point, the one-sided Hausdorff distance of the original domain's MAT with respect to that of the perturbed one is bounded linearly with the Hausdorff distance of the perturbation. We also show by example that the linearity of this bound cannot be achieved for the domains which are not weakly injective. In particular, these results apply to the domains with sharp corners, which were excluded in the past. One consequence of these results is that we can clarify theoretically the notion of extracting &ldquo;the essential part of the MAT&rdquo;, which is the heart of the existing pruning methods.