Abstract: A solution is provided wherein the apparent dimensionality of a data set is reduced by ranking combinations of dimensions and parts of dimensions in terms of their suitability for mapping to the axes of a grid display. A user may then be presented with dense lower dimensional views of the data that are much easier to understand than sparse high dimensional views. The user may then make further refinements, groupings, and analyses as needed.

Abstract: Methods and systems for text data analysis and visualization enable a user to specify a set of text data sources and visualize the content of the text data sources in an overview of salient features in the form of a network of words. A user may focus on one or more words to provide a visualization of connections specific to the focused word(s). The visualization may include clustering of relevant concepts within the network of words. Upon selection of a word, the context thereof, e.g., links to articles where the word appears, may be provided to the user. Analyzing may include textual statistical correlation models for assigning weights to words and links between words. Displaying the network of words may include a force-based network layout algorithm. Extracting clusters for display may include identifying “communities of words” as if the network of words was a social network.

Abstract: A tree-based datastore comprising a forest of interconnected trees is generated and/or accessed. The tree-based datastore comprises a first tree that depends from a first root node and may include a plurality of branches. Each of the branches of the first tree ends in a leaf node. Each leaf node may represent an end product, as described more fully below. A second root of the same tree-based datastore is linked to each leaf node representing an end product. Hence, the second root is essentially a root to an inverted order of the first tree, but the first tree is not duplicated. Finally, the tree-based datastore comprises a plurality of trees in which the root node of each of these trees is an elemental node, as described more fully below. The root node of each of these trees may be linked to one or more nodes in one or more branches of the first tree. The nodes of the tree-based datastore contain only pointers to other nodes in the tree-based datastore.

Abstract: A process is disclosed for retrieving information in large heterogeneous data bases, wherein information retrieval through visual querying/browsing is supported by dynamic taxonomies; the process comprises the steps of: initially showing (F1) a complete taxonomy for the retrieval; refining (F2) the retrieval through a selection of subsets of interest, where the refining is performed by selecting concepts in the taxonomy and combining them through boolean operations; showing (F3) a reduced taxonomy for the selected set; and further refining (F4) the retrieval through an iterative execution of the refining and showing steps.

Abstract: A selection method and system. The method includes enabling, by a computing system for a requester, access to the computing system. The computing system comprises a memory system. The memory system comprises group based access control data and computing resource data organized based on an XML schema that comprises a recursive format used to support a plurality of branch levels in a resource tree. The computing system associates first group data of the group based access control data with the requester. The computing system receives from the requester, a first request for accessing the computing resource data. The computing system associates the first group data with a first group of computing resources of the computing resource data. The computing system generates a first list comprising attribute values for the first group of computing resources. The computing system stores the first list.

Abstract: The present invention relates generally to the field of self-validating documents in supply chain management, documentation services and method for creating the same.

Abstract: A method and apparatus for reproducing data from a recording medium using a local storage is disclosed. A method for reproducing data from a recording medium using a local storage includes the steps of: a) downloading an additional data file and a binding unit manifest file, and storing the additional data file and the binding unit manifest file in the local storage; b) determining a binding unit from among the downloaded additional data file according to the binding unit manifest file; c) performing a binding operation for binding the binding unit with an original data file contained in the recording medium according to the binding unit manifest file, and forming a virtual package; and d) reproducing additional data and original data using the formed virtual package.

Abstract: A named entity extracting apparatus that extracts a named entity suitable for a user by enabling an order to be set in which the named entity is extracted from texts includes: an extraction order reading unit 103 that acquires a named entity pattern name stored in association with an extraction order in an extraction order storage unit 102; a named entity extracting unit 105 that extracts the named entity from input texts using a named entity pattern corresponding to the named entity pattern name acquired by the extraction order reading unit 103; and an extraction end judging unit 106 which outputs, in the case where extraction has not ended, a text on which the extraction is in progress to the extraction order reading unit 103, and continues the named entity extraction processing.

Abstract: A method for sharing content with a user includes receiving from a user a first set of keywords for annotating an annotated user; receiving from the user a second set of keywords that designate whether annotated content annotated by at least one keyword included in the second set of keywords may be shared with the annotated user; storing in a data store a first association of the first set of keywords with the annotated user, and a second association of the second set of keywords with the annotated user; receiving a keyword selection for a select keyword and an identifier for the annotated user; and displaying on the client system content annotated by the select keyword if the annotated user is annotated by at least one keyword in the first set of keywords, and if the select keyword is included in the second set of keywords.

Abstract: A scanned-document management system includes a first user identification information reading unit that acquires identification information of a user who operates a document reading unit. An attribute information generating unit acquires information of a user identified by the user identification information and generates attribute information based on the acquired information of the user. A document registration unit registers the document data and the attribute data in a document management unit. A second user identification information reading unit acquires identification information of the user. A request information generating unit acquires information of a user identified by the user identification information acquired by the second user identification information reading unit and generates document acquisition request information. A corresponding document selection unit selects document data related to the user based on document acquisition request information and the attribute information.

