Abstract: A computer-implemented system for updating a counter value in a data structure. The system may include a memory storing instructions and at least one processor configured to execute the instructions to perform a process. The process may include receiving information relating to an event, and determining, for the event, a counter identifier value for the counter identifier field of the data structure. The data structure may include one or more entries. Each of the one or more entries may include the counter identifier field and a counter value field. The process may also include identifying, in the data structure, an entry that comprises a counter identifier value identical to the determined counter identifier value. The process may further include increasing a counter value in the counter value field of the identified entry.

Abstract: A request to access one or more files associated with a particular pint in time that are archived at a cloud storage is received. A file system metadata tree data structure based on metadata associated with the one or more requested files that is obtained from the cloud storage is partially restored at a storage system. The partially restored file system metadata tree data structure includes one or more stub nodes associated with one or more non-requested files. Access to the one or more requested files is provided using the partially restored file system metadata tree data structure. Metadata associated with the one or more non-requested files is prefetch from the cloud storage. A portion of the file system metadata tree data structure corresponding to the one or more non-requested files is restored in part by replacing the one or more stub nodes associated with the one or more non-requested files with metadata corresponding to the one or more non-requested files.

Abstract: Techniques are provided for caching data during an on-demand restore using a cloud block map. A client may be provided with access to an on-demand volume during a restore process that copies backup data from a snapshot within a remote object store to the on-demand volume stored within local storage. In response to receiving a request from the client for a block of the backup data not yet restored from the snapshot to the on-demand volume, the block may be retrieved from the snapshot in the remote object store. The block may be cached within a cloud block map stored within the local storage as a cached block. The client may be provided with access to the cached block.

Abstract: Systems and methods are disclosed for supporting transformations of a graph generated from a query to event data. The event data may be unstructured event data, from which instances of a journey can be identified that represent sequences of related events describing actions performed in a computing environment. When evaluating journey instances, it can be helpful to visualize the instances as a graph. Depending on the instances viewed, a user may desire different modifications to the graph. While such modifications can be made when initially building instances from the unstructured event data, this can limit reuse of the resulting instances (since the modification would also be present when evaluating other subsets). To address this, embodiments of the present disclosure enable graph modifications to be applied to subsets of journey instances after building those instances from unstructured event data, increasing reuse of instances built from a query against the unstructured data.

Abstract: Systems and methods are disclosed for supporting transformations of a graph generated from a query to event data. The event data may be unstructured event data, from which instances of a journey can be identified that represent sequences of related events describing actions performed in a computing environment. When evaluating journey instances, it can be helpful to visualize the instances as a graph. Depending on the instances viewed, a user may desire different modifications to the graph. While such modifications can be made when initially building instances from the unstructured event data, this can limit reuse of the resulting instances (since the modification would also be present when evaluating other subsets). To address this, embodiments of the present disclosure enable graph modifications to be applied to subsets of journey instances after building those instances from unstructured event data, increasing reuse of instances built from a query against the unstructured data.

Abstract: Methods and apparatuses for search and content creation. A partial input is received via a user interface of an electronic computing device. The partial input to be used for content creation. A search query is generated in response to receiving the partial input. A structured data repository is searched for objects matching the partial input. Results from the searching of the data repository are provided. Suggested content to be created from the displayed results is generated.

Abstract: The disclosed system and method acquire and store performance measurements relating to performance of a component in an information technology (IT) environment and log data produced by the IT environment, in association with corresponding time stamps. The disclosed system and method correlate at least one of the performance measurements with at least one of the portions of log data.

Abstract: Methods, apparatus, systems, and articles of manufacture are disclosed to improve media identification. An example apparatus includes a hash handler to generate a first set of reference matches by performing hash functions on a subset of media data associated with media to generate hashed media data based on a first bucket size, a candidate determiner to identify a second set of reference matches that include ones of the first set, the second set including ones having first quantities of hits that did not satisfy a threshold, determine second quantities of hits for ones of the second set by matching ones to the hash tables based on a second bucket size, and identify one or more candidate matches based on at least one of (1) ones of the first set or (2) ones of the second set, and a report generator to generate a report including a media identification.

