ppxscal/embedding_network huggingface dataset:
Learning Fuzzy Rules by Genetic Algorithm for the Cart-Pole System
Authors: Gerard D. Finn
Venue:  (1993)

Logical relationships discovered during the conceptual design phase of system development are rarely fully realised in the final implemented system. Rules implemented as Prolog rules. SQL views or triggered SQL procedures typically express only part of the original conceptual relationship. We look at a method of expressing and processing rules which allows the true conceptual relationship to be expressed. The approach we take is to represent deduction rules as SQL queries which determine when the rule, when viewed as a constraint, is being violated. This method is non-directed and so allows any of the terms in a rule to be inferred from the others. 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 logic for suspicious players: epistemic actions and belief-updates in games
Authors: Alexandru Baltag
Venue:  (2000)

In this paper, we introduce a notion of ``epistemic action'''' to describe changes in the information states of the players in a game. For this, we use ideas that we have developed in our previous papers [BMS], [BMS2] and [B], enriching them to cover, not just {\it purely epistemic} actions, but also {\it fact-changing actions} (``real moves'''', e.g. choosing a card, exchanging cards etc.) and {\it nondeterministic actions} and {\it strategies} (conditional actions having knowledge tests as conditions). We consider natural {\it operations with epistemic actions} and we use them to describe significant aspects of the interaction between beliefs and actions in a game. For this, we use a logic that combines in a specific way a multi-agent epistemic logic with a dynamic logic of ``epistemic actions''''. We give (without proof) {\it a complete and decidable proof system} for this logic. As an application, we analyze a specific example of a dialogue game (a version of the Muddy Children Puzzle, in which some of the children can ``cheat'''' by engaging in secret communication moves, while others may be punished for their credulity). We also present a sketch of a ``rule-based'''' approach to games with imperfect information (allowing ``sneaky'''' possibilities, such as: cheating, being deceived and suspecting the others to be cheating). 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 Computation of Fixpoints in Static Program Analysis with an Application to AKL
Authors: Erik Schon
Venue:  (1995)

This report features an introduction to lattice- and fixpoint theory and a survey of methods and recent results for fixpoint computations in static program analysis. As the number of equations in static program analysis tend to be very large, it is extremely important to avoid unnecessary computations and hence to find an optimal order in which to compute the functions. It is also important to have an efficient method for detecting stability. An algorithm satisfying these two requirements is Bourdoncle''s algorithm for finding a weak topological ordering of a directed graph which may contain cycles. This algorithm is a generalization of Tarjan''s algorithm for finding the strongly connected components of a directed graph. This report presents results from experiments with a fixpoint solver in the analysis framework for AKL (Agents Kernel Language, a concurrent constraint language developed at SICS) using the above ideas showing that a considerable speed-up (up to 3000%) can be achieved compared to that of a fixpoint solver based on strongly connected components. This is explained by showing how weak topological orders computed by Bourdoncle''s algorithm incorporate many intuitively good heuristics. The report also introduces partially argument independent functions, a class of functions particularly suited to the repetitive scheme of computations that arise in fixpoint computations. A function of this type needs to be re-evaluated only with respect to those of its arguments which have changed since its latest evaluation.
Random Early Marking: An Optimization Approach to Internet Congestion Control
Authors: David Lapsley, Steven Low
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

In this paper we present an optimization approach to congestion flow control. The initial context of this approach was as a rate based flow control in ATM networks. We describe techniques that enable us to implement this flow control in an Explicit Congestion Notification capable TCP/IP network. These techniques require only minimal changes to existing TCP host behavior, and RED active queue management routers. We call the collection of techniques Random Early Marking (REM). We present the results of a simulation study that looks at the dynamic behavior of REM and compares it to that of TCP-ECN with RED and Drop-Tail queue management. We also show how REM can be used to provide differential service between different users.
On Optimal Packetization of Embedded Bitstreams
Authors: Zixiang Xiong, Xiaolin Wu
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

We investigate the problem of packetizing multiple embedded bitstreams to improve the error resilience of source codes. We discuss various packetization schemes against packet erasure at both low and high bit rates. We formulate various versions of packetization of multiple embedded bitstreams for minimum distortion as discrete optimization problems, and propose efficient algorithms to compute globally optimal solutions to these problems.
Network connectivity of layered self-organizing wireless networks
Authors: C. Chao, T. Katura, M. Kisimoto, T. Ueda, T. Matukawa, H. Okada
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

