scispace - formally typeset
Search or ask a question

Showing papers on "Layer (object-oriented design) published in 1996"


Patent
12 Apr 1996
TL;DR: In this paper, a process controller implements an overall, user-developed control strategy in a process control network that includes distributed controller and field devices, and a user defines a module control strategy by specifying function blocks that make up control modules and determine the control strategy.
Abstract: A process controller implements an overall, user-developed control strategy in a process control network that includes distributed controller and field devices. A user defines a module control strategy by specifying function blocks that make up control modules and determine the control strategy. The user modifies or debugs a module control strategy by adding, modifying and deleting function blocks, configuring parameters associated with the function blocks and creating a view to new attributes. By defining function blocks and control modules, a user-defined control strategy, application program or diagnostic program is represented as a set of layers of interconnected control objects identified as modules. A layer of the control strategy includes a set of modules which are interconnected in a user-specified manner. A module typically includes an algorithm for performing a specific function and display components which are used to display information to a user. A module is optionally represented to include a set of input and output connections for connecting to other modules. A module may be considered to be a "black box" which performs a specified function and is connected to other modules via specified input and output connections.

179 citations


Patent
30 Apr 1996
TL;DR: In this paper, the authors present a regression testing system for application logic within a software system, where the presentation layer is separated into a presentation layer, an application layer, and a data/storage layer.
Abstract: A method and system for regression testing of application logic within a software system. Software architecture can be separated into a presentation layer (e.g., user interface), an application layer (e.g., business logic), and a data/storage layer. Within the novel testing system, communication interfaces between the presentation layer and the application layer are identified such that user initiated commands ("events") passed from the presentation layer to the application layer are recorded into a test playback event file. During test playback event recordation, differences in the state of the application layer of a reference program are collected into a reference state log file. To test a program, the recorded events of the test playback event file are played back and applied directly to its application layer. After each event, the differences in the state of the program are collected into a test state log file. The reference and test state log files are compared and differences are stored in an error or summary difference file. By recording events that enter the application layer, in lieu of the user entered commands that enter the presentation layer, the novel testing system is insensitive to changes in the presentation layer and allows more direct testing and error detection of the application layer. By recording differences in the state of the application layer on an event by event basis, in lieu of recording differences in information presented to the user, the novel system allows more effective error detection and error isolation of the application layer.

105 citations


Patent
Colin D. McCartney1
30 Oct 1996
TL;DR: In this paper, a helper process is proposed to release resources and destroy objects in either the shared API layer or the shared hardware driver layer after termination of the resource allocation process, which is useful in a computer system where shared hardware is accessed via a shared HPC layer.
Abstract: The present invention relates to systems and methods for freeing shared resources that remain allocated to a particular resource allocating process after the resource allocating process has terminated The invention is useful in a computer system where shared hardware is accessed via a shared hardware driver layer The shared hardware driver layer interfaces with either a shared API layer or a nonshared API layer. Processes wishing to access the shared hardware access the hardware through either the shared or nonshared API layer. To release resources and destroy objects in either the shared API layer or the shared hardware driver layer, the present invention uses a helper process that cleans up after termination of the resource allocation process. The helper process first calls, cleanup function in the shared API layer to release resources and destroy objects in the shared API layer and associated hardware driver. The helper process then loads a copy of the nonshared API layer and makes a call to a similar cleanup function to release any remaining resources and destroy any remaining objects. In the alternative, the helper process loads a copy of the nonshared API layer and calls to the similar cleanup function are made by the cleanup function in the shared API layer.

84 citations


Patent
19 Dec 1996
TL;DR: In this paper, a security document (1) with a security component (2) which has at least a first layer with recesses (9) in the form of signs or patterns or the like is described.
Abstract: The invention relates to a security document (1) with a security component (2) which has at least a first layer with recesses (9) in the form of signs or patterns or the like. Said element also has a discontinuous magnetic layer which is arranged below said first layer and is in the form of a code. In the areas in which the recesses (9) and the magnetic layer overlap, the recesses (9) are also in the magnetic layer. The invention also relates to a security component (2) and a method for the production of said component (2) and the document (1).

