International Business Machines Corporation

Laurent David Hasson

David Konopnicki

David Andrew Brooks

Peter Kenneth Malkin

John J Ponzo

Daniel A Gisolfi

Jason Benjamin Ellis

Becky J Gibson

Igor Belakovskiy

Jianren Li

Mark A Pilgrim

Titania Mary Gupta

Yongcheng Li

Rakesh Mohan

John Scott Houston

Mitchell Adam Cohen

Shai Erera

Roderick Charles Henderson

Eitan Shapiro

Revathi Subramanian

Jakka Sairamesh

Josef Schiefer

Thomas Francis McElroy

Jobi George

Qun Zhou

Aaron M Leventhal

Embodiments of the present invention address deficiencies of the art in respect to crawling content and provide a novel and non-obvious method, system and computer program product for seed lists for hierarchically structured content sources. In one embodiment, a method for crawling seed lists for hierarchically structured content sources can be provided. The method can include specifying a depth of crawling for hierarchically structured content, crawling only seed lists at the specified depth among other seed lists in a hierarchy of seed lists mimicking the hierarchically structured content, and returning indexed data for the crawled seed lists. Optionally, an administrator user interface can be provided for specifying the depth of crawling for the hierarchically structured content.

Hierarchical seedlists for application data

A method, system and apparatus for time-out management for session-dependent applications. A time-out management system can include one or more of pages defining a session-dependent application. The system further can include a server-side time-out manager configured for use in a content server in detecting a time-out condition in the session-dependent application when the session-dependent application has been distributed to a content client. Finally, the system can include at least one client-side time-out manager configured to detect activity for the session-dependent application and to notify the content server when activity is detected in the session-dependent application when the session-dependent application has been distributed to the content client.

Time-out management for session dependent applications

Securing application information in a shared, system-wide search service, in which each application can register a security filtering module that is to be used at search time to filter data associated with that application. Initial, unfiltered search results are obtained based on the contents of the shared search index, and are organized by application. Previously registered filter modules are called to perform user specific, per-application filtering on the initial results, such that data to which the user issuing the search request does not have access is removed from the search results, resulting in a set of filtered search results that are presented to the user and that contain indications only of data that is accessible to the user.

Securing application information in system-wide search engines

A system for securing application information in a shared, system-wide search service. Each application can register a security filtering module that is to be used at search time to filter data associated with that application. When a user performs a search, initial, unfiltered search results are obtained based the contents of the shared search index. The unfiltered search results are organized by application, and previously registered filter modules are called to perform user specific, per-application filtering on the initial results. The filter modules cause data to which the user issuing the search request does not have access to be removed from the search results, on a per application basis. Those of the initial search results that are determined in this way to not be accessible to the user issuing the search request are removed, resulting in a set of filtered search results that are presented to the user. The filtered search results thus contain indications only of data that is accessible to the user. In this way, the system-wide search service filters search results to remove indications of data which match the search criteria provided by the user, but to which the user does not have access, based on a conveniently extensible, per-application search result filtering process.

Techniques are provided for data-discriminate search engine updates, where, in accordance with a first crawling session frequency associated with a first update type, a search engine index is updated by recording an update to a first set of data, where the update to the first set of data is of the first update type, and, in accordance with a second crawling session frequency associated with a second update type, the search engine index is updated by recording an update to a second set of data, where the update to the second set of data is of the second update type, where the first crawling session frequency is of a different frequency than the second crawling session frequency.

Data-discriminate search engine updates

A method within a system wherein a first user of the system provides information on social patterns to a second user includes: receiving a request for social pattern information from the second user, the request comprising a query; assigning authorization level to the second user for restricting the type and amount of data provided to the second user; providing information on social patterns to the second user according to the second user's authorization level; and storing information about the second user to be used in future transactions with the second user, the information including transactional fee data and subscription data for notifying the second user of additional social patterns as they develop.

Visualization for aggregation of change tracking information

A method and system are provided for searching across independent applications. A first seedlist () is provided from a first application (), the first seedlist () including a list of data items () for crawling by a search engine (). The data items () are owned by the first application (). A second seedlist () is also provided from a second independent application (), the second seedlist () including annotation data () for crawling by a search engine (). The annotation data () relates to the data items () of the first application (). A search index () provides searchable data from the two or more applications (), the searchable data relating to the same set of data items ().

Method and system for searching across independent applications

