38th week of 2015 patent applcation highlights part 45 |
Patent application number | Title | Published |
20150261739 | Multi-Function Parser - Technologies are described herein for communicating, processing and transforming data of a structured document. A parser and a consumer are configured to iteratively process data of a structured document without the need to create a complete and structured representation of the structured document in memory. The parser interprets and communicates individual data elements and associated properties of the structured document to the consumer. The consumer processes each data element before instructing the parser to send the next data element. If a predetermined condition is met, the parser discontinues the communication of the data elements of the structured document. According to various embodiments, the consumer may be configured to construct a generic version of the structured document. The consumer may also be configured to use data of the structured document to perform calculations, search functions, or any other type of processing or data conversion. | 2015-09-17 |
20150261740 | TEXT READING AID - Described is reading aid for magnifying and re-laying out text in reading order without the need for optical character recognition. | 2015-09-17 |
20150261741 | INFORMATION PROCESSING SYSTEM AND INFORMATION PROCESSING METHOD FOR CHARACTER INPUT PREDICTION - An information processing system for input prediction that displays written character string candidates of words or phrases corresponding to an input character string in a terminal device. The terminal device acquires internal candidates by performing a search based on the input character string and transmits a candidate transmission request signal including identification information of a terminal dictionary stored in the terminal device and the input character string to a server. The server performs a search through the terminal dictionary corresponding to the identification information in the received signal and through a server dictionary dedicated to the server. From dictionary data extracted from the server dictionary, the server returns dictionary data of external candidates different from dictionary data extracted from the terminal dictionary as external candidates to the terminal device. The terminal device generates a final candidate list by arranging the internal and external candidates according to a predetermined priority. | 2015-09-17 |
20150261742 | ENHANCED PREDICTIVE INPUT UTILIZING A TYPEAHEAD PROCESS - Particular embodiments may retrieve information associated with one or more nodes of a social graph from one or more data stores. A node may comprise a user node or a concept node. Each node may be connected by edges to other nodes of a social graph. A first user may be associated with a first user node of the social graph. Particular embodiments may detect that the first user is entering an input term. Predictive typeahead results may be provided as the first user enters the input term. The predictive typeahead results may be based on the input term. Each predictive typeahead result may include at least one image. Each predictive typeahead result may correspond to at least one node of the social graph. | 2015-09-17 |
20150261743 | GENERATING A SEMANTIC NETWORK BASED ON SEMANTIC CONNECTIONS BETWEEN SUBJECT-VERB-OBJECT UNITS - A device may obtain text to be analyzed to determine semantic connections between sections of the text. The device may identify subject-verb-object (SVO) units included in the text, and may determine SVO unit information that describes the SVO units. The device may analyze the SVO unit information to determine semantic connection information that identifies one or more semantic connections between two or more of the SVO units. The one or more semantic connections may identify relationships between verbs associated with the two or more of the SVO units. The device may generate a semantic network based on the SVO unit information and the semantic connection information, and may provide information regarding the semantic network. | 2015-09-17 |
20150261744 | SYSTEMS AND METHODS FOR NATURAL LANGUAGE PROCESSING - Systems and methods are presented for performing natural language processing and reasoning. In some embodiments, a computer-implemented methods is presented. The method may include accessing a natural language query from a user, parsing the natural language query into a computer-interpretable semantic representation, converting the semantic representation into a computer-interpretable logical syntax, determining a solution to the computer-interpretable logical syntax using a reasoning engine and at least one data source, and outputting an answer to the natural language query using the solution to the computer-interpretable logical syntax. | 2015-09-17 |
20150261745 | TEMPLATE BOOTSTRAPPING FOR DOMAIN-ADAPTABLE NATURAL LANGUAGE GENERATION - The present invention relates to a system and method for bootstrapping templates for use in natural language sentence generation. More specifically, the present invention relates to identifying a set of candidate sentences from a large corpus based on a set of original templates by using a similarity measure. The set of candidate sentences are then processed or cleaned to generate a set of templates for use in natural language sentence generation. | 2015-09-17 |
20150261746 | TRANSLATION SYSTEM, INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND COMPUTER PROGRAM PRODUCT - A translation system includes one or more computers, and the translation system includes an acquiring unit that acquires original information indicating text to be translated and designation information including information for designating a specialized field that is a field to which the original information belongs, a storage unit that stores therein, for each of specialized fields, one or more pieces of technical dictionary information each being used as a dictionary for translation of a word/phrase used in each of the specialized fields, a recognizing unit that recognizes a word/phrase to be translated by using one or more pieces of the technical dictionary information corresponding to the specialized field designated by the designation information among words/phrases contained in the original information, and an adding unit that adds information indicating a translation result of a word/phrase to only the word/phrase recognized by the recognizing unit. | 2015-09-17 |
20150261747 | SELECTING AND CONVEYING SUPPLEMENTAL CONTENT - Base items of content may be conveyed by a user computing device. These base items of content may be enhanced with enhancement content, such as sounds, songs, video clips, animations, images, multimedia content, and the like. Characteristics and enhancement objects may be identified in a portion of the base item of content, and enhancement content may be assigned to that portion automatically by a content enhancement service. In one embodiment, enhancement sounds or songs may be provided and conveyed to enhance an audiobook or electronic book. | 2015-09-17 |
20150261748 | Web Service Workflow Chains for Processing Objects - A method and system for invoking object processing web service workflow chains that are rapidly configurable and seamlessly executable. Rapid configuration and seamless execution are facilitated by a catalog of “reusable” object processing web services which adhere to a common service contract and can be integrated into workflow chains for processing objects as plug-and-play building blocks. The services in the workflow chains are provided references to locations of objects being processed (rather being given the objects themselves) to simplify and expedite execution. An exemplary workflow chain is composed of document imaging web services and is configured and executed in an MFP environment. | 2015-09-17 |
20150261749 | SYSTEM AND METHOD FOR DELETION OF EXTRANEOUS DELETE MARKER OBJECTS - Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects through the use of delete marker objects. In response to a delete operation specifying a key, but not a version identifier, the storage system may create a delete marker object that is stored as the latest object version of the key. In response to performing a subsequent mutating operation, or at pre-determined time intervals, the storage system may perform a local and/or a global analysis of the delete marker objects stored in the system (and/or metadata associated with those delete marker objects) to determine whether any of them are no longer needed to ensure correct operation of the system. The analysis may apply one or more reap conditions to delete marker objects and/or metadata to identify extraneous delete marker objects, removing those that meet one or more reap conditions from storage. | 2015-09-17 |
20150261750 | METHOD AND SYSTEM FOR DETERMINING A MEASURE OF OVERLAP BETWEEN DATA ENTRIES - A data analysis system and method for determining a measure of overlap between data entries in a number N of columns in a database. Sorted hash lists are provided. An N×N matrix having cells C | 2015-09-17 |
20150261751 | SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS FOR PROBING A HASH TABLE FOR IMPROVED LATENCY AND SCALABILITY IN A PROCESSING SYSTEM - System, method and computer program products for probing a hash table by receiving a compressed input key, computing a hash value for the compressed input key and probing one or more buckets in a hash table for a match. Each bucket includes multiple chunks. For a bucket in the hash table, chunks are searched in that bucket by comparing in parallel the hash value with multiple slots in each chunk, such that if a value in a chunk equals the hash value of the compressed input key, then a match is declared and a vector is returned with a significant bit of a matching slot in the bucket set to a value. If a value stored in a chunk corresponds to an empty slot, then a mismatch is declared, and the vector is returned as the result with the significant bit of a matching empty slot set to the value. | 2015-09-17 |
20150261752 | PERSONALIZED CRITERIA-BASED MEDIA ORGANIZATION - Personalized criteria-based media organization is provided. Digital media items are organized into one or more albums. At least one album is associated with album membership criteria and includes only digital media items that satisfy the album membership criteria. An album is updated by receiving user input identifying at least one criteria creation element, generating user-defined album membership criteria based on the at least one criteria creation element, identifying any matching digital media items that satisfy the user-defined album membership criteria, and associating the matching digital media items with the album. | 2015-09-17 |
20150261753 | METADATA ACQUISITION USING EMBEDDED CODES - Methods and devices are provided to obtain metadata associated with multimedia content. One method includes performing watermark detection on a content that is received at a receiver device to detect one or more watermarks. At least one of the detected watermark includes a payload with a server code and an interval code. The method includes forming a uniform resource locator (URL) based on the watermark payload. The URL includes a first section with server domain name the includes at least a portion of the server code. The URL also includes a second section that includes at least a portion of the interval code. Upon transmission of a request based on the URL using a hypertext transfer protocol (HTTP) for delivery to a metadata server, a response is received that includes metadata associated with the content. | 2015-09-17 |
20150261754 | METHOD AND APPARATUS OF USER RECOMMENDATION SYSTEM FOR IN-VEHICLE APPS - A method and system for recommending applications to users of in-vehicle infotainment systems are disclosed. Application rating data from many road vehicle infotainment system users are collected on a central server, including both explicit ratings and implicit ratings. Implicit ratings may be calculated based on application usage data. The user/application rating data is filtered for relevance, and then analyzed to determine inferred ratings for user/application relationships where no rating exists. The inferred ratings are calculated using both a user-driven consensus rating calculation and an application-driven consensus rating calculation. The inferred ratings, along with optional cyberspace-based external inputs, are used to synthesize application recommendations for users. The synthesized recommendations for application consideration are provided to the appropriate user via downloading from the central server to the infotainment system in the user's vehicle. | 2015-09-17 |
20150261755 | PRIOR ART SEARCH APPLICATION USING INVENTION ELEMENTS - The software for searching prior art of the preferred embodiments includes an input interface, and allows a user to input one or more keywords related to at least two conceptual elements of an invention. The conceptual elements are preferably aspects of the ideas or innovations that make up the invention, where the conceptual elements together combine to describe at least the conceptual form of the invention. The conceptual elements, however, can represent any aspects of a conceptual or logical description or break down of the invention. The software for searching prior art of the preferred embodiments is designed to find a large fraction of the prior art related to an invention, and to sort the prior art so that the pieces of prior art most relevant to the invention are placed at the top of the search results. In an alternative use, the software for searching prior art of the preferred embodiments may be used to conduct research on a subject, including scientific or technical subjects. The software for searching prior art of the preferred embodiments may, however, be used for any suitable purpose. | 2015-09-17 |
20150261756 | MECHANISM FOR COMPUTING AND USING CONTEXTUALIZED SOCIAL MEDIA SCORES - A social media network is monitored for postings of a control group. The control group is a group of one or more individuals that posts on a particular topic. The postings of the control group may cover all the postings of each member of the control group for a period of time. A first relative social media score is calculated for the postings of the control group on the social media network. A social media score is calculated for a social media posting of a user or entity on the social media network. The relative social media score for the control group is compared to the social media score for the user or entity to see if there is a significant difference. If there is a significant difference, an agent in a contact center to is identified respond to the social media posting of the user or entity. | 2015-09-17 |
20150261757 | INFORMATION PROCESSING DEVICE AND INFORMATION PROCESSING METHOD - An information processing device including: a storage unit configured to store a first record set including variables of multiple types, and a second record set different from the first record set and including variables of the multiple types; and a processing unit configured to calculate an expected value at which a first variable set representing a combination of variables formed by selecting one variable for each type in the first record set is expected to appear in the second record set, extract the first variable set based on the expected value and the number of records including the first variable set in the second record set, and output at least one of the extracted first variable set and a second variable set, the second variable set representing a combination of variables formed by selecting one or more variables for each type in the second record set. | 2015-09-17 |
20150261758 | NARROWING INFORMATION SEARCH RESULTS FOR PRESENTATION TO A USER - The disclosed technology provides systems and methods for filtering information based on a set of properties. The information consists of a set of items that the user is interacting with, such as documents, presentations, audio and video files, and the like. The properties can be specified by the user (by, for example, putting a set of items in lists and folders), based on actions taken by users in the system (such as commenting on, or liking, or viewing an item), or can represent a variety of other characteristics. Related properties can also be grouped together. Furthermore, the disclosed techniques provide mechanisms for automatically identifying useful properties and providing an indication of those useful properties to a user to use in narrowing results. | 2015-09-17 |
20150261759 | QUERYING OF REPUTATION SCORES IN REPUTATION SYSTEMS - The disclosed embodiments provide a reputation system. The reputation system includes a ranking apparatus that obtains a set of reputation scores for one or more dimensions of a set of items in the reputation system and generates a ranking of the items based on the reputation scores and the one or more quantiles. The reputation system also includes a query-processing apparatus that obtains a query comprising the one or more dimensions and one or more quantiles associated with the one or more dimensions and provides the ranking in a response to the query. | 2015-09-17 |
20150261760 | PROVIDING RECOMMENDATIONS ON A SOCIAL NETWORKING SYSTEM PAGE - A social networking system provides tips to users about non-user entities within the social networking system. Tips include short questions, comments, reviews and non-user entities include businesses, products, bands, songs etc. Tips are provided by users of the social networking system, wherein the tips are displayed to other users of if the other users meet privacy criteria associated with the tips. Additionally, tips are ranked based on the likelihood that a user will view or read the tip. Tips with the greatest likelihood are ranked higher than those with a lower likelihood. Selected tips with a high likelihood to be viewed are displayed to a viewing user on the topic page or within the user's news feed story. | 2015-09-17 |
20150261761 | HEADER-TOKEN DRIVEN AUTOMATIC TEXT SEGMENTATION - A method and a system to automatically segment text based on header tokens is described. A relevance value and an irrelevance value are determined for each token in a description, assuming no tokens are left out of computations. The irrelevance value is based on occurrences of a token in a sample set of descriptions. The relevance value is an estimated probability of relevance based on the header of the description being segmented. | 2015-09-17 |
20150261762 | INTERFACE FOR A UNIVERSAL SEARCH - A search engine may perform a search for a user search query over a number of possible search categories. For example, the search query may be performed for general web documents, images, and news documents. The search engine ranks categories based on the search query and/or the documents returned for each category and presents the search results to the user by category. Higher ranking categories may be presented more prominently than lower ranking categories. | 2015-09-17 |
20150261763 | USING REPUTATION MEASURES TO IMPROVE SEARCH RELEVANCE - A system and method for determining relevancy for dynamic data sets is disclosed. A specific embodiment for use in an internet marketplace is presented wherein the relevancy for a descriptive factor associated with an item is increased when a user selects that item. To prevent abuse of the relevancy determination system, various embodiments incorporate abuse prevention measures. In one embodiment, a user's selection of the user's own items does not affect the relevancy system. In one embodiment, only a first selection of a particular item by a user will affect the relevancy system and any additional selections of that item will have no effect. In another embodiment, the size of the changes made due to the selections of particular user to the relevancy system are correlated to that user's reputation score. | 2015-09-17 |
20150261764 | MULTIMEDIA AUTHORING METHOD FOR ASSISTANCE IN PHYSICAL EXERCISE - The disclosure provides a multimedia authoring method for assistance in physical exercise, including the following steps. According to an exercise level command, a first number of first category parameters and a second number of second category parameters are defined to generate a category parameter sequence in which the first number of first category parameters and the second number of second category parameters are arranged randomly. First category multimedia file(s) corresponding to the first number of first category parameters and second category multimedia file(s) corresponding to the second number of second category parameters are selected from a database to establish a multimedia play list in which the first category multimedia file(s) and the second category multimedia file(s) will be sorted according to the order of the first number of first category parameters and the second number of second category parameters in the category parameter sequence. | 2015-09-17 |
20150261765 | Dynamic Resource-based Parallelization in Distributed Query Execution Frameworks - As part of query processing within a distributed execution environment framework, available resources taken into account when generating an execution plan and/or executing an execution plan to determine whether to parallelize any operations. Related apparatus, systems, methods and articles are also described. | 2015-09-17 |
20150261766 | METHOD AND APPARATUS FOR DETERMINING A RANGE OF FILES TO BE MIGRATED - A method for determining a range of files to be migrated is disclosed, comprising: comparing the source system environment to be migrated with a set of incremental target system environments, to discover the change files in each of the target system environments relative to the source system environment, wherein each target system environment in the set of incremental target system environments comprises software on which the migration target application depends, and the software contained in the different target system environments is incremental; classifying the change files into different change patterns according to the change types of the change files in each comparison and the different change types of the change files among multiple comparisons; and determining a range of files to be migrated according to the change pattern. | 2015-09-17 |
20150261767 | SYSTEM AND METHOD FOR THE DATA MANAGEMENT FOR THE ANALYSIS OF DIVERSE, MULTI-STRUCTURED DATA FROM DIVERSE SOURCES - There is disclosed in an embodiment for management of data for analysis of diverse, multi-structured data from diverse sources importation of data having existing data specifications from an external system. Permissions associated with the data and data policies intrinsic to the data are enforced and any tainted data is untainted by ascribing missing specified properties to the data. The properties for the data that were tainted are recorded and properties of resulting untainted data are encoded as composable metadata. The untainted data and metadata are stored, and recorded tainted properties for the data and/or metadata are tracked. Input of an analysis request is accepted, and the data is analyzed in the presence of the stored metadata. Copies of imported data and metadata are retained and new versions are created when such data or metadata is mutably updated. Results of the analysis are output. Other embodiments are also disclosed. | 2015-09-17 |
20150261768 | SYSTEMS AND METHODS FOR PROTECTING EMAIL DATA - Aspects of this disclosure relate to protecting email data. For example, email protection rules can instruct an email server to route an email to an email protection module. The one or more email rules can identify a group of one or more email addresses. The email protection module can receive an email from the email server that has an email address of the group as an intended receipt. The email protection module can route the email to secondary storage and store the email in secondary storage to create a secondary copy of the email. The secondary copy can be stored inline to persistent memory of secondary storage, according to certain embodiments. Access to the backup copy of the email stored to the persistent memory can be controlled, for example, based on whether a user had permission to access to the email when the email was sent. | 2015-09-17 |
20150261769 | Local Safety Network - Provided are system, devices and methods for initiating and executing a response to an event, in particular an adverse event. Embodiments of the invention allow a user to use a mobile electronic communication device, such as a smart phone, to access communication channels to generate a list of contactable entities relevant to the event, prioritized by considerations like proximity, appropriateness for the type of event, and appropriateness for the risk level of the event. Additionally, embodiments of the invention may allow for aspects of the management of a response to the event, for instance by enabling a network of responders, created based on the prioritized list of contactable entities. | 2015-09-17 |
20150261770 | PAGE LOADING METHOD AND SYSTEM, AND COMPUTER-READABLE STORAGE MEDIUM - The present disclosure provides a page loading method and system, and a computer-readable storage medium. Positioning information of a current display area of a page is acquired; and page content corresponding to the current display area is acquired for loading from all page content to be loaded. An area selected by a user may be loaded with a high priority, without taking time to wait until loading of all previous page content is completed. This improves loading speed of specific page content, and can implement operations such as random access to content of a page, and content searching and locating. | 2015-09-17 |
20150261771 | SEARCH CONTROLS USING SLIDERS AND LIGHTBOXES - Code is injected into a web page loaded by an Internet browsing application. A search control to accept Internet search input is presented within an Internet browsing application. The search control visually covers at least a portion of a content display area of the Internet browsing application. A slider search control may be presented by automatically sliding the slider search control into the content display area. The presentation of a lightbox search control may include shading, darkening, dimming, blurring, or opaquing the content display area outside of the lightbox search control. The presentation of the search control may occur in response to a period of user inactivity, an amount of page scrolling, or a percentage of page scrolling. The search control receives input corresponding to a search query, a tracking code is combined with the received input, and the combination is communicated to a search engine. | 2015-09-17 |
20150261772 | DATA CONTENT IDENTIFICATION - The subject matter disclosed herein provides methods for identifying the type of content found in a database or source file having data records. A source file having one or more data records may be accessed. The data records may be associated with one or more data values arranged into columns. One or more data types may be proposed for at least one column by examining the data values in the column. A confidence score may be calculated for each proposed data type. The proposed data types may be arranged into a prioritized list based on each data type's confidence score. One or more rules may be applied to the column to finalize priorities of the proposed data types. The rules may be applied without referring to the data values in the column. Results may be provided based on the finalized priorities. Related apparatus, systems, techniques, and articles are also described. | 2015-09-17 |
20150261773 | System and Method for Automatic Generation of Information-Rich Content from Multiple Microblogs, Each Microblog Containing Only Sparse Information - A system and method for automatic generation of information-rich content from multiple microblogs, each microblog containing only sparse information, the method comprising collecting a population of microblogs comprising microblog data, each microblog containing a limited number of characters; providing a user interface allowing entry of a search query; matching a search query entered on the user interface to data in the microblog data; providing the results of the matching process as a sub-set of microblog data; applying processing techniques to the sub-set of microblog data; and generating a summary report of the processed sub-set of microblog data. | 2015-09-17 |
20150261774 | REAL-TIME PUSH NOTIFICATIONS FOR CLOUD-BASED APPLICATIONS - An improved technique pushes change notifications to application instances running on frontend clients. In accordance with the improved technique, a backend system sends compact change notifications merely to inform the application instances that contents of the data storage container have changed. The application instances may then respond by requesting the changed content of the data storage container. In response to the request, the backend system provides the requested contents. | 2015-09-17 |
20150261775 | CONTENT MANAGEMENT METHOD AND CLOUD SERVER THEREFOR - A method of managing data by a server includes receiving, from a client device, a signal that requests for a content list corresponding to a user account; selecting a content related to the user account and a file name generation rule corresponding to the user account; generating a file name of the content based on the file name generation rule; and providing the content list including the file name of the content to the client device. | 2015-09-17 |
20150261776 | MANAGING DELETIONS FROM A DEDUPLICATION DATABASE - An information management system can manage the removal of data block entries in a deduplicated data store using working copies of the data block entries residing in a local data store of a secondary storage computing device. The system can use the working copies to identify data blocks for removal. Once the deduplication database is updated with the changes to the working copies (e.g., using a transaction based update scheme), the system can query the deduplication database for the database entries identified for removal. Once identified, the system can remove the database entries identified for pruning and/or the corresponding deduplication data blocks from secondary storage. | 2015-09-17 |
20150261777 | DEDUPLICATED DATA PROCESSING RATE CONTROL - A plurality of workers is configured for parallel processing of deduplicated data entities in a plurality of chunks. The deduplicated data processing rate is regulated using a rate control mechanism. The rate control mechanism incorporates a debt/credit algorithm specifying which of the plurality of workers processing the deduplicated data entities must wait for each of a plurality of calculated required sleep times, the calculated required sleep times being calculated as a best fit between a maximum allowable sleep time, a delta vector, and a limit per time vector, wherein the required sleep time is one of the plurality of calculated required sleep times. | 2015-09-17 |
20150261778 | DEDUPLICATED DATA PROCESSING RATE CONTROL - A plurality of server processor workers is configured for the distributed parallel processing of deduplicated data entities in a plurality of chunks. The deduplicated data processing rate is regulated using a rate control mechanism. The rate control mechanism incorporates a debt/credit algorithm specifying which of the plurality of workers processing the deduplicated data entities must wait for each of a plurality of calculated required sleep times, the calculated required sleep times being calculated as a best fit between a maximum allowable sleep time, a delta vector, and a limit per time vector, wherein the required sleep time is one of the plurality of calculated required sleep times. | 2015-09-17 |
20150261779 | STREAM LOCALITY DELTA COMPRESSION - Stream locality delta compression is disclosed. A previous stream indicated locale of data segments is selected. A first data segment is then determined to be similar to a data segment in the stream indicated locale. | 2015-09-17 |
20150261780 | Electronic Device and Recording Medium Storing Data Management Program That Conceal Data Corresponding to Type of Processes - An electronic device includes a first access management circuit and a second access management circuit. The first access management circuit manages an access to a database from a first process. The second access management circuit manages an access to the database from a second process. The first access management circuit, among regions in the database, manages the access to a shared region for data to be used by both of the first process and the second process, and manages the access to a first dedicated region for data to be used by only the first process among the first process and the second process. The second access management circuit manages the access to the shared region among the regions in the database. | 2015-09-17 |
20150261781 | MAINTAINING CONCURRENCY AND CONSISTENCY OF GLOBALLY UNIQUE IDENTIFIERS - Systems, methods, and computer-readable storage media for ensuring data consistency and concurrency for globally unique identifiers (GUIDs) and associated content items via locking. A content management system configured to practice the method can receive, from a client device, a request to perform a content item operation in a storage environment that affects a GUID. Then the content management system can acquire a first mutex for a namespace associated with the content item operation, such as an application-level lock, and acquire a second mutex for the GUID, such as a row-level lock in a database table. After acquiring the locks, the content management system can perform the content item operation according the request, and update the GUID based on the content item operation. Then the content management system can release the mutexes and provide a confirmation to the client device in response to the request. | 2015-09-17 |
20150261782 | SYNC AS A SERVICE FOR CLOUD-BASED APPLICATIONS - A technique provides sync capability as an independent backend service, which developers can include, at their option, in their cloud-based applications. In accordance with the improved technique, a sync service runs in a backend system in connection with a set of data. The sync service syncs changes in the set of data among application instances that have access to the set of data. Sync services may be specified selectively for different sets of data, e.g., by specifying syncing for one set of data but not for another set of data. | 2015-09-17 |
20150261783 | METHOD AND APPARATUS FOR STORING AND READING FILES - A method and apparatus for storing and reading files are provided. The method includes: dividing a file into a plurality of sections, generating a unique section key for each section, and storing a main key for the file and the plurality of sections keys as a main storage record; dividing a section into a plurality of blocks, generating a unique block value for each block within the section, generating a section value corresponding to the section key based on the plurality of block values, and storing the section key and the section value as a section storage record; and associating each block value with indexing information for the corresponding block. In accordance with the method and apparatus for storing and reading files, file indexes are stored in separate groups to increase the maximum file size and the speed for reading file indexes while reducing the cost for reading file indexes. | 2015-09-17 |
20150261784 | Dynamically Varying the Number of Database Replicas - Embodiments of the invention dynamically vary the number of replicas based on certain conditions to protect users from data loss. The size of the database is one condition that can be used to determine the number of replicas required. A database system may create three replicas. When the database size exceeds a first threshold, a fourth replica may be created. The fourth replica is maintained as long as the database size is above a second threshold that is smaller than the first threshold. However, when the database shrinks below the second threshold, then the fourth replica is deleted. Using two different thresholds in this manner prevents the system from frequently cycling between three and four replicas. | 2015-09-17 |
20150261785 | METHOD AND APPARATUS FOR MULTI-RESOLUTION POINT OF INTEREST BOUNDARY IDENTIFICATION IN DIGITAL MAP RENDERING - A method, apparatus and computer program product are provided for multi-resolution point of interest boundary identification in digital map rendering. A method is provided for receiving a point of interest selection indication. The method also includes receiving point of interest boundary data and map data associated with the selected point of interest from a memory. The boundary data is based on the physical shape of the structure or region associated with the point of interest. The method also includes overlaying point of interest boundary data on the map data; and causing the map data with point of interest boundary data overlay to be displayed on a user interface. | 2015-09-17 |
20150261786 | DENSITY-BASED DYNAMIC GEOHASH - A method and system for maintaining a density-based geocode tree for a geographic area, including obtaining a geocode tree including multiple leaf nodes each having a geohash value corresponding to a subdivision of the geographic area, obtaining multiple positions within the geographic area, generating, using the multiple positions, multiple geohashes, mapping a first subset of the multiple geohashes to a first leaf node of the multiple leaf nodes based on the geohash value of the first leaf node, incrementing, by a cardinality of the first subset, a first counter value for the first leaf node, and grafting, in response to the first counter value exceeding a first density threshold, at least one child node onto the first leaf node. | 2015-09-17 |
20150261787 | ADJUSTMENT OF FACIAL IMAGE SEARCH RESULTS - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for adjusting facial image search results. In one aspect, a method includes detecting, in images that are responsive to a query, faces in the images and building facial templates. The images are then clustered according to similarity measures of the facial templates. The cluster with the highest quantity is selected, and each image in the set of returned images is compared to each image in the selected cluster. The similarity of each face with the faces in the largest cluster, based on the facial templates, is determined as an inlier score for the image in which the face is depicted. The system then increases the rank of images with high inlier scores and decreases the rank of images with low inlier scores. | 2015-09-17 |
20150261788 | Generating Digital Data From Physical Media - Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for providing digital data from physical media of a site. Actions can include receiving an image file associated with a site, the image file being associated with an image that depicts a physical medium located at the site, the physical medium physically recording data associated with the site, processing the image file to provide digital data, the digital data being provided based on the data physically recorded on the physical medium, associating the digital data with the site, and storing the digital data. | 2015-09-17 |
20150261789 | CLOUD-BASED PHOTO MANAGEMENT - Disclosed herein are systems, methods, and non-transitory computer-readable storage media for identifying objects within images. Analyses are performed, comparing metadata, tags, and similarity of images, to determine trends and similarity. Based on these trends and similarities, metadata and tags are copied and generated, with the associated images then being more closely associated with one another. These images can then be organized in more meaningful and useful formats. | 2015-09-17 |
20150261790 | SERIALIZING RESOURCE UTILIZATION USING HARDWARE BUILT-IN FUNCTIONS - A method includes identifying a first value of a lock word corresponding to a data structure, by a process in a plurality of processes that each have access to the data structure. The method also includes copying the data structure to a corresponding shadow record. The method additionally includes modifying the shadow record with a desired update for the data structure, and atomically updating the data structure and the lock word, by the process, using a hardware built-in function. The updating includes identifying a second value of the lock word and determining whether the first value of the lock word and the second value of the lock word are equivalent. The method additionally includes, in response to determining that the first value of the lock word and the second value of the lock word are equivalent, replacing the data structure with the shadow record and incrementing the lock word. | 2015-09-17 |
20150261791 | DYNAMIC DISPLAY OF REPRESENTATIVE PROPERTY INFORMATION WITH INTERACTIVE ACCESS TO SOURCE DATA - A system and method may aggregate into a data structure property information from multiple databases, e.g., from all records included in those databases, and upon selection of any subject property or a characteristic thereof curates the often imperfect and discrepant property information to create suggested values. Similarly, the system and method may perform an on-the-fly evaluation of any characteristic of a selected record, when the property information for that characteristic includes an unlikely value, by triggering from the data structure a dynamic extraction of property information corresponding to a subject property of the selected record, where the dynamic extraction further generates and compares a suggested value to the unlikely value. | 2015-09-17 |
20150261792 | MAINTAINING A DEDUPLICATION DATABASE - An information management system can modify working copies of database entries residing in a local database of a secondary storage computing device in response to instructions to modify the database entries residing in a deduplication database. If the working copy does not already reside in the local database, a copy of the database entry, or portion thereof, from the deduplication database can be used to generate the working copy. Based on a desired policy, the working copies in the local database can be merged with the actual database entries in the deduplication database. | 2015-09-17 |
20150261793 | METHOD FOR IMPLEMENTING DATABASE - The present invention provides a method for implementing a database, comprising: encoding, uniquely and respectively, tables, fields, and data relationships between the tables provided according to a predefined rule; storing codes of the tables, codes of the fields, and codes of the data relationships obtained in a created code structure table of node cluster to form code nodes; forming subordination mappings between the codes of the tables, the codes of the fields, and the codes of the data relationships in the code structure table of node cluster, according to subordination relationships between the tables, the fields and the data relationships; and mapping a name corresponding to each of the codes in a created comparison table of node cluster value; wherein code sub-nodes having unique codes are created under a code node corresponding to the fields, and data elements are stored in a storage space corresponding to the code sub-node. Accordingly, when addressing any table, field and data element, only one addressing and acquisition is made through the unique code of the table, the field and the data element to be addressed, thus the addressing efficiency of database can be improved. | 2015-09-17 |
20150261794 | GENERATING OR UPDATING TABLE DATA - The present approaches relate to the creation or updating of a table using data acquired from an external source. In one embodiment, the data acquired from the external source may be dragged-and-dropped onto a new or existing table to invoke execution data import or update routines. In the case of an update, a unique key within the existing table may correspond to a field within the acquired external data set, allowing record matching to be performed such that matched records may be updated and new records may be added to the table. In addition, identified fields in the acquired external data set may correspond to or be matched with columns of the table, allowing data values to be matched and updated regardless of differences in the layout of the table and the acquired external data set. | 2015-09-17 |
20150261795 | COMPUTER-BASED SYSTEM AND METHOD OF STRUCTURING A SPECIALIZED DATABASE FOR AUTOMATICALLY GENERATING FINANCIAL DISCLOSURE DOCUMENTS - Special purpose machines and methods of transforming raw disclosure information into a particularly structured dataset or database that can optimally store and present disclosure information for processing that complies with specific rules regarding securities offerings are described. Raw disclosure information provided by an issuer is processed, parsed, and strategically partitioned within a database. | 2015-09-17 |
20150261796 | SPECIFYING AND APPLYING LOGICAL VALIDATION RULES TO DATA - Methods, systems, and apparatus, including computer programs encoded on computer storage media, for specifying logical rules, one of the methods includes defining a logical rule, the logical rule applying operations based on a term. The method includes defining a mapping between fields and terms, the mapping including a mapping between a field and the term. The method includes storing the logical rule in association with the term. The method also includes applying the logical rule to data identified by the first field where respective fields are assigned to respective terms. | 2015-09-17 |
20150261797 | SYSTEM AND METHOD FOR MANAGEMENT OF GARBAGE COLLECTION OPERATION IN A SOLID STATE DRIVE - A method of garbage collection in a storage device including a central processing unit (CPU), a self-organized fast release buffer (FRB), and a non-volatile memory, the method including receiving a command to perform garbage collection in a first block stripe of the non-volatile memory from the CPU, the command including a second block stripe to write to and valid logical block numbers (LBNs) corresponding to a first codewords (CWs) stored in the first block stripe, allocating space in a buffer memory of the FRB for storage of the first CWs, storing the first CWs into the allocated space in the buffer memory, transferring a second CWs to a plurality of physical addresses in the second block stripe of the non-volatile memory, and sending the valid LBNs and the plurality of physical addresses to the CPU to update a logical-to-physical table, wherein the second CWs is based on the first CWs. | 2015-09-17 |
20150261798 | MAINTAINING AND USING A CACHE OF CHILD-TO-PARENT MAPPINGS IN A CONTENT-ADDRESSABLE STORAGE SYSTEM - Techniques for maintaining and using cached child-to-parent mappings in a content-addressable storage system are provided. A cache of child-to-parent mappings is maintained. Each child-to-parent mapping corresponds to a particular chunk in a hierarchy of chunks stored in a content-addressable chunk store, and maps the particular chunk to a parent chunk in the hierarchy of chunks. The hierarchy of chunks includes a first root chunk associated with a file system volume. In response to a change to the file system volume that causes associating a new root chunk with the file system volume, the cache is updated by adding one or more first child-to-parent mappings based on traversing at least a portion of a current file system hierarchy from the new root chunk, and removing one or more second child-to-parent mappings based on traversing at least a portion of a prior file system hierarchy from the first root chunk. | 2015-09-17 |
20150261799 | SYSTEMS, APPARATUS, AND METHODS FOR TRACKING CHANGES IN DATA STRUCTURES USING NESTED SIGNATURES - Embodiments of the present invention provide systems, apparatus, and methods for tracking changes in data structures. Embodiments include a system data structure including a master signature list object and a plurality of component data structures sufficient to define a system. The component data structures each include a signature list object and a plurality of value storage objects sufficient to define a component of the system. The value storage objects are operative to execute on a processor to store changed values. The signature list objects are operative to execute on a processor to store signatures associating a changed value stored within a corresponding component data structure and other current values also stored within the corresponding component data structure. Numerous additional aspects are disclosed. | 2015-09-17 |
20150261800 | Method for Storing and Accessing Data into an Indexed Key/Value Pair for Offline Access - A system, method, and computer-readable medium are disclosed for managing the storage, access and synchronization of offline data. A set of online data, which is available for online access, is persisted as a set of offline data in a local storage associated with a user device and a key-value pair is used to cross-reference the first set of online data and the first set of offline data, An access request for a set of data, corresponding to the first set of online data, is received from a user device application. The access request is then processed to determine whether the first set of online data is available for online access. If it is, then the first set of online data is provided to the user device application for processing. Otherwise, the first set of offline data is provided to the user device application for processing. | 2015-09-17 |
20150261801 | METHOD FOR HANDLING LARGE OBJECT FILES IN AN OBJECT STORAGE SYSTEM - Several different embodiments of a segmented object storage system are described. The object storage system divides files into a number of object segments, each segment corresponding to a portion of the object, and stores each segment individually in the cloud storage system. The system also generates and stores a manifest file describing the relationship of the various segments to the original data file. Requests to retrieve the segmented file are fulfilled by consulting the manifest file and using the information from the manifest to reconstitute the original data file from the constituent segments. Modifying, appending to, or truncating the object is accomplished by manipulating individual segments and the manifest file. In further embodiments, manipulation of the individual object segments and/or the manifest is used to implement copy-on-write, snapshotting, software transactional memory, and peer-to-peer transmission of the large file. | 2015-09-17 |
20150261802 | INDEX CONFIGURATION FOR SEARCHABLE DATA IN NETWORK - An entity using a computing device can upload searchable data to a network service to be indexed and stored. The data can include a plurality of data fields, each data field having one or more associated values. The network service can analyze the data fields and their respectively associated values to determine data field types for the data fields and search options to be enabled for the data fields. Based at least in part on the data field types and the search options, the network service can generate a search index configuration/schema. Based at least in part on the generated search index configuration/schema, the network service can generate a search index for the data. In some embodiments, the network service can also convert the data into a format compatible with the search index. | 2015-09-17 |
20150261803 | EDGE-BASED RECOGNITION, SYSTEMS AND METHODS - Edge-based recognition systems and methods are presented. Edges of the object are identified from the image data based on co-circularity of edgels, and edge-based descriptors are constructed based on the identified edges. The edge-based descriptors along with additional perception metrics are used to obtain a list of candidate objects matched with the edge-based descriptors. Through various filtering processes and verification processes, false positive candidate objects are further removed from the list to determine the final candidate object. | 2015-09-17 |
20150261804 | ORGANIZING, JOINING, AND PERFORMING STATISTICAL CALCULATIONS ON MASSIVE SETS OF DATA - A system, method, and apparatus are provided for organizing and joining massive sets of data (e.g., tens or hundreds of millions of event records). A dataset is Blocked by first identifying a partition key, which comprises one or more columns of the data. Each Block will contain all dataset records that have partition key values assigned to that Block. A cost constraint (e.g., a maximum size, a maximum number of records) may also be applied to the Blocks. A Block index is generated to identify all Blocks, their corresponding (sequential) partition key values, and their locations. A second dataset that includes the partition key column(s) and that must be correlated with the first dataset may then be Blocked according to the same ranges of partition key values (but without the cost constraint). Corresponding Blocks of the datasets may then be Joined/Aggregated, and analyzed as necessary. | 2015-09-17 |
20150261805 | MULTI-VERSION CONCURRENCY CONTROL ACROSS ROW STORE AND COLUMN STORE - Techniques and solutions are provided for performing transactions within a database system that stores database data using a row store and a column store. For example, a transaction that performs operations to update data in both the row store and the column store can use the same transaction object. The state of the transaction can be atomically changed. For example, the state of the transaction object can be atomically changed from uncommitted to committed (e.g., set to a commit identifier to represent the committed state). | 2015-09-17 |
20150261806 | COMPUTERIZED INTERNET SEARCH SYSTEM AND METHOD - The present invention provides a system and method that can search social media and Internet websites, and can analyze and display the results according to a variety of criteria including virality on social media websites. The results are presented in a user friendly format such as a magazine, newsletter, newspaper, or scrapbook. | 2015-09-17 |
20150261807 | PARTITION LEVEL OPERATION WITH CONCURRENT ACTIVITIES - Techniques of implementing partition level operations with concurrent activities are disclosed. A first operation can be performed on a first partition of a table of data. The first partition can be one of a plurality of partitions of the table, where each partition has a plurality of rows. A first partition level lock can be applied to the first partition for a period in which the first operation is being performed on the first partition, thereby preventing any operation other than the first operation from being performed on the first partition during the period the first partition level lock is being applied to the first partition. A second operation can be performed on a second partition of the table at a point in time during which the first operation is being performed on the first partition. | 2015-09-17 |
20150261808 | REDUCE LOG CONTENTION BY BATCHING LOG RECORD TRANSFERS TO THE LOG - A system for managing database logging, the comprises a processor; and a user task executing in a database server process and executable by the processor, the user task to: receive in a database management system on a database server, a command to manipulate a portion of a database managed by the database management system; obtain a lock on the portion of the database; create a first log record in a first private log cache associated with the user task, the first log record recording a data manipulation to the portion of the database; enqueue the first log record to a queue; and release the lock on the portion of the database after copying the first log record to the queue. | 2015-09-17 |
20150261809 | NATIVE APPLICATION CONTENT VERIFICATION - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for verifying consistency between content of a native application and content of a corresponding resource that is provided separately from the content of the native application. | 2015-09-17 |
20150261810 | DATA TRANSFER APPARATUS AND METHOD - A data transfer apparatus and method, which fundamentally prevent the possibility of intrusion from an external network into an internal network that provides files, thus enabling data to be reliability transferred in a situation in which information cannot be exchanged. The data transfer apparatus includes an internal network connection unit for receiving data from a host of an internal network. An internal network control unit for performing control such that the data is unidirectionally transmitted. A write control unit checks integrity of the data received from the internal network control unit and detects status of the storage unit. An external network connection unit receives a request from a host of an external network. A read/write control unit searches for, reads, and deletes data stored in the storage unit at a request of the external network host. | 2015-09-17 |
20150261811 | METHODS AND SYSTEMS FOR DETECTING DATA CONTAINER MODIFICATION - Methods and system for determining if a data container has been modified are provided. A first data container signature and a second data signature are generated by a storage operating system based on metadata information for the data container. The second data container signature is compared with the first data container signature to determine if the data container has been modified since the first data container signature was generated. | 2015-09-17 |
20150261812 | Method to form social groups in various contexts to enable ease of information sharing and communication - A method to establish a social group in real time is provided. The method comprises collection of a user's interest information through a software application provided on the user's computing device. The method further matches the user's interest query with interest information of other users kept in the main system server. The system server then identifies various users having common interest information as that of the user and creates a social group of such users. | 2015-09-17 |
20150261813 | Method to form a social group for a real time event - A method to establish a social group in real time is provided. The method comprises collection of a user's real time event information through a software application provided on the user's computing device. The method further matches the user's interest query with event information of other users kept in the main system server. The system server then identifies various users having common interest information as that of the user and creates a social group of such users. | 2015-09-17 |
20150261814 | SEARCH CONTROLS USING SLIDERS AND LIGHTBOXES - Code is injected into a web page loaded by an Internet browsing application. A search control to accept Internet search input is presented within an Internet browsing application. The search control visually covers at least a portion of a content display area of the Internet browsing application. A slider search control may be presented by automatically sliding the slider search control into the content display area. The presentation of a lightbox search control may include shading, darkening, dimming, blurring, or opaquing the content display area outside of the lightbox search control. The presentation of the search control may occur in response to a period of user inactivity, an amount of page scrolling, or a percentage of page scrolling. The search control receives input corresponding to a search query, a tracking code is combined with the received input, and the combination is communicated to a search engine. | 2015-09-17 |
20150261815 | QUERY EVALUATION USING ANCESTOR INFORMATION - Provided are techniques for processing a query. A query is received, wherein the query is formed by one or more paths, and wherein each path includes one or more steps. A hierarchical document including one or more document nodes is received. While processing the query and traversing the hierarchical document, one or more extraction entries are constructed, wherein each extraction entry includes a step instance match candidate identifying a document node and a step instance ancestor path for the document node, and one or more tuples are constructed using the one or more extraction entries by associating the step instance match candidate from one of the one or more extraction entries with the step instance match candidate from at least one of the one or more other extraction entries. | 2015-09-17 |
20150261816 | DYNAMICALLY INDENTIFYING AND PREVENTING SKEWED PARTITIONS IN A SHARED-NOTHING DATABASE - Dynamically identifying and preventing skewed partitions in a shared-nothing database is provided. The database management system software receives a parameter for identifying a threshold value associated with at least one distribution key value. Optimizer statistics are gathered on a first table that is distributed across one or more partitions in the shared-nothing database, wherein the first table includes a first table name. Distribution key skew is identified based on the gathered optimizer statistics indicating the threshold value being exceeded. A second table with an alternate distribution key, is created having a second table name for receiving overflow data rows associated with the at least one distribution key value based on the identified distribution key skew. A union all view is created based on the first and the second table. | 2015-09-17 |
20150261817 | FAIR SCHEDULING FOR MIXED-QUERY LOADS - A fair scheduling system with methodology for fairly scheduling queries for execution by a database management system. The system obtains query jobs for execution by the database management system and cost estimates to execute the query jobs. The cost estimate can be a number of results the query is expected to return. Based on the cost estimates, the system causes the database management system to execute the query jobs as separately sub-query tasks in a round-robin fashion. By doing so, the execution latency of “low cost” query jobs that return few results is reduced when the query jobs are concurrently executed with “high cost” query jobs that return a large number of results. | 2015-09-17 |
20150261818 | IMMEDIATE JOIN SPILLING SCHEME FOR A DATABASE - Embodiments relate to an immediate join spilling scheme for a database. An aspect includes receiving a command to perform a join of an inner table and an outer table in a database. Another aspect includes spilling a plurality of hash tables to a disk memory, each hash table corresponding to a respective inner table partition. Another aspect includes registering, by a first agent of a plurality of agents, a set of inner table partitions that require processing by the first agent to complete the join for a first stride of rows of the outer table. Another aspect includes, based on determining that a hash table corresponding to a registered inner table partition of the first agent has been loaded into the local memory by the second agent of the plurality of agents, performing the join of the loaded hash table and the first stride of rows of the outer table by the first agent. | 2015-09-17 |
20150261819 | STAR AND SNOWFLAKE JOIN QUERY PERFORMANCE - A system and method for processing a database query is described. The method can, in response to detection that a database query involves a star or snowflake join operation, determine a selectivity ratio for each of a plurality of dimension tables. The selectivity ratio having a lower value can correspond to a more restrictive dimension table. Thereafter, a table ordering can be created beginning with a fact table and continuing with each of the dimension tables in ascending order of their corresponding selectivity ratios. Then a query plan involving join operations between successive tables in the table ordering can be created. | 2015-09-17 |
20150261820 | SPLITTING OF A JOIN OPERATION TO ALLOW PARALLELIZATION - A system and method for processing a database query is described. In response to detection that a database query involves a star or snowflake join operation, a join operator in a preliminary query plan can be split into a build operator and a probe operator. The probe operator can be placed in a final query plan in the same place as the join operator in the preliminary query plan, while the build operator can be placed beneath the probe operator in the final query plan, between an exchange operator and the exchange operator's child from the preliminary query plan. | 2015-09-17 |
20150261821 | Execution of Negated Conditions Using a Bitmap - Disclosed herein are system, method, and computer program product embodiments for accelerating database queries containing bitmap-based conditions. An embodiment operates by determining a bitmap, where the bitmap represents a set of rows that have satisfied a conjunct that precedes a negated condition in a query expression and restricting the evaluation of the negated condition to the set of rows represented by the bitmap, | 2015-09-17 |
20150261822 | Hierarchical Runtime Settings Within Distributed Query Execution Frameworks - A query is received by a database server from a remote application server. The query is associated with a calculation scenario that defines a data flow model that includes one or more calculation nodes. The calculation nodes each define one or more operations to execute by a calculation engine on the database server. Thereafter, the database server instantiates a runtime model of the calculation scenario by accessing a local settings object stored with the calculation scenario that specifies local settings for the calculation scenario. Subsequently, the database server executes the operations defined by the calculation nodes of the instantiated calculation scenario to result in a responsive data set. The data set can then be provided by the database server to the application server. | 2015-09-17 |
20150261823 | ROW, TABLE, AND INDEX COMPRESSION - Methods, systems, and computer program products for compressing a row are described. A common prefix may be obtained and data in the row matching the common prefix may be identified. A column number of a column corresponding to a breakpoint of the common prefix may be determined and data matching the common prefix may be deleted from the row. An identifier of the common prefix may be inserted into the row and a breakpoint field in the row may be set to the determined column number. | 2015-09-17 |
20150261824 | SYSTEM AND METHOD FOR DATA VALIDATION - Systems and methods for validating data in a communication network environment include receiving a data transformation specification from a user. The data transformation specification is analyzed to determine data transformation rules which are indicative of a relationship between corresponding fields of the source repository and the target repository. Test cases and test scripts are generated based on the data transformation rules and the test cases and the test scripts are executed on the source repository and the target repository to validate the relationship between the corresponding fields of the source repository and the target repository. Thereafter, a log file, indicative of the outcome of the execution of the test cases and the test scripts, is generated. | 2015-09-17 |
20150261825 | Determination of the Suitability of a Resource - According to the invention, a resource, which could optionally be used for a maintenance task of a technical system, is taken into consideration and the possible use thereof is checked even if not all conditions that would be required as per a model description of the resource are met. Thus, a compromise for a resource that comes closest to the sought resource, i.e. is as suitable as possible, can be found in an automated and efficient manner. The invention can be used, for example, for maintenance tasks of large and complex technical systems, for example, in automation technology or production technology. | 2015-09-17 |
20150261826 | METHODS FOR RECONCILING TRANSACTIONS AND DEVICES THEREOF - A method for reconciling transactions iteratively by segregating data into homogeneous data sets. The method includes acquiring transactions from two or more systems and comparing with a set of configurable predefined matching rules. Applying, based on the result of the comparison, one or more rules on the acquired transactions. The transactions of the two or more systems are scanned and a user defined function is applied on the transactions of the two systems. A value of the user defined function is calculated. If the value of the user defined function is residual value, a configurable criteria is applied on the value of the user defined function. A residual transaction is created in one of the systems and the value of the user defined function is recalculated. If the value of the user defined function is null value, indicates the transactions are reconciled. | 2015-09-17 |
20150261827 | META-CONFIGURATION OF PROFILES - Disclosed are methods for creating, applying, using and retrieving profile information that includes attributes that may be stored separately from, or with, the content to which the profiles are being applied. In this manner, profiles can be shared in various environments and across various applications. Attributes that have corresponding attributes in other content can be applied to the other content, as long as each of the attributes is valid. In vehicle applications, the profile can be generated in a first vehicle, stored in a profile repository, and subsequently applied to a second vehicle. | 2015-09-17 |
20150261828 | METHOD TO PROPAGATE A MESSAGE IN A REAL TIME INTEREST BASED SOCIAL GROUP - A method to establish a social group in real time is provided. The method comprises collection of a user's interest information through a software application provided on the user's computing device. The method further matches the user's interest query with interest information of other users kept in the main system server. The system server then identifies various users having common interest information as that of the user and creates a social group of such users. | 2015-09-17 |
20150261829 | SYSTEM AND METHOD FOR INTELLIGENTLY MINING INFORMATION AND BRIEFING AN AIRCREW ON CONDITIONS OUTSIDE THE AIRCRAFT - A system and method intelligently mines information and briefs an aircrew on conditions outside the aircraft. A mission information manager proactively mines incoming data sources, filters for relevance to current flight, retrieves the most up-to-date information, dynamically selects an appropriate format based on perceptual/cognitive affordances of content, and presents integrated, intuitive data that allows the flight crew to rapidly acquire relevant awareness of conditions outside the aircraft. An expert mission model system reviews incoming information for any situations that are of immediate mission concern. The system presents this information to the flight crew's attention while they have the greatest operational flexibility. Additionally, a human factors module provides decision aiding for select critical phases while taking into account information both outside and inside the aircraft. | 2015-09-17 |
20150261830 | AUTOMATED DATA MINING - A computer program product to determine correlations between seemingly independent datasets including operations of receiving an indication of one or more reference files, receiving an indication of one or more connections between the one or more reference files and individual ones of one or more fact attributes of a fact file, modifying, in response to identifying the first connection, the fact file to include the one or more reference values associated with the first reference attribute to create an enriched fact file. Time-specific fact files may be generated corresponding to each permutation of a single fact attribute and a single time value in the enriched fact file. Correlations may be determined between individual fact values of a previous time series generated from the time-specific fact files and individual fact values of the generated time series based on the determined lag times. | 2015-09-17 |
20150261831 | SYSTEM AND METHOD FOR DISTRIBUTED DATABASE QUERY ENGINES - Techniques for a system capable of performing low-latency database query processing are disclosed herein. The system includes a gateway server and a plurality of worker nodes. The gateway server is configured to divide a database query, for a database containing data stored in a distributed storage cluster having a plurality of data nodes, into a plurality of partial queries and construct a query result based on a plurality of intermediate results. Each worker node of the plurality of worker nodes is configured to process a respective partial query of the plurality of partial queries by scanning data related to the respective partial query that stored on at least one data node of the distributed storage cluster and generate an intermediate result of the plurality of intermediate results that is stored in a memory of that worker node. | 2015-09-17 |
20150261832 | STORING SERVICE ITEMS IN ASSOCIATION WITH VIEWS - Systems, methods, and software are described herein to support view-based storage. A service application that provides a user interface to a service receives data communicated by the service and identifies at least a service item to present in at least one of various views rendered in the user interface. The service application then identifies with which of the views to associate the service item and stores the service item in association with an identified view or views. | 2015-09-17 |
20150261833 | DATA VISUALIZATION SYSTEM - There is provided a method for determining, for a set of co-ordinate records associating co-ordinates with incident values, the numbers of incidents associated with co-ordinates within a query area. Co-ordinate data is stored as data representing a binary tree comprising leaf nodes, a root node and branch nodes wherein the leaf nodes are associated with individual items of co-ordinate data identified by the set of co-ordinate records, and the root node and branch nodes are each associated with a pair of child nodes, and are each associated with split values. In response to a query identifying a query area the binary tree is then recursively processed starting with the root node. | 2015-09-17 |
20150261834 | METHOD AND APPARATUS FOR PROVIDING SEARCH RESULT - A method and an apparatus for providing a search result are provided. The method can include obtaining at least one search result card, in a computer memory, according to an input search term, in which each of the at least one search result card comprises a first surface and a second surface, and a search result is recorded on the first surface and/or the second surface. The first surface of each of the at least one search result card can be displayed on a display. A request to turn a first search result card over can be determined to have been received, in which the first search result card is the search result card firstly selected from the at least one research result card. The first search result card can be visually turned over to display the second surface of the first search result card on the display. | 2015-09-17 |
20150261835 | Companion Experience - Various embodiments provide a so-called companion experience in which content consumed on a primary screen can serve as a source for an automatic search that returns related content that can be presented on an auxiliary screen. The companion experience can be considered to reside in a layer that can be moved across different screens. The different screens can include different physical screens, such as those associated with different computing devices, or the same physical screen in which the companion experience would be rendered in a frame or sub-window. | 2015-09-17 |
20150261836 | EXTRACTING DATA FROM COMMUNICATIONS RELATED TO DOCUMENTS - The disclosed embodiments provide a system that processes data. During operation, the system obtains a communication associated with a document and extracts data associated with the document from the communication. Next, the system uses the extracted data from the communication and document data from the document to build a context associated with the document. The system then uses the context to facilitate use of the document by a user associated with the communication. | 2015-09-17 |
20150261837 | Querying Structured And Unstructured Databases - Provided is a method of querying structured and unstructured databases. A structured database and an unstructured database are queried in conjunction in response to a query. Querying the unstructured database comprises: identifying primary keys from the query, identifying relationships between the primary keys, and querying the unstructured database based on the relationships between the primary keys. | 2015-09-17 |
20150261838 | MANAGING REPLICATION CONFIGURATION AVAILABILITY - A computer-implemented method, carried out by one or more processors, for managing replication configurations. In an embodiment, the method comprises receiving, by one or more processors, a replication configuration for replicating data, wherein the replication configuration defines at least a target table in a target database based on a source table in a source database; initializing, by one or more processors, a federated view, wherein the federated view is based on at least the source table in the source database as defined in the replication configuration; utilizing, by one or more processors, the federated view to satisfy requesting applications, where requesting applications obtain data from the federated view; responsive to determining the replication of data is in spec, utilizing, by one or more processors, the target table in the target database to satisfy requesting applications. | 2015-09-17 |