Abstract: Techniques described herein perform implement a query using a synthetic time series (STS), for example applying an STS on time series data to obtain an answer to the query. In an embodiment, a method receives a times series and query relating to the time series, where the query specifies a condition. The method translates the condition into a synthetic time series and an operation on: the STS and the time series. The method executes the operation on the STS and the time series. The method then returns the result of the operation as an answer to the query. In some embodiments, the execution of the operation on the STS and the time series includes reducing the STS and time series without needing to grid.

Abstract: Disclosed are methods, systems, and non-transitory computer-readable medium for filtering vehicle information. For instance, the method may include receiving a vehicle search request from a user device, the vehicle search request including conditions with corresponding weights. The method may also include, in response to receiving the vehicle search request, forming a search query based on the conditions and the weights of the vehicle search request; obtaining vehicle information; filtering the vehicle information based on the search query to obtain a result set and a partial match set; and transmitting a search result message based on the result set and the partial match set to the user device.

Abstract: Implementations generally relate to processing similar documents. In some implementations, a method includes receiving a plurality of documents related to e-discovery. The method further includes determining a seed document from the plurality of documents. The method further includes receiving a search request to search at least one selection of text in the seed document. The method further includes identifying other documents from the plurality of documents based on a similarity between text in the other documents and the at least one selection of text in the seed document. The method further includes generating a graphical user interface that includes a similarity panel that provides similarity data between text in the other documents and the at least one selection of text in the seed document.

Abstract: Provided are a speech recognition training processing method and an apparatus including the same. The speech recognition training processing method includes acquiring a multi-talker mixed speech signal from a plurality of speakers, performing permutation invariant training (PIT) model training on the multi-talker mixed speech signal based on knowledge from a single-talker speech recognition model and updating a multi-talker speech recognition model based on a result of the PIT model training.

Abstract: Provided are a speech recognition training processing method and an apparatus including the same. The speech recognition training processing method includes acquiring a stream of speech data from one or more speakers, extracting an auxiliary feature corresponding to a speech characteristic of the one or more speaker and updating an acoustic model by performing permutation invariant training (PIT) model training based on the auxiliary feature.

Abstract: Embodiments are directed towards the visualization of machine data received from computing clusters. Embodiments may enable improved analysis of computing cluster performance, error detection, troubleshooting, error prediction, or the like. Individual cluster nodes may generate machine data that includes information and data regarding the operation and status of the cluster node. The machine data is received from each cluster node for indexing by one or more indexing applications. The indexed machine data including the complete data set may be stored in one or more index stores. A visualization application enables a user to select one or more analysis lenses that may be used to generate visualizations of the machine data. The visualization application employs the analysis lens to produce visualizations of the computing cluster machine data.

Abstract: Systems and methods generate a topic index for a conversational event and generate a content item based on the topic index. A processing device extracts a plurality of topics from a first content item corresponding to the conversational event, and generates the topic index for the conversational event. The topic index associates each of the plurality of topics with a content segment from the first content item. The method identifies a subset of one or more topics within the plurality of topics, and generates a second content item including a respective content segment of each of the one or more topics of the subset of one or more topics.

Abstract: The disclosed embodiments include techniques for exporting partial search results in parallel from peer indexers of a data intake and query system to the worker nodes. In particular, partial search results (e.g., time-indexed events) obtained from peer indexers can be exported in parallel from the peer indexers to worker nodes. Exporting the partial search results from the peer indexers in parallel can improve the rate at which the partial search results are transferred to the worker nodes for subsequent combination with partial search results of the external data systems. As such, the rate at which the search results of a search query can be obtained from the distributed data system can be improved by implementing parallel export techniques.

Abstract: The disclosed embodiments include techniques to obtain ordered search results based on partial search results from across multiple diverse internal and/or external data sources. The ordering of the search results may be with respect to a parameter associated with the partial search results. An example of a parameter includes time. As such, the disclosed technique can provide a time-ordered search result based on partial search results obtained from across multiple internal and/or external data sources. Moreover, the disclosed technique can provide time-ordered search results regardless of whether the partial search results obtained from the diverse data sources are timestamped.