Abstract: Rendering a contributor representation, such as an avatar, near content such as a comment, contributed to a web page such as a blog. The contributor representation is associated with a contributor identifier, such as an email address, and stored at a centralized registrar. The centralized registrar provides a content service with an initial script to include in the web page along with the contributor identifier. A requesting client runs the initial script, which requests an additional script from the centralized registrar. The additional script can track user actions and analyzes the DOM of the web page for an attribute associated with the contributor identifier and contributed content. Based on a location of the attribute in the DOM, the additional script also determines a location in the web page to insert the contributor representation. The additional script then requests and inserts the contributor representation to be rendered near the contributed content.

Abstract: A data repository monitoring system that utilizes queries to generate notifications in response to the identification of new and changed content. The system includes a monitoring component that monitors a plurality of disparate repositories in order to identify the receipt of new or modified content. The monitoring component includes a query component(s) that identifies metadata of imported content. The query can be generated and communicated to the monitoring component via a graphical user interface. A notification component is also provided to generate a prompt upon the receipt of incoming content as identified by the query component. The invention employs a centralized store (e.g., change queue) that maintains metadata corresponding to imported (e.g., new) metadata.

Abstract: Managing data across a semantic data view and a presentation data view may be provided. A semantic model may be represented in a semantic data view and a presentation model may be represented in a presentation data view. The presentation model may correspond to a graphical representation of the semantic model. In addition, a command may be received directed toward the semantic data view or the presentation data view. The semantic model and the presentation model may be operated upon according to the received command. Furthermore, the semantic model represented in the semantic data view and the presentation model represented in the presentation data view may be updated in response to operating on the semantic model and the presentation model according to the received command. The semantic model and the presentation model may be simultaneously maintained in a volatile memory in a computer.

Abstract: Content files are managed and tracked in a distributed collaborative computing environment to receive, store, and maintain content descriptor data associated with a distributed content files in a central directory registry. The central directory registry can be accessed by a plurality of remote distributed computing devices via one or more network connections. The remote distributed computing devices create content files using locally hosted software applications. Upon saving the content file to a portable or transient storage device connected to a computing device, content descriptor data comprised of administrative data pertaining to the content file and associated with the content file is created and forwarded to the central directory server.

Abstract: A repository of services, a system for building a repository of services, a method of building a repository of services and various other embodiments associated with the repository are disclosed. The method relates to a method of building a repository of services using a target services roadmap. The method comprises receiving from a user an identification of an implemented service and zero or more target services and mapping the implemented service to the zero or more target services. The target services and/or mapped implemented services are added to the repository.

Abstract: A method and an apparatus to filter autosupport data are presented. In one embodiment, the method includes filtering autosupport data from a storage appliance using criteria provided by a user, with relational integrity of the autosupport data protected. The method may further include exporting the filtered autosupport data to a public network to be uploaded to a portal server over the public network.

Abstract: Process for locating target item in a list including a plurality of items in sequence from 1 to m, including: (a) defining a range within the list including the target item, including: i) identifying a first item at location “n”, where 1?n?m; ii) identifying a last item at location “p” where n?p?m; (b) identifying and displaying an item at location D=((p?n)/2+n); (c) determining location of target relative to “D”. If the target is at or adjacent “D”, terminate the process and display the target item; if the target is between “n” and “D”, resetting “p” to “D”, repeat steps (b) and (c); if the target item is between “D” and “p”, resetting “n” to “D”, repeat steps (b) and (c); until the target item is at or adjacent the location “D”.

Abstract: When a Web-browser user employs a hyperlink, a Web-information manager makes a log entry that includes the URL of the Web page containing the hyperlink and also lists the URL of the target Web page, to which the hyperlink refers. When the user requests that a Web page be captured for later use, the Web-information manager uses the log to find the page at the root of the hyperlink chain that led to that page. It then determines from the root page's URL whether the root page is a search-result page. If it is, the Web-information manager infers the search specification from that URL and associates it with the page to be captured.

Abstract: According to an embodiment, a method includes constructing a neutral ontology model of a query front end characterized by ontology schemata which subsume the plurality of different databases on the network in order to provide a common semantic interface for use in generating queries for data from any of the different databases, importing respective database metadata representing logical and physical structures of each database subscribed for receiving queries for data from the database using the query front end, constructing mappings of the database metadata representing the logical and physical structures of each subscribed database to the ontology schemata of the query front end, and storing the constructed mappings for use by the query front end for queries through the common semantic interface of the neutral ontology model for data from any of the different databases.

Abstract: The claimed subject matter provides a system and/or a method that facilitates utilizing transition probability in static rankings associated with at least one document. An interface can receive data related to a query, wherein the query can be associated with a search from a user. A rank component can provide query results that are prioritized utilizing a transition probability based on user activity included within a user log.