ppxscal/embedding_network huggingface dataset:
Simultaneous Multitarget Detection and False Alarm Mitigation Algorithm for the Predator UAV TESAR ATR System
Authors: Dalton S. Rosario
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper describes a technique recently developed for target detection and false alarm reduction for the Predator unmanned aerial vehicle (UAV) tactical endurance synthetic aperture radar (TESAR) automatic target recognition (ATR) system. The approach does not attempt to label various objects in the SAR image (e.g., buildings, trees, roads): instead it finds target-like characteristics in the image and compares their statistical/spatial relationship to larger structures in the scene. To do this, the approach merges the output of multiple CFAR (constant false alarm ratio) Surfaces through a sequence of mathematical morphology tests. Application of this detector to the Predator' s SAR ATR algorithm suite produced a stunning reduction of I order of magnitude in the number of cues yielded by Predator' s baseline detector
A programming language theorem which is independent of Peano Arithmetic
Authors: Michael O'Donnell
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

Strongly typed programming languages contain a natural subrecursive part consisting of programs with no loops and no explicitly recursive (circular) function definitions. For languages with polymorphic type structure, such as Model, the termination of all loop-free nonrecursive programs is independent of Peano Arithmetic. An attempt to apply the same techniques to prove independence of the P@@@@NP problem can succeed only if NP complete problems have almost polynomial complexity.
Speech recognition at two field sites
Authors: A. Rollins, B. Constantine, S. Baker
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

The performance of two speech recognition systems installed at two field sites was analyzed. The speech systems were part of larger computer systems that were performing real functions in industrial environments. The two sites appeared to be polarized in terms of expected suitability for speech recognition. The variables looked at included task complexity, memory load, requirements for verification and error correction, vocabulary and syntax, microphone, operator experience and complexity of host computer software. Accuracy and throughput were measured for the speech recognition system at each site. The same measurements were made for keyboard entry. Operator differences account for most of the variance in results. Accuracy with voice input was higher than with keyboard for most operators. The most accurate operators with keyboard also tended to be the most accurate with voice. Throughput data appears more sensitive to individual differences in dealing with voice input, although the throughput data was clouded by slow host system response times overall. The discussion suggests that one to one replacement of keyboard with voice overlooks some possible advantages of voice. It is also possible to find operators who work well with voice. For those who do not work well with voice, the problems appear to be related to general work habits and attitude, rather than to specific difficulties with speech.
Complex information processing: a file structure for the complex, the changing and the indeterminate
Authors: T. H. Nelson
Venue: Proceedings of the 1965 20th national conference (1965)

THE KINDS OF FILE structures required if we are to use the computer for personal files and as an adjunct to creativity are wholly different in character from those customary in business and scientific data processing. They need to provide the capacity for intricate and idiosyncratic arrangements, total modifiability, undecided alternatives, and thorough internal documentation. I want to explain how some ideas developed and what they are. The original problem was to specify a computer system for personal information retrieval and documentation, able to do some rather complicated things in clear and simple ways. In this paper I will explain the original problem. Then I will explain why the problem is not simple, and why the solution (a file structure) must yet be very simple. The file structure suggested here is the Evolutionary List File, to be built of zippered lists. A number of uses will be suggested for such a file, to show the breadth of its potential usefulness. Finally, I want to explain the philosophical implications of this approach for information retrieval and data structure in a changing world.
Computer technology for the realistic calculation of properties of enzyme systems
Authors: Lillian Garfinkel, David G. Rhoads, David Garfinkel
Venue: Proceedings of the 1971 26th annual conference (1971)

Traditional pencil-and-paper analyses of enzyme kinetic experiments assume so much simplification that the results have limited biological significance. Althouqh performing initial velocity experiments with negligibly low enzyme concentrations in the presence of single inhibitors facilitates interpretation, there are a number of enzymes for which this method fails completely. Software has been developed for the economical simulation of enzyme behavior under realistic conditions. Enzyme activity is computed as a function of either time or concentration by solution of either differential or algebraic equations with any desired ratio of enzyme/substrate concentrations. Simulation of experiments with hexo-kinase from mouse ascites cells has permitted resolution of some apparently contradictory results and indicated guidelines for assuring reliability of data. Applications of lab. analyzers to improve interpretation of experiments and perhaps actually perform them are discussed.
Verifying programs which operate on data structures
Authors: Mark S. Laventhal
Venue: Proceedings of the international conference on Reliable software (1975)

