ppxscal/embedding_network huggingface dataset:
The ideal method of using digital data in highway construction works: from design to administration
Authors: M. Yamasaki, T. Hongou, Y. Chiba
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

As the policy has been changed from land construction to land management and the construction CALS/EC has been improved, advanced information management is required in road construction works as well. The road administration information to be managed includes the information of the road at the stages of planning and design, the structure and configuration of the constructed road, the conditions and quality when undergoing construction, traffic services for the users, and the information of repair and improvement. These kinds of information should be shared and utilised throughout the life cycle and is to be more detailed as the road construction works progress. In this study, the road data model is discussed for utilising integrally the CAD data, which is the base of the road information management, and the corresponding attribute data.
WBCSim: A Prototype Problem Solving Environment for Wood-Based Composites Simulations
Authors: Goel A., Phanouriou C., Kamke F. A., Ribbens C. J., Shaffer C. A., Watson L. T.
Venue:  (1998)

This paper describes a computing environment named WBCSim that is intended to increase the productivity of wood scientists conducting research on wood-based composite materials. WBCSim integrates Fortran 77-based simulation codes with a graphical front end, an optimization tool, and a visualization tool. WBCSim serves as a prototype for the design, construction, and evaluation of larger scale problem solving (computing) environments. Several different wood-based composite material simulations are supported. A detailed description of the prototype''s software architecture and a typical scenario of use are presented. The system converts output from the simulations to the Virtual Reality Modeling Language (VRML) for visualizing simulation results.
Federating Heterogeneous Workflow Systems
Authors: Andreas Geppert, Markus Kradolfer, Dimitrios Tombros
Venue:  (1998)

Heterogeneous workflow management systems often have to cooperate in order to execute inter-organizational or inter-departmental processes, i.e., processes that involve more than one enterprise/department. The problem of workflow interoperability is aggravated by the fact that the autonomy of participating workflow management systems has to be preserved. In this paper, we present an approach towards workflow interoperability that allows to specify and execute workflows over a federation of heterogeneous workflow management systems. This approach is based on a global repository to which members can export workflow types they define or from which they can import external types as subworkflows. On the software architecture level, we show how workflow system federations can be modeled in such a way that the glue needed for interoperability is reusable and leveraged to a more abstract level than the usually applied technique of point-to-point cooperation based on APIs.
What Price Replication?
Authors: M. L. Liu, D. Agrawal, A. E Abbadi
Venue:  (1994)

Replicated data is employed in distributed databases to enhance data availability. However, the benefit of data availability is only realized at the cost of elaborate algorithms which hide the underlying complexity of maintaining multiple copies of a single data item. The concern about the performance impact of replica control is part of the reasons why replication, although extensively researched, has yet to receive wide acceptance in practice. This paper makes use of a simulation model to explore the performance tradeoffs of data replication.
COPING WITH MEMORY LATENCY
Authors: Dirk Coldewey
Venue:  (1997)

The widening gap between microprocessor speeds and DRAM has spawned a number of approaches for tolerating the resulting latency of memory accesses. Four common approaches are software controlled prefetching, multi-threading, non-blocking loads, and relaxed consistency models. Most of these methods have been evaluated only on array based codes, although prefetching has also shown to be effective for instruction cache prefetching in operating system codes that have been hand-optimized for cache performance. Many of these methods suffer from considerable runtime overhead, scalability issues, or only work well for a small problem domain. This thesis proposes to show that a method of code transformation to support a combination of prefetching and coarse-grain multithreading can significantly reduce the effects of memory latency with less runtime overhead than currently proposed forms of prefetching, yet that performs well for both array-based codes as well as a broad class of pointer-based data structures found in commercial applications.
Exchanging geotechnical data through the world wide web
Authors: D. G. Toll, A. C. Cubitt
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper describes the development of GeotechML, a mark-up language for representing geotechnical data on the web. GeotechML is a version of XML (Extensible Mark-up Language) specifically targeted at geotechnical engineering. The representation of geotechnical entities such as dams, retaining walls and foundations is presented. Stylesheets and Java applications have been developed to display the data graphically within a web browser. GeotechML will make it possible to search all geotechnical data available on the web. It is suggested that the World Wide Web will become an international repository of geotechnical information, avoiding the need to establish national or international geotechnical databases.
FLIC - a Functional Language Intermediate Code
Authors: Simon L. Peyton Jones, M. S. Joy
Venue:  (1990)

