ppxscal/embedding_network huggingface dataset:
The Mortar Method in the Wavelet Context
Authors: Bertoluzza,  S, V. Perrier
Venue:  (1999)

This paper deals with the use of wavelets in the framework of the Mortar method. We first review in an abstract framework the theory of the Mortar Method for non conforming domain decomposition, and point out some basic assumptions under which stability and convergence of such method can be proven. Then, we study the application of the Mortar Method in the biorthogonal wavelet framework. In particular we define suitable multiplier spaces for imposing weak continuity. Unlike in the classical mortar method, such multiplier spaces are not a subset of the space of traces of interior functions, but rather of their duals. For the resulting method, we provide with an error estimate, which is optimal in the geometrically conforming case. We also study an almost diagonal preconditioner based on using wavelet preconditioners as building blocks in a substructuring approach.
Concurrent Refinement in Nuprl
Authors: Roderick Moten
Venue:  (1997)

This dissertation reports on the design, implementation, and analysis of the first parallel interactive theorem prover, called the MP refiner. The MP refiner is a shared memory multi-processor implementation of the inference engine of Nuprl. The inference engine of Nuprl is called the refiner. The MP refiner is implemented in the functional programming language Standard ML and is compatible with the refiner of Nuprl 4.1. Parallelism is provided in the MP refiner using an extension to the runtime system of the SML/NJ compiler for Standard ML. The MP refiner provides AND-parallelism and OR-parallelism expressed in terms of concurrent tactics. Concurrent tactics are created using the new tacticals PTHEN and PORELSLEL. The process of evaluating concurrent tactics is called concurrent refinement. The MP refiner is a collection of threads operating as sequential refiners running on separate processors. Concurrent tactics exploit parallelism by spawning tactics to be evaluated by other refiner threads simultaneously. Tests conducted with the MP refiner running on a four processor Sparc shared--memory multi-processor reveal that concurrent refinement can significantly decrease the elapsed time of constructing proofs interactively. The concurrent tactics constructed with course-grain tactics gave speedups slightly less than two. On the other hand, the concurrent tactics using fine-grain tactics gave speedups close to three. The granularity of a tactic depends on the amount of primitive inferences it invokes. The poor speedups of concurrent tactics constructed with course-grain tactics resulted from bus contention between the multiple processors caused by the memory management of SML/NJ. The design of the MP refiner is based on a rigorous mathematical description of the refiner. The mathematical description includes a model of concurrent refinement. In addition, this disseration presents the first complete rigorous presentation of the Nuprl second order substitution algorithm and the first thorough description of the various components that make up the refiner. 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
User Performance Evaluation Based on a User Model for a Graphical User Interface Environment
Authors: Yaowem Wang
Venue:  (1994)

Graphical user interface technique has been used more and more in software design as the workstation and the window technologies continue to advance. The concerns of this project are the design and implementation of a user model and the user performance evaluation based on the user model for a graphical user interface environment. It monitors the human-computer inbteraction by interpreting the user actions under varies states. A simulated car model and its graphical user interface have been previously developed. This project is to evaluate the driver performance by using a user model. It can also be extended to evaluate the performance of other system components. 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
A Quadtree Based Dynamic Attribute Index Structure and Query Process
Authors: Rui Ding, Xiaofeng Meng
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

With rapid development of wireless communications as well as positioning technologies, the concept of moving objects has become more and more important, which are challenging the traditional database technologies. Since moving objects change their dynamic attributescontinuously, it is impractical to issue explicit updates for every change. In this paper, we introduce an indexing structure based on quadtree, which can be used to one-dimension,two-dimension, three-dimension and any other multi-dimension abstract data space. We alsopresent the querying process based on the indexing structure.
Propagation Algorithm of Behavior Probability in Power Estimation Based on Multiple-Valued Logic
Authors: Xunwei Wu, Massoud Pedram
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

This paper analyses the propagation operations of signal's multiple-valued behavior while passing through the basic gates. Based on it the propagation algorithm of behavior probability is proposed. In comparison with the propagation algorithm of signal probability this algorithm have advantages that the calculation is direct one and the glitches resulted from race hazard can be taken into account, whereby the estimation accuracy of power dissipation can be improved.
Anycast Routing Algorithms on the Internet
Authors: Chao Peng, YiNi Zhou
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