In order to prove the correctness of a computer program, one must be able to characterize the data in the program. Proofs by the inductive assertion method require the construction of concise, precise assertions to describe the data. This paper presents some techniques for characterizing data structures which can be used to build adequate assertions. New primitive relations are introduced for describing intra-structural relationships. These primitives form the basis for two important concepts: The invariant of a structure is a concise characterization of a structural class. A representation function is a mapping from a structure to a corresponding abstract data object; this concept provides a means for expressing relationships between a structure and other data, and among the values of a structure over time. By means of verification lemmas, these concepts can be integrated into proofs of correctness, and the proofs as well as the assertions can be dramatically simplified. An example program is presented which demonstrates the use of these concepts in constructing the assertions, and the resulting proof of correctness is outlined.
A simple and efficient skew detection algorithm via text row accumulation
Authors: R. Smith
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

An important part of any document recognition system is detection of skew in the image of a page. This paper presents a new, accurate and robust skew detection algorithm based on a method for finding rows of text in page images. Results of a comparison of the new algorithm against Baird's well-known algorithm on 400 pages show the new algorithm to be more accurate, robust and somewhat faster. In particular, the new algorithm only breaks down at skew angles in excess of 15 degrees, compared to the almost uniform distribution of breakdowns of Baird's algorithm.
An assessment of the programming language PASCAL
Authors: Niklaus Wirth
Venue: Proceedings of the international conference on Reliable software (1975)

The programming language PASCAL is assessed in the light of &ldquo;reliable programming&rdquo; and with the background of five years of experience with the language. Some features are selected to point out remaining problems, either inherent or specific, from which some guidelines for the design or choice of languages for reliable programming are derived. Among the discussed features are the concept of data type, the sequential file structure, and the type union.
Segmentation and Object Detection with Gabor Filters and Cumulative Histograms
Authors: Tadayoshi Shioyama, Haiyuan Wu, Shigetomo Mitani
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper proposes an algorithm for segmentation and extracting an model object region by using Gabor filters. Gabor filters are exploited to extract spatial frequency in some orientations, and not only the outputs of Gabor filters but also color information are used to construct the features at each image pixel. The criterion is devised so as to consider the similarity, the region size and the region shape factors in order to efficiently merge the features. In general, a complex object may be segmented into multiple regions. However for purpose of detecting such complex object, we represent the object region by the normalized cumulative histogram of features. From experimental results, it is found that the proposed algorithm is able to efficiently detect the object regions such as cars in images of usual traffic scenes.
An operator calculus
Authors: Kenneth E. Iverson, Roland Pesch, J. Henri Schueler
Venue: ACM SIGAPL APL Quote Quad (1984)

This paper extends a line of APL development presented in a sequence of papers [1-7] over the past six years. The main topics addressed are the interactions of operators such as rank, composition, derivative, and inverse (i.e., the beginnings of a calculus of operators), a simplification in the complement of attributes tentatively presented in [6], and a treatment of the shapes of individual results (as defined in [7]) in the case of empty frames. Brief treatments are also given to a number of smaller matters: a transliteration or token substitution facility, the treatment of niladic functions, a custom (variant) operator, the obsolescence of certain system variables, and some changes in the function definition operator and in the treatment of supernumerary axes.
A panel session on &ldquo;digital system education&rdquo;
Venue: ACM SIGCSE Bulletin (1975)

This panel is composed of the chairmen of the task forces of the DISE (Digital Systems Education Committee). DISE is a project sponsored by the NSF and managed by University of Pittsburgh for the purpose of generation and dissemination of educational material on all aspects of digital system education. The panel members will discuss the current activities of these task forces and then seek the audience's participation in learning more about the status and need of current digital system education.
Test data verification - not just the final step for test data before release for production testing
Authors: P. Solecky, R. L. Panko
Venue: Proceedings of the 18th Design Automation Conference (1981)

Increased product complexity has touched all aspects of testing: hardware, software, and procedures. The test data verification process is not immune to this increased complexity. Qualification, validation, and final inspection of the test data prior to its acceptance for use in production testing of printed circuit boards has matured to a science. Large test data volumes, circuit density, technology mixing, sophisticated testers, as well as the extensive product development process, have all contributed to this complexity. Recently, major emphasis and attention have been focused on this critical process. This paper explores the underlying problems associated with traditional test data verification. An effective approach, environment, and total strategy are proposed to deal with the test data verification challenge.
Structure memory designs for a database computer
Authors: David K. Hsiao, Krishnamurthi Kannan, Douglas S. Kerr
Venue: Proceedings of the 1977 annual conference (1977)

