ppxscal/embedding_network huggingface dataset:
Games for synthesis of controllers with partial observation
Authors: A. Arnold, A. Vincent, I. Walukiewicz
Venue: Theoretical Computer Science (2003)

The synthesis of controllers for discrete event systems, as introduced by Ramadge and Wonham, amounts to computing winning strategies in parity games. We show that in this framework it is possible to extend the specifications of the supervised systems as well as the constraints on the controllers by expressing them in the modal µ-calculus.In order to express unobservability constraints, we propose an extension of the modal µ-calculus in which one can specify whether an edge of a graph is a loop. This extended µ-calculus still has the interesting properties of the classical one. In particular it is equivalent to automata with loop testing. The problems such as emptiness testing and elimination of alternation are solvable for such automata.The method proposed in this paper to solve a control problem consists in transforming this problem into a problem of satisfiability of a µ-calculus formula so that the set of models of this formula is exactly the set of controllers that solve the problem. This transformation relies on a simple construction of the quotient of automata with loop testing by a deterministic transition system. This is enough to deal with centralized control problems. The solution of decentralized control problems uses a more involved construction of the quotient of two automata.This work extends the framework of Ramadge and Wonham in two directions. We consider infinite behaviours and arbitrary regular specifications, while the standard framework deals only with specifications on the set of finite paths of processes. We also allow dynamic changes of the sets of observable and controllable events.
Complete, Trace-based, Network Proof Systems: An Advisor''s Perspective
Authors: David Gries
Venue:  (1987)

NO AVAILABLE 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
Signatures for Library Functions in Executable Files
Authors: Mike V Emmerik
Venue:  (1994)

A method for efficiently generating signatures for detecting library functions in executable files is described. The signatures are used to automatically detect such functions in dcc, the reverse compiler at the Queensland University of Technology. Difficulties arise from the variability of the signatures, the multiplicity of library code vendors, and of memory models, and indistinguishable functions. An efficient hashing technique involving perfect optimal hashing functions is used. Performance is good - the signature files are created in a few seconds, and the name of a library function can be found in about the time of two standard hashes. One signature file is required for each vendor, version, and memory model combination. and they are generated from die appropriate library file (e.g. slibce.lib). Some issues are yet to be addressed, such as variation due to floating point math options (e.g. emulator, fast alternate, or coprocessor calls).
HI-Cam: Intelligent Biofeedback Processing
Authors: Steve Mann, Daniel Chen, Sam Sadeghi
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

Humanistic Intelligence (HI) is defined by two embodying elements. (1) It is a signal processing framework in which the human and the computer use each other in a feedback loop. (2) The HI processing apparatus is inextricably intertwined with the natural capabilities of the human mind and body. The Humanistic Intelligent Camera, or HI-Cam, is a wearable personal imaging application of HI. It uses physiological signal processing such as Fast Fourier Transform (FFT) analysis on EEG signals to control various parameters of a personal cybernetics system. EyeTap devices are particularly well suited to being controlled by brainwaves, because the parameters of the system are observable on the screen of the EyeTap viewfinder. This provided a direct means of physiological control over a video capture program, creating a camera system embodying humanistic intelliegence.
An Algorithm for Checking PL/CV Arithmetic Inferences
Authors: Tat Chan
Venue:  (1977)

This paper describes the operation and implementation of the arithmetic proof rule for the quantifier free integer arithmetic used in the PL/CV 2 program verification system. The general arithmetic satisfiability problem underlying the rule is shown to be NP complete.
XNAMI - An eXtensible XML-Based Paradigm for Network and Application Management Instrumentation
Authors: Ajita John, Keith Vanderveen, Binay Sugla
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

We introduce a new paradigm for the retrieval and presentation of management data. XNAMI is a Java- based network and application management toolkit which uses XML and the Document Object Model to specify a Management Information Base (MIB) at run- time. This approach allows the MIB to be serialized and shipped over the network between managers and agents. It also facilitates runtime agent extension and allows the MIB to be easily browsed and seamlessly integrated with online documentation. XML further allows for the interchange of data between management applications using different information models.
Logic Grammars for Diagnosis and Repair
Authors: Henning Christiansen, Veronica Dahl
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

