Abstract: Compression of streaming data is described. In an implementation, a method includes compressing data for communication in a terminal services environment by finding an index in a lookup table that matches an initial sequence in data. The lookup table includes a plurality of entries. Each of the entries is discoverable utilizing a particular one of a plurality of the indices. Each entry references whether a corresponding index is located in a history buffer, and if so, further references one or more locations of the corresponding index in the history buffer. If the corresponding entry of the matching index references a plurality of locations, for each location, a sequence having the matching index is compared with a sequence in the data that includes the initial sequence. A matching sequence is derived from the comparison based on a length and the location of the sequence at each of the locations.

Abstract: The present invention extends to methods, systems, and computer program products for allocating and reclaiming resources within a rendezvous federation. Embodiments of the invention include formulating and routing messages in accordance with cached two-way agreements between adjacent nodes on a ring of nodes. Cached two-way agreements divide responsibility for at least unoccupied identifiers between the adjacent nodes on a ring. When a message is received at a node, the node can refer to a cached two-way agreement to determine if it or an adjacent node is responsible for the message. The node then sends the message to the next appropriate component in accordance with the cached two-way agreement.

Abstract: Scheduling searchable items such as web pages for crawling involves dynamically scheduling items for downloading based on capacity based on time. The workload is distributed over time, in advance, by anticipating and accounting for the discovery of new links on the particular host. Respective times to download items can be determined based on the current size of the host's crawl corpus relative to the maximum size of the host's crawl corpus. The respective times may be determined based additionally on respective freshness targets for the searchable items, which characterize how often an item's content should be refreshed by re-downloading the item, and on respective politeness factors for the host, which characterize the delay time between consecutive download requests to that host. As such, one can know precisely how the system is performing at any point in time and predict future performance.

Abstract: Methods and apparatuses for supporting multiple versions of web services standards are provided. A data handler receives a data entry in a version of a web services standard older than a most current version of the web services standard. A converter converts the data entry in the older version received by the data handler to conform to the most current version of the web services standard. The data entry converted by the converter to conform to the most current version of the web services standard is stored as a data object in a repository.

Abstract: A system, method, and program product is provided that requests, by a first computer system, a new network session with a second computer system. The new network session request occurs after a previous network session between the two systems and the new network session request includes a new sequence number that is different from a previous sequence number that was used during the previous network session. The first computer system receives an acknowledgement from the second computer system that references the previous sequence number instead of the new sequence number. In response to receiving the acknowledgement at the first computer system that references the previous sequence number, the first computer system modifies the new sequence number by setting it to a value that is higher than the previous sequence number, and the first computer system re-requests the new network session using the modified new sequence number.

Abstract: A system and method for performing a traffic process in an integrated network of a VoIP (Voice over Internet Protocol) network and a PSTN (Public Switched Telephone Network) are provided.

Abstract: A content management (CM) system is provided to centrally control operation of one or more connected devices by issuing control requests and/or data requests. In some situations the connected device(s) include devices that control presentation of television programming-related content, such as digital video recorder (“DVR”) devices and media center devices, and in other situations may include other types of media devices and/or other electromechanical (“E/M”) devices that may be centrally controlled, such as E/M devices for home automation that may operate independently or in conjunction with the media devices. In some situations, the CM system communicates with the connected devices via a network and using appropriate protocol(s), and may be accessed remotely via a network so as to allow a user to remotely operate the CM system. The CM system may further control searching, identification, selection, and presentation of pieces of media content by the connected device(s).

Abstract: An email preparation assisting device automatically produces human-relations information about human relations with a recipient to whom an email is to be sent. In order to realize this, term extraction member extracts terms from emails stored in a sent/received email storing section. Term usage frequency calculation member calculates the usage frequency of each extracted term, and adds it to the usage frequency of the term stored in a term usage frequency storing section. Human-relations information producing member weights human-relations basic information associated in advance with each term in a term association list for each communication partner with the usage frequency of the term for the communication partner stored in the term usage frequency storing section to produce human-relations information based on the result of the weighting operation. The produced human-relations information is stored in a human-relations information storing section separately for each communication partner.

Abstract: A method, system and apparatus for load balancing workloads in a cluster according to an iterative greatest common divisor approach to weight normalization. A load balancing method can include computing a greatest common divisor for a set of current normalized values for raw weights corresponding to endpoints in a cluster. Each of the current normalized values can be reduced by a factor proportionate to the greatest common divisor. The reduction can produce new normalized values for the raw weights corresponding to the endpoints in the cluster. The computing and reducing steps can be repeated for the new normalized values until the new normalized values are sufficiently low. Finally, workloads can be assigned to the endpoints in the cluster according to the new normalized values which are sufficiently low.

