ppxscal/embedding_network huggingface dataset:
Streamlining the Standards Development Process
Venue: Computer (1994)

The technical quality of an IEEE standard and its expeditious delivery to the user community are the responsibility of highly competent professionals, working in committees, to achieve those results. In a way, these goals are compelling forces. Rushing a standard by sacrificing quality is unacceptable, yet it is equally unacceptable to miss a market niche by delivering a standard too late. That is why the IEEE, as the best equipped standards developer in the electrotechnology field, must continue to strive for process improvements. Authors of documents should be the ones creating the ultimate electronic product. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An integrated data path optimization for low power based on network flow method
Authors: Chun Gi Lyuh, Taewhan Kim, C. L. Liu
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems for power optimization can be formulated as network flow problems and be solved optimally. However, in these formulations, a fixed schedule was assumed. In such context, one key problem is: given an optimal network flow solution to a hardware allocation/binding problem for a schedule, how to generate a new optimal network flow solution rapidly for a local change of the schedule. To this end, from a comprehensive analysis of the relation between network structure and flow computation, we devise a two-step procedure: (Step 1) max-flow computation step which finds a valid (maximum) flow solution while retaining the previous (maximum flow of minimum cost) solution as much as possible; (Step 2) min-cost computation step which incrementally refines the flow solution obtained in Step 1, using the concept of finding a negative cost cycle in the residual graph for the flow. The proposed algorithm can be applied effectively to several important high-level data path optimization problems (e.g., allocations/bindings of functional units, registers, buses, and memory ports) when we have the freedom to choose a schedule that will minimize power consumption. Experimental results (for bus synthesis) on benchmark problems show that our designs are 5.2% more power-efficient over the best known results, which is due to (a) exploitation of the effect of scheduling and (b) optimal binding for every schedule instance. Furthermore, our algorithm is about 2.8 times faster in run time over the full network flow based (optimal) bus synthesis algorithm, which is due to (c) our novel (two-step) mechanism which utilize the previous flow solution to reduce redundant flow computations.
Predicting Price/Performance Trade-offs for Whitney: A Commodity Computing Cluster
Authors: Jeffrey C. Becker, Bill Nitzberg, Rob F. Van Der Wijngaart, Maurice Yarrow
Venue: The Journal of Supercomputing (1999)

We couple simple performance models with pricing to optimize the design of clusters built from commodity components for scientific computing. We apply this technique using the NAS Parallel Benchmarks as a representative workload. We develop models of the BT, LU, and SP benchmarks. The models consist of closed form expressions based on problem size, number of processors, and three measured quantities (single processor performance, network latency, and network bandwidth). These models predict benchmark performance to within 30%. This technique was used in the design of Whitney, a commodity computing cluster at NASA Ames Research Center. In particular, for systems costing less than &dollar;1,000,000, the performance characteristics of Intel Pentium processors are better matched to the slower (and less expensive) Fast Ethernet, than to the faster (and more expensive) Myricom Myrinet.
Probabilistic Clock Synchronization in Distributed Systems
Authors: K. Arvind
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Presents and analyzes a new probabilistic clock synchronization algorithm that can guarantee a much smaller bound on the clock skew than most existing algorithms. The algorithm is probabilistic in the sense that the bound on the clock skew that it guarantees has a probability of invalidity associated with it. However, the probability of invalidity may be made extremely small by transmitting a sufficient number of synchronization messages. It is shown that an upper bound on the probability of invalidity decreases exponentially with the number of synchronization messages transmitted. A closed-form expression that relates the probability of invalidity to the clock skew and the number of synchronization messages is also derived.
Weighted quantile-based estimation for a class of transformation distributions
Authors: G. D. Rayner, H. L. MacGillivray
Venue: Computational Statistics Data Analysis (2002)

Quantile-based methods appear in both statistical inference and exploratory data analysis. Inferential methods based on order statistics generally have extensive theoretical bases, while exploratory data analysis tends to emphasize graphical methods and often uses selected sets of quantiles such as the "letter-values" of Tukey (Exploratory Data Analysis, Addison-Wesley, Reading, MA, 1977b). Since transformations of random variables give rise to families of distributions defined through their quantile functions, quantile-based methods could be considered a natural approach when using such families. This paper considers quantile-based methods for fitting two such families of distributions (formed by transforming the standard normal), the g-and-k and the adapted g-and-h distributions, which have been developed to take advantage of certain shape functionals.The effects of different quantiles are taken into account by considering weighted sums of estimates based on quantiles within the data, these sets of estimates arising from matching shape, location and scale functionals. The methods considered correspond to different criteria for the weighted sums. These iteratively reweighted methods use approximations to means and variances of the functionals, and so not only produce parameter estimates, but also approximations of the mean and variance for these estimates, and weights which indicate which functionals of the quantiles of the data are found to be most important. A simulation study is included, and the procedures, distributions and approximations are also illustrated by fitting two air pollution datasets.Comparisons are made with a quick method that uses the median of the set of estimates, and with numerical maximum likelihood estimation which tends to be not efficient for these families until very large sample sizes are available (Rayner and MacGillivray, 2002). The results indicate that the weighted methods perform better in a number of ways than numerical maximum likelihood estimation for smaller and moderately-sized samples. MATLAB software to carry out the weighted method is available on request.
Computer modelling of trace metal ion speciation: practical implementation of a linear continuous function for complexation by natural organic matter
Authors: Christophe Huber, Montserrat Filella, Raewyn M. Town
Venue: Computers Geosciences (2002)

