Showing papers on "Component (UML) published in 1985"

The interaction between national and organizational value systems[1]

Abstract: Organizations have prevalent value systems which are part of their organizational cultures. These value systems show a national component according to the nationality of the organization's founder(s) and dominant elite. Research data on national value systems in 53 countries and regions are used to suggest the kind of influence nationality is likely to have on organizational value systems, and what this means for the integration within an organization of persons and groups of different national origins.

Dynamic Configuration for Distributed Systems

Abstract: Dynamic system configuration is the ability to modify and extend a system while it is running. The facility is a requirement in large distributed systems where it may not be possible or economic to stop the entire system to allow modification to part of its hardware or software. It is also useful during production of the system to aid incremental integration of component parts, and during operation to aid system evolution. The paper introduces a model of the configuration process which permits dynamic incremental modification and extension. Using this model we determine the properties required by languages and their execution environments to support dynamic configuration. CONIC, the distributed system which has been developed at Imperial College with the specific objective of supporting dynamic configuration, is described to illustrate the feasibility of the model.

A review of time-domain and frequency-domain component mode synthesis method

Abstract: Hurty (1965) has conducted a dynamic analysis of structural systems using component modes. The component mode synthesis (CMS) procedure considered by him represents a form of substructure coupling analysis which is often utilized in structural dynamics. Time-domain CMS methods employing real modes are discussed, taking into account real component modes, normal modes, redundant constraint modes, rigid-body modes, attachment modes, inertia-relief modes, statically-complete interface mode sets, dynamic component mode supersets, component modal models, the coupling of components, and the classification of methods. Attention is also given to the experimental determination of component mode synthesis parameters, time-domain CMS methods for damped systems, and frequency-domain CMS methods for damped systems.

A hierarchical data structure for representing assemblies: part I

Abstract: A data structure representing assemblies in a database can be divided into two parts. The first part is the data structure used to store topological and geometric information on each component in an assembly. The second part is the data structure used to store information on how all the components in an assembly are connected. Any existing ‘boundary representation’ scheme can be used to represent each component. In this paper, a winged-edge data representation with extensions to handle multiply-connected faces is recommended. A tree structure using the concept of ‘virtual link’ is created to represent the relationships between the components in an assembly.

Inference of the positions of components in an assembly: part 2

Abstract: A method is derived to compute the location and orientation of each component from the spatial relationships imposed on the component in an assembly. With this method, any assembly can be represented by the spatial relationships between its components instead of by the transformation matrices of each component.

Design and implementation of the Wisconsin storage system

Abstract: We describe the implementation of a flexible data storage system for the UNIX environment that has been designed as an experimental vehicle for building database management systems. The storage component forms a foundation upon which a variety of database systems can be constructed including support for unconventional types of data. We describe the system architecture, the design decisions incorporated within its implementation, our experiences in developing this large piece of software, and the applications that have been built on top of it.

Signature Methods for the Assignment Problem

Abstract: The "signature" of a dual feasible basis of the assignment problem is an n-vector whose ith component is the number of nonbasic activities of type i, j. This paper uses signatures to describe a method for finding optimal assignments that terminates in at most n-1n-2/2 pivot steps and takes at most On3 work.

Study of two-component system with failure interaction

Abstract: The literature on multicomponent systems, though extensive, has dealt mainly with formulations where the failure of a component has no effect or influence on the operation or failure of other components in the system. In many real-life multicomponent systems, the failure of a component has some effect on one or more of the remaining components. The paper considers a two-component system with a specific type failure interaction and obtains expressions for the expected cost of operating the system for both finite and infinite time.

The aggregate update problem in functional programming systems

Abstract: We discuss the problem of efficiently implementing aggregates (contiguous data structures) such as arrays in functional programming systems. Simple changes to an aggregate conceptually involve making a new copy of the aggregate differing only in the changed component, but such copying can be expensive. We present both static and dynamic techniques for avoiding this copying, and argue that they allow one to program functionally using aggregates, without loss of efficiency over conventional programs.1

Geometric algorithms for digitized pictures on a mesh-connected computer

