ppxscal/embedding_network huggingface dataset:
Techniques to Reduce the Soft Error Rate of a High-Performance Microprocessor
Authors: Christopher Weaver, Joel Emer, Shubhendu S. Mukherjee, Steven K. Reinhardt
Venue: ACM SIGARCH Computer Architecture News (2004)

Transient faults due to neutron and alpha particle strikes posea significant obstacle to increasing processor transistor counts infuture technologies. Although fault rates of individual transistorsmay not rise significantly, incorporating more transistors into adevice makes that device more likely to encounter a fault. Hence,maintaining processor error rates at acceptable levels will requireincreasing design effort.This paper proposes two simple approaches to reduce errorrates and evaluates their application to a microprocessor instructionqueue. The first technique reduces the time instructions sit invulnerable storage structures by selectively squashing instructionswhen long delays are encountered. A fault is less likely to cause anerror if the structure it affects does not contain valid instructions.We introduce a new metric, MITF (Mean Instructions To Failure),to capture the trade-off between performance and reliability introducedby this approach.The second technique addresses false detected errors. In theabsence of a fault detection mechanism, such errors would nothave affected the final outcome of a program. For example, a faultaffecting the result of a dynamically dead instruction would notchange the final program output, but could still be flagged by thehardware as an error. To avoid signalling such false errors, wemodify a pipeline's error detection logic to mark affected instructionsand data as possibly incorrect rather than immediately signalingan error. Then, we signal an error only if we determine laterthat the possibly incorrect value could have affected the program'soutput.
A new approach to the extraction of ANN rules and to their generalization capacity through GP
Authors: Juan R. Rabuñal, Julián Dorado, Alejandro Pazos, Javier Pereira, Daniel Rivero
Venue: Neural Computation (2004)

Various techniques for the extraction of ANN rules have been used, but most of them have focused on certain types of networks and their training. There are very few methods that deal with ANN rule extraction as systems that are independent of their architecture, training, and internal distribution of weights, connections, and activation functions. This article proposes a methodology for the extraction of ANN rules, regardless of their architecture, and based on genetic programming. The strategy is based on the previous algorithm and aims at achieving the generalization capacity that is characteristic of ANNs by means of symbolic rules that are understandable to human beings.
Electron spin resonance study of the effect of applied stress during thermal oxidation of (111)Si on inherent Pb interface defects
Authors: D. Pierreux, A. Stesmans, R. J. Jaccodine, M.-T. Lin, T. J. Delph
Venue: Microelectronic Engineering (2004)

An electron spin resonance study has been carried out on the effect of in situ applied in-plane stress to (111)Si substrates during oxidation on the formation of inherent Pb (Si3≡Si˙; Si dangling bond) interface defects in (111)Si/ SiO2. Analysis for various, both compressive and tensile, stress levels reveals the properties of these electrically active point defects to be significantly affected, in particular their incorporated inherent density and signal shape. Interestingly, the inherent Pb density is reduced by applied tensile stress, with an opposite result for compressive. The data support the commonly accepted relationship between inherent incorporation of the Pb defects and Si/SiO2 interface mismatch.
Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model
Authors: Salil P. Vadhan
Venue: Journal of Cryptology (2004)

We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by [Lu] locally computable extractors directly yield secure private-key cryptosystems in Maurer&#x2019;s bounded-storage model.We suggest a general &#x201c;sample-then-extract&#x201d; approach to constructing locally computable extractors: use essentially any randomness-efficient sampler to select bits from the input and then apply any extractor to the selected bits. Plugging in known sampler and extractor constructions, we obtain locally computable extractors, and hence cryptosystems in the bounded-storage model, whose parameters improve upon previous constructions. We also provide lower bounds showing that the parameters we achieve are nearly optimal.The correctness of the sample-then-extract approach follows from a fundamental lemma of Nisan and Zuckerman, which states that sampling bits from a weak random source roughly preserves the min-entropy rate. We also present a refinement of this lemma, showing that the min-entropy rate is preserved up to an arbitrarily small additive loss, whereas the original lemma loses a logarithmic factor.
On the Design of Optimal Derivative Filters for Coherence-Enhancing Diffusion Filtering
Authors: Wang Wenyuan
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

For strongly oriented anisotropic processes such as coherence-enhancing diffusion filtering it is crucial to use numerical schemes with highly accurate directional behavior. It is not possible in a satisfactory way when discretizations are limited to 3 ×3 stencils. We can expand discretization stencils in the first-order derivative filters scheme [15]. In 2d or 3d images, the directional behavior is correlated with first-order derivative filter. In the paper new optimized 3-tap and 5-tap pair of first-order derivative filters with rotation-equivariant are designed in anisotropic diffusion for images with different spatial frequencies. We demonstrate the new implements have better behavior with respect to the following properties: rotation invariance, avoidance of blurring artifacts (dissipation), and more efficient.
Data assimilation with an extended Kalman filter for impact-produced shock-wave dynamics
Authors: Jim Kao, Dawn Flicker, Rudy Henninger, Sarah Frey, Michael Ghil, Kayo Ide
Venue: Journal of Computational Physics (2004)