A computer program (MODELm) is described for calculating the trace metal speciation of mixtures of several metals and natural organic matter by using a linear differential equilibrium function model that takes into account the metal binding dependence on the metal : complexant concentration ratio.MODELm was able to predict the degree of metal ion complexation by humic acid over a range of metal ion loadings in good agreement with reported experimental data. When compared with the widely used speciation code MINTEQA2, MODELm predicted a much greater amount of metal-NOM complexation under given conditions, and a marked dependence of the extent of metal-NOM complexation on the concentration of NOM. These results have significance for metal ion speciation modelling in natural systems.
User-driven integrated software lives: "Paleomag" paleomagnetics analysis on the Macintosh
Authors: Craig H. Jones
Venue: Computers Geosciences (2002)

"PaleoMag," a paleomagnetics analysis package originally developed for the Macintosh operating system in 1988, allows examination of demagnetization of individual samples and analysis of directional data from collections of samples. Prior to recent reinvigorated development of the software for both Macintosh and Windows, it was widely used despite not running properly on machines and operating systems sold after 1995. This somewhat surprising situation demonstrates that there is a continued need for integrated analysis software within the earth sciences, in addition to well-developed scripting and batch-mode software. One distinct advantage of software like PaleoMag is in the ability to combine quality control with analysis within a unique graphical environment. Because such demands are frequent within the earth sciences, means of nurturing the development of similar software should be found.
Recursive bipartitioning of BDDs for performance driven synthesis of pass transistor logic circuits
Authors: Rupesh S. Shelar, Sachin S. Sapatnekar
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In this paper, we address the problem of performance oriented synthesis of pass transistor logic (PTL) circuits using a binary decision diagram (BDD) decomposition technique. We transform the BDD decomposition problem into a recursive bipartitioning problem and solve the latter using a max-flow min-cut technique. We use the area and delay cost of the PTL implementation of the logic function to guide the bipartitioning scheme. Using recursive bipartitioning and a one-hot multiplexer circuit, we show that our PTL implementation has logarithmic delay in the number of inputs, under certain assumptions. The experimental results on benchmark circuits are promising, since they show the significant delay reductions with small or no area overheads as compared to previous approaches.
TA-PSV&mdash;Timing Analysis for Partially Specified Vectors
Authors: Liang-Chi Chen, Sandeep K. Gupta, Melvin A. Breuer
Venue: Journal of Electronic Testing: Theory and Applications (2002)

We propose a new concept-timing analysis for partially specified vectors (TA-PSV)-that enables the computation of tight timing windows. At one extreme, when the vectors are completely unspecified, TA-PSV reduces to static timing analysis (STA). At the other extreme, when the vectors are completely specified, TA-PSV performs timing simulation (TS). We present a systematic approach to construct a computationally feasible TA-PSV framework using a delay model that captures simultaneous to-controlling switching effects. We also demonstrate how TA-PSV can improve timing validation and also that TA-PSV significantly improves efficiency of timing-oriented test generation by reducing the search space.
On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'
Authors: Flip Korn, Bernd-Uwe Pagel, Christos Faloutsos
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Spatial queries in high-dimensional spaces have been studied extensively recently. Among them, nearest-neighbor queries are important in many settings, including spatial databases (Find the $k$ closest cities) and multimedia databases (Find the $k$ most similar images). Previous analyses have concluded that nearest-neighbor search is hopeless in high dimensions due to the notorious ¿curse of dimensionality.¿ Here, we show that this may be overpessimistic. We show that what determines the search performance (at least for R-tree-like structures) is the intrinsic dimensionality of the data set and not the dimensionality of the address space (referred to as the embedding dimensionality). The typical (and often implicit) assumption in many previous studies is that the data is uniformly distributed, with independence between attributes. However, real data sets overwhelmingly disobey these assumptions; rather, they typically are skewed and exhibit intrinsic (¿fractal¿) dimensionalities that are much lower than their embedding dimension, e.g., due to subtle dependencies between attributes. In this paper, we show how the Hausdorff and Correlation fractal dimensions of a data set can yield extremely accurate formulas that can predict the I/O performance to within one standard deviation on multiple real and synthetic data sets. The practical contributions of this work are our accurate formulas, which can be used for query optimization in spatial and multimedia databases. The major theoretical contribution is the ¿deflation¿ of the dimensionality curse: Our formulas and our experiments show that previous worst-case analyses of nearest-neighbor search in high dimensions are overpessimistic to the point of being unrealistic. The performance depends critically on the intrinsic (¿fractal¿) dimensionality as opposed to the embedding dimension that the uniformity and independence assumptions incorrectly imply.
Maximum entropy light source placement
Authors: Stefan Gumhold
Venue: Proceedings of the conference on Visualization '02 (2002)