A system for identifying one or more social patterns in a status history of one or more change requests includes: a processor for executing instructions and memory comprising logic for: receiving as input change request data history; detecting social patterns in the change request data history; storing information about the social patterns, including status history data; and providing information on social patterns within the status history of the given change request. The logic includes the following elements: a hypertext transfer protocol server handler; a social pattern server database; a change log handler; a social pattern alert handler; a social pattern query handler; and a social pattern detection handler for: receiving new patterns wherein the patterns are user-defined operational descriptors, detecting social patterns in raw change request data from the change log handler, and storing the patterns in the database, and analyzing the patterns. The system further includes a graphical user interface.

System and method of visualization for aggregation of change tracking information

Methods, systems and computer program products are provided for communicating data between a web application running on a server and a browser running on a client in a network environment. Information is requested at the client from the server. The requested information is received at the client. The requested information is separated into a data portion and a markup portion.

Methods for maintaining separation between markup and data at a client

Accessible role and state information may be included in hypertext markup language documents by encoding an accessibility definition into a class attribute. The accessibility definition corresponds with an object of a hypertext markup language document and comprises role information and state information if state information is applicable to the corresponding role information. A script is associated with the hypertext markup language document and is configured for parsing at least a portion of the hypertext markup language document to identify the accessibility definition. The script further maps the role information and the state information in the accessibility definition to corresponding namespaced role and state attributes.

Accessible role and state information in HTML documents

A method, data processing system and computer program product for maintaining/updating managing keyboard navigation using a linked list. In particular, a Dynamic Tree Control Linkage (DTCL) utility creates a doubly linked list with list nodes having assigned values based on a tree control structure UI component. Each list node of the doubly linked list corresponds to a visible tree item of the tree structure UI component. Responding to a keyboard event signal, the DTCL utility finds a current list node corresponding to a first current tree item. The DTCL utility finds a next (i.e. previous or subsequent) list node corresponding to a next tree item. The DTCL utility detects a list node exists. The DTCL utility detects whether the next list node is associated with a null value. When the next list node is associated with a non-null value, the next tree item is identified. The DTCL utility returns an identification of the next tree item representing a second current tree item. The DTCL utility also updates the doubly linked list in response to the expansion/collapsion of the current list item. The DTCL utility avoids the need to number all tree items (both visible and hidden tree items) sequentially by adding list node(s) to or removing list node(s) from the linked list to represent the visible tree items.

Method for managing keyboard navigation within a tree control structure user interface component via a linked list

A method and apparatus are disclosed for managing composite business processes that include multiple trading mechanisms, such as requests for quotes (RFQs), auctions and contracts, or repeat passes through a single trading mechanism. The independence of the individual business processes that manage each trading mechanism is maintained, while each individual business process can be connected to other business processes to form a composite business process. Each individual business process that may be followed by another business process to form a composite process must have at least one state labeled as a conversion state with a conversion transition to another business process. A conversion transition spans the gap between an end state of one business process and the start state of another subsequent business process. When a conversion state is entered by an object, a determination is made as to whether the object is being managed by a composite flow, and if so, what business process to use next. Conversion transitions execute any necessary steps to create a new object of the type required by the next business process in the composite process.

Method and apparatus for creating and managing complex business processes

A method and system for administration of a search system () for searching data from a plurality of applications. The method includes defining the requirements of a plurality of applications (-) to send data to the search system (), and using optimization techniques () to adapt the resources () of the search system to meet the requirements. Resources () are allocated and de-allocated to the search system () in response to the outcome of the optimization. Policies () regarding resource consumption can be defined at predetermined times or in predetermined circumstances to enable dynamic resource allocation.

Administration of resources in system-wide search systems

A system, method and program product for generating artifacts that can convert back and forth between non-EMF (Eclipse Modeling Framework) objects and EMF-based objects in an EMF-based runtime environment such as Web Data Objects (WDO) or Service Data Objects (SDO). Included is a system for inputting one or more non EMF application classes such as Java Beans and generating artifacts that include: a source meta model (ecore) that describes the data model defined by the input application classes; an EMap file that contains mappings between the classes and properties of the non-EMF objects and the EMF Objects; a target meta model (ecore) which represents the source meta model as transformed by the emap mappings; and a set of java classes (Mediators and DiffHandlers) that will at runtime perform the transformation between the two environments (non-EMF and EMF based objects).

System and method for utilizing non-EMF based objects in an EMF environment

A server method for converting objects of a first type into objects of a second type, the method comprising: a) identifying one or more object classes of the first type; b) determining instance data based on the classes of the first type; c) introspecting each class of the first type; d) creating an artifact representing a software model; and e) generating one or more converters, each converter being based on the artifact and is configured for receiving the instance data and generating JavaScript code for recreating the instance from the classes as objects of the second type, for display on a browser.

Growing community of inventors

New York, NY, United States of America

Laurent David Hasson