Abstract: The invention provides a method and apparatus for use in an information handling network having an administrative control server and a number of administered servers that are members of the network and are managed by the control server, of providing maintenance of the administered servers for maintaining conformity of configuration of each of the administered servers to a predetermined configuration for all administered servers of the network while permitting evolution of the predetermined configuration from an initial network member configuration to a current network member configuration to which each of the administered servers is to conform, the method including: evolving, as required, the configuration of each server from its current configuration state to the current network member configuration in the following steps: initiating communication, by an administered server, of identification information to the control server identifying the administered server; verifying by the control server whether the ad

Abstract: A server complex including at least one hit server with item cache, used to process read and write operations relating to cached items from clients, and at least one miss server, serving as a link to other servers (e.g., web servers, file system servers, and databases) for receiving requests relayed from the hit server(s) which relate to non-cached items and for responding to same. The hit server is a general-purpose, generic, component, which is independent of concrete applications and is basically responsible for the performance; while a miss server is a highly-customizable component, which is responsible for flexibility, and is application specific. The inventive architecture provides improved performance whereby a server complex achieves exceptionally high throughput rates for local services (i.e.

Abstract: A method and system wherein participant node lists are maintained for each individual transaction. In addition, local nodes maintain participant node lists and provide same to coordinating nodes under certain circumstances. The coordinating nodes merge participant node lists and selectively utilize the lists to minimize message duplication. Further, connection node lists for each application are maintained at coordinating nodes and are utilized for application rollback procedures.

Abstract: A system and method whereby a gang scheduling entity assembles a schedule of application tasks to be run on a plurality of distributed parallel processors for pre-set time intervals. The scheduling information, including an ordered set of applications and the length of the time interval, are provided to each of the node level schedulers for the relevant processors, and the node level schedulers assure that the tasks of the applications are executed, with context switching between tasks being controlled at the node level. Tasks from multiple applications can be scheduled simultaneously, with time sharing and space sharing being utilized in the schedule. The inventive system is dynamically scalable, with the gang scheduling entity restructuring the matrix schedule should dynamic re-partitioning result in addition or deletion of processors.

Abstract: A system and method are described for automating navigations in systems with measurement data that are structured as a multidimensional database (MDDB). The navigation includes an Automated Navigation Engine that uses external representations of a dimension selection function and a cube selection function to guide MDDB navigations. The method consists of the steps: (1) select the MDDB dimension that has the largest dimension selection score; (2) if this score is too small, terminate the method; (3) otherwise, select the cube with the largest cube selection score. These steps are performed repeatedly until (2) applies. Navigations can be performed for data mining, problem isolation, trending analysis, etc.

Abstract: A system for collecting, categorizing and searching metadata about products which may be the subject of user-input inequality searches. Unique methods are provided for: generating image information at the user interface; inputting of the inequality search; conducting an inequality search based on the metadata in response to input at the user interface; and; displaying the search results appropriately.

Abstract: A system and method for dynamic scheduling and allocation of resources to parallel applications during the course of their execution. By establishing well-defined interactions between an executing job and the parallel system, the system and method support dynamic reconfiguration of processor partitions, dynamic distribution and redistribution of data, communication among cooperating applications, and various other monitoring actions. The interactions occur only at specific points in the execution of the program where the aforementioned operations can be performed efficiently.

Abstract: A system and method for temporal synchronization of media streams in multimedia collaborative applications (i.e., a multi-user distributed applications used for interaction, both in the synchronous and asynchronous fashion among a group of users) in a wide-area distributed environment. The invention presents two abstractions; event streams and collaboration space, that together provide for coarse-grained temporal synchronization by using separate streams for different media and synchronizing the streams at the client location. VCR-like controls are also provided on groups of components in a collaborative application. The event stream provides many services such as replication, persistence, buffering, reading, and writing to archive. By implementing simple interfaces, existing collaborative applications, media players, and encoders become components that can be used to build complex multimedia collaborative applications.

Abstract: Described is a method and apparatus for transforming computer data from a first form to a second form, by representing the first form of the computer data by an object model having a plurality of objects, providing a plurality of transformational agents each for transforming an object into a portion of the second form, and linking the transformational agents to produce a transformational agent model to transform the object model into the second form of the computer data.

Abstract: A system and method for uniformly describing space and frequency views of multi-dimensional lattice data, including regions, tilings and hierarchical decompositions of image, video, audio content, and time series data in space, time, frequency and resolution. The space and frequency view description scheme provides a way to specify regions in space, time, frequency and resolution in term of space and frequency views. This allows specification of concepts such as “half resolution”, “upper right quadrant” or “high pass band”, such as when referring to views of an image. The space and frequency view description scheme also provides for SFTilings comprising non-redundant sets of views and SFPartitionings which are SFTilings which completely cover the space, as well as SFHierarchical decompositions comprising hierarchies of SFViews where there are processing dependencies among views.

Abstract: A method and apparatus for constructing an optical wavelength-routing network in which each network node is a dynamic add-drop multiplexer (OADM) with minimized spectral filtering effect on pass-through channels and survivability upon power failure. By using cascaded tunable reflection filters as the building blocks, strictly add-drop non-blocking OADMs for single input/output fibers, double input/output fibers, and 3 input/output fibers can be constructed for application to unidirectional and bidirectional ring networks and mesh networks of arbitrary degree. Methods and apparatus for minimizing various types of out-of-band and in-band crosstalk occurring within the dynamic OADMs are also described.

Abstract: An X-Y grid tree clock distribution network for distributing a clock signal across a VLSI chip. Tunable wiring tree networks are combined with an X-Y grid vertically and horizontally connecting all the tree end points. No drivers are necessary at connection points of the tree end points to the X-Y grid. The final X-Y grid distributes the clock signal close to every place it is needed, and reduces skew across local regions. A tuning method allows buffering of the clock signal, while minimizing both nominal clock skew and clock uncertainty. The tuned tree networks provide low skew even with variations in clock load density and non-ideal buffer placement, while minimizing the number of buffers needed. The tuning method first represents a total capacitance of one or more of clock pin loads and twig wiring as a clustered grid load. Next, a smoothing of the clustered grid loads approximates the effect of the X-Y grid.

Abstract: A cache system in accordance with the present invention consists of one or more cache components and a set of one or more consistency-replacement functions. A cache component caches one or more items in its one or more cache entries. Items that hit in the cache can result in corresponding cache entries being read or written. Any valid entry in a cache component includes status information reflecting whether the entry has been accessed and whether it has been modified, and is linked to a consistency-action matrix that, in correspondence with the entry's status information and access type (i.e. read or write), determines what consistency action has to be executed in conjunction with the current entry access. Consistency actions and the consistency-action matrix are the inventive mechanisms for implementing cache-coherency and cache-replacement policies. Any valid entry in a cache is linked to a consistency-replacement function that implements one or more consistency and/or replacement policies.

Abstract: A system, method and computer program storage device providing event and/or state sharing support e.g., for building object-oriented interactive groupware in wide-area distributed environments (such as the Internet). For collaborative applications programmed using events, mechanisms are provided for sharing application-specific events. For example: an event based programming model allows applications to post an event and triggers corresponding ERUs (Event Reaction Unit) in reaction to a received event; preconditions for control activation of ERUs; and event consistency policy objects implement application specified event consistency model. Some policy examples are: a policy in which event order is not guaranteed, but all events are guaranteed to be sent to the ERUs eventually; and a policy that first triggers local ERUs and then posts the event to the server.

Abstract: A client-based system for the fault tolerant delivery of real-time or continuous data streams, such as real-time multimedia streams, e.g., live audio and video clips. Multimedia servers are grouped into two or more sets, for example wherein a first set includes one or more primary servers using odd-numbered ports and a second set includes one or more secondary servers using even-numbered ports. The client requests a multimedia stream through a control server or gateway which routes requests to the multimedia servers; and the client receives the stream directly from a selected (primary) server. The client automatically detects load imbalances and/or failures (complete or partial) and dynamically switches to a secondary server in order to continue receiving the real-time multimedia stream with minimal disruption and while maintaining a balanced load across multiple servers in a distributed network environment.

Abstract: A current sensing amplifier for detecting a small current difference between a pair of variable resistance loads comprises a first amplifier and a second amplifier. The first amplifier comprises a voltage clamp including first and second outputs, the voltage clamp being coupled to the pair of variable resistance loads and substantially fixing a predetermined voltage across the variable resistance loads, the voltage clamp transferring the measured current difference to the first and second outputs. The first amplifier further includes a differential current source coupled to the first and second outputs. The second amplifier includes first and second inputs and an output, the first and second inputs being coupled to the first and second outputs, respectively, of the first amplifier.

Abstract: A computer system and method for performing concurrency control on work requests, the system having an object request broker for receiving work requests and for dispatching them for execution within the computer system, a processor for processing the requests which have been received by the object request broker, and a concurrency control component in the object request broker for performing concurrency control by isolating the effects of a group of related work requests which form a transaction. The method includes the steps of receiving a work request, analyzing the requested object and method related to the work request, and locking the brokering of the method.

Abstract: A laser system (called a UV Dermablator) and method that enables a clean, precise removal of skin while minimizing collateral damage to the skin underlying the treated region. The depth of ablation can be controlled via feedback from the physiology of the skin, namely the infusion of blood into the area of excision when skin has been ablated to a sufficient depth to produce bleeding. A second laser, such as a uv light source with a different wavelength, to penetrate the blood, heating it sufficiently to coagulate the blood. Other features provide precise control, permitting the epidermis to be removed down to the papillary dermis, following the undulations of the papillary dermis. This lateral and depth control may be accomplished by using careful observation, assisted by spectroscopic detection, to identify when the epidermis has been removed, exposing the underlying dermis, with spatial resolution appropriate for the spacing of the undulations of the papillary dermis.

Abstract: A general, event/handler kernel extension system is implemented. Network server extension architecture isolates and exploits the ability to derive responses on the same interrupt the original request was received on using non-paged memory. TCP network server extensions are implemented. A technique is defined for facilitating immediate completion of connection requests using pre-allocated connection endpoints and describes an approach to recycling these connection endpoints. A hybrid HTTP extension implemented partially in user space and partially in kernel space is defined that provides explicit or transparent implementation of the user space component and shared logging between user and kernel space. A technique is defined for prefetching responses to HTTP GET requests using earlier GET responses. Classifying of handler extensions according to latency in deriving a response to a network request is defined.

Abstract: An improved multidimensional data indexing technique that generates compact indexes such that most or all of the index can reside in main memory at any time. During the clustering and dimensionality reduction, clustering information and dimensionality reduction information are generated for use in a subsequent search phase. The indexing technique can be effective even in the presence of variables which are not highly correlated. Other features provide for efficiently performing exact and nearest neighbor searches using the clustering information and dimensionality reduction information. One example of the dimensionality reduction uses a singular value decomposition technique. The method can also be recursively applied to each of the reduced-dimensionality clusters. The dimensionality reduction also can be applied to the entire database as a first step of the index generation.