ppxscal/embedding_network huggingface dataset:
Dynamic Query-Based Debugging
Authors: Raimondas Lencevicius, Urs Hoelzle, Ambuj K. Singh
Venue:  (1999)

Program errors are hard to find because of the cause-effect gap between the time when an error occurs and the time when the error becomes apparent to the programmer. Although debugging techniques such as conditional and data breakpoints help to find error causes in simple cases, they fail to effectively bridge the cause-effect gap in many situations. Dynamic query-based debuggers offer programmers an effective tool that provides instant error alert by continuously checking inter-object relationships while the debugged program is running. To speed up dynamic query evaluation, our debugger (implemented in portable Java) uses a combination of program instrumentation, load-time code generation, query optimization, and incremental reevaluation. Experiments and a query cost model show that selection queries are efficient in most cases, while more costly join queries are practical when query evaluations are infrequent or query domains are small.
A Schedulable Utilization Bound for Aperiodic Tasks
Authors: Tarek F. Abdelzaher
Venue:  (2000)

In this report, we derive a utilization bound on schedulability of apriodic tasks with arbitrary arrival times, execution times, and deadlines. To the author''s knowledge, this is the first time a utilization bound is derived for the aperiodic task model. It allows constructing an O(1) admission test for aperiodic tasks. Earlier admission tests are at best O(n). We show that deadline-monotonic scheduling is the optimal fixed-priority scheduling policy for aperiodic tasks in the sense of maximizing the schedulable utilization bound. We prove that the optimal bound is 5/8. Our result is an extension of the well-known Liu and Layland''s bound of ln 2 (derived for periodic tasks). The new bound is shown to be tight. We briefly generalize our results to tasks with multiple resource requirements and multiple processors. Dynamic priority scheduling (EDF) of aperiodic tasks is shown to have the same schedulability bound as for periodic tasks. Our findings are especially useful for an emerging category of soft real-time applications, such as online trading and e-commerce, where task (request) arrival times are arbitrary, task service times are unknown, and service has to be performed within a given deadline. Our result provides theoretical grounds for guaranteeing deadlines of individual aperiodic requests by observing only the aggregate utilization conditions which simplifies achieving real-time assurances in such applications.
On Reading Sketch Maps
Authors: A. K. Mackworth
Venue:  (1977)

A computer program, named MAPSEE, for interpreting maps sketched freehand on a graphical data tablet is described. The emphasis in the program is on discovering cues that invoke descriptive models which capture the requisite cartographic and geographic knowledge. A model interprets ambiguously the local environment of a cue. By resolving these interpretations using a new network consistency algorithm for n-ary relations, MAPSEE achieves an interpretation of the map. It is demonstrated that this approach can be made viable even though the map cannot initially be properly segmented. A thoroughly conservative, initial, partial segmentation is described. The effects of its necessary deficiencies on the interpretation process are shown. The ways in which the interpretation can refine the segmentation are indicated.
Superlinear Bounds for Matrix Searching Problems
Authors: Maria M. Klawe
Venue:  (1990)

Matrix searching in classes of totally monotone partial matrices has many applications in computer science, operations research, and other areas. This paper gives the first superlinear bound for matrix searching in classes of totally monotone partial matrices, and also contains some new upper bounds for a class with applications in computational geometry and dynamic programming. \n The precise results of this paper are as follows. We show that any algorithm for finding row maxima or minima in totally monotone partial $2n \times n$ matrices with the property that the non-blank entries in each column form a contiguous segment, can be forced to evaluate $\Omega (n \alpha (n))$ entries of the matrix in order to find the row maxima or minima, where $\alpha (n)$ denotes the very slowly growing inverse of Ackermann''s function. A similar result is obtained for $n \times 2n$ matrices with contiguous non-blank segments in each row. The lower bounds are proved by introducing the concept of an independence set in a partial matrix and showing that any matrix searching algorithm for these types of partial matrices can be forced to evaluate every element in the independence set. A result involving lower bounds for Davenport-Schinzel sequences is then used to construct an independence set of size $\Omega (n \alpha (n))$ in the matrices of size $2n \times n$ and $n \times 2n$. \n We also give two algorithms to find row maxima and minima in totally monotone partial $n \times m$ matrices with the property that the non-blank entries in each column form a contiguous segment ending at the bottom row. The first algorithm evaluates at most $O (m \alpha (n) + n)$ entries of the skyline matrix and performs at most that many comparisons, but may have $O (m \alpha (n) \log \log n+ n)$ total running time. The second algorithm is simpler and has $O (m \log \log n+ n)$ total running time. \n A preliminary version of this paper appeared in the Proceedings of the First ACM/SIAM Symposium on Discrete Algorithms, 1990. The research in this paper was partially supported by an NSERC Operating Grant.
Anticipating and Mitigating The Professional Challenge to Independent Verification and Validation
Authors: Dabney James B., Arthur James D.
Venue:  (1998)

