Showing papers on "Object (computer science) published in 1972"

Three-dimensional Image Reconstruction from the Viewpoint of information Theory

Abstract: Criteria are given for obtaining maximum information from a set of projections of a general object while preventing the introduction of spurious detail by effects which are beyond resolution

Optimal Binary Identification Procedures

Abstract: Binary identification problems model a variety of actual problems, all containing the requirement that one construct a testing procedure for identifying a single unknown object belonging to a known finite set of possibilities. They arise in connection with machine fault-location, medical diagnosis, species identification, and computer programming. Each binary identification problem consists of a finite set of possibilities for the unknown object and a finite set of binary-valued tests which are to be applied to identify the unknown object. Associating a fixed cost with each test and, with each object possibility, a probability that it is the unknown object, one would like to construct an optimal identification procedure which will identify the unknown object with minimal expected testing cost.We first describe the basic model for binary identification problems and present a number of general results, including a dynamic programming algorithm for constructing optimal identification procedures. The main res...

The Logic of Automated Map Lettering

Abstract: The logic behind the placement of names on maps is investigated as part of a study, the object of which is the automation of map lettering. After describing the basic principles the author illustrates his solution.

Rectangular Distance Location under the Minimax Optimality Criterion

Abstract: Various versions of the Weber problem deal with the location of facilities in a system with fixed destinations or customers. The object is to minimize the sum of transportation costs, which is represented as the sum of the weighted distances in the system. This paper finds the optimum location for facilities where the object is to minimize the maximum weighted distance in the system. Rectangular distances, which are more appropriate for urban transportation than straight line distances, are used in the model. Optimization is achieved through parametric linear programming.

Decorative three-dimensional objects

Abstract: A method of decorating objects rapidly is provided. A band of heat-shrinkable plastic is provided with a decorative pattern and is placed on the object. Heat is applied to the band causing it to shrink and conform to the shape of the object being decorated.

Description driven microprogrammable multiprocessor system

Abstract: In a multiprocessor system, a source of description is provided in a unique work area assigned to each user program or process that references data and program stored in memory. Each description includes a first field defining the structure and format of the data, a second field specifying the location of the objects, the size of the object and any limits imposed, and a third field for controlling access and governing the data usage. Also included in each description are operating system flags which cause an operating system function to be executed at the microprogram level. Individual instructions of an instruction set for the multiprocessing system are executed with descriptions which interpret the instruction, executes the indicated instruction operation as defined by the fields of description, and may call for the next instruction.

Self-organizing control system

Abstract: This disclosure relates to improvements in self-organizing control logic configurations having particular application to automatically or remotely piloted vehicles The improvements include the use of multiple-point (time-distributed) functions for control system performance assessment, the use of performance assessment value-signal magnitude information to govern parameter step sizes, and means for controlling an object that is rotating with a determinable angular rate but unknown phase angle relative to a fiducial angular position of the object

Support media with supported object

Abstract: Pellicles of para-xylylene polymers are used as the sole support media for masses of objects supported thereon. The supported objects can be combined with the pellicle either during the formation of the pellicle or after the pellicle has been manufactured. The composite article is used wherever it is desirable to provide a support media which has as little detrimental influence as possible on the intended function of the supported object.

Method of verifying the authenticity of a document and identifiable document produced thereby

Abstract: The invention disclosed herein pertains to a means of verifying the authenticity of a document, identification card, or any object for which a means of establishing authenticity is desired, whereby such document, I.D. card or other object, hereinafter referred to generically as ''''document,'''' is treated with a suitable thermoluminescent phosphor in a coded manner and for subsequent verification is exposed to a means for detecting the presence of said thermoluminescent phosphor and for deciphering the message thereby embodies in such document.

Cost effective priority assignment in network computers

Abstract: Previously, the study of network computers has been focused on the analysis of communication costs, optimal message routing, and the construction of a communications network connecting geographically distributed computing centers. While these problems are far from being completely solved, enough progress has been made to allow the construction of reasonably efficient network computers. One problem which has not been solved, however, is making such networks economically viable. The solution of this problem is the object of our analysis.

Electrically controlled apparatus for marking objects

Abstract: An electrically controlled apparatus for marking an object traveling along a conveyer with characters such as letters and/or figures wherein code signals corresponding to the characters which are punched in by a keyboard are stored. The presence of the object along the conveyer and the speed of travel thereof are sensed by sensing means and read-out of the the storage signals is controlled by the sensed rate of travel of the object and marking devices are activated in accordance with the read-out signals. The marking devices may be arranged in a single row of five marking devices.

Self-aligning object placement apparatus

Abstract: An object positioning and placement apparatus capable of engaging the object within a pickup zone, moving the object into a preselected translational and rotary orientation, and placing the oriented object onto a receiving member. The object pickup assembly is freely movable within a pickup zone for locating and engaging the object without the requirement of either precision object placement for pickup or close construction tolerances in the pickup assembly itself. After engaging the object, the object pickup assembly is then brought into contact with a homing member causing the object pickup assembly and the object engaged thereby to assume the preselected translational and rotary orientation with respect to the receiving member for placing the object onto the receiving member.

