Abstract: Role search apparatus for grouping nodes according to relationships with other nodes, the apparatus including: an input for receiving an arrangement of nodes, the arrangement including at least two partitions of the nodes and with predetermined relationships between nodes across the partitions, and a pattern recognition unit associated with the input, for using pattern recognition on the nodes and the relationships to find relationship patterns amongst the nodes, thereby to form at least one group from nodes of a first of the partitions, wherein the nodes being formed into the group share relationships with same ones of a predetermined number of nodes in a second partition.

Abstract: A method is described for assisting execution of an application that is implemented with individual blocks of program code that are executable with separate processes. The method includes receiving an indication that a first of the blocks desires availability of a service provided by a second of the blocks. The method further includes, in response to the receipt of the indication, instantiating an instance of code to handle the delivery of inter process requests from the first block to the second block. The method further includes, in response to the instance of code receiving a first request from the first block for the service, instantiating the second block for execution with a different process than the first block's process. The method further includes detecting that the second block has no pending requests and has not, over a period of time, received any new requests, and, terminating the second block in response.

Abstract: The disclosed computer-implemented method for facilitating atomic delivery of bundled data sets to applications within distributed systems may include (1) receiving, at a queue of an application, a data set from at least one other application, (2) determining that the data set is incorporated in a bundle whose contents have yet to completely arrive at the queue, (3) gating the data set at the queue until the bundle's contents have completely arrived at the queue, (4) receiving, at the queue, another data set incorporated in the bundle, (5) determining that the bundle's contents have completely arrived at the queue based at least in part on receiving the other data set, and then (6) notifying the application that the bundle is ready for atomic delivery such that the application is able to consume the bundle's contents on an as-needed basis. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A computing device can comprise an I/O interface and a processing element connected to the I/O interface and implementing a runtime environment. The processing element can implement a program component that causes the processing element to expose a rendering API not natively supported by the runtime environment, the rendering API invocable by code comprised in a markup document accessed by the processor over the I/O interface. The rendering API can be exposed by causing the runtime environment to respond to and update a proxy object that mirrors properties, methods, and behaviors defined by the rendering API.

Abstract: The present invention provides a browser kernel switching method, which enables a browser to switch between different browser kernels when browsering different web pages, and comprises the following steps: detecting, by the browser, whether a kernel switch is needed; and transferring a post data in a previous kernel of the browser to the kernel which is to be switched when loading a page that requires to switch kernel.

Abstract: A data structure including simple and complex objects. Each simple object includes a content type indicator, a size indicator, and one or more simple data types. Each complex object includes a content type indicator, a size indicator, and one or more child objects. The complex objects include a layer object having first and second child objects. The first child object is a collection of complex objects storing information for configuring a virtual filesystem of a virtual application at application startup. The second child object is a collection of complex objects storing information for configuring a virtual registry of the virtual application at application startup. Reading of selected simple and complex objects may be deferred at startup based on the content type indicator. Deferred objects may be read after startup when access to information stored by the deferred object is request by the virtual application.

Abstract: A system, method, and computer program are provided for combining results of event processing received from a plurality of servers. In use, an event is sent to a plurality of servers. Further, a result of processing of the event is received from each of the servers. In addition, the results received from the plurality of servers are combined.

Abstract: The present specification provides application integration in networked computing devices. An embodiment includes a mobile computing device having a message application that includes a programming interface. The mobile computing device also has a second message application that creates a connection with the message application through the programming interface. Messages that are associated with the second message application can be accessed through the message application, with optional invocation of the second message application via the message application.

Abstract: A data structure including simple and complex objects. Each simple object includes a content type indicator, a size indicator, and one or more simple data types. Each complex object includes a content type indicator, a size indicator, and one or more child objects. The complex objects include a layer object having first and second child objects. The first child object is a collection of complex objects storing information for configuring a virtual filesystem of a virtual application at application startup. The second child object is a collection of complex objects storing information for configuring a virtual registry of the virtual application at application startup. Reading of selected simple and complex objects may be deferred at startup based on the content type indicator. Deferred objects may be read after startup when access to information stored by the deferred object is request by the virtual application.

Abstract: In a multi processing system, packet routing units are arranged in respective middleware layers in first nodes corresponding to memory spaces connected to plural processor cores and perform routing of a packet among parent nodes and child nodes in a tree. The child nodes are user nodes that are objects of respective application layers in the memory spaces. The first nodes are the parent nodes. The user nodes, the first nodes, and a second node in the tree are assigned addresses that identify parent-child relationship of nodes in the tree. The second node is a parent node of the first nodes. The packet routing unit (a1) stores the packet if the source address is identical to an own node address, (a2) transfers the packet to a child node if the source address indicates the child node, and (a3) transfers the packet to a parent node in the other cases.