We propose an abductive model based on Constraint Handling Rule Grammars (CHRGs) for detecting and correcting errors in problem domains that can be desribed in terms of strings of words accepted by a logic grammar. We provide a proof of concept for the specific problem ofdetecting and repairing natural language errors, in particular; those concerning feature agreement. Our methodology relies on grammar and string transformation in accordance with a user-defined dictionary of possible pairs. This transformation also serves as top-down guidance for our essentially bottom-up parser. With respect to previous approaches to error detection and repair; including those that also use constraints and/or abduction, our methodology is surprisingly simple while far-reaching and efficient.
Inside the Windows Security Push
Authors: Michael Howard, Steve Lipner
Venue: IEEE Security and Privacy (2003)

The Microsoft Windows development team spent two months in 2002 analyzing product design, code, and documentation to fix security issues. The results of this security push include a new process and several lessons learned for future projects.
Double Parity Sparing for Improvement of Performance and Reliability in Disk Arrays
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

RAID level 5 disk arrays provide reliable, cost-effective secondary storage with high performance. Sparing schems have been proposed to improve the reliability and the performance of RAID 5 disk arrays. In this paper, we a new sparing technique, double parity sparing. We evaluate the performance and reliability of the proposed scheme in various modes of operation. We present results from simulations to show that the proposed scheme offers better performance in some modes. Also, it is shown that the proposed scheme provides better reliability.
Analysis of multilevel methods for eddy current problems
Authors: R. Hiptmair
Venue: Mathematics of Computation (2003)

In papers by Arnold, Falk, and Winther, and by Hiptmair, novel multigrid methods for discrete H(curl; Ω)-elliptic boundary value problems have been proposed. Such problems frequently occur in computational electromagnetism, particularly in the context of eddy current simulation.This paper focuses on the analysis of those nodal multilevel decompositions of the spaces of edge finite elements that form the foundation of the multigrid methods. It provides a significant extension of the existing theory to the case of locally vanishing coefficients and nonconvex domains. In particular, asymptotically uniform convergence of the multigrid method with respect to the number of refinement levels can be established under assumptions that are satisfied in realistic settings for eddy current problems.The principal idea is to use approximate Helmholtz-decompositions of the function space H(curl; Ω) into an H1 (Ω)-regular subspace and gradients. The main results of standard multilevel theory for H1 (Ω)-elliptic problems can then be applied to both subspaces. This yields preliminary decompositions still outside the edge element spaces. Judicious alterations can cure this.
ATM admission models of stochastic high level Petri nets based on hierarchical modeling
Authors: Chuang Lin, S. T. Chanson
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

This paper presents a framework for modeling and analyzing ATM admission control using Stochastic High Level Petri Net (SHLPN). SHLPN is chosen because it is a powerful graphical and mathematical modeling tool that is able to handle concurrent, asynchronous, nondeterministic and stochastic events. In addition, there exists a set of well-developed performance analysis techniques for SHLPN. This paper uses a hierarchical modeling technique to specify complex ATM network mechanisms using a top-down approach. However, in analyzing the performance of the network, a bottom-up approach is adopted. To tackle the state space explosion problem, a SHLPN model is decomposed into submodels. These subnets are independently evaluated with all possible population which are then substituted by transitions with approximate equivalent performance in the original model. The technique is illustrated by modeling and evaluating a specific connection admission control policy
The Little Digital Camera Book
Authors: Cynthia L. Baron, Daniel Peck
Venue:  (2002)

:Digital cameras have revived many people's interest in photography. With affordable cameras, fast computers, and accessible image-editing software, anyone can create and share gorgeous pictures much more easily than with traditional film photography. Now it's easier than ever to email photos, make perfect prints, or create digital archives of your images. But navigating the world of digital photography can be daunting: tangling with terms like megapixels, resolution, JPEGs, and histograms can discourage all but the most avid artist. The Little Digital Camera Book cuts through the jargon and the dizzying array of choices that buyers face both before and after purchasing a digital camera. Clear, friendly explanations cover the whole process of buying a camera, shooting pictures, then editing and distributing those pictures in a variety of forms.
Learning-Based On-Line Testing in Feedforward Neural Networks
Authors: Naotake Kamiura, Kazuharu Yamato, Teijiro Isokawa, Nobuyuki Matsui
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

Learning-based on-line testing in feedforward neural networks (NNs) is discussed. After the convergence of the ordinary learning, the re-learning employing two sigmoid activation functions per neuron in the last layer of the NN is made. It sets up the range of erroneous potentials produced from the last layer, and enables us to detect faults without extra hardware.
Spike-timing-dependent plasticity and relevant mutual information maximization
Authors: Gal Chechik
Venue: Neural Computation (2003)