49 citations


Journal ArticleDOI
TL;DR: This paper presents an extended version of the earlier derivation algorithms that can handle all operators and unrestricted process invocation and recursion as defined by basis LOTOS and the correctness of this derivation algorithm is formally proved.
Abstract: A complete communication system is broken down into a number of protocol layers each of which provides services to the layer above it and uses services provided by its underlying layer. A service specification defines a particular ordering of the operations that a given layer provides to the layer above it. The active elements in each layer are called entities and they use a protocol in order to implement their service definition. On the basis of this relation between the service and protocol concepts we have developed algorithms for deriving protocol entity specifications from a formal service specification. The derived protocol entities ensure the correct ordering of the service primitives by exchanging synchronization messages through an underlying communication medium. This paper presents an extended version of our earlier derivation algorithms. This version of the algorithm can handle all operators and unrestricted process invocation and recursion as defined by basis LOTOS. The correctness of this derivation algorithm is formally proved.

45 citations


Proceedings Article
01 Jan 1996
TL;DR: The paper describes the experiences in implementing four parallel programming systems using Panda and it evaluates the performance of the Panda-based implementations.
Abstract: Panda is a virtual machine designed to support portable implementations of parallel programming systems. It provides communication primitives and thread support to higher-level layers (such as a runtime system). We have used Panda to implement four parallel programming systems: Orca, data parallel Orca, PVM, and SR. The paper describes our experiences in implementing these systems using Panda and it evaluates the performance of the Panda-based implementations.

43 citations


Patent
15 Mar 1996
TL;DR: In this article, a technique for enhancing a software layer while ensuring backwards compatibility is disclosed, which allows enhancements to the hardware abstraction layer (HAL) without causing any backwards compatible problems.
Abstract: A technique for enhancing a software layer while ensuring backwards compatibility is disclosed. In one implementation, the software layer is a hardware abstraction layer (HAL) that interfaces between hardware and an operating system of a computer system. The HAL can be enhanced with additional functionality without having to worry about crashing the operating system when the particular HAL in use with the computer system lacks the additional functionality. Hence, the inventive technique allows enhancements to the HAL to be made without causing any backwards compatible problems.

22 citations


Patent
15 Oct 1996
TL;DR: In this paper, the design data of a knitted product are divided into plural layers, layer numbers are given to the layers, and the layers are stored, the default value of a layer number is the number of the latest layer plus 1.
Abstract: Design data of a knitted product are divided into plural layers, layer numbers are given to the layers, and the layers are stored. The default value of a layer number is the number of the latest layer plus 1, and the layer numbers can be modified. It is made possible to unite or group plural layers into a group, and a layer number is given to the group. It is also made possible to cancel grouping.

18 citations


Book ChapterDOI
07 Oct 1996
TL;DR: In this paper an integrated object oriented model with a distinction between types and classes is outlined and views on the datamodel can be extended to dialogue classes which enable a smooth integration of dialogue objects with the underlying datammodel.
Abstract: Information systems for highly skilled clerical workers present themselves as a collection of window-based processes with underlying procedures accessing databases. It is left to the users to continue or interrupt a certain piece of work or to switch from one application to another. Such system can be supported by three layers: a database layer, a dialogue layer and a presentation layer.

11 citations


Journal ArticleDOI
TL;DR: An extensible representation for object-oriented programs, the Object-oriented Program Dependence Graph (OPDG), is presented, which provides information sufficient for most program analysis techniques including data flow analysis, reverse engineering, interactive debuggers and other tools.
Abstract: An extensible representation for object-oriented programs, the Object-oriented Program Dependence Graph (OPDG), is presented. The representation is divided into three layers: a first layer that presents the class inheritance structure, a second layer that combines a traditional control dependence subgraph and a data dependence subgraph with objects, and a third layer that presents the dynamic, runtime aspects of an object-oriented program as an Object Dependence Subgraph. The representation is modular allowing specific tools to only use the portion required for the tool's operation. The complete representation provides information sufficient for most program analysis techniques including data flow analysis, reverse engineering, interactive debuggers and other tools.

