Abstract: Matching (e.g., via correlation or similarity process) entities having attributes, some of which have associated values. The values of the attributes may be adjusted based on number of entities that have values for a particular attribute so that the values decrease as the number increases. The attributes of the entities may be harmonized and provided with default values so that entities being matched have common attributes defined by the union of the attributes of the entities being matched. The attributes of the entities may be expanded and provided with default values so that the entities being matched have attributes that neither had originally. Match values may be normalized to provide a weight value which may be used to predict an attribute value of a new entity based on known attribute values of known entities. The weight values may be tuned such that relatively high weights are amplified and relatively low weights are suppressed.

Abstract: The fuzzy filtering of a noise signal comprising a plurality of signal samples [s(t,k)] is carried out using as variables the variation of the signal in the considered window and the distance of the samples from a sample to be reconstructed, to distinguish the typical variations of the original signal from those due to the noise and to identify the signal fronts. The method comprises the steps of defining a current signal sample [s(t)] from among the plurality of signal samples, calculating a plurality of difference samples [D(t,k)] as the difference in absolute value between the current signal sample and each signal sample and defining distance values (k) between the current signal sample and each signal sample.

Abstract: A health care information management system that utilizes modular and reusable software objects to allow for user configuration. The disclosed information management system allows for the creation by the user of software objects representative of specific events and resources which will occur or be utilized during the provision of health care to patients. These user configured software modules then allow the user to track the provision of health care, the utilization of resources during the provision of health care, the allocation of resources to perform medical procedures and identify opportunities for enhancing efficiencies in the provision of health care services. In one embodiment of the invention described, the system allows for the user to create, manage and maintain software modules representing specific procedural pathways to be performed in a health care institution. The user creates these modules using user configurable software objects that function to represent containers, resources and data.

Abstract: A method and system for anticipatory optimization of computer programs. The system generates code for a program that is specified using programming-language-defined computational constructs and user-defined, domain-specific computational constructs. The system generates an abstract syntax tree (AST) representation of the program. The AST has nodes representing the computational constructs of the program. For each user-defined, domain-specific computational construct, the system determines whether a user-defined, domain-specific transform has been defined for the computational construct. The transform transforms a portion of the AST relating to the user-defined, domain-specific computational construct into one or more programming-language-defined computational constructs. When a domain-specific transform has been defined for the computational construct, the system transforms the AST in accordance with the domain-specific transform.

Abstract: A system and a method for tracking long term performance of a vibrating body such as a gas turbine, includes a vibration sensor who time domain outputs are transformed to the frequency domain, using a fast Fourier transform processing. Frequency domain outputs are provided as inputs to a fuzzy adaptive resonance theory neural network. Outputs from the network can be coupled to an expert system for analysis, to display devices for presentation to an operator or are available for other control and information purposes.

Abstract: A “virtual string” is generated for synthesizing sound produced by plucked-string instruments using recurrent neural networks. The disclosed recurrent neural network, called a Scattering Recurrent Network (SRN), is based on the physics of waves traveling in the string. Vibration measured from a plucked string is used as the training data for the SRN. The trained SRN is a virtual model capable of generating tones similar to the tones generated by the physical string. As with a real string, the “virtual string” corresponding to the SRN responds differently to different types of string “plucking” motions.

Abstract: A system for generating a patch file from an old version of computer code which consists of a series of elements and a new version of computer code which also consists of a series of elements. Both the old and new versions of computer code are stored in a memory of a computer. An alphabet for processing the old and new versions of computer code is programmed into the computer and, once established, the old version of computer code is sorted with the data processor alphabetically according to the established alphabet to create a first sorted list of code. A pointer is maintained in order to indicate each element's original location in the old version of computer code. Similarly, the new version of computer code is also sorted alphabetically to create a second sorted list of code with a pointer of each element to indicate the element's original location in the new version of computer code.

Abstract: A computer-implemented apparatus and method for generating a rule-based expert system from a trained neural network which is expressed as network data stored in a computer-readable medium. The rule-based expert system represents an interconnected network of neurons with associated weights data and threshold data. A network configuration extractor is provided for accessing the network data and for ascertaining the interconnection structure of the trained neural network by examining the network data. A transformation system is utilized to alter the algebraic sign of at least a portion of the weights data to eliminate differences in the algebraic sign among the weights data while selectively adjusting the threshold data to preserve the logical relationships defined by the neural network. A symbolic representation generator applies a sum-of-products search upon each neuron in the network to generate a multivalued logic representation for each neuron.

Abstract: A new computer language, which is based on a formal, mathematical state-machine model, and which is used both to validate and to generate code for a distributed system, in general, enables developing a system using multiple related system specifications, for instance, using system specifications at multiple levels of abstraction or using multiple system decompositions into parallel combinations of interacting systems, and allows use of validation tools to verify properties of these systems and their relationships. The language includes constructs for specifying non-deterministic actions, and for specifying constraints on those non-deterministic choices. Several well-defined sub-languages of the full computer language are also defined. These sub-languages are used to specify the input of some tools, in particular, of some code generators.

Abstract: The present invention is a method and apparatus for dynamic optimization of a dynamic physical system having a device under control and a controller along with a modeling system having an estimator and a constrained nonlinear program. The time varying trajectories of the dynamic physical system are parameterized and run through the modeling system in order to produce a set of optimal time varying setpoint trajectories to be used in the dynamic physical system. The optimal time varying setpoint trajectories optimize the physical system to produce the desired end result (or product) of the dynamic physical system.