Model assimilation of data strives to determine optimally the state of an evolving physical system from a limited number of observations. The present study represents the first attempt of applying the extended Kalman filter (EKF) method of data assimilation to shock-wave dynamics induced by a high-speed impact. EKF solves the full nonlinear state evolution and estimates its associated error-covariance matrix in time. The state variables obtained by the blending of past model evolution with currently available data, along with their associated minimized errors (or uncertainties), are then used as initial conditions for further prediction until the next time at which data becomes available. In this study, a one-dimensional (ID) finite-difference code is used along with data measured from a ID flyer plate experiment. An ensemble simulation suggests that the nonlinearity of the modeled system can be reasonably tracked by EKF. The results demonstrate that the EKF assimilation of a limited amount of pressure data, measured at the middle of the target plate alone, helps track the evolution of all the state variables. The fidelity of EKF is further investigated with numerically generated synthetic data from so-called "identical-twin experiments", in which the true state is known and various measurement techniques and strategies can be made easily simulated. We find that the EKF method can effectively assimilate the density fields, which are distributed sparsely in time to mimic radiographic data, into the modeled system.
Measuring pseudo relevance feedback & CLIR
Authors: Paul Clough, Mark Sanderson
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this poster, we report on the effects of pseudo relevance feedback (PRF) for a cross language image retrieval task using a test collection. Typically PRF has been shown to improve retrieval performance in previous CLIR experiments based on average precision at a fixed rank. However our experiments have shown that queries in which no relevant documents are returned also increases. Because query reformulation for cross language is likely to be harder than with monolingual searching, a great deal of user dissatisfaction would be associated with this scenario. We propose that an additional effectiveness measure based on failed queries may better reflect user satisfaction than average precision alone.
A Bi-Criteria Scheduling Heuristic for Distributed Embedded Systems under Reliability and Real-Time Constraints
Authors: Ismail Assayad, Alain Girault, Hamoudi Kalla
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Multi-criteria scheduling problems, involving optimizationof more than one criterion, are subject to a growinginterest. In this paper, we present a new bi-criteria schedulingheuristic for scheduling data-flow graphs of operationsonto parallel heterogeneous architectures according to twocriteria: first the minimization of the schedule length, andsecond the maximization of the system reliability. Reliabilityis defined as the probability that none of the system componentswill fail while processing. The proposed algorithmis a list scheduling heuristics, based on a bi-criteria compromisefunction that introduces priority between the operationsto be scheduled, and that chooses on what subsetof processors they should be scheduled. It uses the activereplication of operations to improve the reliability. If thesystem reliability or the schedule length requirements arenot met, then a parameter of the compromise function canbe changed and the algorithm re-executed. This process isiterated until both requirements are met.
Query Routing and Processing in Schema-Based P2P Systems
Authors: Marcel Karnstedt, Katja Hose, Kai-Uwe Sattler
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Recently, the peer-to-peer (P2P) paradigm has emerged, mainly by file sharing systems such as Napster and Gnutella and in terms of scalable distributed data structures. Due to the decentralization, P2P systems promise an improved robustness and scalability and therefore open also a new view on data integration solutions. However, several design and technical challenges arise in building scalable P2P-based integration systems. In this paper, we address one of them: the problem of distributed query processing. We discuss strategies of query decomposition and routing based on different kinds of routing indexes and present results of an experimental evaluation.
Max-Plus Eigenvector Methods for Nonlinear H$_\infty$ Problems: Error Analysis
Authors: William M. McEneaney
Venue: SIAM Journal on Control and Optimization (2004)

The H$_\infty$ problem for a nonlinear system is considered. The corresponding dynamic programming equation is a fully nonlinear, first-order, steady-state partial differential equation (PDE), possessing a term which is quadratic in the gradient. The solutions are typically nonsmooth, and further, there is nonuniqueness among the class of viscosity solutions. In the case where one tests a feedback control to see if it yields an H$_\infty$ controller, or where either the controller or disturbance sufficiently dominates, the PDE is a Hamilton--Jacobi--Bellman equation. The computation of the solution of a nonlinear, steady-state, first-order PDE is typically quite difficult. In a companion paper, we developed an entirely new class of methods for obtaining the "correct" solution of such PDEs. These methods are based on the linearity of the associated semigroup over the max-plus (or, in some cases, min-plus) algebra. In particular, solution of the PDE is reduced to solution of a max-plus (or min-plus) eigenvector problem for known unique eigenvalue 0 (the max-plus multiplicative identity). It was demonstrated that the eigenvector is unique and that the power method converges to it. In the companion paper, the basic method was laid out without discussion of errors and convergence. In this paper, we both approach the error analysis for such an algorithm, and demonstrate convergence. The errors are due to both the truncation of the basis expansion and computation of the matrix whose eigenvector one computes.
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Venue: Annual ACM Symposium on Theory of Computing (2004)