10 citations


Patent
01 Aug 1996
TL;DR: In this paper, the authors describe a substructure having transverse battens (1a-1d) and several photovoltaic modules (3) in rows (11a-11c) side by side.
Abstract: The appts. includes a substructure having transverse battens (1a-1d) and several photovoltaic modules (3) in rows (11a-11c) side by side. The lower edge of one module extends over the upper edge of the module below, as tiles. Each neighbouring module of each transverse row are connected to one another via a rubber clamping profile or section and its grooves on each side to take the modules. There is also a filling profile, forced into a groove on the top of the first profile to press the sides of the grooves together. Each module is held on its under layer on its transverse batten by a clamp (2).

01 Jan 1996
TL;DR: In this article, the decision of multi-layered location registration (LR) areas is formulated as an integer programming problem by examining the regional subscriber densities, traffic flows and call arrival rates.
Abstract: Multi?layered location registration areas are considered to minimize the control signals at boundary cells in the microcellular systems. The decision of multi?layered location registration (LR) areas is formulated as an integer programming problem by examining the regional subscriber densities, traffic flows and call arrival rates. By relaxing the constraints of forward and reverse control channels the problem is decomposed into a number of subproblems each of which corresponds to a layer. Each subproblem is solved via a modified graph partitioning algorithm. Feasible LR areas are obtained by considering the two relaxed constraints. Computational experiments are performed in a system with 80 microcells to investigate the performance of the proposed multi?layer scheme. The simulation results indicate that the two?layer scheme generally outperforms the one?layer and three?layer methods in view of control signals.

Journal ArticleDOI
01 Sep 1996
TL;DR: According to the methodology, task/domain ontologies that are indispensable for building a reusable knowledge base are identified and a reusable task model that is an expertise model at the second layer can be built.
Abstract: A methodology to identify task/domain ontologies is proposed in this paper According to the methodology, task/domain ontologies that are indispensable for building a reusable knowledge base are identified The expertise model of the methodology has two kinds of ontologies at different abstraction levels The first one is based on a vocabulary applicable in common to the entire target field This vocabulary is used as a communication basis between domain experts and knowledge engineers The first layer of an expertise model is described in this vocabulary and is built in collaboration with them The second one is based on a generic vocabulary By defining the common vocabulary in terms of the generic vocabulary, a reusable task model that is an expertise model at the second layer can be built We evaluate the effectiveness of this methodology by applying it into substation restoration problems


Journal ArticleDOI
TL;DR: This paper presents a visual, diagrammatic OOAD method conceived to joining formality and intuitive user interaction, embodied in Mosaico, an O-O conceptual modeling tool developed at IASI-CNR.
Abstract: Object-Oriented Analysis and Design (OOAD) methods are rapidly getting a wide consensus. They are mainly based on a diagrammatic approach. Diagrams are intuitive, fast to learn and easy to use. However, they lack of a formal basis and their semantics is mainly descriptive. Furthermore, validation and verification of analysis specifications are, to a large extent, performed manually. Conversely, formal specification methods, such as Z or Larch, do not guarantee the same level of intuitiveness and have not been conceived for a diagrammatic representation.In this paper we present a visual, diagrammatic OOAD method conceived to joining formality and intuitive user interaction. The method is organised in three layers. The external layer allows the user directly manipulate diagrams representing analysis specifications. The internal layer represents the formal model of the application being analysed. Then we have an intermediate layer that decouples the two, so that the external (presentation) layer has the independence from the formal layer that allows the flexibility to meet at the best the interaction needs of the user. The proposed method has been embodied in Mosaico, an O-O conceptual modeling tool developed at IASI-CNR.

Patent
27 Sep 1996
TL;DR: In this paper, a progressive control system consisting of a reflection layer, a learning layer, and an evolutionary simulation layer is proposed to provide an evolutionary control system which provides characteristics that more than one user satisfies.
Abstract: PROBLEM TO BE SOLVED: To provide an evolutionary control system which provides characteristics that more than one user satisfy. SOLUTION: The progressive control system consists of a reflection layer, a learning layer, and an evolutionary simulation layer. The reflection layer determines a basic controlled variable, the learning layer determines a correction basic quantity, and the evolutionary simulation layer generates chromosomes by using the coupling coefficient of a control module consisting of a neural network, simulates operation for the respective chromosomes, and select chromosomes by a user's instruction according to the simulation result to evolve chromosomes. Thus the optimum control module matching the user's instruction most is acquired and the learning layer is made to learn information regarding the optimum control module.

