Abstract: A method for searching a web service registry system by use of a search controller. A first search of a service registry program product is performed with a service name received by the search controller from a user. It is determined that the received service name does not have a service description associated with the received service name in the service registry program product. A second search of the service registry program product is coordinated with a candidate service name by use of the search module, wherein the candidate service name is semantically and syntactically interchangeable with the received service name such that the candidate service name identifies the service description associated with the received service name within the service registry program product. The service description is discovered to be associated with the candidate service name within the service registry program product and is subsequently returned to the user.

Abstract: In production applications that process and transfer secure and sensitive customer data, the heap dump files of these applications, which may be useful for debugging production issues and bugs, may contain secure and sensitive information. Thus, to make the useful debugging information available in heap dumps from production applications without compromising secure client data to those assigned to debugging and fixing production issues, these heap dumps may be scrubbed of sensitive information without scrubbing information that is useful for debugging.

Abstract: In one embodiment, a method comprises receiving, by a website server device providing a website service, a request from an identified user of a user device, the request requesting network content provided within the website service; determining by the website server device an absence of new network content within the website service relative to a last prior access by the identified user to the website service; and obtaining, by the website server device for presentation to the identified user within the website service, an ordered list of network items most likely to be preferred by the identified user.

Abstract: System and method for suffix tree creation for large input data/text streams. The methodology leverages the structure of suffix trees to build a suffix tree by simultaneously tiling accesses to both the input string as well as the partially constructed suffix tree. The end result enables the indexing of very large input strings and at the same time maintain a bounded working set size and a fixed memory footprint. The method is employed for serial processing. Further, a scalable parallel suffix tree construction is realized that is suitable for implementation on parallel distributed memory systems that use effective collective communication and in-network caching. The methodology is also applied for suffix link recovery in both serial and parallel implementations.

Abstract: A data processing device (1) is installed in a data processing server (2) adapted to receive primary data and to transmit said primary data after application by control means (5) of dedicated processing based on primary rules. The device comprises, firstly, a first table (T1) in which are stored sets of at least one primary rule, called “primary metarules”, in a parameterizable form, in corresponding relationship to primary identifiers, and, secondly, management means (8) intended to be coupled to the control means (5) and adapted, on receipt of auxiliary data representing operating parameters delivered by the control means (5) after the reception by the server (2) of secondary data, to select at least one of the primary identifiers in the first table (T1) and associate the auxiliary data therewith in such a manner as to define the dedicated processes.

Abstract: A pipelined search engine supports a tree of search keys therein that utilizes span prefix masks to assist in longest prefix match (LPM) detection when the tree is searched. Each of a plurality of the span prefix masks encodes a prefix length of a search key to which the span prefix mask is associated and a value of another search key in the tree that is a prefix match to the search key to which the span prefix mask is associated.

Abstract: A relationship-information storage unit stores relationships between configuration items. The configuration items belong to an information system and are stored in multiple databases. A first counting unit compares, across the databases, attribute values of one configuration item in each of the databases, thereby counting a matching-attribute-value count. A second counting unit identifies a configuration item having a relationship with the one configuration item, for which the first counting unit counts the matching-attribute-value count, by referring to the relationship-information storage unit. Then, the second counting unit compares, across the databases, attribute values of the identified configuration items to count a matching-attribute-value count. A similarity calculation unit calculates similarity between the configuration items, based on the matching-attribute-value count counted by the first counting unit and the matching-attribute-value count counted by the second counting unit.

Abstract: Methods and software for automatedly answering dynamic queries requiring fusing of data from various ones of multiple available heterogeneous data sources. The data sources are characterized and interrelated using a suitable ontology. In one implementation, each dynamic query is analyzed to determine the data items required to answer that query, along with their levels of detail. The data items and levels of detail are used to determine which ones of the multiple data sources are needed to answer the query. The data items, levels of detail, and the ontology of the data sources are then used to automatedly develop a data-fusing plan for fusing data from the needed data sources in a manner that answers the query. The data-fusing plan is executed, and the query is answered.

Abstract: Systems, methods, and computer-readable code for processing queries for XML twigs using bottom-up processing include: receiving, by a computing device, a query XML twig including at least one sub-twig; determining whether an element in an XML tree is a root element of at least one sub-twig of the query XML twig, evaluating an arbitrary Boolean operation in the at least one sub-twig; populating a logic block if the element is a root element of the at least one sub-twig; inserting the element into an appropriate stack of a hierarchical stack if the element is not a root element of the at least one sub-twig; evaluating whether the element contributes to finding results of the query; discarding the element if the element does not contribute to finding results of the query; and determining whether the element is the root of the query XML twig.

Abstract: A bulk delete operation with reduced latency allows for retrieval of deleted data. Each database object holds a Delete SCN indicating when a bulk delete operation was last performed. Each row in the database object holds a Row Modification SCN indicating when the row was last updated. A bulk delete is performed by writing the old value of the Delete SCN to the undo tablespace and updating the Delete SCN. No undo information is stored for the rows. A write is performed by finding a deleted row, storing undo information for the deleted row and writing over the deleted row. To read from the database object, a rollback operation is performed, if necessary. Those rows are then retrieved for which the Row Modification SCN is higher than the Delete SCN and is less than or equal to the timestamp for the requested data.

