ppxscal/embedding_network huggingface dataset:
Complex Reliability Evaluation of Voters for Fault Tolerant Designs
Authors: Dan Pitica, Cristian Posteuca
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Hardware Voters are bit voters computing a majority of n input bits. An m-out-of-n hardware bit voter is a circuit with n bit inputs, and 1 bit - output y, such that y=1 if at least m-out-of-n inputs bits have the value 1. A hardware voter can be constructed as two level AND-OR (equivalently OR-AND and other structures) using CMOS VLSI technology. The goal of the paper is to present Reliability Estimations, Failure Modes and Effects, Criticality Analysis (FMECA) of voting networks at the transistor level, in CMOS VLSI implementation. FMECA is performed using the functional tree of the system, representing the data flow from the lowest level functional block up to the higher level functional blocks. The main idea of this research is to identify the best designs of voting circuits in terms of reliability parameters and to identify their critical failures and effects.
Lexical acquisition: the Swedish VEX System
Authors: Bjorn Gamback
Venue:  (2001)

The paper describes S-VEX, the lexical acquisition component of the Swedish Core Language Engine (S-CLE). A shorter version of this paper appears in L.Ahrenberg (ed.): Papers from the Third Nordic Conference on Text Comprehension in Man and Machine , Link Sweden, 1992. The S-CLE is a general purpose natural language processing system for Swedish developed from its English counter-part, the SRI Core Language Engine. In parallel with the development of the S-CLE, a Swedish version of the English VEX (Vocabulary EXpander) system was designed. S-VEX allows for the creation of lexicon entries by users with knowledge of an application domain but not of linguistics or of the detailed workings of the system. The approach taken is based on eliciting grammaticality judgments and information of inflected forms interactively from the user. The S-VEX system and the lexicon of the S-CLE is described, as well as the problems of the specific lexical acquisition task and their solutions.
Routing of Railway Carriages
Authors: Peter Brucker, Johann Hurink, Thomas Rolfes
Venue: Journal of Global Optimization (2003)

In the context of organizing timetables for railway companies the following railway carriage routing problem occurs. Given a timetable containing rail links with departure and destination times/stations and the composition of the trains, find a routing of railway carriages such that the required carriages are always available when a train departs. The problem is formulated as an integer multi-commodity network flow problem with nonlinear objective function. We will present a local search approach for this NP-hard problem. The approach uses structural properties of the integer multi-commodity network flow formulation of the problem. Computational results for a real world instance are given.
A Fast Algorithm for Complete Subcube Recognition
Authors: Hal Burch, Fikret Ercal
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

The complete subcube recognition problem is defined as, given a collection of available processors on an n-dimensional hypercube, locate a subcube of dimension k that consists entirely of available processors, if one exists. Despite many algorithms proposed so far on this subject, improving the time complexity of this problem remains a challenge. Efficiency limits that can be reached have not been exhausted yet. This paper proposes a novel algorithm to recognize all the overlapping subcubes available on an n-dimensional hypercube whose processors are partially allocated. Given P=2^n, as the total number of processors in the hypercube, the new algorithm runs in O(3^n), or O(P^(log 3) log P) time which is an improvement over previously proposed strategies, such as multiple-graycode, missing combination, maximal set of subcubes, and tree collapsing.
Trustworthy components-compositionality and prediction
Authors: H. Schmidt
Venue: Journal of Systems and Software (2003)

This article defines key requirements for an architecture-based approach to trustworthy components. We then provide a brief overview of our architecture definition language RADL with a focus on compositionality and extra-functional properties.RADL aims at very high-level specification and validation of hierarchical assemblies of distributed real-time components. Several ideas in RADL are oriented towards modern middleware technologies such as .NET and EJB and to software-engineering methods such as UML. RADL dynamic models are centered around contracts, state machines and Petri nets. These are associated to contact points and connectors for defining connection constraints in architectural specification. They define configuration and behavioral contracts when they are associated to components and architectural assemblies of components.RADL contracts permit static compatibility checks and automatic gate adaptation for true black-box reuse. Dynamic monitoring of deployed components complements this with execution-based mechanism enabling prediction of extra-functional properties during architectural design.
An Offline Algorithm for Dimension-Bound Analysis
Authors: Paul A. S. Ward
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrary distributed computation the dimension can be as large as the width, which in turn can be as large as the number of processes in the computation. Most vector clock algorithms, and all online ones, simply use a vector of size equal to the number of processes. In practice the dimension may be much smaller. It is the purpose of this paper to provide empirical evidence that the dimension of various distributed computations is often substantially smaller than the number of processes. We have found that typical distributed computations, with as many as 300 processes, have dimension less than 10. To achieve this quantification we developed various theorems and algorithms which we also describe.
Linear Algebra in Very High-Dimension Vector Spaces: Algorithms and Data Structures for Implementing Exact and Approximate Solution Methods
Authors: Kee Kim, Thomas Dean, Samuel E. Hazlehurst
Venue:  (2000)