Independent Verification and Validation faces three classes of challenges: the Technical Challenge, the Management Challenge, and the Professional Challenge. In this paper we focus on the Professional Challenge, and, in particular, the four phases that characterize it: Denial, Anger, Cooperation and Dependence. We believe that to implement an effective IV&V effort, one must understand the relationship among the phases and the critical issues underlying them. For each of the phases we (a) provide a characteristic description, (b) discuss how they affect the IV&V effort, (c) present representative issues and examples, and (d) describe steps to reduce the adverse impact of the three detrimental phases. The examples provided are those we have encountered while serving in an IV&V capacity; "lessons learned" guide our suggestions for addressing phase-specific issues.
Drag-and-Drop vs. Point-and-Click Mouse Interaction for Children
Authors: Kori Inkpen, Kellogg S. Booth, Maria Klawe
Venue:  (1996)

This paper presents the results of a study on girls'' and boys'' usage of two common mouse interaction techniques. The two techniques, drag-and-drop and point-and-click, were compared to determine whether one method was superior to the other in terms of speed, error rate, and preference. For girls, significant differences between the two methods were found for speed, error rate and preference. Point-and-click was faster, fewer errors were committed, and it was preferred over drag-and-drop. For boys, a significant difference was found for speed but not for error rate or preference. Point-and-click was faster than drag-and-drop, the errors rates were comparable and, although more boys preferred point-and-click, the difference was not significant.
The Probabilistic Neural Network APplied to the Detection of Sheep and Goat Rumination and Eating Phases: A Preliminary Study
Authors: Anthony Zaknich, Yianni Attikiouzel
Venue:  (1991)

Abstract unavailable.
Uniform Quotient Mappings of the Plane
Authors: W. B. Johnson, J. Lindenstrauss, D. Preiss, G. Schechtman
Venue:  (1999)

It is shown that if f is a mapping of the plane onto itself that is uniformly continuous with modulus of continuity W(r) which is o(Or) as r\rarrow 0 and f is also co-uniformly continuous then f = P?h where h is a homeomorphism of the plane and P is a complex polynomial. The same conclusion holds also under other assumptions on the moduli of uniform and co-uniform continuity. However, we also present an example showing that this does not hold for all uniform quotient mappings: There is a mapping of the plane onto itself whose moduli of uniform and co-uniform continuity are both of power type but it maps an interval to zero. We also discuss uniform quotient mappings of the plane onto the line.
Efficient Construction of Binary Trees with Almost Optimal Weighted Path Length
Authors: David G. Kirkpatrick, Teresa M Przytycka
Venue:  (1989)

We present sequential and parallel algorithms to construct binary trees with almost optimal weighted path length. Specifically, assuming that weights are normalized (to sum up to one) and error refers to the (absolute) difference between the weighted path length of a given tree and the optimal tree with the same weights, we present: an $O(\log n)$ time and \n\( n \frac{\log \log n}{\log n} \)EREW processor algorithm which constructs a tree with error less than 0.172; an $O(k \log n \log^{*} n)$ time and $n^{2}$ CREW processor algorithm which produces a tree with error at most $ \frac{1}{n^{k}} $, and an $O(k^{2} \log n) $ time and $n^{2}$ CREW processor algorithm which produces a tree \n\nwith error at most $\frac{1}{n^{k}} $ As well, we present two sequential algorithms: an $O(kn)$ time algorithm which produces a tree with error at most $\frac{1}{n^{2^{k}}}$ and $O(kn)$ time algorithm which produces a tree with error at most $ \frac{1}{2^{n^{2^{k}}}} $ .The last two algorithms use different computation models.
Validation, Verification, and Testing Techniques Throughout the Life Cycle of a Simulation Study
Authors: Osman Balci
Venue:  (1994)

Life cycle validation, verification, and testing (VV&T) is extremely important for the success of a simulation study. This paper surveys current software VV&T techniques and current simulation model VV&T techniques and describes how they can all be applied throughout the life cycle of a simulation study. The processes and credibility assessment stages of the life cycle are described and the applicability of the VV&T techniques for each stage is stated. A glossary is provided to explicitly define important terms and VV&T techniques.
A Transformational Approach to Specifying Recovery in Asynchronous Communicating Systems
Authors: Zhiming Liu, M. Joseph
Venue:  (1992)

