International Business Machines Corporation

David Alson George

Raymond Byars Jennings, Iii

Seraphin Bernard Calo

Jason D LaVoie

Ramani Ranjan Routray

Kaladhar Voruganti

Murthy V Devarakonda

Kang-Won Lee

Parijat Dube

Sandeep Gopisetty

Norbert George Vogl

Chung-hao Tan

Martin G Kienzle

Konstantinos Magoutis

Mandis S Beigi

Gauri Sudhir Shah

Dakshi Agrawal

Jarir Kamel Chaar

Kiyoshi Maruyama

Malgorzata Elzbieta Stys

Dinesh C Verma

Charles Steven Lingafelt

Sambit Sahu

Suresh N Chari

Chatschik Bisdikian

Joseph Phillip Bigus

Steve Richard White

Nagui Halim

Anees Abdul Shaikh

Eric P Bouillet

Mark David Feblowitz

William S Cadden

Kay Schwendimann Anderson

Jean A Lorrain

Bharat D Rathi

Carolyn A Brodie

Shun Shing Chan

Clare-Marie Karat

Miram Zohar

Laurence Howell Lancaster

Joseph D Ryan

Mark Mei

Methods and apparatus of classifying received email are provided. At least one initial desirability scan is performed on a received email. When the received email passes the at least one initial desirability scan, it is determined if the received email comprises one or more browser-interpretable scripts. When the received email comprises one or more browser-interpretable scripts, a secondary desirability scan is performed on the received email as a function of the one or more browser-interpretable scripts. The received email is identified as undesirable email when the received email fails the at least one initial desirability scan, or the received email fails the secondary desirability scan. The received e-mail is identified as desirable email when the received email does not comprise one or more browser-interpretable scripts or the received email passes the secondary desirability scan.

Methods and apparatus for identifying spam email

Techniques for automatically designing an application-requirement based configuration for a distributed computing system are provided. One or more application-level templates are obtained, wherein the one or more templates are representative of one or more requirements associated with one or more applications. Using the one or more application-level templates, one or more logical flows are created. The one or more logical flows are then used to generate one or more system-level configuration plans of the distributed computing system.

Application-requirement based configuration designer for distributed computing systems

One embodiment of the present method and apparatus for assisting a peer-to-peer connection between a first node and a second node includes receiving, at a third node, a request for connection assistance from one of the first and second nodes. The third node then connects to both the first node and the second node, receives the data from the first node and delivers the data to the second node. In this manner, data may be transferred between the first and second nodes even if the first and second nodes are unable to directly connect to each other (e.g., due to permanent or temporary limitations).

Method and apparatus for peer-to-peer connection assistance

A system and method for processing an information unit/packet (IU) in a stream processing system includes decomposing an IU into sub-information units persisted other than in the IU. An index or reference is generated in the IU for retrieving the persisted sub-information units during processing.

Method and system for secure lightweight stream processing

In one embodiment, the invention is a method and apparatus for distributed policy evaluation. One embodiment of a method for evaluating a systems management policy, where the policy includes a condition and an action to be taken when the condition evaluates to TRUE, includes forwarding the policy, by a first autonomic manager, to a second autonomic manager and receiving at the first autonomic manager at least partial evaluation results for the condition from a third autonomic manager. The first autonomic manager, the second autonomic manager, and the third autonomic manager are arranged in a ring configuration such that the evaluating occurs in a cascading manner, and only the first autonomic manager has access to a policy storage from which the policy is retrieved.

Method and apparatus for distributed policy evaluation

A logical expression of a policy is generated from another logical expression of a policy, for example, via a set of transformations, each of which comprises an input sub-expression and an output sub-expression. Any sub-expression of the input expression which matches an input sub-expression of a transformation rule is replaced with the output sub-expression of that transformation rule to form a sub-expression of the output expression.

Method and apparatus for rule-based transformation of policies

