ppxscal/embedding_network huggingface dataset:
A Multi-Agent Framework for Visual Surveillance
Authors: J. Orwell, S. Massey, P. Remagnino, D. Greenhill, G. A. Jones
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

We describe an architecture for implementing scene understanding algorithms in the visual surveillance domain. To achieve a high level description of events observed by multiple cameras, many inter-related, event-driven processes must be executed. We use the agent paradigm to provide a framework in which these processes can be managed. Each camera has an associated agent, which detects and tracks moving regions of interest. This is used to construct and update object agents. Each camera is calibrated so that image co-ordinates can be transformed into ground plane locations. By comparing properties, two object agents can infer that they have the same referent, i.e. that two cameras are observing the same entity, and as a consequence merge identities. Each object's trajectory is classified with a type of activity, with reference to a ground plane agent. This agent stores a hidden Markov model of learned activity patterns. We demonstrate objects simultaneously tracked in two cameras, which infer this shared observation. The combination of the agent framework, and visual surveillance application provides an excellent environment for development and evaluation of scene understanding algorithms.
An application of multiple-valued logic to a design of programmable logic arrays
Authors: Tsutomu Sasao
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

A three-level programmable logic array (three-level PLA) consists of three main parts, the D array, the AND array, and the OR array, and each of these arrays can be programmed. In this paper, a design method for three-level PLA's is described. Main results obtained are 1) The minimization of the AND array corresponds to the minimization of a multiple-valued input two-valued output logic function; 2) By using the theory of multiple-valued decomposition of two-valued function, the computation time and the memory requirement for the minimization of the AND array can be reduced; and 3) The design of multiple-output function can be done in a similar way by introducing a variable which denotes the outputs.
A Novel Channel Allocation Scheme in Integrated Wireless and Mobile Networks
Authors: Hang Chen, Qing-An Zeng, Dharma P. Agrawal
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Efficient support for multi-class services is a very important issue in integrated wireless and mobile networks because each type of service has distinct characteristics and Quality of Service (QoS) requirements. In this paper, we propose and analyze a new channel allocation scheme for integrated wireless and mobile networks. In our scheme, traffic is grouped into four different classes: originating real-time service calls, originating non real-time service calls, real-time service handoff request calls, and non real-time service handoff request calls. This new scheme can improve the grade of service of higher priority classes while maintaining the required QoS for lower priority classes. An analytical model is developed based on a multi-dimensional Markov chain and validated by simulation results. The closed formula of several important system performance parameters, including blocking probability of originating calls, forced termination probability of real-time service handoff request calls, and averagetransmission delay of non real-time service calls, are obtained.
Quantitive measurement of computer user satisfaction
Authors: Sammy W. Pearson, James E. Bailey
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

An important measure of the effectiveness of the computer services provided within an organization is the level of satisfaction that exists in the users of those services. This paper presents the development and evaluation of a questionnaire designed to quantitatively measure computer user satisfaction. The administration, scoring, and interpretation of the questionnaire are also addressed. Two case studies are presented to illustrate the use of the questionnaire in operational environments. The paper concludes with observations on how to conduct user satisfaction studies and how to improve user satisfaction. Single copies of this paper, which was originally presented at the fall 1978 conference of the American Institute of Industrial Engineers, will be available at the 'Taking Our Measure' session.
A two-dimensional interpolation function for irregularly-spaced data
Authors: Donald Shepard
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

In many fields using empirical areal data there arises a need for interpolating from irregularly-spaced data to produce a continuous surface. These irregularly-spaced locations, hence referred to as &ldquo;data points,&rdquo; may have diverse meanings: in meterology, weather observation stations; in geography, surveyed locations; in city and regional planning, centers of data-collection zones; in biology, observation locations. It is assumed that a unique number (such as rainfall in meteorology, or altitude in geography) is associated with each data point. In order to display these data in some type of contour map or perspective view, to compare them with data for the same region based on other data points, or to analyze them for extremes, gradients, or other purposes, it is extremely useful, if not essential, to define a continuous function fitting the given values exactly. Interpolated values over a fine grid may then be evaluated. In using such a function it is assumed that the original data are without error, or that compensation for error will be made after interpolation.
Active Outdoor Surveillance
Authors: Ismail Haritaoglu, David Harwood, Larry S. Davis
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

