Abstract: In an embodiment, the infrastructure comprises a script execution module that comprises a compiler that compiles scripts, having instructions that reference device properties, into virtual-machine programs, a virtual machine that executes virtual-machine programs, and a script manager that stores scripts, retrieves scripts, and loads scripts into the compiler. In addition, the infrastructure may comprise gateway(s), communicatively connected to physical device(s). The gateway(s) may each comprise processor(s), driver(s) that each communicate with at least one physical device using a communication protocol to read and/or write device properties of the physical device, and a device manager that maps device properties referenced in the virtual-machine programs to device properties used by the driver(s).

Abstract: Control infrastructure. In an embodiment, the infrastructure comprises a script execution module that comprises a compiler that compiles scripts, having instructions that reference device properties, into virtual-machine programs, a virtual machine that executes virtual-machine programs, and a script manager that stores scripts, retrieves scripts, and loads scripts into the compiler. In addition, the infrastructure may comprise gateway(s), communicatively connected to physical device(s). The gateway(s) may each comprise processor(s), driver(s) that each communicate with at least one physical device using a communication protocol to read and/or write device properties of the physical device, and a device manager that maps device properties referenced in the virtual-machine programs to device properties used by the driver(s).

Abstract: In an embodiment, the infrastructure comprises a script execution module that comprises a compiler that compiles scripts, having instructions that reference device properties, into virtual-machine programs, a virtual machine that executes virtual-machine programs, and a script manager that stores scripts, retrieves scripts, and loads scripts into the compiler. In addition, the infrastructure may comprise gateway(s), communicatively connected to physical device(s). The gateway(s) may each comprise processor(s), driver(s) that each communicate with at least one physical device using a communication protocol to read and/or write device properties of the physical device, and a device manager that maps device properties referenced in the virtual-machine programs to device properties used by the driver(s).

Abstract: Control infrastructure. In an embodiment, the infrastructure comprises a script execution module that comprises a compiler that compiles scripts, having instructions that reference device properties, into virtual-machine programs, a virtual machine that executes virtual-machine programs, and a script manager that stores scripts, retrieves scripts, and loads scripts into the compiler. In addition, the infrastructure may comprise gateway(s), communicatively connected to physical device(s). The gateway(s) may each comprise processor(s), driver(s) that each communicate with at least one physical device using a communication protocol to read and/or write device properties of the physical device, and a device manager that maps device properties referenced in the virtual-machine programs to device properties used by the driver(s).

Abstract: Control infrastructure. In an embodiment, the infrastructure comprises a script execution module that comprises a compiler that compiles scripts, having instructions that reference device properties, into virtual-machine programs, a virtual machine that executes virtual-machine programs, and a script manager that stores scripts, retrieves scripts, and loads scripts into the compiler. In addition, the infrastructure may comprise gateway(s), communicatively connected to physical device(s). The gateway(s) may each comprise processor(s), driver(s) that each communicate with at least one physical device using a communication protocol to read and/or write device properties of the physical device, and a device manager that maps device properties referenced in the virtual-machine programs to device properties used by the driver(s).

Abstract: In an embodiment, the infrastructure comprises a script execution module that comprises a compiler that compiles scripts, having instructions that reference device properties, into virtual-machine programs, a virtual machine that executes virtual-machine programs, and a script manager that stores scripts, retrieves scripts, and loads scripts into the compiler. In addition, the infrastructure may comprise gateway(s), communicatively connected to physical device(s). The gateway(s) may each comprise processor(s), driver(s) that each communicate with at least one physical device using a communication protocol to read and/or write device properties of the physical device, and a device manager that maps device properties referenced in the virtual-machine programs to device properties used by the driver(s).

