Abstract: This disclosure describes techniques for addressing and/or accounting for path failures (e.g., congestion, link failures, disconnections, or other types of failures) within a network environment. In one example, this disclosure describes a method that includes receiving, by a node connected to a plurality of interconnected nodes, a network packet to be forwarded to a destination node; identifying, by a forwarding plane within the node, a first link along a path to the destination node; determining, by the forwarding plane, that the first link is inoperable; storing, by the node and within the network packet, data identifying the node as having been visited; identifying, by the forwarding plane and from among the plurality of egress links from the node, a second link that is operable and is along an alternative path to the destination node; and transmitting the network packet over the second link.

Abstract: Disclosed are techniques for multi-protocol multi-site file replication, including a method comprising capturing, at a gateway device, IO operations performed on a filesystem, the filesystem having inode bits. The method may further comprise enqueuing the captured IO operations onto a plurality of queues, wherein each of the plurality of queues is associated with one of a plurality of target sites; and independently managing replication of the IO operations to the target sites using the inode bits.

Abstract: Methods for analyzing text corpora for inferring potential threats and risks are becoming ever more established. While the present achievements are based on an analyst-driven analytical process, the embodiments provide for a semantic analysis of dynamic developments in changing text corpora, involving an acquisition of text corpora, application of a probabilistic concept model, and providing a similarity remapping.

Abstract: A method for inserting links to one or more webpages of a website is disclosed. The computerized method includes operations of detecting a first set of keywords for a first webpage of the website, determining a second set of keywords for webpages external to the website, determining, for the first webpage, a set of intersection keywords in both (i) the first set of keywords, and (ii) the second set of keywords, and generating first intersection keyword:link pairings for each intersection keyword of the first webpage. The method may also include inserting a code module into web code of the first webpage, the code module including the first intersection keyword:link pairings. The method may include determining one or more of the intersection keywords in content of the first webpage, and replacing each intersection keyword detected in the content of the first webpage with a link from the first intersection keyword:link pairings.

Abstract: A computing platform that enables creation and management of data records may be configured to (i) cause a client station of a user to display an initial view of an interface for selecting, from a hierarchical list of possible values for a given data field of a data record, one or more values to assign to the given data field, (ii) receive, from the client station, a first indication that the user has selected a first value from the hierarchical list to assign to the given data field, and (iii) in response to receiving the first indication, (a) identify a second set of one or more values from a second level of the hierarchical list that are related to the first value, and (b) cause the client station to display an updated view of the interface in which the recommendation pane presents the second set of one or more values.

Abstract: Embodiments of the present invention provide methods, computer program products, and systems for optimizing virtual calls. Embodiments of the present invention can be used to receive a virtual call associated with a first implementation method and identify a virtual call associated with a second implementation method that appears to have similar functionality to the first implementation method. Embodiments of the present invention can determine whether the virtual call associated with the first implementation method and the virtual call associated with the second implementation method produce the same result and, responsive to determining that the virtual call associated with the first implementation method and the virtual call associated with the second implementation method produce the same result, use a result of the virtual call associated with the first implementation method as a result of the virtual call associated with the second implementation method.

Abstract: A method or system that receives a product definition that includes a feature family having data defining one or more product features. The product definition including one or more corresponding rules defining one or more relationships between one or more product features. The method or system receiving input selecting one or more feature families of interest. The method or system identifying the one or more rules that provide a relationship connecting the one or more feature families to the selected feature families of interest. The method or system converting the identified rules to one or more positive logic rule groups. The method or system generating one or more global representations of the product definition by interacting the one or more positive logic rule groups to produce a result that defines the relationship between the interacted positive logic rule groups and storing the results that are determined as being valid.

Abstract: A system, method, and computer program product are provided for performing operations on network files including captured billing event information. In use, at least one network file is generated in response to a data capture command associated with a communications network, the at least one network file including information associated with a plurality of billing events corresponding to the communication network. Additionally, user input is received to perform at least one operation corresponding to the at least one network file, the at least one operation including at least one of: editing the at least one network file; filtering the at least one network file, based on configurable criteria; replaying at least a portion of the plurality of billing events included in the at least one network file; and generating an event template utilizing at least a portion of the information associated with the plurality of billing events.