The papers in this volume were presented at the Thirty-Sixth Annual ACM Symposium on Theory of Computing (STOC 2004), held in Chicago, Illinois, June 13-15, 2004. The Symposium was sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT).In response to a Call For Papers, posted at a University of Chicago website, 271 submissions were received by the submission deadline of November 5, 4:59pm EST. All were submitted electronically on the Microsoft Conference Management Toolkit (CMT) website.The Program Committee began its deliberations electronically on December 10, and continued in that medium until its meeting in New Orleans, Louisiana, on January 9 and 10. Electronic discussion of unresolved issues continued for some weeks after the meeting.The CMT website was used for paper submission and initial posting of reviews and comments; most of the discussion was conducted and coordinated on a University of Chicago website using software produced by Daniel Tefankovic and tailored to the needs of the PC.The Program Committee selected 71 papers for presentation; one was later withdrawn.The submissions were not refereed, and many of these papers represented reports of continuing research. It is expected that most of them will appear in a more polished and complete form in scientific journals.The papers encompass a wide variety of areas of theoretical computer science, ranging from classical problems in algorithms and complexity theory (including lower bounds, graph algorithms, network flows, cryptography, random structures, inapproximabilty/PCPs), to heavily represented emerging areas and models such as quantum computing and algorithmic game theory. A number of additional areas of traditional or more recent interest to the SIGACT community are represented by one or two papers each; these include: distributed computing, computational geometry/topology, mathematical algorithms, metric spaces/embeddings, data mining, analysis of data streams, property testing.In addition to the contributed talks, the program included three invited plenary talks, represented by brief abstracts in this volume: Quantum Algorithms a Decade After Shor, by Andris Ambainis (see page 111); Network Games, by Eva Tardos (see page 341); and Depth Through Breadth, or Why Should We Attend Talks In Other Areas?, by Avi Wigderson (see page 579).The Program Committee would like to thank all authors who submitted papers for consideration. The PC also wishes to thank the large number of members of the community who assisted the PC in assessing the merits of the submissions (see "Reviewers," page xii).The PC is grateful to Microsoft Research and to the CMT Web Support staff for providing the web-site and assisting with its use.
A Monolithic Interface Circuit for Gas Sensor Arrays: Control and Measurement
Authors: S. A. Bota, A. Dieguez, J. L. Merino, R. Casanova, J. Samitier, C. Cané
Venue: Analog Integrated Circuits and Signal Processing (2004)

The electronics for monolithically integrated gas sensor arrays fabricated using a compatible CMOS process have been developed. Circuitry includes the heater driver for temperature control and an interface circuit for inspection of the four sensors in the array. The operating temperature of the sensing resistors is between 200&deg; and 400&deg;C. The proposed temperature controller is capable of regulating the temperature of a 2100 &times; 2100 &mu;m hotplate up to 400&deg;C with a resolution of 2&deg;C with 5 V supply voltage. A readout circuit based on a ring-oscillator has been included to measure the sensing resistance change upon gas exposure over a high dynamic range. Because it is robust, small, low priced and offers future capabilities with adequate signal processing, the system would be able to cover most of today's gas sensor markets.
Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
Authors: Michael Elkin
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

The design of distributed approximation protocols is a relatively new rapidly developing area of research. However, so far little progress was done in the study of the hardness of distributed approximation. In this paper we initiate the systematic study of this subject, and show strong unconditional lower bounds on the time-approximation tradeoff of the distributed minimum spanning tree problem, and some of its variants.
Subquadrangles of order s of generalized quadrangles of order (s, s2), Part I
Authors: M. R. Brown, J. A. Thas
Venue: Journal of Combinatorial Theory Series A (2004)