Synaptic plasticity was recently shown to depend on the relative timing of the pre- and postsynaptic spikes. This article analytically derives a spike-dependent learning rule based on the principle of information maximization for a single neuron with spiking inputs. This rule is then transformed into a biologically feasible rule, which is compared to the experimentally observed plasticity. This comparison reveals that the biological rule increases information to a near-optimal level and provides insights into the structure of biological plasticity. It shows that the time dependency of synaptic potentiation should be determined by the synaptic transfer function and membrane leak. Potentiation consists of weight-dependent and weight-independent components whose weights are of the same order of magnitude. It further suggests that synaptic depression should be triggered by rare and relevant inputs but at the same time serves to unlearn the baseline statistics of the network's inputs. The optimal depression curve is uniformly extended in time, but biological constraints that cause the cell to forget past events may lead to a different shape, which is not specified by our current model. The structure of the optimal rule thus suggests a computational account for several temporal characteristics of the biological spike-timing-dependent rules.
Reuse of software process fragments is reuse of software too
Authors: L. Groenewegen, G. Engels
Venue: Proceedings of the 10th International Software Process Workshop (1996)

By means of a special software process model component we have been successful in specifying software process model evolution. This component also handles much reuse of software process model fragments. To handle the reuse of the software as it is being produced by a software process, another extra component can be added to the model for that software process. It is argued why this extra component is comparable to the special component for evolution.
Information Relationships and Measures in Application to Logic Design
Authors: Lech Józwiak
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

In this paper, the theory of information relationships and relationship measures is considered and its application to logic design is discussed. This theory makes operational the famous theory of partitions and set systems of Hartmanis. Set systems enable us to model information streams. The information relationships and measures enable us to analyze relationships between the modeled information streams and constitute an important analysis apparatus that can be used for analysis and synthesis of various information systems. In particular, this apparatus can be applied in logic design, pattern analysis, machine learning, and other fields. This paper shows how to apply the relationships and measures to logic design when using as examples three important problems: input support minimization, parallel decomposition and serial functional decomposition. The application examples and experimental results presented in the paper demonstrate the high potential of the information relationships and measures in solving logic synthesis problems.
Two new theorem on mappings uniformly continuous and convex with applications to quadrature rules and means
Authors: M. Emin Özdemir, Ugur S. Kirmaci
Venue: Applied Mathematics and Computation (2003)

An interesting connection exists between convex functions and uniformly continuous functions. This linkage leads to some interesting functional inequalities over the open interval which works well in quadrature rules and means. In this paper, we establish two new theorem which connect the Hermite-Hadamard type functions.
Writing style for architectural synthesis
Authors: D. R. Smith
Venue: Proceedings of the 4th IEEE International Verilog HDL Conference (1995)

An encapsulated writing style of Verilog is described together with models for a corresponding scheduler and synthesizer. The method provides a middle ground between synthesis from behavioral specifications, which implies decisions too difficult for architectural synthesis, and synthesis from pure structural specifications, which necessitates providing full details of the controller and netlist. The input writing style is designed to be as concise as possible. This is done by the encapsulation of the functionality of major submodules, and implicit (inferred) control. In this way it is possible to describe complex functional architectures in an economical and transparent manner. This description can be transformed semi-automatically by steps through intermediate styles and eventually to a pure structural specification containing fall details of timing invocations and interconnections to appropriate controllers. At each stage after the first, the writing styles can be fully accessible to native Verilog simulators. The efficiency and economy of this style is demonstrated by a simulation of the well known DLX processor benchmark with full pipeline bypasses.
An Implementation Architecture for Orthogonally Persistent Deductive Object-Oriented Database Systems
Authors: Mohammad Ashrafuzzaman, Anthony J. Kusalik
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

A novel architectural solution for implementing orthogonal persistence in deductive object-oriented database languages is presented. Central to the technique is a persistent type system implemented using distributed objects and ODMG's d Ref [T] class. Use of distributed objects as database types naturally leads to a component-based multi-tier CORBA-like implementation architecture. This architecture seamlessly accommodates object-faulting and transitive persistence. This paper also discusses use of the architecture to implement a deductive object-oriented database system supporting the ROL language and orthogonal persistence.
An Abstract Interpretation Framework for (almost) Full Prolog
Authors: B. L Charlier, S. Rossi, P. Van Hentenryck
Venue:  (1994)