Recent developments in storage technologies have given computer system designers a wide range to consider in building large on-line systems. It is important that the requirements of each component of a proposed system be carefully recognized before choosing a particular technology for its implementation. The design of a database computer which takes advantage of emerging technologies has been proposed. In this paper, the design of an important component of the database computer, namely, the structure memory, is described. Three design alternatives using three different technologies are proposed. These are magnetic bubble memories, charge-coupled devices, and electron beam addressable memories. The relationship of the structure memory with other components of the database computer is briefly outlined.
VHSIC hardware description (VHDL) development program
Authors: Al Dewey
Venue: Proceedings of the 20th Design Automation Conference (1983)

The VHSIC Program has realized the importance of a standard hardware description language to facilitate the design and documentation of future military digital systems incorporating VHSIC technology. To that end, the VHSIC Hardware Description Language Development Program has been organized to generate a language and an associated hierarchical simulator. The paper briefly covers some back-ground information and then outlines the general structure of the program. The latter is explained with respect to the requirements of the VHSIC Hardware Description Language effort and how the tasks have been designed to meet the requirements.
Microprogrammed implementation of a single chip microprocessor
Authors: Skip Stritter, Nick Tredennick
Venue: ACM SIGMICRO Newsletter (1978)

This paper considers microprogramming as a tool for implementing large scale integration, single-chip microprocessors. Design trade-offs for microprogrammed control are discussed in the context of semiconductor design constraints which limit the size, speed, complexity and pin-out of circuits. Aspects of the control unit of a new generation microprocessor, which has a two level microprogrammed structure, are presented.
The Newton Cotes coefficients in APL
Authors: John L. Richardson
Venue: Proceedings of the sixth international conference on APL (1974)

An alternate approach to numerical integration is proposed which turns out to be equivilant to the Newton-Cotes method, APL is shown to be excellently suited for attacking the numerical integration problem. Programs using these methods are demonstrated and various examples shown.
A PL/1 batch processor for APL
Authors: S. Charmonman, J. E. Bell
Venue: Proceedings of the fourth international conference on APL (1972)

This paper describes a translator for batch processing of APL. It was written in PL/1 and has been operational through the usual card reader for input and the printer for output as well as through a typewriter terminal under Remote Job Entry of the Conversational Programming System for both input and output. The subset of APL accepted by the translator is at the level of APL/1130. The translator provides file processing facilities via PL/1 and a form of object program for subsequent, runs. It has served as a temporary substitute and then a supplement to APL/360.
Prediction of wiring space requirements for LSI
Authors: W. R. Heller, W. F. Michail, W. E. Donath
Venue: Proceedings of the 14th Design Automation Conference (1977)

A stochastic model is developed for estimating wiring space requirements for one-dimensional layouts. This model uses as input the number of devices in the complex to be wired, the average length of a connection, and the average number of connections per device, to compute the probability of successfully wiring the devices as a function of the number of tracks provided. A heuristic approach is used to extend this model to the two-dimensional case, and tested against experimen-tal studies. Satisfactory agreement is found between a priori calculations of track requirements for the two-dimensional case against global wiring solutions for artificially generated problems, and for some layouts of actual logic complexes.
The use of computers in message switching networks
Authors: Arnold B. Shafritz
Venue: Proceedings of the 1964 19th ACM national conference (1964)

This paper presents a tutorial discussion of message switching systems. The emphasis is on utility and operational aspects, although design considerations of an individual message-switching center are also covered. A message-switching network is described and the difference between its operation and that of a circuit-switching network is pointed out. A message is traced through the system, from a sender to a receiver. Concepts are introduced of a multi-address message, exchange between subscribers using different terminal equipment and of the use of high-speed trunks. The interrelationship among messages being processed is discussed, with special attention being given to the queuing of messages, including the complexities of message priorities and message pre-emption. Message protection measures are discussed briefly, along with the necessity of virtually continuous operation. The paper ends with a presentation of a typical configuration of a message-switching center, with both hardware and software implications.
The semantics of local storage, or what makes the free-list free?(Preliminary Report)
Authors: Joseph Y. Halpern, Albert R. Meyer, B. A. Trakhtenbrot
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

