ppxscal/embedding_network huggingface dataset:
Eulerian-Lagrangian Localized Adjoint Methods for a Nonlinear Advection-Diffusion Equation
Authors: Helge K. Dahle, Richard E. Ewing, Thomas F. Russell
Venue:  (1994)

Eulerian-Lagrangian localized adjoint methods (ELLAM) are developed for the non-linear Buckley-Leverett equation, which is characterized by degenerate diffusion and sharpening near-shock solutions. The ELLAM methodology employs space-time finite elements with edges oriented along flow paths, and space-time test functions that satisfy a local adjoint condition. This combination extends Eulerian-Lagrangian concepts in a systematic mass-conservative fashion to problems with general boundary conditions. Various kinds of boundary conditions are considered, and a local time-stepping procedure is developed for a no-flow outlet condition that leads to a boundary layer. Numerical experiments illustrate the potential of these methods.
Rare Failure-State in a Markov Chain Model for Software Reliability
Authors: Michael G. Thomason, James A. Whittaker
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Software systems composed of highly reliable components may experience few if any failures while undergoing heavy testing or field-usage. Kaufman et al [14, 15] have applied statistics of the extremes [13] to software reliability analysis for failure as an infrequent, unlikely occurrence- a so-called rare event. This paper combines (i) software failure as a rare event with (ii) a finite-state, discrete-parameter, recurrent Markov chain that models both the failures (as transitions to a rare fail-state) and the software usage probabilities (as transitions among usage-states not involving the fail-state). When conditions for rare events are met, reliability analysis in greater detail with fewer assumptions may be possible and there may be additional justification for using popular Poisson and exponential distributions for certain random variables. We describe how the Markov chain and the "Poisson law of small numbers," which has a central role in the study of rare events and extreme values [4], yield: an explicit error-bound on a Poisson Approximation for counts of failures as rare events in long realizations of the chain, and an approximate exponential distribution for the inter-occurrence time of failure as a rare event.We compute both the Poisson error-bound and ¿ 2 goodness-of- fit tests for samples and the approximate distributions for a small Markov chain. A typical application of these results would be in the analysis of software reliability for systems of high quality COTS components.
Matrix-Valued EXOR-TDDs in Decomposition of Switching Functions
Authors: Radomir S. Stankovic
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