Abstract: Although mesh-connected computers are used almost exclusively for low-level local image processing, they are also suitable for higher level image processing tasks We illustrate this by presenting new optimal (in the O-notational sense) algorithms for computing several geometric properties of figures For example, given a black/white picture stored one pixel per processing element in an n × n mesh-connected computer, we give ?(n) time algorithms for determining the extreme points of the convex hull of each component, for deciding if the convex hull of each component contains pixels that are not members of the component, for deciding if two sets of processors are linearly separable, for deciding if each component is convex, for determining the distance to the nearest neighboring component of each component, for determining internal distances in each component, for counting and marking minimal internal paths in each component, for computing the external diameter of each component, for solving the largest empty circle problem, for determining internal diameters of components without holes, and for solving the all-points farthest point problem Previous mesh-connected computer algorithms for these problems were either nonexistent or had worst case times of ?(n2) Since any serial computer has a best case time of ?(n2) when processing an n × n image, our algorithms show that the mesh-connected computer provides significantly better solutions to these problems

Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer

Abstract: Although mesh-connected computers are used almost exclusively for low-level local image processing, they are also suitable for higher level image processing tasks. We illustrate this by presenting new optimal (in the O-notational sense) algorithms for computing several geometric properties of figures. For example, given a black/white picture stored one pixel per processing element in an n × n mesh-connected computer, we give ?(n) time algorithms for determining the extreme points of the convex hull of each component, for deciding if the convex hull of each component contains pixels that are not members of the component, for deciding if two sets of processors are linearly separable, for deciding if each component is convex, for determining the distance to the nearest neighboring component of each component, for determining internal distances in each component, for counting and marking minimal internal paths in each component, for computing the external diameter of each component, for solving the largest empty circle problem, for determining internal diameters of components without holes, and for solving the all-points farthest point problem. Previous mesh-connected computer algorithms for these problems were either nonexistent or had worst case times of ?(n2). Since any serial computer has a best case time of ?(n2) when processing an n × n image, our algorithms show that the mesh-connected computer provides significantly better solutions to these problems.

Solar energy fundamentals and design : with computer applications

Abstract: Designed for a course in solar engineering in four-year programs, this text covers the latest advances of the past five years in addition to the basics necessary for student understanding. It includes discussions of the most promising industrial applications, particularly in the high temperature range and emphasizes complete system design and economic considerations as well as individual component design and specification.

Sur-face auditory evoked potentials in the unrestrained rat: component definition.

Abstract: Auditory evoked potentials (AEPs) to click and pure tone stimuli were recorded in unrestrained, unanesthetized rats. The middle latency rat AEPs (N17, P23, N38) had midline scalp distributions similar to human MAEPs and were recorded to within 15 dB above BAEP threshold. In contrast to human MAEPs, rat MAEPs were decreased in amplitude at high stimulation rates and only the N17 component was unaltered by slow wave sleep. The longer latency N50, N80 and P130 components had several response properties comparable to human N100-P200 vertex potentials. These included restricted midline fronto-central scalp distributions, progressive increases in amplitude at ISIs up to 4-8 sec and marked attenuation during slow wave sleep. The frequency sensitivity of the rat AEP revealed a decreased response to pure tones below 4 kHz but robust responses for stimuli up to at least 45 kHz. There was a notch in the rat audiogram with decremented component amplitudes to pure tone stimuli centered at 35 kHz. When equated for intensity, click and pure tone stimuli in the range of the rats maximal audiometric sensitivity (8-20 kHz) generated comparable AEP components. These results provide normative data on rat surface recorded AEPs. It is suggested that these surface recorded rat AEPs are generated by subcortical neural systems involved in the detection of auditory transients.

Aerothermodynamics of Aircraft Engine Components

Abstract: Beginning with the basic principles and concepts of aeropropulsion combustion, this text goes on to explore specific processes, limitations and analytical methods as they bear on component design. The text features invited work of prominent specialists in aircraft gas turbine engines.

Optical component package

