Abstract: Embodiments are directed towards real time display of event records and extracted values based on at least one extraction rule, such as a regular expression. A user interface may be employed to enable a user to have an extraction rule automatically generate and/or to manually enter an extraction rule. The user may be enabled to manually edit a previously provided extraction rule, which may result in real time display of updated extracted values. The extraction rule may be utilized to extract values from each of a plurality of records, including event records of unstructured machine data. Statistics may be determined for each unique extracted value, and may be displayed to the user in real time. The user interface may also enable the user to select at least one unique extracted value to display those event records that include an extracted value that matches the selected value.

Abstract: This invention relates to a system, method and computer program product for parsing a message against a message model, the message model including a choice block of element options and guide field for guiding the parse, the method including: parsing a message against a message model until the choice block of element options and associated guide field is located in the message model; determining element options associated with a particular guide field value located in the message, each element option having an associated frequency of occurring within a body of messages; choosing the most frequently occurring element option for the located guide field value; and further parsing the choice block of element options against the chosen element option.

Abstract: A system and computer-implemented is provided for displaying a configurable metric relating to an environment in a graphical display along with a value of the metric calculated over a configurable time period. The metric is used to identify events of interest in the environment based on processing real time machine data from one or more sources. The configurable metric is selected and a corresponding value is calculated based on the events of interest over the configurable time period. The value of the metric may be continuously updated in real time based on receiving additional real-time machine data and displayed in a graphical interface as time progresses. Statistical trends in the value of the metric may also be determined over the configurable time period and displayed in the graphical interface as well as an indication if the value of the metric exceeds a configurable threshold value.

Abstract: Co-authoring of a digital content file using content contributed by peer devices in a peer-to-peer communications network is described. A local copy of the digital content file is stored in each of plural peer communications devices disposed in a multi-node communications network. The contents of the local copies of the digital content file stored in at least two peer communications devices are compared and in an event the local copies of the digital content file stored in a peer communications device is missing content that is contained in the other compared peer communications devices, the missing content is merged into the local copy of the digital content file stored in the peer communications device.

Abstract: The present invention relates generally to a system and method for reviewing and evaluating performance. In particular, the present invention relates to a system, method, and computer program produce for reviewing and evaluating performances of an official or group of officials at an event or events. Even more specifically, according to embodiments of the present invention, the system and method can involve reviewing and evaluating an official or group of official's performance during a sporting event or events, such as a football game or games or a basketball game or games.

Abstract: A system may include presentation of one or more measure values, each of the one or more measure values corresponding to a member of each of one or more dimension, reception of a first instruction to copy one of the one or more measure values, storage, in response to the first instruction, of the one measure value and a corresponding member of each of one or more dimensions, reception of a second instruction to paste the stored one measure value to a local application, and, in response to the second instruction, writing of the stored one measure value and corresponding member of each of one or more dimensions to the local application.

Abstract: In an embodiment, an approach is provided that retrieves a source image metadata from a persistent storage media, where the source image metadata corresponds to a source image associated with a source platform, compares the retrieved source image metadata to image metadata corresponding to available virtual images associated with a target platform, identifies, based on the comparison, one of the available image metadata that is most compatible to the source image metadata, and uses the available virtual image corresponding to the identified available image metadata as a target virtual image compatible with the target platform.

Abstract: A method for data mining on compressed data vectors by a certain metric being expressible as a function of the Euclidean distance is suggested. In a first step, for each compressed data vector, positions and values of such coefficients having the largest energy in the compressed data vector are stored. In a second step, for each compressed data vector, the coefficients having not the largest energy in the compressed data vector are discarded. In a third step, for each compressed data vector, a compression error is determined in dependence on the discarded coefficients in the compressed data vector. In a fourth step, at least one of an upper and a lower bound for the certain metric is retrieved in dependence on the stored positions and the stored values of the coefficients having the largest energy and the determined compression errors.

Abstract: Example implementations described herein include systems and methods for processing the deletion of a directory that can include one or more subdirectories. In a system including a server having a hardware-side and a software-side that manages one or more storage systems or storage devices, a client may request the deletion of a directory, whereupon the processing of the directory occurs in a work queue and subtree queue for processing subdirectories.

Abstract: A method and system for generating a master clinical database from disparate sources, including public databases, private databases, and data from users, correlating the received data, determining a degree of confidence in and requesting and seeking confirmation of any data matched from the correlated data. The invention may identify key time points and users from whom to seek and receive confirmation of correlated data. The invention may be utilized to create a cross-trial, cross-sponsor, clinical master database that maintains appropriate user, subject and data confidentiality and privacy and which may be utilized to facilitate study design collaboration.

