ppxscal/embedding_network huggingface dataset:
Social integration of people with disabilities: the development of an information technology model based on personal growth and achievement (abstract and introduction)
Authors: John A. M. Earls
Venue: Issue 52-53 (November 1995) (1995)

This research examines the use of a computer bulletin board as a means of facilitating the social integration of people with disabilities.The literature review identifies significant parallel research strands in the- Social Integration of People with Disabilities- Social Psychology of Information Technology.To develop a model which draws these important strands together three groups interact using a computer bulletin board. The groups are people with disabilities, tertiary computing students and speech and occupational therapists. The study conducts pre, post and long term attitude tests, collects data via the operating system, records all textual data generated over a three month period (almost 6000 pages) and ultimately carries out longitudinal case studies with the disabled participants.The short term (three months) attitude changes are inconclusive, but the longer term (two year) changes show a highly significant improvement in the attitude of people with disabilities who participated. The case studies showed that all participants with disabilities had improved their self image, their confidence and had made identifiable integrative gains. These included becoming politically active, living independently, gaining employment for over fifty percent of those involved, publishing literary works and taking up further study. In addition the clearly demonstrated benefits evoked very positive changes in their peer group, in structural changes within the organisation, in Federal Government Department of Community Services and Health service delivery and in the provision of an "Access Australia" innovative award to the Redcliffe City Municipal Library.Grounded Theory was used to identify a range of factors which supported or inhibited the Integrative process.The study demonstrated the value of integrating the two research streams, the benefits of the process (with minimal disadvantages) and the efficacy of the model. A significant issue emerging was the need for people with disabilities to be empowered, able to make their own choices and develop their own models. As a consequence the study concluded by outlining relevant areas of suggested future development in the mainstream and producing a skeletal model as a basis for future integrative work involving the participants themselves.
A mobile user location update and paging mechanism under delay constraints
Authors: Ian F. Akyildiz, Joseph S. M. Ho
Venue: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication (1995)

A mobile user location management mechanism is introduced that incorporates a distance based location update scheme and a paging mechanism that satisfies predefined delay requirements. An analytical model is developed which captures the mobility and call arrival pattern of a terminal. Given the respective costs for location update and terminal paging, the average total location update and terminal paging cost is determined. An iterative algorithm is then used to determine the optimal location update threshold distance that results in the minimum cost. Analytical results are also obtained to demonstrate the relative cost incurred by the proposed mechanism under various delay requirements.
Industrial applications of distributed AI
Authors: B. Chaib-draa
Venue: Communications of the ACM (1995)

Most work done in distributed artificial intelligence (DAI) had targeted sensory networks, including air traffic control, urban traffic control, and robotic systems. The main reason is that these applications necessitate distributed interpretation and distributed planning by means of intelligent sensors. Planning includes not only the activities to be undertaken, but also the use of material and cognitive resources to accomplish interpretation tasks and planning tasks. These application areas are also characterized by a natural distribution of sensors and receivers in space. In other words, the sensory data-interpretation tasks and action planning are inter-dependent in time and space. For example, in air traffic control, a plan for guiding an aircraft must be coordinated with the plans of other nearby aircraft to avoid collisions.
SAOOSS: a system for the analysis of object-oriented software systems
Authors: Rosemary Mazhindu, Lydia Kronsjo
Venue: ACM SIGPLAN OOPS Messenger (1995)

This paper reports on a research work towards the development of a System for Analysis of Object-Oriented Software Systems(SAOOSS). SAOOSS is to consist of a set of tools for a statical analysis of inheritance relationships of a given syntactically correct object-oriented software system against a set of design guidelines for well formed hierarchies. The aim of the analysis is to enable the user to gain a global understanding of the software system's inheritance structure, and to provide guidelines for a proper use of inheritance in system development.The theory of our research is based on a set of rules for well formed object-oriented based hierarchies developed by Rebecca Wirfs-Brock, Lauren Wiener and Brian Wilkerson, [1]. Rosemary Mazhindu has developed a logical extension to the work of Rebecca Wirfs-Brock, Lauren Wiener and Brian Wilkerson and this work, reported here, has formed the theoretical basis of SAOOSS.Although the theoretical basis of the research has evolved from studying a number of object-oriented languages, our aim is to develop the software system which will analyse programs and software written in C++.
Extending the scope of PAC-Amodeus to cooperative systems
Authors: Daniel Salber, Laurence Nigay, Joëlle Coutaz
Venue: ACM SIGOIS Bulletin (1995)