Abstract: Systems and methods for determining underplayed or overplayed items are provided herein. Instructions stored in memory are executed by a processor to: calculate short term scores for radio data and music identification service data of the items, determine linear distance and logarithmic distance between radio virtual radio plays per days on one million stations (VRPDOMS) and identification VRPDOMS of the items, identify and eliminate items lacking minimum requisite number of radio VRPDOMS or identification VRPDOMS, and sort the items by largest linear distance or largest logarithmic distance first. The sorted items are then transmitted to the computing device.

Abstract: Methods and apparatus are described for scoring documents in response, in part, to parameters related to the document, source, and/or cluster score. Methods and apparatus are also described for scoring a cluster in response, in part, to parameters related to documents within the cluster and/or sources corresponding to the documents within the cluster. In one embodiment, the invention may detect at least one document within the cluster; analyze a parameter corresponding to the document; and compute a cluster score based, in part, on the parameter, wherein the cluster score corresponds with at least one document within the cluster.

Abstract: Methods and systems are described that involve determining the memory consumption of a specific application. The memory analysis identifies the dynamic memory objects controlled by a particular application and the memory objects controlled by the framework running that application. A structured view of the memory objects of the framework with respect to the individual framework architecture is presented in combination with the application specific memory object graph. A resulting display, in the form of a dominator tree, allows detecting dependencies of the application to the framework and shows which part of the framework is responsible for keeping alive which part of the application. Moreover, the resulting structure shows memory consumption of a single element of the application including bound memory and object memory. Further, a user can identify the references and the dependencies among the memory objects.

Abstract: The present principles provide systems and methods for displaying associations between data files and logical assets including the data files. Upon user-selection of a representation of a logical asset, a method in accordance with an aspect of the present principles includes determining associations between data files and the logical asset and displaying a listing of data files associated with the logical asset. Conversely, the method may also include presenting a listing of logical assets associated with a user-selected data file upon determination of logical assets associated with the data file. Moreover, another aspect of the present principles permits bi-directional navigation capability between a logical asset associations view and a physical asset associations view.

Abstract: One or more systems, devices, methods, and/or processes described can apply searches and/or filters to data of social networks with respect to one or more geographical locations, geospatial references, location-based contexts, and/or map-based references. One or more social networks can be queried with search and/or filter parameters and one or more geographic locations, and results received from the social network(s) can be based on the search and/or filter parameter(s) and the geographic location(s) and presented to a user on a map or other user interface. A size of a search region can be changed to a second size, and/or a position of the search region can be changed to a second position. One or more queries can be saved with their geospatial references and their search and/or filter parameter(s) (e.g. saved queries) can continue to run and/or execute over one or more periods of time transpiring to provide continual and/or periodic reporting.

Abstract: An Internet telephony registry 190 comprises a server 140 and an associated data store 160. Routing and/or policy data associated with telephone number strings are stored in the data store 160 in a tree data structure 240 and a data index map 230. The tree data structure 240 comprises parent nodes and leaf nodes and each parent node of the tree data structure 240 has ten child nodes. The tree data structure 240 stores an index associated with each telephone number string and the data index map stores routing and/or policy attributes 233 represented by the indices 232.

Abstract: A feature section including a feature of a candidate region but not including a feature of a related large region is set as for a style type different in feature from the related large region among a plurality of style types, with respect to each index candidate region. At least one or both of the large regions and the candidate regions having the feature included in the set feature section are grouped. An index evaluation degree is calculated, based on the grouped result, with respect to each candidate region. It is determined whether or not a logical element of each candidate region is an index, based on the calculated index evaluation degree.

Abstract: A system and method for modeling and optimizing the effectiveness of search engine optimization (“SEO”) initiatives and search engine marketing (“SEA”) campaigns is described. Several embodiments include methods and systems for classifying each of a plurality of websites using at least one of a plurality of classifications. Data associated with the plurality of websites is then acquired. The acquired data is then analyzed to achieve a result which may be used to model or optimize the effectiveness of the SEO initiatives and SEA campaigns.

Abstract: A solution for managing data in which historical execution information for a process is used to determine a set of data requirements for the process. The set of data requirements is then used to move data for the process from a slower storage device (e.g., a magnetic tape) to a faster storage device (e.g., a hard drive) before the process requests the data object (e.g., prefetch). In this manner, the prefetched data can be provided when requested by the process without delaying its execution while the data is moved from the slower storage device to the faster storage device.

Abstract: Systems and methods for webpage grouping based on URLS include receiving a uniform resource locator item; receiving a plurality of flow paths from a database, each flow path representing a path of web page visits by a user, each flow path comprising the uniform resource locator item, each flow path further comprising at least one other uniform resource locator item having a uniform resource locator prefix; defining a node for display based on the uniform resource locator prefix common to the plurality of flow paths; and generating display data comprising a representation of the uniform resource locator item and a representation of the defined node.