Abstract: Systems and methods for overlaying video segments of actions of audience members with video segments of an event performer are described. A computer implemented method includes: identifying, by a computer device, an event performer in video content; identifying, by the computer device, an audience member in the video content that has a social network relationship to the event performer; correlating, by the computer device, an action of the event performer in the video content to an action of the audience member in the video content; and generating, by the computer device, a composite image comprising an image of the action of the event performer and an image of the action of the audience member.

Abstract: A distributed database of time stamped records can be used to store time series data such as events occurring on the Internet. A distributed database of time stamped records can store segments of data that contain events for different time intervals. The volume of events occurring on the Internet introduces a “Big Data” variable that makes collections of data sets so large and complex they are difficult to manage. Disclosed are systems and methods to manage segments of a distributed database of time stamped records for optimal size (for storage and performance reasons etc.) and for proper visibility to data when different segments contain data for overlapping time periods.

Abstract: A logging unit is used to log entries for events in a computer system. Each entry includes an n-bit timestamp field and a payload. The payload includes information about the event and the timestamp field includes the n least significant bits of an N-bit timestamp for the event, where N>n. If the n least significant bits of the timestamp have wrapped compared to the corresponding n bits of the timestamp of the preceding entry then a timing entry is logged which includes other bits of the timestamp. Therefore, an N-bit timestamp can be determined for an event, but only the n least significant bits of the timestamp are stored in the timestamp field of an entry for the event. Therefore, the time flow of events in the store is better maintained (by having a larger timestamp) without increasing the number of bits (n) in the timestamp field of each entry.

Abstract: Systems and methods are described for automated in-play detection and edited video generation. For example, a received game footage file can be sampled to generate video frames, each with an associated frame time. A play clock dataset can be generated automatically by processing the video frames to visually identify a subset of the video frames as each including a displayed play clock. The play clock dataset can be used to generate play windows, such that each play window is associated with a respective sequence of the video frames over which a play time displayed by the play clock is changing. Techniques can be used to validate those play windows and/or to refine the start and stop times of those play windows. An in-play footage file can automatically be compiled by cutting the game footage file according to the start and stop times of the play windows.

Abstract: An initial segment set generation unit (120) generates an initial segment set (F) from training time-series data (S). An initial segment set sorting unit (130) sorts initial segments included in the initial segment set by the order of feature quantities. A sample segment set generation unit (140) generates a sample segment set (E) from the initial segment set. A sample segment set sorting unit (150) sorts sample segments included in the sample segment set by the order of the feature quantities. A search result distance calculation unit (160) calculates a search result distance (Z) for each of test segments by using the sample segment set.

Abstract: For each of a plurality of time intervals over which metric data is collected from periodic polling of a network of devices, a determination is made of whether metric data of the time interval satisfies a criterion for normal data values defined for a metric corresponding to the metric data. The metric data is marked as anomaly data, in response to determining that the metric data does not satisfy the criterion defined for the metric corresponding to the metric data of the time interval. The metric data is marked as normal data, in response to determining that the metric data satisfies the criterion defined for the metric corresponding to the metric data of the time interval. The metric data marked as normal data is stored in a first database, and the metric data marked as anomaly data and corresponding time intervals in a second database.

Abstract: A method for localizing for GPS denied environments is provided with a plurality of broadcasting transmitters and a software-defined radio (SDR). A pre-processing stage and a query phase is executed for localizing an unknown location. The results from the preprocessing stage are made available to the query stage. A simulated power spectrum is computed for a region of interest during the pre-processing phase via the plurality of broadcasting transmitters. A transmitter location, a radius of influence, and a power contour plot of each of the plurality of broadcasting transmitters are used for computing the simulated power spectrum. Next, a peak-finding process, a filtering process, and a localization process is executed during the query phase in order to identify the unknown location.

Abstract: A mobile device receives a shared access key corresponding to a work machine. An access code is generated from the shared access key, and from a changing value (such as a time-sensitive value). The access code is transmitted to the work machine which, itself, calculates an access code based on the shared access key and based on the changing value. If the access code provided to the work machine and the access code generated by the work machine match one another, then the work machine unlocks corresponding functionality so that the operator can use the work machine.