The anycasting communication paradigm is designed to support server replication by allowing applications to easily select and communicate with the "best" sever, according to some performance or policy criteria, in a group of content-equivalent servers. An anycast packet isone that should be delivered to one member in a group of designated recipients. Using anycast services may considerably simplify some applications. There are lots of work has been done on routing anycast packets. In this paper, we propose and analyze a routing protocol foranycast message. It is composed of three sub-protocols: the routing table establishment sub-protocol, the route maintenance sub-protocol and the packet forwarding sub-protocol. The specific description and analysis are given in this paper, data shows that our protocol isefficient and fault-tolerant.
Evaluation modules: the link between theory and practice
Authors: J. Boegh
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

The concept of evaluation modules is introduced in order to provide a flexible and structured approach to evaluating software products. The purpose of using evaluation modules is to ensure that software evaluations can be repeatable, reproducible and objective. A standardised format of evaluation modules is described and practical experiences with applying evaluation modules are reported.
Partitioning Loops with Variable Dependence Distances
Authors: Yijun Yu, Erik H. D'Hollander
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

A new technique to parallelize loops with variable distance vectors is presented. The method extends previous methods in two ways. First, the present method makes it possible for array subscripts to be any linear combination of all loop indices. The solutions to the linear dependence equations established from such array subscripts are characterized by a pseudo distance matrix (PDM). Second, it allows us to exploit loop parallelism from the PDM by applying uni-modular and partitioning transformations that preserve the lexicographical order of the dependent iterations. The algorithms to derive the PDM, to find a suitable loop transformation and to generate parallel code are described, showing that it is possible to parallelize a wider range of loops automatically.
Improved Methods for Modeling Uncertainty in RC Timing Analysis
Authors: Cheryl L. Harkness, Daniel P. Lopresti
Venue:  (1989)

Uncontrollable variations in the fabrication process make it impossible to accurately predict the circuit parameters used in timing analysis. Instead, these values are known to fall within certain limits, resulting in a range of possible circuit behaviors. In this paper, we present two new interval-based techniques for computing best- and worst-case bounds on circuit delay. Both produce tighter bounds than an approach we described in an earlier paper. When compared to Monte Carlo simulation, all of the interval methods are more precise and significantly faster.
Logic from Programming Language Semantics
Authors: Young Choo
Venue:  (1987)

Logic for reasoning about programs must proceed from the programming language semantics. It is our thesis that programs be considered as mathematical objects that can be reasoned about directly, rather than as linguistic expressions whose meanings are embedded in an intermediate formalism.Since the semantics of many programming language features (including recursion, type-free application, infinite structures, self-reference, and reflection) require models that are constructed as limits of partial objects, a logic for dealing with partial objects is required. Using the D infinity, model of the lambda-calculus, a logic (called continuous logic) for reasoning about partial objects is presented. In continuous logic, the logical operations (negation, implication, and quantification) are defined for each of the finite levels and then extended to the limit, giving us a model of type-free logic. The triples of Hoare Logic are interpreted as partial assertions over the domain of partial states, and contradictions arising from rules for function definitions are analyzed. Recursive procedures and recursive functions are both proved using mathematical induction. A domain of infinite lists is constructed as a model for languages with lazy evaluation and it is compared to an ordinal-heirarchic construction. A model of objects and multiple inheritance is constructed where objects are self-referential states and multiple inheritance is defined using the notion of product of classes. The reflective processor for a language with environment and continuation reflection is constructed as the projective limit of partial reflective processors of finite height.
Heuristic Token Selection for Total Order Reliable Multicast Communication
Authors: Weijia Jia, Jiannong Cao, Xiaohua Jia
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

An efficient multicast protocol is presented by using a heuristic function for passing a virtual token to decide the message total ordering. Unlike existing token-passing based algorithms, there is no physical token passing message in the protocol, instead, the token holder piggybacks token passing onto normal multicast messages. Executing the heuristic function does not incur any communication overhead and only relies on local information of a token holder. For a group of n processes and k multicast messages, the protocol is able to achieve atomicity of one message by average (n-2)/k point-to-point control messages. Dynamic membership is non-blocking, namely, each individual process in the group can take unilateral decisions at each step of the membership algorithms. System-wide consistent group configuration can be obtained in consistent order of normal multicast messages. Performance of the protocol is shown by implementation figures.
Dependability Analysis of Fault Tolerant Systems: A New Look at Combinatorial Modeling
Authors: A S Doyle
Venue:  (1995)