Software tools for tile construction of interactive systems such as user interface toolkits, application skeletons, and user interface generators, alleviate the activity of programming but do not eliminate software architecture modelling. For example, the "callback" mechanism made popular by X-Window, does not enforce the distinction between domain-specific concepts and presentation-specific issues. Without a framework for prescribing the appropriate usage of callbacks, the software designer may develop an interactive system that cannot be maintained nor modified. Cooperative systems, which draw upon a wide variety of tools, techniques, and constraints, make architecture modelling even more crucial.In order to reason about software modelling for cooperative systems, we first need to clarify the nature of the problem space. The role of a problem space is to identify the set of concepts relevant to a particular domain of interest and to organize these concepts into a framework suitable for rising the appropriate questions, for clarifying the scope of the solution space, or for characterizing a particular design solution. The litterature reveals a wide variety of issues related to CSCW but these concepts are not organized in a way that supports software architecture modelling. We claim that one goal of the workshop is to define a problem space useful for reasoning about software architecture and use this framework as foundations for comparing, devising, and assessing current and future architecture models.In section 2, we present a draft proposal of the problem space for the software design of cooperative systems. In section 3, we describe PAC-Amodeus, our own conceptual architecture model, and show how it can support the issues made explicit in our problem space.
Implementing deductive databases by mixed integer programming
Authors: Colin Bell, Anil Nerode, Raymond T. Ng, V. S. Subrahmanian
Venue: ACM Transactions on Database Systems (TODS) (1996)

Existing and past generations of Prolog compilers have left deduction to run-time and this may account for the poor run-time performance of existing Prolog systems. Our work tries to minimize run-time deduction by shifting the deductive process to compile-time. In addition, we offer an alternative inferencing procedure based on translating logic to mixed integer programming. This makes available for research and implementation in deductive databases, all the theorems, algorithms, and software packages developed by the operations research community over the past 50 years. The method keeps the same query language as for disjunctive deductive databases, only the inferencing procedure changes. The language is purely declarative, independent of the order of rules in the program, and independent of the order in which literals occur in clause bodies. The technique avoids Prolog's problem of infinite looping. It saves run-time by doing primary inferencing at compile-time. Furthermore, it is incremental in nature. The first half of this article translates disjunctive clauses, integrity constraints, and database facts into Boolean equations, and develops procedures to use mixed integer programming methods to compute equations, and develops procedures to use mixed integer programming methods to compute equations, and develops procedures to use mixed integer programming methods to compute equations, and develops procedures to use mixed integer programming methods to compute&mdash;least models of definite deductive databases, and&mdash;minimal models and the Generalized Closed World Assumption of disjunctive databases.
Random I/O scheduling in online tertiary storage systems
Authors: Bruce K. Hillyer, Avi Silberschatz
Venue: Proceedings of the 1996 ACM SIGMOD international conference on Management of data (1996)

New database applications that require the storage and retrieval of many terabytes of data are reaching the limits for disk-based storage systems, in terms of both cost and scalability. These limits provide a strong incentive for the development of databases that augment disk storage with technologies better suited to large volumes of data. In particular, the seamless incorporation of tape storage into database systems would be of great value. Tape storage is two orders of magnitude more efficient than disk in terms of cost per terabyte and physical volume per terabyte; however, a key problem is that the random access latency of tape is three to four orders of magnitude slower than disk. Thus, to incorporate a tape bulk store in an online storage system, the problem of tape access latency must be solved. One approach to reducing the latency is careful I/O scheduling. The focus of this paper is on efficient random I/O scheduling for tape drives that use a serpentine track layout, such as the Quantum DLT and the IBM 3480 and 3590. For serpentine tape, I/O scheduling is problematic because of the complex relationships between logical block numbers, their physical positions on tape, and the time required for tape positioning between these physical positions. The results in this paper show that our scheduling schemes provide a significant improvement in the latency of random access to serpentine tape.
Computer science: the emergence of a discipline
Authors: John E. Hopcroft
Venue: Communications of the ACM (1987)

The continued rapid development of computer science will require an expansion of the science base and an influx of talented new researchers. Computers have already altered the way we think and live; now they will begin to elevate our knowledge of the world.
Specifying dynamic support for collaborative work within WORLDS
Authors: William J. Tolone, Simon M. Kaplan, Geraldine Fitzpatrick
Venue: Proceedings of conference on Organizational computing systems (1995)

In this paper, we present a specification language developed for WORLDS, a next generation computer-supported collaborative work system. Our specification language, called Introspect, employs a meta-level architecture to allow run-time modifications to specifications. We believe such an architecture is essential to WORLDS' ability to provide dynamic support for collaborative work in an elegant fashion.
HCSM: a framework for behavior and scenario control in virtual environments
Authors: James Cremer, Joseph Kearney, Yiannis Papelis
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (1995)