EXOR Ternary Decision Diagrams (EXOR-TDDs) proved useful in several applications in logic design. This paper shows that EXOR-TDDs are also useful in functional decomposition. We prove that checking simple disjoint decomposition of f with respect to a subset of r variables is equivalent to building the EXOR-TDD for a matrix-valued function of (n-r) variables. Transferring the problem of decomposition into the problem of building EXOR-TDDs permits formulation of a simple decomposition procedure. The same method applies to simple disjoint bi-decomposition of switching functions.
Object-Relational Database Management System (ORDBMS) Using Frame Model Approach
Authors: H. K. Wong, Anthony S. Fong
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper describes a methodology and development approach to implement Object Relational Database Management System (ORDBMS) with Frame Model (Fong's 1997). The Frame Model method is a solution to extend Relational Database Management System (RDBMS) to handle complex data such as objects. Objects can be represented in Frame Model schema as classes, constraints and methods. Schema translation is the first step to implement the Object-Relational Database Management System (ORDBMS).This paper investigates a stepwise methodology for schema translation from a Relation Model to a Frame Model. The second step is the implementation of ORDBMS to incorporate RDBMS as kernel, Application Program Interface (API) as interactive SQL and a method command interpreter. Methods are pre-compiled and stored in RDBMS as stored procedures. Methods can be invoked directly through API or a constraint class that is defined in the Frame Model schema when the associated interactive SQL is issued from the API.
Resource Bounded Kolmogorov Complexity, A Link Between Computational Complexity and Information Theory
Authors: Luc Longpre
Venue:  (1986)

The resource bounded Kolmogorov complexity classes identify finite strings (and by extension infinite strings) according to how much we can compress and then recover the strings in a space or time bounded environment. We view the resource bounded Kolmogorov complexity classes as a link between computational complexity and information theory. Firstly, we study these classes with respect to information theory (or unbounded Kolmogorov complexity classes). Most of what we know about information theory can also be shown in a space bounded environment. Whether it also stands in a time bounded environment is an interesting problem and parallels open questions about the power of nondeterminism. Then, we investigate the structure of the classes and show the analogies and differences with the structure of computational complexity classes. For example, we build hierarchies paralleling the time and space hierarchies. We show that the exponential hierarchy collapses if and only if our parallel hierarchy collapses. Lastly, we analyse the statistical properties of random strings. Martin-Lof has shown that all strings with no short description possess all the computable statistical properties of random strings. We show that this result carries over to the space bounded Kolmogorov random strings, which pass all statistical tests using less space than the space bound. Also, allowing a little more space, we can design a test to detect all those strings. These results are further applied to the theory of pseudo-random number generators. Among other consequences, it is shown that there are some properties that no space bounded random number generator can possess. The notion of statistical tests is compared to the notion of a good pseudo-random number generator, as defined by Andrew Yao.
Eleven SSH tricks
Authors: Daniel R. Allen
Venue: Linux Journal (2003)

You know it's the secure way to connect to your server. But OpenSSH is fast and convenient too. 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
Learning One More Thing
Authors: Sabastian Thrun, Tom M. Mitchell
Venue:  (1994)

Most research on machine learning has focused on scenarios in which a learner faces a single, isolated learning task. The lifelong learning framework assumes instead that the learner encounters a multitude of related learning tasks over its lifetime, providing the opportunity for the transfer of knowledge. This paper studies lifelong learning in the context of binary classification. It presents the invariance approach, in which knowledge is transferred via a learned model of the invariances of the domain. Results on learning to recognize objects from color images demonstrate superior generalization capabilities if invariances are learned and used to bias subsequent learning.
Lower Bounds on Precedence-Constrained Scheduling for Parallel Processors
Authors: Ivan D. Baev, Waleed M. Meleis, Alexandre E. Eichenberger
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

We consider two general precedence-constrained scheduling problems that have wide applicability in the areas of parallel processing, high performance compiling, and digital system synthesis. These problems are intractable so it is important to be able to compute tight bounds on their solutions. A tight lower bound on makespan scheduling can be obtained by replacing precedence constraints with release and due dates, giving a problem that can be efficiently solved. We demonstrate that recursively applying this approach yields a bound that is provably tighter than other known bounds, and experimentally shown to achieve the optimal value at least 86:5% of the time over a synthetic benchmark. We compute the best-known lower bound on weighted completion time scheduling by applying the recent discovery of a new algorithm for solving a related scheduling problem. Experiments show that this bound significantly outperforms the linear programming-based bound. We have therefore demonstrated that combinatorial algorithms can be a valuable alternative to linear programming for computing tight bounds on large scheduling problems.
A Genetic Testing Framework for Digital Integrated Circuits
Authors: Xiaoming Yu, Alessandro Fin, Franco Fummi, Elizabeth M. Rudnick
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

In order to reduce the time-to-market and simplify gate-level test generation for digital integrated circuits, GA-based functional test generation techniques are proposed for behavioral and register transfer level designs. The functional tests generated can be used for design verification, and they can also be reused at lower levels (i.e., register transfer and logic gate levels) for testability analysis and development. Experimental results demonstrate the effectiveness of the method in reducing the overall test generation time and increasing the gate-level fault coverage.
The production and recognition of emotions in speech: features and algorithms
Authors: Oudeyer Pierre-Yves
Venue: International Journal of Human-Computer Studies (2003)

This paper presents algorithms that allow a robot to express its emotions by modulating the intonation of its voice. They are very simple and efficiently provide life-like speech thanks to the use of concatenative speech synthesis. We describe a technique which allows to continuously control both the age of a synthetic voice and the quantity of emotions that are expressed. Also, we present the first large-scale data mining experiment about the automatic recognition of basic emotions in informal everyday short utterances. We focus on the speaker-dependent problem. We compare a large set of machine learning algorithms, ranging from neural networks, Support Vector Machines or decision trees, together with 200 features, using a large database of several thousands examples. We show that the difference of performance among learning schemes can be substantial, and that some features which were previously unexplored are of crucial importance. An optimal feature set is derived through the use of a genetic algorithm. Finally, we explain how this study can be applied to real world situations in which very few examples are available. Furthermore, we describe a game to play with a personal robot which facilitates teaching of examples of emotional utterances in a natural and rather unconstrained manner.
A Crosstalk Sensor Implementation for Measuring Interferences in Digital CMOS VLSI Circuits
Authors: J. A. Sainz, R. Muñoz, J. A. Maiz, L. A. Aguado, M. Roca
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

This paper presents an approach for measuring crosstalk interference in digital CMOS VLSI circuits. The crosstalk sensor has been implemented in 0.8um AMS (Austria Mikro Systeme) technology and its design is based on NOR and NAND RS latches. The interference is produced by an up (down) transition in an affecting line. The crosstalk sensor is designed to measure crosstalk interference amplitude produced by capacitive coupling between long metal lines. The sensor is programmable for measuring some ranges of crosstalk amplitude. The sensor design is based on the dynamic behavior of basic NOR and NAND gates depending on the MOS transistor sizes.
A Compiler Algorithm for Managing Asynchronous Memory Read Completion
Authors: Daniel Maskit
Venue:  (1996)

Computers with conventional memory systems have a predictable latency between initiation and completion of a memory read. On such machines it is relatively easy for either the compiler or the processor to guarantee that a load has completed before further references to the loaded register are made. In a machine with a logically shared, but physically distributed, memory, these latencies are not statically predictable. Some existing systems, such as the Cray T3D, deal with this problem by using a hardware mechanism to enforce synchronization on a register which is the target of a remote memory access. The M-Machine currently being designed by the Concurrent VLSI Architecture Group at MIT performs remote memory accesses asynchronously, and allows program execution to continue while the access is outstanding, but does not enforce synchronization in hardware. This architectural simplification, and resulting relaxation of memory completion semantics, poses a challenge to the compiler: how can this simpler memory system be efficiently supported while maintaining program correctness. In particular, what is required to guarantee that there are no conflicts between completion of a memory operation by placing a value into a register, and other uses of the register being written. This paper describes a general solution to this problem, develops an algorithm to implement it, and shows that the algorithm is correct.
Pseudospectra of the Convection-Diffusion Operator
Authors: Satish C. Reddy, Lloyd N. Trefethen, Dimpy Pathria
Venue:  (1993)

The spectrum of the simplest 1D convection-diffusion operator is a discrete subset of the negative real axis, but the pseudospectra are regions in the complex plane that approximate parabolas. Put another way, the norm of the resolvent is exponentially large as a function of the Peclet number throughout a certain parabolic region. These observations have a simple physical basis and suggest that conventional spectral analysis for convection-diffusion operators may be of limited value in some applications.
Indexing non-uniform spatial data
Authors: K. V. R. Kanth, D. Agrawal, A. K. Singh, A. El Abbadi
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

Non-uniformity in data extents is a general characteristic of spatial data. Indexing such non-uniform data using conventional spatial index structures such as R/sup */-trees is inefficient for two reasons: (1) the non-uniformity increases the likelihood of overlapping index entries, and (2) clustering of non-uniform data is likely to index more dead space than clustering of uniform data. To reduce the impact of these anomalies, we propose a new scheme that promotes data objects to higher levels in tree-based index structures. We examine two criteria for promotion of data objects and evaluate their relative merits using an R*-tree. In experiments on cartographic data, we observe that our promotion criteria yield up to 45% improvement in query performance for an R*-tree.
Profitable E-Marketing: Success Strategies That Pay Off
Authors: Al Bredenberg
Venue:  (2002)

:In Profitable e-Marketing, you'll find all the insight and guidance you need to help your company benefit from the explosive growth of the Internet as a marketing channel -- while learning from the mistakes others have made along the way. This book is like having an experienced consultant at your side while you think through all the issues involved in profiting from this new way of doing business. You'll get all the ammunition you need to support an Internet initiative. Plus a fingertip resource for answering almost any question, from how to use the Internet for market research to the best ways to write compelling Internet advertising copy (yes, it is quite different). It's like an expert on call, ready to help you make all the right moves. 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 Efficient Rule-Based OPC Approach Using a DRC Tool for 0.18µm ASIC
Authors: Ji-Soong Park, Chul-Hong Park, Sang-Uhk Rhie, Yoo-Hyon Kim, Moon-Hyun Yoo, Jeong-Taek Kong, Hyung-Woo Kim, Sun-Il Yoo
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

The increasing complexity and data volume of VLSI designs demand an efficient optical proximity correction (OPC) technique. In this paper, we address the issues related to the gate bridge, which is serious in the sub-quarter micron technology, and the wide range of contact CD (Critical Dimension) variation. We present the efficient gate CD control method by introducing the critical area correction. In addition, the contact CD variation is reduced under the target CD range due to the combination of the contact biasing and the process calibration. The correction time and output data volume are drastically reduced by the hierarchical data manipulation using a DRC (Design Rule Check) tool, which basically exploits the characteristics of the design layers in ASIC's. The newly proposed incremental on-line violation filtering method also reduces the correction cycle time significantly.
On the generalized critical region construct
Authors: Krishna Kant, Abraham Silberschatz
Venue: ACM SIGOPS Operating Systems Review (1982)

In his paper "Implementation of a Generalized Critical Region Construct", Ford has proposed a modification to Brinch Hansen and Hoare's concept of Conditional Critical Regions. In this paper, we point out some of the problems with the original proposal and present many improvements in order to make the construct more useful.
Fast & Cost Effective Cache Invalidation in DSM
Authors: Chang-Kyu Lee, KyuHo Park, BongWan Kim, Jong Hyuk Choi
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Most distributed shared memory systems use point-to-point networks in conjunction with directory-based cache coherence protocols. Cache invalidation transaction generates a number of unicast invalidation messages and as many acknowledgment messages. This results in heavy network traffic, high latency, and high occupancy at home nodes. This paper introduces a fast cache invalidation method; called collective cache invalidation (CCI), and its simple and cost effective implementation method, called virtual bus based collective cache invalidation (VCCI). The simulation results show that we can reduce the total network traffic up to 45% and the overall execution time up to 11% by VCCI. The proposed method keeps the system scalable - the growth rate of the implementation cost is O (NpN). In addition, VCCI can reduce the complexity of coherence protocol and make directory controllers simple since it does not require acknowledgment messages.
Special Edition Using Microsoft Commerce Server 2002
Authors: Don Jones, Mark D. Scott
Venue:  (2002)

:Microsoft Commerce Server 2002 provides a platform for the rapid development of e-Commerce web sites. It integrates with a variety of Microsoft products and services to simplify and accelerate development and deployment. It also provides a rich environment for developing custom sites based of proven techniques and methodologies. Special Edition Using Microsoft Commerce Server 2002 provides a Fast Track for developing and deploying sites. Using the design patterns found in the sample sites and lessons learned from years of field experience, the book defines a path for mapping an e-commerce project.
A Multiple-Mechanism Developmental Model for Defining Self-Organizing Geometric Structures
Authors: Kurt W. Fleischer
Venue:  (1995)

This thesis introduces a model of multicellular development. The model combines elements of the chemical, cell lineage, and mechanical models of morphogenesis pioneered by Turing, Lindenmayer, and Odell, respectively. The internal state of each cell in the model is represented by a time-varying state vector that is updated by a differential equation. The differential equation is formulated as a sum of contributions from different sources, describing gene transcription, kinetics, and cell metabolism. Each term in the differential equation is multiplied by a conditional expression that models regulatory processes specific to the process described by that term. The resulting model has a broader range of fundamental mechanisms than other developmental models. Since gene transcription is included, the model can represent the genetic orchestration of a developmental process involving multiple mechanisms. We show that a computational implementation of the model represents a wide range of biologically relevant phenomena in two and three dimensions. This is illustrated by a diverse collection of simulation experiments exhibiting phenomena such as lateral inhibition, differentiation, segment formation, size regulation, and regeneration of damaged structures. We have explored several application areas with the model: Synthetic biology. We advocate the use of mathematical modeling and simulation for generating intuitions about complex biological systems, in addition to the usual application of mathematical biology to perform analysis on a simplified model. The breadth of our model makes it useful as a tool for exploring biological questions about pattern formation and morphogenesis. We show that simulated experiments to address a particular question can be done quickly and can generate useful biological intuitions. As an example, we document a simulation experiment exploring inhibition via surface chemicals. This experiment suggests that the final pattern depends strongly on the temporal sequence of events. This intuition was obtained quickly using the simulator as an aid to understanding the general behavior of the developmental system. Artificial evolution of neural networks. Neural networks can be represented using a developmental model. We investigate the use of artificial evolution to select equations and parameters that cause the model to create desired structures. We compare our approach to other work in evolutionary neural networks, and discuss the difficulties involved. Computer graphics modeling. We extend the model to allow cells to sense the presence of a 3D surface model, and then use the multicellular simulator to grow cells on the surface. This database amplification technique enables the creation of cellular textures to represent detailed geometry on a surface (e.g., scales, feathers, thorns). In the process of writing many developmental programs, we have gained some experience in the construction of self-organizing cellular structures. We id
Theorem proving and programming with dynamic first order logic
Authors: D. J Eijck, J. M. Heguiabehere, B. O. Nuallain
Venue:  (2000)

Dynamic First Order Logic results from interpreting quantification over a variable $v$ as change of valuation over the $v$ position, conjunction as sequential composition, disjunction as nondeterministic choice, and negation as (negated) test for continuation. We present a tableau style calculus for DFOL with explicit (simultaneous) substitution, prove its soundness and completeness, and point out its relevance for programming with dynamic first order logic, for automatic program analysis, and for semantics of natural language. Next, we extend this to an infinitary calculus for DFOL with iteration.