This paper describes how the transformational framework developed in [Liu91, LJ92] is applied to backward error-recovery in asynchronous communicating systems. A physical fault is modelled as an atomic action which performs state transformations in the same way as any other program action. The possible effects of a set of faults on the execution of a program are described by a transformation of the program into its fault-affected version. Fault-tolerance is provided by using transformations to add recovery actions to a non-fault-tolerant program, so that the fault-affected version of the transformed program will then satisfy a required specification. Refinement transformations can be used in the development of a fault-tolerant program. This paper provides a feasible and formal way to consider existing backward recovery techniques in terms of simple transformations. Keywords: transformations, faults, checkpoints, recovery propagation.
Saturation Estimation in Interactive Computer Systems
Authors: Samuel T. Chanson
Venue:  (1979)

This paper presents a systematic method for estimating the saturation point of interactive computer systems in an environment of incomplete information (in particular, where per interaction information is unavailable). This method is an improvement over the ad hoc and time-consuming iterative approach commonly used. Following an operational analysis approach and using only commonly available data, a simple model was constructed to estimate the mean response time of a task characterized by its CPU and i/o requests running in a given system CPU, disk, drum and channel load factors. The systems saturation point is obtained from the model using a modified version of the method first proposed by Kleinrock. The interesting concept that tasks with different resource demands experience different saturation loads is discussed. It is shown that the saturation loads as seen by different tasks vary only slightly as the characteristics of the tasks change. The method has been applied on an IBM 370/168 running under the Michigan Terminal System at the University of British Columbia.
Static and Dynamic Software Quality Metric Tools
Authors: Kevin A. Mayo, Steven A. Wake, Sallie M. Henry
Venue:  (1990)

The ability to detect and predict poor software quality is of major importance to software engineers, managers, and quality assurance organizations. Poor software quality leads to increased development costs and expensive maintenance. With so much attention on exacerbated budgetary constraints, a viable alternative is necessary. Software quality metrics are designed for this purpose. Metrics measure aspects of code or PDL representations, and can be collected and used throughout the life cycle [RAMC85].
An Algorithmic Approach to Odor Communication and Reproduction,
Authors: D. Harel, L. Carmel, D. Lancet
Venue:  (2001)

The possibility of transferring electronic odor information has constantly fascinated people, but faces severe difficulties in implementation due to the evasive, bio-chemical nature of smell. We propose an algorithmic scheme that allows for communication and synthesis of olfactory information. It enables an output device, the whiffer, to release an imitation of an odor read in by a remote input device, the sniffer, upon command. There are numerous applications for such a scheme, and we are currently at work more closely investigating and implementing its various parts.
Geotechnical parameter prediction from large data sets
Authors: I. Davey-Wilson
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

Geotechnical laboratory testing of soils produce two main categories of results: soil identification parameters and soil behaviour parameters. The behaviour parameters will be similar for similar types of soil. From a large database of geotechnical test results it is likely that a knowledge of the soil identification parameters will imply a certain range of behaviour parameters for a similar soil. Numerous geotechnical laboratory test results have been reported in the literature or are held at testing laboratories and could be used for database population and analysis. The aim of this work was to develop a computer system to estimate unknown soil parameters from known test results. The system incorporates an inference mechanism based on similarity functions.
Illumination Networks: Fast Realistic Rendering with Arbitrary ReflectanceFunctions
Authors: Chris Buckalew, Donald S. Fussell
Venue:  (1989)

We present a technique for modeling global illumination which allows a wide variety of reflectance functions. Scene coherence is exploited in a preprocessing step in which the geometry is analyzed using iterative techniques. Memory is traded for speed, in anticipation of the high memory capacities of workstations of the future. The algorithm operates well over a wide range of time and image quality constraints: realistic results may be produced very quickly while very accurate results may be produced given more time and space. The method can be extended for animation and parallelization.
Recent trends in learning classifier systems research
Authors: Pier Luca Lanzi, Rick L. Riolo
Venue: Advances in evolutionary computing: theory and applications (2003)

In this chapter we review recent advances and trends in learning classifier systems (LCS) research. These advances fall in three main areas: (i) improved allocation and use of credit assigned to rules, which stems in part from utilizing connections with well-established reinforcement learning algorithms, and from using rule predictive accuracy as the "fitness" value guiding the genetic algorithm's search for better rules; (ii) research on alternative LCS architectures, including alternative rule syntax and semantics, as well as work on both simpler and more complex LCS; and (iii) increases in both the number and the range of LCS applications. We feel these advances have led to the resurgence of LCS research in the past five years, and in a final section we list some of the most immediate challenges facing LCS researchers at this time.
Three Dimensional CORDIC with reduced iterations
Authors: C. Clarke, Graham R. Nudd
Venue:  (1994)

This paper describes a modification to the three dimensional CORDIC algorithm using an approximation of the Taylor series. The modification has the potential to reduce the number of iterations required for a three dimensional CORDIC operation by at least 25 percent. The approach used is based upon a modification of the two dimensional CORDIC algorithm originally suggested by H.M Ahmed[1].
Efficient graph theoretical methods for examining the rigidity of planar trusses
Authors: A. Kaveh, F. N. Ehsani
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