Abstract: A method or system that receives a product definition that includes a feature family having data defining one or more product features. The product definition including one or more corresponding rules defining one or more relationships between one or more product features. The method or system receiving input selecting one or more feature families of interest. The method or system identifying the one or more rules that provide a relationship connecting the one or more feature families to the selected feature families of interest. The method or system converting the identified rules to one or more positive logic rule groups. The method or system generating one or more global representations of the product definition by interacting the one or more positive logic rule groups to produce a result that defines the relationship between the interacted positive logic rule groups and storing the results that are determined as being valid.

Abstract: Performing a user initiated search query is disclosed and comprises receiving user input comprising description details of at least one desired object, retrieving a plurality of objects from a database sharing one or more of the description details of the user input, constructing a tree data structure based on the description details of the plurality of objects, the tree data structure comprising one or more attributes related to each of the plurality of objects retrieved, displaying visual images associated with the retrieved plurality of objects, the visual images matching at least one of the attributes related to the plurality of objects, and receiving a user selection of one or more of the visual images.

Abstract: A computer displays a graphical user interface on its display. The graphical user interface includes a schema information region and a data visualization region. The schema information region includes multiple operand names, each operand corresponding to one or more fields of a multi-dimensional database that includes at least one data hierarchy. The data visualization region includes a columns shelf and a rows shelf. The computer detects user actions to associate one or more first operands with the columns shelf and to associate one or more second operands with the rows shelf. The computer generates a visual table in the data visualization region in accordance with the user actions. The visual table includes one or more panes. Each pane has an x-axis defined based on data for the one or more first operands, and each pane has a y-axis defined based on data for the one or more second operands.

Abstract: Nodes in a tree data structure are associated with respective node keys. At least some of the nodes are associated with at least one respective node rank. The structure is searched to attempt to identify a preferred prefix-matching node on the basis of attempting to find a prefix-matching node that has a prefix match with a search key and which has a preferred node rank relative to a node rank associated with a node which may have a longer prefix match. If the prefix-matching node is identified, a dependent node rank identifier associated with the prefix-matching node is used to determine that the prefix-matching node has the preferred node rank. The dependent node rank identifier indicates at least a node rank of a node which may have a longer prefix match than the prefix-matching node. The prefix-matching node is selected, if identified, as a preferred prefix-matching node.

Abstract: A method and apparatus for managing parts. A number of identifiers is received for an unidentified part. A determination is made as to whether the number of identifiers sufficiently matches a number of corresponding identifiers in a plurality of identifiers in a code stored in a database of codes associated with parts. The code is associated with the part. In response to the number of identifiers matching the number of corresponding identifiers in the plurality of identifiers in the code, a repository storing related information for the parts is accessed to obtain the related information for the part using a code identified for the part.

Abstract: A method and apparatus for real time datamining. In one embodiment, the method includes receiving a user request for datamining with respect to a value from a report associated with a specific pyramid level, identifying a datamining function to be performed for statistical analysis of lower level data pertaining to the value from the report, identifying dimensions to be used as variables for the statistical analysis, and determining criteria for selecting the lower level data associated with the value from the report. The method may further include submitting a request to one or more source databases, the request reflecting the identified dimensions and the determined criteria, performing the datamining function on a data set received from the source databases, and creating a datamining report based on a result of the performed datamining function.

Abstract: Performing a user initiated search query is disclosed and comprises receiving user input comprising description details of at least one desired object, retrieving a plurality of objects from a database sharing one or more of the description details of the user input, constructing a tree data structure based on the description details of the plurality of objects, the tree data structure comprising one or more attributes related to each of the plurality of objects retrieved, displaying visual images associated with the retrieved plurality of objects, the visual images matching at least one of the attributes related to the plurality of objects, and receiving a user selection of one or more of the visual images.

Abstract: A method of leveraging XML (eXtensible Markup Language) Technology, or similar modeling languages such as ontology definition languages, to provide attribution and multi-node data modeling, object orientation, classes, and linkage capabilities of such languages and technologies, specifically for authoring new and translating existing technical specifications in such a way that the base text content is augmented with additional information such as metadata, in such a way that other sub-specifications, data sheets, inspection and quality assurance documents, etc., do not need to be written separately, but instead become logical sub-components of the governing specifications themselves.