This paper presents HCSM, a framework for behavior and scenario control based on communicating hierarchical, concurrent state machines. We specify the structure and an operational execution model of HCSM's state machines. Without providing formal semantics, we provide enough detail to implement the state machines and an execution engine to run them. HCSM explicitly marries the reactive (or logical) portion of system behavior with the control activities that produce the behavior. HCSM state machines contain activity functions that produce outputs each time a machine is executed. An activity function's output value is computed as a function of accessible external data and the outputs of lower-level state machines. We show how this enables HCSM to model behaviors that involve attending to multiple concurrent concerns and arbitrating between conflicting demands for limited resources. The execution algorithm is free of order dependencies that cause robustness and stability problems in behavior modeling. In addition, we examine the problems of populating virtual environments with autonomous agents exhibiting interesting behavior and of authoring scenarios involving such agents. We argue that HCSM is well suited for modeling the reactive behavior of autonomous agents and for directing such agents to produce desired situations. We demonstrate use of HCSM for modeling vehicle behavior and orchestrating scenarios in the Iowa Driving Simulator, an immersive real-time virtual driving environment.
Agnostic PAC learning of functions on analog neural nets
Authors: Wolfgang Maass
Venue: Neural Computation (1995)

We consider learning on multilayer neural nets with piecewise polynomial activation functions and a fixed number k of numerical inputs. We exhibit arbitrarily large network architectures for which efficient and provably successful learning algorithms exist in the rather realistic refinement of Valiant's model for probably approximately correct learning ("PAC learning") where no a priori assumptions are required about the "target function" (agnostic learning), arbitrary noise is permitted in the training sample, and the target outputs as well as the network outputs may be arbitrary reals. The number of computation steps of the learning algorithm LEARN that we construct is bounded by a polynomial in the bit-length n of the fixed number of input variables, in the bound s for the allowed bit-length of weights, in 1/&epsilon;, where &epsilon; is some arbitrary given bound for the true error of the neural net after training, and in 1/&delta; where &delta; is some arbitrary given bound for the probability that the learning algorithm fails for a randomly drawn training sample. However, the computation time of LEARN is exponential in the number of weights of the considered network architecture, and therefore only of interest for neural nets of small size. This article provides details to the previously published extended abstract (Maass 1994).
The treatment of state in optimistic systems
Authors: David Bruce
Venue: ACM SIGSIM Simulation Digest (1995)

Optimistic computation methods typically save copies of objects' state information, so that they can recover from erroneous &ldquo;over-optimistic&rdquo; computations. Such state saving is generally time and space consuming, and can be rather complicated both to implement and to use.I show how the data structure community's theory of persistence can be used not only to analyse and explain the treatment of state in optimistic systems, but also as a simple yet general mechanism for performing the necessary state saving with minimal impact on application code.Preliminary results based on a benchmark application and an existing optimistic simulator are presented, showing that providing support for fully general object states is a realistic and practical option. In addition, I show how some existing state saving techniques&mdash;including support for shared state&mdash;can be derived, and discuss a number of ways in which the model might be extended.
Three logics for branching bisimulation
Authors: Rocco De Nicola, Frits Vaandrager
Venue: Journal of the ACM (JACM) (1995)

Three temporal logics are introduced that induce on labeled transition systems the same identifications as branching bisimulation, a behavioral equivalence that aims at ignoring invisible transitions while preserving the branching structure of systems. The first logic is an extension of Hennessy-Milner Logic with an &ldquo;until&rdquo; operator. The second one is another extension of Hennessy-Milner Logic, which exploits the power of backward modalities. The third logic is CTL* without the next-time operator. A relevant side-effect of the last characterization is that it sets a bridge between the state- and action-based approaches to the semantics of concurrent systems.
An Extension of Pontryagin's Principle for State-Constrained Optimal Control of Semilinear Elliptic Equations and Variational Inequalities
Authors: Frederic Bonnans, Eduardo Casas
Venue: SIAM Journal on Control and Optimization (1995)

This paper deals with state-constrained optimal control problems governed by semilinear elliptic equations or variational inequalities. By using Ekeland's principle, a minimum principle of Pontryagin's type under some stability conditions of the optimal cost with respect to the state constraints is derived.
Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
Authors: Chunguang Sun
Venue: SIAM Journal on Scientific Computing (1996)