Abstract: A package has a flexible top wall (3) joined in its periphery (6) to flexible side walls (4, 5) to form an enclosure, the top wall (3) being formed with a line of weakness (7) which is adapted to be torn to create an opening, the tear being confined between the peripheral join (6), The side walls (4, 5) may have transverse seals (1, 2), and top and bottom walls (3) folded inwards as gussets, and the line of weakness (7) with a thumb on each side of the line of weakness (7) with a thumb on each side to press downwards and create a tear along the line of weakness. Preferably, the upper edges of the side walls (4, 5) are sealed to the adjoining edges of the top wall (3) to form a peripheral upstanding rim (6).

Abstract: A package has a flexible top wall (3) joined at its periphery (6) to flexible side walls (4, 5) to form an enclosure, the top wall (3) being formed with a line of weakness (7) which is adapted to be torn to create an opening, the tear being confined between the peripheral join (6). The side walls (4, 5) may have transverse seals (1, 2), and top and bottom walls (3) folded inwards as gussets, and the line of weakness (7) extends substantially centrally along the fold line of the gusseted top wall (3) between the two transverse seals (1, 2). The package is easily gripped in both hands, one either side of the line of weakness (7), with a thumb on each side to press downwards and create a tear along the line of weakness. Preferably, the upper edges of the side walls (4, 5) are sealed to the adjoining edges of the top wall (3) to form a peripheral upstanding rim (6).

Abstract: A system and method provide the ability to construct lexical analyzers on the fly in an efficient and pervasive manner. The system and method split the table describing the automata into two distinct tables and splits the lexical analyzer into two phases, one for each table. The two phases consist of a single transition algorithm and a range transition algorithm, both of which are table driven and permit the dynamic modification of those tables during operation. A third ‘entry point’ table may also be used to speed up the process of finding the first table element from state 0 for any given input character.

Abstract: A stemming framework for combining stemming algorithms together in a multilingual environment to obtain improved stemming behavior over any individual stemming algorithm, together with a new language independent stemming algorithm based on shortest path techniques. The stemmer essentially treats the stemming problem as a simple instance of the shortest path problem where the cost for each path can be computed from its word component and its number of characters. The goal of the stemmer is to find the shortest path to construct the entire word. The stemmer uses dynamic dictionaries constructed as lexical analyzer state transition tables to recognize the various allowable word parts for any given language in order to obtain maximum speed. The stemming framework provides the necessary logic to combine multiple stemmers in parallel and to merge their results to obtain the best behavior. Mapping dictionaries handle irregular plurals, tense, phrase mapping and proper name recognition.

Abstract: An intelligence system is provided that is comprised of several basic components: a system for converting incoming unstructured data into a well described normalized form supported by a dedicated ‘mining’ language tied intimately to a system ontology; a system for accessing and manipulating data held in memory or in persistent storage in its normalized binary form; an ‘ontology’ that represents and contains the items and fields necessary for the target system to perform its function; a memory system tied to the ontology; a memory management system for splitting incoming data into those portions to be directed to each container; a query system for querying each container to retrieve portions of composite objects; a UI to display and interact with data within the system; a memory system that forms collections of datums and enables manipulation and exchange of these collections both within the local machine as well as across the network.

Abstract: A package has a flexible top wall (3) joined at its periphery (6) to flexible side walls (4, 5) to form an enclosure, the top wall (3) being formed with a line of weakness (7) which is adapted to be torn to create an opening, the tear being confined between the peripheral join (6). The side walls (4, 5) may have transverse seals (1, 2), and top and bottom walls (3) folded inwards as gussets, and the line of weakness (7) extends substantially centrally along the fold line of the gusseted top wall (3) between the two transverse seals (1, 2). The package is easily gripped in both hands, one either side of the line of weakness (7), with a thumb on each side to press downwards and create a tear along the line of weakness. Preferably, the upper edges of the side walls (4, 5) are sealed to the adjoining edges of the top wall (3) to form a peripheral upstanding rim (6).