Abstract: This specification relates to presenting image search results. In general, one aspect of the subject matter described in this specification can be embodied in methods that include the actions of receiving an image query, the image query being a query for image search results; receiving ranked image search results responsive to the image query, the image search results each including an identification of a corresponding image resource; generating a similarity matrix for images identified by the image search results; generating a hierarchical grouping of the images using the similarity matrix; identifying a canonical image for each group in the hierarchical grouping using a ranking measure; and presenting a visual representation of the image search results based on the hierarchical grouping and the identified canonical images.

Abstract: Systems, methods and computer program products are disclosed for facilitating the collection of activity data, organizational hierarchy data and distribution list data within a private computer network (especially an intranet) while complying with applicable privacy laws and regulations, as well as individual organizations' business rules addressing intranet users' privacy to display a social graph of organization members related to a requesting organization member. Such systems, methods and computer program products allow for the collecting of such data passively without a need for active participation from the requester. A computer-implemented process for displaying a social graph further comprises calculating sub-scores for each of activity data, organizational data and distribution list data and calculating a total score for each related organization member and displaying the social graph comprising those organization members whose score exceeds a predetermined value as related to the requester.

Abstract: A method for maintaining group membership records includes 1) maintaining a record of group memberships for a membership hierarchy, the membership record identifying a direct relationship between a first object and a second object in the membership hierarchy, 2) receiving a membership update indicating that, as of a first point in time, a direct relationship between the second object and a third object changed, 3) updating the record of group memberships to reflect the change in the relationship between the second object and the third object, 4) deducing, based on the membership update and the record of group memberships, a change in an indirect relationship between the first object and the third object as of the first point in time, and 5) providing a view of object relationships within the membership hierarchy as the object relationships exist at the first point in time and a historical record of object relationships.

Abstract: Based on received data descriptive of an event, a hierarchical data structure is constructed comprising structural elements associated with components of an event. A file folder hierarchy corresponding to the hierarchical data structure is created. User interfaces facilitate user access to files and folders in the hierarchies. Certain documents may be designated as documents of record and access to those documents is limited to processes that will not modify the original electronic document, thereby preserving it. Facilities for creating working copies of documents of records and associating them within the hierarchies are provided. A scanning information sheet that may have an electronically readable data imprint containing information about a document to be scanned is described for facilitating the migration of paper documents into an electronic file management system.

Abstract: There are provided systems and methods that can assist interactively a knowledge user/contributor to obtain a straight answer to his/her request for knowledge about one or more subject matter, can mediates a large group of unknown inquirers and present them with distilled stage of knowledge related to a subject matter, and/or can guide and assist, individually or socially, to find or discover credible and value significant knowledge at much faster rate than the current traditional method of using search engine directories, social networking, blogging, and bookmarking websites. The methods, systems and services of the presented disclosure can significantly increase productivity of knowledge-based users and quality of their work.

Abstract: A method includes receiving a concept hierarchy at a computing device. The concept hierarchy identifies concepts associated with a document corpus. An interface based on the concept hierarchy is generated. The interface is operable to navigate, search, and modify the concept hierarchy. The method includes transmitting the interface for display to a display device.

Abstract: Performing a user initiated search query is disclosed and comprises receiving user input comprising description details of at least one desired object, retrieving a plurality of objects from a database sharing one or more of the description details of the user input, constructing a tree data structure based on the description details of the plurality of objects, the tree data structure comprising one or more attributes related to each of the plurality of objects retrieved, displaying visual images associated with the retrieved plurality of objects, the visual images matching at least one of the attributes related to the plurality of objects, and receiving a user selection of one or more of the visual images.

Abstract: A storage system, according to one embodiment, includes a processor and logic integrated with and/or executable by the processor. The logic is configured to: search for an instance of a file or portion thereof on a second storage tier; at least one of: associate the instance of the file or portion thereof on the second storage tier with a first user when the instance of the file or portion thereof is not associated with any user, and replicate the instance of the file or portion thereof on the second storage tier and associate the replicated instance of the file or portion thereof on the second storage tier with the first user; and disassociate an instance of the file on a first storage tier from the first user.

Abstract: Systems and methods that create and edit a network of interconnected concepts are disclosed. In one embodiment, a semantic engine implements a method comprising receiving a primary term representing a first concept to be added to a network of interrelated concepts, receiving at least one related term related to the primary term, receiving at least one relationship between the first concept and a second concept, receiving a strength value associated with the relationship, and adding the first concept to the network.