Finding the "best" viewing parameters for a scene is quite difficult but a very important problem. Fully automatic procedures seem to be impossible as the notion of "best" strongly depends on the human judgment as well as on the application. In this paper a solution to the sub-problem of placing light sources for given camera parameters is proposed. A light position is defined to be optimal, when the resulting illumination reveals more about the scene as the illuminations from all other light positions, i.e. the light position maximizes the information that is added to the image through the illumination. With the help of an experiment with several subjects we could adapt the information measure to the actually perceived information content. We present fast global optimization procedures and solutions for two and more light sources.
Crosstalk fault detection by dynamic Idd
Authors: Xiaoyun Sun, Seonki Kim, Bapiraju Vinnakota
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Undesired capacitive crosstalk between signals is expected to be a significant concern in deep submicron circuits. New test techniques are needed for these crosstalk faults since they may cause unacceptable performance degradation. We analyze the impact of crosstalk faults on a circuit's power dissipation. Crosstalk faults can be detected by monitoring the dynamic supply current. The test method is based on a recently developed dynamic Idd test metric, the energy consumption ratio (ECR). ECR-based test has been shown to be effective at tolerating the impact of process variations. In this paper, we apply a ECR-based test method called ECR-VDD test to detect the crosstalk faults. The effectiveness of the method is demonstrated by simulation results.
Improved Test Generation for High-Activity Circuits
Authors: Kewal Saluja, Kyuchull Kim
Venue: IEEE Design Test (1990)

An implementation of a test-pattern generator based on the Podem (path-oriented decision-making) algorithm is proposed. Podem uses a depth-first search from the fault location to assign primary input values. The result of these assignments at internal nodes is then determined by logic simulation (implication). Podem must compute primary input combinations that both excite the fault and propagate it to primary outputs. The algorithm can be improved for high-activity circuits by packing more than one signal value into a word during implication. Packing introduces parallelism into the implication part of test generation and can be used to examine both the normal assignment and the alternative assignment to an input variable in parallel. With parallelism, the input space can be searched faster. To assess the benefits of such a scheme, compiled-code and event-driven version of the 'imply' function in Podem were implemented with and without the parallelism offered by value packing. Results show that conventional Podem with event-driven implication performs better for low-activity circuits, whereas Podem with compiled code and packed signal values performs better for high-activity circuits.
System Verification Using Multilevel Concurrent Simulation
Authors: Karen Panetta Lentz, Jamie Heller, Pier Luca Montessoro
Venue: IEEE Micro (1999)

There is a growing demand to validate and test designs that integrate a multitude of discrete, standard and commercial off the shelf (COTS) components and software. Often, the proprietary nature of COTS further complicates the validation process by prohibiting designers from implementing a robust test and validation strategy. In order to preserve a vendor's intellectual property, a customer is often provided a high level model, with limited access to its internals. This limitation may preclude a customer from fully exercising their embedded designs, which may create safety issues for some embedded systems.The increasing use of high level models is creating a need for tools that are capable of testing and validating COTS components in conjunction with an engineer's more detailed design. Unfortunately, simulation tools currently available are incapable of simulating multilevel designs, which include gate, RTL and behavioral levels. Those tools that do attempt to solve these problems resort to merging simulators together, each targeted at handling a specific level of abstraction. This approach incurs high communication overhead between simulators, as well as impaired observation and accuracy.
Axelrod Meets Cournot: Oligopoly and the Evolutionary Metaphor
Authors: Huw David Dixon, Steven Wallis, Scott Moss
Venue: Computational Economics (2002)

