Entries |
Document | Title | Date |
20100057809 | INFORMATION STORING/RETRIEVING METHOD AND DEVICE FOR STATE TRANSITION TABLE, AND PROGRAM - Information storing/retrieving method for a state transition table includes: in a state transition table wherein transition destinations are made to correspond to states and inputs, collecting inputs, which have same transition destination and whose values are contiguous, into one set to configure the inputs as sets; sorting the sets so that sets, which share the same transition destination, become adjacent; storing input lower- or upper-limit values and non-duplicate transition destination(s), included in sorted sets, into a memory in the sorted order to reduce information amount of the state transition table; when one state and one input are given, referencing memory to retrieve lower- or upper-limit value and a transition destination of a set(s) corresponding to the state and comparing the retrieved lower- or upper-limit value with the input value to identify a set, to which given input belongs, based on comparison; and retrieving a transition destination from the identified set for determining transition destination as a next state. | 03-04-2010 |
20100070513 | METHOD AND DEVICE FOR SORTING AND MANAGING LOOK-AND-FEEL CONTENTS - A method for sorting look-and-feel contents includes: obtaining a look-and-feel package which comprises attribute information of the look-and-feel package; and creating an appropriate storage object for the look-and-feel package and storing the look-and-feel package in association with the storage object. A method for managing look-and-feel contents includes: receiving a look-and-feel package management command which comprises attribute information of a look-and-feel package and type information of the management command; and performing an appropriate management operation on a storage object associated with the look-and-feel package according to the type information of the management command. A terminal includes a look-and-feel package obtaining unit, configured to obtain a look-and-feel package comprising attribute information of the look-and-feel package; and a sorting unit, configured to create an appropriate storage object for the look-and-feel package and store the look-and-feel package in association with the storage object. | 03-18-2010 |
20100082645 | SORTING RECORDS BASED ON FREE TEXT FIELD CONTENT - Disclosed are a method, system and computer program product for sorting records based on content in a free text field. A request is received by a sort function to sort a free text field. The sort function request is intercepted. The content in the free text field is analyzed. One or more new focus words are identified by the analysis. The new focus words are used to sort the free text field. The focus words in the free text field are highlighted and sorted alphabetically. Sorted free text field results based on the new focus words are displayed to a user on the user's display. | 04-01-2010 |
20100082646 | TRACKING CONSTRAINTS AND DEPENDENCIES ACROSS MAPPING LAYERS - Techniques for object relational mapping (ORM) are provided. A dependency graph generator receives a combination of object level custom commands and store level dynamic commands. Each store level dynamic command is generated from at least one object level dynamic command. An identifier is assigned to each entity present in the object level custom commands and the object level dynamic commands. A store level dynamic command includes any identifiers assigned in the corresponding object level dynamic command(s). The dependency graph generator is configured to generate a dependency graph that includes nodes and at least one edge coupled between a corresponding pair of nodes. Each node is associated with a corresponding store level dynamic command or an object level custom command. An edge is configured according to an identifier associated with the corresponding pair of nodes and a dependency between commands associated with the corresponding pair of nodes. | 04-01-2010 |
20100082647 | METHOD FOR CREATING IMAGE FILE AND METHOD FOR SORTING FILE SYSTEMS - A method for creating an image file and a method for sorting file systems are disclosed. First, a plurality of file systems is accessed respectively so as to create a plurality of access messages. Next, the access messages are sorted by using a sorting algorithm. Finally, the locations in an image file of the file systems are determined according to the orders arranged by the access messages so as to compress the file systems into the image file. | 04-01-2010 |
20100088323 | METHOD AND APPARATUS FOR VISUALIZATION OF INTERACTION CATEGORIZATION - A method and apparatus for visualization of call categorization, comprising steps and components for: defining or receiving a definition for one or more categories and criteria for each category; receiving or capturing interactions; categorizing the interactions into the categories; determining relations between the categories; determining layout for the categories and relations; and visualizing the layout. The method and apparatus can further comprise steps and components for extracting key-phrases, determining connections between key-phrases, connections between categories based on key-phrases, and connections between categories and key-phrases, and visualizing the categories, key-phrases and connections. The method and apparatus can further comprise steps and components for training models upon which the relations between categories and relations between key-phrases are determined. | 04-08-2010 |
20100094880 | MEDIA LIST MANAGEMENT - Systems, methods, and computer program products are provided for managing a playlist on a portable media device including generating a random order of media items based on a seed, receiving an instruction to power down the portable media device, saving the seed in a storage, and powering down the portable media device. | 04-15-2010 |
20100114915 | BOUNDED HASH TABLE SORTING IN A DYNAMIC PROGRAM PROFILING SYSTEM - A system and method for efficient bounded hash table sorting during dynamic whole program profiling of software applications. A computing system comprises a dynamic binary instrumentation (DBI) tool coupled to a virtual machine configured to translate and execute binary code of a software application. The binary code is augmented with instrumentation and analysis code during translation and execution. A dynamic binary analysis (DBA) tool identifies hierarchical layers of cycles within the application that describe the dynamic behavior of the application. Correpsonding characterization information is stored in a hash table. Periodic sorting of entries of the hash table occur for highly accessed entries in deep buckets within the hash table. Repositioning the entries within the hash table may reduce pointer chasing problems and identify program phase changes within the dynamic behavior of the application. | 05-06-2010 |
20100114916 | System and Method for Managing Web Search Information in Navigation Hierarchy - The current methods and system create a plurality of tree text history entries in the tree text history section within the context of the search terms by associating with a plurality of history data from a plurality of searches using a plurality of search terms in a hierarchical format and allow users to manage the plurality of tree text history entries created in the tree text history section. The plurality of tree text history entries created in the tree text history section include a title and optionally a search or sub-search term. The current methods and system allow managing history data comprising the steps of adding, filtering, modifying, deleting, sorting, pruning, prioritizing, importing, and/or exporting the tree text history entries created in the tree text history section depending on user preferences. | 05-06-2010 |
20100121861 | QUALITY MEASURE FOR A DATA CONTEXT SERVICE - The method for providing a data context service involves extracting context information from a host application associated with an oilfield project, the context information includes a current state of a user in the host application, sorting the context information into multiple dimensions of relevance, generating a search profile for each of the multiple dimensions of relevance, requesting a first set of searches using at least the search profile, receiving oilfield data items resulting from the first set of searches, obtaining a quality measure of an oilfield data item of the oilfield data items based on a pre-determined quality criterion, sending the oilfield data item as a search result to the host application after determining the quality measure exceeds a pre-determined threshold, and generating an output using the host application based on the search result, the output being used to perform an oilfield operation. | 05-13-2010 |
20100125587 | ELECTRONIC FILE MANAGEMENT SYSTEM - An electronic file management system includes a terminal device and a management server. The terminal device includes a terminal storage, a data transmitter, and a first data delete unit. The terminal storage stores an electronic file. The data transmitter transmits the electronic file stored in the terminal storage. The first data delete unit deletes the electronic file stored in the terminal storage. The management server is communicably connected to the terminal device. The management server includes a data receiver and a data storage. The data receiver receives the electronic file from the terminal device. The data storage stores the electronic file received from the terminal device. The first data delete unit deletes the electronic file stored in the terminal storage after the data transmitter has transmitted the electronic file stored in the terminal storage to the management server. | 05-20-2010 |
20100131517 | System and method for ranking and grouping results of code searches - A method of sorting search results associated with a function search performed on a source code repository comprises receiving the search results, wherein each search result is either a function definition or a function usage, grouping the search results into groups according to a grouping function, ranking the groups according to a ranking function, and displaying the grouped and ranked search results. | 05-27-2010 |
20100131518 | Database Obfuscation System and Method - A system and method for obfuscating a database's schema while preserving its functionality by modifying the original table names, column names, table order, column order, and/or data character set such that the standard order of the original characters is maintained. | 05-27-2010 |
20100138429 | Method for building a file information table - A method for building a file information table is applied to an optical disk. The optical disk is stored with a plurality of directors and a path table. The method for building the file information table includes the following steps. Firstly, the path table is stored in a memory module. The logical block address of each of the directors is found from the path table in the memory module. The director information in the logical block address of each of the directors in the optical disk is read. Finally, the file information for each file of all directors is recorded to build the file information table in the memory module. | 06-03-2010 |
20100169329 | SYSTEM FOR SIMILAR DOCUMENT DETECTION - A document is compared to the documents in a document collection using a hash algorithm and collection statistics to detect if the document is similar to any of the documents in the document collection. | 07-01-2010 |
20100185627 | SORTING METHOD OF MULTIMEDIA FILES - A sorting method of multimedia files is disclosed. The method uses EXIF information parameters, image characteristic parameters and file property parameters to automatically sort massive multimedia files. In addition, a sorting mark containing a sorting name, a filename, a date parameter and a file location is displayed on the browsing frame, which is beneficial for a user to conveniently manage and browse the massive multimedia files. | 07-22-2010 |
20100185628 | METHOD AND APPARATUS FOR AUTOMATICALLY GENERATING SUMMARIES OF A MULTIMEDIA FILE - A plurality of summaries of a multimedia file are automatically generated. A first summary of a multimedia file is generated (step | 07-22-2010 |
20100191749 | METHOD FOR PERFORMING AN EXTERNAL (DISK-BASED) SORT OF A LARGE DATA FILE WHICH TAKES ADVANTAGE OF "PRESORTED" DATA ALREADY PRESENT IN THE INPUT - A method of externally sorting large files in a computer system is presented. The contents of the input file to be sorted are investigated in order to identify presorted portions thereof. The presorted portions of the input file as thus identified are incorporated as sorted strings into an external sortwork file, by rearranging directory information rather than physically transferring data. If merging is necessary, the data may then be merged by a procedure wherein blocks of sorted data to be merged are incorporated into an output (sortout) file, by rearranging directory information rather than physically transferring sorted blocks to the sortout file. As a result of the process, portions of sorted data incorporated into the sortout file may physically remain in external storage space allocated to the input file, and/or in external space allocated to sortwork, thereby eliminating or reducing reading and writing from disk during sort-merge processing. | 07-29-2010 |
20100205185 | Method for automatic sequential imaging of selected computer produced dialog boxes with fields for optional entry of data to aid visual retrieval - Method for automatic imaging of a plurality of dialog boxes that create computer records of text data objects displayed on data tables, in order to visually discover meaningful interrelations of data on said dialog boxes. The dialog boxes contain parametric data, other data related to the text data object, and fields for entry of distinguishing text and/or color markings for reference during automated imaging of a plurality of dialog boxes. | 08-12-2010 |
20100211577 | DATABASE PROCESSING SYSTEM AND METHOD - Provided is a database system in which sorting of query results is sped up. The database system stores storage location information in which storage locations of the pieces of data are recorded in a given order. When there is no second task, which is executed based on data that is fetched in a first task, whether every piece of data requested in a third task, which is executed before the first task, has been fetched is determined. In the case where every piece of data requested in the third task has been fetched, data fetched in the first task is output. In the case where some of the data requested in the third task has not been fetched, data fetched in the first task is kept in a temporary buffer until every piece of data requested in the third task is fetched, and then output. | 08-19-2010 |
20100211578 | PATENT CONNECTION DATABASE - In an embodiment, a computer system includes a plurality of inventor profile records stored on one or more storage devices, the plurality of inventor profile records each recording a name of a living person in a name field. The system further includes a plurality of patents represented by a plurality of patent records stored on the one or more storage devices, wherein each patent record records at least an inventor name and a patent number, in respectively, at least one inventor name field and a patent number field. A computer program operable on one or more processors adapts a computer system to display a patent search interface on a display device, the patent search interface including at least one field or selection tool to receive patent search criteria input from at least one user input device to match to one or more fields in a patent record. | 08-19-2010 |
20100228745 | SYSTEM, METHOD, AND APPARATUS FOR SORTING AT LEAST PARTIALLY DYNAMIC DATA - Embodiments of methods, apparatuses, devices and systems associated with sorting candidate values are disclosed. | 09-09-2010 |
20100228746 | SYSTEM AND COMPUTER PROGRAM PRODUCT FOR FILE MANAGEMENT - On a display unit of a client terminal, a to-be-uploaded folder and a to-be-uploaded file, a display area associated with computer program that provides uploading function, and the like are displayed. When a user operates a mouse and the like such that a pointer is placed on the to-be-uploaded file and performs a drag-and-drop operation into the display area, the to-be-uploaded file is uploaded to a file management server via a network. | 09-09-2010 |
20100228747 | HIGH LEVEL NETWORK LAYER SYSTEM AND METHOD - A technique for providing high level network layer functionality to an IM environment involves providing a high level platform through which IM clients can connect to IM networks. A platform according to the technique may include a low level network connect engine, an aggregated low level information database, and/or a high level function engine. A method according to the technique may include facilitating a high level login; checking user configurations; accomplishing one or more IM network logins in accordance with the user configurations; and providing high level services in association with at least one of the IM networks. Another method according to the technique may include logging into a high level platform; logging into a first IM network; logging into a second IM network; and accessing at the high level platform aggregated low level information associated with the first IM network and the second IM network. | 09-09-2010 |
20100235365 | PS9110 Linear time sorting and constant time searching algorithms - System and methods are described for sorting information in order O(n) time using O(n) space and searching for information in that sorted list in order O( | 09-16-2010 |
20100235366 | DATA FILE AGGREGATION WITH RESPECT TO USER SPECIFIC TEMPORAL RANGE - A method and system of file aggregation is provided herein. Input is received in the form of a user specific temporal range, and is compared to a value within a temporal metadata field of a data file to determine an appropriate data set within which to compile the data file for presentation. In this way, data files within a particular data set may be selectively presented to a user. For example, if a user begins taking photos at 11 p.m. and continues until 2 a.m. the next day, the user may specify the photos taken between 11 p.m. and 2 a.m. are to be compiled into a single data set for presentation, as opposed to presenting the photos in data sets corresponding to different days. | 09-16-2010 |
20100235367 | CLASSIFICATION OF ELECTRONIC MESSAGES BASED ON CONTENT - Classifying electronic mail (e-mail) based on content and predefined categories. Content of a received e-mail may be analyzed to determine one of a plurality of predefined categories into which the e-mail is classified. A relevancy score may also be calculated to indicate the strength of correlation between the e-mail and the category. A user may be allowed to sort e-mails in an e-mail box based on the category names and/or relevancy scores. | 09-16-2010 |
20100241637 | Systems and methods for managing foreign key constraints - Systems and methods consistent with the invention may include generating, via a processor, an entity relationship model to indicate a plurality of types of relationships between the entities, determining relationships between the database tables corresponding to the entities by using the entity relationship model, wherein the database tables are stored in a computer memory device, generating a graph based on the entity relationship model, generating sets of database elements representing the entities and corresponding data objects stored in the database tables, wherein the element sets are generated based on the generated graph, assigning ordering numbers to the database element sets and database elements included in the database element sets and executing the query transaction by using the data objects in an order based on the ordering numbers. | 09-23-2010 |
20100241638 | SORTING CONTACTS - A method, computer program product, and computing system for sorting contacts is provided. The method may include sorting a group of contacts within an address field of a message based upon, at least in part, a selected hierarchy. The method may also include displaying said group of contacts at a computing device according to said selected hierarchy. Of course, numerous other operations may be included without departing from the scope of this disclosure. | 09-23-2010 |
20100262612 | RE-RANKING TOP SEARCH RESULTS - The claimed subject matter provides a system and/or a method that facilitates generating sorted search results for a query. An interface component can receive a query in a first language. A first ranker can be trained from a portion of data related to a second language. A second ranker can correspond to the first language, wherein the second ranker is untrained due to a limited amount of data related to the first language. A sorting component can invoke the first ranker to generate and order a pre-defined number of search results for the received query and subsequently invoke the second ranker to the pre-defined number of search results to generate a re-ordered number of search results in the first language for the received query. | 10-14-2010 |
20100281038 | HANDLING AND DISPLAYING OF LARGE FILE COLLECTIONS - An apparatus comprising a controller. The controller is configured to display a file collection, to receive input indicating a sort option, to search said file collection to find files matching said sort option, and to display said files matching said sorting option in response thereto. | 11-04-2010 |
20100293171 | IMAGE PROCESSOR - A first sorting unit includes a second sorting unit that sorts first frequency data for luminance based on a first table, a third sorting unit that sorts second frequency data for chrominance based on a second table, a fourth sorting unit that sorts third frequency data for chrominance based on a third table, and an updating unit that updates the second and third tables based on nonzero information on the first and second frequency data before the third and fourth sorting units start sorting. | 11-18-2010 |
20100306204 | DETECTING DUPLICATE DOCUMENTS USING CLASSIFICATION - 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. | 12-02-2010 |
20100306205 | METHOD AND SYSTEM FOR DETERMINING AN ORDER OF PRESENTATION OF SEARCH RESULTS - 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. | 12-02-2010 |
20100325116 | DATA LIBRARY OPTIMIZATION - The invention provides a method, system, and program product for optimizing a data library. A first aspect of the invention provides a method of optimizing a data library, comprising: moving a plurality of data files from a plurality of data library volumes to a staging area; sorting the data files into a plurality of directories based on at least one criterion of the data files; transferring data files from a first directory in the staging area to a transfer medium; deleting the first directory; transferring data files from a second directory in the staging area to a transfer medium; and deleting the second directory. | 12-23-2010 |
20110004601 | Multi-streamed method for optimizing data transfer through parallelized interlacing of data based upon sorted characteristics to minimize latencies inherent in the system - 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. | 01-06-2011 |
20110022607 | METHOD AND APPARATUS FOR PROCESSING DATA RECORDS IN A GIVEN ORDER UPON RECEIVING INPUT DATA FROM A TOUCHSCREEN - A method and computing device for managing calendar data records are provided, the computing device comprising a processor interconnected with a memory enabled to maintain the data records and with a touchscreen controlled to generate a representation of a subset of at least two of the data records within a first portion of the touchscreen. The touchscreen is further controlled to generate a representation of details of a first one of the data records in the subset in a second portion of the touchscreen, different from the first portion, when input data associated with the first portion is detected by the touchscreen. The touchscreen is further controlled to generate a representation of details of a next data record in the subset, in a given order, in the second portion, each time an input event is detected at a portion of the touchscreen associated with providing next data records. | 01-27-2011 |
20110029545 | SYLLABIC SEARCH ENGINES AND RELATED METHODS - An improved search engine, for a computing device or computer network, utilizes search strings comprising complete words and numbers representing a syllable count for each unknown word. Pattern-matching algorithms are utilized to search a document database for documents that match the input search strings. The document database is constructed by analyzing a number of documents, utilizing document-analyzing algorithms. In one embodiment, each database record comprises a document that has been analyzed into one or more groups of word sequences. Each word sequence comprises an ordered list of words in the word sequence, as well as a corresponding ordered list of the syllable count for each word in the word sequence. The syllabic search engine can be implemented in different ways, such as through a software application, operating system, network software, or a custom software module. Improved computers and computer networks for providing a syllabic search function are also described. | 02-03-2011 |
20110055232 | Data restructuring in multi-level memory hierarchies - A method, executed on a suitably programmed processor, provides for ordering records using a memory hierarchy. The memory hierarchy includes and two or more lower levels of the memory hierarchy. The method includes the steps of (a) receiving unsorted input records; (b) reading the input records in pages and writing one or more pages of the input records to the primary memory; (c) sorting the pages of input records to create a run; (d) if a size of the run exceeds primary memory capacity, moving data that just exceeds the primary memory capacity to a secondary level of the memory hierarchy; (e) repeating steps (a)-(d) until either (i) all unsorted input records have been read into primary memory and sorted, or (ii) a capacity of the secondary level of the memory hierarchy is exceeded; (f) following step (e)(ii), moving data that just exceeds the secondary memory capacity from the secondary level to a tertiary level of the memory hierarchy until the capacity of the secondary level no longer is exceeded; and (g) following either of steps (c), (e)(i), or (f), merging runs to create a merge output. | 03-03-2011 |
20110055233 | Methods, Computer Systems, Software and Storage Media for Handling Many Data Elements for Search and Annotation - The invention refers to a method creating a data structure including many data elements comprising the steps of receiving multiple data elements to be stored from an input data structure, providing a continuous array in memory, allocating memory space within the continuous array for the data elements and storing the data elements in the allocated memory space. | 03-03-2011 |
20110060748 | Apparatus and Method for Heap Sorting with Collapsed Values and Selective Value Expansion - A computer readable storage medium includes executable instructions to order a binary tree using primary values and selected secondary values required to resolve a position in the binary tree. The remaining secondary values are in a do not care state. A new primary value is compared to the primary value at the root node of the binary tree. If necessary, a new secondary value is compared to the secondary value at the root node to determine whether the new primary value and the new secondary value or the value at the root node should be placed in a sorted list. | 03-10-2011 |
20110078161 | SYSTEM AND METHOD FOR SHARING AND DISPLAY OF FAVORITES AMONG MULTIPLE USERS - A system and method for sharing and displaying lists among multiple users is disclosed. In one embodiment, the method comprises receiving a first list of items from a first user device, generating a sorted list based on at least the first list and a second list, and displaying the sorted list. Multiple lists of items can be received from user devices having a small screen and the sorted list can be displayed on a large screen viewable by the multiple users of the user devices. | 03-31-2011 |
20110087681 | MERGING OF ITEMS FROM DIFFERENT DATA SOURCES - A digital processing system provided according to an aspect of the present invention processes items received from different data sources, specifically when a second set of items received from a second data source is related to corresponding ones of a first set of items received from a first data source. In one embodiment, each of the items in the first set and the second set is first assigned a corresponding digital value and then sorted according to a sort order of the assigned digital values to form a sorted output. The digital values are assigned such that items in the second set are grouped with related corresponding ones of the first set of items. Thus, items from different sources are merged (and sorted) based on the relation between the items. | 04-14-2011 |
20110093477 | METHOD FOR ESTIMATION OF ORDER-BASED STATISTICS ON SLOWLY CHANGING DISTRIBUTIONS - A computer-implemented method for estimation of order-based statistics on slowly changing distributions of data stored on a computer. An initial set of data is converted to an initial histogram based representation of the data set's distribution. New or removed data is converted into a new histogram separate from the initial histogram. The new histogram is combined with the initial histogram to build a combined histogram. Percentiles and order-based statistics are estimated from the combined histogram to provide analysis of a combination of the initial set of data combined with the new or removed data. | 04-21-2011 |
20110099178 | Method for providing a table of station-specific information in a network of distributed stations, and network station for carrying out the method - After every bus reset operation in an IEEE 1394 network, the network is reconfigured. This involves a table with further station-specific information being created after the bus initialization phase, the tree structure identification phase and the self identification phase. This is done by making requests to the individual network stations. Each network station returns its station-specific information to the requesting network station. It has become apparent that in some cases a response from the network station to which a request has been sent is returned only after the request has been repeated a plurality of times or in the extreme case even not at all. So as not to delay the creation of the network node information table unnecessarily for such cases, the invention proposes creating the table in two phases. In the first phase, all that information which has been received up to a time determined by a first abort criterion is sorted into the table. Next, the still incomplete table is enabled for use by an application program in the requesting network station. In the second phase, the still missing station-specific information is then requested again and is sorted into the table when it is delivered by the stations to which requests have been sent. After a time determined by a second abort criterion, the further request for the still missing station-specific information is terminated and the table is closed in this state and is provided for use by the application software. | 04-28-2011 |
20110099179 | PERFORMANCE BOOST FOR SORT OPERATIONS - A method, computer-readable medium, and machine are provided for boosting the performance of sort operations. A database server performs an operation on a set of data. The operation uses disk space such as a temporary tablespace. The disk space belongs to a disk group in which data is stored according to a level of redundancy. A determination is made as to whether the operation is a sort operation. If the operation is not a sort operation, then at least part of a result of the operation is stored on the disk space according to the level of redundancy specified for the disk group. If the operation is a sort operation, then only a single copy of the at least part of the result is stored without storing a redundant copy of the at least part of the result. Optionally, backup information sufficient to re-perform the sort operation may also be stored. | 04-28-2011 |
20110106822 | Virtual List View Support in a Distributed Directory - A computer implemented method, data processing system, and computer program product for performing a virtual list view search in a distributed directory environment using a proxy server. The mechanism described in the illustrative embodiments enables a proxy server to provide virtual list view search support in a distributed directory environment when data is partitioned across multiple directory servers. | 05-05-2011 |
20110113044 | SYSTEM AND METHOD FOR MANAGING SPONSORSHIP OPPORTUNITIES - The exemplary embodiments of the present invention provide a method and computer program products for managing sponsorship opportunities. The method is embodied in a computer program product for execution on an instruction processing system and includes a tangible storage medium readable by the instruction processing system and storing instructions for execution by the instruction processing system for performing the method. The method includes comparing sponsorship preferences with sponsorship properties, determining which of the sponsorship properties match all the sponsorship preferences and sorting the sponsorship properties into at least two groups, the first group including the sponsorship properties that match all the sponsorship preferences and a second group including the sponsorship properties that do not match all the sponsorship preferences. The method further includes creating a list of sponsorship properties included in the at least two groups, and transmitting the list of sponsorship properties to a user device. | 05-12-2011 |
20110125766 | Optimizing the Efficiency of an Image Retrieval System - Aspects of this disclosure relate a system for retrieving images that may include one or more mainframe computer sites or Logical Partitions (LPARS) one or more servers operatively connected to the LPARS, and one or more databases operatively connected one or more of the LPARS. The system may also include a processor that may be configured to perform a method for generating electronic cash letters. The method for generating electronic cash letters may include reading a primary input key file assigned to the cash letter job, wherein the primary input key file includes a set of keys and each key corresponds to an image stored in one of the databases. The method may further include splitting the keys in the primary input key file into individual key files. The method may further include attaching a key processor subtask to each of the individual key files and running the key processor subtasks concurrently and independently of one another, wherein each of the key processor subtasks connects to one of the servers via TCP/IP protocol and retrieves the images from the particular database to which the keys in individual key files correspond. | 05-26-2011 |
20110131217 | COMPUTER PROGRAM AND COMPUTER SYSTEM FOR PRODUCING TEST FLOW - A program executed on a computer including storage, processing, output, and input units, the storage unit storing test-difficulty-calculation-elements-database, test-menu-database, and test-flow-database, for each test-menu-record, the program causing the processing unit to execute: calculating test-difficulty for each test-menu-record based on test-difficulty-calculation-formula by using at least one among pieces of information indicative of relationship with netlist, the number of package/test pins, expected operational clock frequency, process technology information, power consumption, and tester storage space; identifying all relationship between DFT scheme and priority, and causing the storage unit to store information indicative of the relationship between the DFT scheme and priority into the test-flow-database; and sorting the DFT scheme in an order of the priority based on the relationship between the DFT scheme and priority, causing the storage unit to store the DFT scheme as a test flow, and causing the output unit to output the test flow. | 06-02-2011 |
20110131218 | Dynamic Content Sorting Using Tags - A data processing system facilitates organization of content such as digital photographs, video files, audio tracks, and the like. The data processing system comprises a content manager that manages a content database and includes a content database initialization or creation utility and a content database search utility. The a content database initialization utility creates a content database by assigning one or more tags that represents context of the content to content and combines the tag or tags with associated content in a data structure, and saves the data structure in a database. The content database search utility specifies a set of tag values representing context of content and initiates a database query for determining a set of content items that match the specified set of tag values. The content database search utility searches for the set of content items that match the tag values. | 06-02-2011 |
20110153623 | Compressing massive relational data - A relational dependency transform is introduced as a way to exploit information redundancy in conditioning data in a relational database for better compressibility. An optimum relational dependency transform of the relational database is first computed. Fields of the relational database are then sorted topologically based on a weighted, directed graph having nodes representing predictor and predictee fields. For each predictee field in the topological order, a transformed field is then computed via the relationship between predictor and predictee in the optimum relational dependency transform. | 06-23-2011 |
20110167073 | SYSTEM AND METHOD FOR IN-DEPTH ANALYSIS OF LOCATION AND TIME BASED PATTERNS IN CELLULAR NETWORKS - A system and method for in-depth analysis of location and time based patterns in cellular networks is provided. A processor processes data received from tracking the movements of a target over a period of time. The data is filtered into recurring time patterns and an event vector comprising an ordered sequence of events from the received data is created. Routines for static areas of high target activity and routines for routes of high target activity are then created. | 07-07-2011 |
20110173211 | Dynamic Alliasing of Multi-Valued Binary Attributes In Directories - Dynamic aliasing of multi-valued binary attributes in a directory. A plurality of binary attribute-values are stored in the directory that in the aggregate form the multi-valued binary attribute. For each binary attribute-value, there is stored metadata describing characteristics of the binary attribute-value with which it is associated. A preference is received from a user of the directory, the preference being based on the characteristics of the multi-valued binary attribute. The preference is associated with at least one binary attribute-value. A set of multi-valued binary attribute-values are associated for the user based on the preference received from the user and the set of multi-valued binary attribute-values are accessed. | 07-14-2011 |
20110173212 | SYSTEMS AND METHODS FOR SORTING SEARCH RESULTS - A computer-implemented method is provided for ranking files from an Internet search. In one embodiment, the method comprises assigning a score to each file based on at least one of the following factors: recency, editorial popularity, clickthru popularity, favorites metadata, or favorites collaborative filtering. The file may be organized based on the assigned scores to provide users with more accurate search results. | 07-14-2011 |
20110173213 | SYSTEM AND METHOD FOR DATA PRESERVATION AND RETRIEVAL - A system and method for searching for computer environments, authenticating the computer environments, and copying data from the authenticated computer environments to a memory location. The data is marked or bound to the computer system it was copied from which provides a user with assurance that the data was obtained from a specific, authenticated source. The computer environments and the memory location may be coupled over a network. | 07-14-2011 |
20110191356 | ADVANCED APPLICATION FOR CAPTURING, STORING AND RETRIEVING DIGITAL IMAGES OF A PATIENT CONDITION DURING A REAL-TIME VIRTUAL FACE-TO-FACE ENCOUNTER - Method and system for real-time capturing of real-time images from the real-time interaction between the medical professionals and patient by using a common interaction platform for e.g. web browser, where in the system and method are used to capture the image in a real-time, where the medical professional or the patient can capture the image any point of time based on the view selected by the user, this capturing of the image is captured from the real-time video camera display. The interaction session combines the captured image with patient demographic information into a single patient data file that is archived within a searchable database. | 08-04-2011 |
20110191357 | MAP DATA, STORAGE MEDIUM AND NAVIGATION APPARATUS - Map data is disclosed. The map data includes a multilink information list, a road name information list and an offset information list. The multilink information list has fixed-length multilink information elements each indicting a number of links contained in a corresponding multilink. The road name information list has road name information elements each indicating a road name of corresponding multilink information element. The road name information elements are arranged in the road name information list in an order in which the corresponding multilink information elements are arranged in the multilink information list. The offset information list has fixed-length offset information elements each indicating location of a corresponding road name information element in the road name information list. The offset information elements are arranged in the offset information list in an order in which the corresponding multilink information elements are arranged in the multilink information list. | 08-04-2011 |
20110196880 | STORING UPDATE DATA USING A PROCESSING PIPELINE - A system has a processing pipeline with a plurality of processing stages, where each of the processing stages has one or plural processors, and where the processing stages are individually and independently scalable. A first of the processing stages of the processing pipeline provides a received date update into an update data structure, where the update data structure is accessible to process a query received by the system. One or more additional of the processing stages transforms the update data structure to allow for merging of the transformed update data structure into a database, where the transformed update data structure is accessible to process the query. Content of the transformed update data structure is stored into the database. | 08-11-2011 |
20110196881 | METHOD AND DEVICE FOR MANAGING INFORMATION IN AN AIRCRAFT - The object of the invention is in particular a method and a device for managing information in an aircraft, comprising at least one device for restituting information for the crew and a plurality of equipment items adapted to transmit information items capable of being restituted on the restitution device. After a plurality of information items from the said plurality of equipment items has been acquired and a context has been determined ( | 08-11-2011 |
20110208757 | METHOD AND SYSTEM FOR IMPLEMENTING EFFICIENT CURSOR PRUNING - Disclosed are improved methods, systems, and mediums for cursor sharing and cursor pruning. According to some approaches, existing child cursors are distinguished using a cursor sharing criteria node structure. A sharing criteria node (also referred to as a “diagnostic” node) is created when a sharing criteria mismatch/failure happens. The node contains information about why the child cursor could not be shared and also information that can be used to quickly re-evaluate this sharing criterion in the future. | 08-25-2011 |
20110208758 | Rule-Based System and Method to Associate Attributes to Text Strings - In one embodiment, a title is selected for content to be published online. A method implemented in a data processing system includes receiving a plurality of text strings. A plurality of rules are applied to the text strings. If a condition specified in one of the rules exists in a given text string, one or more attributes are associated to that text string as metadata. One or more of the text strings are selected, using the metadata, as a potential title for the content. A final title is prepared based on the potential title, and the content is published online under the final title. | 08-25-2011 |
20110219014 | Systems and Methods For Representing Text - The disclosure herein describes systems and methods for representing text. For example, one disclosed embodiment is a method including the steps of receiving a plurality of text strings, each text string comprising at least one character, wherein the at least one character has a representation comprising a first part and a second part; receiving a request to sort the plurality of text strings; and sorting the plurality of text strings based on first parts of the characters of the text strings. In another embodiment, a computer-readable medium comprises program code for causing a processor to execute such a method. | 09-08-2011 |
20110225175 | INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND INFORMATION PROCESSING PROGRAM | 09-15-2011 |
20110231414 | Managing Processes in a Repository - A method of managing a plurality of processes in a repository of a computer system is disclosed. For example, the method includes forming a model associated with differences among the plurality of processes. The model associated with differences includes one or more features for expressing the differences. The method further includes forming a model of priority among the one or more features, and organizing the plurality of processes according to the model associated with differences and according to the model of priority. At least one of the one or more features is a semantic feature. One or more of the forming of the model associated with differences, the forming of the model of priority and the organizing of the plurality of processes are implemented on a processor device. | 09-22-2011 |
20110231415 | WEB PAGE SEARCHING SYSTEM AND METHOD USING ACCESS TIME AND FREQUENCY - The present invention relates to a web search system and a method thereof based on a web page connection time and a web page visiting frequency. The web search system and the method thereof based on the web page connection time and the web page visiting frequency according to an embodiment of the present invention comprises the steps of: extracting the web page connection time of a user; calculating an accumulated connection time of the web page using the extracted connection time; and providing a list of web pages searched by the user after sorting the web pages in order of a ratio of the accumulated connection time. | 09-22-2011 |
20110238676 | SYSTEM AND METHOD FOR DATA CAPTURE, STORAGE, AND RETRIEVAL - A computing device includes a display and a processing circuit coupled to the display. The processing circuit is configured to provide an image on the display, receive an input from a user identifying at least a portion of the image; and automatically transmit the image to a mobile computing device based at least in part on receiving the input. | 09-29-2011 |
20110238677 | Dynamic Sort-Based Parallelism - A system, method, and computer program product are provided for sorting a set of records in a sort run. As the records are sorted, metadata regarding the sort run is gathered, and subsequently used to determine bounds of two or more disjoint subsets of the sort run. This enables the parallelization of several tasks over the sort run data using efficient, dynamic bounds determination, such as the outputting of sorted data from the disjoint subsets in parallel. | 09-29-2011 |
20110264674 | DISPLAY CONTROL APPARATUS - When a list of file names is to be displayed on a display device, a comparison is made between a necessary display width of each of the file names and a width of a display area of the display device. For each of the file names having a necessary display width greater than the width of the display area, it is checked whether the file name contains a particular character string portion of a predetermined type, and, if so, the file name is displayed in the list in a partly-omitted display style where a leading end portion, particular character string portion and extension of the file name are left in the list with the other part of the character string omitted. The particular character string portion can function as an important element for identifying the data item in question. | 10-27-2011 |
20110282887 | SYSTEM AND METHOD FOR DATA MANAGEMENT OF A COMMUNICATION DEVICE - A communication device and a method for data management include setting a birth month and a birth day of each contact in a contact list. The method further includes arranging all the contacts in the contact list according to the birth month of each contact, and arranging contacts having the same birth month according to the birth day of each contact sharing the same month. | 11-17-2011 |
20110282888 | CONTENT RECOMMENDATION BASED ON COLLECTIONS OF ENTITIES - Techniques for content recommendation are described. Some embodiments provide a content recommendation system (“CRS”) configured to recommend content items that are related to a collection of entities. A content item may be considered related to a collection of entities based on various factors, including whether and how often the article references or otherwise covers the entities of the collection, the size of the article, other entities that are covered by the article but that are not in the collection, article recency, or article credibility. Recommending content items may also or instead include determining entities that are related to a collection. An entity can be considered related to a collection based on various factors, such as whether the entity is of the same or similar type to entities of the collection, or whether the entity appears in some article in a relationship with one or more entities of the collection. | 11-17-2011 |
20110295862 | Early return of partial sort results in a database system - As described herein, a database machine is provided with specialized hardware that can be used to accelerate the sort function. This hardware lowers the computation cost of performing a raw sort operation over the result rows. The hardware may be embodied in a direct circuit (e.g., ASIC), a programmable circuit (e.g., FPGA), a parallel compute engine (e.g., GPU) or any parallel computer. A hardware-assisted sort procedure provides for the early return of up to K results. This early return feature is critically valuable in database operations because often an entire result set is not required. For requests that require only the first L results, when L<=K the query can be satisfied with only a single pass over the data. The hardware- or GPU-assisted sort procedure, referred to herein as “scraper sort,” may be based on modifications of well-known, existing parallel sort algorithms. | 12-01-2011 |
20110302177 | SEARCH-SORT TOGGLE - A system for facilitating accessing or retrieving desired data via use of graphically displayed search/sort toggle functionality. In an example embodiment, the method includes providing a first user option to toggle between display of a search control and a sort control. Search results are displayed in response to user input provided via the search control. Note that default search results may be initially displayed. A portion of the search results may be displayed simultaneously with one or more controls associated with the first user option. In a more specific embodiment, the example method further includes displaying search results simultaneously with one or more sort controls in response to user selection of the first option when one or more search controls are initially displayed. Hence, display of search and sort controls may be toggled via the first option while any search results are simultaneously displayed along with the controls. Sort controls are adapted to enable a user to specify one or more sort criteria for sorting data, such as retrieved search results. Similarly, search controls enable specification of one or more search criteria or queries. | 12-08-2011 |
20110302178 | SYSTEMS FOR PERFORMING AN EXTERNAL (DISK-BASED) SORT OF A LARGE DATA FILE WHICH TAKE ADVANTAGE OF "PRESORTED" DATA ALREADY PRESENT IN THE INPUT - Systems and programs for improving the efficiency of a sorting process in a computer system are disclosed. Data is provided in an input file external to the central processing unit of the computer system. In one embodiment, the implemented process involves investigating the contents of the input file in order to identify presorted portions thereof; incorporating the identified presorted portions of the input file into a second file external to the central processing unit, performing this step by rearranging directory information, without physically transferring the presorted portions from the input file. In sort processes involving both a string generation phase and a merge phase, the techniques described may be used in either or both phases, as well as in any output phase. Rearrange directory information rather than physically transferring data provides for greater efficiency in disk I/O. | 12-08-2011 |
20110314033 | Derivative work discovery system and method - A derivative work discovery service facilitates discovery of derivative works by consumers who request the service from a derivative work service server. The derivative work service server uses information about digital sources available on a computer system operated by the consumer to search a derivative works database. A derivative work discovery file is compiled and presented to the consumer in a descending order of a ratio of a number of digital sources possessed by the consumer that are equivalent to digital sources used to create a derivative work to a total number of digital sources used to create that derivative work. | 12-22-2011 |
20110320465 | ANALYSIS PREPROCESSING SYSTEM, ANALYSIS PREPROCESSING METHOD AND ANALYSIS PREPROCESSING PROGRAM - An analysis preprocessing system is provided which is capable of, when large amounts of data are received from a large number of data generation sources, rapidly passing those data to means for analyzing the data in order of time of generation thereof. Data acquisition means | 12-29-2011 |
20120016890 | ASSIGNING VISUAL CHARACTERISTICS TO RECORDS - Systems, methods and computer program products are disclosed herein for assigning visual characteristics to records of a data structure and displaying those records. In response to an attribute being selected, records of the data structure may be sorted by values of the selected attribute of the records. A first set of records having values of the selected attribute that correspond to a first value may be identified. A second set of records having values of the selected attribute that correspond to a second value also may be identified. A first visual characteristic may automatically be assigned to each record of the first set of records and a second visual characteristic, that is different from the first visual characteristic, may be automatically assigned to each record of the second set of records. | 01-19-2012 |
20120016891 | HIERARCHICAL REGISTRY FEDERATION - Some embodiments of a system and a method to implement a hierarchical registry federation have been presented. For instance, a registry federation can be stored in a set of one or more storage devices, the registry federation including multiple registries, each registry having one or more records. The registries can be organized in an oriented graph such that each registry is logically connected to another registry in the registry federation as a parent registry or a child registry. | 01-19-2012 |
20120016892 | ORGANIZING IMAGES CAPTURED BY MULTIPLE IMAGE CAPTURE DEVICES - A method for organizing images from multiple image capture devices includes allowing the determination of an offset between image capture times recorded in a first image capture device and image capture times recorded in a second image capture device, adjusting the image capture times recorded in the second image capture device by the offset to produce adjusted image capture times by a computer processor, and sequencing images taken by the first image capture device and the second image capture device in an chronological order. The sequencing is based on the image capture times for the images captured by the first image capture device and the adjusted image capture times for the images captured by the second image capture device. | 01-19-2012 |
20120023114 | UNIVERSAL DEVICE IDENTIFIER FOR GLOBALLY IDENTIFYING AND BINDING DISPARATE DEVICE IDENTIFIERS TO THE SAME MOBILE DEVICE - Embodiments of the invention are directed to determining a universal device identifier (UDID) for a client device, based on multiple service-dependent identifiers (SDIDs) used by client applications, websites, or other services to identify the client device. SDID types are prioritized with pre-assigned weights. A received SDID causes a single database read to access all other SDIDs, and any existing UDID(s) associated with the client device. A final UDID is created or selected based on the SDID weights. The database is updated in a sequence that enables self recovery of a prior UDID in case of database error during update. First, any non-selected UDID records are updated with the final UDID. Next, lower weighted SDID records are updated. The final UDID record is updated. The highest weighted SDID record is updated last, to preserve the prior UDID as long as possible in case of update error, which aborts the remaining update. | 01-26-2012 |
20120066236 | METHOD FOR SEMANTIC SERVICE REGISTRATION AND QUERY BASED ON WORDNET - A method for semantic service registration and query based on WordNet is disclosed. The method includes the following steps: (1) semantic service registration: a service provider registers a service and uploads the Web Service Description Language (WSDL) document corresponding to the service, and a system parses the WSDL document to form a service description tree, then constructs a WordNet ontology tree according to the input of the service, performs a semantic annotation on the input/output of the service to form a Web Service Semantic Description Document (WSDL-S), and finally stores it in a register library; (2) semantic service discovery: a service requester inputs the information of service type, semantic information of the service input/output and other user-defined information to the register library to retrieve the services meeting the requirements; and (3) similarity sorting: the services meeting a certain threshold are sorted in descending order. The method has the advantages of the combination of WordNet ontology library and the semantic description language of WSDL-S, and definite semantic meaning. | 03-15-2012 |
20120078922 | DATA REORGANIZATION - An approach to efficient data reorganization. The approach may involve searching for control interval (CI) splits and control area (CA) splits in a data component of a VSAM data set. A mapping is created that maps the source location storing the VSAM data set to a target location. The mapping reorders the VSAM data set such that the CI splits and CA splits are removed when the VSAM data set is moved to the target location in accordance with the mapping. Those CAs that do not include CI splits may be moved without using the host devices' processing resources. For example, the storage device may FlashCopy these areas directly from the source location to the target location. Those CAs that do include CI splits may be moved using the host's processing resources. For example, these CAs may be read into the host, re-ordered by the host, and written by the host to the target location. | 03-29-2012 |
20120078923 | SCRIPTING USING NEW ORDERING ALGORITHM - Ordering data objects. The method includes, for each object to be ordered into a set of ordered objects, determining whether the object has static dependencies or dynamic dependencies. A dynamic object is an object that may have circular dependencies. For each static object with only static dependencies, the objects are ordered according to a pre-determined type order. The method further includes, for one or more dynamic objects with dynamic possibly circular dependencies, resolving the circular dependencies such that the dynamic objects can be ordered with the static objects. | 03-29-2012 |
20120089624 | Method, Apparatus, and System for Searching Based on Search Visibility Rules - According to one aspect of the present invention, a method is provided in which a search request containing search criteria is received from a first user. A search is performed based upon the search criteria and the first user's organizational identifier to identify data records that match the search criteria and to which the first user is allowed to access based upon the first user's organizational identifier. In another embodiment, a search is performed based upon the search criteria and a list of categories to which the first user is authorized to access to identify records that match the search criteria and to which the first user is allowed to access based upon the list of categories. | 04-12-2012 |
20120096016 | SEARCHING DOCUMENTS FOR RANGES OF NUMERIC VALUES - Provided are a method, system, and article of manufacture for searching documents for ranges of numeric values. Document identifiers for documents are accessed, wherein the documents include at least one value that is a member of a set of values. A number of posting lists are generated. Each posting list is associated with a range of consecutive values within the set of values and includes document identifiers for documents including at least one value within the range of consecutive values associated with the posting list, and wherein each document identifier is associated with one value in the set of values included in the document identified by the document identifier. The generated posting lists are stored, wherein the posting lists are used to process a query on a range of values within the set of values. | 04-19-2012 |
20120109981 | GENERATING PROGRESSIVE QUERY RESULTS - There is provided a method for generating results for a sort operation. The method includes writing a subset of input to memory. The subset may be sorted based on the sort operation. The sorted subset may be compared to previous results. The previous results may be recalled from a client of the sort operation based on the comparison. | 05-03-2012 |
20120109982 | METHOD AND SYSTEM FOR TAG SUGGESTION IN A TAG-ASSOCIATED DATA-OBJECT STORAGE SYSTEM - Embodiments of the present invention are directed to facilitating tag assignment to data objects as data objects are added to a tag-associated data-object storage system by users of the tag-associated data-object storage system and to facilitate subsequent display, access, and further characterization of data objects that already reside in the a tag-associated data-object storage system. Methods and systems of the present invention provide for automated tag suggestion to users in order to both increase usability of the interface provided to the tag-associated data-object storage systems as well as decrease the likelihood of unnecessary and unproductive tag proliferation within the tag-associated data-object storage system. | 05-03-2012 |
20120109983 | METHOD FOR ACCESSING FILES OF A FILE SYSTEM ACCORDING TO METADATA AND DEVICE IMPLEMENTING THE METHOD - The invention relates to the field of accessing data stored in a file system and more particularly, to the optimization of accessing data of a file system. To this effect, the invention proposes a method of accessing files of a data file system according metadata related to the files, and a device for implementing the method. | 05-03-2012 |
20120117089 | BUSINESS INTELLIGENCE AND REPORT STORYBOARDING - Embodiments are directed to organizing reporting data from various sources such as frames into a storyboard view with additional metadata that is specific to the storyboard and to sharing and/or exporting a storyboard sequence of reporting frames. In an embodiment, a computer system accesses various portions of reporting data. The reporting data includes source data, relevant data states and metadata describing properties of the associated report. The computer system organizes the reporting data into multiple reporting frames according to various organizing criteria. Each reporting frame is incorporated into a storyboard interface. The computer system also displays the storyboard interface which includes each of the reporting frames organized according the organizing criteria. | 05-10-2012 |
20120117090 | SYSTEM AND METHOD FOR MANAGING DIGITAL CONTENTS - Disclosed are a system and method for managing digital contents. An exemplary embodiment according to the present invention provides to a system for managing digital contents, including a learning module extracting feature vectors of input digital contents and performing column subspace mapping on the feature vectors to calculate a column subspace projection matrix; an index module using the matrix to perform an index work on the digital contents and then, storing the matrix and the digital contents; and a search module performing the column subspace mapping on the feature vectors of query data when the query data for searching the digital contents are input and searching the digital contents indexed by the matrix having high similarity to the mapped feature vectors of the query data. | 05-10-2012 |
20120131022 | METHODS AND SYSTEMS FOR MERGING DATA SETS - Systems and methods for merging data sets are provided. Data sets are merged based upon a process which begins by sorting data sets. Data sets each include at least one data set key column storing at least one data set key column record. The key column record subsets include at least one data set key column record. Based upon the identification of the first and second key column record subsets, a working data set is assembled. The working data set includes at least the first and second key column record subset, a first and second last record indicator corresponding to the last record of the first and second key column record subset respectively, and a first and second position indicator associating the data set key column records with the data sets respectively. The working data set is sorted in accordance with a selected one or more key column record subsets. | 05-24-2012 |
20120136878 | APPLYING HIERARCHY INFORMATION TO DATA ITEMS - Various embodiments of systems and methods for applying hierarchy information to data items are described. The methods include organizing data items hierarchically when the data items contain no hierarchy information and more particularly applying a hierarchy from a different source or a hierarchy just being created by the user to the data items to produce a hierarchical structure of the data items following the external hierarchy, the relationship between the entities in the external hierarchy and its depth of dependencies. The data items are arranged (ordered and nested) and filtered based on the hierarchy provided. In addition, hierarchical totals may be calculated using the newly produced hierarchy. | 05-31-2012 |
20120150877 | EFFICIENT DATABASE COMPRESSION - A method for compressing data. The method includes accessing, within an electronic system, a database relation comprising a plurality of attributes and determining a sort order of the plurality of attributes of the database relation. The method further includes determining an order of a plurality of compression operators operable to compress the database relation and compressing the database relation to produce a compressed database based on the sort order and the order of the plurality compression operators. | 06-14-2012 |
20120150878 | Longitudinal Electronic Record System and Method With Task-Based Workflow - A system and method for keeping, organizing and managing electronic records, comprising generating a first instance of data objects comprising data elements during a first encounter, the elements comprising a first instance identifier and temporal identifiers; linking a data object to a summarization reference with a pointer; creating an additional instance of data objects also comprising data elements comprising an additional instance identifier and temporal identifiers during a later encounter; and providing continuity for the first instance data objects over time. Continuity may be provided by tracking a relationship between the first instance data object and an additional instance data object and repointing the pointer to point between the summarization reference and the additional instance data object. The additional instance data object may be a revision of the first instance data object, and tracking may occur by back-linking the revision to the first instance data object. | 06-14-2012 |
20120158752 | RENDERING SELECTED AND UNSELECTED LISTS OF AN ITEM SET - An item set may comprise items respectively having a selection status, such as a selected item and an unselected item. The item set may be presented as a selected list and an unselected list having various properties (e.g., mutual exclusivity, such that an item appears on at most one list; both lists sorted according to a sort order; and the unselected list having an unselected list size limit, with unselected items appearing in the unselected list based on a priority order). In order to render the selected list and the unselected list, an item list may be generated that attaches to respective items a selected marker (indicating that the item appears in the selected list) or a hidden marker (indicating that the item does not appear in either the selected list or the unselected list), where the item list is also sorted according to the sort order. | 06-21-2012 |
20120158753 | Comment Ordering System - In one embodiment, a social networking system receives a request by a first user for user comments associated with a content object, accesses a data store of user comments to retrieve a set of user comments associated with the content object, orders the set of user comments based on a time value associated with each comment of the set of user comment, adjusts the order of user comments based on social graph information of the first user, and presents the adjusted list of user comments to the first user. | 06-21-2012 |
20120166453 | SYSTEM AND METHOD FOR SOCIAL FILTERING OF COMMENTS - A request is received, over a network from a requesting user to sort a plurality of comments relating to online content by a social status of a respective one of a plurality of commenters associated with each of the plurality of comments. The social status of the each of the plurality of commenters is determined using a computing device. The plurality of comments are sorted, using the computing device, by the social status of the respective one of the plurality of commenters associated with each of the plurality of comments. A representation of the sorted comments is transmitted, over the network, to the requesting user. The social status of commenters can reflect, in various embodiments, the status of commenters as favorite commenters of the requesting user, as members of the requesting user's social network, or as a top rated commenters in an online community. | 06-28-2012 |
20120166454 | Generating a Hierarchy-Based Trace Log - A computer-implemented method for generating a hierarchy-based trace log includes: receiving a log generated by a trace program performed in a computer system, the log having entries organized by sequence number, each entry including an object key for an object involved in the traced event and a log message about the traced event; identifying all object keys that occur in the log; assigning different separation values to each of the entries; generating respective adjusted sequence numbers for all of the entries by combining each entry's sequence number with the separation value for that entry; and storing an adjusted log having entries organized by the adjusted sequence numbers. | 06-28-2012 |
20120166455 | Filter Range Bound Paged Search - 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. | 06-28-2012 |
20120173552 | Assigning Document Identification Tags - Document identification tags are assigned to documents to be added to a collection of documents. Based on query-independent information about a new document, a document identification tag is assigned to the new document. The document identification tag so assigned is used in the indexing of the new document. When a list of document identification tags are produced by an index in response to a query, the list is approximately ordered with respect to a measure of query-independent relevance. In some embodiments, the measure of query-independent relevance is related to the connectivity matrix of the World Wide Web. In other embodiments, the measure is related to the recency of crawling. In still other embodiments, the measure is a mixture of these two. The provided systems and methods allow for real-time indexing of documents as they are crawled from a collection of documents. | 07-05-2012 |
20120179697 | FACETED INTERACTION INTERFACE TO OBJECT RELATIONAL DATA - A method, system and computer program product to generate selected tabular data from an object relational data model using a faceted interaction interface may include providing a faceted interaction interface to specify a faceted query to provide the selected tabular data from the object relational data model. The faceted query may include at least one facet and at least one facet condition. The method may also include constructing an object relational graph from a plurality of input object tables of the object relational data model. The method may also include selecting each object in the object relational graph which contains at least one facet and identifying each object in the object relational graph on which at least one facet condition applies. The method may additionally include generating at least one object group from the object relational graph. Each object group may include a path from a top level object which contains at least one facet in the object relational graph to an object which contains at least one facet and which does not have any children in the object relational graph. The method may further include generating an object table for each object group, wherein the object table comprises selected tabular data from the object relational data model. | 07-12-2012 |
20120179698 | Multiple Sparse Index Intelligent Table Organization - A method, system and computer program product are provided for reorganizing a database table according to multiple sparse indexes, wherein the reorganized table has superior I/O performance attributes versus the original table. More specifically, the table is reorganized such that random I/O is minimized by more tightly grouping rows in the table associated with each of the referencing sparse indexes together. This enables more associated rows from a given table relevant to a sparse index to be read into RAM for a given I/O operation. | 07-12-2012 |
20120185491 | Reconstruction of Lists in a Document - Some embodiments provide a method for analyzing a document that includes several primitive elements. The method identifies that a set of primitive elements include an implicit list in the document based on location and appearance of the set of primitive elements. The method defines the identified implicit list as an explicit list. The method stores the explicit list as a structure associated with the document. | 07-19-2012 |
20120191729 | Fast Pattern Matching - Aspects of the invention relate to pattern matching of layout design data. Layout design data is searched to identify configurations of geometric elements that match a reference pattern based on an anchor edge in the reference pattern. An edge in a search window area matching the anchor edge may first be selected as anchor matching edge. A search portion of the reference pattern is then compared with the region of the search window area corresponding to the selected anchor matching edge. | 07-26-2012 |
20120197911 | Searching Sensor Data - In particular embodiments, a method includes receiving a query for particular sensor data among multiple sensor data from multiple sensors. The plurality of sensor data has been indexed according to a multi-dimensional array. One or more first ones of the dimensions include time, and one or more second ones of the dimensions include one or more pre-determined sensor-data attributes. The method includes translating the query to correspond to the indexing of the plurality of sensor data. The translated query includes one or more values for one or more of the dimensions of the multi-dimensional array. The method includes communicating the translated query to search among the plurality of sensor data according to its indexing to identify the particular sensor data. | 08-02-2012 |
20120197912 | Sorting E-Mail Documents Based on Free Text Field Content - A request is received to sort multiple e-mail documents according to least frequently used words in the multiple e-mail documents. The multiple e-mail documents are analyzed to identify which of the multiple e-mail documents use at least one of the least frequently used words. The multiple e-mail documents are sorted, according to the least frequently used words, to create alphabetically sorted e-mail documents, and the alphabetically sorted e-mail documents are then displayed. | 08-02-2012 |
20120221582 | SETTING AND DISPLAYING PRIMARY OBJECTS FOR ONE OR MORE PURPOSES IN A TABLE FOR ENTERPRISE BUSINESS APPLICATIONS - A system and method adapted to facilitate efficient sorting and displaying of data in a table. An example method includes displaying a table with a first portion of data and a second portion of data; simultaneously applying a first sort rule to the first portion of data (primary database object(s)) and a second sort rule to the second portion of data (secondary database object(s)) in response to user selection of a sort option; and illustrating sorted data via the table, wherein the first sort rule is adapted to cause the first portion of data to appear in one or more predetermined locations in the table relative to the second portion of data. The second portion of data is sorted according to the second sort rule. In a more specific embodiment, primary database objects are sorted via the first sort rule and are not subject to the second sort rule. The first sort rule includes a specification that primary database objects be displayed at a predetermined location in the table, such as in an uppermost position in the table or in an upper most position in a purpose group section of the table. | 08-30-2012 |
20120226706 | SYSTEM, APPARATUS AND METHOD FOR SORTING MUSIC FILES BASED ON MOODS - A system and method for sorting music files based on moods are provided. The system includes a portable terminal for sorting stored music files based on moods, for changing mood information of a corresponding music file in response to a request to change mood of at least one of the music files, and for transmitting the mood change information to a mood analyzing server, and a mood analyzing server for receiving the mood change information, for updating mood judgment information that is standard information for determining mood of a music file based on the received mood change information, and for transmitting the updated mood judgment information to the portable terminal. | 09-06-2012 |
20120233185 | STRING MATCHING IN HARDWARE USING THE FM-INDEX - String matching is a ubiquitous problem that arises in a wide range of applications in computer science, e.g., packet routing, intrusion detection, web querying, and genome analysis. Due to its importance, dozens of algorithms and several data structures have been developed over the years. A recent breakthrough in this field is the FM-index, a data structure that synergistically combines the Burrows-Wheeler transform and the suffix array. In software, the FM-index allows searching (exact and approximate) in times comparable to the fastest known indices for large texts (suffix trees and suffix arrays), but has the additional advantage to be much more space-efficient than those indices. This disclosure discusses an FPGA-based hardware implementation of the FM-index for exact and approximate pattern matching. | 09-13-2012 |
20120246179 | Log-Based DDL Generation - Systems, methods, and computer readable media for automatically generating Data Definition Language (DDL) commands from database log information is described. In general, techniques are disclosed for analyzing database log entries to identify those associated with targeted DDL commands and associating those entries with a DDL command object. The DDL command object may be used (immediately or at some later time) to generate a DDL commands corresponding to the (possibly many) aggregated log records associated with the command object. The use of multiple database log entries as described herein enables the generation of DDL commands that capture database activity occurring over a period of time (full time context auditing) and can, therefore, naturally account for database schema changes. | 09-27-2012 |
20120254199 | MERGE OPTIMIZATION SYSTEM - A merge optimization system to optimize a run merge process for runs including keys from a data source. The system may include a run generation module to generate a run of the keys in a predetermined order. The system may further include a key characterization module to characterize a distribution of the keys across the run at run generation time, and a run merge module executed by a computer system to selectively associate the runs based on the characterization. | 10-04-2012 |
20120254200 | USER BEHAVIOR BASED COGNITIVE ENGINE FOR DATA OBJECTS - A method and system for relating data objects according to a numerical cognitive association based on user behavior in accessing and/or retrieving the data objects. The resulting associations allow organizing the data objects in non-linear cognitive mappings which can be graphically rendered as cognitive maps. A method for merging multiple cognitive maps into a single cognitive map when cognitive associations exceed a predetermined threshold is provided; and a method for splitting a single cognitive map into multiple cognitive maps when cognitive associations fall below a predetermined threshold is also provided. | 10-04-2012 |
20120259868 | ACCESSIBLE COMMANDING INTERFACE - A commanding interface can provide an efficient computer interface for users of assistive technology by focusing on the tasks that an application can perform, rather than on the interface the application exposes. The commanding interface can provide a search mechanism that searches for and presents functions or functionality in response and dynamically updates results as the search query is entered. Additionally, the commanding interface can prioritize search results based on contextual data, including prior search terms, prior actions, and the context of the user's interaction with the application program. The commanding interface can enable the user to filter the functions and functionality presented through the commanding interface according to types of user-performed activities for which such functions would be utilized, patterns, or heuristically determined associations. | 10-11-2012 |
20120259869 | SYSTEM AND METHOD FOR IMPLEMENTING A WINDOW SORTING MECHANISM - A system and method of providing a window sorting mechanism comprises receiving an array having a plurality of objects, wherein each object contains a digit. The digits in the received array are unsorted in association with a desired sorting arrangement. A length of the received array is determined, whereby received array is separated into a plurality of sub-arrays based on the length of the received array. An inter sub-array digit sorting process is performed in a first iteration between a first sub-array and a second sub-array to sort digits in correspondingly positioned objects in accordance with a first comparison rule. A first adjacent-object digit sorting process is performed in a second iteration on the first and second sub-arrays using simultaneously sorting windows of a first digit size in accordance with a second comparison rule. A second adjacent-object digit sorting process is then performed in a third iteration on the first and second sub-arrays using sorting windows of a second digit size. | 10-11-2012 |
20120259870 | METHOD AND SYSTEM FOR ESTABLISHING SORTING ORDER FOR EVENTS - Embodiments of the disclosure relate to a method and system for establishing sorting order for events from a plurality of systems. Central Unique Identity Service (CUIS) provides a unique ID to a client for an event. The client is a service provider registered with the CUIS. User is a subscriber of the client. The User initiates an event with the client using his computing or communication device. The client requests for a unique ID for the initiated event with the CUIS through a network, before the event is performed or executed. The CUIS records the unique ID along with predefined attributes of the client application, the application identifier for the event, application network identity, application user and the user's device associated with the event in the CUIS unit. The CUIS thus establishes a sorting order for the unique ID's recorded and thereby for the events across all clients. | 10-11-2012 |
20120271838 | LINEAR-TIME TOP-K SORT METHOD - The present invention relates to an algorithm that retrieves only k data elements having the largest (or smallest) key values from a dataset (i.e., top-k results) in a time linearly proportional to the size of the dataset. The proposed method using the algorithm finds the top-k results using a k-sized min (or max) heap structure that maintains candidate elements of the top-k results by scanning all data elements in the dataset only once. In other words, the present invention provides a linear-time top-k sort method that finds top-k results in a time linearly proportional to the size of the dataset (i.e., O(n) time complexity), while conventional sort algorithms for finding top-k results cannot find the top-k results in a time linearly proportional to the size of the dataset (i.e., at least O(n log n) time complexity). | 10-25-2012 |
20120284286 | Managing a Navigation History - In a mobile terminal, which is able to access resources available over a network, a navigation history is stored. Specifically, the resources are stored in an order in which they are visited by a user, whereby the user can navigate through the stored resources in reverse order by means of a back button. When the stored resources contain a predetermined number of occurrences of a specific resource, the predetermined number being at least two, and the user navigates to the specific resource again, the stored resources between two of said occurrences of the specific resource, and one of said occurrences of the specific resource, are deleted from the stored navigation history. | 11-08-2012 |
20120290588 | REORGANIZING DATABASE TABLES - Techniques are disclosed for reorganizing rows of a database table. In one embodiment, each row is associated with a respective row identifier. A mapping is provided that assigns a logical identifier to each row identifier. Each database index on the database table is configured to use the logical identifier rather than the row identifier. Accordingly, the rows of the database table may be reorganized without having to modify any database index on the database table. | 11-15-2012 |
20120290589 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND NON-TRANSITORY COMPUTER READABLE STORAGE MEDIUM - An information processing apparatus for performing a content search performs search for contents that match a predetermined search condition, generates list data of identification information corresponding to the found contents, wherein identification information corresponding to contents that were newly found while the search is being performed is added to the list data that has been generated so far, in accordance with a sorting condition, repeatedly sorts a sequence of the identification information included in the list data in accordance with a predetermined timing. The identification information corresponding to contents that were newly found is added to the list data without conforming to the sorting condition, from when the sorting was performed by the sorting unit until when the sorting is performed next. | 11-15-2012 |
20120290590 | CONSTRUCTING A PROJECTION FOR STORING DATA - A method for constructing a projection for storing data on a storage device may include causing a processor to extract characteristics of expected output of a query on the data, and to construct a projection for the data based on the extracted characteristics. | 11-15-2012 |
20120303639 | Integrated Media Content Server System and Method for the Customization of Metadata that is Associated Therewith - In a system for the customization of media content metadata, media content metadata includes a plurality of records which are associated with a particular type of media content and each of the records includes a plurality of fields for defining the type of media content. At least one end user device is capable of displaying the media content metadata, and a content server is operable to obtain or receive the metadata from one or more available metadata providers. The content server is also operable to transmit the metadata to the end user device in response to a request from the end user device. A customization scheme is utilized by the content server to customize the quantity of records or the types of fields included within each record which is transmitted to the end user device in response to the request. | 11-29-2012 |
20120310952 | Method and Apparatus for Streaming Netflow Data Analysis - A system and method are described for progressively efficiently filtering and gathering netflow data. Flow records are analyzed to find out which keys (addresses, conversations, protocols etc) meet defined filter parameters. The netflow data is processed and a data structure of fixed size is continually maintained in order to facilitate efficient retrieval of the gathered netflow data. | 12-06-2012 |
20120310953 | SYSTEMS FOR PERFORMING AN EXTERNAL (DISK-BASED) SORT OF A LARGE DATA FILE WHICH TAKE ADVANTAGE OF "PRESORTED" DATA ALREADY PRESENT IN THE INPUT - Systems and programs for improving the efficiency of a sorting process in a computer system are disclosed. Data is provided in an input file external to the central processing unit of the computer system. In one embodiment, the implemented process involves investigating the contents of the input file in order to identify presorted portions thereof; incorporating the identified presorted portions of the input file into a second file external to the central processing unit, performing this step by rearranging directory information, without physically transferring the presorted portions from the input file. In sort processes involving both a string generation phase and a merge phase, the techniques described may be used in either or both phases, as well as in any output phase. Rearranging directory information rather than physically transferring data provides for greater efficiency in disk I/O. | 12-06-2012 |
20120317127 | COHORT DRIVEN SELECTION OF MEDICAL DIAGNOSTIC TESTS - A computer implemented method, system, and/or computer program product create a suggested diagnostic test selection. A description of a current patient includes a current medical complaint, medical history, and physical examination result for the current patient. A cohort for the current patient is made up of persons who have a substantially similar medical complaint, medical history, and physical examination result as the current patient. Past diagnostic test sets used to make correct medical diagnoses for persons in the cohort are identified and stored in a cohort diagnostic test database. The past diagnostic test sets are sorted based on increasing levels of detrimental effects posed by each of the past diagnostic test sets. The sorted diagnostic test sets are then presented to a health care provider for the current patient. | 12-13-2012 |
20120317128 | METHOD AND APPARATUS FOR PROCESSING N SORT QUERIES IN MULTI-RANGE SCAN - Disclosed is a method and an apparatus for optimally processing N sort queries in a multi-range scan, including: allocating a buffer based on a first number of extracted records included in the queries; extracting first data related to first attributes in a first list included in the queries and storing the extracted first data in the buffer; extracting second data related to the first attributes that are not extracted in the first list included in the queries; and updating the buffer so as to satisfy the queries by comparing the data stored in the buffer with the second data, wherein the queries are N sort queries in a multi-range scan for at least one record sorted based on the first attributes and second attributes. | 12-13-2012 |
20120323934 | Rendering Tape File System Information in a Graphical User Interface - A mechanism is provided for rendering tape file system information. The mechanism obtains a list of one or more files residing on a tape in the tape file system from a file directory. The mechanism obtains location information associated with at least one file of the one or more files. Finally, the mechanism renders a representation of the location information with the at least one file. | 12-20-2012 |
20120323935 | AUTOMATIC SYNCHRONIZATION OF MOST RECENTLY USED DOCUMENT LISTS - A most recently used (MRU) client synchronization engine is provided to synchronize a user's most recently used (MRU) document list associated with a client machine with a file hosting server's MRU document list. The file hosting server's MRU document list contains a list of the user's most recently used documents that are stored on the file hosting server. The user's documents that are stored on the file hosting server are accessible to the user on one or more web-enabled client machines. The MRU client synchronization engine analyzes registry data pertaining to the documents that a user uses on the client machine with the file hosting server's MRU document list to determine the user's most recently used documents. | 12-20-2012 |
20120323936 | COMPUTER-IMPLEMENTED METHOD OF ARRANGING TEXT ITEMS IN A PREDEFINED ORDER - A computer-implemented method of and a device, such as a base station for a headset, for arranging text items in a predefined order, comprising storing, in the memory of a peripheral device, a collection of multiple text items arranged in multiple sets of text items and in multiple groups of text items; storing a respective code item with a respective group of text items; and storing a sort key that has values that designate a predefined order of the text items in each set. The sort key is appended to the text items and comprises at least one character with a value within the Private Use range of the Unicode format. | 12-20-2012 |
20120330979 | SORTING A DATASET OF INCREMENTALLY RECEIVED DATA - A method of sorting a dataset includes incrementally receiving data from the dataset, and incrementally storing the received data as individual input data subsets as the data is received, thereby sequentially generating a plurality of filled data subsets of unsorted data. The method includes individually sorting each filled data subset of unsorted data concurrently with receiving data for a next one of the individual input data subsets, thereby sequentially generating a plurality of sorted input data subsets, and performing a merge sort on the plurality of sorted input data subsets, thereby incrementally generating a sorted version of the dataset. | 12-27-2012 |
20130007022 | AUDITING CUSTODIAL ACCOUNTS - According to one embodiment of the present invention, a system for auditing custodian accounts is provided. The system includes a database system receiving customer and custodian information. A sorting processor performs a sort operation on the received customer and custodian information. A customer and custodian matching processor identifies matches between the sorted customer and custodian information. An interface unit outputs information relating to the existence of matches and non-matches between the customer and custodian information. | 01-03-2013 |
20130007023 | System and Method for Consolidating Search Engine Results - Embodiments of the invention relate to query processing and consolidation of query results. Multiple queries may be submitted to one or more search engines, with each query having the same or different returned query items with the same or different sorting arrangement of the returned query items. The returned query items are consolidated into a single sorted set, with the sort being based upon a logical assessment and comparison of the multiple returned query items. | 01-03-2013 |
20130018898 | TRACKING QUERIES AND RETRIEVED RESULTSAANM FORSTMANN; GERDAACI NUSSLOCHAACO DEAAGP FORSTMANN; GERD NUSSLOCH DEAANM MUENCH; STEPHANAACI KARLSRUHEAACO DEAAGP MUENCH; STEPHAN KARLSRUHE DE - Various embodiments of systems and methods for tracking queries and retrieved results are described herein. In one aspect, a first query is associated with a first result set in a first tuple and a second query is associated with a second result set in a second tuple. The first result set is retrieved based on the execution of the first query and the second result set is retrieved based on the execution of the second query. The first and the second tuples are retained in a data structure in the order of execution of the respective queries. The retrieved result sets may be accessed forwards or backwards along the data structure without re-execution of the queries. | 01-17-2013 |
20130054623 | Methods of Tagging an Image with a Database Keyword - A computer-implemented method for tagging a database keyword to a data set or image file having the steps: initiating an act; recording a data set on an electronic device; transmitting the data set to a server; scanning the data set; scanning the database for database information that matches the data set; associating the database information that matches the data set with the matching data set; transmitting a database keyword associated with the database information to the electronic device; tagging the database keyword to a data set file; and imbedding the database keyword into an image file associated with the data set. | 02-28-2013 |
20130060790 | SYSTEM AND METHOD FOR DETECTING OUTLIERS - A system and method for detecting outliers. A method may include selecting, from a first subset of digital objects, a second subset of digital objects, sorting the first subset of digital objects according to a similarity to at least some of the objects included in the second subset, and, designating at least one digital object included in the first subset as an outlier based on the sorting. A similarity value indicative of a level of similarity between an object and a reference object may be associated with the object. A set of objects may be sorted according to their associated similarity values. | 03-07-2013 |
20130066888 | TRACKING CHANGES ACROSS COLLECTION OF DATA TABLES - A system is provided for tracking changes from two or more tables stored in a database management system. The system may enable two or more applications to track changes from two or more tables in the database management system, and may enable one or more tables to be tracked for changes concurrently. The system may be configured to automatically build a change tracking query in order to retrieve tracked changes from a collection of related tables, or an entity, in the database management system. The entity based tracking system may determine the relationships between the tables in the entity, and may generate a relational query based on the determined relationships. The system may automatically construct a union query from the relational query to activate tracking changes across the collection of tables in the database management system. | 03-14-2013 |
20130080452 | ACCESSING AND EDITING VIRTUALLY-INDEXED MESSAGE FLOWS USING STRUCTURED QUERY LANGAUGE (SQL) - At least one message flow file that stores a message flow is read by a processor. The message flow stored within the at least one message flow file is parsed. The message flow is organized within a memory as a message flow database structure. Entries within the message flow database structure represent nodes, connections, and properties used by the message flow. The message flow database structure is edited in response to receipt of a structured query language (SQL) statement that specifies a change to the message flow database structure. | 03-28-2013 |
20130086087 | APPARATUS AND METHOD FOR GENERATING AND RETRIEVING LOCATION-TAGGED CONTENT IN COMPUTING DEVICE - An apparatus and a method for generating and retrieving content in a computing device by operating a computing device, determining a location of the computing device and a place mark corresponding to the location is tagged to content. | 04-04-2013 |
20130097187 | Determining Top N or Bottom N Data Values and Positions - A method includes executing an instruction at a processor, where executing the instruction includes comparing a data value of a plurality of data values to a first element stored at a first location of a storage device. When the data value satisfies a condition with respect to the first element, the method includes moving the first element to a second location of the storage device and inserting the data value into the first location of the storage device. | 04-18-2013 |
20130097188 | SEQUENCED QUERY PROCESSING IN DATA PROCESSING SYSTEM - Techniques for constructing query operations associated with a report specification are described. The query operations may include a mixture of multidimensional operations and relational operations. The application of the query operations are sequenced with the computing device to reduce or eliminate certain complexities and ambiguities during generation of reports, thereby providing an improved experience for user. For example, any multidimensional rollup operation may be applied to the multidimensional representation of the data within a first timeframe and that any aggregation operation and second level filtering are applied within a second timeframe subsequent to the first timeframe. A report may be output based on a resultant data set produced by application of the query operation in accordance with the sequencing. | 04-18-2013 |
20130097189 | SEQUENCED QUERY PROCESSING IN DATA PROCESSING SYSTEM - Techniques for constructing query operations associated with a report specification are described. The query operations may include a mixture of multidimensional operations and relational operations. The application of the query operations are sequenced with the computing device to reduce or eliminate certain complexities and ambiguities during generation of reports, thereby providing an improved experience for user. For example, any multidimensional rollup operation may be applied to the multidimensional representation of the data within a first timeframe and that any aggregation operation and second level filtering are applied within a second timeframe subsequent to the first timeframe. A report may be output based on a resultant data set produced by application of the query operation in accordance with the sequencing. | 04-18-2013 |
20130110850 | MATCHING AN ENTRY OF A LIST TO DATA | 05-02-2013 |
20130110851 | METHOD AND SYSTEM FOR PROVIDING RELATED TECHNOLOGY SERVICE | 05-02-2013 |
20130117286 | Primary Data Storage System with Quality of Service - The invention is directed to a primary data storage system for use in a computer network in which a network allows user computers to transfer data to/from the primary data storage system. In one embodiment, the primary data storage system allows an administrator of the computer network to define two or more volumes on the primary data storage system and define quality of service goals for each volume. The primary data storage system operates so as allocate resources within the primary data storage system to the volumes based upon criticality and performance goals specified for each of the volumes. | 05-09-2013 |
20130144892 | METHOD AND APPARATUS FOR PERFORMING EXTENDED SEARCH - A method and apparatus for performing extended search are provided. The method includes receiving user-inputted keywords; extending the user-inputted keywords according to geographical information to acquire extended keywords; performing a search by using the extended keywords; and returning search results to the user. With the present technical solutions, privilege control can be effectively performed in a cloud storage system. With the present embodiments, more information may be provided to a user for reference. | 06-06-2013 |
20130166575 | DATABASE DISPLAING OR RECORDING EVENTS BY TIME SEQUENCE AND METHOD THEREOF - A database of displaying or recording events by time sequence and a method thereof, particularly a database that displays and records the events with different title data in a single cross-year list are disclosed. The method of displaying and recording the database includes displaying a plurality of time marks through a user interface, sequentially arranging and stacking a plurality of data blocks under the time marks, and each data block includes a title field and a data field, and title data are disposed in the title fields, and a plurality of event data is disposed in the matched data fields of the title data according to event content and time of occurrence and under the time marks, so that the event data indifferent data blocks are compared with one another based on the time marks, so as to improve the convenience of data comparison. | 06-27-2013 |
20130179457 | SYSTEM AND METHOD FOR ORGANIZING, PROCESSING AND PRESENTING INFORMATION - In a method for organizing information in a database, abstractions are separated from expressions of the abstractions to obtain a first set of information corresponding to the abstractions and a second set of information corresponding to at least one set of characteristics relating to the expressions of the abstractions. Each abstraction is arranged within the first set of information hierarchically within the database. Each set of characteristics relating to an expression of an abstraction within the second set of information is associated with an abstraction within the database. | 07-11-2013 |
20130185316 | CONTROLLING ACCESS TO STORED INFORMATION - This document describes, in various implementations, controlling access to information stored in a storage device. The information stored in the storage device is accessed in a desired order without sorting the stored information prior to access. | 07-18-2013 |
20130191402 | Contact management system and method - In an embodiment of a method of providing contact information, the method includes creating a contact record in a contact management system, where a process associated with a subject of the contact record and/or a recipient of data associated with the contact record is included in creating the contact record. A unique serial number is generated corresponding to the contact record and the serial number is conveyed to the recipient. A request by an application is received for the contact record from the contact management system corresponding to the serial number and data associated with the contact record is transmitted to the application. | 07-25-2013 |
20130204883 | COMPUTATION OF TOP-K PAIRWISE CO-OCCURRENCE STATISTICS - Various technologies described herein pertain to computing top-K pairwise co-occurrence statistics using an upper bounding heuristic. Upper bound values of a co-occurrence statistic for items in a set can be computed based on a query item, and items can be sorted into an order. The items and the query item are represented by respective portions of a tensor. An item from the order associated with a highest upper bound value can be selected, an actual value of the co-occurrence statistic can be computed for the selected item, the upper bound value for the selected item can be replaced with the actual value for the selected item, and the selected item can be repositioned in the order. When the top-K items in the order lack an item associated with an upper bound value, the top-K items and actual values of the co-occurrence statistic for the top-K items can be outputted. | 08-08-2013 |
20130218908 | COMPUTING AND APPLYING ORDER STATISTICS FOR DATA PREPARATION - Provided are techniques for generating order statistics and error bounds. For each of multiple, distributed data sources, a finite number of data bins are created for each field in that data source. Data values in each of the multiple, distributed data sources are processed to generate basic summaries for each of the data bins in a single pass of the data values. The data bins from each of the multiple, distributed data sources are sorted. One or more approximate order statistics are computed for a data set by accumulating counts from a number of the sorted data bins. Lower and upper error bounds are provided for each of the computed one or more approximate order statistics, wherein the lower and upper error bounds are values delimiting an interval containing a true value of an order statistic. | 08-22-2013 |
20130218909 | COMPUTING AND APPLYING ORDER STATISTICS FOR DATA PREPARATION - Provided are techniques for generating order statistics and error bounds. For each of multiple, distributed data sources, a finite number of data bins are created for each field in that data source. Data values in each of the multiple, distributed data sources are processed to generate basic summaries for each of the data bins in a single pass of the data values. The data bins from each of the multiple, distributed data sources are sorted. One or more approximate order statistics are computed for a data set by accumulating counts from a number of the sorted data bins. Lower and upper error bounds are provided for each of the computed one or more approximate order statistics, wherein the lower and upper error bounds are values delimiting an interval containing a true value of an order statistic. | 08-22-2013 |
20130218910 | Adaptively Optimizing Order Entry System - A system continuously improves the sensitivity, specificity, precision, and accuracy of treatment ordering templates. A repository of information comprises multiple candidate order sets individually including multiple candidate items for order and associated corresponding related order parameters. An individual item for order is associated with multiple related order parameters. A data entry monitor monitors user selection of candidate items from a candidate order set and records candidate item usage data identifying items selected by a user for order from individual particular candidate order sets for multiple different candidate order sets. A data processor determines from the candidate item usage data at least one of, (a) data indicative of the number or proportion of candidate items of a particular candidate order set that were selected by a user during order entry and (b) data indicative of the number or proportion of candidate items of a particular candidate order set that were not selected by a user during order entry. | 08-22-2013 |
20130232155 | Systems and Methods for Out of Order Data Reporting - The present inventions are related to systems and methods for data processing, and more particularly to systems and methods for out of order reporting of results from data processing. | 09-05-2013 |
20130232156 | SYSTEMS AND METHODS FOR TAGGING A SOCIAL NETWORK OBJECT - Disclosed are methods, apparatus, systems, and computer readable storage media for tagging objects in an online social network. One or more information updates having one or more attributes can be identified. The identified one or more information updates can be associated with one or more tags based on the one or more attributes. Each identified information update can be stored with metadata indicating respective tag associations such that information updates are capable of being sorted and displayed on a display device. In some implementations, data indicating information update sorting based on tag associations can be generated and provided to a display device to display information updates sorted as indicated by the generated data. | 09-05-2013 |
20130238637 | EFFICIENT QUERY PROCESSING ON ORDERED VIEWS - The efficient query processing on ordered views includes: obtaining a view definition for a view for database data; obtaining a query to be executed on the database data; identifying any columns in the view that are unnecessary for the query; after processing any predicates of the query, identifying any sorts in the view definition that are unnecessary or redundant in the query; rewriting the query to eliminate the unnecessary columns and unnecessary and redundant sorts; and executing the rewritten query without materializing the view. Thus, the query is rewritten in a way that avoids materializing the view and eliminates duplicate or unnecessary sorts. This reduces the number of rows to be sorted and eliminates unnecessary columns from materialization. These reductions lead to resource savings, including memory, temporary table space required for sorting, and CPU resources. | 09-12-2013 |
20130262483 | METHOD AND APPARATUS FOR PROVIDING INTELLIGENT PROCESSING OF CONTEXTUAL INFORMATION - An approach is provided for providing intelligent processing of contextual information. An context platform determines at least one feature based, at least in part, on one or more contextual parameters The context platform further processes one or more contextual records to determine whether the at least one feature is a feature anchor based, at least in part, on whether the at least feature is represented above at least one threshold level. The context platform also processes the one or more contextual records to determine at least one profile for the at least one feature anchor. | 10-03-2013 |
20130290352 | CONCATENATION FOR RELATIONS - Methods for generating a query input string include sorting a first input relation and a second input relation in order from the first relation to the second relation. The second input relation is concatenated to the first input relation, and the concatenated input relations are stored in a single string. | 10-31-2013 |
20130290353 | DOCUMENT PROCESSING DEVICE, FILE SERVER MANAGEMENT ASSISTANCE METHOD, AND FILE SERVER MANAGEMENT ASSISTANCE PROGRAM - Provided is a technology of efficiently narrowing down files that may be deletable in a file server, and thus reducing the burden on a user in performing an operation of checking if any of the files are deletable. The technology includes displaying the size distribution/cumulative size of files in the file server, and selectively displaying, among the files in the file server, files that seem to have been carefully stored, files that are suspected to be stored in duplicate, or files that have, if deleted, a highly advantageous effect of reducing the used capacity of the file server. | 10-31-2013 |
20130297624 | Interoperability between Map-Reduce and Distributed Array Runtimes - Described is a technology by which Map-Reduce runtimes and distributed array runtimes are interoperable. Map-Reduce chunks are processed into array data for processing in a distributed array runtime based upon merge information. A staging Map-Reduce job tags a chunk with tag information that indicates a relative position of the chunk in an array. A distributed array framework imports files produced via a Map-Reduce framework and provides an array to an application of the distributed array framework for processing. An export mechanism may output one or more Map-Reduce files from the distributed array framework. | 11-07-2013 |
20130311488 | Time Stamp Bounded Addition of Data to an Append-Only Distributed Database Table - A method implemented by a computer includes receiving a segment of data that has a time dimension, where the time dimension of the segment of data is bounded by a start time stamp and an end time stamp. The segment of data is added to an append-only database table of a distributed database. The addition operation imposes an inherent data order based upon the start time stamp and end time stamp without the manual definition of a database table partition in the distributed database. | 11-21-2013 |
20130318105 | APPARATUS AND METHOD FOR INTEGRATING APPLICATIONS INTO A COMPUTERIZED ENVIRONMENT - A method and apparatus for automatically suggesting further applications to a user using an executed application in a computerized environment, comprising receiving metadata provided by the executed application; searching an index for suggested applications which receive as input the data provided by the executed application; assigning a priority for each of the suggested applications; sorting the suggested applications according to the priority; and displaying to the user a list comprising the applications that received the highest priorities. | 11-28-2013 |
20130346425 | METHOD AND SYSTEM FOR SORTING DATA IN A CLOUD-COMPUTING ENVIRONMENT AND OTHER DISTRIBUTED COMPUTING ENVIRONMENTS - The current document is directed to a method and system for data processing in cloud-computing environments and other distributed-computing environments. Implementations of a merge sort suitable for the sorting of data within cloud-computing environments and other distributed-computing environments are disclosed. These implementations takes advantage of the massive parallelism available in cloud-computing environments as well as take into consideration numerous constraints regarding data-storage and data-retrieval operations in a cloud-computing environment. The implementations provide a type of data-sorting method and system that iteratively carries out highly parallel merge-sort operations that can be effectively applied over a range of data-set sizes up to extremely large data sets. | 12-26-2013 |
20140052742 | Dynamically-Sorted Contact Information - In one embodiment, a computer system accesses for a first user contact information of one or more second users. The computer system then determines one or more contemporaneous attributes of the first user, determines one or more contemporaneous attributes of each of the second users, and then dynamically sorts the contact information of the second users based at least on the contemporaneous attributes of the first user and the contemporaneous attributes of the second users. The computer system then provides the sorted contact information of the second users for display to the first user. | 02-20-2014 |
20140059059 | Global Media Lists For Mobile Devices - Systems and methods are disclosed for sharing global lists of media content among multiple apps executing on various client devices. A global list can include a plurality of records for media, each of which can include pointers to media stored elsewhere, a unique identifier for the media, a list identifier for the media, and/or metadata for the media. The global list can be accessed, modified, shared, aggregated, organized, etc. using different apps. These different apps may include apps developed by different developers, apps produced by different companies, apps offered for download by different companies, apps that perform different functions, etc. | 02-27-2014 |
20140081997 | SOCIALLY COLLABORATIVE FILTERING - In one embodiment, a method comprises identifying user selection preferences of an identified user having accessed the network, the identifying based on an accumulation of user selection inputs executed by the identified user, relative to input options presented to the user and identifying respective available network items, the accumulation including an identification of the input options not having been selected by the identified user; determining a group of network users having a highest correlation of shared interests with the identified user, based on identifying preferred network items for the identified user, and identifying first network users providing highest relative user affinity values for each of the preferred network items; and determining at least one of new network items most likely to be preferred by the identified user, based on determining, from among network items not presented to the identifier user, the preferred network items for each of the first network users in the group. | 03-20-2014 |
20140089331 | INTEGRATED ANALYTICS ON MULTIPLE SYSTEMS - The embodiments provide a federated system for supporting an application to perform analytics. The federated system includes a first distributed system for performing one or more first tasks including processing incoming data into a set of data blocks, an in-memory database system for performing one or more second tasks including receiving the set of data blocks from the first distributed system and storing the set of data blocks in an internal storage, and a second distributed system for performing one or more third tasks including receiving at least one data block of the set from the in-memory database system and performing analytics on the at least one data block. Execution of the first, second, and third tasks are controlled via a scripting language utilized by the application and associated with the in-memory database system. | 03-27-2014 |
20140101174 | ELECTRONIC DEVICE AND MULTIMEDIA FILE SORTING METHOD - A multimedia file sorting method for use in an electronic device is provided. The method has the following steps of: retrieving time information and location information of multimedia files stored in the electronic device; filtering the multimedia files according to the retrieved time information and the retrieved location information; and sorting the multimedia files into multiple groups according to similarities within both the retrieved time information and the retrieved location information. | 04-10-2014 |
20140101175 | SYSTEM AND METHOD FOR SORTING DATA - A method and apparatus that enables a user to sort data from one or more sample lots, which may be obtained via a network, such as the Internet, into a composite parameter structure. The composite parameter structure is a function of one or more parameters corresponding to one or more characteristics associated with one or more sample lots. The composite parameter structure representation may be printed, stored, or transmitted to another location. A server device that is coupled and working in conjunction with a client device may implement the present invention. | 04-10-2014 |
20140108433 | Ordered Access Of Interrelated Data Files - A computer implemented method and system for interrelating and providing ordered access to source data files (SDFs) is provided. Each SDF contains one or more records. A parsing component compiles a configuration language (CL) and generates file descriptors usable by an interlinear sort component (ISC) and an interrelated data access component (IDAC). The CL defines adopt and order key fields, a lineage relationship between the SDFs, and one or more predetermined subprograms. The subprograms process an instance of a record from a SDF and a start point and an end point of a sequence or a subsequence of related records from the SDF. The ISC sorts each SDF into the order defined in the CL and attaches a parent position number (PPN) to each child file record. The IDAC uses the PPN to access the sorted SDFs in the order defined by the CL and execute the defined subprograms. | 04-17-2014 |
20140114990 | BUFFER ORDERING BASED ON CONTENT ACCESS TRACKING - Embodiments are disclosed that relate to buffering portions of a digital content item in different orders for different users. For example, one disclosed embodiment provides a method of providing a buffer ordering for a digital content item. The method includes tracking content access information for each user of a plurality of users, the content access information for each user comprising information regarding how content portions of each of one or more digital content items were accessed by the user. The method further comprises providing a different buffer ordering for a first user of a selected digital content item than for a second user based upon the content access information. | 04-24-2014 |
20140122508 | SYSTEMS AND METHODS FOR SECURE STORAGE OF USER INFORMATION IN A USER PROFILE - Systems and methods are provided for securely storing information of a user in a user profile to prevent access to the information and minimize the amount of information disclosed during a security breach. Information pertaining to a user is obtained from one or more sources and organized into a user profile and securely stored in a database. The user profile may be stored remotely in a cloud-based system at a remote encrypted server, with portions of the profile stored in separate locations with separate encryption to minimize the risk of unauthorized access to one portion of the information. The fields of data in the user profile may also be separately encrypted with separate encryption keys and separately stored in separate databases to minimize the amount of information which could be disclosed by the unauthorized access to a single encryption key or a single database. | 05-01-2014 |
20140129574 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, STORAGE MEDIUM, AND PROGRAM - An information processing apparatus is disclosed which includes: a storing element for storing content data; a managing element for managing preference data by which to determine preferences of a user; a reading element for reading the content data from the storing element in response to an instruction from the user; a sorting element for sorting the content data read by the reading element, in accordance with the preference data managed by the managing element; and a composing element for composing the content data sorted by the sorting element, into a single item ready to be handled by the user. | 05-08-2014 |
20140143260 | Tabular Data Sorting and Display - A method and apparatus, including a computer program product, implementing techniques for displaying a table of data including a set of markers associated with rows or columns of the table, the table having one or more sort keys having a sort key order including a most significant sort key, each sort key being a row or column of the table; receiving a user input gesture selecting a marker; establishing the row or column associated with the user-selected marker as the most significant sort key, and maintaining the positions of the remaining sort keys in the sort key order; sorting the data using the sort key order; and displaying the sorted data. The techniques also include representing visually a sort key order for a table of data by displaying on a graphical user interface display one or more markers with a pattern of distinct visual properties. | 05-22-2014 |
20140143261 | AUTOMATED SEMANTIC ENRICHMENT OF DATA - A computer receives real time equipment activity data, in an equipment interface protocol, from a manufacturing device. The computer reads commands from a computer file in a special purpose language and performs actions on the equipment activity data in accordance with the commands. Wherein the commands include one or more read commands for parsing the received equipment activity data in accordance with the equipment interface protocol. Wherein the commands include logic commands for conditionally performing a determination of output protocol, metadata to be added, additional data to be added, numerically and textually manipulations, identification, filtering, organizing, and buffering of data. Wherein the commands incorporate include commands for retrieving and adding data to the output data. Wherein the commands include one or more directives commands for inserting content containing executable commands or text. Wherein the commands incorporate build commands for creating the output data in accordance to the output protocol. | 05-22-2014 |
20140164402 | EFFICIENT SORTING OF LARGE DIMENSIONAL DATA - Various embodiments sort data. In one embodiment, a matrix D including a set of data values is received. A matrix Q is received, and includes a set of columns and a set of rows. The matrix Q further includes a sorting of each column of the matrix D. Each of these rows corresponds to a sorting. Each of a set of values in each of the set of columns in the matrix Q identifies a row in the matrix D. At least one sub-matrix D′ of the matrix D is identified. A set of columns of the sub-matrix D′ is restricted to one or more columns of the matrix D. A processor sorts the sub-matrix D′ by rows based on the sorting of the set of columns of the matrix D as given in the matrix Q, and based on the set of data values in the matrix D. | 06-12-2014 |
20140164403 | System And Method For Generating Media Bookmarks - Disclosed herein are systems, methods, and computer-readable media for transmedia video bookmarks, the method comprising receiving a first place marker and a second place marker for a segment of video media, extracting metadata from the video media between the first and second place markers, normalizing the extracted metadata, storing the normalized metadata, first place marker, and second place marker as a video bookmark, and retrieving the media represented by the video bookmark upon request from a user. Systems can aggregate video bookmarks from multiple sources and refine the first place marker and second place marker based on the aggregated video bookmarks. Metadata can be extracted by analyzing text or audio annotations. Metadata can be normalized by generating a video thumbnail representing the video media between the first place marker and the second place marker. Multiple video bookmarks may be searchable by metadata or by the video thumbnail visually. | 06-12-2014 |
20140188906 | Hash Table and Radix Sort Based Aggregation - Aggregation of an in-memory database includes receiving, by at least one processor having a plurality of threads, input having records stored in random access memory, distributing, by the at least one processor, the input into portions, one of the plurality of threads having an assigned portion, aggregating, by the at least one processor, the records in the assigned portion based on locality of keys in the records and outputting, by the at least one processor, the aggregated records into a global hash table. | 07-03-2014 |
20140188907 | DISPLAYING SORT RESULTS ON A MOBILE COMPUTING DEVICE - Technologies for displaying sort results on a computing device includes determining a plurality of sort criteria of the set of data items to be sorted and associating a visual property to each sort criteria. A sort priority of sort criteria may also be determined. The set of data items are sorted based on the sort criteria and sort priority. The sort result is displayed using the visual properties of identify the sorting order of each corresponding sort criteria. The visual properties may include, for example, the display location, size, color, animation, or other visual aspect of the data items. | 07-03-2014 |
20140188908 | RADIX SORT WITH READ-ONLY KEY - Methods and arrangements for a radix sort with a read only key. A plurality of keys are received, an array and a link table are populated for the first digit of the keys based upon the keys; and an array and a link table are populated for each successive digit of the keys based upon the array and link table populated for the preceding digit of the keys. Embodiments may be implemented in both hardware (FPGAs, ASICs, information handling devices, etc.) and software. Other embodiments are also disclosed and claimed. | 07-03-2014 |
20140188909 | RADIX SORT WITH READ-ONLY KEY - Methods and arrangements for a radix sort with a read only key. A plurality of keys are received, an array and a link table are populated for the first digit of the keys based upon the keys; and an array and a link table are populated for each successive digit of the keys based upon the array and link table populated for the preceding digit of the keys. Embodiments may be implemented in both hardware (FPGAs, ASICs, information handling devices, etc.) and software. Other embodiments are also disclosed and claimed. | 07-03-2014 |
20140188910 | DETERMINING RELIABILITY OF ONLINE POST - Technologies are generally described for determining a reliability of an online post. In some examples, a method may include identifying from an online post at least one word associated with a place, identifying a location from which the online post was posted, and determining a reliability of the online post based at least in part on the identified word associated with the place and the identified location from which the online post was posted. | 07-03-2014 |
20140201220 | COMMUNICATION VIA JOINING THE CONVERSATION - A method substantially as shown and described the detailed description and/or drawings and/or elsewhere herein. A device substantially as shown and described the detailed description and/or drawings and/or elsewhere herein. | 07-17-2014 |
20140222837 | AUTOMATED QUALITY TOOL FOR MONITORING OF SAMPLES IN A HIGH-THROUGHPUT ASSAY - Computer systems and associated computer-implemented methods designed to monitor and mitigate the risk of reporting false positive results for high-throughput assays performed in or prepared in multi-well format plates (e.g., 96 well plates). Such computer systems and methods provide a quality-control program to automatically monitor and detect false-positive results based identifying samples in a multi-well assay format having low detected concentrations of a selected analyte that are in close proximity to samples having extremely elevated concentrations of the selected analyte. | 08-07-2014 |
20140222838 | GENERATING A COMBINED DATA RECORD - A terminal supporting apparatus | 08-07-2014 |
20140236970 | REFRESHING WIRELESS CARRIERS' LICENSE DATA - The FCC license data for wireless spectrum is publicly available information. By processing the data, user interfaces are presented to better understand how specific license data relates to each carrier's spectrum ownership within a frequency band and within a market. | 08-21-2014 |
20140244668 | Sorting and Filtering a Table with Image Data and Symbolic Data in a Single Cell - An Image Based Document Management (IBDM) server includes a table generator, a symbolic representation module and a sort engine. The table generator generates a table from the form images, the table comprising cells with data types including image data, symbolic data, image and symbolic data and an empty value, and updates the table. The symbolic representation module converts at least one of the cells with image data to symbolic data. The sort engine determines, from a sort request for a column of the table received from a user, at least a first priority for a first data type, the column including at least two of the data types, determines from the sort request a second priority within one of the data types, and sorts the column according to the sort request. | 08-28-2014 |
20140280244 | LOCALE-BASED SORTING ON MOBILE DEVICES - Embodiments are directed to implementing locale-based sorting and to creating temporary metadata sorting values. In one scenario, a computer system sends a request for a contact list, where the request includes an indication of the user's locale. The contact list includes contact information for contacts of a specified user. The computer system receives the requested contact list, which includes various portions of appended, locale-specific sorting metadata for at least one of the user's contacts' fields. The computer system then sorts the contacts of the contact list according to the selected sorting criterion using the sorting metadata, where the sorting metadata includes a sorting order specific to the user's locale. After the contacts are sorted, the computer system presents the sorted contacts to the user in a user interface. | 09-18-2014 |
20140280245 | SYSTEM AND METHOD TO VISUALIZE USER SESSIONS - A system and method operable to identify and analyze persistent state information among a plurality of software-related events, and present persistent state information in a unified fashion. | 09-18-2014 |
20140280246 | DOMAIN-SPECIFIC SYNTAX TAGGING IN A FUNCTIONAL INFORMATION SYSTEM - The invention relates to systems and methods using a logical data model for aggregating data entities in a functional information system supported upon a computing platform, and also for providing systems and methods for analyzing economic information using a functional coordinate system. | 09-18-2014 |
20140280247 | TECHNIQUES FOR DATA RETRIEVAL IN A DISTRIBUTED COMPUTING ENVIRONMENT - Enhanced techniques for data retrieval in a distributed computing environment are described. A computing node of a distributed computing environment may receive a data request. The computing node may include one or more subsets of data. The computing node may be configured to search among the one or more subset of data for a beginning of a data range that is responsive to the data request. The computing node may be further configured to forward a data range responsive to the search to another computing node of the distributed computing system to be merged with one or more additional data ranges. Other embodiments are described and claimed. | 09-18-2014 |
20140289263 | MANAGEMENT OF THUMBNAIL DATA ASSOCIATED WITH DIGITAL ASSETS - According to example configurations, a digital asset manager receives a digital asset. The digital asset manager generates multiple sets of thumbnail data based on the digital asset. Each of the multiple sets of thumbnail data can be encoded to support display of a different thumbnail resolution of the digital asset. The digital asset manager initiates storage of the multiple sets of thumbnail data in a unit of storage of a repository. The unit of storage can be pre-allocated for storing the multiple sets of thumbnail data associated with the digital asset. Accordingly, in lieu of storing data for each thumbnail in a different file as in conventional methods, configurations herein can include storing thumbnail data in the same unit of storage or file. Thus, multiple sets of thumbnail data for a corresponding digital asset can be stored in a single file. | 09-25-2014 |
20140297660 | FACILITATING USER INCIDENT REPORTS - With a computer processor, access is obtained to a sorted global tuple list of incident types, each tuple of which includes at least an incident identifier, a corresponding incident type, a corresponding context, and a corresponding impact factor. The latter specifies importance of solving the corresponding incident type in the corresponding context. Each tuple of the global tuple list is sorted by decreasing order of impact factor. At the computer processor, context information is obtained for at least one remote computing device; based on the context information and the sorted global tuple list, the computer processor sends, over a telecommunications infrastructure, data which causes an incident reporting display on the remote computing device to be re-ordered in accordance with the impact factors as they are ranked in accordance with the context information for the at least one remote computing device. | 10-02-2014 |
20140297661 | FACILITATING USER INCIDENT REPORTS - With a computer processor, access is obtained to a sorted global tuple list of incident types, each tuple of which includes at least an incident identifier, a corresponding incident type, a corresponding context, and a corresponding impact factor. The latter specifies importance of solving the corresponding incident type in the corresponding context. Each tuple of the global tuple list is sorted by decreasing order of impact factor. At the computer processor, context information is obtained for at least one remote computing device; based on the context information and the sorted global tuple list, the computer processor sends, over a telecommunications infrastructure, data which causes an incident reporting display on the remote computing device to be re-ordered in accordance with the impact factors as they are ranked in accordance with the context information for the at least one remote computing device. | 10-02-2014 |
20140324889 | EXECUTING USER-DEFINED FUNCTION ON A PLURALITY OF DATABASE TUPLES - According to an example, in a method for executing a user-defined function on a plurality of database tuples, the user-defined function and an analysis function may be obtained. In addition, the plurality of database tuples may be divided into parts by a processor, the processor may be caused to execute the analysis function on each of the parts, and the processor may be caused to execute the user-defined function on at least one of the parts for which the analysis function returned a true predicate. | 10-30-2014 |
20140324890 | Data Driven Parallel Sorting System and Method - A data driven parallel sorting method includes distributing input data records to n partitions one by one in a circular manner. Each partition corresponds to a parallel sorting process with an allocated memory chunk sized to store m data records. The method also includes sorting, in parallel, current data records in respective memory chunks in respective partitions. The method also includes in response to distribution of data records of └m/n┘ rounds, circularly controlling one of the n partitions, and writing data records that have been sorted in the memory chunk of the partition into a mass storage as an ordered data chunk, and emptying the memory chunk. The method also includes in response to all data records being distributed, writing data chunks that have been sorted in respective memory chunks into the mass storage, and performing a merge sort on all ordered data chunks in the mass storage. | 10-30-2014 |
20140337361 | USER-SPECIFIC FEED GENERATION SYSTEM - Techniques are disclosed for generating a web-based user content feed given a set of sort and filter criteria. Upon receiving such criteria from a client web browser application, a feed server merges a first feed object and a second feed object having subsets of metadata deriving from a feed item table in the database. The feed server performs the sort, filter, and search operations on the sortable list and retrieves the full metadata from the database. The feed server returns the result to the client web browser application, which displays the content feed to a user. | 11-13-2014 |
20140337362 | MERGING OF SORTED LISTS USING ARRAY PAIR - The formulation of a merged sorted list from multiple input sorted lists in multiple phases using an array pair. Initially, the first array is contiguously populated with the input sorted lists. In the first phase, the first and second input sorted lists are merged into a first intermediary merged list within the second array. Each subsequent phase merges a prior intermediary merged list resulting from the prior phase and, a next input sorted list in the first array to generate a next intermediary merged list, or a merged sorted list if there or no further input in the first array. The intermediary merged lists alternate between the first array and the second array from one phase to the next phase. | 11-13-2014 |
20140344291 | Tabular Data Sorting and Display - A method and apparatus, including a computer program product, implementing techniques for displaying a table of data including a set of markers associated with rows or columns of the table, the table having one or more sort keys having a sort key order including a most significant sort key, each sort key being a row or column of the table; receiving a user input gesture selecting a marker; establishing the row or column associated with the user-selected marker as the most significant sort key, and maintaining the positions of the remaining sort keys in the sort key order; sorting the data using the sort key order; and displaying the sorted data. The techniques also include representing visually a sort key order for a table of data by displaying on a graphical user interface display one or more markers with a pattern of distinct visual properties. | 11-20-2014 |
20140344292 | Population of Context-Based Data Gravity Wells - A method and/or system sorts data into data gravity wells on a data gravity wells membrane. A hashing logic executes instructions to convert raw data into a first logical address and first payload data, wherein the first logical address describes metadata about the first payload data. A hardware XOR unit compares the first logical address to a second logical address to derive a Hamming distance between the first and second logical addresses, wherein the second logical address is for a second payload data. A hardware data vector generator creates a data vector for the second payload data, wherein the data vector comprises the Hamming distance between the first and second logical addresses. A hardware data vector sorter then sorts data vectors into specific hardware data gravity wells on a data gravity wells membrane according to the Hamming distance stored in the data vector. | 11-20-2014 |
20140344293 | INFORMATION PROVIDING DEVICE, INFORMATION PROVIDING METHOD, PROGRAM, INFORMATION STORAGE MEDIUM, AND INFORMATION PROVIDING SYSTEM - A plurality of items of data, each having a plurality of items of attribute information, are sorted in order of most comprehensively satisfying conditions relating to the plurality of items of attribute information. An information providing server includes a single sorting unit that calculates, for each of the plurality of items of data having the plurality of items of attribute information and included in a data group, an evaluation value for sorting the data group based on a sort key designated for one of the plurality of items of attribute information. The information providing server includes a multiple sorting unit that sorts the data group based on a plurality of multiple evaluation values that are calculated, for respective items of data included in the data group, based on the evaluation values and the respective weights of the plurality of sort keys, each of the evaluation values being calculated. | 11-20-2014 |
20140351272 | HANDLING CHANGES IN AUTOMATIC SORT - In an example embodiment, a tri-state variable associated with a table in a database indicates whether the table is automatically sorted at runtime or left unsorted. The value of the tri-state variable also indicates whether code associated with the table assumes the table will be sorted at runtime. In a situation where two parties have code that utilize the table, when the first ensures its code to no longer assumes the table will be sorted, they may set the value of the tri-state variable from automatic sorting enforced to automatic sorting recommended. In this state the table will still be automatically sorted at runtime. When the second ensures its code no longer assumes the table will be sorted, they may set the value of the tri-state variable from automatic sorting recommended to no automatic sort at which time the table is left unsorted. | 11-27-2014 |
20140372456 | METHOD AND SYSTEM FOR BIN COALESCING FOR PARALLEL DIVIDE-AND-CONQUER SORTING ALGORITHMS - A system and method for performing sorting. The method includes partitioning a plurality of keys needing sorting into a first plurality of bins, wherein the bins are sequentially sorted. The plurality of keys is capable of being sorted into a sequence of keys using a corresponding ordering system. The method includes coalescing a first pair of consecutive bins, such that when coalesced the first pair of bins falls below a threshold. The method also includes ordering keys in the first coalesced pair to generate a first sub-sequence of keys in the sequence of keys. | 12-18-2014 |
20140372457 | METHOD AND DEVICE FOR PROCESSING DATA - A method and device for processing data in the field of data process are disclosed. The method includes: sorting samples according to primary keys, wherein the primary key includes a feature serial number and a sample serial number, and wherein a column value corresponding to the primary key is used as a feature value for the sample; acquiring a statistic of each feature in each category by taking the primary key and the feature value as an input key-value pair and calculating with a first algorithm model, and outputting the feature serial number and the statistic as an output key-value pair; and acquiring a contribution value of each feature to the category by performing calculation on the output key-value pair with a second algorithm model, and selecting a feature based on the contribution value. The device includes a sorting module, a first processing module and a second processing module. | 12-18-2014 |
20140379735 | RECONFIGURABLE SORTER AND METHOD OF SORTING - Disclosure is related to a reconfigurable sorter and a method of sorting using the sorter. The reconfigurable sorting method is adapted to the sorter essentially consisting of multiple serially-connected comparison units. The each comparison unit includes two registers. The sorter is particularly a reconfigurable device according to the number of sorted numerals. According to the exemplary embodiment, an input mode is initiated firstly. Initial values are set to the registers. The numerals are sequentially inputted to the registers. At the input mode, the values in the registers may be shifted if necessary and mutually compared in every comparison unit. The values in the registers of every comparison unit may be swapped based on the comparison. At output mode, the numerals are outputted sequentially. The values in the registers are shifted and swapped until all numerals are completely outputted. The output appears the sorted numerals with low timing latency. | 12-25-2014 |
20150012549 | SORTING METHOD OF DATA DOCUMENTS AND DISPLAY METHOD FOR SORTING LANDMARK DATA - A sorting method of data documents is provided, adapted to an electronic device. The sort method includes the following steps: retrieving a plurality of keywords from contents of a plurality of data documents; retrieving corresponding keyword rankings of the plurality of keywords by a search engine; searching corresponding keyword categories of the plurality of keywords; and generating a sort algorithm based on the plurality of keywords, the keyword ranking and the keyword category of each of the plurality of keywords, and a current ranking of each of the plurality of data documents, wherein the sort algorithm is used to calculate a predicting ranking of another data document and to sort the another data document. | 01-08-2015 |
20150019574 | OBJECT PLACEMENT DEVICE AND METHOD, AND COMPUTER PROGRAM - Disclosed is an object placement device and the like that enable to determine an approximate balance in quantity of objects which should be placed in each related placement destination (PD) with a relatively simple processing configuration when a plurality of objects is placed in individual PDs, and the objects that must be moved can be kept to a minimum when PDs increase or decrease. This object placement device | 01-15-2015 |
20150046474 | Image Analysis - Mechanisms for displaying an ordered sequence of images are provided. The mechanisms receive a search query as input from a user. The search query includes a start point and an end point of a virtual tour. The start point and the end point determine a boundary of the virtual tour. Based on the search query, images that are within the boundary of the virtual tour defined in the search query are collected. At least a subset of the collected images are displayed in an ordered sequence in accordance with the boundary of the virtual tour. | 02-12-2015 |
20150046475 | HARDWARE IMPLEMENTATION OF A TOURNAMENT TREE SORT ALGORITHM - Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator. The method includes receiving a plurality of key values by the hardware accelerator, storing each the plurality of keys into a location on a memory of the hardware accelerator, and creating a pointer to each of the locations of the plurality of keys. The method also includes storing the pointer to each of the plurality of keys into a first array stored by the hardware accelerator, sorting the plurality of keys by ordering the pointers in the first array and by using a second array for storing the pointers, wherein the sorting identifies a winning key from the plurality of keys in the memory, and outputting the winning key. | 02-12-2015 |
20150046476 | TUNABLE HARDWARE SORT ENGINE FOR PERFORMING COMPOSITE SORTING ALGORITHMS - Embodiments include methods, systems and computer program products for performing a composite sort on a tunable hardware sort engine includes determining desired sort performance parameters, configuring a composite sort engine based on the desired sort performance parameters, and receiving a plurality of keys having a payload associated with each of the plurality of keys. The method also includes reserving DRAM storage for each of the payloads, generating a tag for each of the plurality of keys, the tag identifying the DRAM storage reserved for each of the payloads, and storing the payloads in the portions of the DRAM storage. The method further includes generating a composite key for each of the plurality of keys, sorting the composite keys by the composite sort engine, and retrieving the payloads associated with the sorted composite keys from the DRAM storage. The method also includes outputting the payloads associated the sorted composite keys. | 02-12-2015 |
20150046477 | METHOD AND SYSTEM FOR DATA STRUCTURE CREATION, ORGANIZATION AND SEARCHING USING BASIC ATOMIC UNITS OF INFORMATION - A computer-implemented method for organizing data using basic atomic units of information includes generating an object of interest (OI) comprising an OI name and an OI description. The OI is a basic atomic unit of information. The OI comprises an audience and data associated with the OI is searchable. The method includes assigning one or more characteristics to the OI. The one or more characteristics of the OI are searchable. A first OI is linked with one or more second OIs having at least one overlapping audience or characteristic. The second OI is accessible by a link displayed in the first OI. The first OI is displayed in a visual format that is accessible to a plurality of users. | 02-12-2015 |
20150058365 | MANAGING A DATA SET - A method of and system for managing a data set of a storage facility is disclosed. The data set may be a sequential-access data set. The method and system may include structuring the sequential-access data set to have a first group-of-records configured for adding a second group-of-records to the sequential-access data set. The method and system add a second group-of-records to the sequential-access data set. The method and system merge the second group-of-records with the first group-of-records in response to a triggering event. The method and system establish, in response to merging the second group-of-records with the first group-of-records, a marker configured to indicate the first and second group-of-records, as merged, is sorted. | 02-26-2015 |
20150095351 | Dynamic Shuffle Reconfiguration - A method includes receiving a request to perform a shuffle operation on a data stream, the request including a set of initial key ranges: generating a shuffler configuration that assigns a shuffler from a set of shufflers to each of the initial key ranges; initiating the set of shufflers to perform the shuffle operation on the data stream; analyzing metadata statistics to determine whether a shuffler configuration update event occurs, the metadata statistics produced by the set of shufflers during the shuffle operation and indicating load statistics for each shuffler in the set of shufflers; and upon occurrence of the shuffler configuration update event and during the shuffle operation, altering the shuffler configuration based at least in part on the metadata statistics to produce an assignment of shufflers to key ranges that is different from the assignment of shufflers to the initial key ranges. | 04-02-2015 |
20150095352 | Systems and Methods for Sharing Verified Identity Documents - A method for sharing verified identity documents is disclosed. The method is performed at one or more electronic devices. The client device obtains identity information of a user and a document. The client device extracts identity information from the document. The client device determines that the identity information of the user and the extracted identity information substantially match, and generates at least one verification rating for the document. The client device sends the document, the data extracted from the document, and the at least one verification rating to a server system remote from the client device. This information is then provided by the server system to another party upon approval by the user to share the information with that party. | 04-02-2015 |
20150095353 | RULE-BASED SYSTEM AND METHOD TO ASSOCIATE ATTRIBUTES TO TEXT STRINGS - A method implemented in a data processing system includes receiving a plurality of text strings. A plurality of rules are applied to the text strings. If a condition specified in one of the rules exists in a given text string, one or more attributes are associated to that text string as metadata. One or more of the text strings are selected, using the metadata, as a potential title for the content. A final title is prepared based on the potential title, and the content is published online under the final title. | 04-02-2015 |
20150100592 | Persistent Shuffle System - A method includes receiving a request to perform a shuffle operation on a data stream; receiving at least a portion of the data stream including a plurality of records, each including a key; storing each of the plurality of records in a persistent storage location assigned to a key range corresponding to keys included in the plurality of records; receiving a request from a consumer for a subset of the plurality of records including a range of keys; and upon receiving the request from the consumer, providing the subset of the plurality of records including the range of keys from the one or more persistent storage locations. | 04-09-2015 |
20150106392 | PLANAR GRAPH GENERATION DEVICE AND METHOD - A planar graph generation device that includes a processor that executes a process. The process includes: computing a specific value, including components of a value representing complexity of a track of the given track data, and a value representing a non-nearness between the given track data and each of all the other track data; selecting the track data with the smallest specific value among the collection; a first portion of the first track or a second portion of the second track positioned within the specific distance of each other, or a combination of the first portion and the second portion, is approximated to a specific portion such that a track of the addition target track data after addition passes through the specific portion in cases in which there are portions positioned within the specific distance of each other in a combination of the first track with the second track. | 04-16-2015 |
20150120762 | COMPARISON-BASED ACTIVE SEARCHING/LEARNING - A method is provided for performing a content search through comparisons, where a user is presented with two candidate objects and reveals which is closer to the user's intended target object. The disclosed principles provide active strategies for finding the user's target with few comparisons. The so-called rank-net strategy for noiseless user feedback is described. For target distributions with a bounded doubling constant, rank-net finds the target in a number of steps close to the entropy of the target distribution and hence of the optimum. The case of noisy user feedback is also considered. In that context a variant of rank-nets is also described, for which performance bounds within a slowly growing function (doubly logarithmic) of the optimum are found. Numerical evaluations on movie datasets show that rank-net matches the search efficiency of generalized binary search while incurring a smaller computational cost. | 04-30-2015 |
20150127666 | PROCESSING A DATABASE TABLE - Processing a database table comprises receiving a multi-dimensional processing instruction for processing at least two columns of the database table, wherein the two columns comprise a selection column and a sort column, wherein the multi-dimensional processing instruction is for selecting a plurality of candidate rows by sorting based on the selection column and the sort column. An index takes the selection column as master column and the sort column as slave column. Nodes in the index are selected according to the selection column. Each of the selected nodes is associated with a respective slave column value sequence. A merge sort is performed on each of the slave column value sequences to obtain a sort result for the candidate rows. | 05-07-2015 |
20150127667 | Devices and Methods for Processing Network Nodes - Devices and methods are provided for processing network nodes. For example, a sorting request is detected; one or more first network nodes to be sorted are acquired corresponding to the sorting request; a first characteristic matrix is constructed based on at least information associated with the first network nodes; association information between the first network nodes is acquired; a sparse matrix is constructed based on at least information associated with the association information between the first network nodes; iterative multiplication is performed on the sparse matrix and the first characteristic matrix to obtain a second characteristic matrix upon convergence; and the first network nodes are sorted based on at least information associated with the second characteristic matrix. | 05-07-2015 |
20150293943 | METHOD FOR SORTING MEDIA CONTENT AND ELECTRONIC DEVICE IMPLEMENTING SAME - A method of sorting a media content is provided. The method includes receiving at least one search word, extracting at least one media content based on the received search word, identifying a user's selection for the extracted media content, generating a group, and including the at least one media content in the group based on the identified user's selection. | 10-15-2015 |
20150293974 | Dynamic Partitioning of Streaming Data - A real time data analysis and data filtering system for managing streaming data is presented. The method breaks a stream of data into a set of queues that are themselves streaming data but that are handled separately by unique processing steps. The queues are dynamically created on an as needed basis based on inspection of the data. In this manner the speed and efficiency of parallel processing is applied to serially streaming data. A method of filtering the data to present the new streaming data queues is also described. The method makes use of keys that are used to filter the data stream into individual queues. In another embodiment a pre-processing step includes creation of keys and insertion of keys into the streaming data to enable subsequent data mining to be accomplished on a less powerful computing device. | 10-15-2015 |
20150302112 | Generating Probabilistic Transition Data - Systems and methods are presented for generating a transition graph from check-in data for determining probabilistic transitions of a user from an origin (location) to a destination. Check-in data for a plurality of users is obtained. The check-in data is organized and analyzed to determine a set of transition tuples for each of the plurality of users. These transition tuples are aggregated and used to generate a transition graph comprising a plurality of nodes and edges. Each node corresponds to a location and each edge indicates a transition from an origin node to a destination node and is associated with a likelihood of a user transitioning from the origin node to the destination node. | 10-22-2015 |
20150317318 | DATA STORE QUERY PREDICTION - Predicting a data store query can include receiving a portion of a natural language query including a first set of characters. Predicting a data store query can include generating, based at least in part on the first set of characters, a prediction of a phrase matching meta information associated with at least one of a service component metric, log, and event. Predicting a data store query can include proposing the prediction for completion of the query. | 11-05-2015 |
20150339337 | SERVICE REGISTRY FOR SAVING AND RESTORING A FACETED SELECTION - An ordered sequence of two or more filter provider executable objects are associated, each configured to select successive subsets of data in a registry via a database upon a user request to create and configure a filtered selection. Upon a user selection of a save feature, each associated filter provider executable object is serialized in the ordered sequence, and each serialization is collected into an ordered list of serializations and saved. The serialization of each filter provider executable object is performed by one of the respective filter provider executable object and a filter provider executable object of a same type as the respective facet provider object. A selection statement is constructed from the associated filter provider executable objects in the ordered sequence. A difference between the constructed selection statement and an actual selection statement is calculated and the selection statement difference is appended to the saved ordered list of serializations. | 11-26-2015 |
20150347475 | PROCESSOR AND DATA GATHERING METHOD - An object of the present invention is to efficiently perform a data load process or a data store process between a memory and a storage unit in a processor. The processor includes: a plurality of storage units associated with a plurality of data elements included in a data set; and a control unit that reads the plurality of data elements stored in adjacent storage areas from a memory, in which a plurality of the data sets is stored, collectively for respective data sets, sorts the respective read data elements to a storage unit corresponding to the data element among the plurality of storage units, and writes the data elements to the respective data sets. | 12-03-2015 |
20150347577 | COMMUNICATION TERMINAL, COMMUNICATION METHOD, PROGRAM, AND COMMUNICATION SYSTEM - There is provided a communication terminal including an acquisition unit that acquires, from another communication terminal, meta-information associated with content stored in the other communication terminal, and a playlist management unit that manages a playlist which is shared with the other communication terminal and which is for playing back content corresponding to the meta-information acquired from the other communication terminal. | 12-03-2015 |
20150347589 | CONTENT ACCESS IN A TRAVEL MANAGEMENT SYSTEM - Methods, systems, and computer program products for accessing content in a travel management system. A request is received from an application to access a standard data element and a non-standard data element from an extended record data structure based at least in part upon access criteria. A plurality of attributes of a data container associated with the non-standard data element are filtered based at least in part upon a plurality of predefined filtering rules in order to generate filtered attributes. An abstract container is generated that includes the filtered attributes of the non-standard data element and that is assigned a unique abstract type. | 12-03-2015 |
20150356175 | SYSTEM AND METHOD FOR FINDING AND INVENTORYING DATA FROM MULTIPLE, DISTINCT DATA REPOSITORIES - A system and method of finding and inventorying related data in multiple, distinct tables of a data repository may include storing raw data from multiple, distinct tables in a schema-less design format in a schema-less data repository, where the raw data includes data values and metadata associated with the data values. A first set of data values may be identified from the raw data that matches a search parameter. A first set of metadata associated with the identified first set of data values may be identified. A determination of a second set of metadata related to metadata in the first set of metadata may be made. A second set of data values related to the search parameter may be identified, and an inventory inclusive of metadata that provides an inventory to the identified data values for processing. | 12-10-2015 |
20150370857 | MULTI-DIMENSIONAL DATA STATISTICS - A system, computer-implemented method, and computer-program product embodiments for generating a multi-dimensional histogram. A data statistic object generator creates an initial histogram, determines a cost associated with each bucket of the histogram, sorts the buckets into a queue based on the determined cost and selects one of the buckets to be decomposed based on the determined cost. The cost of the decomposed buckets are then calculated, and the decomposed are buckets are then put back into the queue of histogram buckets for possible further decomposition. | 12-24-2015 |
20160012076 | File Searching Method and Image Processing Device Thereof | 01-14-2016 |
20160019251 | System and Methods for Efficiently Storing Heterogeneous Data Records Having Low Cardinality - A method for organizing data records stored in a database having one or more row values and one or more row columns. The method includes determining at least one column from the one or more columns having high cardinality. A table is then created for the column having high cardinality, the created table including row values of the column having high cardinality. The method further includes determining a column having low cardinality and creating a second table for the column having low cardinality. The second table may include a descriptor of the column having low cardinality paired with a row value. The method may further include creating a third table that links the first and second tables. | 01-21-2016 |
20160019262 | OFFLOADING PROJECTION OF FIXED AND VARIABLE LENGTH DATABASE COLUMNS - In some embodiments, a query recipient is configured to determine that a database query warrants a first projection operation to project a plurality of input rows to a plurality of projected rows. Each of the input rows has one or more variable-length columns. A projection controller is configured to construct a first projection control block to describe the first projection operation. For this construction, the projection controller is configured to construct a plurality of projection control elements, each one corresponding to a corresponding column in the input rows, and a header to specify the order of the projection control elements. The projection controller is further configured to offload the first projection operation to a hardware accelerator, and to provide the first projection control block to the hardware accelerator, where the first projection control block enables the hardware accelerator to perform the first projection operation at streaming rate. | 01-21-2016 |
20160026732 | Comment Ordering System - In one embodiment, a social networking system receives a request by a first user for user comments associated with a content object, accesses a data store of user comments to retrieve a set of user comments associated with the content object, orders the set of user comments based on a time value associated with each comment of the set of user comment, adjusts the order of user comments based on social graph information of the first user, and presents the adjusted list of user comments to the first user. | 01-28-2016 |
20160034564 | METHOD AND SYSTEM OF GENERATING AND USING A GEOGRAPHICAL HIERARCHY MODEL - Geographical regions are each characterized using a distribution of terms, tags, etc. A model may be generated that identifies characteristics of each geographic region. The geographic regions may be organized using a geographical hierarchical model. | 02-04-2016 |
20160041812 | SORTING PROCESSES AND ARRANGEMENTS FOR ELECTRONIC MESSAGES - An apparatus displays an arrangement of electronic data sorted by user preferences. The arrangement includes a plurality of electronic objects arranged in a plurality of rows on a graphical display. Each of the objects includes a sender field, a recipient field, a message field, and a time field. The plurality of rows are arranged in the graphical display such that each of the rows is associated with one of the electronic objects. At least one of the fields associated with each object is displayed in each row, and the rows are at least partially arranged by a frequency of communication between the sender and the recipient. | 02-11-2016 |
20160048528 | INDEXING AND SEARCH QUERY PROCESSING - A method for processing a search query according to one embodiment includes receiving a search query containing terms; combining at least some consecutive terms in the search query to create biwords; looking up at least some of the terms and biwords in a search index for identifying sections of documents containing the at least some of the terms and/or biwords; generating a content score for each of the identified sections based at least in part on a number of the terms and biwords found in the sections of each document, wherein the biwords are given a higher priority than matched terms, wherein the priority affects the content score; and selecting and outputting an indicator of at least one of the sections, or portion thereof, based at least in part on the content score. | 02-18-2016 |
20160055166 | Systems, Apparatus, and Methods for Accessing Data from a Database as a File - System, apparatus, and method are provided for accessing data from a database as a file. Data is organized more securely in database than a file system, but many programs are designed to work with data that is read from a file in a file system. The present invention allows data to be operated upon by external file-based programs that are designed to work on files in a file system while still being able to organize and store data in a database, rather a file folder hierarchy. This invention provides for correlating a file name with data in the database and satisfying forwarded File I/O requests on the data. | 02-25-2016 |
20160055186 | APPARATUS AND METHOD FOR OPTIMIZING TIME SERIES DATA STORAGE BASED UPON PRIORITIZATION - A data storage policy is determined. Time series data is received and a score for the time series data is determined. The score prioritizes the time series data according to a likelihood the time series data will be needed for future use. Based upon the data storage policy and the score, the time series data is stored at one or more data storage devices. The score is updated over time to reflect changing priorities regarding the use of the data. | 02-25-2016 |
20160070713 | DEVICE-CENTRIC MEDIA PRIORITIZATION SYSTEMS AND METHODS - In a system comprising media files resident on various devices which can interconnect and provide indices of their media library content, an organization method may provide an aggregate view of the media library of all connected devices ordering the media library contents of various connected devices from the point of view of the device from which the view of the aggregate library will be shown. This point-of-access-centric view of the library is formed by prioritizing significance or permanency or remoteness of the connected devices from the perspective of the viewing device. The content sort order is then boosted based on the device's priority. | 03-10-2016 |
20160077801 | METHOD AND SYSTEM FOR OBTAINING DYNAMIC DISTRIBUTED DATA OF SAMPLE ATTRIBUTES - A method for obtaining dynamic distributed data of sample attributes includes: obtaining a sample attribute from any one sample out of a pool of large-scale samples; determining an updated location of where the obtained sample attribute is located within a priorly-maintained sample attribute queue, and then performing updating at the updated location utilizing the obtained sample attribute; maintaining an orderly arrangement of the sample attributes in the sample attribute queue, in order to obtain dynamic distributed data of the obtained sample attributes, wherein: the sample attribute queue stores the sample attributes of the pool of large-scale samples, the sample attributes are orderly arranged in the sample attribute queue; a length of the sample attribute queue is set at a value of N, wherein the value N being smaller than a total number of the samples in the pool of large-scale samples. The method reduces dynamic distributed data sample attributes calculations. | 03-17-2016 |
20160078058 | FILE SYSTEM AND METHODS FOR COMPARING MULTIPLE INSTANCES - A system provides via a software application, a file sub-system that organizes images of an event for evaluation of an object or event as the object or event changes over time. A base image may be established and other images of the object or event may be co-related to the base image so that a user may select the base image for display along with the other images showing time lapsed changes to the object or event. | 03-17-2016 |
20160085810 | SCALING EVENT PROCESSING USING DISTRIBUTED FLOWS AND MAP-REDUCE OPERATIONS - Some event ordering requirements can be determined based on continuous event processing queries. Other event ordering requirements can be determined based on distribution flow types being used to distribute events from event streams to node executing the queries. Events from event streams can be ordered according to ordering semantics that are based on a combination of all of these event ordering requirements. Additionally, virtual computing nodes can be associated with constraints, and computing processors can be associated with capabilities. Virtual computing nodes for processing event streams can be assigned to execute on various computing processors based on both these constraints and capabilities. Additionally, for each of several events in an event stream, a ratio between a total latency and a communication latency can be for determined. Based on an average of these ratios, a quantity of reducing nodes that will be involved in a map-reduce operation can be selected. | 03-24-2016 |
20160092452 | LARGE-SCALE PROCESSING AND QUERYING FOR REAL-TIME SURVEILLANCE - A priority request handler may receive a priority request to associate a priority label with a sensed data file, the sensed data file being included within a time series of sensed data files received from a plurality of sensors. A queue manager may then store the sensed data file within a priority queue in association with the priority label, and independently of a temporal order of a time series of sensed data files. The queue manager may thus retrieve the sensed data file from the priority queue, based on the priority label, for processing thereof to obtain a sensed data record. | 03-31-2016 |
20160092500 | MANAGING A DATA SET - A method of and system for managing a data set of a storage facility is disclosed. The data set may be a sequential-access data set. The method and system may include structuring the sequential-access data set to have a first group-of-records configured for adding a second group-of-records to the sequential-access data set. The method and system add a second group-of-records to the sequential-access data set. The method and system merge the second group-of-records with the first group-of-records in response to a triggering event. The method and system establish, in response to merging the second group-of-records with the first group-of-records, a marker configured to indicate the first and second group-of-records, as merged, is sorted. | 03-31-2016 |
20160092509 | DATA PROCESSING APPARATUS AND PREDICTION METHOD OF PATTERN FREQUENCY THEREOF - Provided are data processing apparatus and methods for predicting a pattern frequency thereof. The data processing apparatus includes: a storage unit adapted to store a preset graph pattern, an occurrence frequency of the preset graph pattern, and information on actual data nodes corresponding to each node which belongs to the graph pattern; and a control unit adapted to compare the preset graph pattern with a graph pattern to be searched to perform a graph search, and when the preset graph pattern is not included in the graph to be searched, search for a node shared by two different preset graph patterns which are stored in the storage unit to perform the graph search. By this configuration, it is possible to predict a level of an intermediate result to optimize a graph query and effectively calculate sizes of various graphs patterns while making a capacity of a memory small. | 03-31-2016 |
20160098437 | INFORMATION RETRIEVAL METHOD AND APPARATUS - The present invention relates to the field of computer communications technologies and discloses an information retrieval method and apparatus. In this solution, even if result information does not include a retrieval keyword, a matching value between the result information and each local matching model can be determined in a local matching model set according to a retrieval keyword group and a result keyword group that is determined according to a result information group. Then, a relevance degree is obtained according to the matching value between the result information and all local matching models. Therefore, the result information that has relatively high relevance with the retrieval instruction but does not include the retrieval keyword can still be presented to a user, which improves retrieval accuracy. | 04-07-2016 |
20160098444 | Corpus Management Based on Question Affinity - Mechanisms are provided for managing a corpus of content. A question is processed by a Question Answering (QA) system to generate an answer to the question and a supporting evidence passage. A corpus value metric is calculated for the supporting evidence passage based on a determined number of times the supporting evidence passage is used to generate a high ranking answer to questions submitted to the QA system. A first corpus management operation is performed on the supporting evidence passage in response to determining that the corpus value metric meets or exceeds a first threshold, the first corpus management operation increasing a relative importance of the supporting evidence passage within the corpus. A second corpus management operation on the supporting evidence passage is performed in response to determining that the corpus value metric meets or falls below a second threshold, the second corpus management operation decreasing the passage's relative importance. | 04-07-2016 |
20160098445 | Syntactic Graph Modeling in a Functional Information System - The invention relates to systems and methods using a logical data model for aggregating data entities in a functional information system supported upon a computing platform, and also for providing systems and methods for analyzing economic information using a functional coordinate system. | 04-07-2016 |
20160098481 | PARALLEL DATA SORTING - A method, apparatus, and system for improved high-performance parallel data sorting is provided. In a first phase, a plurality of unordered data elements to be sorted is divided into K unordered lists each preferably having approximately M elements. Each of these K unordered lists can be independently sorted in parallel using any algorithm, such as quicksort, to generate K ordered lists. In a second phase, N balanced workloads are determined from the K ordered lists by using an iterative converging process capped by a maximum number of iterations. Thus, any non-uniform or skewed data distribution can be load balanced with minimal processing time. Once the N balanced workloads are determined, they can be independently sorted in parallel, for example by using a merge sort, and then combined with a fast concatenation to provide the final sorted result. Thus, sorting operations are fully parallelized while avoiding any expensive data scanning steps. | 04-07-2016 |
20160110351 | SPECIFYING AND APPLYING RULES TO DATA - A method for applying a rule to data includes receiving data from a data source and processing a particular data unit of an ordered number of data units derived at least in part from the received data. The processing includes determining a set of data units including an ordered subset of data units from the ordered number of data units, each data unit of the ordered subset being related to the particular data unit and occurring before the particular data unit in the ordered number of data units. Prior to applying the rule the state variable is updated to a state that would result from iterating in order through the set of data units and, for each data unit of the ordered subset, applying the rule to the data unit. The rule is then applied to the particular data unit including reading the updated value of the state variable. | 04-21-2016 |
20160110390 | TUNABLE HARDWARE SORT ENGINE FOR PERFORMING COMPOSITE SORTING ALGORITHMS - Embodiments include methods, systems and computer program products for performing a composite sort on a tunable hardware sort engine includes determining desired sort performance parameters, configuring a composite sort engine based on the desired sort performance parameters, and receiving a plurality of keys having a payload associated with each of the plurality of keys. The method also includes reserving DRAM storage for each of the payloads, generating a tag for each of the plurality of keys, the tag identifying the DRAM storage reserved for each of the payloads, and storing the payloads in the portions of the DRAM storage. The method further includes generating a composite key for each of the plurality of keys, sorting the composite keys by the composite sort engine, and retrieving the payloads associated with the sorted composite keys from the DRAM storage. The method also includes outputting the payloads associated the sorted composite keys. | 04-21-2016 |
20160110395 | TUNABLE HARDWARE SORT ENGINE FOR PERFORMING COMPOSITE SORTING ALGORITHMS - Embodiments include methods, systems and computer program products for performing a composite sort on a tunable hardware sort engine includes determining desired sort performance parameters, configuring a composite sort engine based on the desired sort performance parameters, and receiving a plurality of keys having a payload associated with each of the plurality of keys. The method also includes reserving DRAM storage for each of the payloads, generating a tag for each of the plurality of keys, the tag identifying the DRAM storage reserved for each of the payloads, and storing the payloads in the portions of the DRAM storage. The method further includes generating a composite key for each of the plurality of keys, sorting the composite keys by the composite sort engine, and retrieving the payloads associated with the sorted composite keys from the DRAM storage. The method also includes outputting the payloads associated the sorted composite keys. | 04-21-2016 |
20160110397 | METHOD AND SYSTEM FOR SORTING AND DISPLAYING DATA - A system and method adapted to facilitate efficient sorting and displaying of data in a table. An example method includes displaying a table with a first portion of data and a second portion of data; simultaneously applying a first sort rule to the first portion of data (primary database object(s)) and a second sort rule to the second portion of data (secondary database object(s)) in response to user selection of a sort option; and illustrating sorted data via the table, wherein the first sort rule is adapted to cause the first portion of data to appear in one or more predetermined locations in the table relative to the second portion of data. The second portion of data is sorted according to the second sort rule. In a more specific embodiment, primary database objects are sorted via the first sort rule and are not subject to the second sort rule. The first sort rule includes a specification that primary database objects be displayed at a predetermined location in the table, such as in an uppermost position in the table or in an upper most position in a purpose group section of the table. | 04-21-2016 |
20160117356 | SORTING INFORMATION BY RELEVANCE TO INDIVIDUALS WITH PASSIVE DATA COLLECTION AND REAL-TIME INJECTION - In one aspect, data, such as information articles, is sorted and prioritized based on a plurality of factors, such as user interest and popularity of data with respect to other users. The data is sorted by initial personal (i.e., user) data, sorted by the most relevant to the user, while passive interaction data is used to continually reorder the articles in real-time, while new stories are being injected into the stream in real time, all while other articles are increasing/decreasing in stature based on popularity with regard to other users and time decay. As such, the system provides that the information is fed to users in an efficient manner, in a manner based on time relevance, assumed interest with regard to that given user based on past actions by that user or information otherwise known about that user, as well as interest in the articles demonstrated by other users. | 04-28-2016 |
20160132550 | METHODS FOR MAINTAINING INFRASTRUCTURE EQUIPMENT AND RELATED APPARATUS - Apparatus and methods for managing and upgrading components in an infrastructure are provided. Records relating to components may be retrieved from a database and separated into subsets based on conditions of those components, the types of those components, deterioration models of those components, and/or other factors. Future condition values may be calculated for each subset, and likelihoods of failure of components may be determined for each subset based on those future condition values. The estimated condition values may be used in order to determine an optimal approach to maintaining, refurbishing, and/or replacing the components in the infrastructure. Computational efficiency is increased. | 05-12-2016 |
20160147831 | SYSTEM AND METHOD FOR ARRAY-BASED DATA STORAGE AND SEARCH - Provided are computer devices and methods for effectively generating and updating a sorted array for quick data access. The array allocates more space than required by the elements it stores. In other words, the array leaves empty spaces between elements such that insertion of a new element only requires the shifting of a small number, or even none, of the existing elements in the array. | 05-26-2016 |
20160171045 | HIERARCHICAL IN-MEMORY SORT ENGINE | 06-16-2016 |
20160179881 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND NON-TRANSITORY COMPUTER READABLE STORAGE MEDIUM | 06-23-2016 |
20160179936 | PROCESSING TIME-ALIGNED, MULTIPLE FORMAT DATA TYPES IN INDUSTRIAL APPLICATIONS | 06-23-2016 |
20160188797 | METHOD AND SYSTEM FOR HIGH-THROUGHPUT SEQUENCING DATA ANALYSIS - Methods and systems for high-throughput sequencing data analysis are provided. In an embodiment, the method includes the following steps. An input DNA/RNA/Protein sequence is received by a master computing unit. The input DNA/RNA/Protein sequence is partitioned into overlapping segments with a sliding window less than a segment length of the overlapping segments to allow overlapping of any successive two thereof by the master computing unit. The overlapping segments are distributed by the master computing unit to a plurality of slave computing units in a cloud computing environment. Suffix-expansion-sorting processing is performed on the overlapping segments by the slave computing units to produce sorted expansion segments. Distributed database tables are generated based on the sorted expansion segments by at least a portion of the slave computing units. The distributed database tables are associated to construct a global database table corresponding to the input DNA/RNA/Protein sequence for high-throughput sequencing data analysis. | 06-30-2016 |
20160253365 | SYSTEM AND METHOD TO EXTRACT UNIQUE ELEMENTS FROM SORTED LIST | 09-01-2016 |
20160378801 | EFFICIENT SORTING OF LARGE DATA SET WITH DUPLICATE VALUES - Techniques are disclosed for sorting an input data set. A sort tool determines a distribution of values of a data set that includes a plurality of data records. The sort tool partitions the data set into a plurality of subsets based on the distribution. Each of the data records is inserted into one of the subsets based on a corresponding sort value of the data record. The sort tool identifies one or more of the subsets that contain at least two distinct sort values. In each of the identified subsets, the data records are sorted by a corresponding sort value of the data record. | 12-29-2016 |
20160378832 | EFFICIENT SORTING OF LARGE DATA SET WITH DUPLICATE VALUES - Techniques are disclosed for sorting an input data set. A sort tool determines a distribution of values of a data set that includes a plurality of data records. The sort tool partitions the data set into a plurality of subsets based on the distribution. Each of the data records is inserted into one of the subsets based on a corresponding sort value of the data record. The sort tool identifies one or more of the subsets that contain at least two distinct sort values. In each of the identified subsets, the data records are sorted by a corresponding sort value of the data record. | 12-29-2016 |