Abstract: The invention provides apparatus, platforms and methods according to the invention provide a surveillance, monitoring and real-time events platform to (i) enable the integration and communication of information between government agencies and organizations specifically tasked with ensuring the security and safety of our nation and its communities, (ii) to integrate information systems from federal, state and/or local agencies (from disparate data sources if necessary) in order to obtain a single, real-time view of the entire organization, and (iii) to extract more complete, actionable information from their existing systems, thereby dramatically improving decision making speed and accuracy.

Abstract: Methods and systems are provided for determining whether to use a full sort sorting technique or a merge sort sorting technique to sort a partially sorted list or data set. One or more tables may be utilized to allow such a determination to be made with regard to a first partially sorted list based on parameters associated with the list including a data distribution type, a number of data items in the list, and a ratio of sorted items to unsorted items in the list.

Abstract: A method for optimizing data transfer through parallelized interlacing of data based upon sorted characteristics to minimize latencies inherent in the system. Operating a plurality of threads in parallel on disparate file sizes ordered by an additional thread. Efficient backup of heterogeneous non-volatile mass store to a network attached server. Scalable distribution of backup processes for computing hashes and eliminating duplication. Increased granularity of file pieces to match blocking of file I/O with network transmission. Efficiently packing each network transmission block using sequence search criteria. Avoidance of sending undesired pieces. Segmentation of each file and object into a hierarchy of pieces in a plurality of types.

Abstract: A database engine and optimizer framework support creation of a series of profiling indices over a column having character string data, such as a traditional “varchar” data type. The profiling indices result in a reduction of the number of records that are searched when searching for a sub-string match within that column. In some embodiments, the series of indices are created over a column that is typically searched using the LIKE predicate or some similar technique; these indices indicate for each record whether certain sub-strings may exist in that record's value in the column. Thus, the indices are used to find the rows that may match one or more portions of the particular term being queried or, in other words, eliminate those records that do not have at least a portion of the term to be matched. The number of records actually retrieved and searched for the query sub-string is thereby reduced.

Abstract: Many computing scenarios involve an item cache or index, comprising items corresponding to source items that may change without notice, rendering the item in the item cache or index stale. It may not be possible to guarantee the freshness of the items, but it may be desirable to reduce staleness in an efficient manner. Therefore, the refreshing of items may be prioritized by first predicting the query frequency of respective item representing the rate at which an item is retrieved from the item cache (e.g., by monitoring queries for the item), predicting an update frequency representing the rate at which the source item is updated by the source item host (e.g., by classifying the source item type), and computing a refresh utility representing the improvement in cache freshness achieved by refreshing the item. Respective items may then be prioritized for refreshing according to the computed refresh utilities.

Abstract: Media recommendation techniques are described. In an implementation, a similarity value is calculated for a plurality of media using a plurality of similarity functions. A vote is assigned for each similarity value that is above a threshold that is assigned for a respective similarity function and the plurality of media is ranked based at least in part on the assigned votes. A playlist is then created based at least in part on the ranking. Media seed techniques are also described. In an implementation, a set of dissimilar candidates are calculated for a plurality of media using a similarity function in which the set of dissimilar candidates describes the media that is dissimilar in comparison with other media included in the plurality of media. A seed is selected using the set of the dissimilar candidates to create a playlist that includes at least some of the plurality of media.

Abstract: Content signal recognition is based on a multi-axis filtering of the content signal. The signatures are calculated, formed into data structures and organized in a database for quick searching and matching operations used in content recognition. For content recognition, signals are sampled and transformed into signatures using the multi axis filter. The database is searched to recognize the signals as part of a content item in the database. Using the content identification, content metadata is retrieved and provided for a variety of applications. In one application, the metadata is provided in response to a content identification request.

Abstract: An approach is provided for automatic geo-location and social group indexing thereby search geo-locations. A geo-location search learning platform receives a query specifying words, and retrieves context information of a user based upon a criterion. The geo-location search learning platform then assigns to the user a social group identifier identifying a social group based on the context information, retrieves one or more social group indexes based upon the social group identifier, retrieves one or more geo-location indexes based upon the one or more social group indexes, and generates a search result using, in response to the query, the one or more geo-location indexes and the words.

Abstract: A filter range based search control to request a range of data from one or more directory servers. A directory server receives a search request from a client application comprising a search filter control defining a set of requested data, a sort control defining a sorting order of the set of requested data, and a range filter control defining a range of entries in the requested data. Data entries matching a search value defined in the search filter control and sorted according to sort attributes defined in the sort control are obtained from a set of directories associated with the directory server to form a sorted list of matching entries. A subset of data entries in the sorted list that match a range value defined in the range filter control are collected, and a response comprising the collected subset of data entries is then sent to the client application.

Abstract: A knowledge management system and method is described. The knowledge management system and method comprises the steps of receiving a user search term from a user, searching an index for at least one identifier of an expert based upon the user search term, ranking the at least one identifier by an activity factor and a reputation factor, compiling a search result based on the ranking and transmitting the search result to the user.