In this paper, subquadrangles of order s of generalized quadrangles (GQs) of order (s, s2) are investigated. In the case where Y is a dual flock GQ of order (s, s2), s even, the classification of subquadrangles of order s is completed. In the case where E is an egg good at an element and the corresponding translation generalized quadrangle T(E) of order (s, s2), s even, has base point (∞) it is proved that if T(E) has a subquadrangle of order s not containing (∞), then T(E) is the classical GQ Q(5, s). Also a new strong characterization of the classical GQ Q(5, s), s even or odd, is obtained. In Part II, the case s odd is considered.
Process Oriented Knowledge Management: A Service Oriented Approach
Authors: Robert Woitsch, Dimitris Karagiannis, Peter Hofferer, Bernhard Teuchmann
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper introduces a new viewpoint in knowledge management by introducing KM-Services as a basic concept for Knowledge Management. It discusses the vision of service oriented knowledge management (KM) as a realisation approach of process oriented knowledge management. In the following process oriented knowledge management as it was defined in the EU-project PROMOTE (IST-1999-11658) is presented and the KM-Service approach to realise process oriented knowledge management is explained. The last part is concerned with an implementation concept that uses Web-technology to realise a service framework.
Microprogrammed random access stored program machines
Authors: Carl H. Smith, J. van Leeuwen
Venue: ACM SIGACT News (1974)

We present a typical framework for microprogramming using a well-known theoretical computer-model.
On Whitespace and Stability in Mixed-Size Placement and Physical Synthesis
Authors: Saurabh N. Adya, Igor L. Markov, Paul G. Villarrubia
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

In the context of physical synthesis, large-scale standard-cell placementalgorithms must facilitate incremental changes to layout, bothlocal and global. In particular, flexible gate sizing, net buffering anddetail placement require a certain amount of unused space in everyregion of the die. The need for "local" whitespace is further emphasizedby temperature and power-density limits. Another requirement,the stability of placement results from run to run, is importantto the convergence of physical synthesis loops. Indeed, logic resynthesistargetting local congestion in a given placement or particularcritical paths may be irrelevant for another placement produced bythe same or a different layout tool.In this work we offer solutions to the above problems. We showhow to tie the results of a placer to a previously existing placement,and yet leave room for optimization. In our experiments this techniqueproduces placements with similar congestion maps. We alsoshow how to trade-off wirelength for routability by manipulatingwhitespace. Empirically, our techniques improve circuit delay ofsparse layouts in conjunction with physical synthesis.In the context of earlier proposed techniques for mixed-size placement, we tune a state-of-the-art recursive bisection placer to betterhandle regular netlists that offer a convenient way to representmemories, datapaths and random-logic IP blocks. These modificationsand better whitespace distribution improve results on recentmixed-size placement benchmarks.
On Infinite Cycles I
Authors: Reinhard Diestel, Daniela K&#x00fc;hn
Venue: Combinatorica (2004)

We adapt the cycle space of a finite graph to locally finite infinite graphs, using as infinite cycles the homeomorphic images of the unit circle S1 in the graph compactified by its ends. We prove that this cycle space consists of precisely the sets of edges that meet every finite cut evenly, and that the spanning trees whose fundamental cycles generate this cycle space are precisely the end-faithful spanning trees. We also generalize Euler&#x2019;s theorem by showing that a locally finite connected graph with ends contains a closed topological curve traversing every edge exactly once if and only if its entire edge set lies in this cycle space.
Nonsmooth training of fuzzy neural networks
Authors: C. Eitzinger
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2004)

The integration of fuzzy methods and neural networks often leads to nonsmoothness of the neural network and, consequently, to a nonsmooth training problem. It is shown, that smooth training methods as e.g. backpropagation fail to converge in this case. Thus a method &#x2013; based on so called bundle-methods &#x2013; for training of nonsmooth neural network is presented. Numerical results obtained from a character recognition problem show, that this method still converges where backpropagation fails.
Array control for high-performance SIMD systems
Authors: Martin C. Herbordt, Jade Cravy, Honghai Zhang
Venue: Journal of Parallel and Distributed Computing (2004)

Although arrays of SIMD processing elements can be built with very high operating frequencies, problems exist in keeping the array busy. The inherent mismatch between host and array makes it difficult to maintain high array utilization: either the rate of instruction issue is very low or PE data locality is compromised, having the same effect. Our solution is based on an array control unit (ACU) design that expands macroinstructions in two stages, first by data tile and then into microinstructions. The expansion itself solves the issue problem; decoupling the expansion modalities maintains data locality. Several issues involving host/ACU interaction need to be resolved to effect this solution. We present experimental results showing that our approach delivers substantial improvement in memory hierarchy performance: a cache of only one-fourth the size is sufficient to achieve the same performance as previous approaches. We also describe our implementations which demonstrate that achieving gigaherz operating frequencies with current technologies is plausible.
On identification in the triangular grid
Authors: Iiro Honkala, Tero Laihonen
Venue: Journal of Combinatorial Theory Series B (2004)

A subset C of vertices in a connected graph G = (V, E) is called (r, ≤ l)-identifying if for all subsets L ⊆ V of size at most l, the sets I(L), consisting of all the codewords which are within graphic distance r from at least one element in L. are different. It is proved that the minimum possible density of a (1, ≤2)-identifying code in the triangular grid is 9/16.