Abstract: The present invention is a method (100) of determining the syntactic correctness of an expression for use in a computing environment. After creating (30) a string of characters from said expression, it looks for substrings (character sequences), which are legitimate and replaces (54) them with a shorter but semantically equivalent substring. It also looks for character sequences which are illegitimate, and replaces (54) them with a substring (i.e. “?”) to indicate that it has met with an illegal sequence. It does these operations repeatedly, and in predetermined sequences, till no further changes in the string can be made; that is, the string achieves a constant length. An expression is determined to be syntactically correct only if said string reduces to a single predetermined character.

Abstract: A handheld computing device (10) having voice input and voice output includes a handheld unit (20) having a processor (11) and a display (18) communicating with the processor (11), a handset (30) including means for voice input (43) and means for voice output (42), a mechanism (39, 41) for docking the handset (30) with the handheld unit (20) forming a docked unit, the docked unit dimensioned to be held in one hand while being used for voice input and voice output, and at least one connection (23, 36) for carrying voice-representative signals between the handheld unit (20) and the handset (30). Device (10) allows telephone-style, voice-driven, user-interface communications both when handset (30) is docked with handheld unit (20), and when handset (30) is detached from handheld unit (20).

Abstract: The present invention discloses a method for determining, in a computer environment, the equivalence, if any, of two blocks of assignment statements in a computer program for use in compiler optimization of source code, program verification, program proving, and like computing tasks. The method, inter alia, successfully eliminates, from a block of assignment statements, all intermediate variables and statements which are identities and also those which are irrelevant to the computation of the output variables and brings the block to a form suitable for comparing two or more blocks of assignment statements. A system for carrying out the above method and a computer program product incorporating the method are also disclosed.

Abstract: A system for receiving and handling a scrambled input data signal that includes a preamble with a start of frame delimiter (SFD) initiates an SFD search on the scrambled input data, thereby attempting to save an initialization period. The initialization period may be of the order of 7 ?S, and its saving results in improved timeline management enabling antenna diversity and the possible use of high performance algorithms. The system may use two parallel paths for signal processing, each having an SFD detector and a descrambler. If the detected SFD is short, then the second path is disabled, and if it is long, then the first parallel path is disabled. Alternatively, the first path can be used for a finite period of time (for e.g., 40 symbols) and if the SFD is still not detected, the first path is disabled, and the system uses only the second path.

Abstract: A method for assigning servers to provide multiple description bitstreams to a mobile client (in a mobile client environment) or to a fixed client (in a fixed client environment). In one embodiment, the present invention, upon receiving a request from a mobile client to have media data streamed thereto, analyzes a plurality of servers to determine a first candidate server for providing a first multiple description bitstream to the base station along a first path. The present method also determines a second candidate server for providing a second multiple description bitstream to the base station along a second path. The present method then sends a request to the first candidate server to provide the first multiple description bitstream to a mobile client through a base station along the first path, and also sends a request to the second candidate server to provide the second multiple description bitstream to the mobile client through the same base station along a second path.

Abstract: In brief, the invention provides a method and system for admission control in a grid computing environment. When a user request for a global session is received from a submission node, applications to be launched through the global session are identified, and resource requirements are determined. A execution node is then allocated, and the global session is established between the execution node and the submission node. A user then requests an application session through the established global session, and the application session is established with the execution node.

Abstract: A special-purpose appliance (SPA) works in conjunction with a server farm consisting of multiple caching server appliances (CSAs) to supervise a local storage medium (i.e., a shared cache) that is accessible by all the CSAs for storing at least some of the remote objects such as web pages and their embedded objects and/or streaming media objects that have been and/or will be served by one or more of the CSAs to its respective clients. The SPA preferably also determines when to prefetch remote objects such as web pages and their embedded objects and/or streaming media objects that are not currently stored in the shared cache, but which the SPA has determined are likely to be requested in the future by one or more of the CSAs one behalf of one or more of the CSA's respective clients.

Abstract: The present invention relates to the use of individual fumaric acid derivatives or mixtures thereof for preparing a pharmaceutical composition for treating mitochondrial diseases, especially for treating Parkinson's syndrome, Alzheimer's disease, Chorea Huntington disease, retinopathia pigmentosa and mitochondrial encephalomyopathy. Preferably, the fumaric acid derivative(s) is/are those selected from the group consisting of fumaric acid dialkyl esters or fumaric acid monoalkyl esters in the form of the free acid or a salt thereof.

Abstract: A computer system is provided including a processor, a persistent storage device, and a main memory connected to the processor and the persistent storage device. The main memory includes a compressed cache for storing data retrieved from the persistent storage device after compression and an operating system. The operating system includes a plurality of interconnected software modules for accessing the persistent storage device and a filter driver interconnected between two of the plurality of software modules for managing memory capacity of the compressed cache and the buffer cache.