Abstract: A system is provided that generates a list of most common items and respective item frequencies from a data set that includes a plurality of items. The system creates a first list of items from the data set and monitors an estimate count for each item in the first list, where the first list is sorted by the estimate count. The system further transfers items that exceed a threshold hit count from the first list to a second list. The system further monitors a hit count for the items in the second list, where the items in the second list are sorted by the hit count. The system further transfers the items that are displaced from the second list back to the first list.

Abstract: An application (“app”) may be associated with a web site, so that an online service may use the connection between the app and the web site. In one example, the online service is an information provider, such as a search engine or advertising engine. The online service provides a web administrator portal, through which a webmaster provides or generates a secret code. The webmaster gives the secret code to an app developer, who gives the code to an app store when the app is published. If the service provides information about the web site (e.g., as a search result or ad impression), the service may also provide an indication of the app, since the use of the code represents confirmation by both the webmaster and app developer that a relationship exists between the web site and the app.

Abstract: One or more embodiments relate to an object indexing method, object indexing device and object indexing system. An object indexing method may include an initializing step of dividing at least one first data container and at least one second data container, and initializing respectively the first and the second data containers by using a first data indexer and a second data indexer; a first indexing step of adding the input feature vector of a specific object into a first data container currently being filled by using the first data indexer; and a second indexing step, when the data size in the first data container being filled has reached a threshold, selecting another first data container as the first data container currently being filled, and in the case of executing the first indexing step, converting bulk data in the first data container previously being filled into one available second data container.

Abstract: Some embodiments of the present invention include a method for identifying unique and duplicate queries from a group of queries associated with a database system. The method includes forming, by a server computing system, two or more subgroups of queries from a group of queries based on a characteristic of the queries, the group of queries associated with a first database system; determining, by the server computing system, unique and duplicate queries in each of the subgroups based on a similarity threshold; and migrating, by the server computing system, the unique queries from each of the subgroups to a second database system.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for efficiently administering locks for shared resources, such as data blocks, stored on a storage system. Methods for stamping a plurality of computer data objects are disclosed which include: accessing at least one of the plurality of computer data objects by a first data thread; assigning, by the first data thread, a stamp to the at least one of the plurality of computer data objects, to signify the at least one of the plurality of computer data objects is associated with the first data thread; preventing subsequent access by a second data thread to the stamped at least one of the plurality of computer data objects; and determining the stamp is no longer active, upon an event, effectively releasing the at least one of the plurality of computer data objects.

Abstract: Systems and methods for providing concurrent access to a resource via multiple user identities via a single client entity. The client entity is allowed access to the resource utilizing a first user identity. An attempt to access the resource with the client entity utilizing a second user identity is detected. The second user identity is a child identity of the first user identity. The attempt to access the resource is restructured as an attempt to access the resource with a third user identity that is not a child identity of the first user identity. The restructured request is forwarded to the resource using the third user entity to access the resource. A response from the resource is restructured as a response to the client entity accessing the resource utilizing the second user identity. The restructured response is sent to the client entity accessing the resource utilizing the second user identity.

Abstract: Methods and apparatus are provided for tuning a garbage collection algorithm. The apparatus includes a request generator configured to generate a transaction request including parameters Ta, Te, and M, where Ta represents a transaction request inter-arrival time, Te represents a transaction request execution time, and M represents a transaction request memory allocation amount. The apparatus also includes a memory allocation module, an active request queue, and a garbage collection (GC) module. The memory allocation module is configured to admit the formatted transaction request to the queue if at least M heap memory is available, and to initiate a GC routine if M heap memory is not available.

Abstract: Enriching trajectory data from a device may include determining, using a processor, enrichment data items related to points of presence within trajectory data. The enrichment data items may be retrieved from a data source. Enriching trajectory data may also include determining, using the processor, ranking metrics for the enrichment data items and ranking, using the processor, the enrichment data items according to the ranking metrics. One or more ranked enrichment data items, in association with the related point of presence of the trajectory data, may be provided to a device using the processor.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices for integrating a hybrid model of fine-grained locking and data-partitioning wherein fine-grained locking is added to existing systems that are based on hierarchical data-partitioning in order in increase parallelism with minimal code re-write.

Abstract: Systems and methods for deriving and using an interaction profile are described. In one described method, a plurality of metrics indicating a level of satisfaction for search results is determined. The metrics comprise at least one of click-duration data, multiple-click data, and query-refinement data. The values of the metrics for a plurality of instances of an object, such as search results from a search engine, are determined. An interaction profile for the object, based at least in part on the values of the metrics for a plurality of instances of the first object, is then determined. This interaction profile may be used in a variety of ways, such as determining the quality of ranking algorithms and detecting undesirable search results.