Methods, systems and program storage devices receive actions taken by a user during an interaction with a web resource, wherein the actions cause the web resource to assume a particular state; and save information describing the actions. Other methods, systems and program storage devices retrieve the information; and perform at least one action using the information, causing a graphical user interface to display the web resource in a state in accordance with the action. The particular state can include without limitation a plurality of states assumed sequentially when the web resource is displayed, and the information can describe a sequential series of actions that cause the web resource to assume the sequential series of states. In such variants further operations include receiving a series of commands to step through the sequential states of the web resource; and using the information to display the sequential states. The series of commands can be issued automatically or under user control.

Method, apparatus and computer program product for capturing and  viewing stored web resource interactions

A system and method for determining policy coverage and generating a suggested policy for gaps in the policy coverage includes determining policy coverage for one or more policies in a policy coverage space and determining regions uncovered by the policy coverage in the policy coverage space. Suggested policies are generated to cover the regions uncovered by the policy coverage. The policy coverage is supplemented with the suggested polices to complete coverage of a policy set.

System and method for automatically generating suggested entries for policy sets with incomplete coverage

A method, system and program storage device for browsing hyperlinked documents are provided. A method in one aspect may include enabling navigating from a document having a plurality of hyperlinks to a document associated with one of said plurality of hyperlinks; and enabling navigating directly from said document associated with one of said plurality of hyperlinks to another document associated with another one of said plurality of hyperlinks using one or more of a plurality of defined elements. System and program storage device for performing the above methods are also provided.

Method and apparatus for document browsing

A method for validating that a networked system of modules conforms to at least one interoperability rule pertinent to interoperability of at least two of the modules includes the steps of obtaining the at least one interoperability rule, the at least one rule being encoded in computer-operable format; obtaining configuration information pertinent to at least one of the modules, the configuration information being encoded in computer-operable format; and comparing the at least one interoperability rule to the configuration information to validate whether the system conforms to the at least one interoperability rule

Validation of module interoperability

Methods, apparatus and computer program products implement session-specific URIs for allocating network resources by receiving a request from a user for at least one network resource; assigning a session-specific URI to the at least one network resource for use in identifying the at least one network resource and controlling access to the at least one network resource; updating a network directory service with the session-specific URI; and communicating the session-specific URI to the user. The user communicates the session-specific URI to other participants in the session during which the at least one network resource will be used. After a pre-determined time, the session ends and the at least one network resource is de-allocated by, for example, changing the URI of the at least one network resource. Frequent changes of URIs hinder efforts by unauthorized individuals to gain access to network resources.

Method, apparatus and computer program product implementing session-specific URLs and resources

One embodiment of the present method and apparatus for processing a search request message received over a network includes computing a threshold value in accordance with the search request message and returning at least one search result to a user in response to the search request message, if a rank of the at least one search result at least meets the threshold value.

Method and apparatus for managing peer-to-peer search results

One embodiment of the present method and apparatus for reducing spam in peer-to-peer networks includes forming a search message including at least one decoy word and sending the search request message, including the decoy word(s), to one or more nodes in the network. Embodiments of the present invention make it possible to weed out nodes in the network that send spam in response to every search message (e.g., regardless of the search message's content).

Method and apparatus for reducing spam on peer-to-peer networks

One embodiment of the present method and apparatus for re-establishing anonymous data transfers between a first endpoint and a second endpoint in a network includes receiving, from a first node, the identity of a second node connected to the first node, where at least the first node is a neighbor node. A third node (a neighbor node) is then selected, and instructed to connect to the second node in order to establish a link for the path. In this manner, the first endpoint and the second endpoint remain unknown at least to each other (e.g., where 'unknown' means that neither endpoint knows any identifying information, such as network address, about the other endpoint), and likely to all other nodes in the path as well. In another embodiment, a failure is detected at a neighbor node, where the neighbor node is part of an original path between the first endpoint and the second endpoint. The neighbor node's repair server is contacted for a repair node associated with the neighbor node, and a connection to the repair node is made such that the path is established in a manner that maintains anonymity of the first endpoint and the second endpoint relative to each other.

Method and apparatus for re-establishing anonymous data transfers

A system and method for retrieving instant messages includes establishing a first instant message (IM) session an then, establishing a second instant message session using a same account as the first instant message session. The first IM session is rendered dormant such that active instant messages are received by the second instant message session.

Growing community of inventors

Somers, NY, United States of America

David Alson George