A brief review of the methods for examining the rigidity of planar trusses is presented. A computer code is developed based on the modified version of the Edmonds' algorithm. A special algorithm is presented which is based on the Henneberg sequence, and a simple computer code is prepared. The Edmond's modified algorithm and the Henneberg sequence method are found to be highly efficient for examining the rigidity of statically indeterminate and determinate trusses, respectively.
Collocation for Two-Point Boundary Value Problems Revisited
Authors: Uri Ascher
Venue:  (1984)

Collocation methods for two-point boundary value problems for higher order differential equations are considered. By using appropriate monomial bases, we relate these methods to corresponding one-step schemes for 1st order systems of differential equations. This allows us to present the theory for nonstiff problems in relatively simple terms, refining at the same time some convergence results and discussing stability. No restriction is placed on the meshes used.
A computational methodology to select the best material combinations and optimally design composite sandwich panels for minimum cost
Authors: M. Walker, R. Smith
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

A procedure to select the best material combination and optimally design sandwich laminates with fibre reinforced skins and low density cores for minimum cost is described. Sandwich constructions generally provide improved stiffness/mass ratios and provide further tailoring capacity than monolithics, and thus greater chance of satisfying design constraints. The objective of the optimisation is to minimise the laminate cost by selecting the skin and core material combination, layer thicknesses and skin fibre angles optimally, subject to load and mass constraints. As the optimisation problem contains a number of continuous (ply angles and thicknesses) and discrete (material combinations) design variables, a sequential solution procedure is devised in which the optimal variables are computed in different stages. The methodology and its benefits are demonstrated using Graphite, Glass or Kevlar/Epoxy facings, and Balsa or PVC cores.
Towards Systolizing Compilation: an Overview
Authors: Christian Lengauer
Venue:  (1988)

A scheme for the compilation of imperative programs is demonstrated on matrix composition and decomposition. The same scheme can be applied if the input is a functional rather than an imperative program. Using this scheme, programs for the processor network Warp and for an Inmos Transputer network have been generated.
A Simple Optimal Parallel List Ranking Algorithm
Authors: Karl Abrahamson, Norm Dadoun, David G. Kirkpatrick, Teresa M Przytycka
Venue:  (1987)

We describe a randomized parallel algorithm to solve list ranking in $O(\log n)$ expected time using $n/ \log n$ processors, where $n$ is the length of the list. The algorithm requires considerably less load rebalancing than previous algorithms.
Finite element analysis of the fire resistance of reinforced concrete columns
Authors: X. X. Zha, L. Y. Li, J. A. Purkiss
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

For concrete members, the development of approximate formulas to predict their fire resistance is more difficult than for steel. In general, the temperature in a cross-section of a concrete member is not uniform during fire exposure unlike a steel section. Thus, the thermal and mechanical properties of the concrete vary not only with time but also with the location in the section. Although BS8110 and DD ENV- 1992-1-2 begin into practice the design of fire resistance for RC columns is still generally made on the basis of national and international recommendations, most of which are derived from experimental data. Recent results in FEA that consider material deterioration and corresponding propagation of cracking have demonstrated that FEA is capable of providing more accurate predictions for the failure of RC structures. In this paper, the behaviour of RC columns subjected to fire on one side is investigated and corresponding fire resistance is computed using FEM. The temperature distribution in the cross-section of the column during a fire is calculated using Hertz's simplified method, which is then input into the FE program for carrying out time-dependent thermal stress analysis.
Harnessing Preattentive Processes for Multivariate Data Visualization
Authors: Christopher G. Healey, Kellogg S. Booth, James T. Enns
Venue:  (1992)

A new method for designing multivariate data visualization tools is presented. These tools allow users to perform simple tasks such as estimation, target detection, and detection of data boundaries rapidly and accurately. Our design technique is based on principles arising from an area of cognitive psychology called preattentive processing. Preattentive processing involves visual features that can be detected by the human visual system without focusing attention on particular regions in an image. Examples of preattentive features include colour, orientation, intensity, size, shape, curvature, and line length. Detection is performed very rapidly by the visual system, almost certainly using a large degree of parallelism. We studied two known preattentive features, hue and orientation. The particular question investigated is whether rapid and accurate estimation is possible using these preattentive features. Experiments that simulated displays using our preattentive visualization tool were run. Analysis of the results of the experiments showed that rapid and accurate estimation is possible with both hue and orientation. A second question, whether interaction occurs between the two features, was answered negatively. This suggests that these and perhaps other preattentive features can be used to create visualization tools which allow high-speed multivariate data analysis.