ppxscal/embedding_network huggingface dataset:
Productivity Optimization Techniques for the Proactive Semiconductor Manufacturer
Authors: Daniel N. Maynard
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The experienced semiconductor manufacturer is often confronted by apparently similar products that yield drastically different productivities. The same processes are used to fabricate these chips, yet the manufacturer's costs are clearly different. The customers expect similar pricing and a deviation must be accompanied by a credible explanation. Design for manufacturability (DFM) has become a popular industry term, yet many chip designers are uncertain where to start and what to implement. The semiconductor manufacturer possesses knowledge or suspicions of potential barriers and improvement opportunities. This information must be proactively fed forward to the design shops, which must also budget resources and time to address these items. This presentation will describe how this process works, illustrated with examples from IBM Microelectronics' Vermont facility. Before focusing on productivity optimization, a recommended set of metrics is identified, and the concept of physical design characterization is overviewed. Past and existing designs provide excellent historical insight into a large number of issues that are often independent of technology node. While robust technology development objectives strive to minimize the potential manufacturing stumbling blocks, competitive pressures will balance these with other constraints. Ultimately, it is decisions made by a designer that will determine the level of productivity achievable. Much of this presentation is devoted to describing a number of these decisions. In addition, the manufacturer may deploy complex algorithms to adjust the design to process constraints. Another, but more costly solution is for the manufacturer to tailor the process to a specific product, compensating for identified product-technology gaps. Lastly, this presentation will tie these concepts together into a recommended business process.
Efficient algebraic solution of reaction-diffusion systems for the cardiac excitation process
Authors: Micol Pennacchio, Valeria Simoncini
Venue:  (2000)

In this paper we deal with the problem of solving the large algebraic linear system arising in the numerical solution of a reaction-diffusion (R-D) system associated with myocardial excitation process modeling. We show that an ad-hoc preconditioning technique can be devised so as to efficiently and simultaneously handle the differential equations of the R--D system, with no additional memory requirements. Two different formulations are commonly considered for the theoretical and numerical analyses, respectively. We observe that the formulation employed for the theoretical analysis of the problem actually yields the best numerical performance, when compared with the usual numerical scheme.
Schema evolution in object databases by catalogs
Authors: A. Pons, R. K. Keller
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

We are concerned with schema evolution in object oriented databases (OODB) that is processed by a modification of the classes of the schema. We present a new categorization of the different modifications in three categories: primitive, composite and complex modifications. On this basis, we propose a method by decomposition for addressing conceptual schema evolution: "real-life" complex schema modifications are solved by decomposition into simpler well known and controlled modifications, called composites, which in turn may be reduced to so-called primitives. A key step in making this approach practical, is the provision of two catalogs: one for the primitives based on a sound object model and one for the composites built on top of the primitive catalog. Such catalogs raise the level of abstraction, further reuse and are prerequisites for effective tool support. We define the three types of schema modifications, describe these catalogs, put them into the context of our decomposition approach and provide a process for schema evolution.
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
Authors: Martin Sauerhoff
Venue: Journal of Computer and System Sciences (2003)

It is well known that a nondeterministic Turing machine can be simulated in polynomial time by a so-called guess-and-verify machine. It is an open question whether an analogous simulation exists in the context of space-bounded computation. In this paper, a negative answer to this question is given for ordered binary decision diagrams (OBDDs) and one-way Turing machines. If it is required that all nondeterministic guesses occur at the beginning of the computation, this can blow up the space complexity exponentially in the input length for these models. This is a consequence of the following main result of the paper. There is a sequence of boolean functions fn : {0, 1}n → {0, 1} such that fn has nondeterministic OBDDs of polynomial size that use at most (1/3). (n/3)1/3 log n.(1 + o(1)) nondeterministic guesses for each computation, but fn already requires exponential size if only at most (1 - ε). (1/3).(n/3)1/3 log n nondeterministic guesses may be used, where ε>0 is an arbitrarily small constant.
Space and Time Efficient Parallel Algorithms and Software for EST Clustering
Authors: Anantharaman Kalyanaraman, Srinivas Aluru, Suresh Kothari
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Expressed sequence tags, abbreviated ESTs, are DNA molecules experimentally derived from expressed portions of genes. Clustering of ESTs is essential for gene recognition and understanding important genetic variations such as those resulting in diseases. In this paper, we present the design and development of a parallel software system for EST clustering. To our knowledge, this is the first such effort to address the problem of EST clustering in parallel. The novel features of our approach include 1) design of space efficient algorithms to keep the space requirement linear in the size of the input data set, 2) a combination of algorithmictechniques to reduce the total work without sacrificing the quality of EST clustering, and 3) use of parallel processing to reduce the run-time and facilitate the clustering of large data sets. Using a combination of these techniques, we report the clustering of 81,414 Arabidopsis ESTs in under 2.5 minutes on a 64-processor IBM SP, a problem that is estimated to take 9 hours of run-time with a state-of-the-art software, provided the memory required to run the softwarecan be made available.
Wearable Visual Robots
Authors: W. W. Mayol, B. Tordoff, D. W. Murray
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