Proceedings ArticleDOI
18 Mar 1996
TL;DR: A two-layered hybrid control architecture with multiple simple slave controllers as lower layer modules and a fuzzy supervisory controller implemented in the framework of the Kosko's bi-directional associative memory (BAM) as an upper layer module is proposed in this paper.
Abstract: A two-layered hybrid control architecture with multiple simple slave controllers as lower layer modules and a fuzzy supervisory controller implemented in the framework of the Kosko's bi-directional associative memory (BAM) as an upper layer module is proposed in this paper. The architecture can be looked at as a self-tuning procedure for parameters of the lower layer controllers based on heuristic knowledge that is implemented in the form of fuzzy if-then rules. Discussion includes an application of the proposed controller to a robot manipulator.

Patent
30 Apr 1996
TL;DR: In this paper, the authors propose a protocol monitoring module for preventing the destination of data flowing through a network A from being transmitted to a network B. This protocol is used to efficiently and easily extend a LAN system.
Abstract: PURPOSE: To efficiently and easily extend a LAN system by providing a function for preventing the destination of data flowing through a network A from being transmitted to a network B. CONSTITUTION: It is detected by a protocol monitoring module 10 that any protocol exists, a routing table 9 is activated and a port corresponding to its address is found out. When the port observed from an Ethernet exists on the side of a telephone line, similarly to the interfaces of a layer 1 (5), on the LAN side, MAC layer 6 and LLC layer 7 or the like, a logic link is established by the LAN layer 1 (5), LAC layer 6 and LLC layer 7 or the like on the telephone line side as well. When the logic link is established, the communication at the protocol level of a network layer is started. When the port exists on the ISDN side, processing is changed from the table 9 to a V25bis module 11 and a layer 3 control (3) is controlled by the procedure of V25bis. A LAPD control 2 establishes a logic link level.

Proceedings ArticleDOI
I. Kino1
14 Oct 1996
TL;DR: Queueing networks with two layer configuration of upper layer and lower layer are proposed to provide well structured hierarchy of network models for performance analysis of practical applications.
Abstract: Queueing networks with two layer configuration of upper layer and lower layer are proposed to provide well structured hierarchy of network models for performance analysis of practical applications. For two layer queueing network without outstanding queues, the product form equilibrium distribution is derived for the state of the network. Based on the result of the product form distribution, an approximate method to analyze two layer network with outstanding queues is proposed.

Patent
27 Sep 1996
TL;DR: In this article, the authors proposed a 1st neural network 12 in which at least a neuron number of one intermediate layer is smaller then the neurons number of an input layer, and the neuron numbers of the input layer and that of an output layer are equal to each other and the identify mapping has already been learned.
Abstract: PURPOSE: To more easily and precisely discriminates the attribute of an area based on received image data. CONSTITUTION: A 1st neural network 12 in which at least a neuron number of one intermediate layer is smaller then the neuron number of an input layer, the neuron number of the input layer and that of an output layer are equal to each other and the identify mapping has already been learned is made up of a characteristic extract network 12a consisting of the input layer and the intermediate layers and of one or plural networks and made up of an area discrimination network 12b linked with the characteristic extract network 12a to receive an output from the characteristic extract network 12a and providing the output of a discrimination result as to the area attribute of image data based on the image data received by the input layer of the characteristic extract network 12a.