In this paper, we show how certain problems can be recast in terms of equations involving matrices and vectors that are represented implicitly. These matrices and vectors have large explicit representations in the sense that it is practically impossible to even enumerate their indices. Instead, the indices are expressed using a set of index variables that describe the distinguishing features of the problem domain. The matrices and vectors are represented in factored form using compact, easily computed functions of the index variables. The entries of these matrices and vectors are reconstituted on an as-needed basis, often in such a way that computations can be performed on large sets of indices with no more effort than that required for a single index and its corresponding entry. We show how elementary vector and matrix operations can be performed on these implicitly represented matrices and vectors (e.g., scalar and dot products, raising a matrix to a power) and how these basic operations can then be combined to perform more complex calculations (e.g., solving a system of equations). Our motivating examples involve solving Markov decision processes and planning under uncertainty, but the methods described in this paper apply to a wide range of problems.
Cochlear Hydrodynamics Demystified
Authors: Richard F. Lyon, Carver A. Mead
Venue:  (1988)

Wave propagation in the mammalian cochlea (inner ear) is modeled as a unidirectional cascade of simple filters. The transfer functions of the low-order filter stages are completely determined by the wave-number vs. frequency solutions to the dispersion relations that describe the cochlea, which are in turn derived from twodimensional approximations to the fluid mechanics. Active undamping effects of the outer hair cells are easily included in the analysis and modeling, so that the results can be directly applied in the design of active adaptive cochlear models.
Practical Design of Safety-Critical Computer Systems
Authors: William R. Dunn
Venue:  (2002)

:There are many other technical books (and many more technical articles and papers) that address the subject of safety-critical systems. Most, however, are confined to a single speciality area. For example, books have been published on software, on computer hardware, on instrumentation and control, on reliability, on system safety but non - until now - that cohesively tie all these topics together under one cover. This system-oriented book, which is based on the author's years of engineering experience, is the first to show a reader in practical terms how all the components of safety-critical system work and how they are systematically integrated to realize a working system that will be reliable and safe. It is a book that can be read and understood by computer hardware engineers, software developers, programmers, instrumentation and control engineers, reliability engineers, and all others including technical managers - who are involved in the development and use of these modern day systems.
Scaling-Induced Reductions in CMOS Reliability Margins and the Escalating Need for Increased Design-In Reliability Efforts
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Scaling, for enhanced performance and cost reduction reasons, has pushed existing CMOS materials much closer to their intrinsic reliability limits. Future robust designs will require a strong team effort whereby the design engineer must clearly understand the process variability and its impact on reliability. This strong team effort, between design and process, will become critically important as the industry is seeking to replace the very materials that has made the industry so successful: Si substrates, SiO2 gate-dielectric, Al-based metallization and SiO2 interconnect-dielectrics.
Finite Model Theory in the Simply Typed Lambda Calculus
Authors: Gerd G. Hillebrand
Venue:  (1994)

