ppxscal/embedding_network huggingface dataset:
Planning in an Open-Textured Domain
Authors: Kate Sanders
Venue:  (1991)

Most work in artificial intelligence and law has concentrated on modeling the type of reasoning done by trial lawyers. In fact, most lawyers'' work involves planning --- for example, wills and trusts, real estate deals, and business mergers and acquisitions. Certain planning issues, such as the use of underspecified or ``open-textured'''' rules, are illustrated especially clearly in this domain. In this proposal, I set forth the characteristic features of planning in law, place it in the context of past artificial intelligence work in both law and planning, outline my approach to solving this problem, and describe CHIRON, a system I am developing to test my solution in the domain of personal income tax planning.
Pleiades: A Prototype of Inter-Processor Network Generation System
Authors: Kenji Sayano, Tomonori Shirakawa
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

The method that generates the static network of the dedicated parallel computer from the application program is proposed. And, it describes about the heuristic code-scheduling algorithm that becomes necessary for the generation of the network. Furthermore, it describes about the method of the dependency analysis that becomes necessary for the insertion of the data transfer instruction and the network generation. A network generation system was developed by this research based on the above algorithm. The simulator of the parallel computer was made, and the performance of the generated network and the parallelized program was estimated. It got 87.0-94.5% of the parallel processing efficiency with 32 processors when an experiment was made by using some sample programs. The validity of the generated network and the parallelized program was shown by these results.
Semi-Classical Theory of Laser Induced Circular Birefringence; Resonance; and Optical Activity in Scattered Radiation
Authors: M. W. Evans
Venue:  (1990)

The semi-classical theory of pump laser induced circular birefringence, spectral Zeeman type splitting, dichroism, and ellipticity is developed with reference to a novel technique called laser ESR and NMR. The theory, in terms of molecular property tensors and transition tensors, is also applied to Rayleigh/Raman optical activity in light scattered from a probe laser co axial with the pump. Optical rectification is shown to be the pump laser property responsible for these new effects, which parallel those due to static magnetic flux density B, and which are based on analogy with the inverse Faraday effect, the ability of a circularly polarised pump laser to induce magnetisation. The interaction hamiltonian is developed in terms of the conjugate product of the pump laser and a new fundamental atomic/molecular property called the electronic orbital/spin polarisability, an antisymmetric second rank polar tensor which transforms as a rank one axial vector analogous with the atomic/molecular magnetic dipole moment. It is shown that optical rectification in the pump laser produces, through the conjugate product, the complete range of effects customarily generated by B, including NMR and ESR, quantum Hall effect and so on.
Multicomputers
Authors: William C. Athas, Charles L. Seitz
Venue:  (1987)

This report outlines the history, current status, current developments, and plans for the message-passing concurrent computers, or multicomputers, developed in the Submicron Systems Architecture Project at Caltech. These systems include the Cosmic Cube and its commercial descendants, two second-generation cosmic cubes currently in development, and the Mosaic C, a fine grain multicomputer whose nodes are single VLSI chips. Section 1 introduces the physical architectures, with particular attention to the characteristics of the message-passing networks. Section 2 describes the programming environments for the first and second generation medium grain size "cubes." Section 3 describes a fine grain concurrent object-oriented programming notation called Cantor, which currently runs on cubes and sequential systems, and which will be used for application programming of the Mosaic C.
Bicephal Reinforcement Learning
Authors: Frederic Maire
Venue:  (2000)

Reinforcement learning systems learn by trial-and-error a policy (a mapping from states to actions) while interacting with an environment that provides feedback in the form of reinforcement signals (reward/penalty). The long-term objective of the learning system is to maximize the discounted return (a weighted sum of the reinforcement signals received). It is widely acknowledged that to be of use in complex domains, reinforcement learning techniques must be combined with generalizing function approximators such as neural networks. We describe a method suitable for control tasks which require continuous actions, in response to continuous states. The key idea is to use two coupled neural networks that evolve together to learn a policy and the advantage of this policy. We demonstrate the validity of the algorithm on a control task
Movie Maps
Authors: Heimo Müller, Ed Tan
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper presents methods for moving image sequence visualization and browsing based on algorithms from computer vision, information visualization and on a hierarchical model for content semantics. We introduce a new method, OM-Images, for the visualization of temporal changes in a moving image sequence. Together with interactive browsing techniques the visualization methods can be used for the exploration of a movie at different levels of abstraction. The proposed levels of abstraction are the physical, image, object or discourse level. The visualization is used to generate 1) static descriptions, which printed on paper yield a "movie book" and 2) interactive documents, e.g. web pages or special movie browsers. Finally, we give examples of a movie book of a feature length film.
Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
Authors: Nick A. Howgrave-Graham, Phong Q. Nguyen, Igor E. Shparlinski
Venue: Mathematics of Computation (2003)

We consider a generalisation of the hidden number problem recently introduced by Boneh and Venkatesan. The initial problem can be stated as follows: recover a number a ∈ Fp such that for many known random t ∈ Fp approximations to the values of ⌊at⌋p are known. Here we study a version of the problem where the "multipliers" t are not known but rather certain approximations to them are given. We present a probabilistic polynomial time solution when the error is small enough, and we show that the problem cannot be solved if the error is sufficiently large. We apply the result to the bit security of "timed-release crypto" introduced by Rivest, Shamir and Wagner, to noisy exponentiation black-boxes and to the bit security of the "inverse" exponentiation. We also show that it implies a certain bit security result for Weil pairing on elliptic curves.
Binary Trees (v. 2.1 -- September 25, 1985)
Authors: John Glenn
Venue:  (1986)

Binary Tree is a program that uses animation to illustrate insertion, deletion and searching of nodes in a binary search tree. Pre-order, in-order, and post-order tree walks are supported. Binary Tree can also perform a recursive descent parse of arithmetic expressions and show the resulting abstract syntax tree. Lisa Pascal source and application available on a single-sided, MFS format microdisk. 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
ASSO: A Formal Methodology of Conceptual Database Design
Authors: Elvira Locuratolo, Brian Matthews
Venue:  (1999)

ASSO is a formal methodology of conceptual database design which provides both an innovative mechanism for structuring specification and refinement approach for deriving efficient implementation. A relationship holds between ASSO and B, a highly developed formal method of software engineering currently promoted for commercial use. In this paper, we propose two conceptual views of the ASSO model in terms of B abstract machines and the ASSO refinement as a process to transform the conceptual model of ASSO into a schema composed of all and only disjoint abstract machines. This description can be usefully exploited for designing an ASSO-toolkit based on a support tool for B which exploits the conceptual features of ASSO to increase design quality.
Serial ATA Storage Architecture and Applications: Designing High-Performance, Cost-Effective I/O Solutions
Authors: Knut Grimsrud, Hubbert Smith
Venue:  (2003)

:Written for systems engineers, architects, and product managers involved in the planning process for a transition to Serial ATA, this book will contribute to a better understanding of this new interconnect technology. Answered are questions such as why make the change, what problems does serial ATA solve, what potential problems could Serial ATA create and how can they be avoided, and how to transition systems from Parallel ATA or SCSI to Serial ATA. Topics include PHY signaling and interface states, protocol encoding, programming model, flow control, performance, legacy compatibility, enclosure management, signal routing, hot=plug, presence detect, and cable/connector standards. Insights are also provided on the goals driving the Serial ATA standard development, the advantages Serial ATA provides for OEMs, IHVs, and -users, and how to design and build real-world systems that use Serial ATA.Author Biography: Knut Grimsrud is the Intel principal engineer for definition of Serial ATA 1.0 and Serial ATA II. He was the technical working group chairman during the Serial ATA 1.0 definition effort and continues to be Intel's technical lead for ongoing Serial ATA definition work. Knut holds a PhD in electrical and computer engineering. During his nine years with Intel, Knut has led design work on storage architecture and performance in both the server and the desktop market segments. Hubbert Smith is a Program Manager with Intel's Platform Networking Group, where he specializes in producing Serial ATA-related building blocks. He currently serves as the chairman of the Serial ATA II cable/connector focus group and has contributed many of the Serial ATA II Use Cases. Hubbert has more than 15 years professional experience with technology related to servers and storage.
Aster: A Corba-based Software Interconnection System Supporting Distributed System Customization.
Authors: Valerie Issarny, Christophe Bidan
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

This paper introduces the Aster distributed composition-based programming system that is aimed at easing the development of distributed runtime systems, customized to the application needs, in a Corba-based environment. Our approach is based on high-level customization: given the specification of application requirements through the Aster composition language, a distributed runtime system, customized for meeting these requirements is built. Furthermore, the fact that the Aster system is based on the Corba standard for distributed computing enhances the potential of re-use of both application-level and system-level software.
Exploring and using qualitative data
Authors: Susan M. Dray, David A. Siegel
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Ethnographic and other field research methods have become increasingly popular. Learn how to gather, analyse and apply qualitative field data using a variety of tools. Apply to software evaluation to identity modifications needed.
A database management system to document and analyse construction claims
Authors: Sheikh Sabah Jaber Ali Al-Sabah, Sami M. Fereig, David J. Hoare
Venue: Advances in Engineering Software (2003)

A Microsoft Access database management system is presented. This was developed to document and analyse claims for additional payment and time for completion on construction projects. Although the database was developed to facilitate the determination of the bases, causes and underlying management issues behind construction claims in Kuwait, the system has wide applicability and its unified methodology would be appropriate for monitoring construction claims on live projects. The database was tested on field data from eight completed construction projects.
Clarifying Mixture Theory and the Macroscale Chemical Potential
Authors: Lynn S Bennethum, Marcio A. Murad, John H. Cushman
Venue:  (1996)

Hybrid mixture theory, HMT, consists of classical mixture theory applied to a multiphase system with volume averaged field equations. HMT is applicable to a multi-phase mixture in which the characteristic length of each phase is "small" relative to the extent of the mixture. A porous body is the canonical model of a system to which HMT is applicable. When a phase contains $N$ constituents, the linearized fluxes derived through HMT are historically expressed relative to the $N$th constituent, e.g.\ Fick''s law for the $j$th species is expressed in terms of a gradient of the $j$th chemical potential relative to the $N$th. This is in contrast to classical Gibbsian thermodynamics, which gives rise to results of similar form, but with absolute (non-relative) driving forces. Here we modify HMT to construct results which are completely analogous to Gibbsian thermodynamics. This is accomplished by modifying the way the entropy inequality is exploited and by re-examining the definition of the averaged chemical potential of a constituent and the averaged Gibbs energy of a phase. Particular emphasis is placed on the relations between the scalar chemical potential of Gibbs and the tensorial chemical potential of Bowen. Previous HMT results gave rise to an averaged chemical potential that may experience a jump between the solid and fluid phases at equilibrium; a result in clear contrast to Gibbsian theories. This discontinuity in the potential is due to an "effective" external field (e.g.\ the effective stress induced by a load in the solid phase). A notable consequence of the approach proposed herein is a HMT chemical potential in complete analogy with the Gibbsian chemical potential.
Procedure Calls Are the Assembly Language of Software Interconnection: Connectors Deserve First-Class Status
Authors: Mary Shaw
Venue:  (1994)

Software designers compose systems from components written in some programming language. They regularly describe systems using abstract patterns and sophisticated relations among components. However, the configuration tools at their disposal restrict them to composition mechanisms directly supported by the programming language. To remedy this lack of expressiveness, we must elevate the relations among components to first-class entities of the system, entitled to their own specifications and abstractions.
Application of artificial neural networks to tidal forecasting
Authors: D. S. Jeng, T. L. Lee, K. J. Hsu
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

An accurate tidal forecast is an important task in determining constructions and human activities in ocean environments. Conventional tidal forecasting has based on harmonic analysis using the least squares method to determine harmonic parameters. However, a large amount of harmonic constants are required for the accurate prediction of a long-term tidal level with harmonic analysis. Unlike conventional harmonic analysis, this paper presents an artificial neural network (ANN) model for forecasting tidal-level using the short term measuring data. The ANN model can easily decide the harmonic constants by learning the input-output interrelation of the short-term tidal records. A case study with the data at Tanshui Harbour (in Northern Taiwan) is considered to test the performance of the proposed model. The numerical results indicate that the hourly tidal levels over a long duration can be predicted using a short-term hourly tidal record.
Reliability Analysis of Clustered Computing Systems
Authors: Veena B. Mendiratta
Venue: Proceedings of the The Ninth International Symposium on Software Reliability Engineering (1998)

Clustered computing systems, using commercially available computers networked in a loosely-coupled fashion, can provide high levels of reliability if appropriate levels of error detection and recovery software are implemented in the middleware and application layers. In this paper we present a modeling approach for analyzing the hardware and software reliability of clustered computing systems. The clustered system is modeled as an irreducible Markov chain with working and failed states, and intermediate recovery states. The failure and recovery behavior is characterized in terms of the frequency and duration of fault recoveries and outages for a single processor in the cluster and for the entire clustered system. We apply the model to a telecommunication switching system application that uses the Lucent Technologies Reliable Clustered Computing product. The model results are presented for a range of values of the processor failure rate and the fault recovery coverage factor.
Flexible and Robust CIM Architecture Using Distributed Objects
Authors: Tomotaka Yano, Ken Ohara, Toru Kuwahara, Satoshi Matsumoto, Hitachi, Ltd, Qiusheng Xie, Hirobumi Fukuoka, Inc. QualiTech
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

This paper describes the system architecture of a successful CIM(Computer Integrated Manufacturing) system built for TFT manufacturing lines, which is adaptable to rapidly changing business environment. The unique features of the system include the dynamic load balancing and dynamic function distribution among several application servers using distributed objects. Each application server acts as an autonomous decentralized system. Yet the system provides the end users with a view of totally integrated single application. The system is flexible because it is easy to change or add new functions without shutting down the whole system. It is also robust since the functions are assigned to the server dynamically by considering the availability and load of the servers. The system has been running online for mass production in 24-hour by 7-day mode continuously for more than a year.
Software Measurement Data Analysis Using Memory-Based Reasoning
Authors: Raymond A. Paul, Farokh B. Bastani, Venkata U. B. Challagulla, I-Ling Yen
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

The goal of accurate software measurement data analysis is to increase the understanding and improvement of software development process together with increased product quality and reliability. Several techniques have been proposed to enhance the reliability prediction of software systems using the stored measurement data, but no single method has proved to be completely effective. One of the critical parameters for software prediction systems is the sizeof the measurement data set, with large data sets providing better reliability estimates. In this paper, we propose a software defect classification method that allows defect data from multiple projects and multiple independent vendors to be combined together to obtain large data sets. We also show that once a sufficient amount of information has been collected, the Memory-Based Reasoning technique can be applied to projects that are not in the analysis set to predict their reliabilities and guide their testing process. Finally, the result of applying this approach to the analysis of defect data generated from fault-injection simulation is presented.
Informal Proof Analysis Towards Testing Enhancement
Authors: Guillaume Lussier, Hélène Waeselynck
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

This paper aims at verifying properties of generic fault-tolerancealgorithms. Our goal is to enhance the testingprocess with information extracted from the proof of the algorithm,whether this proof is formal or informal: ideally,testing is intended to focus on the weak parts of the proof(e.g., unproved lemmas or doubtful informal evidence). Weuse the Fault-Tolerant Rate Monotonic Scheduling algorithmas a case study. This algorithm was proven by informaldemonstration, but two faults were revealed afterwards.In this paper, we focus on the analysis of the informal proof,which we restructure in a semiformal proof tree based onnatural deduction. From this proof tree, we extract severalfunctional cases and use them for testing a prototype of thealgorithm. Experimental results show that a flawed informalproof does not necessarily provide relevant informationfor testing. It remains to investigate whether formal (partial)proofs allow better connection with potential faults.
Response to "Comments on 'Formal Methods Application: An Empirical Tale of Software Development'"
Authors: Ann E. Kelley Sobel, Michael R. Clarkson
Venue: IEEE Transactions on Software Engineering (2003)

We respond to criticism by D. Berry and W. Tichy of our paper that appeared in the March 2002 issue of IEEE Transactions on Software Engineering. Many of the supposed faults they identify in our experiment are a result of a misunderstanding on their part, while others are inherent aspects of an educational experiment. We present counterarguments that explain why our experiment is valid.
Process synchronization without long-term interlock
Authors: William B. Easton
Venue: ACM SIGOPS Operating Systems Review (1972)

A technique is presented for replacing long-term interlocking of shared data by the possible repetition of unprivileged code in case a version number (associated with the shared data) has been changed by another process. Four principles of operating system architecture (which have desirable effects on the intrinsic reliability of a system) are presented; implementation of a system adhering to these principles requires that long-term lockout be avoided.
An Analysis of the Burrows-Wheeler Transform
Authors: Giovanni Manzini
Venue:  (1999)

The Burrows-Wheeler Transform (also known as Block-Sorting) is at the base of compression algorithms which are the state of the art in lossless data compression. In this paper we analyze two algorithms which use this technique. The first one is the original algorithm described by Burrows and Wheeler, which, despite its simplicity, outperforms the gzip compressor. The second one uses an additional run-length encoding step to improve compression. We prove that the compression ratio of both algorithms can be bounded in terms of the k-th order empirical entropy of the input string for any k<0. We make no assumptions on the input and we obtain bounds which hold in the worst case, that is, for every possible input string. All previous results for Block-Sorting algorithms were concerned with the average compression ratio and have been established assuming that the input comes from a finite-order Markov source.
On Adaptable Support for Cooperative Work
Authors: Mads Dam
Venue:  (1994)

A critical dimension in the handling of change in computer-based systems for cooperative work is whether mechanisms for change should be explicitly embedded into systems, or whether change should be handled in a global and uniform manner, for instance by a process of editing and recompiling programs or scripts on the fly. We argue that to reflect the structure of organisations, powers of change must be local, structured, and dynamic. Thus a global and uniform handling of change is in general insufficient. We propose a formal basis for the description of dynamically modifiable objects, and explore its applicability in the field of CSCW by exposing it to three examples of increasing complexity: A system for dynamic communication channel creation; an adaptable conversation manager; and a rudimentary, yet quite general, awareness model.