Denotational semantics for an ALGOL-like language with finite-mode procedures, blocks with local storage, and sharing (aliasing) is given by translating programs into an appropriately typed &lgr;-calculus. Procedures are entirely explained at a purely functional level - independent of the interpretation of program constructs - by continuous models for &lgr;-calculus. However, the usual (cpo) models are not adequate to model local storage allocation for blocks because storage overflow presents an apparent discontinuity. New domains of store models are offered to solve this problem.
The application development process: What's wrong with it?
Authors: John D. Crowley
Venue: Proceedings of the 1981 ACM workshop/symposium on Measurement and evaluation of software quality (1981)

This paper will examine the process used in the development of computer applications. The claim is made that the current methodology has serious deficiencies, but that a software development approach is becoming available to help address these problems.
The complexity of dynamic languages and dynamic optimization problems
Authors: James B. Orlin
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

In this paper we offer a unifying framework for dynamic problems in terms of &ldquo;dynamic languages&rdquo;, and we discuss the complexity of these languages. In particular, many dynamic languages derived from NP-complete languages can be shown to be polynomial space (P-space) complete. Among these are the following: the dynamic 3-satisfiability problem, and dynamic 3-dimensional matching problem, the dynamic partition problem, the dynamic hamiltonian circuit problem, and the dynamic independent set problem. We provide a general technique for showing how to prove the P-space completeness of dynamic problems derived from NP-complete problems.
Conservation of software science parameters across modularization
Authors: Lawrence Hunter, Jose C. Ingojo
Venue: Proceedings of the 1977 annual conference (1977)

Current results in software science research provide a potentially powerful tool for software engineering management. Software science parameters including time required to write a program and program length can be estimated from parameters available at the time of program design specification. The application of these results to modularized programs is not straightforward since the derived parameters are nonlinear in vocabulary size. We define an integrated vocabulary for a modularized program. A parameter is said to be conserved across modularization if the parameter value derived from the integrated vocabulary equals the sum of the parameter values derived from the modules: three parameters have been found to be conserved across modularization in well-modularized programs. Failure to exhibit conservation of length can be used to detect excessive or insufficient intermodule communication.
The design of bit-parallel systolic filter algorithms
Authors: Paul L. Mills
Venue: Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium (1984)

In this paper we present a methodology for the design of systolic arrays for numeric and non-numeric (symbolic) systolic functions. This methodology is then applied to the Finite Impulse Response (F.I.R) Filter function. A particular design approach is followed and we present the complete design procedure and specification for a two-stage, two-bit input data and two-bit reference coefficient bit parallel filter.
Convergence of approximating polynomials
Authors: Philip C. Curtis,  Jr.
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

I. The problem we wish to consider is the following. For each positive integer n, let En be a finite subset of [&minus;1,1] containing at least n points. N For a real valued continuous function f defined on [&minus;1,1] let pn (f, En) be the unique polynomial of degree at most n&minus;1 of best approximation in the Chebycheff sense to f on En. Is it possible to choose a fixed sequence [En] so that for each f, continuous on [&minus;1,1], pn (f, En) converges to f uniformly on [&minus;1,1]? A classical result of Faber states that if, for each n, En contains n exactly n points, this choice is never possible. In this case, of course, pn (f, En) is just the polynomial which interpolates to f at the points of En.
Throughput analysis and configuration design of a shared-resource multiprocessor system: PUMPS
Authors: Faye A. Briggs, Michel Dubois, Kai Hwang
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

A new concept of designing multiprocessors, which share not only memory but also specially chosen peripheral processors and VLSI functional units, is introduced in this paper. Queuing analysis is performed on the potential throughput of the Purdue multiprocessor system (PUMPS). Configuration design of the shared resource pool is demonstrated with a special PUMPS design for interactive image processing. The resource optimization techniques being developed can be also applied to configuration design of PUMPS for any other scientific applications.
A brief survey of stopping rules in Monte Carlo simulations
Authors: Michael J. Gilman
Venue: Proceedings of the second conference on Applications of simulations (1968)

A brief survey of the existing methods for determining when to stop sampling in Monte Carlo simulations is presented. The distinction is made between stopping rules for simulations using independent samples and those using correlated samples. Possible avenues for further research are mentioned.
Defense data networks - common-user or dedicated?
Authors: Franklin F. Kuo
Venue: Proceedings of the fifth symposium on Data communications (1977)

This paper describes briefly three new Defense data networks, AUTODIN II, SATIN IV and PWIN which employ packet switching technology. It then discusses Defense policy concerning common-user networks and in what circumstances special purpose networks are permitted. Finally it addresses the issue of whether the three new data networks under discussion are common-user or dedicated networks.