This paper presents a wearable active visual sensor which is able to achieve a level of decoupling of camera movement from the wearer's posture and motions. This decoupling is achieved by a combination of active sensing, inertial information and visual sensor feedback. The issues of sensor placement, robot kinematics and their relation to wearability are discussed. The performance of the prototype robot is evaluated for some essential visual tasks. The paper also discusses potential application scenarios for this kind of wearable robot.
Fault tolerant subcube allocation in hypercube
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Dimensional communicable 2 subcubes allocation problems in faulty hypercubes are studied in this paper. An n-cube is investigated on whether the faulty n-cube possesses 2 m-dimensional disjoint fault-free subcubes or not. Larger values of m is more efficient in practical uses, so the case of m=n-2 is first examined. By giving a property of "the number of faults on an n-cube in which there always exist at least two fault-free (n-2)-subcubes is not over n-1", we obtained a property of "The number of faults located on n-cube in which there always exist at least two fault-free (n-i-2)-subcubes is not over 2/sup i/(n-i+1)-2". Next, the number of disjoint paths between the two subcubes is investigated. This number suggests the maximum number of faults by which the communication between these subcubes is never cut off. Then, whether the communication between two fault-free subcubes is always available or not when these two fault-free subcubes exist was discussed. This discussion gives a solution to establish a system where a regular hypercube algorithm executing in an (m+1)-subcube still be executed by two fault-free disjoint communicable m-subcubes without any degradation even if the (m+1)-subcube becomes faulty.
The Complexity of Parallel Computations
Authors: James C. Wyllie
Venue:  (1979)

Recent advances in microelectronics have brought closer to feasibility the construction of computers containing thousands (or more) of processing elements. This thesis addresses the question of effective utilization of such processing power. We study the computational complexity of synchronous paarallel computations using a model of computation based on random access machines operating in parallel and sharing a common memory, the P-RAM. Two main areas within the field of parallel computational complexity are investigated. First, we explore the power of the P-RAM model viewed as an abstract computing device. Later, we study techniques for developing efficient algorithms for parallel computers. We are able to give concise characterizations of the power of deterministic and nondeterministic P-RAMS in terms of the more widely known space and time complexity classes for multi-tape Turing machines. Roughly speaking, time-bounded deterministic P-RAMS are equivalent in power to (can accept the same sets as) space-bounded Turing machines, where the time and space bounds differ by at most a polynomial. In the context of comparing models of computation, we consider such polynomial differences in resources to be insignificant. Adding the feature of nondeterminism to the time-bounded P-RAM changes its power to that of a nondeterministic Turing machine with an exponentially higher running time. The later sections of the thesis examine algorithm design techniques for parallel computers. We first develop efficient procedures for some common operations on linked lists and arrays. Given this background, we introduce three techniques that permit the design of parallel algorithms that are efficient in terms of both their time and processor requirements. We illustrate the use of these techniques by presenting time and processor efficient algorithms for three problems, in each case improving upon the best previously known parallel resource bounds. We show how to compute minimum string edit distances, using the technique of pairwise function composition. We describe an algorithm for the off-line MIN that organizes its computation in the form of a complete binary tree. Finally, we present an algorithm for undirected graph connectivity that relies on redundancy in its representation of the input graph.
Design of a Set-Top Box System on a Chip
Authors: Eric Foster
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

