51st week of 2013 patent applcation highlights part 63 |
Patent application number | Title | Published |
20130339302 | SYSTEM AND METHOD FOR INTELLIGENT DATABASE BACKUP - Systems and methods are provided for backing up database storage. A protection policy for database storage is activated at a remote host, wherein the database storage is not physically accessible by the computing device, such that the out-of-band storage is not in communication with the remote host through the computing device. A backup request is transmitted to the remote host comprising data indicative of a volume on the database storage to back up according to the protection policy. A response to the backup request is received comprising staging disk requirements including a required size for a staging disk. A staging disk is determined based on the response. The staging disk is presented to the remote host so that the remote host can perform a backup of the volume to the staging disk using a database backup tool provided by a vendor of the database storage. | 2013-12-19 |
20130339303 | SYSTEM AND METHOD FOR INCREMENTALLY BACKING UP OUT-OF-BAND DATA - Systems and methods are provided for backing up out-of-band storage. A protection policy is activated for out-of-band storage at a remote host, wherein the out-of-band storage is not physically accessible by the computing device, such that the out-of-band storage is not in communication with the remote host through the computing device. A backup request is transmitted to the remote host comprising data indicative of a volume on the out-of-band storage to back up according to the protection policy. A response to the backup request is received comprising staging disk requirements for the volume, the staging disk requirements comprising a required size for a staging disk to back up the volume. A staging disk is determined based on the response. The staging disk is presented to the remote host. A backup result is received comprising data indicative of whether a backup of the volume to the staging disk succeeded. | 2013-12-19 |
20130339304 | MOBILE TERMINAL AND METHOD FOR CONTROLLING MOBILE TERMINAL - A mobile terminal including a memory; a wireless communication unit configured to perform wireless communication with an external device; at least one information acquisition mechanism configured to acquire emergent situation information for deciding whether an emergent situation has occurred; and a controller configured to transmit predetermined data files stored in the memory to the external device through the wireless communication unit according to a predetermined priority order if the emergent situation has occurred. | 2013-12-19 |
20130339305 | METHODS OF BACKING UP AND RESTORING PROFILE, AND DEVICES THEREFOR - Methods of backing up and restoring a profile and devices therefor are disclosed. The method of backing up a profile includes transmitting, by an authentication module, a profile backup command to an operator server, transmitting, by the operator server, information to the authentication module, the information being generated by confirming a state of at least one repository capable of storing the profile, and storing the profile in a selected repository. The method of restoring a profile includes transmitting, by an authentication module, a profile restoration command to an operator server, transmitting, by the operator server, information to the authentication module, the information being generated by confirming a state of at least one repository having a profile stored therein, and restoring, in an authentication module, a profile stored in a selected repository. | 2013-12-19 |
20130339306 | METHOD OF BACKING UP PROFILE AND APPARATUS THEREFOR - A method and apparatus for backing up a profile of in a repository are disclosed. The method of backing up a profile is a method of backing up a profile in a subscriber management server, and includes receiving a backup request for a profile stored in an authentication module from the authentication module, providing information for at least one repository to the authentication module, the information being generated by confirming a state of the at least one repository to back up the profile according to the backup request, and storing the profile in a repository selected by the authentication module based on the information for at least one repository. Therefore, the user can directly select a reliable repository and back up the profile of the authentication module. | 2013-12-19 |
20130339307 | MANAGING SYSTEM IMAGE BACKUP - A method, system or computer usable program product for backing up a system image including receiving a request to backup a first system image on a first computer system onto a server, selecting a similar system image from a catalog of images, identifying a first set of differences between the similar system image and the first system image, and backing up the first system image by transferring the first set of differences to the server. | 2013-12-19 |
20130339308 | PROTOCOL COMPLIANT ARCHIVING - Disclosed herein are techniques for archiving data objects. It is determined whether a data object was rejected by an archiving module due to an information field thereof violating a protocol. If it is determined that the data object was rejected due to violation of the protocol, a compliant information field that complies with the protocol is generated such that the compliant information field causes the archiving module to permit archiving of the data object violating the protocol. | 2013-12-19 |
20130339309 | DYNAMIC DISCOVERY OF STORAGE RESOURCE TOPOLOGY - In one aspect, dynamic determination generates a storage resource graph corresponding to a storage topology. The generating may comprise iterating through storage resources in the storage topology and using a discovery handler to generate a node in the storage resource graph corresponding to each of the iterated storage resources. Dynamic determination generates an operation graph by iterating through nodes in the storage resource graph and using an operating handler to generate operation-specific metadata corresponding to each iterated node of the storage resource graph. Dynamic generating executes the operation graph in a way specific to the operation. | 2013-12-19 |
20130339310 | RESTORE USING A CLIENT SIDE SIGNATURE REPOSITORY IN A NETWORKED STORAGE SYSTEM - A storage system according to certain embodiments includes a client-side signature repository that includes information representative of a set of data blocks stored in primary storage. During restore operations, the system can use the client-side signature repository to identify data blocks located in primary storage. The system can source the identified data blocks from their respective locations within primary storage instead of the secondary storage for the restore operation. | 2013-12-19 |
20130339311 | INFORMATION RETRIEVAL AND NAVIGATION USING A SEMANTIC LAYER - Systems and methods for information retrieval are provided that permit users and/or processing entities to access and define synthetic data, synthetic objects, and/or synthetic groupings of data in one or more collections of information. In one embodiment, data access on an information retrieval system can occur through an interpretation layer which interprets any synthetic data against data physically stored in the collection. Synthetic data can define virtual data objects, virtual data elements, virtual data attributes, virtual data groupings, and/or data entities that can be interpreted against data that may be stored physically in the collection of information. The system and methods for information retrieval can return results from the one or more collections of information based not only on the data stored, but also on the virtual data generated from interpretation of the stored data. | 2013-12-19 |
20130339312 | Inter-Query Parallelization of Constraint Checking - A plurality of operations are executed on tables of a database with at least a portion of the operations being executed in parallel. A constraint check is performed for each operation subsequent to its execution to determine whether data stored in the database affected by the operation is valid, during this constraint checking additional operations and/or constraint checks on the same table are allowed to run in parallel. Based on this constraint checking, operations for which the constraint check determines that the data is not valid are invalidated. Related apparatus, systems, techniques and articles are also described. | 2013-12-19 |
20130339313 | GUARDED FILE DESCRIPTORS - Guarded file access operations are provided for creating and using guarded file descriptors, which can detect and prevent erroneous file access operations in computer programs. A file descriptor can be associated with a guard identifier to create a guarded file descriptor. The association can be established when the file is opened, and can be maintained independently of the computer program, which ordinarily maintains its own association between files, file descriptors, and guard identifiers. Subsequent file operations using the guarded file descriptor check that the guard identifier previously associated with that file descriptor is presented, and generate errors without performing the requested file operations if the correct guard identifier is not presented. This check serves as a validation of the computer program's use of file descriptors. An error and stack trace can be generated for use in analyzing a cause of the guard violation. | 2013-12-19 |
20130339314 | ELIMINATION OF DUPLICATE OBJECTS IN STORAGE CLUSTERS - Digital objects within a fixed-content storage cluster use a page mapping table and a hash-to-UID table to store a representation of each object. For each object stored within the cluster, a record in the hash-to-UID table stores the object's hash value and its unique identifier (or portions thereof). To detect a duplicate of an object, a portion of its hash value is used as a key into the page mapping table. The page mapping table indicates a node holding a hash-to-UID table indicating currently stored objects in a particular page range. Finding the same hash value but with a different unique identifier in the table indicates that a duplicate of an object exists. Portions of the hash value and unique identifier may be used in the hash-to-UID table. Unneeded duplicate objects are deleted by copying their metadata to a manifest and then redirecting their unique identifiers to point at the manifest. | 2013-12-19 |
20130339315 | Configurable Data Generator - Embodiments associated with configurable, repeatable, data generation are described. One example method includes manipulating a redundancy parameter that controls data redundancy in binary large objects (BLOBs) to be included in a generated data set. The redundancy parameters may control variations in repeatable variable length sequences included in BLOBs. The example method also includes manipulating a parameter(s) that controls custom designed sequences included in BLOBs. With the redundancy and custom designed sequences described, the example method then generates BLOBs based, at least in part, on the redundancy parameters and the custom-designed sequences. BLOBs may include byte sequences repeated at different frequencies and configurable user-designed sequences. Manipulating the redundancy parameter, manipulating the custom-designed sequences, generating the BLOBs, and providing the BLOBS may be performed by separate processes acting in parallel. | 2013-12-19 |
20130339316 | PACKING DEDUPLICATED DATA INTO FINITE-SIZED CONTAINERS - Deduplicated data is packed into finite-sized containers. A similarity score is calculated between files that are similarly of the deduplicated data. The similarity score is used for grouping the similarly compared files of the deduplicated data into subsets for destaging each of the subsets from a deduplication system to one a finite-sized container. | 2013-12-19 |
20130339317 | DATA DEDUPLICATION MANAGEMENT - Technologies are generally described for a data deduplication management scheme for media files uploaded or to be uploaded to a server. In some examples, a method may include identifying, by a server, a creation time of a media file based at least in part on metadata of the media file; identifying, by the server, an uploading time of the media file; calculating, by the server, a difference between the creation time and the uploading time; and performing, by the server, a data deduplication process when the difference is greater than a predetermined value. | 2013-12-19 |
20130339318 | METHOD AND SYSTEM FOR DELETING OBSOLETE FILES FROM A FILE SYSTEM - A method for deleting obsolete files from a file system is provided. The method includes: receiving a request to delete a reference to a target file in a file system from a file reference data structure, wherein the file reference data structure includes target file names and reference file names; identifying a reference file name in the file reference data structure, wherein the reference file name includes a file name of the target file; deleting a reference file from the file system, wherein the reference file has the identified reference file name; checking whether the file system includes at least one reference file whose file name matches the file name of the target file; if there is no such reference file in the file system: deleting the target file from the file system; and deleting the file name of the target file from the file reference data structure. | 2013-12-19 |
20130339319 | SYSTEM AND METHOD FOR CACHING HASHES FOR CO-LOCATED DATA IN A DEDUPLICATION DATA STORE - Systems and methods are provided for caching hashes for deduplicated data. A request to read data from the deduplication data store is received. A persist header stored in a deduplication data store is identified in a first hash structure that is not stored in memory of the computing device. The persist header comprises a set of hashes that includes a hash that is indicative of the data the computing device requested to read. Each hash in the set of hashes represents data stored in the deduplication data store after the persist header that is co-located with other data represented by the remaining hashes in the set of hashes. The set of hashes is cached in a second hash structure stored in the memory, whereby the computing device can identify the additional data using the second hash structure if the additional data is represented by the persist header. | 2013-12-19 |
20130339320 | STORAGE SYSTEM - The storage system includes a data dividing means for dividing writing target data into a plurality of units of partial data, and generating units of new divided file data; an index file generation means for generating, for each of the units of partial data, an index entry, and generating index file data by adding test data for error detection; a data writing means for writing the divided file data and the index file data; and a recovery means for detecting an error in the index entries written in the storage device, based on the test data included in each of the index entries. The recovery means deletes an index entry in which an error is detected and all of the subsequent index entries in the index file data stored in the storage device, from the index file data. | 2013-12-19 |
20130339321 | METHOD, SYSTEM, AND COMPUTER-READABLE MEDIUM FOR PROVIDING A SCALABLE BIO-INFORMATICS SEQUENCE SEARCH ON CLOUD - The present invention relates to a computer-implemented method, system and computer readable medium for providing a scalable bio-informatics sequence search on cloud. The method comprises the steps of partitioning a genome data into a plurality of datasets and storing the plurality of data sets in a database. Receiving at least one sequence search request input and searching for a genome sequence in the database corresponding to the search request input and scaling of the sequence search based on the sequence search request input. | 2013-12-19 |
20130339322 | REDUCING DECOMPRESSION LATENCY IN A COMPRESSION STORAGE SYSTEM - In a compression processing storage system, using a pool of compression cores, the compression cores are assigned to process either compression operations, decompression operations, or decompression and compression operations, which are scheduled for processing. A maximum number of the compression cores are set for processing only the decompression operations, thereby lowering a decompression latency. A minimal number of the compression cores are allocated for processing the compression operations, thereby increasing compression latency. Upon reaching a throughput limit for the compression operations that causes the minimal number of the plurality of compression cores to reach a busy status, the minimal number of the plurality of compression cores for processing the compression operations is increased. | 2013-12-19 |
20130339323 | METHODS AND SYSTEMS FOR ENCODING/DECODING FILES AND TRANSMISSIONS THEREOF - In one embodiment, the instant invention includes a computer system that includes at least the following components: a) a first computer that performs, in concurrent manner, at least the following tasks: dividing a computer file into a plurality of segments, compressing segments, and sending the compressed segments to a second computer over a network; b) the second computer that performs, in concurrent manner, at least the following tasks: decompressing the compressed segments and assembling the decompressed segment to reconstruct the computer file, where the compressing task performed by the first computer and the decompressing task performed by the second computer are synchronized and performed concurrently. | 2013-12-19 |
20130339324 | SYSTEMS AND METHODS FOR TRANSFORMATION OF LOGICAL DATA OBJECTS FOR STORAGE - Methods and systems for transforming a logical data object for storage in a storage device configured to operate with at least one storage protocol. One method comprises creating in the storage device a transformed logical data object comprising a one or more allocated storage sections with a predefined size and receiving one or more data chunks corresponding to the transformed logical data object. The method further comprises determining if each received data chunk comprises a predefined criterion, transforming each data chunk that comprises the predefined criterion, maintaining each data chuck in raw form that does not comprise the predefined criterion, and sequentially storing each transformed data chuck and data chunk in raw form into said one or more allocated storage sections in accordance with an order said transformed data chunks and data chunks in raw form are received. One system comprises a processor configured to perform the above method. | 2013-12-19 |
20130339325 | CONSTRAINED TRANSACTION EXECUTION - Constrained transactional processing is provided. A constrained transaction is initiated by execution of a Transaction Begin constrained instruction. The constrained transaction has a number of restrictions associated therewith. Absent violation of a restriction, the constrained transaction is to complete. If an abort condition is encountered, the transaction is re-executed starting at the Transaction Begin instruction. Violation of a restriction may cause an interrupt. | 2013-12-19 |
20130339326 | TRANSACTION BEGIN/END INSTRUCTIONS - A TRANSACTION BEGIN instruction and a TRANSACTION END instruction are provided. The TRANSACTION BEGIN instruction causes either a constrained or nonconstrained transaction to be initiated, depending on a field of the instruction. A constrained transaction has one or more restrictions associated therewith, while a nonconstrained transaction is not limited in the manner of a constrained transaction. The TRANSACTION END instruction ends the transaction started by the TRANSACTION BEGIN instruction. | 2013-12-19 |
20130339327 | FACILITATING TRANSACTION COMPLETION SUBSEQUENT TO REPEATED ABORTS OF THE TRANSACTION - Processing of transactions within a computing environment is facilitated by taking actions to increase the chances of successfully executing a transaction. A counter is maintained that provides a count of how often a transaction has aborted. The counter increments the count each time the transaction is aborted, and it is reset to zero upon successful completion of the transaction or an interruption leading to no more re-executions of the transaction. If the count reaches a threshold value, then an interrupt is presented and transaction execution is unsuccessful. However, before the count reaches the threshold, a number of actions may be taken to increase the chances of successfully executing the transaction. These actions include actions to be performed within the processor executing the transaction, and/or actions to be performed against conflicting processors. | 2013-12-19 |
20130339328 | SELECTIVELY CONTROLLING INSTRUCTION EXECUTION IN TRANSACTIONAL PROCESSING - Execution of instructions in a transactional environment is selectively controlled. A TRANSACTION BEGIN instruction initiates a transaction and includes controls that selectively indicate whether certain types of instructions are permitted to execute within the transaction. The controls include one or more of an allow access register modification control and an allow floating point operation control. | 2013-12-19 |
20130339329 | TRANSACTIONAL PROCESSING - A transaction is initiated via a transaction begin instruction. During execution of the transaction, the transaction may abort. If the transaction aborts, a determination is made as to the type of transaction. Based on the transaction being a first type of transaction, resuming execution at the transaction begin instruction, and based on the transaction being a second type, resuming execution at an instruction following the transaction begin instruction. Regardless of transaction type, resuming execution includes restoring one or more registers specified in the transaction begin instruction and discarding transactional stores. For one type of transaction, the nonconstrained transaction, the resuming includes storing information in a transaction diagnostic block. | 2013-12-19 |
20130339330 | FACILITATING TRANSACTION COMPLETION SUBSEQUENT TO REPEATED ABORTS OF THE TRANSACTION - Processing of transactions within a computing environment is facilitated by taking actions to increase the chances of successfully executing a transaction. A counter is maintained that provides a count of how often a transaction has aborted. The counter increments the count each time the transaction is aborted, and it is reset to zero upon successful completion of the transaction or an interruption leading to no more re-executions of the transaction. If the count reaches a threshold value, then an interrupt is presented and transaction execution is unsuccessful. However, before the count reaches the threshold, a number of actions may be taken to increase the chances of successfully executing the transaction. These actions include actions to be performed within the processor executing the transaction, and/or actions to be performed against conflicting processors. | 2013-12-19 |
20130339331 | TRACKING FILE CONTENT ORIGINALITY - Methods and systems may provide for detecting a copy operation with respect to content in a first electronic file, detecting a paste operation with respect to the content in a second electronic file, and conducting an automatic write of one or more attributes associated with the first electronic file to the second electronic file in response to the paste operation. In one example, the automatic write bypasses a user interface associated with the paste operation. | 2013-12-19 |
20130339332 | News reporting system - A news collection and dissemination system which utilizes a central computer having a data base of articles which have been submitted by submitters/reporters (ideally eye witnesses) located at the site. Submission of the articles uses a first electronic mechanism (e.g. a laptop computer, a note pad, a desktop computer, a cellular telephone) linked with and communicating with the first computer. Ideally the first electronic mechanism is identified using a removable memory. The articles are selectively communicated to a second electronic mechanism which ideally is also identified using a removable memory. | 2013-12-19 |
20130339333 | PROVIDING A MODIFIED CONTENT ITEM TO A USER - Methods and systems for generating a content item associated with search results and, based on a subsequent return to the search results, providing the content item in a modified manner. | 2013-12-19 |
20130339334 | PERSONALIZED SEARCH ENGINE RESULTS - A user can selectively customize what data is provided to a search engine to influence a degree of personalization of search results. Personalized search engine results can thereby be provided to one or more applications on a client device, such as a mobile phone. The data provided to the search engine can include any of a variety of user preferences stored on the client device (e.g., music, music ratings, search queries, search results selected, etc.), or other user information, such as current location or the location of the user when applications were downloaded. Social networking websites can also be used for supplying data to the search engine. | 2013-12-19 |
20130339335 | RELATED URLS FOR TASK-ORIENTED QUERY RESULTS - Methods, computer-storage media, and graphical user interfaces are provided for identifying and presenting rich related sites for task-oriented search queries. Upon receipt of a search query input by a user, one or more query logs are analyzed to determine if the search query is a related to a task being performed by the user. If the query is determined to be a task-oriented search query, search results are identified, as is one or more Uniform Resource Locators (URLs) related to a particular search result. The related URL is presented to the user in association with the particular search result. Additional controls, e.g., search tools that facilitate querying of those URLs determined to be relevant to a particular search result, may also be provided to aid the user in performing the task at hand. | 2013-12-19 |
20130339336 | INTERACTIVE WEB CRAWLER - The claimed subject matter provides a system or method for web crawling hidden files. An exemplary method comprises loading a web page with a browser agent, and executing any dynamic elements hosted on the web page using the browser agent to insert pre-determined values. A list of form controls may be retrieved from the web page using the browser agent, and the controls may be analyzed using a driver component. Form control values may be sent from the driver component to the browser agent, and an event may be submitted to the web page by the browser agent or scripted content may be run to trigger operations on the web page corresponding to the form control values. A URL may be generated for various form control values using a generalizer. | 2013-12-19 |
20130339337 | AUTO TAGGING METHOD AND SYSTEM - A method for categorizing content from a website associated with an enterprise company for ranking of said company, said method performed by a computing device having a processing structure; and a memory including instructions executable by said processing structure to cause said processing structure to at least: request a uniform resource locator (URL) associated with the website; validate the URL; create a profile associated with the enterprise company and storing the URL in the memory; automatically crawl the website for content and to create a site index; parse the content to determine the occurrence of a predefined set of keywords pertaining to products and services and business activities of the company, and rank the keywords according to relevance pertaining to at least one category; categorize the website into at least one industry category; and determine whether the website is properly categorized. | 2013-12-19 |
20130339338 | Adding Attributes and Labels to Structured Data - A method and system associating labels and attribute values with items in a collection of data. Providers can associate attributes and labels with their data or attributes and labels can be added to existing data. A preferred embodiment allows a content provider to upload data and to attach their own custom labels and attributes to items or to use predefined labels and attributes. Providers can upload data using a user interface or a bulk upload mechanism. | 2013-12-19 |
20130339339 | ACCELERATED SEARCHING OF SUBSTRINGS - Accelerated sub-string searches on large data sets can be performed using filtering processes that can improve or optimize run time performance. A first filtering process can include partitioning a binary tree into sections to enable an exact search to replace a substring search for part of the binary tree and for part of the binary tree to be potentially excluded from substring searching. A second filtering process can include comparing count representations of entries in the binary tree and of a received input string to potentially further exclude entries from substring searching. | 2013-12-19 |
20130339340 | SEMANTIC SEARCH FOR BUSINESS ENTITIES - Systems and methods for using a semantic search to address business entities that fulfill certain criteria are provided. A free search term may be determined by a user for the semantic search. The free search term may include any object type, element or parameter the user would like to search for. An ontology which relates to a specific business or industry may be used for the semantic search. The ontology may include various business classes, roles, and individuals. In some implementations, the ontology may be generated from metadata of business objects. The semantic search may be conducted across the entire ontology to obtain search results that match the free search term. As a result, business entities that fulfill the free search term may be retrieved and provided to the user. | 2013-12-19 |
20130339341 | TRAVEL ADVISORY NOTIFICATIONS - A travel advisory generation system is provided that enables generation of travel advisories based upon one or more selected parameters (e.g., location, origin, destination, date, date range, travel provider, class of service, etc.). These travel advisories may be further incorporated into travel search results, providing relevant advisory information in conjunction, e.g., concurrently or in-line, with travel options. The advisories may be further customized in order to display desired notifications and not display undesired notifications to selected users of the travel advisory generation system (e.g., system operators, travel service providers (including, but not limited to, travel agents and travel managers of an organization), and travelers). | 2013-12-19 |
20130339342 | METHOD AND SYSTEM FOR DISPLAYING COMMENTS ASSOCIATED WITH A QUERY - A method and system for displaying comments associated with a query. The method includes receiving the query provided by a user, retrieving a set of comment clusters from a comment cluster database, selecting engaging comments from each comment cluster included in the set of comment clusters, aggregating the engaging comments that are obtained from each comment cluster, identifying a plurality of independent comments included in a list of aggregated comments and displaying a list of engaging comments to the user. The system includes an electronic device, a communication interface and a memory. The system also includes a processor to receive the query, retrieve a set of comment clusters, select engaging comments from each comment cluster, aggregate the engaging comments, identify a plurality of independent comments and display a list of engaging comments to the user. | 2013-12-19 |
20130339343 | SYSTEMS AND METHODS TO FACILITATE MEDIA SEARCH - Graphical user interfaces for searching music. A computer provides a window of a first webpage providing a user interface to search music, comprising search tools including filter tools and a keyword search tool. In response to a user search request for music via the filter tools and/or the keyword search tool, the computer provides, within the window, music search results. When a search result is selected by the user, the selected search result expands within the window. The expanded search result includes one or more of: a grab button, a download button, a share button, a license button, an audio player showing an audio waveform of the selected music search result, a description of the selected music search result, artwork associated with the search result, and an explore-more button, that when selected provides additional music related to the selected music based on acoustic similarity. | 2013-12-19 |
20130339344 | WEB-SCALE ENTITY RELATIONSHIP EXTRACTION - Techniques for displaying a relationship graph are described herein. In one example, a search term may be used to obtain a plurality of documents from a network, such as the Internet. A plurality of entities, and relationships between at least some of those entities, may be extracted from the documents. In an example user interface, representations of a plurality of entities may be displayed, such as by shapes (e.g., circles) labeled to identify people or organizations. Edges (e.g., lines) may be used to connect different representations of entities and to thereby indicate a relationship between the connected entities. In a particular example, input from movement of a cursor over an edge may result in display of a description of a relationship between the connected entities. In a further particular example, size of each entity may be related to a number of connections each has with others. | 2013-12-19 |
20130339345 | MOBILE DEVICE WITH LOCALIZED APP RECOMMENDATIONS - Mobile devices can provide app recommendations that are relevant to a location of interest. A localized app recommendation can be triggered (e.g., by a mobile device coming within a threshold distance of an application hotspot or some other user action). A location of interest can be determined. The location of interest can be the current location of the mobile device or another location (e.g., the destination in a mapping app). Using the location of interest, a localized application ranking database with app hotspot data can be queried with location data representing the location of interest. App recommendations can be received and displayed on the mobile device. Icons for apps that are relevant to the location of interest can be visually distinguished from other apps. | 2013-12-19 |
20130339346 | MOBILE TERMINAL AND MEMO SEARCH METHOD FOR THE SAME - A mobile terminal and memo search method for the same enable the mobile terminal to perform a memo search on the basis of input information on a memo. The memo search method includes: collecting, when a memo is input, input information on the memo; creating a search database on the basis of the input information; and storing the memo and the search database in an associated form. In addition, the memo search method includes: inputting a search word for memo search; collecting input information on the search word; searching a search database containing input information on stored memos for a memo matching the input information on the search word; and displaying the memo search results. | 2013-12-19 |
20130339347 | Enhanced Search Results - A search tool graphical user interface comprises search criteria selected by an operator of the search tool. One or more search results that correspond to the search criteria are displayed on the search tool graphical user interface, and an indication of characteristics is displayed for one or more of the search results. The characteristics displayed may include the availability or maturity of content associated with the search results; The search results may be sorted or filtered based on the characteristics of content associated with the search results. The characteristics maybe determined before or after the search results are identified and displayed on the search tool graphical user interface. | 2013-12-19 |
20130339348 | Wine Classification Systems and Methods of Recommending Wines - Disclosed are systems for and methods of categorizing wines, recommending sipping wines, pairing wines with foods, and arranging wines in a systematic display. In some embodiments, the disclosed systems and methods evaluate and incorporate individual taste profiles. Defining a set of wine flavor characteristics facilitates comparisons and categorization. Recommendations are facilitated by substantially correlating the individual taste profiles to the wine flavor characteristics. Likewise, wine-food pairings are facilitated by substantially correlating the known food flavors to the wine flavor characteristics. Computer-implemented embodiments allow authorized user input and consumer access via wireless devices. | 2013-12-19 |
20130339349 | METHOD AND APPARATUS FOR MUSIC SEARCHING - In an exemplary embodiment of this disclosure, a method may include generating a tempo scale set based on a received query, where the query includes a plurality of query values defining a tempo of music to be searched. A tempo word set may be constructed based on the generated tempo scale set. The tempo word set may include one or more tempo words, where each tempo word includes at least one tempo scale in the tempo scale set. The music may be identified using the constructed tempo word set. | 2013-12-19 |
20130339350 | Ranking Search Results Based on Click Through Rates - The present disclosure provides a search ranking method and apparatus based on a click through rate (CTR) to improve reusability and simplify a ranking process. Before a search ranking, click data of a user within a preset period of time is obtained and a respective weight of each characteristic is determined based on the click data. The search ranking may include the following operations. A query and one or more query targets matching the query are obtained. A respective characteristic of each of the query and the query targets are extracted. With respect to each query target, based on the characteristics of the query and the query targets as well as the respective weight corresponding to each characteristic, a respective CTR is obtained based on one or more models such as a regression model. The query targets are ranked based on their respective CTR and displayed to the user. | 2013-12-19 |
20130339351 | USING CINEMATIC TECHNIQUES TO PRESENT DATA - The present invention extends to methods, systems, and computer program products for using cinematic techniques to present data. Embodiments of the invention can be used to infer and generate cinematic techniques or combinations thereof based on a model and user action. Cinematic techniques can be used to meet the data exploration and analysis requirements of a user. As such, embodiments of the invention permit users (including non-programmers) to employ cinematic techniques (possibly in combination with other techniques) to gain insights into their data and also convey appropriate emotional messages. | 2013-12-19 |
20130339352 | SHORTEST PATH COMPUTATION IN LARGE NETWORKS - Embodiments disclosed herein provide systems, methods, and software for determining the shortest distance between vertices in relatively large graphs. In an embodiment a method includes identifying an original graph comprising a plurality of nodes and a plurality of edges, identifying a plurality of hub nodes from within the original graph, creating a hub matrix comprising the plurality of hub nodes and the shortest distance between the plurality of hub nodes, and determining a shortest distance between the at least two nodes using the original graph and/or the hub matrix. | 2013-12-19 |
20130339353 | Method for Operating a Geolocation Database and a Geolocation Database System - A method and a system for the operation of a geolocation database comprising a spatiotemporal spectrum map comprising of white space spectrum occupancy and/or white space spectrum underutilization data, wherein a) at least one white space spectrum sensor takes measurement data remote from the geolocation database; b) the measurement data are transmitted to the geolocation database; c) the spatio-temporal spectrum map and/or its parameters and/or decisions based on this spectrum map are modified in dependence of the measurements received by the geolocation database. | 2013-12-19 |
20130339354 | METHOD AND SYSTEM FOR MINING TRENDS AROUND TRENDING TERMS - A method and system for mining trends around trending terms. The method includes determining a plurality of articles, from one or more websites, in relation to a first entity for a time period. The first entity is a trending term. The method also includes generating comment clusters for the plurality of articles. Each comment cluster is generated for associated article and includes plurality of user comments. The method further includes extracting one or more entities from plurality of user comments for each of the comment clusters, the one or more entities related to the first entity. Further, the method includes enabling selection of a second entity, from the one or more entities, by the user. Moreover, the method includes rendering one or more user comments corresponding to the first entity and the second entity for the time period. The system includes an electronic device, communication interface, memory, and processor. | 2013-12-19 |
20130339355 | CLUSTERING STREAMING GRAPHS - A system for clustering vertices in a streaming graph includes a structural sampler configured to receive a stream of edges. The structural sampler includes a reservoir manager configured to receive the stream of edges and create a structural reservoir and a support reservoir and a graph manager configured to receive the structural reservoir from the reservoir manager and to create a sampled graph from the structural reservoir, wherein the sampled graph includes one or more clusters that each include one or more connected vertices. | 2013-12-19 |
20130339356 | REAL-TIME DATA THRESHOLD GENERATION AND MONITORING - A first server is configured to receive one or more summarized data groups from a second server. Each summarized data group may include: information regarding a quantity of a group of records, where the group of records includes records associated with a record type and a time interval; information regarding a quantity of records associated with an indicator within the group of records; and information regarding a failure rate associated with the group of records based on the quantity of records associated with the group of records and the quantity of records associated with the indicator within the group of records. The first server is further configured to determine a threshold based on the summarized data groups and based on the failure rates associated with the summarized data groups and send an indication to the client device based on determining that the failure rate does not satisfy the threshold. | 2013-12-19 |
20130339357 | CLUSTERING STREAMING GRAPHS - Embodiments of the invention include methods for identifying one or more clusters in a streaming graph, the method includes receiving a stream of edges and sampling the stream of edges to create a structural reservoir and support reservoir. The method also includes creating a sampled graph from the structural reservoir and identifying the one or more clusters in the sampled graph by grouping one or more connected vertices in the sampled graph. | 2013-12-19 |
20130339358 | Sharing Information With Other Users - Systems and techniques are described for facilitating sharing information. Some embodiments can receive a set of data items that is to be analyzed for sharing, analyze the set of data items based on a first set of criteria to obtain a subset of the set of data items that is a likely candidate for sharing, and present the subset of the set of data items to a first user. Additionally, some embodiments can receive a set of users that is to be analyzed for sharing information, analyze the set of users based on a second set of criteria to obtain a subset of the set of users with whom the information is likely to be shared, and present the subset of the set of users to the first user. | 2013-12-19 |
20130339359 | System and Method for Data Anonymization Using Hierarchical Data Clustering and Perturbation - A system and method for data anonymization using hierarchical data clustering and perturbation is provided. The system includes a computer system and an anonymization program executed by the computer system. The system converts the data of a high-dimensional dataset to a normalized vector space and applies clustering and perturbation techniques to anonymize the data. The conversion results in each record of the dataset being converted into a normalized vector that can be compared to other vectors. The vectors are divided into disjointed, small-sized clusters using hierarchical clustering processes. Multi-level clustering can be performed using suitable algorithms at different clustering levels. The records within each cluster are then perturbed such that the statistical properties of the clusters remain unchanged. | 2013-12-19 |
20130339360 | System And Method For Providing Classification Suggestions Using Document Injection - A system and method for providing classification suggestions using document injection is provided. Clusters of uncoded documents are accessed. A set of reference documents is obtained. Each reference document is associated with a classification code. A set of the uncoded documents selected from one or more of the clusters is identified and compared with the set of reference documents. Those reference documents that are similar to the set of uncoded documents are identified and injected into one or more of the clusters from which the set of uncoded documents is selected. The clusters and a visual suggestion for classification of at least one of the uncoded documents within one of the clusters are displayed. | 2013-12-19 |
20130339361 | System for managing web-based content data chronologically - The present invention is directed to a computer implemented system for organizing electronic content data chronologically. In operation, application software, that is preferably hosted on a remote server, organizes the electronic communications data. The electronic communications data is transmitted from multiple sources or users associated with relationship identities or identifiers. The application software organizes the electronic communications data chronologically onto interactive and displayable time-lines. The application software also preferably organizes the electronic communications data into user accessible sub-files along the time-lines based on dates of transmission. The application software runs electronic communications applications, such as e-mail or social network applications, directly or alternatively interfaces with external electronic communications applications to generate the time-lines. | 2013-12-19 |
20130339362 | METHODS AND SYSTEMS FOR AUTOMATICALLY AND EFFICIENTLY CATEGORIZING, TRANSMITTING, AND MANAGING MULTIMEDIA CONTENTS - Methods and systems for automatically and efficiently categorizing, securely transmitting, and managing multimedia contents generated from a network connection enabled digital data generating device by way of multimedia transcoding, compression, and/or classification. Content similarity between multimedia data units with one unit corresponding to one image, one video frame, or one audio frame is first detected and identified, and then used to help encode conditionally one unit given another. Based on the identified content similarity and/or the resulting compression efficiency, these multimedia units are automatically categorized in terms of their contents along with their locations, occasions, events, and/or features. Whenever network connections selected by a user are available, these encoded and categorized multimedia data units along with their metadata containing side information including their locations, occasions, events, features, and other information specified by the user are then automatically and securely transmitted to networks, cloud servers, and/or other network connected devices. | 2013-12-19 |
20130339363 | DYNAMIC VISUALIZATION GENERATION AND IMPLEMENTATION - Embodiments are directed to selecting and applying data-specific presentations, to adaptively selecting visual presentations based on historical data and to providing rendering hints for data presentations. In one scenario, a computer system receives an indication that a visual presentation is to be applied to a specified portion of data. The computer system analyzes the specified data to determine which of a plurality of data presentations is most relevant for the specified data. The relevance is based on relevancy factors including one or more of the following: end-user profile, structure of the specified data and patterns within the specified data. The computer system then applies the determined appropriate visual presentation to the specified data. | 2013-12-19 |
20130339364 | METHOD AND SYSTEM FOR AUTOMATICALLY IDENTIFYING RELATED CONTENT TO AN ELECTRONIC TEXT - The exemplary embodiments provide methods and systems for automatically identifying content related to an electronic text. Aspects of exemplary embodiments include linking topic categories, psychological states, demographic profiles, and additional content using one or more databases; in response to receiving content of an electronic text, analyzing by a software component executing on a computer the content and assigning one or more of topic categories to the content; automatically identifying at least one the psychological states of a user caused by the content and the demographic profiles whose members would be interested in the content that are linked to the one or more topic categories assigned to the content; and presenting a portion of the additional content that is linked to at least one of the identified demographic profiles and the psychological states. | 2013-12-19 |
20130339365 | INTEGRATED DEVELOPMENT ENVIRONMENT-BASED REPOSITORY SEARCHING IN A NETWORKED COMPUTING ENVIRONMENT - Embodiments of the present invention provide an approach for integrated development environment (IDE)-based repository searching (e.g., for library elements such as classes and/or functions) in a networked computing environment. In a typical embodiment, a first program code file is received from a first integrated development environment (IDE). The first program file may be associated with a set of attributes as stored in an annotation, header, or the like. Regardless, the first program file may be parsed and indexed into a repository based on the set of attributes. A search request may then be received from a second IDE. Based on the search request and the set of attributes, a matching program code file may then be identified as stored in the repository. Once identified, the matching program code file may be transmitted/communicated to the second IDE to fulfill the search request. | 2013-12-19 |
20130339366 | METHOD AND SYSTEM FOR CREATING INDICES AND LOADING KEY-VALUE PAIRS FOR NOSQL DATABASES - Systems and methods are provided for creating indices and loading key-value pairs for NoSQL databases. Attributes are created that correspond to records in a NoSQL database based on corresponding record fields. An index is created based on the attributes. A memory is loaded with attributes that correspond to a subset of the index as keys in a key-value pair and identifiers that correspond to records that correspond to the attributes as values in the key-value pair. The attributes that correspond to the subset of the index are sorted in the memory. Any duplicate attributes are identified from the sorted attributes in the memory. Any identifiers that correspond to any duplicate attributes also identify records in the NoSQL database to be evaluated as potential duplicate records. | 2013-12-19 |
20130339367 | METHOD AND SYSTEM FOR PREFERENTIAL ACCESSING OF ONE OR MORE CRITICAL ENTITIES - Embodiment is related to a method and system for preferentially accessing of one or more critical entities. One or more event data sets, related to one or more entities stored in a database, are received from one or more data sources by a processing engine. The entities, which are associated to the received event data sets are identified. The identified entities are compared with a preconfigured list of critical entities to determine at least one of the one or more entities matching with at least one critical entity. The preconfigured list of critical entities is stored in a pattern based selective index. The critical entities are stored in the graph database and indexed by the pattern based selective index. The entities are accessed, using address information associated to the respective entities, from the database when identified entities are matched with the critical entity in preconfigured list of critical entities. | 2013-12-19 |
20130339368 | METHOD AND SYSTEM FOR HANDLING NON-PRESENCE OF ELEMENTS OR ATTRIBUTES IN SEMI-STRUCTURED DATA - The invention relates to detecting non-presence of nodes in a document of semi-structured data and to creating a values index which properly reflects this non-presence. The document of semi-structured data, comprising multiple hierarchically organized nodes, is scanned for values (step | 2013-12-19 |
20130339369 | Search Method and Apparatus - The present disclosure provides techniques to solve problems (e.g., the low efficiency and a waste of resources) derived from conventional methods. These techniques may include extracting, by a computing device, the first N keywords appearing the most in target information published by target users as target words, and creating an inverted index based on information on a page of the target users and the target words, wherein the inverted index includes a target field and a page information field, and N is an integer. The computing device may receive an inquiry phrase and determine target users matching the inquiry phrase in the inverted index based on the inquiry phrase. The computing device may calculate a relevance between the matched target users and the inquiry phrase through the target field and the page information field, and return a certain result based on the relevance. | 2013-12-19 |
20130339370 | Apparatus and Method for Executing Different Query Language Queries on Tree Structured Data Using Pre-Computed Indices of Selective Document Paths - A method of operating a tree structured database includes receiving a document, forming a top-down tree characterizing the document, generating pre-computed indices characterizing the document, combining subsets of the pre-computed indices to dynamically create a table of information characterizing the document, and resolving a structured query language query against the table to form collected data. | 2013-12-19 |
20130339371 | SPATIO-TEMPORAL DATA MANAGEMENT SYSTEM, SPATIO-TEMPORAL DATA MANAGEMENT METHOD, AND PROGRAM THEREOF - It is provided a spatio-temporal data management system for managing time series data associated with a spatio-temporal region, comprising: a processor for executing a program; a memory for storing the program; and a storage device for storing the time series data. The processor segments the spatio-temporal region in time and space to generate a plurality of spatio-temporal segments, assigns, in consideration of temporal and spatial proximity of the plurality of spatio-temporal segments, identifiers for uniquely identifying the plurality of spatio-temporal segments, each of the identifiers being expressed with a one-dimensional integer value; and determines an arrangement of the time series data so that pieces of data of spatio-temporal segments that are close in the assigned identifiers are arranged close on the storage device. | 2013-12-19 |
20130339372 | SYSTEM AND METHOD FOR CONTEXUAL RANKING OF INFORMATION FACETS - The present disclosure relates to a system and method for dynamic and contextual ranking of information facets of multi-dimensional data. In one embodiment, one or more information facets or dimensions are ranked based on the context of the user and state of the information being observed. The context of observer defines how the user attention will be distributed across multiple facets of information based on the intent, goal and responsibility. The state of the observer is represented by a User Attention vector that is computed offline for multiple users based on the profile of the users and stored in a directory. The state of the information being observed is defined by value or level of significance of various facets of information and is represented by Perspective of value vector (POV) that is computed independent of the users. | 2013-12-19 |
20130339373 | METHOD AND SYSTEM OF FILTERING AND RECOMMENDING DOCUMENTS - Disclosed is a method and system for discovering documents using a computer and providing a small set of the most relevant documents to the attention of a human observer. Using the method, the computer obtains a seed document from the user and generates a seed document vector using term frequency-inverse corpus frequency weighting. A keyword index for a plurality of source documents can be compared with the weighted terms of the seed document vector. The comparison is then filtered to reduce the number of documents, which define an initial subset of the source documents. Initial subset vectors are generated and compared to the seed document vector to obtain a similarity value for each comparison. Based on the similarity value, the method then recommends one or more of the source documents. | 2013-12-19 |
20130339374 | MULTI-MEDIA MANAGEMENT, STREAMING, AND ELECTRONIC COMMERCE TECHNIQUES IMPLEMENTED OVER A COMPUTER NETWORK - Various aspects described or referenced herein are directed to different methods, systems, and computer program products relating to multi-media management and streaming techniques implemented over a computer network. In one embodiment, a Multi-Media Management and Streaming (MMMS) System may be configured or designed to provide online users with “location based” streaming radio functionality. Users from different geographic locations may access a variety of MMMS System GUIs to search for, create, and/or share customized streaming radio stations which may be configured to identify and play/stream music associated with one or more artists/bands, songs, venues, and/or events. Another aspect disclosed herein is directed to different methods, systems, and computer program products providing ticketing reservation and purchasing functionality for enabling and/or facilitating users in performing activities/operations relating to reservation and/or purchasing of tickets to events such as live performances at one or more venues. | 2013-12-19 |
20130339375 | METHOD AND SYSTEM FOR REAL-TIME FILTERING OF RELEVENT EVENTS FROM PLURALITY OF EVENTS DISTRIBUTED SPATIALLY - The present disclosure is related to a method and system for real-time filtering of relevant events from plurality of events distributed spatially. The event processing engine disclosed in the present disclosure receives plurality of events from the one or more real-time data sources. The received plurality of events is compared with significant events stored in significant event database. An entity associated with each of the significant events is identified. Thereafter, the event processing engine identifies related events associated with each of the identified entity. The related events are aggregated to form temporal sequence structure. Then the plurality of temporal sequence structures is matched with plurality of sequential event patterns to identify one or more temporal sequence structures which matches at least one sequential event pattern. The entity associated with the one or more temporal sequence structure is filtered for providing one or more actions. | 2013-12-19 |
20130339376 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD AND PROGRAM - There is provided an information processing apparatus including an experience extracting unit extracting experience information including information related to a time or a place from text information input by a user, and a user extracting unit extracting a user group in which the experience information of one or more users extracted by the experience extracting unit is compared to find a commonality in the experience information. | 2013-12-19 |
20130339377 | METHOD OF TRANSFORMING SETS OF INPUT STRINGS INTO AT LEAST ONE PATTERN EXPRESSION THAT IS STRING EXPRESSING SETS OF INPUT STRINGS, METHOD OF EXTRACTING TRANSFORMATION PATTERN AS APPROXIMATE PATTERN EXPRESSION, AND COMPUTER AND COMPUTER PROGRAM FOR THE METHODS - The present invention provides a method of extracting a transformation pattern as an approximate pattern expression. In the process of transforming the sets of input strings to at least one pattern expression, the transformation pattern transforming the sets of input strings to the pattern expression. The method includes: 1) preparing one structure including multiple nodes each representing a state and multiple edges each representing a transition; 2) generating a first reduced structure by removing at least one state in one structure from one structure and by merging at least two edges including an edge associated with the removed state in the one structure; 3) generating a first approximate pattern expression based on the first reduced structure; and 4) presenting the first approximate pattern expression. | 2013-12-19 |
20130339378 | MULTILINGUAL MIXED SEARCH METHOD AND SYSTEM - Embodiments of the present application relate to a multilingual mixed search method, a system for multilingual mixed searching, and a computer program product for multilingual mixed searching. A multilingual mixed searching method is provided. The method includes receiving a query word entered by a user and identifying source language of the query word, translating the query word from the source language to query words of a plurality of target languages, the plurality of target languages being different than the source language, using the query word in a corresponding target language as a basis for searching an index of web page information corresponding to the corresponding target language and obtaining web page information in the corresponding target language, from the web page information obtained from the index corresponding to the corresponding target language, and translating the obtained web page information from the corresponding target language to the source language. | 2013-12-19 |
20130339379 | INFORMATION RETRIEVAL AND NAVIGATION USING A SEMANTIC LAYER AND DYNAMIC OBJECTS - Systems and methods for information retrieval are provided that permit users and/or processing entities to access and define synthetic data, synthetic objects, and/or synthetic groupings of data in one or more collections of information. In one embodiment, data access on an information retrieval system can occur through an interpretation layer which interprets any synthetic data against data physically stored in the collection. Synthetic data can define virtual data objects, virtual data elements, virtual data attributes, virtual data groupings, and/or data entities that can be interpreted against data that may be stored physically in the collection of information. The system and methods for information retrieval can return results from the one or more collections of information based not only on the data stored, but also on the virtual data generated from interpretation of the stored data. | 2013-12-19 |
20130339380 | PROVIDING QUERY SUGGESTIONS - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing query suggestions. In one aspect, a method includes receiving a search string from a user device. A measure of query completeness is determined for the search string. The measure of query completeness is compared to a threshold measure of query completeness. One or more specific query suggestions are provided to the user device, selected from a plurality of specific query suggestions for the search string, when the measure of query completeness exceeds the threshold measure of query completeness; or one or more general query suggestions are provided to the user device, selected from a plurality of general query suggestions for the search string, when the measure of query completeness does not exceed the threshold measure of query completeness. | 2013-12-19 |
20130339381 | QUERY REWRITING WITH ENTITY DETECTION - A system determines whether a received search query includes an entity name, determines whether to rewrite the received search query based on information relating to prior searches involving the entity name, and rewrites the received search query when it is determined that the received search query should be rewritten. The system further determines whether to provide a suggestion of rewriting the received search query, as a rewriting suggestion, based on information relating to prior searches involving the entity name when it is determined that the received search query should not be rewritten. The system also generates the rewriting suggestion when it is determined that the rewriting suggestion should be provided. The system performs a search based on one of the received search query and the rewritten search query to obtain search results, presents the search results, and presents the rewriting suggestion when it is determined that the rewriting suggestion should be provided. | 2013-12-19 |
20130339382 | EXTENSIBLE DATA QUERY SCENARIO DEFINITION AND CONSUMPTION - Content providers define a set of scenarios that are addressed by their datasets. The scenarios include user-friendly, human-readable attributes such as a title, description, and visualization. The scenarios may also include a technical description that can be used to generate sample queries that can then be executed against the dataset. The technical description may be machine translated to arbitrary data querying protocols while maintaining the semantic meaning of the query. A user interface may be provided to allow users to intuitively generate the scenarios. In one embodiment, an extensible framework provides for the creation of protocol-specific translation plug-ins that are used to generate implementations of the scenario suitable for selected protocols. Known market-relevant translator plug-ins may also be implemented. | 2013-12-19 |
20130339383 | METHOD AND APPARATUS FOR PROVIDING SEMANTIC LOCATION IN ELECTRONIC DEVICE - A location recognition method is provided. The method includes determining location search targets in a DataBase (DB) including location information on the basis of first network information, selecting at least one place from the determined location search targets on the basis of second network information, measuring a relative distance by using first signal strength and second signal strength with respect to the selected at least one place, and recognizing the selected at least one place as a current location on the basis of the relative distance. Accordingly, various personalized service scenarios can be provided to the user. | 2013-12-19 |
20130339384 | AUDIO PLAYLIST SYSTEM AND METHOD - Information about desired songs is collected on a portable memory device in communication with a radio tuner. The radio tuner may receive signals from a terrestrial or satellite digital radio transmission, or from an analog radio transmission. These transmissions may include text data about the current song being played. Upon activation by a user, song data is stored on the memory device. The memory device is then connected to a computer system, which uses software to extract the song data and uniquely identify the song. The identified songs are stored on the computer system, and can be used to allow the user easy access to the identified song through prior art techniques. If no textual data is stored about a song, the song is identified by identifying the radio station that played the song and the time at which the user activated the mechanism. | 2013-12-19 |
20130339385 | LEVERAGING GRAPH DATABASES IN A FEDERATED DATABASE SYSTEM - A method includes receiving a database query for a first database and determining whether a second database contains data responsive to the database query, wherein the second database comprises a graph database. The method also includes retrieving responsive data from a memory device associated with the second database if it is determined that the second database contains data responsive to the database query. The method further includes responding to the database query by providing the responsive data. | 2013-12-19 |
20130339386 | PRIVACY PRESERVING METHOD FOR QUERYING A REMOTE PUBLIC SERVICE - A system and a method of querying a remote service without revealing a private document to the remote service are provided. The method includes receiving a signature of a user's private document, and querying an intermediate database with the signature of the private document to generate an intermediate result set comprising intermediate database documents, based on a computation of similarity of the signatures of the intermediate database documents to the signature of the private document. The remote service is queried, based on the intermediate result set and a final result set is received from the remote service based on the query, which can be output to the user or further processed. | 2013-12-19 |
20130339387 | Location Based Query-response Management System - A computer implemented method and system for rendering time sensitive responses to a query associated with a target location is provided. A query-response management server receives a query containing information on a target location from a first client application on a requesting user's requesting device via a network. The query-response management server dynamically retrieves location information and activity information of each of multiple responding users via the network and identifies one or more of the responding users proximal to the target location based on the location information and the activity information. The query-response management server transmits the query to a second client application on a responding device of each of the identified responding users via the network. The query-response management server receives and aggregates responses to the query from the second client application via the network and renders the aggregated responses to the first client application on the requesting device. | 2013-12-19 |
20130339388 | System and Method for Organizing Content - A method for organizing content includes receiving a first query from a first connected device, the first connected device operated on a first platform and associated with a user. The method further includes searching multiple reliable online depositories for first content relevant to the first query, organizing the first content into menus of relevant material, and making the first content available to the first connected device. The method further includes making the first content available to a second connected device, the second connected device operated on a second platform and associated with the user. | 2013-12-19 |
20130339389 | HUMAN RELATIONSHIPS REGISTERING SYSTEM AND DEVICE FOR REGISTERING HUMAN RELATIONSHIPS, PROGRAM FOR REGISTERING HUMAN RELATIONSHIPS, AND MEDIUM STORING HUMAN RELATIONSHIPS REGISTERING PROGRAM AND READABLE BY COMPUTER - To provide a human relationships registering system, a method and a server for registering human relationships, a program for registering human relationships, and a medium storing human relationships registering program and readable by a computer, all of which are used to establish wide and close relationships with members having a variety of occupations or engaged in various technical fields and to obtain expert knowledge or information. The human relationships registering system comprises first data processing units | 2013-12-19 |
20130339390 | INTELLIGENT DATA SOURCING IN A NETWORKED STORAGE SYSTEM - A storage system according to certain embodiments includes a repository of client-side data block signature information representative of a set of data blocks stored in a primary storage subsystem. In some cases, the system sources data blocks for secondary copy and restore operations from the primary storage subsystem instead of the secondary storage subsystem. Where multiple primary storage components (e.g., multiple client computing devices) contain copies of a data blocks involved in a secondary copy or restore operation, the system can decide which client to source the data block from based on sourcing criteria. | 2013-12-19 |
20130339391 | CASE DATA VISUALIZATION APPLICATION - A case data visualization application is provided that, when executed on a device, allows a user to visualize a chronology of events associated with a case, view a summary of one or more supporting details of an event, and drill-down to view specific case data of each supporting detail of an event. Thus, the case data visualization application provides a way of collecting, organizing, visualizing, and sharing data associated with a case. Furthermore, the case data visualization application allow a plurality of users to collaborate on the case, and synchronizes a plurality of supporting details created by a plurality of users that are associated with an event. | 2013-12-19 |
20130339392 | DYNAMIC MAP TEMPLATE DISCOVERY AND MAP CREATION - A method, system and computer program product for dynamic map template discovery and map creation may include determining a frequency of use of a data object in a database and discovering a dynamic map template corresponding to the data object based on the frequency of use of the data object. The method may also include creating a dynamic map from the dynamic map template in response to discovering the dynamic map template. | 2013-12-19 |
20130339393 | DYNAMIC MAP TEMPLATE DISCOVERY AND MAP CREATION - A method, system and computer program product for dynamic map template discovery and map creation may include determining a frequency of use of a data object in a database and discovering a dynamic map template corresponding to the data object based on the frequency of use of the data object. The method may also include creating a dynamic map from the dynamic map template in response to discovering the dynamic map template. | 2013-12-19 |
20130339394 | System, Method, and Computer Program Product for Modeling Changes to Large Scale Datasets - Users can model changes to entities in large scale sets of data for various portfolio holdings in different respective sandbox caches. A method includes loading, sets of data in a database and organizing the loaded data in entity caches according to an entity model, each entity cache corresponding to one or more entities associated with respective portfolio holdings. Further steps include creating an initial report of information drawn from the loaded data for manipulation by a user through a uses-interface, storing information in the initial report in a respective sandbox cache having data organized according to the entity model, and enabling the user to manipulate the respective sandbox cache to change values in the data organized according to the entity model in the respective sandbox cache without changing values of data in other sandbox caches or in the database. | 2013-12-19 |
20130339395 | PARALLEL OPERATION ON B+ TREES - Embodiments of techniques and systems for parallel processing of B+ trees are described. A parallel B+ tree processing module with partitioning and redistribution may include a set of threads executing a batch of B+ tree operations on a B+ tree in parallel. The batch of operations may be partitioned amongst the threads. Next, a search may be performed to determine which leaf nodes in the B+ tree are to be affected by which operations. Then, the threads may redistribute operations between each other such that multiple threads will not operate on the same leaf node. The threads may then perform B+ tree operations on the leaf nodes of the B+ tree in parallel. Subsequent modifications to nodes in the B+ may similarly be redistributed and performed in parallel as the threads work up the tree. | 2013-12-19 |
20130339396 | ASYNCHRONOUSLY FLATTENING GRAPHS IN RELATIONAL STORES - An application asynchronously flattens a graph in a relational store to provide fast access to node relationship queries. The application may implement an algorithm that retrieves forward paths of a start node. The algorithm may also retrieve reverse paths of end node. The application may cross-join the forward and reverse paths to determine link paths connecting the start and end nodes. The application may merge the link paths with existing paths. The application may increment path reference counts. The application may store the link paths as a link between the nodes to represent a relationship between the nodes. | 2013-12-19 |
20130339397 | METHOD AND SYSTEM FOR MULTILEVEL CREATION OF CONSOLIDATED DYNAMIC PLAYLIST AND UTILIZATION THEREOF - A method and system that includes an aggregation of clients' playlists, separate item names, and a systems own playlists that are converted to request lists. A consolidated dynamic playlist is created by a computer algorithm, which provides an order of priority depending on input variables. Depending on a system mode, consolidated dynamic playlist of a lower level can participate in higher level session of the system. | 2013-12-19 |
20130339398 | DATABASE INBOX - A database inbox of the database management system can receive a data object. The database inbox can have an inbox display area. The database inbox can be configured to receive data objects each having a distinct data type. The database inbox can serve as a data shopping cart, storing the data objects in an ad hoc manner before a table for storing the data object in a database has been created. | 2013-12-19 |
20130339399 | Dynamic Schema - A database management system can receive, from a user interface, a first data object, a second data object, and a relationship relating the first data object and the second data object. The system can determine, based on a database schema, that a database table does not exist for the first data object, the second data object, and the relationship. The system can create a database table having a first data field for the first data object, a second data field for the second data object, and the relationship. The system can then store the first data object and the second data object in the created table according to the relationship. | 2013-12-19 |
20130339400 | SYSTEM AND METHOD FOR MOBILE MULTI-TENANT DATABASE SYSTEM MANAGEMENT - A system, method, and mobile device application for managing a multi-tenant database system from a mobile device. An administrator of a multi-tenant database system is enabled to view information relating to managing the multi-tenant database from a mobile device. Some examples of the information that may be viewed include the status of datacenters, the status of instances on a datacenter, the status of user accounts, notifications to alert the administrator of changes within the multi-tenant database, alerts of potential problems. In an embodiment, the management of a multi-tenant database is further facilitated by the ability to send and implement administrative actions at the multi-tenant database, via the mobile device application. The system, method, and mobile device application may allow the administrator to perform database management duties without the restrictions of business hours or location, and without the use of a desktop or laptop computer. | 2013-12-19 |
20130339401 | Method for Reliable and Efficient Filesystem Metadata Conversion - A method for converting metadata in a hierarchical configuration within a filesystem from a first format to a second format includes reading metadata in the first format within the hierarchical configuration; writing the metadata from the hierarchical configuration into a flat file; and writing the metadata back into the hierarchical configuration, the metadata being in the second format The method can also include increasing the size of each of a first inode and a second inode within a first inode chunk in the filesystem, assigning the first inode to the first inode chunk, and assigning the second inode to a second inode chunk. | 2013-12-19 |