ppxscal/embedding_network huggingface dataset:
Three Pressures in Swelling Porous Media
Authors: Lynn S Bennethum
Venue:  (2001)

For a two-phase swelling porous medium, two pressures have been previously defined thermodynamically in terms of intensive variables for each phase: one relating the change in energy with respect to specific volume, and the other relating the change in energy with respect to volume fraction. Within the framework of Hybrid Mixture Theory and hence the Coleman and Noll technique of exploiting the entropy inequality, we show that a different choice of independent variables allows the comparison of these pressures with the extensive (and hence more classically defined) pressure. In the process we show how one can convert directly between different combinations of independent variables without re-exploiting the entropy inequality and discover the relationship between three thermodynamically defined pressures. The physical interpretation of these three pressures is investigated by examining two media: a swelling porous medium with a non-interacting solid phase, such as well-layered clay, and a swelling porous medium with an interacting solid phase such as swelling polymers.
Realizing Boolean Functions on Disjoint Sets of Variables
Authors: Wolfgang J. Paul
Venue:  (1974)

For switching functions $f$ let $C(f)$ be the combinatorial complexity of $f$. We prove that for every $\varepsilon < 0$ there are arbitrarily complex functions $f:\{0,1\}^{n} \rightarrow \{0,1\}^{n}$ such that $C(fxf) \leq (1+ \varepsilon) C(f)$ and arbitrarily complex functions $g:\{0,1\}$ such that $C(v c(fxf)) \leq (1 + \varepsilon)C(f)$. These results and the techniques developed to obtain them are used to show, that Ashenhurst decomposition of switching functions does not always yield optimal circuits and to prove a new result concerning the trade-off between circuit size and monotone circuit size. 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
Generating Function Algorithms for Symbolic Computation
Authors: Robert A Ravenscroft,  Jr.
Venue:  (1991)

Various algebraic models have been used to implement symbolic procedures for solving summations and recurrences. Surprisingly, one model that has received little attention in the development of symbolic algorithms is generating functions. Generating function methods for discrete mathematics provide an ad hoc collection of techniques for solving summations and recurrences. In this work we consider their systematic application to symbolic computation. To demonstrate the feasibility and capabilities of generating functions as an algebraic model of computation, we develop and implement algorithms for manipulating generating functions and the sequences that they encode. In particular, we concentrate on algorithms for solving summations and recurrences. Techniques are developed to handle special functions and hybrid terms, which are terms involving two or more factors. Given various classes of summations and recurrences, we develop a theory to characterize the form of their solution. This allows us to demonstrate the ability of our algorithms to solve problems from these classes. This knowledge also assists us in developing algorithms that know where to look for a solution rather than doing an ad hoc search for a solution.
Formalizing Software Engineering Standards
Authors: Martin Verlage, Jürgen Münch
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

A software engineering standard is an aid for systematic software development and process improvement. Because of the informal representation of software engineering knowledge, the document might be inconsistent, ambiguous, and incomplete. A more formal representation promises to overcome these shortcomings. Software process modeling is a direction within software engineering that aims at providing support for capturing software development processes. This paper describes the application of a particular software process modeling approach to three software engineering standards. The lessons learned about the standards, the modeling, and the resulting models are discussed in detail. In addition to the support currently available for both authors and users of standards, future directions of how to use progressive forms of software engineering standards are illustrated. Process modeling technology promises to speed up development, management, and tailoring of software engineering standards.
Multiplicative equations over commuting matrices
Authors: L. Babai, R. Beals, J-Cai,  y., G. Ivanyos, E. M. Luks
Venue:  (1995)