FLIC is a Functional Language Intermediate Code, intended to provide a common intermediate language between diverse implementations of functional languages, including parallel ones. This paper gives a formal definition of FLIC''s syntax and semantics, in the hope that its existence may encourage greater exchange of programs and benchmarks between research groups.
Appraising Fairness in Languages for Distributed Programming
Authors: Krzysztof R. Apt, Nissim Francez, Shmuel Katz
Venue:  (1988)

The relations among various languages and models for distributed computation and various possible definitions of fairness are considered. Natural semantic criteria are presented which an acceptable notion of fairness should satisfy. These are then used to demonstrate differences among the basic models, the added power of the fairness notion, and the sensitivity of the fairness notion to irrelevant semantic interleavings of independent operations. These results are used to show that from the considerable variety of commonly used possibilities, only strong process fairness is appropriate for CSP if these criteria are adopted. We also show that under these criteria, none of the commonly used notions of fairness are fully acceptable for a model with an n-way synchronization mechanism. The notion of fairness most often mentioned for Ada is shown to be fully acceptable. For a model with nonblocking send operations, some variants of common fairness definitions are appraised, and two are shown to satisfy the suggested criteria.
On Weak Circular Squares in Binary Words
Authors: A. S. Fraenkel, J. Simpson
Venue:  (1996)

A weak square in a binary word is a pair of adjacent nonempty blocks of the same length, having the same number of 1s. A weak circular square is a weak square which is possibly wrapped around the word: the tail protruding from the right end of the word reappears at the left end. Two weak circular squares are equivalent if they have the same length and contain the same number of ones. We prove that the longest word with only k inequivalent weak circular squares contains 4k+2 bits and has the form (01)2k+1 or its complement. Possible connections to tandem repeats in the human genome are pointed out.
Comparison of Unix Communication Facilities Used In Linda
Authors: Chuck Schumann, Kenneth D. Landry, James D. Arthur
Venue:  (1992)

This report presents the results of an investigative effort that focuses on a first step toward providing a distributed framework for Linda system processes. In particular, we discuss the restructuring of the kernel "process" to support Tuple Space access through UNIX socket calls, rather than through shared memory primitives based on semaphore usage. A description of the restructured system and the rationale for such restructuring is presented first. Most intriguing, however, are the latter sections that discuss the ramifications and insights gained from our particular approach to system redesign, i.e., the unnecessary serialization of Tuple Space access, redundant memory copies, being victimized by the UNIX scheduler.
SFL: A Parallel Simulation Program for Banyan Networks
Authors: Dong W. Kim, G. J Lipovski, Roy M. Jenevein
Venue:  (1988)

We evaluate the performance of double- and single-ended regular CC-and SW-banyan networks by simulation. First, we give concrete system level switch models for double- and single-ended banyan networks. Next, we introduce a powerful simulation program called SFL. SFL (Spread, Fanout, and Level) is a parallel time-driven simulation program for packet-switching synchronous banyan networks. SFL provides users with a three dimensional design space. The first dimension provides a choice of either a CC- or an SW-banyan network. The second dimension provides a choice of tuples (spread, fanout, level). The last dimension provides a choice of three communication protocols: DES (Double-Ended Simplex), SEFD (Single-Ended Full Duplex), or SEHD (Single-Ended Half Duplex). Finally, our simulation results show that single-ended CC-banyan networks can be excellent interconnection networks for multiprocessor systems.
DESCRIPTIVE COMPLEXITY OF #P FUNCTIONS
Authors: Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur
Venue:  (1992)

We give a logic based framework for defining counting problems and show that it exactly captures the problems in Valiant''s counting class #P. We study the expressive power of the framework under natural syntactic restrictions and show that some of the subclasses obtained in this way contain problems in #P with interesting computational properties. In particular, using syntactic conditions, we isolate a class of polynomial time computable #P problems, and also a class in which every problem is approximable by a polynomial time randomized algorithm. These results set the foundation for further study of the descriptive complexity of the class #P. In contrast, we show, under reasonable complexity theoretic assumptions, that it is an undecidable problem to tell if a counting problem expressed in our framework is polynomial time computable or is approximable by a randomized polynomial time algorithm. Finally, we discuss some open problems which arise naturally from this work.
HOW TO USE EXPERT ADVICE
Authors: Nicolo Cesa-Bianchi, Yoav Freund, David Helmbold, David Haussler, Robert Schapire, Manfred Warmuth
Venue:  (1995)