We describe a real time visual surveillance system for detecting and tracking people in an outdoor environment with an active camera which has zoom, tilt and pan control. It operates on monocular grayscale video imagery, or on video imagery from an infrared camera. The system learns and models background scene statistically to detect foreground objects, even when the background is not completely stationary (e.g. motion of tree branches) and distinguishes people from other objects (e.g. cars) using shape and periodic motion cues. It can track people with an active camera in a large field of regard when people's movement take them outside of the camera's current field of view, and control zoom, pan, and tilt of the camera to achieve sufficient angular resolution to recognize human actions. Experimental results demonstrate robustness and real-time performance of the algorithm.
The architecture of replica: A special-purpose computer system for active multi-sensory perception of 3-dimentional objects
Authors: Y. W. Ma, R. Krishnamurti
Venue: Proceedings of the 11th annual international symposium on Computer architecture (1984)

REPLICA is a special-purpose computer architecture to support active multi-sensory perception of 3-D objects. The system is partitionable, reconfigurable, and highly parallel. In this paper, we present the design of a set of interconnection networks which form the core of the REPLICA architecture. This set of interconnection networks consists of a capability-enhanced cross-bar switch and multiple fast shift-register rings. The capability-enhanced cross-bar switch supports rapid set-up of partitions, point-to-point communication and broadcasting communication between the controller and processors in a partition. The multiple rings support high bandwidth communications among the processors and also provide the partitionability and reconfigurability required by the system. The cost of these interconnection networks can also be kept low. The communication delay in the ring network is analyzed by deriving an upper bound on the maximum communication delay in a partition. A set of performance attributes for evaluating the performance of reconfigurable, partitionable, and highly parallel computer systems is proposed. Based on this set of attributes, the design of the REPLICA architecture is evaluated and compared with the other reconfigurable, partitionable, and highly parallel computer architectures in the literature.
A performance model for hardware/software issues in computer-aided design of protocol systems
Authors: C. M. Woodside, R. Montealegre, R. J. A. Buhr
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

Protocol execution can run into bottlenecks which are due to implementation decisions rather than to the protocol rules. The performance effects of processor saturation, buffer management strategy, allocation of functions between host and front-end, and hardware-software interactions due to special hardware attributes can, in principle, be predicted at the design stage by analytic performance models. The paper describes the process of construction of such a model for the data transfer stage of a simple transport protocol resembling an OSI class 4 protocol, including queueing for critical sections which protect the buffer pools and connection state information. The model is part of a computer-aided design process for communications systems, currently under development.
The problem of the initial transient in digital computer simulation
Authors: A. V. Gafarian, C. J. Ancker,  Jr., T. Morisaku
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

The problem of the initial transient has received much attention in the simulation literature. However, much of it is replete with ambiguous admonitions rendering it virtually useless to the average practitioner. In this paper we present a comprehensive framework for this problem within which a systematic study may be pursued and eventually produce some well-defined, comprehensible, and meaningful methods that a simulator can apply to his particular problem. More specifically, we give 1) a precise definition of the problem, 2) a set of criteria by which solutions may be evaluated, and 3) a description of the studies underway within the framework established in 1) and 2).
The Intel design automation system
Authors: Stephen Nachtsheim
Venue: Proceedings of the 21st Design Automation Conference (1984)

The Intel Design Automation (DA) System is overviewed within the framework of Intel's business and technological goals. The philosophies and goals that direct development, acquisition, and deployment of DA capabilities throughout Intel are provided as a foundation for a more detailed discussion of specific areas within the total DA system. The &ldquo;computing hierarchy&rdquo; used within Intel world-wide for design and verification of its products is presented, as well as a high-level picture of the entire DA system for Intel's components products mix. With this overview as a basis, detailed explanations of the Engineering Design Environment (EDeN), Functional Design Verification, Hierarchical Layout Verification, and Circuit Performance Verification are presented.
Adapting numerical algorithms to APL
Authors: Garry Helzer
Venue: Proceedings of the international conference on APL (1982)

Methods of efficiently coding numerical algorithms in APL are discussed. Examples discussed are root finding (bisection), two point boundary value problems (shooting method) and an eigenvalue routine (QR algorithm). Parallel coding using nested arrays is illustrated.
A practical method for code generation based on exhaustive search
Authors: David W. Krumme, David H. Ackley
Venue: Proceedings of the 1982 SIGPLAN symposium on Compiler construction (1982)