In this paper, we propose a new parallel multifrontal algorithm for the orthogonal factorization of large sparse matrices on distributed-memory multiprocessors. We explore the use of block partitioning schemes in parallel sparse orthogonal factorization. Our block-oriented parallel algorithm for sparse orthogonal factorization achieves high performance by incurring strictly less communication overhead than the conventional nonblock algorithm, maintaining relatively balanced load distribution among processors, and accelerating the parallel numerical kernel via increased cache utilization. We analyze the performance of our parallel algorithm and present its arithmetic and communication complexities for regular grid problems. We report the experimental results of an implementation of our parallel algorithm on an Intel iPSC/860 machine. Through our theoretical analysis and experimental results, we demonstrate that our new block-oriented algorithm outperforms the conventional nonblock algorithm impressively.
Ethical concepts and information technology
Authors: Kenneth C. Laudon
Venue: Communications of the ACM (1995)

The fundamental aspects of classical and contemporary ethics, particularly as they apply to the use of IT, offer valuable lessons of professional conduct.
Adaptive parallel aggregation algorithms
Authors: Ambuj Shatdal, Jeffrey F. Naughton
Venue: Proceedings of the 1995 ACM SIGMOD international conference on Management of data (1995)

Aggregation and duplicate removal are common in SQL queries. However, in the parallel query processing literature, aggregate processing has received surprisingly little attention; furthermore, for each of the traditional parallel aggregation algorithms, there is a range of grouping selectivities where the algorithm performs poorly. In this work, we propose new algorithms that dynamically adapt, at query evaluation time, in response to observed grouping selectivities. Performance analysis via analytical modeling and an implementation on a workstation-cluster shows that the proposed algorithms are able to perform well for all grouping selectivities. Finally, we study the effect of data skew and show that for certain data sets the proposed algorithms can even outperform the best of traditional approaches.
Asymptotical Study of Parameter Tracking Algorithms
Authors: Bernard Delyon, Anatoli Juditsky
Venue: SIAM Journal on Control and Optimization (1995)

This paper addresses the problem of tracking random drifting parameters of a linear regression system. The asymptotic properties of several estimation algorithms in the limit of slow drift are studied. The basic tool is the central limit theorem for a class of stochastic difference equations established under weak conditions on disturbances and observations. The estimates of the rate of convergence obtained in the paper allow the asymptotically optimal algorithms to be developed.
A Domain Decomposition Method for First-OrderPDEs
Authors: Lina Hemmingsson
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

In this report a nonoverlapping domain decomposition method to solve first-order, time-dependent partial differential equations is developed. The time discretization used is implicit, which gives a large system of equations to solve for each time step. Preconditioners with a fast inversion based on a fast modified sine transform are defined. Theoretical analysis of the method is presented, indicating that the ratio in the grid might be crucial for the convergence. Finally numerical results from a parallel implementation on an Intel Paragon are presented, showing very nice properties. Especially a nonuniform decomposition of the domain leads to very good results.
Principal Submatrices, Geometric Multiplicities, and Structured Eigenvectors
Authors: Charles R. Johnson, Brenda K. Kroschel
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

It is a straightforward matrix calculation that if $\lambda$ is an eigenvalue of $A,x$ an associated eigenvector and $\alpha$ the set of positions in which $x$ has nonzero entries, then $\lambda$ is also an eigenvalue of the submatrix of $A$ that lies in the rows and columns indexed by $\alpha$. A converse is presented that is the most general possible in terms of the data we use. Several corollaries are obtained by applying the main result to normal and Hermitian matrices. These corollaries lead to results concerning the case of equality in the interlacing inequalities for Hermitian matrices, and to the problem of the relationship among eigenvalue multiplicities in various principal submatrices.
The Extended Linear Complementarity Problem
Authors: O. L. Mangasarian, J. S. Pang
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the bilinear objective function under a monotonicity assumption, the polyhedrality of the solution set of a monotone XLCP, and an error bound result for a nondegenerate XLCP. We also present a finite, sequential linear programming algorithm for solving the nonmonotone XLCP.
Applications of slack neighborhood graphs to timing driven optimization problems in FPGAs
Authors: Anmol Mathur, K. C. Chen, C. L. Liu
Venue: Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays (1995)

In this paper we examine three different problems related to FPGA placement: timing driven placement of a technology mapped circuit, timing driven reconfiguration for yield enhancement and fault tolerance in FPGAs and timing driven design re-engineering for FPGAs. We show that timing driven relocation which transforms an infeasible placement into a feasible one is a key problem the solution of which will lead to good algorithms for all three of these optimization problems. We introduce the concept of a slack neighborhood graph (SNG) as a general tool for timing driven relocation of modules in an infeasible placement with a bounded increase in critical path delay. The slack neighborhood graph approach provides a unified approach to the solution of three timing driven optimization problems of interest in this paper.