Abstract: A technique for statically linking an application process to a wrapper library employed in intercepting one or more calls invoked by the application process. The intercepted calls may comprise system calls or library calls. In a first link step, the application process is statically linked with at least the intercept library, and in one embodiment, all libraries associated with the application process except for the wrapper library. This first statically linking step creates a first module. Thereafter, at least one call invoked by the application process, and to be intercepted by the intercept library, is renamed. The renaming of the intercepted call is from its original name to a temporary name in the standard program library, the intercept library and the application program. This renaming step creates a second module that no longer contains the original name of the at least one intercepted call.

Abstract: A system for adaptively solving sequential problems in a target system utilizing evolutionary computation techniques and in particular genetic algorithms and modified genetic algorithms. Stimuli to a target system such as a software system are represented as actions. A single sequence of actions is a chromosome. Chromosomes are generated by a goal-seeking algorithm that uses a hint database and recursion to intelligently and efficiently generate a robust chromosome population. The chromosomes are applied to the target system one action at a time and the change in properties of the target system is measured after each action is applied. A fitness rating is calculated for each chromosome based on the property changes produced in the target system by the chromosome. The fitness rating calculation is defined so that successive generations of chromosomes will converge upon desired characteristics. For example, desired characteristics for a software testing application are defect discovery and code coverage.

Abstract: A method and apparatus for operating a compiler to process include statements contained in a source program that specify include files resident at non-connected network locations. The compiler also receives as input include options specifying include file libraries. The compiler initially examines each include option to determine whether it specifies an include file library resident at a non-connected network location. If it does, the compiler establishes a connection with the network location and obtains a list of the contents of the include file library via the connection. The compiler then examines each include statement to determine whether it specifies an include file resident at a non-connected network location. If it does, the compiler establishes a connection with the network location and obtains the include file via the connection. The retrieved include file is then used for compiling the source code to create the object program.

Abstract: In a virtual element selection device for use in growing, in an electronic device, virtual life composed of various parts or elements, an indication is given from a user and is converted by a neural network into a new element of the virtual life. The new element is substituted for an old one to be displayed on a display device. Using the neural network makes it possible to select the new element which reflects the user's intention.

Abstract: An efficient program analysis method is provided for lazily decomposing aggregates (such as records and arrays) into simpler components based on the access patterns specific to a given program. This process allows us both to identify implicit aggregate structure not evident from declarative information in the program, and to simplify the representation of declared aggregates when references are made only to a subset of their components. The method can be exploited to yield: (i) a fast type analysis method applicable to program maintenance applications (such as date usage inference for the Year 2000 problem); and (ii) an efficient method for atomization of aggregates. More specifically, aggregate atomization decomposes all of the data that can be manipulated by the program into a set of disjoint atoms such that each data reference can be modeled as one or more references to atoms without loss of semantic information.

Abstract: In an application cooperation apparatus for supporting configuration/reconfiguration of a business process support system, node class object information defining a logical AP object as an object class for each common process item and attribute and defining an inheritance relationship between object classes as a tree structure is provided to define interactively with a user a logical process model having logical AP objects as business components. Next, by referring to logical-physical object correspondence relationship information, an implementation process model for the logical process model is developed to generate execution control scripts in a definition language of this model.

Abstract: A data mining apparatus is disclosed for finding a useful association rule from among a large number of association rules discovered through data mining by setting evaluation criteria of the association rules which differ depending on the user's purpose. The data mining apparatus includes an association rule generator which forms and outputs an association rule file based on data items stored in a data base, an evaluation criterion assignor which outputs an evaluation criterion file based on the evaluation criterion assigned by the user, an association rule evaluator which calculates an evaluation value based on the evaluation criterion file and updates information about the association rules in the association rule file.

Abstract: An apparatus and method for loading software into a Java virtual machine (“JVM”) in a manner suited for real-time server applications. The software to be loaded is organized by Java package and class so that an application may be loaded in units of packages. Each package, and each class within a package, is loaded into the JVM in an order such that no package or class is loaded before the packages or classes upon which it depends. All software for an application is loaded into the JVM, and any compilation, optimization, or initialization takes place, prior to execution of the application program, so that no delays are incurred during such execution. Software loaded into the JVM, as well as attributes of that software, are identified. Versions of packages are compared when loading the packages to ensure compatibility. An “image” of loaded software is created, which image may be reused by the JVM in order to restart an application rapidly following a failure.

Abstract: A build object of build class Builder has build method build (Object resolved) for building reference relations among construction-element objects by calling a field setting method owned by construction-element object resolved. A get object of class Getter has get method get object ( ) for acquiring a construction-element object and is also allowed to own a build object. In the get object, construction-element object resolved is acquired by calling get method get object ( ). In a build object owned by the get object, construction-element object resolved acquired by the get object is initialized by build method build (Object resolved). By adopting the procedure described above, construction-element objects required for constructing desired software such as an application program can be collected for constructing the desired software.

Abstract: A computer system for establishing a program image layout of a computer program. The computer program has basic blocks that each have temporal usage vector indicating time intervals during which the basic block was accessed during an execution of the computer program. For each of the basic blocks, the layout system initializes a cluster to contain that basic block and the layout system repeats the following until one cluster remains that contains all of the basic blocks. For each possible ordered pair of clusters, the layout system determines a metric value for the ordered pair of clusters, the metric value being derived from the temporal usage vectors of the basic blocks of the cluster and estimating an effect on the performance of the computer program when that ordered pair of clusters are position in the program image in that order and contiguously. The layout system then selects the ordered pair whose metric value estimates the smallest effect on the performance of the computer program.