Patent
13 Dec 1996
TL;DR: In this article, a neural network includes a pre-stage part 14 in a stem network and a plural post stage part 16 in a black network, where the pre-stage part 14 sorts an input pattern having many categories to specific groups.
Abstract: PURPOSE: To sort input characters into respective correct groups at the time of recognition and to improve the accuracy of recognition by allowing plural recognition parts in post stages to learn teacher input data in accordance with similarity between the teacher input data and reference data. CONSTITUTION: A neural network includes a prestage part 14 in a stem network and plural post stage parts 16 in a black network. The prestage part 14 sorts an input pattern having many categories to specific groups. Each post stage part 16 corrsponds to each group of the prestage part 14 and includes an input layer 16a, an intermediate layer 16b and an output layer 16c. The layer 16a is connected to the layer 16b by a coupling coefficient Nih and the layer 16b is connected to the layer 16c by a coupling coefficient who. At the time of learning the neural network, teacher input data e.g. are resorted and registered so as to be overlapped in two or more groups (post stage parts) having similarity more than a fixed value. Consequently the discontinuity of a boundary between respective groups, i.e., a boundary between feature spaces, can be improved.

Patent
06 Feb 1996
TL;DR: In this paper, a composite tag label is formed by temporarily adhering a laminated tag label 1A consisting, successively from the upper layers, of the first tag 2 having a resin layer 3 which is peelable and loses its adhesive power when peeled and the second tag 4 having an ordinary tacky adhesive layer 5 onto tape like backing paper 7.
Abstract: PURPOSE:To make distribution businesses simpler with a composite tag label to be used by being stuck to a package for door-to-door delivery and its use method by directly sticking a tag to be used as a receipt in a laminated form on articles for distribution without bringing a separately set distribution tag (receipt) at the time of distributing the articles. CONSTITUTION:This composite tag label 1 is formed by temporarily composite tag label 1 is formed by temporarily adhering a laminated tag label 1A consisting, successively from the upper layers, of the first tag 2 having a resin layer 3 which is peelable and loses its adhesive power when peeled and the second tag 4 having an ordinary tacky adhesive layer 5 onto tape like backing paper 7. This laminated tag label 1A is peeled from the tape-like backing paper 7 and is stuck to the article. A delivering person peels the first tag 2 of the upper layer at the distributing destination of the article, obtains a receipt check from a person delivered with this article. This tag is used as the article receipt.

Patent
03 Sep 1996
TL;DR: In this article, a neuron element network is equipped with a speech input layer 32, an environment layer 33, an intermediate layer 34, a speech output layer 37, and a hypothesis output layer 38.
Abstract: PURPOSE: To provide the speech recognition device which can recognize a continuous speech in units of phonemes or words by utilizing the neural network. CONSTITUTION: A neuron element network is equipped with a speech input layer 32, an environment layer 33, an intermediate layer 34, a speech output layer 37, and a hypothesis output layer 38. The spectrum a phoneme to be learnt is analyzed by an FFT device, and by inputting a speech vector string at time (t) to the speech input layer 32, the vector state of the intermediate layer 34 at time t-1 to the environment layer 33, a vector string at time t+1 as a tutor signal to the speech output layer 37, and a code string based upon the phoneme as a hypothesis to the hypothesis output layer 38, so that the time-series relation of the vector strings and the phoneme (code string) having the relation are learnt hypothetically. At the time of speech recognition, the spectrum, the cepstrum and a speech vector string outputted by the intermediate layer of a self-association type NN are inputted to the speech input layer 32 and a code string generated in consideration of time-series relation is outputted from the hypothesis output layer 38.

Patent
16 Jul 1996
TL;DR: In this paper, an unused layer is retrieved by judging the presence/absence of the corresponded layer from an identification symbol in drawing data, the number of layers required for new following drawing is calculated from a database, and the required layers are set out of the unused layers.
Abstract: PURPOSE: To automatically retrieve an unused layer and immediately use it for a new drawing of parts when the layer to newly perform drawing is required in the middle of drawing. CONSTITUTION: The unused layer is retrieved by judging the presence/absence of the corresponded layer from an identification symbol in drawing data, the number of layers required for new following drawing is calculated from a database, and the required layers are set out of the unused layers.