This paper proposes a new organizing method for packet radio networks: layered self-organizing method. In the layered self-organizing network, a whole service area is divided into multiple sub-service areas and one base station is settled in each sub-service area. Base stations are connected to the backbone network, a high-speed wired network. A base station covering area is tuned to be less than a sub-service area. Mobile stations that stay in the outside area of a base station covering area are connected with one of the near base stations through several repeating mobile stations in a self-organized fashion. So a layered self-organizing wireless network can cover a wide area with fewer base stations than the conventional cellular networks. This paper evaluates the network connectivity by computer simulation and shows the effectiveness of the method. Furthermore, the paper presents an additional power-control protocol to obtain almost complete connectivity in the whole network.
Mechanization of a Proof of String-Preprocessing in Boyer-Moore's Pattern Matching Algorithm
Authors: Miloslav Besta, Frank Stomp
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

We report on a mechanization of a correctness proof ofa string-preprocessing algorithm. This preprocessing algorithmis employed in Boyer-Moore's pattern matching algorithm.The mechanization is carried out using the PVS system.The correctness proof being mechanized has been formulatedin Linear Time Temporal Logic. It consists of fourteenlemmata which are related to safety properties and twoadditional lemmata dealing with liveness properties. Theentire mechanization of the safety and liveness parts hasbeen completed. In this paper we mainly focus on mechanizationof the safety part. In a future paper we will addressour proof of the liveness part in more detail.
Hey, You Got Your Language In My Operating System!
Authors: Jon Howell, Mark Montague
Venue:  (1998)