We consider the solvability of the equation A_1^x_1 * ... * X_k^x_k = B and generalizations, where the A_i and B are given commuting matrices over an algebraic number field F. In the semigroup membership problem, the variables x_i are constrained to be nonnegative integers. While this problem is NP-complete for variable k, we give a polynomial time algorithm if k is fixed. In the group membership problem, the matrices are assumed to be invertible, and the variables x_i may take on negative values. In this case we give a polynomial time algorithm for variable k and give an explicit description of the set of all solutions (as an affine lattice). The results generalize recent work of Cai, Lipton, and Zalcstein [CLZ] where the case k=2 is solved using Jordan Normal Forms (JNF). We achieve greater clarity simplicity, and generality by eliminating the use of JNF''s and referring to elementary concepts of the structure theory of algebras instead (notably, the radical and the local decomposition. Partial solutions are combined using algorithms for (affine lattices. The special case of 1*1 matrices was recently solved by G. Ge and we heavily rely on his results.
A Multimedia Training Environment That Assists Users to Study Jewel Programs
Authors: Yuh-Huei Shyu, Peng-Wen Chen
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Jewel programs are invaluable assets of human beings. Thoroughly study these programs will dramatically promote one's understanding and skills. This kind of knowledge promotion has many folds of implication. It will not only improve one's programming skill, but also will strengthen the capabilities of one's imagination and creativity. However, tens of thousands of lines of source codes are rather tedious and time consuming to study. We need good instructor to guide us to do efficiently and effectively study. However, twenty-four hours' good instructor is hard to find. In this paper, a multimedia jewel program-training environment will be introduced. This environment provides functions for both content designing and jewel program learning. Within this system, a jewel program instructor can edits the jewel program into incremented versions. Associated with each version, multimedia explanation will be added. Via carefully designed versions, learners can study jewel programs very efficiently.
DESCARTES: An Automatic Programming System for Algorithmically Simple Programs
Authors: Bruno Ginoux, Jean-Luc Dormoy, Claudia Jimenez-Dominguez, Jean-Yves Lucas, Laurent Pierre
Venue: Proceedings of the 9th international workshop on Software specification and design (1998)

Most research work in the field of automatic programming has been focused on conceptually complex problems. However, although most of the programs we are generally faced with may be very big and manage large volumes of data, they are conceptually simple. Starting from this consideration, we have developed, since 1992, a system called DESCARTES which, fully automatically, generates programs written in conventional procedural languages, starting from program specifications expressed in a mathematical type formal specification language. The first operational version of the system which represents about one million of C lines has already been used in several industrial applications, and especially to specify and generate a nuclear power plant emergency shutdown system and a module scheduling control operations for a fuel power plant. In this paper, we describe the DESCARTES language and system as well as the results obtained and we comment our approach compared to traditional approaches in the field of automatic programming.
Color Counting and its Application to Path Delay Fault Coverage
Authors: Jayant Deodhar
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

We propose a new technique for computing exact fault coverage for any fault model. It consists of appropriate formation and counting of colors. Each color represents a set of faults, and the definition of colors varies according to the fault model. The technique utilizes the two aspects on which the fault coverage for any model depends, the circuit lines and the patterns applied to the circuit. Depending upon the sample space of faults for a given model, the representation of faults as colors differs. Colors are generated in a greedy and on demand manner ensuring they are unique. Even though the technique is simple in nature, it has never been used to calculate fault coverage for any fault model before. In this paper we apply it to calculate the fault coverage for the path delay fault model. Our experimental results show improvement over the existent techniques for abovementioned model.
Archiving agents for the World Wide Web
Authors: C. Brandli, H. Rudin
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

The information available on the World Wide Web changes with incredible speed. New information is added and old information is altered. This means that a document which is important to a user accessing the Web may change, move or even disappear altogether. Described here is an autonomous agent, written in Java, which locally archives documents that are deemed important by the user. These locally archived documents are then available-quickly-when needed.
Efficient Exploitation of Concurrency Using Graph Decomposition
Authors: C. McCreary, H. Gill
Venue:  (1990)

We present techniques for analyzing the data dependency structure of a program to determine an efficient task "grain" structure for parallel execution. In a previous paper, [McCreary&Gill, 1989], we described the application of a generalized parsing technique that detects potential parallelism in a data flow graph. When combined with cost metrics tailored for particular execution and communication models, this technique permits different decompositions to be discovered for different parallel architectures. In the original decomposition method, the parse identifies components of the graph that are linearly data dependent and components that are independent. (Components that are linearly dependent must be executed serially, and components that are independent may be executed in parallel.) Certain graphs contain irregular data dependencies that are not further decomposed; such components are designated as primitive. The primary contribution of this paper is a new technique for further decomposing primitive structures. In the earlier work these structures were to be executed serially on the same processor. The new technique allows the parse to discover linear and independent components contained inside primitive components that previously were left as monolithic structures. The enhanced technique is illustrated by its application to the data flow graph for the Cooley-Tukey Fast Fourrier Transform, [Hockney&Jesshope, 1988]. A more detailed cost model is also employed.
Rates of convergence and asymptotic normality of curve estimators for ergodic diffusion processes
Authors: J. H Zanten
Venue:  (2000)

For ergodic diffusion processes, we study kernel-type estimators for the invariant density, its derivatives and the drift function. We determine rates of convergence and find the joint asymptotic distribution of the estimators at different points.
Type Theory and Concurrency
Authors: Rance Cleaveland, Prakash Panangaden
Venue:  (1985)

The burgeoning interest in concurrent computation has sparked an increased interest in theoretical models of concurrency. While standard sequential programming has a well-understood semantics and proof theory, the nondeterministic nature of concurrency has made a similar understanding of concurrent programming extremely difficult. Much interesting work in the field has been done, and much remains yet to be done; it is our intention in this paper to present a different kind of model of concurrency, a type-theoretic one, which we hope will shed light on reasoning about concurrency. We encode the synchronization tree model of Milner''s CCS as a type in the Nuprl Type Theory. This is a constructive type theory equipped with a rich collection of inference rules for reasoning about types. We relate the equality in the type of synchronization trees with various behavioral equivalences. We also discuss the relation between the logic induced by our models and various modal logics for reasoning about concurrency.
Trading Strategies on Trial: A Comprehensive Review of 21 Practical Trading Strategies over 56 Listed Stocks
Authors: Shu-Heng Chen, Tzu-Wen Kuo
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Using a dataset of 56 listed companies in the Taiwan stock market and 21 trading strategies from the practitioners of one major securities company in Taipei, this paper contributes to a follow-up research on the effectiveness of trading strategies.A notion of effective trading strategy based on the winning probability is given.If the criterion for the winning probability is set to "bigger than 0.5 "(i.e., better than random guessing),then we find that none of the 21 trading strategies are effective.Hence, to some extent, the result lends support to the efficient market hypothesis.
Arithmetic Coding for Data Compression
Authors: G P Howard, S J Vitter
Venue:  (1994)

Arithmetic coding provides an effective mechanism for removing redundancy in the encoding of data. We show how arithmetic coding works and describe an efficient implementation that uses table lookup as a fast alternative to arithmetic operations. The reduced-precision arithmetic has a provably negligible effect on the amount of compression achieved. We can speed up the implementation further by use of parallel processing. We discuss the role of probability models and how they provide probability information to the arithmetic coder. We conclude with perspectives on the comparative advantages and disadvantages of arithmetic coding.
Fata Morgana " A Presentation System for Product Design
Authors: Gudrun Klinker, Allen H. Dutoit, Martin Bauer, Johannes Bayer, Vinko Novak, Dietmar Matzke
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

Mobile Augmented Reality applications promise substantial savings in time and costs for product designers, in particular, for large products requiring scale models and expensive clay mockups (e.g., cars). Such applications are novel and introduce interesting challenges when attempting to describe them to potential users and stakeholders. For example, it is difficult, a priori, to assess the nonfunctional requirements of such applications and anticipate the usability issues that the product designers are likely to raise. In this paper, we describe our efforts to develop a proof-of-concept AR system for car designers. Over the course of a year, we developed two prototypes, one within a university context, the other at a car manufacturer. The lessons learned from both efforts illustrate the technical and human challenges encountered when closely collaborating with the end user in the design of a novel application.
Horizons of Parallel Computation
Authors: Gianfranco Bilardi, Franco P. Preparata
Venue:  (1993)

This paper considers the ultimate impact of fundamental physical limitations---notably, speed of light and device size---on parallel computing machines. Although we fully expect an innovative and very gradual evolution to the limiting situation, here we take the provocative view of exploring the consequences of the accomplished attainment of the physical bounds. The main result is that scalability holds only for neighborly interconnections, such as the square mesh, of bounded-size synchronous modules, presumably of the area-universal type. We also discuss the ultimate infeasibility of latency-hiding, the violation of intuitive maximal speedups, and the emerging novel processor-time tradeoffs.
Expressiveness of basic splice
Authors: J. C. Pol
Venue:  (2000)

We study a simple software architecture, in which application processes are coordinated by writing into and reading from a global set. This architecture underlies Splice, which is developed and used at the company Hollandse Signaalapparaten. Our approach is distinguished by viewing the architecture as a component itself, described formally by means of process algebra. Two results are proved. First a distributed implementation of the architecture is given, in which each component maintains a local set and data items are exchanged between these local sets. The implementation is proved to be behaviourally equivalent to the conceptual view of having one global set. Next we show that every requirements specification expressible as a finite process has a distributed implementation on this architecture.
Memory Bus Encoding for Low Power: A Tutorial
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper contains a tutorial on bus-encoding techniques that target low power dissipation. Three general classes of codes, i.e., algebraic, permutation-based, and probability-based, are reviewed. A new mathematical framework for unifying the power-aware algebraic coding techniques based on the notion of leader sets is also presented.
A Polynomial Time Algorithm for the Complete Test-and-Treatment Decision Tree Problem
Authors: A R Wagner
Venue:  (1986)

The Test-and-Treatment is an extension of the Binary Testing problem. In the Binary Testing problem, a collection of {\em tests} is given, and a decision tree of least expected cost is sought which isolates or {\em identifies} a unique distinguished object, in a given universe of $N$ objects. In that problem, each object has an a priori probability of being the distinguished object, and each test has a given cost. The Test-and-Treatment Problem alters this setting, augmenting the set of tests given with a collection of {\em treatments}. Each treatment is effective for a particular set of objects. The objective of the new problem is a decision tree which guarantees that the distinguished object is a member of the effective set of some treatment which the tree causes to be applied. The present paper solves a special case of this problem, for which no polynomial-time solution has previously been found. The special case restricts all probabilities to be equal, and provides tests and treatments with every possible effective set, at costs which are functions only of the number of objects in the particular effective set of the test or treatment. A solution is presented which requires time $0(N ^ 2 )$ to produce an optimum decision tree. The best algorithm previously known for this restricted problem requires time $0(N4 ^ N)$.
Fast Firewall Implementations for Software-based Routers
Authors: Lili Qiu, George Varghese, Suri Subash
Venue:  (2000)

Routers must perform packet classification at high speeds to efficiently implement functions such as firewalls. The classification can be based on an arbitrary number of prefix and range fields in the packet header. The classification required for firewalls is beyond the capabilities offered by standard Operating System classifiers such as BPF~\cite{MJ93}, DPF~\cite{EK96}, PathFinder~\cite{BGS94} and others. In fact, there are theoretical results that show the general firewall lassification problem has poor worst case cost: for searching over $N$ arbitrary filters using $k$ packet fields, either the worst-case search time is $\Omega((\log N)^{k-1})$ or the worst-case storage is $O(N^{k})$. In this paper, we re-examine two basic mechanisms that have been dismissed in the literature as being too inefficient: backtracking search and set pruning trees. We find using real databases that the time for backtracking search is much better than the worst case bound; instead of $\Omega((logN)^{k-1})$, the search time is only roughly twice the optimal search time\footnote{\scriptsize The height of the multiplane trie is regarded as optimal search time throughout the paper, unless otherwise specified.}. Similarly, we find that set pruning trees (using a DAG optimization) have much better storage costs than the worst case bound; it has memory requirements similar to the RFC scheme of Gupta and McKeown~\cite{GM99}. We also propose several new techniques to further improve the two basic mechanisms. Our major ideas are a novel compression algorithm, the ability to trade smoothly between backtracking and set pruning, and algorithms to effectively make use of hardware if hardware is available. We quantify the performance gain of each technique using real databases. We show that on real firewall databases our schemes, with the accompanying optimizations, are close to optimal in time and storage.
Binary Fluids with Long Range Segregating Interaction I: Derivation of Kinetic and Hydrodynamic Equations
Authors: Bastea S., Esposito R., Lebowitz J. L., Marra R.
Venue:  (2000)

We study the evolution of a two component fluid consisting of ``blue'''' and ``red'''' particles which interact via strong short range (hard core) and weak long range pair potentials. At low temperatures the equilibrium state of the system is one in which there are two coexisting phases. Under suitable choices of space-time scalings and system parameters we first obtain (formally) a mesoscopic kinetic Vlasov-Boltzmann equation for the one particle position and velocity distribution functions, appropriate for a description of the phase segregation kinetics in this system. Further scalings then yield Vlasov-Euler and incompressible Vlasov-Navier-Stokes equations. We also obtain, via the usual truncation of the Chapman-Enskog expansion, compressible Vlasov-Navier-Stokes equations.
A New Shadow Wavefunction for the Ground State of 4He
Authors: T. MacFarland, S. A. Vitiello, L. Reatto, G. V. Chester, M. H. Kalos
Venue:  (1994)

A new form of trial shadow wavefunction is introduced to describe the ground state of 4He in the solid and liquid phases. We have used Monte Carlo integration to optimize the parameters of this function, and have carried out a thorough analysis of the shadow description of the system. This shows improved pair correlations, an improved condensate fraction, substantially reduced variational energies and a good equation of state. We have explored the melting and freezing transition, and find the transition densities to be in good agreement with the exact results of Green''s Function Monte Carlo (GFMC). We introduce a second shadow wavefunction in which the basis set expansion is used to optimize the two particle correlations. This shadow wavefunction yields pair correlation functions in excellent agreement with GFMC, as well as a substantial reduction in the variational energies at all densities.