Abstract: An integration services network is described which is operable to facilitate access to a composite service by a plurality of users having associated client machines. Each of the users is associated with one of a plurality of independent enterprises. At least one data store has a directory stored therein which maps an identity for each of the users to a policy framework which defines access information relating to a plurality of services. At least one computing device is operable to set up the composite service by integrating operation of the plurality of services. The plurality of services are associated with and controlled by a plurality of independent service providers.

Abstract: A method and system for protecting an application that implements a communication protocol against exploitation of a communication-based vulnerability is provided. A protection system provides a protection policy that specifies how to recognize messages that expose a specific vulnerability and specifies actions to take when the vulnerability is exposed. A protection policy specifies the sequence of messages and their payload characteristics that expose a vulnerability. The protection system may specify the sequences of messages using a message protocol state machine. A message protocol state machine of an application represents the states that the application transitions through as it receives various messages. The message protocol state machine of the protection policy may be a portion of the message protocol state machine of the application relating to the vulnerability. The protection system uses the message protocol state machine to track the states that lead up to the exposing of the vulnerability.

Abstract: Embodiments provide mechanisms and methods for providing disconnectible applications capable of executing at least semi-autonomously, i.e., without needing constant contact with a server, on a client substantially independent of server connectivity. The ability of a disconnectible application to execute on a client substantially independent of server connectivity can enable enhanced flexibility in organizing applications to build data processing systems.

Abstract: Disclosed herein are filtering systems and methods that employ an electronic message source reputation system. The source reputation system maintains a pool of source Internet Protocol (IP) address information, in the form of a Real-Time Threat Identification Network (“RTIN”) database, which can provide the reputation of source IP addresses, which can be used by customers for filtering network traffic. The source reputation system provides for multiple avenues of access to the source reputation information. Examples of such avenues can include Domain Name Server (DNS)-type queries, servicing routers with router-table data, or other avenues.

Abstract: Disclosed herein are filtering systems and methods that employ an electronic message source reputation system. The source reputation system maintains a pool of source Internet Protocol (IP) address information, in the form of a Real-Time Threat Identification Network (“RTIN”) database, which can provide the reputation of source IP addresses, which can be used by customers for filtering network traffic. The source reputation system provides for multiple avenues of access to the source reputation information. Examples of such avenues can include Domain Name Server (DNS)-type queries, servicing routers with router-table data, or other avenues.

Abstract: The data transfer between an initiator and a target, interconnected over an IEEE1394 interface, is to be improved in efficiency. At the time of login, the buffer information of the targets 11 to 14 is acquired by an initiator 10. Based on the buffer information, acquired by the initiator 10, a data transfer table, at least including the node ID information of the targets 11 to 14, address information of the buffer memory and the data transmission/receipt specifying information for specifying the transmission or receipt of the data, is formulated. The data transfer table, formulated by the initiator, is supplied to each target. When a signal instructing the transfer of the data is input, handshaking is performed between the initiator 10 and the targets 11 to 14, based on the predetermined information appended to the transfer protocol of the interface, to effect the data transfer based on the data transfer table.

Abstract: The present invention extends to methods, systems, and computer program products for establishing and maintaining membership within a federation infrastructure. A joining node submits a join message to an existing federation infrastructure. The federation infrastructure routes the join message to a processing node. The processing node facilitates identification of predecessor, successor, neighborhood, and routing nodes (for the joining node) within a ring of nodes. The joining node exchanges messages with identified nodes to obtain state information for the identified nodes and other nodes within the ring. Nodes periodically exchange state information, including state information for other nodes, such that state information for the ring is efficiently propagated to all nodes in the ring even when communication between some nodes is lost. Instance IDs, phase values, and freshness values are used to determine when state information is stale and/or is to be updated.

Abstract: The Open Autonomy Kernel (OAK) addresses critical infrastructure requirements for next generation autonomous and semi-autonomous systems (24), including performance tracking, anomaly detection, diagnosis, fault recovery, and plant “safing”. OAK combines technologies in automated planning and scheduling, control agent-based systems (22), and model based reasoning to form a portable software architecture (26), knowledge-base, and open Application Programming Interface (API) to enable integrated auxiliary subsystem autonomy.