Abstract: A method for generating a tree-type data structure composed of a plurality of data strings includes the steps of: summing, with respect to a plurality of data strings classified in a parent node, the numbers of data types of data, respectively, at least one given string position in each of the plurality of data strings; and classifying, based on the numbers of the data types respectively summed at the at least one given string position in the summing step, the plurality of data strings into a plurality of child nodes, for the respective data types at a given string position.

Abstract: A storage system includes a plurality of vdisks, with each vdisk containing a plurality of storage segments, and each segment providing a specific class of service (CoS) for storage. Each vdisk stores files with data and meta data distributed among its storage segments. A storage system includes a memory having multiple classes of service. The system includes an interface for storing a file as blocks of data associated with a class of service in the memory. The interface chooses the class of service for a block on a block by block basis for storage. A file system for storing a file. A file system for storing includes a plurality of vdisks. A method for storing a file.

Abstract: A storage system according to one embodiment includes logic integrated with and/or executable by a hardware processor, the logic being configured to: determine an ownership status for each of a plurality of instances of a file in a first storage tier and in a second storage tier of the storage system; determine locations of the instances of the file in the storage system; determine whether the instances of the file in the first storage tier are being accessed or not being accessed; and assign each of the instances of the file to one of a plurality of indices using the determined ownership status, location, and whether the instances are being accessed.

Abstract: Embodiments of the invention provide a novel and non-obvious method, system and computer program product for generating a document taxonomy based upon tag data in groupings of tags. In an embodiment of the invention, a method for generating a document taxonomy based upon tag data in groupings of tags has been claimed. The method includes retrieving into memory of a host computer different groupings of tags for correspondingly different documents providing a bottom-up view of the documents. The method further includes deriving a folksonomy from the groupings of tags for the documents and organizing the folksonomy into a hierarchy of nodes. Of note, each of the nodes can be associated with a different subject in the folksonomy. Finally, the method includes publishing the hierarchy of nodes as a taxonomy for the documents to provide a top-down view of the documents.

Abstract: Spooling strategies are described for producing job information that conforms to a hierarchical structure, and then storing the job information in a spool storage. The job information is then retrieved from the spool storage and consumed. The structured job information includes a multi-level hierarchy of nodes, including a job level that represents the entire job, a document level that represents a document to be processed within the job; a rendition level that represents a rendition of the document to be processed; and a page level that represents a page associated with the rendition. In addition, filter logic processes job information based on capabilities of a target entity utilizing the job information.

Abstract: An information processing apparatus includes first and second position acquiring units which respectively acquire a position metadata piece from a target data piece and position metadata pieces from plural data pieces different from the target data piece. A target acquiring unit acquires target metadata pieces other than the position metadata pieces from the other data pieces, and an analysis unit analyzes a distribution of the target metadata pieces based on positions indicated by the position metadata pieces acquired from the other data pieces. An assignment unit assigns to the target data piece a target metadata piece that has a value related to the target data piece, the target metadata piece being selected from among the analyzed target metadata pieces, based on the distribution and the position indicated by the position metadata piece acquired from the target data piece.

Abstract: Described herein are systems and methods for modeling building resources. In overview, building resources are represented by points defined in an information system. These points are defined in a manner so as to allow the generation of a hierarchical structure on their basis. A logical representation of this hierarchical structure, or part of this hierarchical structure, is viewable by a client, for example by way of a browser application. In various embodiments, the logical representation implements functionalities including alarm aggregation and/or scope of responsibility filtering.

Abstract: A storage system according to one embodiment includes a first storage tier; a second storage tier; logic for storing instances of a file in the first storage tier and the second storage tier; logic for determining an ownership status for each instance of the file in the storage system, wherein the ownership status includes owned and unowned; logic for determining a location of each instance of the file in the storage system; logic for determining whether each instance of the file in the first storage tier is being accessed or not being accessed; logic for assigning each instance of the file to one of a plurality of indices using the determined ownership status, location, and whether the instance is being accessed; logic for receiving a request to access the file or instance thereof from a user; logic for selecting an instance of the file based on an assignment of the instance of the file to one of the indices; and logic for providing the user with access to the selected instance of the file or copy thereof.

