ppxscal/embedding_network huggingface dataset:
Finite element analysis of an offshore pipeline buried in a porous seabed: effects of cover layer
Authors: D. S. Jeng, P. F. Postma
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

Considerable efforts have been devoted to the protection of submarine pipelines in recent years. To protect the buried pipeline from floatation, it is common to use a cover layer of coarser materials. However, most previous investigations have been limited to experimental approaches, rather than theoretical approaches. This paper presents the effects of a cover layer on the seabed response around a submarine pipeline through a finite element analysis. A two-dimensional finite element model established by the authors will be adopted in this study. The numerical results indicate that by varying the material present in the cover layer has significant influence on the wave-induced excess pore pressure.
Technical Report - Randomized Hough Transform: Improved Ellipse Detection with Comparison
Authors: Robert A. McLaughlin
Venue:  (1997)

We describe an algorithm for the detection of ellipse shapes in images, using the Randomized Hough Transform. The algorithm is compared to a standard implementation of the Hough Transform, and the Probabilistic Hough Transform. Tests are performed using both noise-free and noisy images, and several real-world images. The algorithm was found to give improvements in accuracy, and a reduction in computation time, memory requirements and the number of false alarms detected.
Separation Pair Detection
Authors: Donald S. Fussell, Ramakrishna Thurimella
Venue:  (1988)

A separation pair of a biconnected graph is a pair of vertices whose removal disconnects the graph. The central part of any algorithm that finds triconnected components is an algorithm for separation pairs. Recently Miller and Ramachandran have given a parallel algorithm that runs in O(log2n) time using O(m) processors. We present a new algorithm for finding all separation pairs of a biconnected graph that runs in O(logn) time using O(m) processors. A direct consequence is a test for triconnectivity of a graph within the same resource bounds.
Prospects for Automated Documentation Analysis in Support of Software Quality Assurance
Authors: James D. Arthur, Richard E. Nance, K. T Stevens
Venue:  (1988)

This report discusses the strengths and weaknesses of ADDS. ADDS is an automated document synthesis system that exploits the benefits of reverse engineering. Its generated documents are primarily used to support the maintenance activity. Based on the content and format of these reports, recommendations are made to improve the overall effectiveness of ADDS. These recommendations include the modifications/additions of reports and corresponding changes to ADDS.
Structure, tradition and possibility
Authors: Theodor Holm Nelson
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

Science is supposedly about reality, not about tradition, conventions or constructs. Yet computer science seems to me wrongly centered around two traditional, conventional constructs: the simulation of hierarchy and the simulation of paper.It is a popular myth that "structure" means hierarchy; and it is a popular conception that electronic documents should simulate paper. These two concepts have the additional advantage of being easy to explain to beginners. Accordingly, since the nineteen-forties we have simulated hierarchies to organize computer files, and since the nineteen-sixties we have progressively simulated paper -- from "text editing" to "word processing" to "desktop publishing" to the Web (which added one-way links to simulated sheets of paper). Now, merging hierarchy simulation with paper simulation, we have been given Adobe Acrobat (simultaneously simulating hierarchy and paper side by side) and XML (a system for transforming paper simulation into hierarchy and vice versa).I see these as ideological exercises in completing the hierarchy and paper paradigms, bypassing the vital issues. Rather than imitating the shortcomings of the real world, we should be correcting the insufficiencies of hierarchy and the deficiencies of paper. Things' being simple-minded and easy to explain does not make them sensible or right.
Using Gaussian Mixture Modeling in Speech Recognition
Authors: Yaxin Zhang, Mike Alder, Roberto Togneri
Venue:  (1994)

This paper describes a speaker-independent isolated word recognition system which uses a well known technique, the combination of vector quantization with hidden Markov modeling. The conventional vector quantization algorithm is substituted by a statistical clustering algorithm, the Expectation- Maximization algorithm, in this system. Based on the investigation of the data space, the phonemes were manually extracted from the training data and were used to generate the Gaussians in a code book in which each code word is a Gaussian rather than a centroid vector of the data class. The word based hidden Markov modeling then was performed. Two English isolated digits data base were investigated and the 12 Mel-spaced filter bank coefficients was employed as the input feature. Comparing the conventional discrete HMM, our system obtained significant improvement of recognition accuracy.
Using Gaussian Mixture Modeling for Phoneme Classification
Authors: Yaxin Zhang, Mike Alder, Roberto Togneri
Venue:  (1993)