This presentation will review system-level issues associated with integrating the major blocks of a Set-Top Box onto a single die. In addition to the challenges of merging several powerful functions into a single chip, the goal of integration is to yield a composite design that is not only more cost effective but also provides more function than the sum of discrete parts. This is accomplished through consolidated and shared memory, improved system bandwidth and efficiency, and additional inter-macro signals to facilitate improved communication.
Performance of Muse on Switch-Based Multiprocesor Machines
Authors: Mohammed A Khayri, Roland Karlsson, Shyam Mudambi
Venue:  (1992)

The Muse (multiple sequential Prolog engines) approach has been used to make a simple and efficient OR-parallel implementation of the full Prolog language. The performance results of the Muse system on bus-based multiprocessor machines have been presented in previous chapters, papers. This chapter paper discusses the implementation and performance results of the Muse system on switch-based multiprocessors (the BBN Butterfly GP1000 and TC2000). The results of Muse execution show that high real speedups can be achieved for Prolog programs that exhibit coarse-grained parallelism. The scheduling overhead is equivalent to around 8 -- 26 Prolog procedure calls per task on the TC2000. The chapter paper also compares the Muse results with corresponding results for the Aurora OR-parallel Prolog system. For a large set of benchmarks, the results are in favor of the Muse system.
A MULTI-LEVEL SOLUTION ALGORITHM FOR STEADY-STATE MARKOV CHAINS
Authors: Graham Horton, Scott T. Leutenegger
Venue:  (1993)

A new iterative algorithm, the multi-level algorithm, for the numerical solution of steady state Markov chains is presented. The method utilizes a set of recursively coarsened representations of the original system to achieve accelerated convergence. It is motivated by multigrid methods, which are widely used for fast solution of partial differential equations. Initial results of numerical experiments are reported, showing significant reductions in computation time, often an order of magnitude or more, relative to the Gauss-Seidel and optimal SOR algorithms for a variety of test problems. The paper also contrasts and compares the multi-level method with the iterative aggregation-disaggregation algorithm of Takahashi.
On the Complexity of Some Verification Problems in Process Control Specifications
Authors: A. H.M. ter Hofstede, M. E. Orlowska
Venue:  (1997)

Many techniques in many diverse areas in computer science, such as process modelling, process programming, decision support systems, workflow systems, use concepts for the specification of process control. These typically include concepts for the specification of sequential execution, parallelism, synchronisation, and moments of choice. This paper identifies some typical verification problems in process control specifications, such as reachability, termination, freedom of deadlock and livelock, and determines their computational complexity. These results then provide computational lower bounds for any technique using these, but possibly more, concepts for process control.
Real-time streaming of environmental field data
Authors: Enrique R. Vivoni, Richard Camilli
Venue: Computers Geosciences (2003)

Field measurements in the environmental sciences still depend upon the pencil and paper notebook for data collection. Although robust, this method is labor-intensive and susceptible to recording and georeferencing errors during transcription. Recent advances in mobile computing and wireless communications allow the geoscientist to process and transmit data while still in the field, thereby minimizing human errors and time delays. We describe an integrated system developed for environmental and geolocation data acquisition that is intended to streamline the collection process. The system consists of software applications and hardware components that enable wireless, mobile and Internet computing during field campaigns. In particular, two-way transfer and display of collected data is achieved between the field site and a remote location, a concept referred to as field data streaming. A prototype system has been tested in field trials in Cambridge, Massachusetts, USA and Newcastle, New South Wales, Australia. Field studies demonstrate the noticeable gains in efficiency and precision achieved with the use of the field streaming technology. Potential applications include biogeochemical and hydrologic studies, water quality monitoring, emergency response to water-borne disasters and intensive field sampling campaigns.
An Object-Oriented Learning/Design Support Environment
Authors: Jill P. David, Julie C. Jumes, Fillia Makedon
Venue:  (1991)

We present an object-oriented experimental learning and design support environment, call AVT, for an Algorithm Visualization Tool, implemented in Digitalk''s Smalltalk/V1 on a Macintosh II2, AVT provides a domain- independent visualization tool, an exploratory learning environment, and an experimental heuristic design environment. Algorithm visualization is the exploration of ways to visualize intuitively the computational behavior of an algorithm using multiple views, some of which are visual in the graphical sense [2,4]. AVT employs other views (combining text and graphics) to explain the problem, the strategy, the heuristics, and the reasoning process behind the solutions. User interaction in AVT includes not only passive viewingof the animated algorithmic process but also active participation in the design of the steps of the algorithm. Object-Oriented Programming(OOP)offers an attractive paradigm for rapidly implementing heuristics as well as more coherent and understandable code [1,12]. Inheritance properties of OOP languages capture natural mechanisms such as specialization, abstraction, and evolution allowing us to model our environment in a more natural manner[11].
Quality Requirements for Software Acquisition
Authors: P. Robert
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