Patent
12 Jan 1996
TL;DR: In this article, a dynamic random access memory (DRAM) device has three separate parts, namely an input/output part, a peripheral transistor part 14, and a memory array part 16, and all these parts are formed on a p-type substrate layer.
Abstract: PURPOSE: To use different bias voltages among devices with different sizes. CONSTITUTION: A dynamic random access memory device 10 has three separate parts, namely an input/output part 12, a peripheral transistor part 14, and a memory array part 16, and all these parts are formed on a p-type substrate layer 18. The dynamic random access memory device 10 can use a separate substrate bias voltage for each part.


Proceedings Article
01 Jan 1996
TL;DR: A layered system is under development to enhance the legacy system as a backend in a WEB-enabled system and will extend access to the central data repository for Internet users of web browsers that support private-key/public-key encryption.
Abstract: A layered system is under development to enhance our legacy system as a backend in a WEB-enabled system Each layer of the system has defined functionality, leverages the investment in the layer below, and follows the strategy of reducing support requirements for workstations The mainframe system provides administrative integration of sub-systems, security, and the central data repository for most information The second layer is a graphical user interface (GUI) to the system for Windows platforms Support needs are limited by relying chiefly on X-terminals and application servers The "Intranet" layer is a WEB Server building upon the second layer gateways to provide platform-independent access to selected information and images The fourth layer, under evaluation, will extend access to the central data repository for Internet users of web browsers that support private-key/public-key encryption

Book ChapterDOI
01 Jan 1996
TL;DR: The ATM Layer is concerned with the transport of cells between users of the ATM layer, and the format of a cell at the user network interface (UNI) is depicted in Figure 1.1.
Abstract: The ATM Layer is concerned with the transport of cells between users of the ATM layer. The format of a cell at the user network interface (UNI) is depicted in Figure 1.3.1. As the ATM layer follows the paradigm of connection orientation, connections have to be set up and quality of service parameters have to be negotiated for these connections. The cell routing information contained in the header of a cell is a label, not an explicit address. The label uniquely identifies a connection on a given link. All routing information is for connections and therefore linked to the label values.

Patent
27 Feb 1996
TL;DR: In this article, a virtual layer system name registration table is used to improve the operability of layer setting by registering only a layer to be edited as original layer constitution and setting an unused layer in an invisible state.
Abstract: PURPOSE:To improve the operability of layer setting by registering only a layer to be edited as original layer constitution and setting an unused layer in an invisible state CONSTITUTION:A virtual layer system name registered in a virtual layer system name registration table 15 is read in a control part 19 A virtual layer system name to be used for editing is inputted from an input part 1 Then a virtual layer system name retrieval means 18 confirms that the inputted virtual layer system name is present in virtual layer system names read in the control part 19 Then a layer number of each layer belonging to the inputted virtual layer system name is read out of a virtual layer management table 16 in the control part 19 Those layer numbers which are thus specified are retrieved as to the management table 16 read in the control part 19 and layers which are not registered in the table 16 are set temporarily in the invisible state and can not be specified

Patent
23 Apr 1996
TL;DR: In this paper, the intermediate layer data of a graphic arithmetic result outputted from a DRC means 4 as DRC is executed by the DRC mean 4 is stored in a graphical arithmetic result file part 6, and graphic data corresponding to the stored intermediate layers data are found by a graphic algebra result extracting means 9 which performs specific operation and applied to the graphic layer data stored in the file part 3 to make an error display 8 at a layout display means 7.
Abstract: PURPOSE: To efficiently debug a DRC rule by enabling all intermediate layer data to be confirmed at a time. CONSTITUTION: The intermediate layer data of a graphic arithmetic result outputted from a DRC means 4 as DRC is executed by the DRC means 4 are stored in a graphic arithmetic result file part 6, and graphic data corresponding to the stored intermediate layer data are found by a graphic arithmetic result extracting means 9 which performs specific operation and applied to the graphic layer data stored in the file part 3 to make an error display 8 at a layout display means 7. The extracted graphic data, i.e., graphic data corresponding to the specified intermediate layer data are displayed at the display means 7 and the corresponding layer in the DRC rule is displayed. Further, the extracted intermediate layer data, i.e., intermediate layer data corresponding to the specified graphic data are displayed at a DRC rule display means 10.