Abstract: A system, apparatus, and method for managing data storage and data access for semi-structured data systems.

Abstract: An event signal processing method and apparatus are provided. The event signal processing method includes receiving, from an event-based sensor, event signals including timestamps, generating a first timestamp map based on the timestamps, and interpolating a new timestamp into the first timestamp map based on at least two timestamps of the first timestamp map, to generate a second timestamp map.

Abstract: A log record from a host machine node includes terms. Frequency of occurrence of the terms across a stream of log records is determined. Based on the frequency satisfying a threshold, a Bloom filter vector is selected from among a plurality of Bloom filter vectors based on the frequency, the Bloom filter vector is updated based on the terms, and an identifier for the log record is stored with an association to the Bloom filter vector. In contrast, based on the frequency of occurrence not satisfying the defined frequency range, a type identifier is identified based on the terms, a Bloom filter vector is selected from among the plurality of Bloom filter vectors based on the type identifier, the Bloom filter vector is updated based on the terms, and an identifier for the log record is stored with an association to the Bloom filter vector.

Abstract: An index server may be configured to collect content associated with an entity, and process the content for indexing at a primary index queue. At least one portion of the content may be marked for exclusion from the primary index queue, and the marked content may be transferred to a secondary index queue to be processed for indexing. A comprehensive index may be stored based on the processing performed at the primary and secondary index queues such that the content associated with the entity is wholly represented by indexed content. If the secondary index queue is disabled, automatically or in response to a request from the entity, the content processed for indexing at the primary index queue may be stored in an index excluding the marked content. In some examples, the comprehensive index and/or the index with excluded marked content may be provided to a compliance server for analysis.

Abstract: According to one general aspect, a method may include receiving a data query request that includes one or more search parameters to be searched for within a plurality of files that are stored according to a hierarchical organizational structure, wherein each file includes at least one data record. The method may include scanning a plurality of files to determine if one or more files match a sub portion of the search parameters. The method may further include parsing the candidate files to determine which, if any, records included by the respective candidate files meet the search parameters. The method may include generating, by one or more result analyzers, query results from the resultant data. The method may also include streaming, to the user device, the query results as at least one query result becomes available and to start streaming before the query requests have been fully generated.

Abstract: Disclosed is a data processing apparatus which is connectable to a network. The data processing apparatus includes: a rule editor which edits, based on input editing information, a search rule for setting a search condition for searching for data generated according to time; a data searcher which searches for the data in accordance with the edited search rule; a visualizer which visualizes the search result; and an analysis sharing part which transmits additional analysis on an analysis of the search result to terminals of a first user and a second user through the network.

Abstract: Systems, methods and devices described herein enable acquiring, selecting and sharing content elements, extracted from media content playing on a first device, using one or more second devices. For example, while a video stream is playing on a first client device, a second client device acquires and sends content information derived from the video stream to a server system. The server system identifies the video stream, generates a set of instructions and extracts content elements associated with the media content. The content elements may include, without limitation, individually selectable portions of text, images, suggested ratings, video clips, audio clips, etc. In some implementations, the set of instructions includes instructions to display the one or more content items using non-intersecting overlay regions that enable each respective content element to be individually selectable.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing time series information with search results. In one aspect, a method includes determining that a first query is indicative of a request for time series information; generating a cost estimate that quantifies one or more costs of including the time series information with one or more search results, each search result including a resource locator that references a corresponding resource determined to be responsive to the query; generating a benefit estimate; determining to generate the time series information when the benefit estimate is greater than the cost estimate and generating the time series information in response to the determination, wherein generating the time series information includes collecting responsive time series information from one or more resources; and determining to not generate the time series information when the cost estimate is greater than the benefit estimate.

Abstract: Methods and apparatus consistent with the invention provide the ability to organize, index, search, and present time series data based on searches. Time series data are sequences of time stamped records occurring in one or more usually continuous streams, representing some type of activity. In one embodiment, time series data is organized into discrete events with normalized time stamps and the events are indexed by time and keyword. A search is received and relevant event information is retrieved based in whole or in part on the time indexing mechanism, keyword indexing mechanism, or statistical indices calculated at the time of the search.