Abstract: Disclosed is an optical package including at least one electro-optical component aligned with at least one optical fiber. The electro-optical component is mounted on a surface which is essentially parallel to, but not coplanar with, the longitudinal axis of the fiber and light is coupled between the fiber and component by bending the light path. Electrical connection to the component is provided by conductors mounted over the same surface, thus producing a compact package. The invention is used preferably with arrays of components and fibers to eliminate the need for a vertical fanout to contact the components.

An extensible object-oriented approach to databases for VLSI/CAD

Abstract: This paper describes an approach to the specification and modeling of information associated with the design and evolution of VLSI components. The approach is characterized by combined structural and behavioral descriptions of a component. Database modeling requirements specific to the VLSI design domain are considered and techniques to address the are described. An extensible object-oriented information management framework, the 3DIS (3 Dimensional Information Space), is presented. The framework has been adapted to capture the underlying semantics of the application environment by the addition of new abstraction primitives. An example 3DIS database for a VLSI design system is presented.

A model and temporal proof system for networks of processes

Abstract: A model and a sound and complete proof system for networks of processes in which component processes communicate exclusively through messages is given. The model, an extension of the trace model, can describe both synchronous and asynchronous networks. The proof system uses temporal-logic assertions on sequences of observations — a generalization of traces. The use of observations (traces) makes the proof system simple, compositional and modular, since internal details can be hidden. The expressive power of temporal logic makes it possible to prove temporal properties (safety, liveness, precedence, etc.) in the system. The proof system is language-independent and works for both synchronous and asynchronous networks.

System for assembling electronic component kits

Abstract: A system for machine assembly of component kits for electronic printed circuit boards is disclosed. Components for assembling the kits are stored in a plurality of standardized machine recoverable trays, more specifically a multi-level carousel. An elevator transports trays between storage and an automated work station where components are removed to construct the component kits.

A software classification scheme

Abstract: Author(s): Diaz, Ruben Prieto | Abstract: Reusing code is one approach to software reusability. Code is the end product of the software lifecycle. It is delivered in a low level representation that is difficult to reuse unless an almost perfect match exists between available features and required specifications. There is a need to organize large inventories of software such that reusable code is easy to locate and exchange. The relative success in the reuse of code fragments reported by some software factories is due in part to their capacity to encapsulate domain specific functions and create specialized libraries of components classified by these locally standardized functions.A general software classification scheme that organizes reusability related attributes and common functions from different domains is proposed as a partial solution to the software reusability problem. For the problem of selecting from similar, potentially reusable. components, a partial solution based on evaluation of common characteristics is also proposed. A library system is presented that integrates the proposed classification scheme with an evaluation mechanism based on inherent component attributes, programming languages characteristics and reuser experience.The fundamental contribution of this dissertation is a formal treatment of a faceted scheme for software classification leading to better understanding of reusability at the code level. This approach has been prototyped in a library system for the semi-automatic classification of software components. Analysis were performed to evaluate the classification scheme. The results show the potential of the scheme in organizing collections of code fragments, in improving retrieval, and in simplifying the classification process. Tests of the evaluation mechanism showed positive correlation with evaluations conducted by potential reusers.

DICTIONARIES of THE MIND

Abstract: How lexical information should be formulated, and how it is organized in computer memory for rapid retrieval, are central questions for computational linguists who want to create systems for language understanding. How lexical knowledge is acquired, and how it is organized in human memory for rapid retrieval during language use, are also central questions for cognitive psychologists. Some examples of psycholinguistic research on the lexical component of language are reviewed with special attention to their implications for the computational problem.

Optical linear algebra processors: noise and error-source modeling.

Abstract: The modeling of system and component noise and error sources in optical linear algebra processors (OLAP's) are considered, with attention to the frequency-multiplexed OLAP. General expressions are obtained for the output produced as a function of various component errors and noise. A digital simulator for this model is discussed.

On component analyses

Abstract: Principal components analysis can be redefined in terms of the regression of observed variables upon component variables. Two criteria for the adequacy of a component representation in this context are developed and are shown to lead to different component solutions. Both criteria are generalized to allow weighting, the choice of weights determining the scale invariance properties of the resulting solution. A theorem is presented giving necessary and sufficient conditions for equivalent component solutions under different choices of weighting. Applications of the theorem are discussed that involve the components analysis of linearly derived variables and of external variables.