Phoneme recognition is a key characteristic in large-vocabulary speech recognition system. The recent reports have shown that the accuracies of speaker-independent English phoneme recognition are around 60% while in the speaker-dependent case the recognition accuracies are under 70%. This paper describe a new method in which the Gaussian mixture modeling was employed for speaker-independent phoneme recognition. The Expectation-Maximization (EM) algorithm was used to generated the Gaissian mixture models (GMMs). Two English databases were used for both the system training and testing. The phonemes were manually extracted from 11 isolated digits (from zero to nine and oh). The testing results are higher than that of recent reports. Some related observations are also reported.
A Parallel Tree Contraction Algorithm
Authors: Karl Abrahamson, Norm Dadoun, David G. Kirkpatrick, Teresa M Przytycka
Venue:  (1987)

A simple reduction from the tree contraction problem to the list ranking problem is presented. The reduction takes O$(\log n)$ time for a tree with $n$ nodes, using O$(n / \log n)$ EREW processors. Thus tree contraction can be done as efficiently as list ranking. A broad class of parallel tree computations to which the tree contraction techniques apply is described. This subsumes earlier characterizations. Applications to the computation of certain properties of cographs are presented in some detail.
Modelling State in Mind and Machine
Authors: W. M. Beynon
Venue:  (1998)

This paper discusses and illustrates the application of Empirical Modelling (EM), as developed by the author and his collaborators, to computer programming. The discussion centres on the perspective EM gives on procedural and experiential vs. declarative and logical approaches to knowledge representation. The illustration focuses on demonstrating the potential for pedagogical use of EM in teaching algorithms. It is based on a family of practical models that have been developed to teach the principles of heapsort.
Preconditioned Iterative Methods for Homotopy Curve Tracking
Authors: Colin DeSa, Kashmira M. Irani, Calvin J. Ribbens, Layne T. Watson, Homer F. Walker
Venue:  (1991)

Homotopy algorithms are a class of methods for solving systems of nonlinear equations that are globally convergent with probability one. All homotopy algorithms are based on the construction of an appropriate homotopy map and then the tracking of a curve in the zero set of this homotopy map. The curve-tracking algorithms used here require the solution of a series of very special systems. In particular, each (n + 1) x (n + 1) system is in general nonsymmetric but has a leading symmetric indefinite n x n submatrix (typical of large structural mechanics problems, for example). Furthermore, the last row of each system may by chosen (almost) arbitrarily. The authors seek to take advantage of these special properties. The iterative methods studied here include Craig''s variant of the conjugate gradient algorithm and the SYMMLQ algorithm for symmetric indefinite problems. The effectiveness of various preconditioning strategies in this context are also investigated, and several choices for the last row of the systems to be solved are explored.
Updated Lagrangian formulation using ESA approach in large rotation problems of thin-walled beam-type structures
Authors: G. Turkalj, J. Brnic, J. Prpic-Orsic
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

In this work a non-linear analysis of beam-type structures with a thin-walled cross-section is presented. Using the updated Lagrangian incremental formulation, the assumption of isotropic and linear-elastic material behaviour and the non-linear displacement field of thin-walled cross-section based on inclusion of second order terms of large rotations, elastic and geometric stiffness matrices of a two-node space beam element are developed. Due to the non-linear displacement field, all internal moments occurring in the geometric stiffness are obtained as those of semitangential behaviour. In this way the joint equilibrium of non-collinear elements is provided. External stiffness approach is applied in the force recovery phase. The effectiveness of the presented numerical algorithm is validated through the test problem.
Expert Retrieval for Computer Message Systems
Authors: Edward A. Fox
Venue:  (1986)

This paper describes how information storage and retrieval (IS&R) and artificial intelligence (AI) methods can be integrated with modem computers and networks to provide access for broad classes of users to archives of electronic: mail, digests, and bulletin boards. A status report is given on the COmposite Document Expert/extended/effective Retrieval project, designed to employ communities of experts, operating on multiple communicating computers, for free text analysis, indexing, and retrieval. Details of the document-type expert are included to illustrate the approach.
A New Heap Game
Authors: A. S. Fraenkel, D. Zusman
Venue:  (1998)

Given k ? 3 heaps of tokens. The moves of the 2-player game introduced here are to either take a positive number of tokens from at most k-1 heaps, or to remove the same positive number of tokens from all the k heaps. We analyse this extension of Wythoff''s game and provide a polynomial-time strategy for it.
Improving Neural Net Convergence
Authors: Michael Alder, Sok G Lim, Paul Hadingham, Yianni Attikiouzel
Venue:  (1991)