Abstract: The present invention is directed to a powder coating composition that produces a low gloss coating upon cure. The powder coating composition includes one or more crosslinkable base polymer, a crosslinkable acrylic polymer and one or more free radical initiators. By adding spheroidal particles to the powder coating composition further reduction in gloss can be obtained while improving smoothness. These compositions are well suited to produce coatings on metallic substrates, such as automotive bodies and non-metallic substrates, such as reconstituted wood substrates, used for desk or table tops.

Abstract: A method and system for the resource allocation for an interactive session on a grid computing system. When a user-request for an interactive session is received, the particular applications needed to be launched in the interactive session are identified, as are resource requirements for the interactive session including processor, network bandwidth, executables and files requirements. A contract is then generated for the interactive session specifying resource allocations and authorizations, and resources for the interactive session are allocated in accordance with the contract. The system includes a distributed resource management node, a contract generation engine, and a contract repository.

Abstract: A computer implemented method (200) is provided for representing a network in a canonical form. The network has nodes and arcs. Each arc has a source node and a destination node. Each node has an identifier, and optionally, one or more properties. Various manipulations that may be carried out on the network's canonical representation are also provided. Further, a computer implemented method is provided for determining the equivalence between two networks either on the basis of the nodes' identifiers or some specific property of the nodes. An apparatus (100) for performing the above method (200) is also provided.

Abstract: A method 100, an apparatus, and a computer program product for constructing a runtime symbol table SymTbl[ ] for a computer program are disclosed. In the method, a symbol table SymTbl[ ] for storing one or more entities Ei is initialized 110. One or more tickets Ti are then added 120 into the symbol table SymTbl[ ] for each entity Ei that does not already exist in the symbol table SymTbl[ ]. An offset address is then inserted 130 after a predefined token “>” for each ticket Vi in a predefined set V of tickets in the symbol table SymTbl[ ] characterized as a sequence of the tickets Vi. One or more preassigned addresses are also inserted 140 in the symbol table SymTbl[ ] for each ticket Vi in the set V of tickets that has preassigned addresses.

Abstract: A method and apparatus is used for accessing a remote desktop from a local computer. Accessing the remote desktop includes requesting a remote desktop to be displayed on the local computer and computed by a remote computer having selected computer resources, identifying the remote computer having the selected computer resources available for immediate use, instructing the remote computer identified to reserve the selected computer resources for use on the local computer, and notifying the local computer to commence communication with the identified remote computer and displaying a desktop from the remote computer on the local computer.

Abstract: Embodiments of the present invention provide a method for grid computing access control and a system thereof. A command is received from a user. The authorization of the user to execute the command is verified. A system parameter is monitored during execution of the command.

Abstract: The present invention provides a lactate biosensing strip comprising a working electrode and a reference electrode, the said two electrodes being deposited on an electrically insulated base support, the working electrode being formed by immobilizing an enzyme lactate oxidase and an electro mediator on an inorganic graphite matrix and the graphite layer being deposited on a silver layer and the reference electrode being formed by depositing silver chloride on an another silver layer.

Abstract: A method for processing information about a polygonal pattern in the context of pattern recognition in a computer environment, the method comprising the steps of: (a) taking the corners of the pattern in turn in order from a first of the corners through the last of the corners, forming a first ordered sequence M of values representing the respective scalar distances between each corner of the polygonal pattern and each other corner, the sequence including (i) the distances between said first of said corners and each other corner in turn and (ii) taking each other corner in turn, the distances between that other corner and each other corner starting with the said first corner, and (iii) including at appropriate positions in the sequence zero values to correspond to the distance between each corner and itself; (b) re-ordering the values of said first sequence M to form a second ordered sequence P1 comprising a set of values p1 which includes for each corner starting with said first corner, values in a series

Abstract: A method, system and computer program product for enabling the concurrent editing of a document containing a plurality of independent or loosely connected segments by multiple authors is described. Among other things, the invention allows assigning of editing rights for each segment to a defined set of segment authors, making available a special segment that contains metadata shared by all the segments of said documents, and providing email means private to said document, for facilitating communication between the authors of the document.

Abstract: In a compiler or program proving or verification software code, it is often useful to analyse a computer program and one way in which this might be partially achieved is by comparing algebraic expressions to see if they are equivalent, i.e. to see if they are derivable from a common template or function definition. Herein a string matching and replacement algorithm is used to compare two functions. Initially, each expression is converted to a “reduced” form by reference to a set of standard rules so as, for example, to ensure that terms comprising the same variables are combined. The variables names in each term are then replaced with symbols to produce, for each expression, a corresponding character string which, arranged in a predetermined order, are compared to determine equivalence of the expressions. To achieve this, a matrix M is formed with entries corresponding to the symbols and the matrix elements are incremented according to pre-set rules.

Abstract: Methods and systems for transferring an event from a server to a remote client are described. An event is received from a driver. The event is dispatched into an event queue according to the event type. The event is processed according to the event type. The processing includes encoding the event when the event comprises multimedia data. The event is transferred to the remote client when triggered. The transfer occurs according to a protocol corresponding to the event type.