Abstract: A performance monitoring system is presented for monitoring and tracing individual transactions, where transaction processing includes sending and receiving messages using messaging systems that do not allow the augmentation of existing messages with monitoring system specific correlation information. Agents are deployed to sender and receiver applications that monitor and report transactions. Both sender and receiver applications are instrumented with sensors that detect and report sending or receiving of such immutable messages. Those sensors also extract correlation data from sent and received data allowing the identification of matching corresponding send/receive pairs. A mapping agent is used to retrieve mapping information from a messaging system which may alter the additional message identification data while messages travel through the system. This mapping information is additionally used for the correlation process.

Abstract: A method for transmitting data between a sender queue of a sender intermediate layer of a protocol stack and a receiver queue of a receiver intermediate layer of the protocol stack. The method includes receiving a data message from a sender messaging layer. The method also includes tagging the data message with a unique identifier. The method further includes writing the data message as a data window in the sender queue of the sender intermediate layer. The method additionally includes transmitting a front data window of the sender queue of the sender intermediate layer to the receiver queue of the receiver intermediate layer. The method also includes receiving a single receipt-acknowledgement message after a receiver transport layer of the protocol stack has received all of the front data window. The method further includes receiving a commit-acknowledgement message.

Abstract: A mechanism for enabling a computer which includes an installer for providing Plug and Play (PnP) to obtain information for a network device is provided. Using an existing development resource, such as a PnP installer, a simple installation method is provided. By causing a proxy server to as a communication intermediary between the computer and a peripheral device which is not in compliance with a predetermined management method, the peripheral device can be managed using the predetermined management method.

Abstract: There is provided an information processing apparatus including a message storage unit for storing a message sent to a component, and an execution processing unit for loading the component body into a computer in response to receiving an execution instruction on the component to execute the component body and process the message stored in the message storage unit prior to the execution instruction.

Abstract: A method for transmitting data between a sender queue of a sender intermediate layer of a protocol stack and a receiver queue of a receiver intermediate layer of the protocol stack implemented with a sliding window protocol. The method includes receiving a data message or a collection of data messages from a sender messaging layer; tagging the data message or the collection of data messages with a unique identifier; writing the data message or the collection of data messages tagged with the unique identifier as a data window in the sender queue; transmitting a front data window of the sender queue to the receiver queue; receiving a single receipt-acknowledgement message after the receiver transport layer has received all of the front data window; and receiving a commit-acknowledgement message after the receiver messaging layer has read from the receiver intermediate layer all of the front data window.

Abstract: A method includes receiving event information corresponding to an event associated with the operation of a system. The method also includes identifying related event information corresponding to a plurality of events that occurred before the event, wherein the event is related to the plurality of events. The method also includes storing the event information and the related event information as a group of events. The method further includes determining whether the group of events occurred within a first specified amount of time by identifying a time window ending at the occurrence of the event and beginning the first specified amount of time before the occurrence of the event and determining whether each event of the group of events occurred during the identified time window. The method further includes identifying an incident associated with the group of events upon determining that the group of events occurred within the first specified amount of time.

Abstract: Computer-implemented systems and methods are described for eliminating duplicate events. In accordance with some implementations, a computer-implemented system is provided which includes a computer-readable storage medium that stores program code and a processor that executes the program code. The operations performed by the processor may include capturing an event comprising a user interaction with an article stored in association with a client device and determining a level of similarity between the event and a stored event. The operations performed by the processor may also include determining if the event is a duplicate of the stored event based at least in part on the level of similarity between the event and the stored event and indexing the event on the client device dependent on the determination of whether or not the event is a duplicate of the stored event.

Abstract: A method for providing applications to one or more requesting devices is provided. The method comprises a step of first receiving an application request from the one or more requesting devices. The method includes extracting details of the request. Further markup language structure for corresponding page of the application is generated. The markup language structure is generated by invoking page handlers which includes contacting business logic layer to get information required to be embedded in the corresponding page. The output page is then provided to the requesting device.

Abstract: A technique to suppress a remote procedure call from a client by a server is provided. An information processing system is provided that includes a client component and a server component, wherein a program of the client component makes an RPC for a function of the server component. The client component includes a holding unit that holds return value information of the function, and a calling unit that receives an RPC request for the function from the program. The server component includes an execution unit that returns a return value of the function to set return value information. When the return value information has not been set in the holding unit, the calling unit makes an RPC for the function. When the return value information has been set in the holding unit, the calling unit returns the return value included in the return value information without making an RPC.

Abstract: A method and system for achieving time-awareness in the highly available, fault-tolerant execution of components in a distributed computing system, without requiring the writer of these components to explicitly write code (such as entity beans or database transactions) to make component state persistent. It is achieved by converting the intrinsically non-deterministic behavior of the distributed system to a deterministic behavior, thus enabling state recovery to be achieved by advantageously efficient checkpoint-replay techniques. The system is deterministic by repeating the execution of the receiving component by processing the messages in the same order as their associated timestamps and time-aware by allowing adjustment of message execution based on time.