This paper explores the implication of evolutionary models (replicator dynamics) in a simple Cournot duopoly model. A firm type is a linear decision rule in which the firm's output depends on the other firm's previous output. First we run an Axelrod Tournament between firm types. The champion firm is a near profit-maximizer. Secondly, we allow social evolution to occur using replicator dynamics. Here we find that there are very strong forces leading towards a collusive or near collusive outcome, so long as there is not too much `noise' in the dynamics.
Multiprocessor Validation of the Pentium Pro
Authors: Deborah T. Marr, Subramanian Natarajan, Shreekant Thakkar, Richard Zucker
Venue: Computer (1996)

While working on its newest microprocessor, the Pentium Pro, Intel was aware that many manufacturers wanted the company to quickly supply them with high-performance products suitable for multiprocessor systems. In the past, multiprocessor systems have taken a year longer than uniprocessor systems to introduce because of the need to develop and validate the additional functionality. So, the company had to find a way to make sure the Pentium Pro would be multiprocessor functional at first silicon. The process was even more challenging because Intel wanted to deliver a production system within a year of first silicon. Intel subsequently developed a test methodology to validate multiprocessor functionality. Intel used a variety of methods, including self-checking test templates, random test generation, microbenchmarks, and such industry-standard benchmarks as parallel scientific code and large database workloads. The company discovered that it could also use its presilicon validation methodology in the postsilicon environment. In addition, Intel discovered that multiprocessor validation can find problems that also affect uniprocessor functionality and that might be difficult to test in a uniprocessor environment.
Logic-Based Query Optimization for Object Databases
Authors: John Grant, Jarek Gryz, Jack Minker, Louiqa Raschid
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

We present a technique for transferring query optimization techniques, developed for relational databases, into object databases. We demonstrate this technique for ODMG database schemas defined in ODL and object queries expressed in OQL. The object schema is represented using a logical representation (Datalog). Semantic knowledge about the object data model, e.g., class hierarchy information, relationship between objects, etc., as well as semantic knowledge about a particular schema and application domain are expressed as integrity constraints. An OQL object query is represented as a logic query and query optimization is performed in the Datalog representation. We obtain equivalent (optimized) logic queries and, subsequently, obtain equivalent (optimized) OQL queries for each equivalent logic query. In this paper, we present one optimization technique for semantic query optimization (SQO) based on the residue technique of [6], [7], [8]. We show that our technique generalizes previous research on SQO for object databases. We handle a large class of OQL queries, including queries with constructors and methods. We demonstrate how SQO can be used to eliminate queries which contain contradictions and simplify queries, e.g., by eliminating joins, or by reducing the access scope for evaluating a query to some specific subclass(es). We also demonstrate how the definition of a method, or integrity constraints describing the method, can be used in optimizing a query with a method.
SAPL: APL as client and server for SAP R2/R3 systems
Authors: Tilman P. Otto
Venue: ACM SIGAPL APL Quote Quad (2002)

The SAP company (Walldorf / Germany) provides a software interface for its R2 and R3 products called "Remote Function Call" (RFC). This interface is available on multiple operating systems and allows external systems written in C or C++ to directly call function modules of a R2/R3 system. In addition, it is even possible to provide external server function modules within an external system, which can be accessed from within the SAP system. This paper presents the newly developed RFC based APL extension "SAPL" that allows writing client and server applications for SAP systems entirely in APL. SAPL is the bridge between the powerful multi-dimensional data processing capabilities of APL and SAP based business applications.
How to Use Linguistic Instruments for Object-Oriented Analysis
Authors: Natalia Juristo, Ana Maria Moreno, Marta López
Venue: IEEE Software (2000)

One of the limitations of the application of object-oriented approaches to software development is the object-oriented analysis process's immaturity. This article proposes an approach that is based on using linguistic information from informal specifications to be applied during this process. The proposed method helps analyze this information semantically and syntactically and employs a semiformal procedure to extract an object-oriented system's components from such analysis.
Numerical Schemes of Shock Filter Models for Image Enhancement and Restoration
Authors: L. Remaki, M. Cheriet
Venue: Journal of Mathematical Imaging and Vision (2003)

Considerable interest has recently been given to signal processing models based on partial differential equations. Successively improved models based on hyperbolic partial differential equation types are proposed in the literature. These models yield interesting results&semi; however, it would be of great interest to generalize them in order to increase their efficiency. In this paper, we propose a generalized shock filter model for one-dimensional signal restoration. After justifying the existence and uniqueness of the solutions in an adequate vector space, we propose an effective numerical scheme to discretize the proposed model, and derive a two-dimensional numerical scheme directly from the one-dimensional model following a space-split strategy. We then prove a stability result for both schemes. We conclude our study by providing high-quality experimental results for one- and two-dimensional signal enhancement and restoration, and showing the influence the shock speed control has on processing time.