Abstract: A storage system according to one embodiment includes a first storage tier; a second storage tier; logic for storing instances of a file in the first storage tier and the second storage tier; logic for determining when to migrate an instance of the file associated with a first user and stored on the first storage tier to the second storage tier; logic for searching for an instance of the file or portion thereof on the second storage tier that is not associated with any user; logic for associating the instance of the file or portion thereof on the second storage tier with the first user; and logic for disassociating the instance of the file on the first storage tier from the first user. Additional systems, methods, and computer program products are also presented.

Abstract: A method is provided for constructing an ancestral recombination graph. A value K is received representing K extant units. M non-mixing segments are also received. K vertices V are generated. K lineages for each of M trees are associated with each of the K vertices. An ancestral recombination graph is constructed. To construct the ancestral recombination graph, there is repeated, until only one lineage survives for each of the M trees, a process that includes the following. A tree is randomly selected tree. A first vertex v1 and a second vertex v2 are randomly selected. Two adjoining segments in the M non-mixing segments of the first and second vertices are combined together into a single vertex. A separate vertex is generated for at least one remaining segment in each of the M non-mixing segments of the first and second vertices. The vertices V are updated to be vertices that are non-interior vertices.

Abstract: An apparatus, and an associated method, synchronizes directory services based on group membership. A synchronization scope is defined by the group membership to a specified nesting level of nestable groups. Groups within the synchronization scope are fetched and de-nested. And, once fetched, the members of the fetched and de-nested groups are fetched. The fetched object names are used to update the destination directory service.

Abstract: Disclosed is a method for identifying inactive objects in an entity. The inactive objects may be purged from an entity to reduce the size of the entity.

Abstract: A method and system is provided for calculating importance of documents based on transition probabilities from a source document to a target document based on looking ahead to information content of target documents of the source document. A look-ahead importance system generates transition probabilities of transitioning between any pair of source and target documents based on analysis of links to target documents of the source document. The system may calculate the transition probabilities based on the number of links on documents a look-ahead distance away. The system then solves for the stationary probabilities of the transition probabilities. The stationary probabilities represent the importance of the documents.

Abstract: A computer-implemented sorting method for efficiently sorting large data sets in computing environments that include virtual memory and processor caching, the method including determining available physical memory, identifying portions of the data set that each fit in the available physical memory, determining available cache, identifying sub-portions within the portions that each fit in the available cache, sorting each sub-portion, repeating the identifying portions, identifying sub-portions, and sorting for each portion of the data set, and merging the sorted sub-portions and portions such that the data set is sorted. The sorting method avoids the use of virtual memory and seeks to identify sub-portions that fit in available cache.

Abstract: Described herein is a technology for visualizing data. In accordance with some implementations, dimension metadata is automatically extracted from multiple documents. The extracted dimension metadata may be used to populate one or more relation dimensions. Based on the dimension metadata, one or more relations between the documents are determined along the one or more relation dimensions. A relation graph is presented to represent the documents interconnected by the one or more relations.

Abstract: The RFID reader reads out an RFID stored in an RFID tag in the vicinity through wireless communication. The clock acquires an RFID readout time. The location sensor acquires an RFID readout location. The memory stores the RFID in association with the readout time and the readout location. The communication I/F acquires RFID-related information from a server asynchronously with readout of the RFID. The processor generates in the memory an RFID aggregate structure, which is a data structure of RFID aggregates constructed by classifying a plurality of RFIDs stored in the memory based on the readout time and the readout location and in which RFID-related information is stored in association with the constructed RFIDs.

Abstract: A method for maintaining group membership records includes 1) maintaining a record of group memberships for a membership hierarchy, the membership record identifying a direct relationship between a first object and a second object in the membership hierarchy, 2) receiving a membership update indicating that, as of a first point in time, a direct relationship between the second object and a third object changed, 3) updating the record of group memberships to reflect the change in the relationship between the second object and the third object, 4) deducing, based on the membership update and the record of group memberships, a change in an indirect relationship between the first object and the third object as of the first point in time, and 5) providing a view of object relationships within the membership hierarchy as the object relationships exist at the first point in time and a historical record of object relationships.

