49th week of 2015 patent applcation highlights part 54 |
Patent application number | Title | Published |
20150347414 | NEW HEURISTIC FOR OPTIMIZING NON-CONVEX FUNCTION FOR LEARNING TO RANK - Techniques for optimizing non-convex function for learning to rank are described. Consistent with some embodiments, a search module may set an order for a group of search features. The group of search features can be used by a ranking model to determine the relevance of items in a search query. Additionally, the search module can assign a first weight factor to a first search feature in the group of search features. Moreover, the search module can calculate a mean reciprocal rank for the search query based on the assigned first weight factor. Furthermore, the search module can determine a second weight factor, using a preset incremental vector, for a second search feature in the group of search features to maximize the mean reciprocal rank for the search query. Subsequently, the search module can assign the second weight factor to the second search feature in the group of search features. | 2015-12-03 |
20150347415 | HTTP LIVE STREAMING DATERANGES - Systems and methods use a new syntax defining a daterange tag that allows an author of a media stream to embed an arbitrary set of defined ranges in the media stream associated playlist. The defined ranges may be used to provide an overview of or otherwise define the playlist and media stream structure. When a playlist is updated and the timing window of the playlist advances, any daterange tags in the playlist that map to any defined range or media segment in the updated playlist will persist in the updated playlist. Any daterange tags in the playlist that map to defined ranges that have completed will be dropped from the updated playlist. | 2015-12-03 |
20150347416 | METHOD AND APPARATUS FOR RECOMMENDING MULTIMEDIA RESOURCE - A method for recommending a multimedia resource is provided. The method includes acquiring user viewing data of a to-be-recommended multimedia resource in a playing trial run. The user viewing data includes at least user audio and video data and user video depth data. The method further includes analyzing the user viewing data to obtain user action data corresponding to the to-be-recommended multimedia resource, calculating a first user preference score of the to-be-recommended multimedia resource based on the user action data, acquiring a plurality of second user preference scores of a plurality of recommended multimedia resources, and recommending the to-be-recommended multimedia resource based on the first user preference score and the second user preference scores. | 2015-12-03 |
20150347417 | UNIVERSAL QUERY SEARCH RESULTS - Generally described, embodiments of the present invention provide the ability to generate a universal query result set from several different search index result sets by including identifications of items from the different search index result sets in an accurate manner. After a query has been submitted, search index result sets are received from several different search indexes, an allocation score for each search index is computed and a universal item score for the top-level item identified in each search index is computed. The method then combines the allocation score and the universal item score for the top level item for each search index result set and adds the item with the highest combined score to the universal query result set. | 2015-12-03 |
20150347418 | INFORMATION PROVISION DEVICE, INFORMATION PROVISION METHOD, AND INFORMATION PROVISION PROGRAM - An information provision device according to one embodiment includes an acquisition unit, a counting unit, and a presentation unit. The acquisition unit refers to data containing a location of a facility, a comment posted by a user of the facility, and a date of use of the facility by the user in association with one another, and acquires a set of an area where the facility is located, a keyword extracted from the comment, and a period corresponding to the date of use. The counting unit counts the number of sets in each time during a specified period for each pair of the area and the keyword and thereby obtains a distribution of the number. The presentation unit outputs information about the pair having a burst time where the number is larger than in other times by a specified criterion or more, in association with the burst time. | 2015-12-03 |
20150347419 | METHODS AND SYSTEMS FOR MANAGING DATA - Systems and methods for managing data, such as metadata. In one exemplary method, metadata from files created by several different software applications are captured, and the captured metadata is searched. The type of information in metadata for one type of file differs from the type of information in metadata for another type of file. Other methods are described and data processing systems and machine readable media are also described. | 2015-12-03 |
20150347420 | Performing Application Searches - According to some implementations, a technique for processing an application search query is disclosed. The techniques include receiving a search query from a partner, determining a set of subqueries based on the search query, and extracting query features of the search query from the search query. The techniques further include determining an initial result set of applications based on the set of subqueries and the query features. The initial result set includes a plurality of application representations each defining features of a different application. The techniques also include determining a score for each application in the initial result set of applications based on the set of query features and one or more scoring models, determining a result set based on the scores of the applications in the initial result set, and providing the result set to the partner. | 2015-12-03 |
20150347421 | GRAPH DATABASE FOR A CONTACT CENTER - A graph database is described for use in connection with a contact center. The graph database includes a plurality of nodes and relationships that describe the operations, entities, personnel, and attributes in the contact center. The graph database enables previously discrete contact center components such as work assignment components, reporting components, work force management components, forecasting components, and the like to operate in a seamless and integrated manner. | 2015-12-03 |
20150347422 | N-GRAM TOKENIZATION - A method and apparatus of a device that suggests a tokenized query completion for an input query prefix is described. In an exemplary embodiment, the device receives a query prefix from a client, wherein the query prefix includes a plurality of words. The device further generates a results set by searching a structured database using the query prefix for matches to the plurality of words in the query prefix. The device additionally determines a subset of query prefix that match specific fields of the results set by using the last N grams in the query prefix. In addition, the device ranks a tokenized query completion as a search suggestion using the query prefix, where the tokenized query completion includes a token that is a match between a matching word in the subset of query prefix and the corresponding specific field for the matching word. | 2015-12-03 |
20150347423 | METHODS FOR COMPLETING A USER SEARCH - A user may enter a user search into a search field on a webpage one character at a time. A backend of the webpage may receive each character of the user search as entered by the user and attempt to tokenize the user search into one or more tokens. If the last token (which may be the first token if only one token has been entered) is incomplete and/or not a word, the backend may determine possible completions of the last token based on past user searches by the user and/or other users. If the last token is a word, synonyms or other related tokens may be found for the last token. A plurality of suggested searches may be created and displayed on the webpage by using all the tokens except the last token combined with either a possible completion (if the last token is not a word) or a related token (if the last token is a word). | 2015-12-03 |
20150347424 | ELECTRONIC SYSTEMS AND METHODS FOR INTEGRATED, AUTOMATIC, MEDIUM-QUALITY AUDIO - A semiconductor device includes a single substrate including circuitry to implement a processor, a memory coupled to the processor, an audio interface module configured to provide data in pulse-code modulation (PCM) format having a first signal to noise ratio (SNR), and a medium quality speaker module configured to receive the PCM data, convert the data from the PCM format to a pulse-width modulation (PWM) format independently of the processor, and provide the data in the PWM format having a second SNR to at least one general purpose input-output pin on the substrate, the first SNR is greater than the second SNR. | 2015-12-03 |
20150347425 | SYSTEM AND METHOD FOR VALIDATING REPLICATION OF MUTABLE OPERATIONS PERFORMED ON A FILE SYSTEM OBJECT DURING A MIGRATION - Examples described herein provide for determining when individual file system operations are quiesced at a destination before validating a state of the file system object after migration. In one implementation, a metadata parameter is modified for individual file system objects after a set of mutable operations for each file system object is completed. The metadata parameter is recorded and subsequently used to determine when each of the individual file system objects are quiesced at the destination filer. The file system objects that are quiesced can be validated for migration and for implementation of any mutable file system operations that were completed at the source during the migration. | 2015-12-03 |
20150347426 | REORDERING OF DATABASE RECORDS FOR IMPROVED COMPRESSION - According to embodiments of the present invention, apparatus, systems, methods and computer program products for sorting and compressing an unordered set of data records from a structured database are provided. Fields of the unordered set of data records are prioritized based on an impact of those fields to a compression scheme for column-oriented compression. The unordered set of data records are sorted based on the prioritized field(s) with a greatest impact on the performance metric. Data of the sorted data records are compressed according to a compression scheme. In some embodiments, prioritizing the fields may be based on an anticipated level of usage of data within those fields and/or a cost function associated with a performance metric as well as optimization of compression. A performance metric may include a faster computational time, reduced I/O computation, faster scan time, etc. | 2015-12-03 |
20150347427 | USE OF USER FEEDBACK IN A CITATION SEARCH INDEX - A method and apparatus that generates a results cache using feedback from a user's search session. In this embodiment, the device receives a feedback package from a client, where the feedback package characterizes a user interaction with a plurality of query results in the search session that are presented to a user in response to a query prefix entered by the user. The device further generates a plurality of results for a plurality of queries by, running the plurality of queries using the search feedback index to arrive at the plurality of results. In addition, the device creates a results cache from the plurality of results, where the results cache maps the plurality of results to the plurality of queries and the results cache is used to serve query results to a client. | 2015-12-03 |
20150347428 | Automated Electronic Discovery Collections and Preservations - A computer-implemented method, system and computer program product for collecting information from data sources by receiving a collection request at a collection tool to collect information, where the collection request includes data source information indicating a data source from which to retrieve the information. The data source information in the collection request is associated with one or more electronic data repositories in response to the data source indicated by the data source information being previously unidentified to the collection tool. The information is collected from the one or more associated electronic data repositories. | 2015-12-03 |
20150347429 | Managing Searches for Information Associated with a Message - A method for managing information about a product. A processor searches documents for a location of a message of the product using a set of rules that are based on instructions for generating the message. The instructions are in a resource of the product. The processor then adds the location to an index of locations of the message in the documents. | 2015-12-03 |
20150347430 | TECHNIQUES FOR ENABLING COARSE-GRAINED VOLUME SNAPSHOTS FOR VIRTUAL MACHINE BACKUP AND RESTORE - A technique of backing up a workload in a virtual environment includes identifying one or more files that are associated with the workload. One or more source volumes that include the one or more files are identified. A respective target volume is provisioned for each of the one or more source volumes identified. Only dirty blocks are copied (in a snapshot mode that prevents an update to the one or more source volumes during the snapshot mode) from each of the one or more source volumes to its respective target volume. The one or more dirty blocks are then copied from each target volume to a backup medium. | 2015-12-03 |
20150347431 | Serving Expandable Content Items - In general, one aspect of the subject matter described in this specification can be implemented on a computer system. A quantity of slots associated with one or more publications can be received from/identified by a publisher. Slot properties for each of the slots in the received quantity of slots can be determined including determining the permitted expansion directions for the slots based on the slot properties. Content items can be selected for publishing from one or more expandable content items based, at least in part, on the possible expansion directions of the slots. | 2015-12-03 |
20150347432 | SYSTEM AND METHODS FOR AUTO-ALIGNING WEBSITE ELEMENTS - Systems and methods provide online tools for helping a business improve its online presence. A contact importance score rates a contact's engagement with business via purchases and online contact, and may further gauge the contact's engagement with other contacts and potential contacts. An engagement score rates a business' engagement with online visitors with respect to industry best practices. A method of generating the engagement score may include providing recommendations to the business for improving the engagement score. A method for recommending online content can identify public and privately-created content that is likely to engage a business' users. A website builder can include a tool for aligning content on the website. The website builder can further include a tool for creating a video for promoting the business. | 2015-12-03 |
20150347433 | STREAM BASED NAMED ENTITY RECOGNITION - Embodiments of the present invention relate to performing entity recognition on a stream while providing ongoing training or supplementation of an entity dictionary. In one embodiment, a method of and computer program product for stream based named entity recognition is provided. A first portion of a textual input is received. A plurality of patterns is applied to the first portion to determine that a predetermined type is present in the first portion. Approval is requested of the presence of the predetermined type. An indication of approval or disapproval of the predetermined type is received. A dictionary is supplemented according to the indication. A second portion of the textual input is received. The plurality of patterns is applied to the second portion. | 2015-12-03 |
20150347434 | REDUCING METADATA IN A WRITE-ANYWHERE STORAGE SYSTEM - Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system. | 2015-12-03 |
20150347435 | Methods and Apparatus for Distributed Data Storage - A distributed heterogeneous or homogeneous file storage system divides logical responsibility for data from actual control of the data by using separate file and storage managers. Each file manager provides access to stored files and stores metadata associated with each of the files for which it is responsible. A file manager control component allocates responsibilities among file managers, assigns management responsibilities for individual files, and maintains a record of which files are assigned to each manager. Each storage manager is responsible for managing storage of files on data storage devices and maintains a record of the location of each stored file. A storage manager control component allocates responsibilities among storage managers, assigns responsibilities for individual files, and maintains a record of which files and storage devices are assigned to each manager. A client provides user access, initiates actions within the system, and implements a redundant data recovery and reconstruction scheme. | 2015-12-03 |
20150347436 | QUERY AUTO-COMPLETION - A method of providing predictive search query recommendations for a search query. The method can be implemented via execution of computer instructions configured to run at one or more processing modules and configured to be stored at one or more non-transitory memory storage modules. The method can include receiving the search query from a user. The method also can include determining the predictive search query recommendations for the search query using a tree data structure. At least one top layer of the tree data structure can include at least one trie query node and bottom layers of the tree data structure can include ternary tree query nodes. The method further can include sending the predictive search query recommendations to the user. Other embodiments of related systems and methods are also disclosed. | 2015-12-03 |
20150347437 | Most Relevant Application Recommendation Based on Crowd-Sourced Application Usage Data - Crowd-sourced localized application usage data is collected from mobile devices at a usage location and sent to a network-based service. The network-based service analyzes the data to determine a single most relevant application correlated to the usage location. Once the most relevant application is determined, a recommendation for the application is sent to client devices operating at the usage location. In some implementations the data is processed to determine whether the usage location is a chained venue, a large venue or an event. Once the usage location has been determined, the most relevant application can be selected for recommendation. | 2015-12-03 |
20150347438 | TOPIC AUTHORITY SUGGESTIONS - Exemplary methods, apparatuses, and systems determine first and second entities within a social networking system are each associated with a topic. A relationship between the first entity and the second entity is detected. The first entity is determined to be an authority on the topic based upon the detected relationship between the first entity and the second entity. In response to detecting an indication that a user of the social networking system may be interested in the topic, the user is presented with content posted to the social networking system by the first entity based upon determining the first authority is an authority on the topic. | 2015-12-03 |
20150347439 | INCREMENTAL DATA PROCESSING - Event logs in a video advertisement insertion network are processed to remove duplicate entries. One or more ad servers are continuously generating new event entries and writing them to a database. The entries are randomized such that generated time contiguous entries are distributed over multiple storage locations, thereby facilitating resource scaling and a uniform use of storage and computing resources. The distributed entries are read from the storage locations using sequential reads of chunks of the entries and processed to remove duplicate entries. | 2015-12-03 |
20150347440 | DOCUMENT TRACKING FOR SAFE SAVE OPERATIONS - Systems and methods are disclosed that track a document within a file system using document identifier (DOCID) that is preserved during safe save operations. The DOCID can be a universally unique identifier (UUID). The DOCID can be generated on a local file system or generated during a synchronization process with a remote synchronization service. Applications can opt in to document tracking. The kernel of the operating system can monitor file system operations on a per-application and per-thread basis and determine when a processing thread is about to perform a safe save. When a sequence of file system operations indicates that a safe save is to be performed, the kernel can generate and store a tombstone record that includes the DOCID and other metadata of the tracked document and pass the DOCID and metadata to the newly saved document. | 2015-12-03 |
20150347441 | MEDIA ASSET PROXIES - Disclosed herein are systems, methods, and non-transitory computer-readable storage media for creating and using media asset proxies. The media asset proxies represent a digital media asset and are created by filtering and modifying elements from the digital media asset. The media asset proxies can be queried in the same manner as their corresponding digital media asset. | 2015-12-03 |
20150347442 | DATA EMBEDDING IN RUN LENGTH ENCODED STREAMS - One or more system, apparatus, method, and computer readable media for embedding supplemental data into a compressed data stream to form a supplemented compressed data stream. In embodiments, supplemental data is embedded at a run-length encoded (RLE) compression stage. In embodiments, supplemental data is extracted from a supplemented RLE stream to recover supplemental data and/or reconstruct the compressed data stream from which the supplemental data is extracted. | 2015-12-03 |
20150347443 | SEARCHABLE DATA ARCHIVE - A method and apparatus are provided to store transaction records in a retrievable form and to enable subsequent search and retrieval of stored transaction records. Transaction records are captured and then grouped according to predetermined grouping criteria such that they may be indexed to a first level and then efficiently compressed for bulk storage. In the event that records need to be retrieved subsequently, the first level index may be used to select one or more groups of records satisfying first level search criteria and, following retrieval of the selected groups from storage and de-compression, a second level index may be created to enable a more detailed record-level search for matching records in the retrieved groups. Preferably, the same indexing technique is used for both the first and second level of indexing. | 2015-12-03 |
20150347444 | CLOUD LIBRARY DE-DUPLICATION - Disclosed herein are systems, methods, and non-transitory computer-readable storage media identifying duplicate media items that occur during a batch upload process from a client device to the cloud media library and performing media de-duplication and re-mapping of duplicate media items. | 2015-12-03 |
20150347445 | DEDUPLICATION OF FILE - The present invention discloses a method for deduplication of a file, a computer program product, and an apparatus thereof. In the method, the file is partitioned into at least one composite block, wherein the composite block includes a fixed-size block and a variable-size block, the variable-size block being determined based on content of the file. Then a deduplication operation is performed on the at least one composite block. | 2015-12-03 |
20150347446 | POLICIES FOR OBJECTS COLLABORATIONS - A computerized method for managing collaboration in a computerized system, comprising repeatedly applying any one of rules defined in the computerized system pertaining to objects of the computerized system, wherein the any one of the rules comprises an at least one condition concerning collaborativity of an object to which the any one of the rules pertains and the at least one condition is based on metadata of the object, by evaluating any one of conditions in the any one of the rules, thereby determining collaborativity of any one of the objects to which the any one of the rules pertains, and an apparatus for performing the same. | 2015-12-03 |
20150347447 | Method and architecture for synchronizing files - Techniques for providing pervasive synchronization services to digital assets are described. With the synchronization services, copies of a digital asset, regardless where they are physically located as long as they are in predefined or registered storage area (e.g., a folder or repository), are kept synchronized. In other words, when one has made a change to a file on one computer, copies of the file distributed on other computers are all updated with the change. The pervasive synchronization services are performed by using metadata sets of the digital assets without releasing the content of the digital assets. A metadata set includes some or all of header information of a file holding a digital asset and supplemental information generated about the file, wherein the supplemental information includes at least location information to indicate where there are copies of the file. The location information facilitates a computing device to synchronize all the copies of the file with a change made by a user to one of the copies. | 2015-12-03 |
20150347448 | SECURE SYNCHRONIZATION APPARATUS, METHOD, AND NON-TRANSITORY COMPUTER READABLE STORAGE MEDIUM THEREOF - A secure synchronization apparatus, method, and non-transitory computer readable storage medium thereof are provided. The secure synchronization apparatus of the present invention includes a storage unit, an interface, and a processing unit. The interface is electrically connected to a storage server via a network. The processing unit is electrically connected to the storage unit and the interface. The processing unit is configured to execute an operating system and execute an agent program installed on the operating system. The agent program configures an isolated space, manages an extended space within the storage unit, and synchronizes an object between the isolated space, extended space, and the storage server through the interface. The isolated space and the extended space are only recognized by the agent program installed on the operating system and the object in the two spaces is accessible only via the agent program. | 2015-12-03 |
20150347449 | LOG-STRUCTURED FILED SYSTEM WITH FILE BRANCHING - Disclosed are systems, computer-readable mediums, and methods for reading a sequence number from regions of a solid state storage device. A latest region is determined based upon the sequence numbers and a checkpoint file is read within the latest region. A request for a block of data of a first branch is received. A first block of pointers associated with the first branch from the checkpoint file is read. A first pointer from the first block of pointers and a second block of pointers pointed to by the first pointer are read. A second pointer from the second block of pointers and a third block of pointers pointed to by the second pointer are read. A third pointer from the third block of pointers and data pointed to by the third pointer are read. The block of data of the first branch is determined based upon the read data. The block of data is returned. | 2015-12-03 |
20150347450 | INTER-VERSION MAPPING OF DISTRIBUTED FILE SYSTEMS - Systems, methods, and software described herein to provide data to large-scale processing framework (LSPF) nodes in LSPF clusters. In one example, a method to provide data includes receiving an access request from a LSPF node to access data in accordance with a version of a distributed file system. The method further includes, responsive to the access request, accessing the data for the LSPF node in accordance with a different version of the distributed file system, and presenting the data to the LSPF node in accordance with the version of the distributed file system used by the LSPF node. | 2015-12-03 |
20150347451 | HETEROGENEOUS DISTRIBUTED FILE SYSTEM USING DIFFERENT TYPES OF STORAGE MEDIUMS - According to one general aspect, a system may include a plurality of data nodes. Each data node may include either or both of a first storage medium and a second storage medium that is slower than the first storage medium. Each data node may be configured to store a piece data in either the first storage medium or the second storage medium. The system may be configured to store a plurality of copies of an active piece of data within two or more data nodes. A fast copy of the active piece of data may be stored by a first storage medium of a first data node. One or more slow copies of the active piece of data may be stored by respective second storage mediums of one or more respective other data nodes. | 2015-12-03 |
20150347452 | FILE MANAGEMENT SERVER, AND SYSTEM AND METHOD FOR FILE MANAGEMENT - Provided are a file management server and a system and method for managing a file. The system includes a user terminal configured to request a unique file number for a file when the file is generated, and a file management server configured to generate the unique file number corresponding to the file and transmit the unique file number to the user terminal upon the request, track a usage history of the file through the unique file number, and manage a right to use the file according to a user status related to the file when a user terminal inquires about whether the file is usable. | 2015-12-03 |
20150347453 | SYSTEM AND METHOD OF IMPLEMENTING AN OBJECT STORAGE INFRASTRUCTURE FOR CLOUD-BASED SERVICES - A method for storing objects in an object storage system includes the steps of establishing a network connection with a client over an inter-network, receiving an upload request indicating an object to be uploaded by the client, selecting at least two storage nodes on which the object will be stored, receiving the object from the client via the network connection, and streaming the object to each of the selected storage nodes such that the object is stored on each of the selected storage nodes. The method can also include writing an object record associating the object and the selected storage nodes to a shard of an object database and generating a Universally Unique Identifier (UUID). The UUID indicates the shard and the object ID of the object record, such that the object record can be quickly retrieved. Object storage infrastructures are also disclosed. | 2015-12-03 |
20150347454 | EFFICIENT STATE CHANGE SUPPORT FOR HIERARCHICAL DATA MODELS IN A VIRTUALIZED SYSTEM - Methods, systems and computer readable media for efficient state change support for hierarchical data models in a virtualized system are described. In some implementations, the method can include determining a system status including a system-level bit masked word having a plurality of bits, each bit corresponding to a status of a different hierarchical level of the system, and receiving a change notification. The method can also include querying an entity at a lower hierarchy level if a cascaded state change is identified for that entity. The method can further include continuing to query one or more entities in successively lower hierarchy levels so long as a cascaded state change is identified for a corresponding entity in a lower hierarchy level. The method can also include determining the current status for one or more entities having a changed status. Identifying a cascaded state change can include performing a logical exclusive OR operation on a previous status bit masked word and a current status bit masked word of an entity. | 2015-12-03 |
20150347455 | REPRESENTING A VENUE - Techniques for storing information representing a venue are described. A system can represent a venue as a set of one or more nested data objects. A top layer of the nested data objects can include a venue data object that stores coarse information of the venue, including an identifier, a name, and a geometry of the venue. A second layer of data objects that are nested in the venue data object can include one or more building data objects that have finer granularity than the venue data object. Each building data object can store information on a building located at the venue, including name of the building, address of the building, and a geometry of the building. Additional layers of data objects representing further details of each building. | 2015-12-03 |
20150347456 | SCALABLE AND USER FRIENDLY FILE VIRTUALIZATION FOR HIERARCHICAL STORAGE - In one embodiment, a method includes generating a file list for an aggregation of files based on a file pattern descriptor for each file in the aggregation of files or a file name for each file in the aggregation of files. The method also includes opening a session with a storage system manager and writing data from each file in the file list to a storage tier of a storage system. The method further includes writing metadata and storage location information from each file in the file list to an index file, closing the index file, and closing the session with the storage system manager. Other systems, methods, and computer program products are described according to more embodiments. | 2015-12-03 |
20150347457 | AUTOMATIC UPDATE FOR MAP CACHE - Systems, methods, and other embodiments associated with automatically updating a map cache are described. In one embodiment, a method includes detecting a modification to a spatial database record having a geometry attribute and recording, in a log table, an identifier for the record that was modified. The method includes periodically accessing the log table to identify map tiles that include at least one geometry of records that have been modified and periodically generating the identified map tiles. The generated map tiles are stored in a map cache. | 2015-12-03 |
20150347458 | VISIBILITY OF A POINT OF INTEREST BASED ON ENVIRONMENTAL CONDITIONS - Architecture having an algorithm that computes visible structures for a user within a distance defined by one or more environmental conditions. An environmental condition such as reduced visibility due to a weather condition such as rain, fog, etc., can be used to define a radius about the user in which possible points of interest (POIs) can be identified as viewable based on current weather visibility data. The altitude of the user is considered when identifying the possible POIs. The user is more likely capable of viewing other structures as POIs when the user is at a higher altitude. If the user is known to be standing on a ridge overlooking a city, this information can be processed by the algorithm to then show more POIs relative to this elevated user location than if the user was at approximately zero altitude. A sight map is generated based on these considerations. | 2015-12-03 |
20150347459 | METHOD AND DEVICE RELATING TO INFORMATION MANAGEMENT - A method and an arrangement for use in a device, such as a communication device, may be configured to generate an assembly based on one or more images. The system may include an image retrieval portion for retrieving the one or more images from an image source, an arrangement for fetching data corresponding to the one or more images, and converting the data to presentable information, and an arrangement for generating the assembly including the one or more images and the presentable information provided with description. | 2015-12-03 |
20150347460 | USER TARGETED MEDICAL IMAGING AND INFORMATION PACKAGING, COMPRESSION AND DISTRIBUTION SYSTEM - A computer-based method and system of distributing biological sample data acquired as a digital image of a subject biological sample. The acquired digital image and image capture data are processed according to at least one user. This results in processed image data and capture metadata. The processed image data represents biological sample data of the subject biological sample. A package processing combines the processed image data and capture metadata into a working Package. The method and system enables simultaneous electronic access to the working Package by multiple users, across multiple sectors, in addition to the one user. | 2015-12-03 |
20150347461 | DISPLAY APPARATUS AND METHOD OF PROVIDING INFORMATION THEREOF - A display apparatus and a method of providing information thereof are provided. The information providing method of the display apparatus includes displaying image content, recognizing at least one of a user motion and a user voice to obtain information related to the image content while the image content is displayed, generating query data according to the recognized at least one of the user motion and the user voice, and transmitting the query data to an external server, and in response to receiving information related to the image content from the external server in response to transmitting the query data, providing the received related information. | 2015-12-03 |
20150347462 | METHOD AND DEVICE FOR REPLACING THE APPLICATION VISUAL CONTROL - A method, device, and system are provided for change the application visual control. In the method: the terminal device obtains an image of a current scene. The terminal device performs intelligent matching on the image of the current scene and replaces the application visual control based on a result of intelligent matching. The system includes a device having a hardware processor and a non-transitory storage medium. The system also includes a database configured to store a plurality of subjects and corresponding pictures. | 2015-12-03 |
20150347463 | METHODS AND SYSTEMS FOR IMAGE BASED SEARCHING - Methodologies and apparatus for searching based on representative images are provided. The method includes the steps of providing one more images representing subject matter that can be searched for, receiving a selection of the one or more provided image representations, performing a search for subject matter represented by the selected image, and providing the search results. | 2015-12-03 |
20150347464 | CONTROL METHOD AND NON-TRANSITORY COMPUTER-READABLE RECORDING MEDIUM - A display control unit vertically divides a case display area in accordance with the number of disease names selected by a user to create a number of sub-areas equal to the number of disease names. Each of the sub-areas is vertically elongated so that thumbnail images of similar cases of the corresponding disease name are displayed so as to be aligned in a column. The display control unit displays, in each sub-area, thumbnail images of similar cases of the corresponding disease name so that the thumbnail images are aligned in a column in order of decreasing similarity to a search query image displayed in a layout area. | 2015-12-03 |
20150347465 | SHARING PHOTOS - Implementations generally relate to sharing photos. In some implementations, a method includes collecting photos associated with one or more objects, where the photos are collected from a plurality of users. The method also includes collecting attention information associated with the one or more objects. The method also includes generating an attention map based on the attention information. The method also includes grouping the one or more photos into groups of photos based on the attention map. The method also includes causing the groups of photos to be displayed to a target user based on one or more predetermined criteria. | 2015-12-03 |
20150347466 | METHOD AND APPARATUS FOR IMAGE PROCESSING, PROGRAM, AND RECORDING MEDIUM - An information processing apparatus includes a managing unit that manages a scale calculated based on descriptions of an operation performed on a predetermined item and a series to which the item belongs in association with each other, a first extracting unit that extracts items belonging to the same series as top N series, obtained by sorting the scales, from among a plurality of items, a taste managing unit that manages taste of a user, a second extracting unit that calculates the degree of similarity between the taste managed by the taste managing unit and each item to extract items with higher degrees of similarity, and a recommending unit that recommends a predetermined number of items among the items extracted by the first extracting unit and the items extracted by the second extracting unit to the user. | 2015-12-03 |
20150347467 | DYNAMIC CREATION OF DOMAIN SPECIFIC CORPORA - A model of a domain is received, wherein the model has a plurality of elements. A corpus of select documents covering the plurality of elements of the model is also received. A plurality of select topics is generated from the corpus of select documents. Topics of an additional document are compared to the plurality of select topics to calculate a distance between the topics of the additional document and the plurality of select topics. Upon the distance meeting a threshold value, a new corpus is generated to include the additional document. The new document is annotated with the plurality of elements of the model. | 2015-12-03 |
20150347468 | GROUPING DATA IN A DATABASE - According to embodiments of the present invention, two or more attributes that are included in a plurality of attributes are aggregated into a group defined by a first data definition language syntax. The first data definition language syntax defines the group as having a groupID and one or more of an attribute definition defined in a comma-separated list and a group definition. The attribute definition is defined by a second data definition syntax. The first data definition language syntax includes the second data definition language syntax. The first data definition language syntax is structured in a manner to allow a database operation associated with the group to be applied to all attributes and/or groups included therein. | 2015-12-03 |
20150347469 | METHOD OF MANAGING DATA IN ARCHIVE SYSTEM BASED ON OPTICAL DISK - Disclosed herein is a method of managing data in an optical disk-based archive system. In an embodiment, when data is written in an optical disk, the metadata of the optical disk may be generated and stored. When a cartridge unit is drawn from an archive system and moved to a second archive system, the metadata of all the optical disks kept in the cartridge unit may be sent to another archive system through a medium. The metadata may be sent to another archive system over, a network, or the metadata may be copied to external memory and sent to another archive system. Furthermore, when a new cartridge unit is mounted on an archive system, a compression file may be received over a network or through external memory, and the metadata of all the optical disks kept in the new cartridge unit may be restored by decompressing the compression file. | 2015-12-03 |
20150347470 | RUN-TIME DECISION OF BULK INSERT FOR MASSIVE DATA LOADING - A method can include initiating execution of a database command, the database command associated with a base table with at least one row to copy to a target table, the database command associated with a non-bulk insert mode; making a run-time decision on whether to automatically convert the insert mode from the non-bulk insert mode to a BULK insert mode based on the number of row buffers filled with rows from the base table during execution of the database command; and inserting at least one row into the target table using an insert mode based on the run-time decision. | 2015-12-03 |
20150347471 | AUTOMATICALLY GENERATING A SEMANTIC MAPPING FOR A RELATIONAL DATABASE - A method for automatically generating a semantic mapping for a relational database RDB includes obtaining a first semantic mapping from a first RDB to an ontology of linked data; obtaining a schema mapping from the first RDB to a second RDB; and generating a second semantic mapping from the second RDB to the ontology of the linked data based on the first semantic mapping and the schema mapping. | 2015-12-03 |
20150347472 | METHOD AND APPARATUS FOR GENERATING AN ELECTRONIC DOCUMENT SCHEMA FROM A RELATIONAL MODEL - Methods and apparatus for generating a schema for data asset information are disclosed. In one example, complex type information corresponding to a logical relational data model that defines an organization of the data asset information is accessed. The logical relational data model includes a parent entity and child entities corresponding to the parent entity. Treating the complex type information produces scrubbed complex type information. The treatment of the complex type information includes, at least, the removal of foreign keys from child entities. The scrubbed complex type information is then translated to produce a hierarchical data model corresponding to the logical relational data model. A schema is then generated for the data asset information based upon the hierarchical data model. | 2015-12-03 |
20150347473 | DATABASE PARTITION - A method for partitioning a database includes obtaining business dependency between data in a plurality of tables in the database on the basis of a business process associated with the database; generating, on the basis of the business dependency, a dependency graph describing a dependency relationship between the plurality of tables; cutting the dependency graph into at least two sub-graphs; and vertically partitioning the database into at least two parts corresponding to the at least two sub-graphs respectively. | 2015-12-03 |
20150347474 | Venue Data Validation - Techniques for validating venue data are described. The venue data can include records describing physical features of a venue and records describing conceptual features of the venue. A validation engine can detect conflicts between records in the venue data or conflicts between records in the venue data and external data. The conflict can include a physical conflict between two physical features, e.g., when a floor of a building is larger than a footprint of the building, a conceptual conflict between two occupants of a venue, e.g., when an airport baggage claim area is located next to a high school, or a relationship conflict between an occupant and a venue in which the occupant is allegedly located, e.g., ski resort located in an office building. The conflict can be defined in conflict rules. The validation engine can learn the conflict rules from historical venue data and truth references. | 2015-12-03 |
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. | 2015-12-03 |
20150347476 | CONTENT MANAGEMENT IN A TRAVEL MANAGEMENT SYSTEM - Methods, apparatus, and computer program products for managing content in a travel management system. A standard data element and a non-standard data element comprising the content are received from one or more content providers. A first data container for the standard data element and a second data container for the non-standard data element are created in an extended record data structure. The first data container includes a common record identifier and first data values for first attributes corresponding to the standard data element. The second data container includes the common record identifier and second data values corresponding to second attributes for the non-standard data element. The travel management system manages access to the first container and the second container in the extended record data structure based on the common record identifier. | 2015-12-03 |
20150347477 | Streaming File System - An indexing system and method for a filesystem, such as a database using the POSIX application programming interface, uses two fractal tree indices, a metadata index mapping the full pathname of files to file metadata, preferably data such as returned with a struct stat call, and a data index mapping pathname and block number to a datablock of a predetermined size, optionally a fixed size. The data index has keys ordered lexicographically, and the system and method allows for modifying existing keys, and creating new keys if there is no existing key, for writes smaller than the predetermined block size and for unaligned writes. The invention provides at least about an order of magnitude improvement in microdata operations (such as creating and scanning files smaller than a predetermined size, such as 512-byte files), and has write times comparable with existing file systems. | 2015-12-03 |
20150347478 | SYSTEMS AND METHODS FOR CONTEXT-AWARE AND PERSONALIZED ACCESS TO VISUALIZATIONS OF ROAD EVENTS - The present disclosure is directed to systems and methods for context-aware and personalized access to data corresponding to an event. The data is related to multiple predefined parameters including a location, date, time, and a classifier representing a status or an impact intensity for the event. The method includes receiving the data and an event type for the data. The event type is selected from multiple predefined event types. The method also includes creating a hierarchical data structure configured to spatially index the data based on the selected event type. The hierarchical data structure includes a node representing the selected event type. The node is augmented using a linked list for referring to the data to be stored in a database. The node is associated with a frequency of occurrence of the selected event type. | 2015-12-03 |
20150347479 | STORING AND QUERYING MULTIDIMENSIONAL DATA USING FIRST AND SECOND INDICIES - The present disclosure relates to methods and systems for storing and querying data. According to the embodiments of the present invention, two-layer indexes are created for multi-dimension data, wherein the primary index is created based on two or more dimensions to retrieve respective data units of the data, while the secondary index is created based on specific dimensions to retrieve respective data blocks in the data unit. Correspondingly, when receiving a multi-dimension query request for data, the primary retrieval first determines a data unit including the target data based on a primary index, and then the secondary retrieval quickly locates a data block including the target data based on the secondary index. In this way, the multi-dimension retrieval can be efficiently performed. Moreover, by appropriately setting the size of a smallest data block, the I/O efficiency of data access will be significantly enhanced. | 2015-12-03 |
20150347480 | Process and Framework For Facilitating Data Sharing Using a Distributed Hypergraph - A knowledge model “overlay” for organizing and analyzing large, dynamic data volumes is implemented as a hypergraph that manifests as a result of a distributed theory-driven data source transformation process. This process maps exponentially growing data into an asymptotically limited information space. Within this space, real-world entities (e.g. people, computers, cities, Earth) and their complex interdependencies (e.g. social networks, connectivity, causal relationships) are represented as attributed hypergraph elements (i.e. both hypervertices and hyperedges). Attributes are represented as state vectors affixed to any hypergraph element. Transformation of source system data into this overlay structure is accomplished with minimal data movement and replication using a universal “pointer” like mechanism that is managed in a decentralized fashion by the respective transformation components. Access to the knowledge overlay is performed via a hypergraph communication protocol encapsulated within a common hypergraph API and accompanying hypergraph toolkit. | 2015-12-03 |
20150347481 | STORING AND QUERYING MULTIDIMENSIONAL DATA USING FIRST AND SECOND INDICIES - The present disclosure relates to methods and systems for storing and querying data. According to the embodiments of the present invention, two-layer indexes are created for multi-dimension data, wherein the primary index is created based on two or more dimensions to retrieve respective data units of the data, while the secondary index is created based on specific dimensions to retrieve respective data blocks in the data unit. Correspondingly, when receiving a multi-dimension query request for data, the primary retrieval first determines a data unit including the target data based on a primary index, and then the secondary retrieval quickly locates a data block including the target data based on the secondary index. In this way, the multi-dimension retrieval can be efficiently performed. Moreover, by appropriately setting the size of a smallest data block, the I/O efficiency of data access will be significantly enhanced. | 2015-12-03 |
20150347482 | OPTIMIZING A CONTENT INDEX FOR TARGET AUDIENCE QUERIES - Apparatus and methods are provided for indexing electronic content to be served to users' mobile and/or stationary communications and computing devices. An index is composed of multiple slices, with each slice storing multiple entries and each entry representing one content item or one campaign or collection of content items. An entry is populated with tokens representing attribute/value pairs of a target audience of the content item and/or property/value pairs of the item or the item's campaign. A query or request to identify content items for serving to a particular user is similarly formatted with tokens representing attribute/value pairs of the user and/or item/campaign. Queries can then be executed rapidly across any or all index entries in any or all slices. Within a slice, entries may be sorted by value or score, and integer components within an individual entry may be sorted to facilitate rapid comparison with a query. | 2015-12-03 |
20150347483 | COMBINING ROW BASED AND COLUMN BASED TABLES TO FORM MIXED-MODE TABLES - Various ways of storing data in tabular form such that some records are stored in a row oriented manner and some data is stored in a column oriented manner. The records respectively stored in the row and column oriented manners may, or may not, overlap (in whole or in part. Some embodiments accomplish this dual orientation of data by: (i) using a range partition; (ii) using a union all view command; and/or (iii) using a first table, a staging table and a materialized query table. | 2015-12-03 |
20150347484 | COMBINING ROW BASED AND COLUMN BASED TABLES TO FORM MIXED-MODE TABLES - Various ways of storing data in tabular form such that some records are stored in a row oriented manner and some data is stored in a column oriented manner. The records respectively stored in the row and column oriented manners may, or may not, overlap (in whole or in part. Some embodiments accomplish this dual orientation of data by: (i) using a range partition; (ii) using a union all view command; and/or (iii) using a first table, a staging table and a materialized query table. | 2015-12-03 |
20150347485 | GENERATING A MAPPING RULE FOR CONVERTING RELATIONAL DATA INTO RDF FORMAT DATA - A method for generating a mapping rule for converting relational data into RDF format data includes obtaining a first mapping rule for converting relational data in a first relational database into RDF format data, wherein a URI pattern of the first mapping rule expresses features of the relational data in the first relational database; parsing a generated rule for the URI pattern of the first mapping rule; determining that a second relational model of the second relational database and a first relational model of the first relational database conform to pattern matching; and generating a second mapping rule for converting the relational data of the second relational database into RDF format data, based on a mapping relationship between the generated rule and the pattern matching of the first relational model and the second relational model. | 2015-12-03 |
20150347486 | AGNOSTIC DATA BROKER - Exemplary embodiments are provided for integrating data into an agnostic data broker, wherein a type and structure of the data is previously unknown to the data broker. Aspects of the exemplary embodiment include ingesting the data from a data source by providing a first API through which a first API call is received that includes both the data and a manifest that describes a type of the data and the structure of the data; storing the data in a data repository; and providing a second API through which a second API call is received that queries the data based on the manifest. | 2015-12-03 |
20150347487 | System and Method for Capturing Data Sent by a Mobile Device - Systems and methods for providing capture, archival, and analysis of data sent by mobile devices over a carrier network, with the systems and methods not requiring the installation of any additional software on the mobile devices, the systems and methods also providing for alerts to be generated based on the content of the data. | 2015-12-03 |
20150347488 | APPLICATION SUGGESTION FEATURES - This application relates to features for a mobile device that allow the mobile device to assign utility values to applications and thereafter suggest applications for a user to execute. The suggested application can be derived from a list of applications that have been assigned a utility by software in the mobile device. The utility assignment of the individual applications from the list of applications can be performed based on the occurrence of an event, an environmental change, or a period of frequent application usage. A feedback mechanism is provided in some embodiments for more accurately assigning a utility to particular applications. The feedback mechanism can track what a user does during a period of suggestion for certain applications and thereafter modify the utility of applications based on what applications a user selects during the period of suggestion. | 2015-12-03 |
20150347489 | INFORMATION RETRIEVAL SYSTEM AND METHOD BASED ON QUERY AND RECORD METADATA IN COMBINATION WITH RELEVANCE BETWEEN DISPARATE ITEMS IN CLASSIFICATION SYSTEMS - An information retrieval system that interprets a query and determines a rank or score for selected records is disclosed herein, where the rank or score is based partly on determining the relevance between disparate items in a classification system. The query can be expanded by utilizing metadata about the query, which results in one or more query values for comparison. Depending on the type of records that are to be ranked or scored, different characteristics of the selected records will be extracted, optionally expanded, and then converted into record values for comparison. The query values and record values, which are part of the same classification system, can then be scored based on the relevance between these values in this classification system. Results can be weighed, or the final record score can be weighed. Finally, records are displayed to the user in final rank or score order. | 2015-12-03 |
20150347490 | ENHANCING EVENT SUMMARIES OF SYNCED ONLINE CONTENT MANAGEMENT SYSTEM INTERACTIONS - Disclosed are systems, methods, and computer-readable storage media for enhancing event summaries of synced online content management system interactions. Users can identify one or more of the collapsed events markers that have pointers to the original, uncondensed, event markers. Upon identifying the one or more collapsed event markers, users can add additional data, via the pointers, to the original, uncondensed, event markers that were used to generate the collapsed event marker. The content management system can then perform a new analysis of the shared dataspace, analyzing the event markers using pre-existing data and the newly added data to create additional collapsed event markers, modify previously generated collapsed event markers, or remove/replace collapsed event markers. These enriched collapsed event markers can then newly presented to the user. | 2015-12-03 |
20150347491 | MANAGING USER RATINGS IN A WEB SERVICES ENVIRONMENT - Systems and methods for managing user ratings in a web services environment. A method includes storing a comment associated with a web service and storing an influence rating associated with an author of the comment. The method also includes transmitting information associated with the web service, the comment, and the influence rating to a user. Additionally, the method includes receiving feedback from the user, and determining an updated influence rating based upon the feedback and the influence rating. | 2015-12-03 |
20150347492 | REPRESENTING AN OUTLIER VALUE IN A NON-NULLABLE COLUMN AS NULL IN METADATA - According to embodiments of the present invention, methods, systems and computer-readable media are presented for accessing data within a database object, wherein an element of the database object is stored among a plurality of different storage regions with each storage region being associated with first and second range values indicating a value range for element values within that storage region. One or more element values within a storage region are identified residing outside a range of values of remaining elements within that storage region. Each identified element value is mapped to a second value. The first and second range values are determined for the storage region in accordance with the range of values of the remaining elements within that storage region. The storage region is scanned in accordance with a comparison of a requested value to at least one of the determined first and second range values of those storage regions. | 2015-12-03 |
20150347493 | SYSTEM AND METHOD FOR PROCESSING DATA - Disclosed are a system and method for processing data. The system for processing data according to an embodiment of the present disclosure includes a determiner configured to receive one or more sets of input data and a set of metadata about a structure of each of the sets of input data and to determine whether the input data is normal data or abnormal data based on the metadata; a first storage configured to store the normal data; a second storage configured to store the abnormal data; and a data processor configured to correct the abnormal data stored in the second storage such that the abnormal data has the same structure as the normal data and store the corrected abnormal data in the first storage. | 2015-12-03 |
20150347494 | DATA UNIQUENESS CONTROL AND INFORMATION STORAGE - Techniques for flexibly controlling data uniqueness which are applicable to different types of data that require different data uniqueness control. Control information mapped by a data storage space of a database is determined. The control information and data to be written into the data storage space is combined to obtain a combination result. The techniques of the present disclosure determine whether there is another combination result that is the same as the combination result. The techniques of the present disclosure, in response to determining that there is another combination result that is the same as the combination result, reject to write into the data storage space the data to be written into the data storage space of the database; or modify the another data in the database. | 2015-12-03 |
20150347495 | Enhanced B-Trees with Record Merging - In some implementations, a B+tree (b plus tree) can provide concurrent access to data while modifying nodes of the B+tree. In some implementations, a top-down B+tree can be provided where nodes of the B+tree can be proactively merged, rebalanced and split to prevent recursive operations moving up the B+tree. In some implementations, node (or page) record data can be merged to consolidate record entries within nodes of the B+tree while only locking 1-3 nodes of the tree at the same time. In some implementations, record data can be merged across multiple nodes of the B+tree. In some implementations, ranges of data can be removed from the tree while only locking 1-3 nodes of the tree at the same time. In some implementations, range of data can be replaced with new data while only locking 1-3 nodes of the tree at the same time. | 2015-12-03 |
20150347496 | SNAPSHOT MANAGEMENT IN HIERARCHICAL STORAGE INFRASTRUCTURE - Embodiments of the present invention disclose a method, computer program product, and system for snapshot management in a storage infrastructure. A computer accesses a first snapshot captured in a first layer of the storage infrastructure. The computer accesses a second snapshot captured in a second layer of the storage infrastructure. The computer produces a determination that the first snapshot in the first layer of the storage infrastructure is one or more of: inconsistent with the second snapshot in the second layer of the storage infrastructure and a duplicate of the second snapshot in the second layer of the storage infrastructure. The computer removes the first snapshot in the first layer of storage infrastructure responsive to the determination. | 2015-12-03 |
20150347497 | CONDENSING EVENT MARKERS - Systems, methods, and computer-readable storage media for analyzing the recorded interactions of users within a shared dataspace, where the shared dataspace is provided by an a synced online content management system. As each user adds and deletes files in the shared dataspace, the content management system can record each interaction. The content management system can then analyze the recorded interactions, creating collapsed summaries of the interactions, and generate notifications that can be presented to users. Various thresholds can be used to determine when the recorded interactions are condensed, and when notifications associated with those condensed interactions are presented to users. | 2015-12-03 |
20150347498 | TRANSPARENTLY UPGRADING DERIVED DATABASE OBJECTS - A method for transparently upgrading derived database objects commences upon analysis of the data dictionary definition for an initial derived database object as compared to the data dictionary definition for a patched derived database object, then determining if a regenerated instance of the derived database object would be logically different from the initial derived database object. The determination is based on comparisons of the definitions of the initial derived database objects and patched definitions of respective database objects. The method produces a regenerated instance of the derived database object when a regenerated instance of the patched derived database object would be logically different from the initial derived database object. The method will suppress the production of a regenerated instance when a regenerated instance of the derived database object would not be logically different from the initial derived database object. Once regenerated or suppressed, a post-upgrade software application accesses the regenerated derived database object instance (if regenerated) or the initial derived database object if the regenerated instance was suppressed. | 2015-12-03 |
20150347499 | MANAGING USER INFORMATION - BACKGROUND PROCESSING - Systems, methods, and computer-readable medium are provided for managing user information. For example, subscription information may be received from an application that identifies a data type associated with information of a user. The application may be launched as a background process at least in response to receipt of a portion of the information that corresponds to the data type. In some examples, the application may be relaunched as the background process at least until receipt of a confirmation that the application has processed the portion of the information | 2015-12-03 |
20150347500 | INTERACTIVE SEARCHING METHOD AND APPARATUS - An interactive searching method and apparatus are provided. The interactive searching method includes following steps. A first query is received, an intention clarification guidance sentence is obtained according to the first query, a feedback corresponding to the intention clarification guidance sentence is received, a second query is generated according to the first query, the intention clarification guidance sentence and the feedback, and a search result is provided according to the second query. | 2015-12-03 |
20150347501 | Database Interface Method and System - An intuitive interface that allows a non-technical person to search a computer database without having to understand the underlining database software or its structure by assembling a graphical database query. | 2015-12-03 |
20150347502 | SYSTEMS AND METHODS FOR QUERY OPTIMIZATION - The present disclosure relates to systems and methods for performing search queries and for query optimization. In accordance with certain embodiments, a query from a client may be received at a server, and a default query range (e.g., a period of time, or other factor) may be applied to the query. The query may be executed in a first execution using an index comprising a category of information stored in the database and subject to the default query range. If the number of query results from the first execution is outside a predetermined range, then the query range may be adjusted to obtain a number of query results closer to or within the predetermined range. Additionally, the query may be executed in a second execution using the index comprising the category of information stored in the database and subject to the adjusted query range. The query results obtained from the second execution of the query may be sent to the client. | 2015-12-03 |
20150347503 | MULTI-DOMAIN QUERY COMPLETION - A method and apparatus of a device that performs a multi-domain query search is described. In an exemplary embodiment, the device receives a query prefix from a client of a user. The device further determines a plurality of search completions across the plurality of separate search domains. In addition, the device ranks the plurality of search completions based on a score calculated for each of the plurality of search completions determined by a corresponding search domain, where at least one of the plurality of search completions is used to generate a plurality of search results without an indication from the user and in response to receiving the query prefix. | 2015-12-03 |
20150347504 | ELECTRONIC APPARATUS, METHOD AND STORAGE MEDIUM - According to one embodiment, an electronic apparatus includes a processing circuit. The processing circuit is configured to acquire screen image data representing a screen image of the electronic apparatus including a window displayed by execution of software, acquire log data including time and date when the screen image data is acquired and software data indicating the software, and store the screen image data associated with the log data in a storage. | 2015-12-03 |
20150347505 | INFORMATION PROCESSING UNIT, INFORMATION PROCESSING METHOD, AND PROGRAM - An information processing unit includes: a diagnostic image input section that inputs the diagnostic image; an operation information obtaining section that obtains display operation history information representing an operation history of a user who controls displaying of the diagnostic image; a query image generation section that extracts a predetermined region of the input diagnostic image to generate a query image; a diagnosed image obtaining section that supplies the generated query image and the display operation history information to a diagnosed image search unit and obtains the diagnosed image obtained as a search result by the diagnosed image search unit; and a display control section that displays the diagnostic image and the obtained diagnosed image for comparison. | 2015-12-03 |
20150347506 | METHODS AND APPARATUS FOR SPECIFYING QUERY EXECUTION PLANS IN DATABASE MANAGEMENT SYSTEMS - A database management system (DBMS) in which a user can express a query plan as a Raw Plan of arbitrary complexity in a format that can be executed by the DBMS. The user may also specify criteria under which this Raw Plan is to be executed. When a matching query and the subject circumstances are encountered the DBMS will execute the Raw Plan, instead of searching in a query cache or generating a new query plan. | 2015-12-03 |
20150347507 | HIERARCHICAL QUERY PLANS IN AN ELASTIC PARALLEL DATABASE MANAGEMENT SYSTEM - Methods, apparatus, and products are disclosed for the purposes of representing query plans for a query presented to a database in a manner generally referred to as an “EXPLAIN PLAN”, including query execution steps, query execution sequences, alternate query execution steps, and alternate query execution sequences for the query presented to the database management system, and for query plans, query execution steps, and query execution sequences for the execution of a parent query execution step. | 2015-12-03 |
20150347508 | PARTIAL RESULT CLASSIFICATION - A query can be executed over incomplete data and produce a partial result. Moreover, the partial result or portion thereof can be classified in accordance with a partial result taxonomy. In accordance with one aspect, the taxonomy can be defined in terms of data correctness and cardinality properties. Further, partial result analysis can be performed at various degrees of granularity. Classified partial result can be presented on a display device to allow user to view and optionally interact with the partial result. | 2015-12-03 |
20150347509 | OPTIMIZING PERFORMANCE IN CEP SYSTEMS VIA CPU AFFINITY - In an example embodiment, performance is optimized in a complex event stream (CEP) system. Information about a plurality of CEP threads is obtained. Then nearness among the plurality of CEP threads is determined, wherein nearness between a first and a second CEP thread indicates how much interaction is expected to occur between the first and second CEP thread. Based on the determined nearness, the plurality of CEP threads are organized into a plurality of CEP thread groups. Then, each of the plurality of CEP thread groups are assigned to a different processing node, with each processing node having one or more processors and a memory. | 2015-12-03 |
20150347510 | DISTRIBUTED EXECUTION OF EXPRESSIONS IN A QUERY - A computer-implemented method for executing a query specification can include evaluating the query specification by a first computing device to identify a candidate expression in the query specification to be executed by a second computing device hosting a source of data specified in the candidate expression. A cost estimate for executing the candidate expression at the first computing device is determined. Whether the cost estimate of executing the candidate expression at the first computing device is greater than a threshold is determined. The candidate expression is replaced with a native query function when the cost estimate of executing the candidate expression at the first computing device is greater than the threshold. The native query function can be executed at the second computing device. It can be determined whether a runtime context is necessary, and if necessary, a context parameter is injected into the native query function. | 2015-12-03 |
20150347511 | UNIVERSAL IDENTIFIER - A user listening to a content item on a preceding device and wishes to continue with the listening experience on a subsequent device initiates a continuity request from the subsequent device to the preceding device. The preceding device responds to the received continuity request by determining a multiverse identification that is contained in the continuity request, such that the multiverse identification uniquely identifies the content item that is currently playing on the preceding device over all known playback devices with which it has communicated. The subsequent device determines if the content item exists in a local database of the subsequent device and, if it exists, the subsequent device plays the content item from the local database of the subsequent device, and otherwise obtains the content item. | 2015-12-03 |
20150347512 | DISTRIBUTED EXECUTION OF EXPRESSIONS IN A QUERY - A computer-implemented method for executing a query specification can include evaluating the query specification by a first computing device to identify a candidate expression in the query specification to be executed by a second computing device hosting a source of data specified in the candidate expression. A cost estimate for executing the candidate expression at the first computing device is determined. Whether the cost estimate of executing the candidate expression at the first computing device is greater than a threshold is determined. The candidate expression is replaced with a native query function when the cost estimate of executing the candidate expression at the first computing device is greater than the threshold. The native query function can be executed at the second computing device. It can be determined whether a runtime context is necessary, and if necessary, a context parameter is injected into the native query function. | 2015-12-03 |
20150347513 | EXECUTING STORED PROCEDURES AT PARALLEL DATABASES - The present invention extends to methods, systems, and computer program products for executed stored procedures at parallel databases. Stored procedures are transformed so that execution of the stored procedure is split between a standalone database server and a parallel database coordinator. Execution of the stored procedure is initiated at the standalone database server. At execution time, control-flow statements, variable assignment, expression evaluation, etc., are handled by the standalone database server. SQL statements are passed from the standalone database server to the database for the execution. Results from executed SQL statements can be returned to the standalone database server or to a client. The parallel database coordinator can be added as a linked server to the standalone database server. In some embodiments, a session token is used to share session state between different parties. | 2015-12-03 |