Presents an approach to define quality requirements in the context of software acquisition. Although it uses the concepts laid down by ISO/IEC 9126, this approach extends the current usage of this standard by proposing a way to derive software development process requirements, project monitoring requirements and product acceptance requirements. These requirements are traceable to quality objectives expressed in terms of quality characteristics and may include targets for measurements. The interest of the proposed approach is to provide a justification to many process requirements frequently used in acquirer/supplier relationships. One example of the definition of quality requirements for an industry project is presented.
An analytical method for decomposing the external environment representation task for a robot with restricted sensory information
Authors: Félix de la Paz, José R. Álvarez, José Mira
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

The problem of modelling and reducing knowledge needed to build an internal representation of the environment is still a milestone in robotics. This representation task is crucial for both understanding perception in humans and programming advanced robots with reasonable navigation skills.In this chapter, we propose an analytical method for decomposing this representation task in terms of a set of primitive inferences. All these inferences race analytical transformations of the sensory data that expand the input space, use rules to compute the centre of areas and polygons of open space and, finally, build a topological graph with possibilities of being updated by learning and used for navigation.The methodological approach followed in this chapter is to search for a library of reusable modelling components that could be used to solve other similar problems of topological representation.
Economic Policy Issues of the New Economy
Authors: Robert Kratz, Horst Siebert
Venue:  (2002)

:The book presents a thorough analysis of the effects of new technologies and products on overall productivity and on goods markets, labor markets, and financial markets. It also deals with the implications of the new economy for the welfare state and discusses the issues wether there is a need for new regulatory devices, in particular in the field of international trade in goods and services.
Predicting Chaotic Time Series by Ensemble Self-Generating Neural Networks
Authors: Hirotaka Inoue, Hiroyuki Narihisa
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

In this paper, we introduce ensemble self-generating neural networks (ESGNNs) for chaotic time series prediction. ESGNNs are combined the ensemble averaging method with SGNNs. ESGNNs create self-generating neural trees (SGNTs) to shuffle the order of given training data independently, and the network output is averaged of all SGNTs output. We investigate improving capability of ESGNNs for three chaotic time series and compare with the backpropagation neural networks (BPNNs). Experimental results show that using various SGNTs through ensemble averaging method significantly improves the predictive performance of ESGNNs on diverse chaotic time series.
Designing for Increased Software Maintainability
Authors: Jun Han
Venue: Proceedings of the International Conference on Software Maintenance (1997)

The recording and management of design rationales and design decisions are important issues in achieving better support for software maintenance. In the context of existing work on design rationale models, this paper introduces an approach to the integration of system design, design decisions and design rationales and the formalization of design decisions in terms of software artifacts and their relationships. The relationships and properties characterizing design decisions capture precisely the intent of these decisions, and can be checked and enforced to ensure that the decisions are followed and maintained in the actual development. We also show how the formalized design decisions can be used in better supporting software comprehension and maintenance.
Timing Yield Estimation from Static Timing Analysis
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper presents a means for estimating parametric timing yield and guiding robust design-for-quality in the presence of manufacturing and operating environment variations. Dual emphasis is on computational efficiency and providing meaningful robust-design guidance. Computational efficiency is achieved by basing the proposed methodology on a post-processing step applied to the report generated as a by-product of static timing analysis. Efficiency is also ensured by exploiting the fact that for small processing/environment variations, a linear model is adequate for capturing the resulting delay change. Meaningful design guidance is achieved by analyzing the timing-related influence of variations on a path-by-path basis, allowing designers perform a quality-oriented design pass focused on key paths. A coherent strategy is provided to handle both die-to-die and within-die variations. Examples from a PowerPC microprocessor illustrate the methodology and its capabilities.
Finding Parts in Very Large Corpora
Authors: Matthew Berland, Eugene Charniak
Venue:  (1999)

We present a method for extracting parts of objects from wholes (e.g. ``speedometer'''' from ``car''''). Given a very large corpus our method finds part words with 55\ ranked by the system. The part list could be scanned by an end-user and added to an existing ontology (such as WordNet), or used as a part of a rough semantic lexicon.