This paper shows a certain equivalence between the 3-layer feed forward Back-Propagation neural network of Rumelhart et al and the committee net of Nilsson. This is used to produce an improvement in the performance of the former. It is found that (a) the epochs taken is reduced by a factor between 6 and 10, (b) the time taken is reduced by a factor of about 20 and (c) the net converges under conditions when the Back-Propagation algorithm is trapped in local minima and fails to converge. The theoretical gain comes from separating out the dynamic aspects of the corection alogorithm, which is much simpler to analyse than Back-Propagation. A similar simplification is applied to four layer nets, and similar results are obtained.
A Regression Model of a Swapping System
Authors: Samuel T. Chanson
Venue:  (1982)

This paper describes a measurement experiment performed on a PDP 11/45 system running under UNIX (version six) which employs swapping rather than paging in managing memory. Regression equations relating the system''s responsiveness to certain system and workload parameters are obtained. Sample applications such as predicting the system''s performance due to workload and system changes, load control as well as representing the swapping behaviour in simulation and analytic models are presented. The similarities between the paging and swapping dynamics are discussed. The paper also includes a brief discussion of the accuracy of the model as well as the advantages and disadvantages of the regression technique.
Progress Towards a World-Wide Code of Conduct
Authors: John A. N. Lee, Jacques Berleur
Venue:  (1995)

In this paper, the work of the International Federation for Information Processing (IFIP) Task Force on Ethics is described and the recommendations presented to the General Assembly are reviewed. While a common code of ethics or conduct has not been recommended for consideration by the member societies of IFIP, a set of guidelines for the establishment and evaluation of codes has been produced and procedures for the assistance of code development have been established within IFIP. This paper proposes that the data collected by the Task Force and the proposed guidelines can be used as a tool for the study of codes of practice providing a teachable, learnable educational module in courses related to the ethics of computing and computation, and looks at the next steps in bringing ethical awareness to the IT community.
A Comparison of PBDHMM and CHMM for Isolated Word Recognition
Authors: Yaxin Zhang, Chee W Loke, Roberto Togneri
Venue:  (1994)

Using phoneme-based Gaussian mixture as a VQ codebook in DHMM speech recognition system (PBDHMM) is an efficient way to improve the system performance. This paper compares the performances of PBDHMM system with that of the well known continuous HMM system for isolated word recognition task. The results shown that PBDHMM system obtained better results than CHMM system, especially for phoneme-distinct data.
Heuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machines
Authors: Tao Yang, Cong Fu
Venue:  (1996)

Many partitioned scientific programs can be modeled as iterative execution of computational tasks, represented by iterative task graphs (ITGs). In this paper, we consider the symbolic scheduling of ITGs on distributed memory architectures with nonzero communication overhead without searching the entire iteration space. An ITG may or may not have dependence cycles and we propose heuristic algorithms for mapping cyclic and acyclic ITGs, which incorporate techniques of software pipelining, graph unfolding, directed acyclic graph (DAG) scheduling and load balancing. We provide an analysis for computing near-optimal unfolding factors and comparing the performance of the proposed heuristic algorithms with the optimal solutions. We also study the stability of run-time performance when weights are not estimated accurately at compile-time. Our experiments study the scheduling performance of solving several scientific computing problems and analyze the effectiveness of optimization techniques used in our methods. We also present experimental results for mapping SOR-based iterative computation in solving sparse and banded matrix systems, and compare our approach with the multi-coloring method.
New Results for the Minimum Weight Triangulation Problem
Authors: Lenwood S. Heath, Sriram V. Pemmaraju
Venue:  (1992)

The current best polynomial time approximation algorithm produces a triangulation that can be O(log n) times the weight of the optimal triangulation. We propose an algorithm that triangulates a set P of n points in a plane in O(n3) time and that never does worse than the greedy triangulation. We investigate issues of local optimality pertaining to known triangulation algorithms and suggest an interesting new approach to studying triangulation algorithms. We restate the minimum weight triangulation problem as a graph problem and show the NP-hardness of a closely related graph problem. Finally, we show that the constrained problem of computing the minimum weight triangulation, given a set of points in a plane and enough edges to form a triangulation, is NP-hard. These results are an advance towards a proof that the minimum weight triangulation problem is NP-hard.
GENERAL GAME-PLAYING AND REINFORCEMENT LEARNING
Authors: Robert Levinson
Venue:  (1995)