Abstract: A system for information item categorization in which each non-leaf node in a hierarchical organization of nodes represents a category, and each leaf node represents an information item. A number P is associated with each node. For non-leaf nodes, the associated number P is selected from a subset of relatively prime elements chosen from an appropriate Unique Factorization Domain (UFD), such as a set of relatively prime numbers which are a subset of the familiar set of integers. For leaf nodes, P is set to 1. A number M is also associated with each node. For each root node, M is set to the value of P for that node. For each non-root node, M is set to the product of the M's of all parent nodes of the node and the P of that node.

Abstract: Configuration spaces facilitate the useful presentation of data, particularly configuration data used for representing configured products. Products include features and common features can be grouped by families. For example, an automobile can include a transmission family. The transmission family could include features such as automatic transmission and 4-speed manual transmission. Configuration spaces can be achieved by consolidating selected data without loosing useful information. The degree of consolidation achieved can be significant enough to permit display of data using conventional display technology. Configuration spaces break down the “universe” of possible configurations into constituent spaces defined by groups of rules for a selected feature. Common dependencies between the selected feature and related features can be consolidated to produce a more minimal form of the data used for representing the selected features and related features.

Abstract: This specification relates to presenting image search results. In general, one aspect of the subject matter described in this specification can be embodied in methods that include the actions of receiving an image query, the image query being a query for image search results; receiving ranked image search results responsive to the image query, the image search results each including an identification of a corresponding image resource; generating a similarity matrix for images identified by the image search results; generating a hierarchical grouping of the images using the similarity matrix; identifying a canonical image for each group in the hierarchical grouping using a ranking measure; and presenting a visual representation of the image search results based on the hierarchical grouping and the identified canonical images.

Abstract: Embodiments of the present invention provide a multifaceted tool (e.g., graphical representation/object) for searching and displaying data (e.g., search results). Specifically, aspects of the present invention build on “seed” terms to find and display related words, presenting them in a graduated manner by closeness to the seed. The tool allows a user to select variable weights which indicate the desired degree of closeness to the seed word/idea, or it may be randomly generated. Additionally, this tool may be used to create brainstorm teams with a desired level of variance from a target subject. In a typical embodiment, the a search or seed term and corresponding results are displayed in a hub and spoke-like graphical representation whereby the seed term is positioned in a center window of the graphic, and results are displayed in branches that extend radially from the center. Each branch can correspond to a different information source from which the corresponding results were obtained.

Abstract: Locating a file object in a storage system includes determining at least one characteristic of the file object, obtaining a subset of nodes in the storage system by applying the at least one characteristic to criteria for storing file objects at particular ones of the nodes in the storage system, and examining the subset of nodes to determine if any contain the file object. A metadata location server may be used to obtain the subset of nodes. The criteria may include at least one policy relating to placement of objects corresponding to files at the time the files are created. The policies may relate to owners of the files. The characteristic information may include the owner of a target file corresponding to the file object, the date that the target file was created, a business organization associated with the target file, and/or the size of the target file.

Abstract: When performing migration of data from a migration source file server which is not endowed with any HSM interface, to a migration destination file server which is endowed with HSM, a volume of high capacity is needed for the migration destination file server, and moreover the performance deteriorates directly after the migration. However, with this system, the manager is enabled to set a migration policy using attribute information which can be acquired through a standard file access interface possessed by a file server program, and, when setting the attribute information of the migration destination file, the tier of the file which is to be created is determined, and the migration destination file is created, on the basis of this attribute information and migration policy.

Abstract: A data set may be represented as a hierarchical node set, comprising interrelated nodes that respectively include various data features (e.g., versions in a version-controlled software architecture.) Queries may be formulated regarding the inclusion of a particular feature in the nodes of the hierarchical data set (“does this node include this data feature?” and “what is the path of the data feature through the node set?”) Such queries may be evaluated by identifying a source node that includes the data feature, identifying candidate merge paths from the source node to the taget node, and determining whether the nodes of any candidate merge path include the data feature. The results may be presented to the user, e.g., as a visual layout of the portion of the hierarchical node set that includes the data feature or a timeline of nodes illustrating the path of the data feature over time.

Abstract: An apparatus, and an associated method, synchronizes directory services based on group membership. A synchronization scope is defined by the group membership to a specified nesting level of nestable groups. Groups within the synchronization scope are fetched and de-nested. And, once fetched, the members of the fetched and de-nested groups are fetched. The fetched object names are used to update the destination directory service.