Reliable computer systems use component redundancy to achieve fault tolerance. The reliability of a fault tolerant system is frequently estimated from an analytical model of the system. Two popular modeling techniques are combinatorial models and Markov models. Markov models are more comprehensive and flexible than combinatorial models, but combinatorial models can express the failure modes of a system in a more concise and understandable manner than Markov models. Combinatorial models are well understood and have the support of a rich body of research, but are inherently unable to model the dynamic system behavior associated with fault tolerant computer systems. An example of dynamic behavior that cannot be captured in a combinatorial model is the ability of a fault tolerant system to automatically recover from the occurrence of a fault during system operation. Including the concept of coverage (and the possibility that recovery may be imperfect) in the system level model is critical to an accurate dependability assessment. We develop two new algorithms for incorporating coverage into the reliability analysis of a system. In the first algorithm, we show that standard combinatorial (cutset-based) solution techniques can be used to solve a problem that was previously thought to require a Markov solution. In the second algorithm, an alternative to the traditional cutset-based solution approach to combinatorial models, the binary decision diagram (BDD), is used. Through the second approach, the time required to solve some systems is significantly reduced. It is also possible that large systems can be evaluated which could not be analyzed previously. Several applications are modeled to demonstrate the ability of the algorithms. These systems range in size and in functionality, but all have some level of fault tolerant design. Some of the systems had only been modeled with a Markov chain prior to the development of our algorithms. Another had never been buccessfully modeled at all. Another area of study which is not typically addressed is the integrated analysis of systems. Looking at only the hardware or software of a system only gives part of the picture. It is difficult to draw a clear line distinguishing the effects of hardware from those of software. To perform an accurate analysis on an integrated system, the analysis itself should be integrated. We demonstrate a new approach for performing such an analysis which combines the attributes of both Markov models and combinatorial models for the evaluation of hardware and software fault tolerance.\\ 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
View Synthesis Using Stereo Vision
Authors: Daniel Scharstein
Venue:  (1996)

This thesis investigates the use of stereo vision for the application of view synthesis. View synthesis --the problem of creating images of a scene as it would appear from novel viewpoints --has traditionally been approached using methods from computer graphics. These methods, however, suffer from low rendering speed, limited achievable realism, and, most severely, their dependence on a global scene model, which typically needs to be constructed manually. In this thesis, we present a new approach to view synthesis that avoids the above problems by synthesizing new views from existing images of a scene. Using an image-based representation of scene geometry computed by stereo vision methods, a global model can be avoided, and realistic new views can be synthesized quickly using image warping. The new application of stereo for view synthesis makes it necessary to re-evaluate the requirements on stereo algorithms. We compare view synthesis to several traditional applications of stereo, and conclude that stereo vision is better suited for view synthesis than for applications requiring explicit 3D reconstruction. We also discuss ways of dealing with partially occluded regions of unknown depth and with completely occluded regions of unknown texture, and present experiments demonstrating that it is possible to efficiently synthesize realistic new views even from inaccurate and incomplete depth information. This thesis also contributes several novel stereo algorithms that are motivated by the specific requirements imposed by view synthesis. We introduce a new evidence measure based on intensity gradients for establishing correspondences between images. This measure combines the notions of similarity and confidence, and allows stable matching and easy assigning of canonical depth interpretations in image regions of insufficient information. We also present new diffusion-based stereo algorithms that are motivated by the need to correctly recover object boundaries. In particular, we develop a novel Bayesian estimation technique that significantly outperforms area-based algorithms using fixed-sized windows. We provide experimental results for all algorithms on both synthetic and real images.
Educause Leadership Strategies, IT Security in Higher Education, Vol. 8
Venue:  (2003)

:Information Technology (IT) security is sometimes an afterthought in the development of new information systems. However, the growing dependence of colleges and universities on the Internet requires reliable and secure systems. The confidentiality, integrity, and availability of data and IT resources are critical to the continuity of the educational enterprise, and can negatively effect institutional liability if improperly managed. This book, volume 8 in the EDUCAUSE Leadership Strategy Series, covers important topics in IT technology on campus, including security planning and policy, risk analysis, technical architecture, organization, awareness, and how improved IT security affects academics. 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
On the Size of Multiple-Valued Decision Diagrams
Authors: D. Michael Miller, Gerhard W. Dueck
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