Abstract: A computer-implemented data processing method comprises receiving information from a user computer concerning a desired output to be generated, adding the information concerning the desired output to be generated to a data structure, and adding additional information to the data structure concerning intermediate outputs to be generated. The information concerning the desired output to be generated is received at a host computer. The host computer is one of a plurality of host computers configured to collect and analyze data received from a plurality of source computers. The data structure represents a list of outputs to be generated by the plurality of host computers. The intermediate outputs are precursor inputs needed to generate the desired output. The additional information is added to the data structure based on the information received from the user computer and based on stored information.

Abstract: Systems and methods are provided for file searching on mobile devices. A system includes a user interface and a file query system. The user interface is for receiving a user-provided spatio-temporal query for use in searching for a particular file. The user-provided spatio-temporal query is provided by a user of a mobile device. The file query system is for determining information about the particular file responsive to the user-provided spatio-temporal query, and identifying from the information one or more files as a search result for the particular file.

Abstract: One or more techniques and/or systems are provided for indexing content based upon index features (e.g., temporal features, user engagement features, and/or outlier features), and/or for providing content within a search result interface based upon such index features and/or rankings. For example, user reaction data associated with content (e.g., a microblog message, a social network post, etc.) may be evaluated to generate a user engagement feature that may be constrained to a time window feature (e.g., the number of shares of a message within the first 10 minutes from publication of the message) to create an index feature for indexing the content within a content index. Responsive to the index feature corresponding to a search query, the content may be provided with search results for the search query. For example, the content may correspond to trending or breaking news associated with the search query.

Abstract: A first device may receive an instruction to add a first marker that identifies a first time index associated with particular content and a particular account used to access the particular content; receive an instruction to add a second marker that identifies a second time index associated with the particular content and the particular account; store the first marker and information associating the first marker with the first time index, the particular content, and the particular account; store the second marker and information associating the second marker with the second time index, the particular content, and the particular account; receive selection of the first marker or the second marker, associated with the particular content and the particular account; and cause a second device to play back the particular content at the first time index or the second time index.

Abstract: Methods and apparatus consistent with the invention provide the ability to organize, index, search, and present time series data based on searches. Time series data are sequences of time stamped records occurring in one or more usually continuous streams, representing some type of activity. In one embodiment, time series data is organized into discrete events with normalized time stamps and the events are indexed by time and keyword. A search is received and relevant event information is retrieved based in whole or in part on the time indexing mechanism, keyword indexing mechanism, or statistical indices calculated at the time of the search.

Abstract: An apparatus and method utilize partitioned database tables divided into data allocation containers (DACs) where data is placed into the DACs based on usage of the data in past queries. Records that are used most often are placed together and records that are used less often are placed together to improve database performance. In preferred embodiments, a database manager determines where to place data into the DACs based on how often the data is selected by a database query using a DAC selection ratio (DSR). The database manager may determine when to perform table maintenance to move rows of data to the appropriate DACs based on a timestamp or last check date (LCD) stored in the database.

Abstract: A method for receiving a data stream that includes data samples, each data sample having one of a plurality of actual values. For each data sample in the data stream, a first index in a dictionary is selected. The dictionary includes indices corresponding to each of the plurality of actual values. The first index corresponds to an actual value of the data sample. A predicted value of the data sample is generated in response to previously received data samples in the data stream and to a prediction algorithm. A second index in the dictionary that corresponds to an actual value in the dictionary that is closest to the value of the predicted value is selected. The difference between the first index and the second index is calculated and compressed. The compressed difference between the first index and the second index is then output. This process is performed for each data sample in the data stream.

Abstract: A method for providing chronologic information that is generated by placing one or more pieces of related information according to information about elapsed time is provided. The method includes the steps of obtaining, by an obtaining unit, (i) basic information associating pieces of the related information with the information about time indicating positions on the chronologic information and (ii) information indicating a display form of the chronologic information; and providing, by a control unit, the chronologic information to a user by displaying the chronologic information in a display unit based on the information indicating a display form of the chronologic information by using the basic information.