Abstract: A query may be applied against search engines that respectively return a set of search results relating to various items discovered in the searched data sets. However, presenting numerous and varied search results may be difficult on mobile devices with small displays and limited computational resources. Instead, search results may be associated with search domains representing various information types (e.g., contacts, public figures, places, projects, movies, music, and books) and presented by grouping search results with associated query domains, e.g., in a tabbed user interface. The query may be received through an input device associated with a particular input domain, and may be transitioned to the query domain of a particular search engine (e.g., by recognizing phonemes of a voice query using an acoustic model; matching phonemes with query terms according to a pronunciation model; and generating a recognition result according to a vocabulary of an n-gram language model.

Abstract: An approach is provided for automatic geo-location search learning. A geo-location search learning platform receives a query specifying words, and initiates a point-of-interest search on the query, an address search on the query, and a partial search on some of the words. The geo-location search learning platform then combines results of the point-of-interest search, the address search, and the partial search, determines context information for a user; and sorts the combined results based on the context information thereby recommending the researched results to the user in a priority list as sorted.

Abstract: Systems, methods and articles of manufacture are disclosed for detecting a duplicate document. A plurality of documents may be assigned to categories, each category corresponding to a collection of duplicates, or near duplicate documents. A new document may be received. The new document may be evaluated against each category to determine a similarity score between the new document and each category. The new document may be identified as a duplicate based on the similarity scores and thresholds for each category. An action may then be performed on the duplicate based on duplication rules. The thresholds and duplication rules may be customized by a user.

Abstract: A method and system for determining an order of presentation of the search results is provided. An example system comprises a search request detector, a search engine, and an intermingler. The search request detector may be configured to receive a search request, and the search engine may be configured to determine search results based on the search request. The search results may comprise a first set of items in a first format and a second set of items in a second format. The number of items in the first set and the number of items in the second may reflect a predetermined target ratio and respective exposure percentages for items in the first format and items in the second format. The intermingler may be configured to determine an order of presentation of the search results in a list of search results based on the target ratio.

Abstract: The invention relates to a computer system comprising: a database having a database table for storing records comprising data values, the database table having first columns for storing the data values, each one of the first columns being assigned to a data field of a set of predefined data fields, and at least one second column for storing keys, each key identifying one of the records stored in the database, and a set of index tables, each index table being assigned to one of the data fields and having assigned thereto an index table identifier, means for receiving a query, the query specifying the subset of the set of data fields and a search range for each specified data field, means for storing a predefined ordered sequence of index table identifiers, means for processing the query by checking each one of the index tables for being relevant for the execution of the query, one of the index tables being relevant if the one of the index tables is assigned to one of the specified data fields, storing the inde

Abstract: A trusted relabeler system and software is provided that allows for the simultaneous reclassification of multiple files to multiple classification labels (security domains or computer networks) through automation of the multi-person review process. Roles, used to break down the requirements of the multi-person review process, dictate what specific function a user can perform. There are three roles used: Submitter, Processor, and Reviewer. Users are assigned one or more roles and a set of source and destination classification labels inside the security policy of a specific user that are bounded (restricted) by the clearance (maximum classification) assigned to a user on the trusted operating system on which the trusted relabeler system is implemented. The bundled documents to be reclassified are virus scanned, file typed, and searched for “dirty words” indicative of a particular classification level. Files are upgraded or downgraded only if all processes are completed successfully.

Abstract: Data cache systems are provided that can be implemented on a backend server side, are session independent, support caching of large amounts of data while passing only the required amount of requested data through a network, and support pagination of data in an efficient manner. A backend data cache system may include a special database schema for caching data in a database server, a middleware program for providing application program interfaces to application programs making cache requests, and a cache maintenance program for maintaining cached data sets stored within the database server. Each cache request can be stored as a type of temporary table that is assigned a unique identifier, which can be used during different sessions and/or by different application programs to access cached data sets.

Abstract: To realize a high speed merge sort method by applying a coupled node tree, which method extracts a smallest or largest key from a plurality of sorted key storage areas in each of which is stored keys comprised of bit strings that are sorted, and generates a coupled node tree for merge while adding a processing source identifier that identifies the sorted storage area wherefrom the key has been extracted, and repeats the actions of writing out into the merged key storage area a key being obtained by a minimum or maximum value search on the coupled node tree and deleting the key, and inserting into the coupled node tree a key by extracting the key from one of the plurality of sorted key storage areas.

Abstract: A document retrieval system performing retrieval of electronic documents includes, a document database storing a plurality of pieces of document data, a transposed index storage device storing a transposed index in which the document numbers of the document data containing a keyword string are registered, a document number subsequence search start address table storage device storing a document number subsequence search start address indicating a position where an assigned document group start document number is recorded, a document retrieval managing unit having document number subsequence acquisition request means for transmitting the total number of documents, and a plurality of the document number subsequence acquisition apparatuses having assigned document group determination means for determining a document group in a sequence in accordance with the preset apparatus number of a local apparatus as the assigned document group.

Abstract: An apparatus and method for efficiently performing a query sort on a data set with duplicate key values is disclosed. The method includes identifying unique key values for a key in a data set after determining that a number of duplicate key values for the key exceed a predefined threshold. The method also includes recording an association of each unique key value with a record in the data set and sorting unique key values. The method further includes storing the unique key values in a sorted order, wherein each unique key value is associated with an appropriate record in the data set.

Abstract: A data presentation device with a memory storage area being used without any futility is disclosed.

Abstract: A method for deinterleaving a sequence of interleaved data stored in a set of memory locations from a first order to a second order in-place of a memory with linear time. Two data items are withdrawn from the center of the sequence, creating a hole therein. Destination positions for said withdrawn data items are determined. It is determined whether the destination positions contain any data items. If so, the data items of said destination positions are replaced with the withdrawn data items, and second destination positions are determined for the data items withdrawn from the first destination positions. Otherwise, the first data items are inserted at the destination positions directly. If a data item is inserted at the hole of the sequence before the sequence is properly deinterleaved, an incorrect positioned data item is determined and repositioned. The repositioning sequence is repeated until all data items are correctly positioned.

Abstract: The present invention is a multiple-column index comprised of at least three columns. The columns are repetitious loops of identical content displayed over several pages wherein the relationship between the columns would be consistent. At least two columns have listings in the order of “A” to “Z” beginning at different points of the alphabet. At least one column has listings in “Z” to “A” order. If a search-result is organized on numerous pages, the invention would maximize the potential for discoverability for businesses listed beyond the first page.

Abstract: Tools and techniques for indexing and querying data stores using concatenated terms are provided. These tools may receive input queries that include at least two query terms. The query terms are correlated respectively with fields contained within records within a data store, with these fields being populated with respective field values. The query terms are arranged according to an indexing priority according to which the fields are ranked within an indexing table, which is associated with the data store. The tools then concatenate the query terms as arranged according to the indexing priority.

Abstract: Methods, systems and computer program products for synthesizing diagnoses stored in healthcare databases are provided. A diagnosis query associated with a single patient or a group of patients is received. Query results are provided responsive to the diagnosis query. The query results may include diagnoses from multiple sources that are expressed in multiple standards formats.

Abstract: Disclosed is a community search system and method through a network. When a search word is provided by a user through the network, communities with information corresponding to the search word are searched. Reliabilities of the searched communities are estimated. The searched communities can be sequentially arranged according to the estimated reliabilities, or communities having reliability greater than a predetermine value can be selected and provided to the user. According to some embodiments of the present invention, communities that provide reliable contents are searched on the network, and are provided to the user.

Abstract: A system and method for defining a segment for filtering website visitation data is disclosed. The method allows for creation and editing of a segment using various rules. The rules are defined using events and containers, which act as criteria by which the data is filtered. The system displays the segments and allows the user to apply them to stored data.

Abstract: Improved capabilities for positioning content on a mobile communication facility, based in part on the likelihood of interaction with the content, are disclosed for mobile communications facilities, such as cell phones. These and other capabilities are employed to improve the likelihood of user interaction with content presented to a mobile communication facility, such as positioning content to appropriate or desirable mobile communication facilities.

Abstract: A method and interface for managing indices of ordered elements are provided. A subset of elements are selected from an index of ordered elements and displayed on a user interface device. A user can manipulate the display of different subsets of the ordered elements via a user input device. Additional indicia corresponding to the subset of index elements are also displayed on the interface. The additional indicia can include a reference to a visual indicator of index display depth and/or a reference to the location of the displayed elements within the index.

Abstract: A method of sorting text for memory efficient searching is disclosed. A FM-index is created on received text, and a number of rows are marked. The locations of the marked rows are stored in data buckets as well as the last column of the FM-index, which is stored as a wavelet tree. Data blocks containing the data buckets are created; containing the number of times each character appears in the data block before each data bucket. A header block is created comprising an array of the number of times each character appears in the last column of the FM-index before each data blocks, the location of the end of the data blocks and the location of the end of the data, and appended to the data block. The header and data blocks are stored. The search process loads data buckets into memory as needed to find the required text.

Abstract: The present invention is directed to systems and methods for identifying compatible advertisement contracts to satisfy an advertisement opportunity. The systems and methods include receiving a number of attribute values associated with a user accessing a network-based location. The systems and methods include sorting an index of lists for a plurality of advertisement contracts on the basis of a number of contract term values. The systems and methods include traversing the index of lists to return a set advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include selecting a given advertisement contract from the set of advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include presenting an advertisement associated with the given advertisement contract on a display viewable by the user accessing the network-based location.

Abstract: The TABLE function mechanism available in a RDBMS is used to integrate RDF models into SQL queries. The table function invocation takes parameters including an RDF pattern, an RDF model, and an RDF rule base and returns result rows to the SQL query that contain RDF triples resulting from the application of the pattern to the triples of the model and the triples inferred by applying the rule base to the model. The RDBMS includes relational representations of the triples and the rules. Optimizations include indexes and materialized views of the representations of the triples, precomputed inferred triples, and a method associated with the TABLE function that rewrites the part of the SQL query that contains the TABLE function invocation as an equivalent SQL string. The latter technique is generally applicable to TABLE functions.