The worst-case number of nodes is considered fordecision diagrams for general and totally-symmetricmultiple-valued functions. We present upper boundson the number of nodes and then show the bounds areexact by showing how to construct decision diagramof that size. We also show that cyclic edge negationsdo not reduce the worst case size as much as mightbe anticipated. Finally, we show that functions existwhich have exponential size with respect to one radix,but have linear size with respect to a different radix.
On categorical equivalence of Gentzen-style derivations in IMLL
Authors: Sergei Soloviev, Vladimir Orevkov
Venue: Theoretical Computer Science (2003)

A new deciding algorithm for categorical equivalence of derivations in Intuitionistic Multiplicative Linear Logic (IMLL) is proposed. The algorithm is based uniquely on manipulations with Gentzen-style derivations. The algorithm has low polynomial complexity. The paper also contains results concerning permutability of rules and its connection with categorical equivalence.
Complexity Issues in Learning by Neural Nets
Authors: Jyh Lin, Jeffrey S Vitter
Venue:  (1990)

We consider the computational complexity of learning by neural nets. We are interested in how hard it is to design appropriate neural net architectures and to train neural nets for general and specialized learning tasks. We introduce a neural net learning model and classify several neural net design and optimization problems within the polynomial-time hierarchy. We also investigate how much easier the problems become if the class of concepts to be learned is known {\em a priori} and the net architecture is allowed to be sufficiently non-optimal. We show that the problem of finding an optimal perceptron (in terms of the number of non-zero weights) consistent with a set of training examples is {\em NP}-complete. Our main result shows that the training problem for 2-cascade neural nets (which have only one hidden unit) is {\em NP}-complete, which implies that finding an optimal net (in terms of the number of non-input units) to load a set of examples is also {\em NP}-complete. Since the perceptron training problem can be solved in polynomial time by linear programming techniques, this result also demonstrates a surprising gap between the computational complexities of one-node and two-node neural net training problems. We conjecture that training a {\em k}-cascade neural net, which is a classical threshold network training problem, is also {\em NP}-complete, for each fixed $ k \geq 2 $.
Compositional C++: Compositional Parallel Programming
Authors: K. M Chandy, Carl Kesselman
Venue:  (1992)

A compositional parallel program is a program constructed by composing component programs in parallel, where the composed program inherits properties of its components. In this paper, we describe a small extension of C++ called Compositional C++ or CC++ which is an object-oriented notation that supports compositional parallel programming. CC++ integrates different paradigms of parallel programming: data-parallel, task-parallel and object-parallel paradigms; imperative and declarative programming; shared memory and messagebased programs. CC++ is designed to be transportable across a range of MIMD architectures.
Factoring sparse resultants of linearly combined polynomials
Authors: Manfred Minimair
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

This paper is part of the author's work on determining the irreducible factors of sparse (toric) resultants of composed polynomials. The motivation behind this work is to use the factors for efficient elimination of variables, by sparse resultant computation, from composed polynomials. Previous works considered the sparse (toric) resultant of polynomials having arbitrary (mixed) supports composed with (i.e. evaluated at) polynomials having the same (unmixed) supports and of polynomials having the same (unmixed) supports composed with polynomials having arbitrary (mixed) supports, resp. Here, we consider the sparse resultant of linear polynomials having arbitrary (mixed) supports composed with polynomials having arbitrary (mixed) supports, also called "linearly combined polynomials", (under a natural assumption on their exponents). The main contribution of this paper is to determine the irreducible factors, together with their exponents, of the sparse resultant of these linearly combined polynomials. This result essentially generalizes a result by Gelfand, Kapranov and Zelevinsky factoring the sparse resultant of unmixed dense linear polynomials composed with polynomials with unmixed supports. It is expected that this result can be applied to eliminate variables from linearly combined polynomials with improved efficiency.
Handwritten Address Recognition with Open Vocabulary Using Character N-Grams
Authors: Anja Brakensiek, Jörg Rottland, Gerhard Rigoll
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

In this paper a recognition system ¿ based on tied-mixture Hidden Markov Models (HMMs) ¿ for handwritten address words is described, which makes use of a languagemodel (LM), that consists of backoff character n-grams. For a dictionary-based recognition system it is essential, that the structure of the address (name, street, city) is known. If the single parts of the address cannot be categorized, the used vocabulary is unknown and thus unlimited. The performance of this open vocabulary recognition using n-grams is compared to the use of dictionaries of different sizes. Especially the confidence of recognition results andthe possibility of a useful postprocessing are significant advantages of language models.