Abstract: A method selects events from an event log for presentation along a timeline. The method may receive information associated with the timeline to define an interval of interest and a partition size, and divide the timeline into a plurality of segments based on the partition size. The method may further identify each segment having at least one relevant event within the segment, where a relevant event is an event which starts within a segment and overlaps with the interval of interest. The method may determine parameters associated with at least one relevant event for each identified segment, and provide the determined parameters along with an index which designates each identified segment. The determined parameters may be provided to a client to generate the timeline of the at least one relevant event. An apparatus can implement the method to select events from an event log which are associated with a defined time interval.

Abstract: Disclosed are a method for providing a time machine service based on an SNS (social network service), including: extracting keywords based on SNS information input by SNS users and collecting rich contents relating to the SNS information based on the keywords; dividing points of past, present, and future, based on a predetermined present time period and classifying the rich contents into any one of past information, present information, and future information, based on the division result; and providing the classified rich contents to the SNS users.

Abstract: A system and method is presented that extracts snippets form web pages according to specially designed logic. The extracted snippets might be made relevant to, i.e., indexed by, a location and time/day applicability. Such snippets may be thought of as apps or services that are defined only when a mobile terminal is in a pre-defined geographical area at a certain time and day (e.g., as defined by a calendar of events). Extracted snippets are stored and made searchable. Methods and a system are described to control the display of snippet search results. Snippets may be selected by user or by programmed logic and executed on the mobile terminal or in remote servers without the need to download the app or source code associated with the snippet.

Abstract: A temporal database system, method, and computer-readable storage medium in which a database is provided with sets of entities defined by initial tuples having a set ID, a unique timestamp, and a member increment. A write transaction is performed for sets of entities, wherein the write transaction designates the set by said set ID and produces an increment, wherein the increment is a number of entities to be added to or removed from the designated respective set of entities. New tuples including the set ID, the increment, and a new unique timestamp are created for the write transaction. Following the write transaction, an asynchronous compaction operation is performed on the new tuples. The compaction operation aggregates the increment of each new tuple into summary point counts. The compaction operation facilitates efficient queries without contention with write transactions.

Abstract: In one embodiment, a method of identifying the presence of matching information items in a network includes using a hashing scheme to generate a set of first hash values from a respective set of first information items stored at a first node and transmitting the set of first hash values over the network to a second node. The set of first hash values is compared at the second node with a set of second hash values generated, using the hashing scheme, from a respective set of second information items stored in the network, to thereby determine at least one matching hash value between the set of first hash values and the set of second hash values. The determined matching hash value is used to identify the presence of at least one matching information item between the set of first information items and the set of second information items.

Abstract: Methods and Apparatus, including computer program products, for maintaining indexes in a database management system. The database management system includes a table having table entries and an index data structure having index data structure entries, the index data structure relating to the table. The index data structure is updated synchronously with an insertion of table entries. The index data structure is maintained unchanged when the table entries are deleted. It is verified by an index-scan on the index data structure that a valid criterion is fulfilled for index data structure entries, and those index data structure entries that pass the valid criterion from the index-scan are returned.

Abstract: Hierarchical temporal event management enables reduction or elimination of synchronization of multiple potentially huge indexes for real-time log indexing. Logs are time series data of events having associated times. Raw events are indexed in a hierarchical index. Transformed, filtered, or aggregated events are indexed in the hierarchical index at a different level of the hierarchy than the raw events. The result is a single hierarchical index that supports queries that optionally cross “level boundaries”, enabling a search on both aggregated information and specific elements. Such searches are usable when generating “drill down” data for graphs and reports. Search requests having corresponding search specifications are received from requestors. In response, a hierarchical event store is searched and results are provided to the requestors.

Abstract: A matching apparatus sets windows within match data, the windows each having a width larger than that in a window width condition defined in a query, and further sets windows each satisfying an event condition of a window defined in the query as temporary windows. Further, the matching apparatus checks sets of temporary windows against an interval condition and outputs events included in one or more sets of temporary windows each satisfying the interval condition, as a matching result.