A novel abstract interpretation framework is introduced that captures Prolog depth-first strategy and the cut operation. The framework is based on a new conceptual idea, the notion of substitution sequences, and the traditional fixpoint approach to abstract interpretation. It broadens the class of analyses that are amenable in practice to abstract interpretation and refines the precision of existing analyses. Its practicability is demonstrated in a companion paper. This paper focuses on theoretical foundations.
The Document Representation Problem: An Analysis of LSI and Iterative Residual Rescaling
Authors: Rie Ando
Venue:  (2001)

Important text analysis problems in information retrieval and natural language processing, such as document clustering and automatic text summarization, require accurate measurement of inter-document similarity. The goal of this work is to find methods for automatically creating document representations in which inter-document similarity measurements correspond to human judgment. We present a new model for the task of creating document representations. From this model, we derive a new analysis of Latent Semantic Indexing (LSI), which is one of the successful approaches that has been studied extensively. In particular, we show a precise relationship between LSI''s performance and the uniformity of the underlying distribution of documents over topics. As a consequence, we propose a novel alternative method called Iterative Residual Rescaling (IRR), that, crucially, compensates for distributional non-uniformity. Experiments over a variety of practically-encountered settings and with several evaluation metrics validate our theoretical prediction and confirm the effectiveness of IRR in comparison to LSI. We also propose several extensions including a new document sampling method to scale IRR up to large document collections. Comparison with random sampling provides further empirical evidence that performance can be improved by counteracting non-uniformity. Finally, we present a system for multi-document summarization based on IRR, which demonstrates that IRR can be immediately useful in applications. We show that IRR works as a framework to find a tightly connected (and therefore interpretable) set of coherent texts, and effectively present them to the user.
Gazing: An Approach to the Problem of Definition Expansion
Authors: Dave Barker-Plummer
Venue:  (1989)

A major outstanding problem in automated theorem proving research is determining the appropriate use of definitions and previously proved theorems within a proof. Presenting the theorem prover with only the formulae that are necessary for the proof might be viewed as ``cheating'''' and requires that the user prove the theorem ahead of time. On the other hand providing the prover with all formulae that might be relevant rapidly swamps the prover with unnecessary information. A technique for the selective retrieval of formulae based on features of those formulae and the conjecture at hand is required to solve this problem. In this paper I describe an abstraction-based technique which addresses this problem. Implicit hypotheses such as definitions, axioms and previously proved theorems are stored in a database which may be accessed by a heuristic rule of inference called {\em gazing}. Before accessing this database the gazing rule plans the use of these formulae in a hierarchy of abstraction spaces. When the planning phase is complete, the system can use the indicated formulae with some confidence that they are relevant to the proof. Since the technique is abstraction-based, no guarantee that the plan will eventually be applicable or successful can be made. However, because the plans are built by considering increasing amounts of detail, the number of ways in which the application of a plan can fail is limited. Plan failure may be ``patched'''' in a uniform way.
Comparison of Hybrid Neural Systems of KSOM-BP Learning in Artificial Odor Recognition System
Authors: Benyamin Kusumoputro, Ary Saptawijaya, Aniati Murni
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This report proposes an adaptive recognition system, which is based on Kohonen self-organization network (KSOM).As the goals in the research on artificial neural network are to improve the recognition capability of the network and at the same time minimize the time needed for learning the patterns, these goals could be achieved by combining two types of learning, i.e. supervised learning and unsupervised learning.We have developed a new kind of hybrid neural learning system, combining unsupervised KSOM and supervised back-propagation learning rules.This hybrid neural system will henceforth be referred to as hybrid adaptive SOM with winning probability function and supervised BP or KSOM (WPF)-BP.This hybrid neural system could estimate the cluster distribution of given data, and directed it into predefined number of cluster neurons through creation and deletion mechanism.Comparison with other developed hybrid neural system is done for determination of various odors from Martha Tilaar Cosmetics product in an artificial odor recognition system.The performance of our developed learning system in term of its recognition ability and its learning time is explored in this report.
Reflected Number Systems
Authors: Anurag Acharya
Venue:  (1992)

This report introduces the class of reflected number systems. Members of this class have the adjacency property, i.e., representations for consecutive numbers differ in only one digit and the magnitude of this difference is one. It shows that every number system based on a positional weighting scheme has a reflected analogue. It presents procedures to convert a number system to its reflected analogue and vice versa. A conventional number system and its reflected analogue share some properties. Hence the conversion procedure can be used to design reflected number systems that are likely to have desired properties. This paper presents two examples.