Abstract: A wireless station (A) is operated in a power-save mode, in which the station is alternately in power-ON and power-OFF states to reduce power consumption. Wireless station (A) computes at least some future time instances at which another wireless station (B) is expected to start transmitting control messages. Wireless station (A) is ensured to be in the power-ON state in corresponding time intervals encompassing durations of at least some of such future transmissions of control messages by wireless station (B), and is thereby enabled to receive the control messages. In an embodiment, the control messages correspond to group key message updates in which values of a decryption key are transmitted, wireless station (A) being a wireless client, wireless station (B) being an access point, with wireless stations (A) and (B) operating in a wireless network consistent with IEEE 802.11 specifications, and communication between wireless stations (A) and (B) being encrypted.

Abstract: A wireless station (A) is operated in a power-save mode, in which the station is alternately in power-ON and power-OFF states to reduce power consumption. Wireless station (A) computes at least some future time instances at which another wireless station (B) is expected to start transmitting control messages. Wireless station (A) is ensured to be in the power-ON state in corresponding time intervals encompassing durations of at least some of such future transmissions of control messages by wireless station (B), and is thereby enabled to receive the control messages. In an embodiment, the control messages correspond to group key message updates in which values of a decryption key are transmitted, wireless station (A) being a wireless client, wireless station (B) being an access point, with wireless stations (A) and (B) operating in a wireless network consistent with IEEE 802.11 specifications, and communication between wireless stations (A) and (B) being encrypted.

Abstract: According to an aspect, the values corresponding to each group of parameters are stored in successive memory locations of a set of blocks, and pointer locations are maintained to point to the area where the groups of values are stored. When a new value is received for a parameter of a group, the values of parameters (with the new value substituted for the corresponding old value) of the group are replicated to a new set of locations in the same set of blocks if sufficient number of successive unwritten memory locations are available. A pointer data from the prior set of locations to the new set of locations is also maintained. According to another aspect, when there is insufficient space for the replication, all the present valid values of all groups are first written to a new set of blocks, and then only the earlier set of blocks are erased.

Abstract: According to an aspect, the values corresponding to each group of parameters are stored in successive memory locations of a set of blocks, and pointer locations are maintained to point to the area where the groups of values are stored. When a new value is received for a parameter of a group, the values of parameters (with the new value substituted for the corresponding old value) of the group are replicated to a new set of locations in the same set of blocks if sufficient number of successive unwritten memory locations are available. A pointer data from the prior set of locations to the new set of locations is also maintained. According to another aspect, when there is insufficient space for the replication, all the present valid values of all groups are first written to a new set of blocks, and then only the earlier set of blocks are erased.

Abstract: There is disclosed configuring of clustered web services nodes accessing a common database, including implementing a data virtualization layer at each node to abstract an instance of the database from a web service application. In one embodiment, at each node is performed creating a first, data virtualization entity bean having all read and write operations of an application-developed (master) entity bean, creating a second entity bean that carries only the read operations of the master entity bean and addresses the replica instance, receiving an operation request at the first entity bean, and routing a request to either the master entity bean or the second entity bean depending upon the requested operation to access the respective database instance.

Abstract: A computer-implemented method, apparatus and computer program product for providing an interface between a client application and a web service is disclosed. A first request from the client application is received. The first request is associated with a response schema specifying a format for responding to the client application. A service request is sent to the web service dependent on the first request. An output from the web service is obtained responsive to the service request. The output is in a predefined output format associated with the web service. The output is transformed to conform to the response schema. The transformed output is provided to the client application.

Abstract: A system is described for selecting web services accessible over a network (380). The system comprises a pervasive device (10), one or more servers (20) in communication with the network (380) and supporting at least one base web service (502) that provides an output in reply to a request from the pervasive device (10). The system further comprises one or more servers (20) supporting at least one extended web service (606) operable to reduce a computational load of the pervasive device (10) in an interaction with the base web service (502). An application (504) running on the pervasive device (10) evaluates attributes of a Quality of Service (QoS) model relating to interactions between pervasive device (10), a base web service (502) and corresponding expanded web service (606). The application (504) chooses whether or not to use the corresponding web service based on the evaluated attributes.

Abstract: Systems and methods are disclosed for performing selective caching in network processing and other contexts. In one embodiment, upon receipt of a processor's request for a data item, a determination is made as to whether the data item is stored in the processor's cache. If the data item is not stored in the cache, then the data item is retrieved from an external memory unit. If the retrieved data item meets certain predefined criteria, the data item is stored in the cache, where it replaces a least recently used cache entry. In one embodiment, the criteria that is used to determine whether data will be cached is whether the data is associated with a data connection having at least a predefined capacity. In one such embodiment, the predefined capacity is selected such that a cache hit multiplier is optimized.

Abstract: Methods, systems and computer program products for learning consumer behavior are disclosed. A shared business opportunity with a merchant is offered to selected parties. Parent parties that accept the shared business opportunity are in turn enabled to offer a shared business opportunity to selected child parties. Each ancestor of one of the selected child parties is compensated in response to an online transaction between that child party and the merchant. Consumer behavior of a target party is predicted based on consumer behavior of at least one descendant party of the target party.

Abstract: Workflows are constructed to minimize a cost function that can be representative of information exposure risk and resource overhead. Given a workflow specification that defines a predetermined input and a required output, a set of possible workflows that meet this workflow specification can be constructed. The possible workflows are constructed using components that have defined inputs and outputs. A set of possible workflows results, and an exposure measure is calculated for each of these possible workflows. A workflow that has a minimum calculated exposure measure is selected and returned.

Abstract: Unique identifiers are created within a distributed application running on a distributed computer system. The unique identifiers are created by the various application copies, without reference to any central broker or synchronization mechanism. The identifiers include a local identifier component and a set label component. The identifiers are associated with identifier sets. The identifier sets are used to facilitate efficient communication within the distributed system, dynamic load balancing and implementation of fault tolerance.