An original method for code generation has been developed in conjunction with the construction of a compiler for the C programming language on the DEC-10 computer. The method is comprehensive, determining evaluation order and doing register allocation and instruction selection simultaneously. It uses exhaustive search rather than heuristics, and is table-driven, with most machine-specific information isolated in the tables. Testing and evaluation have shown that the method is effective, that the search process is not too time consuming, and that the compiler is capable of producing code as good as that of other optimizing compilers.
Computer graphics research in Japanese Universities
Venue: ACM SIGGRAPH Computer Graphics (1984)

There is considerable research activity related to computer graphics within the Japanese academic community. However, little is known about it outside of Japan. Another problem is that some of the most interesting work being done is not called &ldquo;Computer Graphics&rdquo; and is therefore only reported in other fields such as &ldquo;Precision Engineering&rdquo; or &ldquo;Image Processing.&rdquo; Interpreting &ldquo;Computer Graphics&rdquo; broadly, this panel will survey the work of three leading Japanese researchers who will each briefly describe the history of computer graphics at their institutions, outline the level of staffing and equipment resources in their laboratories and report on their current areas of research activity. These presentations will be proceeded by the chairman's overview discussion about Japanese University research, in general. The panel will conclude with a question and answer period. Professor Makoto Nagao, Department of Electrical Engineering, Kyoto University, Sakyo, Kyoto, Japan - The main thrust of research at Kyoto University has been in the field of digital image processing systems. Work began in 1965 on the problem of Japanese character recognition. One of the earliest digital processing systems in Japan was also designed. Working from beliefs about the human pattern recognition process, efforts were directed towards the development of a structural approach rather than mathematical theories which were popular during the early days of character recognition research. Current topics of interest include the modeling of more human-like image understanding functions, such as trial and error processes, knowledge-driven analysis processes and declaritive representation for image understanding. These can be summarized under the theme &ldquo;Image Interpretation by Knowledge Presentation&rdquo;.
Using the computer to plan production in a flow shop
Authors: Dana B. Hopkins,  Jr.
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Management of one of the Company's product lines must submit contract bids during one year for manufacture, with start and due dates, any time in the next five years. In the past, management had insufficient information as to the effects a new contract would have on the their manpower requirements, resource utilization, and present contracts. The solution was to simulate production. The results of the simulation was a general schedule for production along with manpower utilization under given capacity constraints. This general schedule is not used for day-to-day scheduling of operations. Rather, it is used for &ldquo;middle range planning&rdquo;, three months to a couple of years, where manpower levels and equipment are variables instead of constraints. Management reviews the output and makes any desired capacity and/or contract changes. A new simulation is made and the process repeats itself until management has determined what contracts to bid on and what the their manpower and equipment needs will be during the &ldquo;middle range&rdquo;.
Automatic placement of rectangular blocks with the interconnection channels
Authors: R. Malladi, G. Serrero, A. Verdillon
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper describes a placement method of rectangular blocks with the interconnection channels. The method consists of a constructive initial placement followed by an iterative improvement. An estimation of the interconnection channel widths, the number of crossovers and the connection lengths is proposed. The criteria to be minimized are: area, number of crossovers and connection length.
SPURR&mdash;system for projecting utilization of renewable resources
Authors: G. E. Bennington, K. K. Rebibo
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

The METREK Division of The MITRE Corporation has developed a computerized System for Projection of the Utilization of Renewable Resources&mdash;SPURR. SPURR is an annual simulation model used to study the market penetration of new energy technologies such as distributed and centralized solar energy conversion systems. This model is intended to fill the gap between the aggregate national energy models 1,2,3 and the uncoordinated analyses of individual applications, e.g., solar hot water heating. The level of detail and modeling structure has been selected to permit analysis of the critical issues involved: &bull; The dynamic nature of the growth &bull; The techno-economic description of a wide range of conventional and new systems &bull; Cost reduction from mass production and accumulated experience &bull; The interface between the utility and the energy consumer &bull; Market segmentation and behavior
Some major modifications to a new method for solving ill-conditioned polynomial equations
Authors: Donna K. Dunaway, B. Lynn Turlington
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Several major modifications have been made to a method proposed by Garside, Jarratt and Mack for finding roots of polynomial equations. The modifications have reduced the number of iterations and provided a set of starting values for the iterative procedure by implementing modified versions of Lehmer's method that assure convergence. The modifications were successful and a general purpose root finding algorithm that solves ill-conditioned polynomial equations has been produced. Numerical examples and comparisons are presented to substantiate the modified method's effectiveness.
A depth-first branch-and-bound algorithm for optimal PLA folding
Authors: Werner Grass
Venue: Proceedings of the 19th Design Automation Conference (1982)