We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called `experts''. Our analysis is for worst-case situations, i.e., we make no assumptions about the way the sequence of bits to be predicted is generated. We measure the performance of the algorithm by the difference between the expected number of mistakes it makes on the bit sequence and the expected number of mistakes made by the best expert on this sequence, where the expectation is taken with respect to the randomization in the predictions. We show that the minimum achievable difference is on the order of the square root of the number of mistakes of the best expert, and we give efficient algorithms that achieve this. Our upper and lower bounds have matching leading constants in most cases. We then show how this leads to certain kinds of pattern recognition/learning algorithms with performance bounds that improve on the best results currently known in this context. We also extend our analysis to the case in which log loss is used instead of the expected number of mistakes.
Directed Simulations
Authors: N. Kurtonina, M. de Rijke
Venue:  (1996)

Although negation-free languages are widely used in logic and computer science, relatively little is known about their expressive power. To address this issue we consider a kind of non-symmetric bisimulations called directed simulations, and use these to analyze the expressive power and model theory of negation-free modal and temporal languages. We first use them to obtain preservation, safety and definability results for a simple negation-free modal language. We then obtain analogour results for stronger negation-free languages. Finally, we extend our methods to deal with languages with non-boolean negation.
A Parallel Object-Oriented Framework for Stencil Algorithms
Authors: John F. Karpovich, Matthew Judd, W. T Strayer, Andrew S. Grimshaw
Venue:  (1993)

We present an object-oriented framework for constructing parallel implementations of stencil algorithms. This framework simplifies the development process by encapsulating the common aspects of stencil algorithms in a base stencil class so that application-specific derived classes can be easily defined via inheritance and overloading. In addition, the stencil base class contains mechanisms for parallel execution. The result is a high-performance, parallel, application-specific stencil class. We present the design rationale for the base class and illustrate the derivation process by defining two sub-classes, an image convolution class and a PDE solver. The classes have been implemented in Mentat, an object-oriented parallel programming system that is available on a variety of platforms. Performance results are given for a network of Sun SPARCstation IPCs.
Enumerating the Strings of a Regular Expression
Authors: Panagiotis Manolios
Venue:  (2001)

We present a Haskell solution to the problem of enumerating the strings of a regular expression with respect to a regular preorder, a term we soon define. A version of this problem was considered in a note by Jayadev Misra. We have generalized the problem. The use of Haskell was suggested by Edsger W. Dijkstra and our solution makes critical use of Haskell''s lazy evaluation.
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Authors: Steve Geffner, Divyakanth Agrawal, Amr El Abbadi, Terry Smith
Venue:  (1999)

Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions. Many application domains require that information provided by analysis tools be current or "near-current." Existing techniques for range sum queries on data cubes, however, can incur update costs on the order of the size of the data cube. Since the size of a data cube is exponential in the number of its dimensions, rebuilding the entire data cube can be very costly. We present an approach that achieves constant time range sum queries while constraining update costs. Our method reduces the overall complexity of the range sum problem.
A Real-Time 3D Motion Tracking System
Authors: Kam Johnny Wai Yee
Venue:  (1993)

Vision allows one to react to rapid changes in the surrounding environment. The ability of animals to control their eye movements and follow a moving target has always been a focus in biological research. The biological control system that governs the eye movements is known as the oculomotor control system. Generally, the control of eye movements to follow a moving visual target is known as gaze control. The primary goal of motion tracking is to keep an object of interest, generally known as the visual target, in the view of the observer at all time. Tracking can be driven by changes perceived from the real world. One obvious change introduced by a moving object is the change in its location, which can be described in terms of displacement. In this project, we will show that by using stereo disparity and optical flow, two significant types of displacements, as the major source of directing signals in a robotic gaze control system, we can determine where the moving object is located and perform the tracking duty, without recognizing what the object is. The recent advances in computer hardware, exemplified by our Datacube MaxVideo 200 system and a network of Transputers, make it possible to perform image processing operations at video rates, and to implement real-time systems with input images obtained from video cameras. The main purposes of this project are to establish some simple control theories to monitor changes perceived in the real world, and to apply such theories in the implementation of a real-time three-dimensional motion tracking system on a binocular camera head system installed in the Laboratory for Computational Intelligence (LCI) at the Department of Computer Science of the University of British Columbia (UBC). The control scheme of our motion tracking system is based on the Perception-Reasoning-Action (PRA) regime. We will describe an approach of using an active monitoring process together with a process for accumulating temporal data to allow different hardware components running at different rates to communicate and cooperate in a real-time system working on real world data. We will also describe a cancellation method to reduce the unstable effects of background optical flow generated from ego-motion, and create a ``pop-out'''' effect in the motion field to ease the burden of target selection. The results of various experiments conducted, and the difficulties of tracking without any knowledge of the world and the objects will also be discussed. 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
DETECTING DATA RACES BY ANALYZING SEQUENTIAL TRACES
Authors: David P. Helmbold, Charles E. McDowell, Jian Wang
Venue:  (1990)

One of the fundamental problems encountered when debugging a parallel program is determining the potential race conditions in the program. A race condition exists when multiple tasks access shared data in an unconstrained order and at least one of the accesses is a write operation. The program''s behavior can be unpredictable when race conditions are present. This paper describes techniques which automatically detect data races in parallel programs by analyzing program traces. We view a program execution as a partial ordering of events, and define which executions are consistent with a given trace. In general, it is not possible to determine which of the consistent executions occurred. Therefore we introduce the notion of ``safe orderings'''' between events which are guaranteed to hold in every execution which is consistent with the trace. The main result of the paper is a series of algorithms which determine many of the ``safe orderings''''. An algorithm is also presented to distinguish unordered sequential events from concurrent events. A working trace analyzer has been implemented. The trace analyzer can report various data races in parallel programs by finding unordered pairs ofevents and variable access conflicts.
Failure of Interpolation in Combined Modal Logics
Authors: M. Marx, C. Areces
Venue:  (1997)

We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer of interpolation. The same holds for combinations by taking unions, a generalisation of Humberstone''s inaccessibility logic. Viewing first order logic as a product of modal logics, we derive a strong counterexample for failure of interpolation in the finite variable fragments of first order logic. We provide a simple condition stated only in terms of frames and bisimulations which implies failure of interpolation. It''s use is exemplified in a wide range of cases.
Heavy-Tailed Behaviour in Randomised Systematic Search Algorithms for SAT?
Authors: Holger H. Hoos
Venue:  (1999)

Prompted by recent results reported by Carla Gomes, Bart Selman, and Henry Kautz, and in the context of my ongoing project with Thomas Stuetzle on characterising the behaviour of state-of-the-art algorithms for SAT, I measured some run-time distributions for Satz-Rand, the randomised version of the Satz algorithm, when applied to problem instances from various domains. I could not find truly heavy-tailed behaviour (in the sense of the definition used by Carla Gomes et.al.). Instead, I found evidence for multimodal distributions which might be characterisable using mixtures of the generalised exponential distributions introduced in (Hoos, 1999). However, the observed RTDs typically have long tails and random restart, using suitable cutoff times, increases the efficiency of the algorithm, as claimed by Gomes et.al. Furthermore, taking another look at the issue of heavy tails at the left-hand side of run-time distributions, I raise some questions regarding the arguments found in (Gomes et.al., 2000).
Affine Approximation of Lipschitz Functions and Nonlinear Quotients
Authors: S. Bates, W. B. Johnson, J. Lindenstrauss, D. Preiss, G. Schechtman
Venue:  (1999)

New concepts related to approximating a Lipschitz function between Banach spaces by affine functions are introduced. Results which clarify when such approximations are possible are proved and in some cases a complete characterization of the spaces X, Y for which any Lipschitz function from X to Y can be so approximated is obtained. This is applied to the study of Lipschitz and uniform quotient mappings between Banach spaces. It is proved, in particular, that an Banach space which is a uniform quotient of Lp, 1 > p > Y, is already isomorphic to a linear quotient of Lp.
Dynamic analysis of a steam turbine support structure
Authors: V. Karthigeyan, G. K. V. Prakhya, K. Vekaria
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The paper presents a method of Finite Element (FE) modelling of a table top steam turbine support structure on piles for the purpose of dynamic analysis. The modelling accommodates machine-structure and soil-structure interaction. The soil stiffness and damping matrices required for the dynamic analysis are judiciously selected in order to capture all relevant modes. Differences between the frequencies and amplitudes obtained by conventional models and Finite Element (FE) models were observed and reasons discussed. The results revealed that the frequencies in flexure modes are close to the machine speeds and can never be detected using conventional methods.