Abstract: The present invention provides a dynamic hyperlinking architecture that permits a user to enable/disable hyperlink domains that are automatically applied to every bit of textual data present in the system or displayed to the user. The present invention includes synchronous and asynchronous, inter-thread function calls, including support for function overrides in a threaded scope dependent manner. The present invention also supports broadcast (multiple call) call configurations and run-time examination of function registries. In the preferred embodiment, the system comprises a threaded environment, threaded type dependant symbolic functions and a hyperlinking system uses both the threaded environment and symbolic functions to dynamically create links to data and functions that are displayed and/or executed responsive to user selection of a link.

Abstract: A system and method for extracting data, hereinafter referred to as MitoMine, that produces a strongly-typed ontology defined collection referencing (and cross referencing) all extracted records. The input to the mining process can be any data source, such as a text file delimited into a set of possibly dissimilar records. MitoMine contains parser routines and post processing functions, known as ‘munchers’. The parser routines can be accessed either via a batch mining process or as part of a running server process connected to a live source. Munchers can be registered on a per data-source basis in order to process the records produced, possibly writing them to an external database and/or a set of servers.

Abstract: A stemming framework for combining stemming algorithms together in a multilingual environment to obtain improved stemming behavior over any individual stemming algorithm, together with a new language independent stemming algorithm based on shortest path techniques. The stemmer essentially treats the stemming problem as a simple instance of the shortest path problem where the cost for each path can be computed from its word component and its number of characters. The goal of the stemmer is to find the shortest path to construct the entire word. The stemmer uses dynamic dictionaries constructed as lexical analyzer state transition tables to recognize the various allowable word parts for any given language in order to obtain maximum speed. The stemming framework provides the necessary logic to combine multiple stemmers in parallel and to merge their results to obtain the best behavior. Mapping dictionaries handle irregular plurals, tense, phrase mapping and proper name recognition.

Abstract: A system and method for translating one or more tokens from one language to another is provided. A lookup map mapping characteristics of the tokens in one language and the corresponding characteristics to be used in a foreign language is provided. A set of “content” dictionaries mapping tokens in a base language into the corresponding token in another language is also provided and, in conjunction with the characteristics of the foreign token, provides the basis for a translated interface. A GUI environment may initiate a request to translate whenever it is about to transmit a token to the interface or the tokens may be trapped prior to receipt by the display. Other tools and functions are also provided that instruct the interface to modify the location, ordering and other attributes of the token as communicated by the interface.

Abstract: A system and method provide the ability to construct lexical analyzers on the fly in an efficient and pervasive manner. The system and method split the table describing the automata into two distinct tables and splits the lexical analyzer into two phases, one for each table. The two phases consist of a single transition algorithm and a range transition algorithm, both of which are table driven and permit the dynamic modification of those tables during operation. A third ‘entry point’ table may also be used to speed up the process of finding the first table element from state 0 for any given input character.

Abstract: A system and method provide the ability to construct lexical analyzers on the fly in an efficient and pervasive manner. The system and method split the table describing the automata into two distinct tables and splits the lexical analyzer into two phases, one for each table. The two phases consist of a single transition algorithm and a range transition algorithm, both of which are table driven and permit the dynamic modification of those tables during operation. A third ‘entry point’ table may also be used to speed up the process of finding the first table element from state 0 for any given input character.

Abstract: The present invention enables the creation, management, retrieval, distribution and massively large collections of information that can be shared across a distributed network without building absolute references or even pre-existing knowledge of the data and data structures being stored in such an environment.

Abstract: A system and method for implementing a data-flow based system includes three basic components: a data-flow based scheduling environment that balances the needs of data initiated program execution as a result of flows with other practical considerations such as user responsiveness, event driven invocation, user interface considerations, and the need to also support control-flow based paradigms where required; a visual programming language, based on the flow of strongly-typed run-time accessible data and data collections between small control-flow based locally and network distributed functional building-blocks, known as widgets; and a formalized pin-based interface to allow access to data-flow contents from the executing code within the widgets. The pins on the widgets include both pins used to control execution of a widget as well as pins used to receive data input from a data flow.