In this paper we are concerned with the PLA folding problem defined by Hachtel, Newton and Sangiovanni-Vincentelli. We propose a depth first branch and bound procedure for optimizing simultaneous row and column folding. With our procedure one can compute such a PLA folding which is optimal with respect to different practical constraints. We present some results of an implemented algorithm that is restricted to row folding.
A guide to recent advances in integer programming methods
Authors: Mary F. McGuire
Venue: Proceedings of the 1971 26th annual conference (1971)

This paper is intended to be a guide to the reader interested in new developments in integer programming methods over the past six years. Advances in dual, primal, enumerative and group theoretic procedures are surveyed in an attempt to bring together work that has been scattered over many journals at different times.
Models for assignment of 911 emergency telephone operators
Authors: Peter Kolesar, Albert Pedrinan, Peter Stein
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

We discuss the design and implementation of a SIMSCRIPT simulation of the 911 emergency telephone system in New York City. The simulation was created to aid the New York City Police Department in scheduling operators and controlling the flow of calls through the system so that delays could be kept to tolerable levels while the system was run economically. A second goal was to use the simulation to validate an approximate analytic queueing model of the complex system. The queueing model based on the M/M/C queue can be used to provide quick responce to management questions.
Optimum ordered hash tables
Authors: Donald L. Adolphson, Glenn N. Thomas
Venue: Proceedings of the 1977 annual conference (1977)

This paper investigates a relatively new file structure known as an ordered hash table which combines the flexibility of indexed sequential files with the rapid access of traditional hashing methods. The main results of the paper are: (1) a characterization of optimal hash tables allowing for differing access frequencies among the keys, and (2) an algorithm to construct an optimal ordered hash table. The details of the algorithm are given for the special case of unit bucket size but it may be extended to cover large bucket sizes.
Text processing - where do we go from here?
Authors: Sandra Piazza
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

Most universities have sort of &ldquo;backed into&rdquo; the word-processing/text-processing business. As large computers become more sophisticated and small word-processing micros become more readily affordable, large numbers of students, faculty, and staff have discovered the joys of online text editing and formatting and have demanded access to these types of systems. This can, and at times does, lead to uncontrolled growth and even pandemonium as users vie for time on the terminals and machines and demand specialized assistance from user services personnel. Since there was no &ldquo;master plan,&rdquo; the process of inputting, editing, formatting, previewing, and outputting text is currently done very much piecemeal using whatever hardware and software is available at the time. This worked fine with the small numbers of knowledgeable users who first got interested in computerized text processing as an outgrowth of their other computer-related activities. However, with more and more &ldquo;lay&rdquo; users appearing every day with new text-processing applications there has developed a real need to organize and give a direction to this previously uncontrolled field. This paper will discuss what is being done at Clemson University to provide these controls and will touch on the concept of a Fully Integrated Text Processing System, which is the topic of a white paper recently started by the Document Composition Project of IBM's SHARE user group.
Computer simulation of foliage shading in building energy loads
Authors: Marc Schiler, Donald P. Greenberg
Venue: Proceedings of the 16th Design Automation Conference (1979)

The calculation of building thermal loads using the computer has been an accepted practice for several years. A substantial amount of research and theoretical investigation has been expended in attempts to accurately quantify a building's thermal behavior. A number of existing simulation packages acceptably model this behavior.1,2,3,4,5,6 The advantages of simulation are obvious, not only for the predictive information with respect to operating costs or fuel consumption, but as a potential aid for preliminary design. The influence and tradeoffs of a large number of design variables such as siting, orientation, window area, thermal resistivity, surface/volume ratios, and cost can all be examined at an early stage in the design process.
A deeper look at data
Authors: Ned Chapin
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

For sharpness in presentation, and for improved reader comprehension, this paper draws frequent contrasts to George H. Mealy's pleasingly-reasoned and useful paper by the title of &ldquo;Another Look at Data.&rdquo; 1Since it is assumed that the reader has access to that paper, no summary of it is presented here, but from time to time, some of George H. Mealy's definitions and positions will be paraphrased. This is not to suggest that others have not made contributions. On the contrary, many persons have addressed themselves to the problem of data organization within the confines of information retrieval (see for instance, 2,3), and to the organization of files (see for instance, 4,5,6,7).