ppxscal/embedding_network huggingface dataset:
The effects of infill walls on the behaviour of frames under horizontal loads
Authors: A. Karaduman, Z. Polat, M. Y. Kaltakci
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

In this study, a series of experimental results made on the behaviour of steel frame series having single floor and single span infill walls, were evaluated in order to take into consideration the influence of infill walls on statically calculations of frame practically and include local parameters into the calculation models suggested in the literature.For this reason, loading conditions, material properties, thickness and type of infill, plaster, cross-section areas and dimensions of the tensile and compression parts were selected as main variables and the failure load of the infilled frame system and its effects on the behaviour before failure were investigated according to the experimental results.Also, by making finite elements modelling, the numerical solutions were made by SAP90 computer program and compared with the experimental results.
Strategy-Independent Program Restructuring Based on Bounded Locality Intervals
Authors: Samuel T. Chanson, Bernard Law
Venue:  (1981)

A new program restructuring algorithm based on the phase/transition model of program behaviour is presented. The scheme places much more emphasis on those blocks in the transition phases in the construction of the connectivity matrix than the existing algorithms. This arises from the observation that the page fault rate during the transition phases is several orders of magnitude higher than that during the major phases. The strategy is found, for our reference strings, to outperform the critical working set strategy (considered to be the current best), by non-negligible amounts. Furthermore, the overhead involved is lower than that of CWS and not much higher than that of the Nearness method which is the simplest scheme known. Being strategy-independent, it also seems to respond better than CWS when the memory management strategy used is not the working set policy.
A Formal Model for Procedure Calling Conventions
Authors: Mark W. Bailey, Jack W. Davidson
Venue:  (1994)

Procedure calling conventions are used to provide uniform procedure-call interfaces. Applications, such as compilers and debuggers, which generate, or process procedures at the machine-language abstraction level require knowledge of the calling convention. In this paper, we develop a formal model for procedure calling conventions called P-FSA''s. Using this model, we are able to ensure a number of completeness and consistency properties of calling conventions. Currently, applications that manipulate procedures implement conventions in an ad-hoc manner. The resulting code is complicated with details, difficult to maintain, and often riddled with errors. To alleviate the situation, we introduce a calling convention specification language, called CCL. The combination of CCL and P-FSA''s facilitates the accurate specification of conventions that can be shown to be both consistent and complete.
Inverse Document Frequency and Web Search Engines
Authors: Kevin Prey, James C. French, Allison L. Powell, Charles L. Viles
Venue:  (2001)

Full text searching over a database of moderate size often uses the inverse document frequency, idf = log(N/df), as a component in term weighting functions used for document indexing and retrieval. However, in very large databases (e.g. internet search engines), there is the potential that the collection size (N) could dominate the idf value, decreasing the usefulness of idf as a term weighting component. In this short paper we examine the properties of idf in the context of internet search engines. The observed idf values may also shed light upon the indexed content of the WWW. For example, if the internet search engines we survey index random samples of the WWW, we would expect similar idf values for the same term across the different search engines.
Neural Networks in the Undergraduate Curriculum
Authors: Ingrid F. Russell
Venue: Journal of Computing Sciences in Colleges (1991)

Neural networks have been and will continue to be major research areas in artificial intelligence. Such models show promise in achieving human-like performance, particularly in areas such as speech and pattern recognition. Recently, neural networks have begun to find their way out of the research labs and into the realm of practical applications. Unfortunately, however, the study of such networks has been largely overlooked in the computer science undergraduate curriculum. Tomorrow's marketplace demands that computer science students be familiar with neural networks and with their problem solving abilities. This paper presents a proposal for a neural network module to be integrated into an Introduction to Artificial Intelligence course. Such a module proved to be a very popular and successful part of such a course given by the author. Sample projects assigned in the course will be presented. In a number of these projects, students either used microcomputer application software which simulates several neural network models or programmed their own simulations on microcomputers.
TSpec: A Notation for Describing Memory Reference Traces
Authors: D. A. B. Weikle, Kevin Skadron, Sally McKee, William A. Wulf
Venue:  (2000)