Church''s simply typed lambda-calculus is a very basic framework for functional programming language research. However, it is common to augment this framework with additional programming constructs, because its expressive power for functions over the domain of Church numerals is very limited. In this thesis: (1)~We re-examine the expressive power of the ``pure'''' simply typed lambda-calculus, but over encodings of finite relational structures, i.~e., {\em finite models} or {\em databases}. In this novel framework the simply typed lambda-calculus expresses all elementary functions from finite models to finite models. In addition, many common database query languages, e.~g., relational algebra, Datalog with negation, and the Abiteboul/Beeri complex object algebra, can be embedded into it. The embeddings are feasible in the sense that the lambda-terms corresponding to PTIME queries can be evaluated in polynomial time. (2)~We examine fixed-order fragments of the simply typed lambda-calculus to determine machine independent characterizations of complexity classes. For this we augment the calculus with atomic constants and equality among atomic constants. We show that over ordered structures, the order~3, 4, 5, and~6 fragments express exactly the first-order, PTIME, PSPACE, and EXPTIME queries, respectively, and we conjecture that for general $k\ge1$, order~$2k+4$ expresses exactly the $k$-EXPTIME queries and order~$2k+5$ expresses exactly the $k$-EXPSPACE queries. (3)~We also re-examine other functional characterizations of PTIME and we show that {\em method schemas with ordered objects} express exactly PTIME. This is a first-order framework proposed for object-oriented databases---as opposed to the above higher-order frameworks. In summary, this research provides a link between finite model theory (and thus computational complexity), database theory, and programming language theory. It sheds new light on the expressive power of the simply typed lambda-calculus. It transforms classical complexity questions into questions of expressibility. Finally, it provides new examples of pure functional database query languages.
The Occurrence of Continuation Parameters in CPS Terms
Authors: Olivier Danvy, Frank Pfenning
Venue:  (1995)

We prove an occurrence property about formal parameters of continuations in Continuation-Passing Style (CPS) terms that have been automatically produced by CPS transformation of pure, call-by-value lambda-terms. Essentially, parameters of continuations obey a stack-like discipline. This property was introduced, but not formally proven, in an earlier work on the Direct-Style transformation (the inverse of the CPS transformation). The proof has been implemented in Elf, a constraint logic programming language based on the logical framework LF. In fact, it was the implementation that inspired the proof. Thus this note also presents a case study of machine-assisted proof discovery.
A gap property of deterministic tree languages
Authors: Damian Niwiński, Igor Walukiewicz
Venue: Theoretical Computer Science (2003)

We show that a tree language recognized by a deterministic parity automaton is either hard for the co-Büchi level and therefore cannot be recognized by a weak alternating automaton, or is on a very low level in the hierarchy of weak alternating automata. A topological counterpart of this property is that a deterministic tree language is either Π11 complete (and hence nonBorel), or it is on the level Π30 of the Borel hierarchy. We also give a new simple proof of the strictness of the hierarchy of weak alternating automata.
How to Set up and Manage a Corporate Learning Centre, 2 edition
Authors: Samuel A. Malone
Venue:  (2003)

:Few corporate initiatives of the last ten years have been more influential, in the development of a learning culture at work, than the corporate learning centre. The first edition of Sam Malone's book, published in January 1997, quickly established itself as the definitive concise guide to best practice. The second edition reflects the lessons learned since that time, along with the developments in learning technology. Setting up and sustaining a successful centre involves strategic skills such as planning and championing; technical skills, including budgeting, marketing and evaluation; and the people skills of communicating, influencing and managing change. There are chapters in the book for all the stakeholders involved, including the learners themselves. How to Set Up and Manage a Corporate Learning Centre offers definitive advice on all of these areas. Sam Malone demystifies what is a difficult, expensive and long term project for any organization. Contents: Introduction and definitions Why establish a corporate learning centre? Making the most of a corporate learning centre Establishing costs and measuring benefits How to resolve resistance to change Launching a corporate learning centre The media used in a corporate learning centre Management and administration Marketing the corporate learning centre The learner's guide to a corporate learning centre Conclusions and recommendations. About the Author:: Samuel A. Malone is a training consultant, learning expert, lecturer and author of four previous books, including 'Learning Skills for Managers' (Oak Tree Press, 2000). He is a part-time lecturer with the Dublin Institute of Technology, and runs a variety of training programmes and workshops on management, supervisory development and lifelong learning. 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
Importance of evolved structure for emerging self-organization in a complex competitive situation
Authors: Satoshi Kurihara, Kensuke Fukuda, Toshio Hirotsu, Osamu Akashi, Shinya Sato, Toshiharu Sugawara
Venue: Proceedings of the eighth international conference on Artificial life (2002)

In this paper, we analyze a simple adaptive model of competition called the "Minority Game" that is used in analyzing the competition phenomena in markets. The Minority Game consists of many simple autonomous agents, and self-organization occurs as a result of simple behavioral rules. Up to now, the dynamics of this game has been studied from various angles, but so far the focus has been on the macroscopic behavior of all the agents as a whole. We are interested in the mechanisms involved in collaborative behavior among multi-agents, so we focused our attention on the behavior of individual agents. In this paper, we suggest that core elements responsible for self-organization to occur are: 1. rules of the game that potentially include a mechanism for a form of self-organization, 2. rules that place a good constraint on each agent's behavior, and 3. the existence of some rule that lead to indirect interaction; a process called "stigmergy".
Combining Advanced Process Technology and Design for Systems Level Integration
Authors: Ana Hunter, Ck Lau, John Martin
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Recent advances in process and integration are enabling systems level integration for numerous applications. The quality of the systems depends directly on the quality of the processes and effectiveness of the process integration, and on the quality of the designs and libraries employed, as well as on the completeness and accuracy of the models used to link the process and designs. Unit process and process module quality is ensured through the use of designed experimentation, margin analysis, and statistical capability measurement.The link between the processes and the libraries and designs is formed through such models as SPICE and interconnect, with quality implications associated with the extraction and implementation. GDSII algorithms to incorporate process specific post layout features such as OPC and fill patterns for CMP planarization are integrated into the CAD flow prior to final verification, reticle manufacturing and silicon prototyping. Foundry specific challenges in providing process and library elements include multiple design flows, tool providers and library suppliers. Examples of approaches to quality designs, processes and systems are presented using advanced cores and systems level integration.
A nonpreemptive priority delay model with modified-vacation intervals for homogeneous FDDI networks
Authors: P. N. Werahera, A. P. Jayasumana, D. C. Boes
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

A closed-form analytical expression is derived for the individual priority classes of FDDI based on a nonpreemptive priority delay model. To faithfully model the FDDI network using the nonpreemptive priority delay model, we use a concept of modified-vacations. The expressions for the mean waiting time of individual priority classes are functions of first and second moments of the modified-vacation intervals of that class. It can be shown that the expression derived for the first and second moments of the modified-vacation intervals of the respective classes are functions of mean and variance of the number of messages transmitted by each priority class per token rotation. These variables are evaluated using an iterative procedure that utilizes the prior knowledge of the throughput characteristics of the FDDI network. Simulation results show that the nonpreemptive priority delay model provides accurate estimates for the mean waiting time of individual priority classes of a homogeneous FDDI network.
Automatic Discovery of Logical Document Structure
Authors: Kristen Summers
Venue:  (1998)

The availability of large, heterogeneous repositories of electronic documents is increasing rapidly, and the need for flexible, sophisticated document manipulation tools is growing correspondingly. These tools can benefit greatly by exploiting logical structure, a hierarchy of visually observable organizational components of a document, such as paragraphs, lists, sections, em etc. Knowledge of this structure can enable a multiplicity of applications, including hierarchical browsing, structural hyperlinking, logical component-based retrieval, and style translation. Most work on the problem of deriving logical structure from document layout either relies on knowledge of the particular document style or finds a single flat set of text blocks. This thesis describes an implemented approach to discovering a full logical hierarchy in generic text documents, based primarily on layout information. Since the styles of the documents are not known a priori, the precise layout effects of the logical structure are unknown. Nonetheless,typographical capabilities and conventions provide cues that can be used to deduce a logical structure for a generic document. In particular, the key idea is that analyses of the text contours at appropriate levels of granularity offer a rich source of information about document structure. The problem of logical structure discovery is divided into problems of segmentation, which separates the text into logical pieces, and classification, which labels the pieces with structure types. The segmentation algorithm relies entirely on layout-based cues, and the classification algorithm uses word-based information only when this is demonstrably unavoidable. Thus, this approach is particularly appropriate for scanned-in documents, since it is more robust with respect to OCR errors than a content-oriented approach would be. It is applicable, however, to the problem of analyzing any electronic document whose original formatting style rules remain unknown; thus, it can provide the basis for flexible document manipulation tools in heterogeneous collections.
Integrated Segmentation and Recognition of Handwritten Numerals: Comparison of Classification Algorithms
Authors: Cheng-Lin Liu, Hiroshi Sako, Hiromichi Fujisawa
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In integrated segmentation and recognition (ISR) of handwritten character strings, the underlying classifier is desired to be accurate in character classification and resistant to non-character patterns (also called garbage or outliers). This paper compares the performance of a number of statistical and neural classifiers in ISR. Each classifier has some variations depending on learning method: maximum likelihood estimation (MLE), discriminative learning (DL) under the minimum square error (MSE) or minimum classification error (MCE) criterion, or enhanced DL (EDL) with outlier samples. A heuristic presegmentation method is proposed to generate candidate cuts and character patterns.The methods were tested on the 5-digit Zip code images in CEDAR CDROM-1. The results show that training with outliers is crucial for neural classifiers in ISR. The best result was given by the learning quadratic discriminant function (LQDF) classifier.