Abstract: The present invention is directed to systems and methods that treat the monitoring of a software application as a separate and independent concern from the software application itself. The present invention utilizes aspect oriented programming to intercept, analyze, decompose the application states of a software application and then to link appropriate non-invasive constructs into the software application code to provide application state information to an autonomic manager through a plurality of sensors. The autonomic manager analyzes the application state information for compliance pre-defined parameters, and takes appropriate corrective action including modifying the software application states using a plurality of effectors. The sensors and effectors are linked as non-invasive constructs to the software application, and in aspect oriented programming constitute aspects.

Abstract: A method for settling on a target track of a servo system in a storage device (110) comprising a scanning probe (e.g., a scanning probe array system (124)) is disclosed, as well as a corresponding storage device (110). A data format is employed for the data stored in servo fields (18), consisting mainly of a preamble for assisting the settle process.

Abstract: The present invention addresses scalability and end-to-end reliability in overlay multicast networks. A simple end-system multicast architecture that is both scalable in throughput and reliable in an end-to-end way is used. In this architecture, the transfers between nodes use TCP with backpressure mechanisms to provide data packet transfers between intermediate nodes having finite-size forwarding buffers. There is also a finite-size backup buffer in each node to store copies of packets which are copied out from the receiver window to the forwarding buffers. These backup buffers are used when TCP connections are re-established to supply copies of data packets for the children nodes after their parent node fails, maintaining a complete sequence of data packets to all nodes within the multicast overlay network. The architecture provides end-to-end reliability, tolerates multiple simultaneous node failures and provides positive throughput for any group size and any buffer size.

Abstract: The present invention is directed to a system, including apparatus and architecture, and method for providing scheduled and ad hoc voice over IP conference services having enhanced quality and reliability. The system uses an overlay network of geographically distributed conference servers working simultaneously and collaboratively to host a given conference session. Multiple conference servers simultaneously and collaboratively perform the necessary audio mixing. The voice routing path is established and controlled within the overlay network and supports conference services across different conference service providers.

Abstract: The present invention is directed to a system and a method for evaluating a plurality of moving queries over moving objects. The method, which can be embodied in a computer readable medium containing computer readable code, constructs motion-adaptive bounding boxes around the objects and queries and indexes the objects and queries based upon the bounding boxes. Predictive query results are used to optimize the evaluation of the moving queries. The bounding boxes vary in size and shape depending on the speed and motion direction of the objects and queries. The system of the present invention includes the moving objects and queries, each having an associated motion-adaptive bounding box. The system also provides for a monitoring system capable of monitoring the location and motion of the moving objects and moving queries and of evaluating the moving queries. The monitoring system includes a motion-adaptive query index and a motion-adaptive object index.

Abstract: The present invention is directed to the use of an evolutionary algorithm to locate optimal solution subspaces. The evolutionary algorithm uses a point-based coding of the subspace determination problem and searches selectively over the space of possible coded solutions. Each feasible solution to the problem, or individual in the population of feasible solutions, is coded as a string, which facilitates use of the evolutionary algorithm to determine the optimal solution to the fitness function. The fitness of each string is determined by solving the objective function for that string. The resulting fitness value can then be converted to a rank, and all of the members of the population of solutions can be evaluated using selection, crossover, and mutation processes that are applied sequentially and iteratively to the individuals in the population of solutions.