Interpreting reference patterns in the output of a processor is complicated by the lack of a succinct notation for humans to use when communicating about them. Since an actual trace is simply an incredibly long list of numbers, it is difficult to see the underlying patterns inherent in it. The source code, while simpler to look at, does not include the effects of compiler optimizations such as loop unrolling, and so can be misleading as to the actual references and order seen by the memory system. To simplify communication of traces between researchers and to understand them more completely, we have developed a notation for representing them that is easy for humans to read, write, and analyze. We call this notation TSpec, for trace specification notation. It has been designed for use in cache design with four goals in mind. First, it is intended to assist in communication between people, especially with respect to understanding the patterns inherent in memory reference traces. Second, it is the object on which the cache filter model operates. Specifically, the trace and state of the cache are represented in TSpec, these are then the inputs for a function that models the cache, and the result of that function is a modified trace and state that are also represented in TSpec. Third, it supports the future creation of a machine readable version that could be used to generate traces to drive simulators, or for use in tools (such as translators from assembly language to TSpec). Finally, it can be used to represent different levels of abstraction in benchmark analysis.
PATTERN ASSOCIATIVITY AND THE RETRIEVAL OF SEMANTIC NETWORKS
Authors: Robert Levinson
Venue:  (1991)

Four methods for the associative retrieval of semantic networks are described. These methods differ from those traditional approaches, such as SNEPS, in which an entire knowledge base is treated as a single network. Here the knowledge base is viewed as an organized collection of networks and is most appropriate for applications (such as bibliographic retrieval) in which pieces of knowledge need to be treated individually. Method I is an arbitrary flat ordering of database graphs, Method II a two-level ordering, and Method III is a full partial order. Method IV is a novel method known as ``hierarchical node descriptor method'''' that is based on the ``refinement'''' method of subgraph-isomorphism. A ``pattern associativity'''' principle explains the development and effectiveness of each of these methods. Moving from Method I through Method IV there is a steady increase in both pattern associativity and efficiency. A theorem is proven that establishes the superiority of Method III over Method II despite the fact that Method II is the method most often used. A brief discussion of how parallelism may be incorporated also accompanies the description of each method. Most of the paper applies these methods to conceptual graphs and a later section shows how the techniques can be extended to other semantic-network formalisms. The paper concludes by showing how generalization graphs constructed through pattern associativity may also have semantic validity in the domains from which they have been derived. (Supersedes 90-30.)
PERFORMANCE EVALUATION OF SYSTEMS WITH RESTRICTED OVERLAP OF RESOURCES
Authors: David E. Levy
Venue:  (1994)

In this dissertation, we investigate the performance evaulation of systems with restricted overlap of resources. The impetus of this study is derived from the constrained parallelism in the service of I/O requests in the current generation of cached disk controllers. Among other features, these cached contgrollers offer improved performance through an increase in the degree of transfer concurrency. In particular, we consider controllers that have the ability to service the next request for a given logical device, if it can be satisfied by the cache, in parallel with "hidden" disk activity, such as staging. We present a queueing model to represent the restricted overlap problem. The model is developed under exponential assumptions and then expanded to account for variability in service. We investigate the efficiency of three solution techniques. The model is also expanded to represent a shared logical device.
Globally Convergent Homotopy Algorithms for the Combined H-squared/ H-to Infinity Model Reduction Problem
Authors: Yuzhen Ge, Layne T. Watson, Emmanuel G. Collins, Dennis S. Bernstein
Venue:  (1993)

The problem of finding a reduced order model, optimal in the H-squared sense, to a given system model is a fundamental one in control system analysis and design. The addition of a H-to infinity constraint to the H-squared optimal model reduction problem results in a more practical yet computationally more difficult problem. Without the global convergence of probablity-one homotopy methods the combined H-squared/H-to infinity model reduction problem is difficult to solve. Several approaches based on homotopy methods have been proposed. The issues are the number of degrees of freedom, the well posedness of the finite dimensional optimization problem, and the numerical robustness of the resulting homotopy algorithm. Homotopy algorithms based on several formulations -- input normal, Ly, Bryson, and Cannon''s 2 x 2 block parametrization -- are developed and compared here.
Knowledge Structuring \& Constraint Satisfaction: the Mapsee Approach
Authors: Jan A. Mulder, Alan K. Mackworth, William S. Havens
Venue:  (1987)

This paper shows how to integrate constraint satisfaction techniques with schema-based representations for visual knowledge. This integration is discussed in a progression of three sketch map interpretation programs: Mapsee-l, Mapsee-2, and Mapsee-3. The programs are evaluated by the criteria of descriptive and procedural adequacy. The evaluation indicates that a schema-based representation used in combination with a hierarchical arc consistency algorithm constitutes a modular, efficient, and effective approach to the structured representation of visual knowledge. The schemata used in this representation are embedded in composition and specialization hierarchies. Specialization hierarchies are further expanded into discrimination graphs.
Document Quality Indicators: A Framework for Assessing DocumentationAdequacy
Authors: James D. Arthur, K. T Stevens
Venue:  (1990)

This paper presents case study results of a research effort funded by the Naval Surface Warfare Systems (NSWC) at Dahlgren, Virginia. The investigation focuses on assessing the adequacy of project documentation based on an identified taxonomic structure relating documentation characteristics. Previous research in this area has been limited to the study of isolated characteristics of documentation and English prose, without considering the collective contributions of such characteristics. The research described in this paper takes those characteristics, adds others, and establishes a well-defined approach to assessing the "adequacy" of software documentation. The identification of Document Quality Idicators (DQIs) provide the basis for the assessment procedure. DQIs are hierarchically defined in terms of document Qualities, Factors that refine Qualities, and Quantifiers that provide for the measurement of Factors.
Recursion Theorems and Effective Domains
Authors: K, Akira a
Venue:  (1984)

Every acceptable numbering of an effective domain is complete. Hence every effective domain admits the 2nd recursion theorem of Er\u{s}ov [1]. On the other hand for every effective domain, the 1st recursion theorem holds. In this note, we establish that for effective domains, the 2nd recursion theorem is strictly more general than the 1st recursion theorem, a generalization of an important result in recursive function theory.
QUORUM-ORIENTED MULTICAST PROTOCOLS FOR DATA REPLICATION
Authors: Richard A. Golding, Darrell D. E. Long
Venue:  (1991)

Many wide-area distributed applications use replicated data to improve the availability of the data, and to improve access latency by locating copies of the data near to their use. This paper presents a new family of communication protocols, called *quorum multicasts*, that provide efficient communication services for widely replicated data. Quorum multicasts are similar to ordinary multicasts, which deliver a message to a set of destinations. The new protocols extend this model by allowing delivery to a subset of the destinations, selected according to distance or expected data currency. These protocols provide well-defined failure semantics, and can distinguish between communication failure and replica failure with high probability. We have evaluated their performance, which required taking several traces of the Internet to determine distributions for communication latency and failure. A simulation study of quorum multicasts, based on these measurements, shows that these protocols provide low latency and require few messages. A second study that measured a test application running at several sites confirmed these results.
Performance Evaluation of Active Database Management Systems Usingthe BEAST Benchmark
Authors: Andreas Geppert, Mikael Berndtsson, Daniel Lieuwen, Juergen Zimmermann
Venue:  (1996)

This paper presents the first comparative performance study of object-oriented active database management systems by using the BEAST benchmark. BEAST stresses the performance-critical components of active systems: event detection, event composition, rule retrieval, and rule firing. For event detection both method invocation events and transactional events are taken into account; this also shows some performance contributions of the passive part of an ADBMS. Four systems, namely ACOOD, Ode, REACH, and SAMOS, have passed the benchmark tests of BEAST. The interpretation of the performance measurements shows several achievements in the area of active database technology, but also indicates tradeoffs (e.g. between performance and functionality). Finally, it helps to identify possible optimizations and open issues in designing and implementing active database systems.
Correlating Workload Characteristics to Performance Metrics for theCray X-MP/Y-MP
Authors: Walid Abu-Sufah, John L. Larson
Venue:  (1989)

Workload characterization is essential for performance evaluation studies. For multiprocessor supercomputers, this characterization usually consists of program measurements from uniprocessor execution (e.g., average vector length, percentage vectorization, etc.). There is no consistent, quantitative correlation between such characteristics and performance metrics across different programs. We present a methodology for defining and measuring characterization parameters for both single and multi-processor executions. Using several production codes, we show for the Cray X-MP/Y-MP that these characterization parameters correlate consistently to observed performance metrics across different programs. Moreover, the correlation allows the identification of bottlenecks in system architecture that limit performance. Presentation slides from the Fourth SIAM Conference on Parallel Processing for Scientific Computing, December, 1989.
Better approximation bounds for the network and Euclidean Steiner tree problems
Authors: Alexander Zelikovsky
Venue:  (1996)

The network and Euclidean Steiner tree problems require a shortest tree spanning a given vertex subset within a network G=(V,E,d) and Euclidean plane, respectively. For these problems, we present a series of heuristics finding approximate Steiner trees with performance guarantees coming arbitrary close to 1+ln 2= 1.693... and 1+ln(2/sqrt3) = 1.1438..., respectively. The best previously known corresponding values are close to 1.746 and 1.1546.
General Purpose Visual Simulation System: A Functional Description
Authors: John L. Bishop, Osman Balci
Venue:  (1989)

The purpose of the research described herein is to develop a software system that aids a simulationist in constructing and executing a general purpose discrete event visual simulation model. A literature review has shown the need for an integrated visual simulation system that provides for the graphical definition and interactive specification of the model while maintaining application independence. The General Purpose Visual Simulation System (GPVSS) developed in this research meets this need by assisting a simulationist to: (1) graphically design a simulation model and its visualization, (2) interactively specify the model''s logic, and (3) automatically generate the executable version of the model in C programming language, while maintaining domain independence. GPVSS is developed on a Sun 3/160C computer workstation using SunView graphical interface. It consists of over 11,000 lines of documented code. GPVSS has been successfully treated in many case studies.
Drawing Graphs with Non-Uniform Vertices
Authors: D. Harel, Y. Koren
Venue:  (2000)

The vertices of most graphs that appear in real applications are non-uniform. They can be circles, ellipses, rectangles, or other geometric elements of varying shapes and sizes. Unfortunately, current force directed methods for laying out graphs are suitable mostly for graphs whose vertices are zero-sized and dimensionless points. It turns out that naively extending these methods to handle non-uniform vertices results in serious deficiencies in terms of output quality and performance. In this paper we try to remedy this situation by identifying the special characteristics and problematics of such graphs and offering several algorithms for tackling them. The algorithms can be viewed as carefully constructed extensions of force-directed methods, and their output quality and performance are similar.
Syntactic Pattern Recognition by Quadratic Neural Nets. A Case Study: Rail Flaw Classification
Authors: Patricia McKenzie, Mike Alder
Venue:  (1993)

We show how Quadratic Neural Nets can be used to accomplish Syntactic Pattern Recognition. The method has been applied successfully to an industrial problem of classifying rail flaws by examining ultrasonic images.
Computers and the Mechanication of Judgement
Authors: A. Mowshowitz
Venue:  (1977)

Computer-based information systems are playing an increasingly important role in organizational decision-making. Although high level managers are not in imminent danger of extinction, many managerial functions have been substantially altered or replaced by computer systems. These developments are viewed here as an extension of bureaucratic rationalism, the peculiar innovative spirit of large-scale enterprise. Advanced information technology in large organizations appears to promote the elaboration of hierarchically structured control mechanisms, and to further the resolution of complex decision tasks into routine procedures. Since the technology could in principle be used to support radically different modes of organization, an explanation must be sought in the evolution of bureaucracy. Efforts to improve productivity and efficiency affect the distribution of power and authority, so that technical innovation in management raises serious ethical and political problems. Historical observations and empirical results point to a contradiction between bureaucratic rationalism and individual autonomy. This contradiction is revealed in the impact of computer applications on the conduct of certain classes of decision-makers. Policy issues are transformed into technical questions, and opportunities for exercising independent judgment are diminished as analysis of means displaces exploration of ends. I will attempt to show how this transformation is accomplished in the rationalization of functions which typically accompanies the introduction of computer systems.
Object Representation Using Circular Harmonics
Authors: Nicola Cross, R. G. Wilson
Venue:  (1994)

The system presented here is one that can be used to project information describing the corners of an object from some storage area, down onto a network. The idea is to reinforce the detection of object boundaries performed by a Hopfield network. These networks are efficient in terms of detecting edges, but are less efficient at detecting corners. This is because the Hopfield network works by assuming that an edge will continue in a more or less straight line. A ripple filter is used; this projects ripples of vectors onto the areas where corners are expected. Each vector consists of: a magnitude that indicates a level of certainty about the position of the corner, and a direction which indicates the expected orientation of the corner. The vectors are used by the Hopfield network to override existing straight links with curved links, so helping it to detect corners. We describe a method for projecting sectors of the ripples using circular harmonics. Possible extensions and improvements to the work are considered.
Management Issues and Software Reuse: An Empirical Study
Authors: John A. Lewis, Sallie M. Henry, Dennis G. Kafura, Robert S. Schulman
Venue:  (1992)

This paper describes the results of a controlled experiment designed to evaluate the impact of managerial influence and cognitive abilities on software reuse. The experiment concludes that (1) software reuse promotes higher productivity, (2) reuse resulting from both moderate and strong encouragement promote higher productivity than no reuse, (3) management''s strong encouragement to reuse tends to promote improper reuse activities, (4) in general, reuse of a module is unproductive if 30 percent or less is used for the target system, though as much as 50 percent can be discarded for some modules and still be worth reusing, (5) of integrative ability, perception speed, and visualization, only the ability to visualize changes made to patterns was related to software reuse, and (6) of the subject''s prior experience, only the amount of testing experience was related to software reuse.