This paper gives a blueprint for the development of a fully domain-independent single-agent and multi-agent heuristic search system. It gives a graph-theoretic representation of search problems based on conceptual graphs, and outlines two different learning systems. One, an ``informed learner," makes use of the the graph-theoretic definition of a search problem or game in playing and adapting to a game in the given environment. The other, a ``blind learner," is not given access to the rules of a domain, but must discover and then exploit the underlying mathematical structure of a given domain. Relevant work of others is referenced within the context of the blueprint. To illustrate further how one might go about creating general game-playing agents, we show how we can generalize the understanding obtained with the Morph chess system to all games involving the interactions of abstract mathematical relations. An example of a monitor for such domains is presented, along with an implementation of a blind and informed learning system known as MorphII. Performance results with MorphII are preliminary but encouraging and provide a few more data points with which to understand and evaluate the blueprint.
On the Covering Relaxation Approach for the 0-1 Positive Polynomial Programming Problem
Authors: Vaessen Willem
Venue:  (1980)

Covering relaxation algorithms were first developed by Granot et al for solving positive 0-1 polynomial programming (PP) problems which maximize a linear objective function in 0--1 variables subject to a set of polynomial inequalities containing only positive coefficients [``Covering Relaxation for Positive 0--1 Polynomial Programs'''', Management Science, Vol. 25, (1979)]. The covering relaxation approach appears to cope successfully with the non-linearity of the PP problem and is able to solve modest size (40 variables and 40 constraints) sparse PP problems. This thesis develops a more sophisticated covering relaxation method which accelerates the performance of this approach, especially when solving PP problems with many terms in a constraint. Both the original covering relaxation algorithm and the newly introduced accelerated algorithm are cutting plane algorithms in which the relaxed problem is the set covering problem and the cutting planes are linear covering constraints. In contrast with other cutting plane methods in integer programming, the accelerated covering relaxation algorithm developed in this thesis does not solve the relaxed problem to optimality after the introduction of the cutting plane constraints. Rather, the augmented relaxed problem is first solved approximately and only if the approximate solution is feasible to the PP problem is the relaxed problem solved to optimality. The promise of this approach stems from the excellent performance of approximate procedures for solving integer programming problems. Indeed, the extensive computational experiments that were performed show that the accelerated algorithm has reduced both the number of set covering problems to be solved and the overall time required to solve a PP problem. The improvements are particularly significant for PP problems with many terms in a constraint. 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
Architectural Support for Extensibility and Autonomy in Wide-Area Distributed Object Systems
Authors: Andrew S. Grimshaw, Michael J. Lewis, Adam J. Ferrari, John F. Karpovich
Venue:  (1998)

The Legion system defines a software architecture designed to support metacomputing, the use of large collections of heterogeneous computing resources distributed across local- and wide-area networks as a single, seamless virtual machine. Metasystems software must be extensible because no single system can meet all of the diverse, often conflicting, requirements of the entire present and future user community, nor can a system constructed today take best advantage of unanticipated future hardware advances. Metasystems software must also support complete site autonomy, as resource owners will not turn control of their resources (hosts, databases, devices, etc.) over to a dictatorial system. Legion is a metasystem designed to meet the challenges of managing and exploiting wide-area systems. The Legion virtual machine provides secure shared object and shared name spaces, application adjustable fault-tolerance, improved response time, and greater throughput. Legion tackles problems not solved by existing workstation-based parallel processing tools, such as fault-tolerance, wide-area parallel processing, interoperability, heterogeneity, security, efficient scheduling, and comprehensive resource management. This paper describes the Legion run-time architecture, focussing in particular on the critical issues of extensibility and site autonomy.
A Simple Proof Checker for Real-Time Systems
Authors: Catherine Leung
Venue:  (1995)

This thesis presents a practical approach to verifying real-time properties of VLSI designs. A simple proof checker with built-in decision procedures for linear programming and predicate calculus offers a pragmatic approach to verifying real-time systems in return for a slight loss of formal rigor when compared with traditional theorem provers. In this approach, an abstract data type represents the hypotheses, claim, and pending proof obligations at each step. A complete proof is a program that generates a proof state with the derived claim and no pending obligations. The user provides replacements for obligations and relies on the proof checker to validate the soundness of each operation. This design decision distinguishes the proof checker from traditional theorem provers, and enhances the view of ``proofs as programs''''. This approach makes proofs robust to incremental changes, and there are few ``surprises'''' when applying rewrite rules or decision procedures to proof obligations. A hand-written proof constructed to verify the timing correctness of a high bandwidth communication protocol was verified using this checker. 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
Entwicklung von Konzepten zur Integration RDBMS-basierter Anwendungen in CORBA-Umgebungen
Authors: Andreas Christiansen
Venue:  (1997)

Entwicklung von Konzepten zur Integration RDBMS-basierter Anwendungen in CORBA-Umgebungen 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