Several projects in the operating systems research community suggest a trend of convergence among features once divided between operating systems and languages. We describe how partial evaluation and transformational programming systems apply to this trend by providing a general framework for application support, from compilation to run-time services. We contend that the community will no longer think of implementing a static collection of services and calling it an operating system; instead, this general framework will allow applications to be flexibly configured, and the ``operating system'''' will simply be the application support that is supplied at run-time.
Dynamics Associated with Classical Multi-degree-of-freedom Scattering Phenomena
Authors: Darin Beigie
Venue:  (1996)

We study the chaotic dynamics associated with classical near-integrable multi-degree-of-freedom Hamiltonian scattering systems whose unperturbed phase portraits contain separatrices in more than one degree of freedom. Though codimension-one complete barriers are generally absent, there exist codimension-one partial barriers formed by global stable and unstable manifolds emanating from codimension-two invariant sets of saddle-type stability. These manifolds form chaotic tangle boundaries and act as an invariant geometric template for studying transport, stretching, and mixing phenomena associated with the chaotic scattering dynamics. A codimension-one invariant manifold description of scattering dynamics follows from only a partial asymptotic freedom result, thus motivating new perspective on scattering dynamics in the limit of infinite separation distances. We numerically investigate phase space transport and diffusive spreading in a 3-degree-of-freedom multi-separatrix scattering problem defined by coupling two Morse oscillators and a linear oscillator. Particular attention is paid to the presence of more than one broken separatrix, resulting in transversely intersecting chaotic tangles in the 6D phase space. Each tangle is shown to increase chaotic diffusive spreading along, and to decrease chaotic transport across, the partial barrier of the other tangle. The presence of a broken separatrix in a given degree of freedom thus tends to enhance the chaotic dynamics in that degree of freedom and suppress chaotic dynamics in other degrees of freedom. 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
Efficient computation of end-to-end performance measures for multi-link ATM networks with multi-media traffic
Authors: Chih-Hsien Chou, E. Geraniotis
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

In this paper, we provide: (a) An efficient method for simplifying MMPP source models, which can be used to solve multi-media queueing problems with complicated aggregate input traffic. The effectiveness of the method is verified through numerical examples. (b) An approximation algorithm for analyzing multi-link queueing networks with MMPP traffic sources and arbitrary configurations. In this algorithm, a queueing network is analyzed by decomposing it into individual queues, each with an arrival rate appropriately reduced by the packet dropping occurred in other queues. Each queue is then solved individually by using the simplified source models of (a) while the interdependencies with the other queues are accounted for through this reduced-load approximation. Any desirable end-to-end performance measure characterizing the quality of service (QOS) of the multi-media traffic can be calculated in this manner. The results obtained by the algorithm have been compared with simulation results, and the observed relative error is satisfactory.
Establishment of a National Benchmark of Software Engineering Practices
Authors: Yingxu Wang, Hakan Wickberg, Alec Dorling, Minna Kaartinen
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

Software engineering process benchmarking is one of the important methodologies in software process assessment and improvement. In collaboration with IBM, IVF has conducted a Swedish national benchmarking survey to derive a national benchmark of software engineering practices in the Swedish software industry. This paper describes the design of the survey and the derivation of the national benchmark of software engineering practices. The Swedish national benchmark is contrasted with the IBM European benchmark. General findings of the survey are highlighted. A new benchmark-based software engineering process improvement approach is proposed for both the Swedish and international software development organisations for working smarter in software development and software project organisation.
Patterns in Geographic Data via Maximum Entropy Classification
Authors: Vladimir Estivill-Castro
Venue:  (1996)

Classification is a fundamental operation for data analysis and pattern discovery in Geopgraphical Information Systems. It consists of forming clusters from a large set of data values for presentation in choroplethic maps. Strategies based on a measure of diversity of the values within a class provide a quantitative measure of the quality of the classification but finding the classes requires $\Theta(n^3)$ time, where n is the number of data values. We propose the use of classification via the Maximum Entropy Discretization (MED) of the probability distribution that is being represented by the choroplethic map. MED is rigorously founded on information theory. We show that our approach results in a method for classification that allows the analyst to treat the data as univariate or as spatially related. Moreover, the algorithms requires only $O(n log n)$ time, and this requirement reduces to $O(n)$ time if the data is already sorted.
The Programming Language Declarative Ada Reference Manual
Authors: John Thornley
Venue:  (1993)

No Abstract.
Fault tolerant multiple observers using error control codes
Authors: G. Noubir, B. Y. Choueiry, H. J. Nussbaumer
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

We address the problem of detecting execution errors in communication protocols. A communication protocol is modeled as or finite state machine (FSM) that can be used as an external observer for detecting execution errors. Wang and Schwartz (1992, 1993) introduce the concept of multiple observers obtained by an adequate decomposition of the FSM. We first address the decomposition procedure from the perspective of error control codes and show that the decomposition algorithm can be restated as a simple state coding algorithm. Then, we discuss the features of fault tolerance of the resulting decomposition. We generalize the concept of multiple observers into the one of fault tolerant multiple observers. A set of observers is said to be fault tolerant if it is capable of detecting the execution errors of a protocol even when a subset of the observers is faulty. We show that error control codes can be used to generate multiple observers that are fault tolerant. We illustrate our approach on the ISO transport protocol class 4 (TP4). Finally, we give some hints on how to assign codes to the states while maximizing the fault coverage of the resulting decomposition.
A new finite difference method for a class of singular two-point boundary value problems
Authors: Manoj Kumar
Venue: Applied Mathematics and Computation (2003)

We present a new three-point finite difference method based on uniform mesh for a class of singular two-point boundary value problem: (xαy')' = f(x, y), y(0) = A, y(1) = B, 0 < α < 1.We show that the method, based on uniform mesh, provides O(h4)-convergent approximations. This method is illustrated by two numerical examples, one is linear and another is non-linear.
Modeling Multi-Valued Circuits in SystemC
Authors: Daniel Groβe, Görschwin Fey, Rolf Drechsler
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

The complexity of todays hardware systems steadily increases.Due to this fact new ways of efficiently describingsystems are investigated. A very promising approach in thisarea is SystemC which is a C++-library. To take advantageof SystemC in the multi-valued domain, the concept ofmulti-valued logic has to be embedded in SystemC.In this paper such a concept is introduced and detailsof the implementation are given. This creates a powerfuldevelopment environment to model and efficiently simulatecomplex multi-valued circuits and systems. Due to C++-concepts,like operator overloading and templates, the taskof modeling circuits becomes very convenient and handlingof multi-valued signals is elegant. This gives the opportunityto design large circuits that can be mapped onto physicallymulti-valued gates. A scalable arithmetic logic unit isstudied and experimental results are given.
Watermarking applications and their properties
Authors: Ingemar J. Cox, Matt L. Miller, Jeffrey A. Bloom
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

We describe a number of applications of digital watermarking and examine the common properties of robust-ness; tamper resistance, fidelity, computational cost and false positive rate. We observe that these properties vary greatly depending on the application. Consequently, we conclude that evaluation of a watermarking algorithm is difficult without first indicating the context in which it is to be applied.
Revisiting the Noise Figure Design Metric for Digital Communication Receiver
Authors: Won Namgoong, Jongrit Lerdworatawee
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

Noise figure is a commonly used system parameter thatquantifies the degradation in the signal-to-noise ratio(SNR) as the signal passes through a receiving system.Because of the difficulty in defining the SNR, NF dependson how the SNR is computed and the underlying assumptionsthat are made. Existing NF measures and theirshortcomings are explained. A new NF suitable for digitalcommunication receiver is proposed by redefining the SNR,so that the NF measures the degradation in the achievableperformance caused by the receiving system. The proposedNF, which we refer to as the effective NF, can be readilydetermined based on the existing NF measurementtechniques.
A triangular finite element for the study of the post-critical behaviour of shells
Authors: L. Corradi, N. Panzeri
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The numerical solution of the limit analysis problem has experienced a growing interest in recent years. Methods developed in this context can be employed also to obtain indications on the structural response subsequent to collapse, which is required in several situations, such as for shells employed as shock absorbers or energy dissipators. The procedure is known as sequential limit analysis and, as its name suggests, is based on a sequence of limit analysis solutions referring to progressively updated configurations. In this paper, the limit analysis procedure proposed in [6] is employed to this purpose in conjunction with the TRIC shell element developed by Argyris and coworkers in [16], which is modified to some extent to adapt to the rigid-plastic context. Some examples show the effectiveness and the accuracy of the method, which compares well with results obtained from complete, although computationally demanding, incremental elastic-plastic approaches.
A Family of Self-Repair SRAM Cores
Authors: A. Benso, S. Chiusano, G. Di Natale, P. Prinetto, Monica Lobetti Bodoni
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

In the present paper a family of BISR SRAM cores is proposed, characterized by a self-repair strategy performed On-line and without user intervention. Moreover, w.r.t. the BISR approaches presented so far, the proposed method is independent from the memory physical layout. In addition to the BISR architecture, to detect the faulty cells to be repaired, a complete set of test solutions is proposed, ranging from an external test to an On-line concurrent BIST.
The Requirement Set
Authors: Pat Ferdinandi
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

Three tools are proposed to assist Requirement Engineers in improving the overall quality of the requirement set. The Requirement Allocation Activity (RAA) is the activity that delegates the responsibility of the requirement development to the appropriate organization. The multi-dimensional Requirement Cube Model (RCM) is a tool that organizes and aligns all requirements to the corporate structure ensuring that all pertinent organizations are involved in the process. The RCM will assist in identifying gaps in the requirement set. Using the Requirement Set Quality Index (RSQI) will assist in documenting the possible financial impact these gaps may have on the final product. 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
Easy Microsoft Windows XP Home Edition, 2 edition
Authors: Shelley O'Hara, Kate Welsh
Venue:  (2003)

: Easy Windows XP Home is the perfect book for beginners who want to learn Windows XP and who prefer a visual, four-color approach. This book covers more than 150 of the most important tasks, ranging from simple features such as opening a folder, to more advanced topics such as installing new hardware or restoring a system.
Modeling Software Bidding Risks
Authors: Barbara Kitchenham
Venue: IEEE Transactions on Software Engineering (2003)

We discuss a method of developing a software bidding model that allows users to visualize the uncertainty involved in pricing decisions and make appropriate bid/no bid decisions. We present a generic bidding model developed using the modeling method. The model elements were identified after a review of bidding research in software and other industries. We describe the method we developed to validate our model and report the main results of our model validation, including the results of applying the model to four bidding scenarios.
Implementation of Informed Prefetching and Caching in Linux
Authors: Dorota M. Huizinga, Saurabh Desai
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper describes design and implementation of an application-aware Informed Prefetching and Caching (IPrC) system for Linux operating system. IPrC is a technique for improving application response time by exploiting I/O and computation parallelism. This proactive mechanism utilizes hints (application disclosed file access patterns) in order to pre-fetch the needed data blocks ahead of time and place them in the page cache. While well-studied in experimental systems IprC technology has not been transferred to commercial or widely used operating systems. We believe that our work is unique in that respect. We show that an implementation of the IPrC system in Linux is not only feasible but also extremely beneficial, especially for applications with non-sequential file access patterns. Our IPrC system is implemented by replacing the traditional read-ahead mechanism in the Linux kernel. The experiments conducted on a 60MHz Intel PC show execution time reduction of 15-39% for various testing scenarios.