Method of fixing a cylindrical object having a central hole, and support therefor

Abstract: The object, e.g. a roll of paper, is fixed on a central tubular support provided with a shaft. The orientation of the axis of the object can be modified with respect to that of the shaft and the object locked on the support in the position corresponding to the desired orientation. The object rests by one of its flat surfaces on a guide perpendicular to the axis of the support, and the object is locked on the support, so that the axis of the shaft and that of the object are parallel.

A General Purpose Graphical Language.

Abstract: : The paper describes a high-level extensible language for graphical applications. The language allows the user to define new data types and new operations with these data types to suit his needs and to simplify subsequent programming. Data types and operations for creating three-dimensional polyhedral objects and for specifying transformations on objects are presented, together with examples. Objects can also be created and editted by working interactivelyly. Motions and other functions, such as interpolation, that apply to an object, can be described in the written language or interactivel as well. Thus the user can create his own suitable environment and depending upon the nature of the problem, he can work with a written language or interactively, or he can work with a combination of both methods. Such flexibility at a high-level should simplify the use of graphical facilities. (Author)

Experiments with an on-line picture language

Abstract: During the investigation of diverse pattern recognition problems it has become increasingly apparent that recognition of objects in a complex picture cannot be treated as an open loop process consisting of feature extraction and classification. A paradox is encountered in that reliable features can only be extracted if the object in the picture has been recognized, but the object cannot be recognized before its features are identified. The recognition process is better characterized by a closed-loop process containing an hypothesis testing procedure. Starting even from a single feature, which has been detected and recognized only to a certain degree as being a known feature, the machine will have to form an hypothesis as to which objects this feature may belong to and what additional information has to be gathered from the picture before the feature can be recognized with greater reliability. Only then can the machine improve on feature detection, search out other features expected to belong to the hypothesized object and decide whether its hypothesis can be maintained in the context of the given recognition problem. Some of the problems encountered in trying to realize such a system are discussed. The proposed solutions have been tested to some degree by using an online picture language program. A preliminary version of the online picture language has been completed. By using a controllable flying spot scanner the computer has direct access to a picture of about 4000 × 4000 resolution elements. The picture is treated as a read only memory and it may contain many different objects. The entire program consists of three major subdivisions labelled (a), (b), (c). (a) Atom Formation, Description and Recognition: A complicated object is fragmented (“atomized”) by using an algorithm which operates with or without guidance. If guided, the operator may only point out the approximate location of the atom that he proposes to the machine. The algorithm decides whether the area can be considered to be an atom and how much of the object it should include. A description of the atom is formed and normalized, before it is compared against already known “ideal” atoms. If the match is sufficiently good, the presented fragment is considered to be a realization of the best matching ideal atom. If the match is inadequate, the fragment becomes a new “ideal” atom. (b) Teaching of Object-Inter-relationships: When all the fragments (or a sufficient number of them) have been extracted, the operator instructs the computer how these atoms are to be interrelated for a given object. The operator can teach the machine expressions of the type: “If you see atom a1 (at location (xo, yo)), go search for atom a2 (at location (x1, y1))”, or “an object 02 consists of atoms a1, a2 and a3 (01 = a1 . a2 . a3)”, or “object 1 (01) is the same as object 2 (02), i.e., 01 = 02”. The position, size and rotation relationships between the atoms and objects are retained. (c) Recognition of Objects: In the recognition part of the system, the taught relationships are used to guide the machine from the identified atoms to the expected atoms until an object of the desired class has been identified or all the usable taught relationships have been exhausted. During running of the recognition programs the machine appeared to behave as if it “understood” the problem by going from one atom to the next in a systematic exploration of the picture. However, it also became apparent that the machine needs a goal-seeking algorithm in the recognition stage to guide it through the maze of instructions via the shortest path. At present the object fragmentation stage (a) can be run without human interference and there appear to exist no unsurmountable programming problems to automate step (b), i.e., to allow the machine to teach itself. The present programs are written for two-dimensional objects. Extension to three-dimensional objects is conceptually simple.

Non-linear equation solving for continuous simulation

Abstract: Continuous systems simulation languages are intended to provide solutions consisting of interconnections of simple building blocks to the extent that input descriptions of a system resemble the way it is physically connected. Generally, the aim of most investigators, if it is not to obtain answers, is at least to learn more about the system and not mathematics or the language itself. Yet, most languages implemented today impose servere restrictions on problem formulation. This is the first of a series that will investigate continuous simulation with the object of indicating ways of increasing the value of a simulation language to the investigator by suitably extending the capabilities of present programs.

Geometric f-object and a local coordinate system

Abstract: l a t h i s paper we describe the p rope r t i e s ot geometric obj e c t s .understood according to the d e f i n i t i o n given i n a paper of W. Waliszewski [ 7 ] . T&e present work continues inv e s t i g a t i o n s i n i t i a t e d i n [ 7] • We do not use any a lgebraic not ion. At the end of t h i s paper we discuss the connection with the previously used not ions of geometric ob jec t .