39th week of 2015 patent applcation highlights part 44 |
Patent application number | Title | Published |
20150269163 | PROVIDING SEARCH RECOMMENDATION - A first search term input by a user is obtained. The first search term is matched with at least one keyword in a list such as an offline lists to select at least one keyword from the list. Each keyword in the list corresponds to at least one search recommendation respectively. A search recommendation corresponding to the at least one keyword selected from the offline list is obtained and provided to the user as a search recommendation of the first search term. For example, a historical user behavior relating to the keyword is obtained from a log record. A document generated by the historical user behavior is obtained. At least one candidate recommendations are obtained from text segmentation of the document. The present techniques provide a large range of selection of search recommendations, reduce a number of user searches, and further reduce search time and traffic. | 2015-09-24 |
20150269164 | ELECTRONIC DEVICE AND CONTACT DISPLAY METHOD THEREFOR - A method for displaying contacts in an electronic device is provided. The method includes receiving user information corresponding to a contact from an external device, computing an intimacy level of the corresponding contact, and displaying the contact together with the user information on the basis of the intimacy level. | 2015-09-24 |
20150269165 | IDENTIFYING PEOPLE A PERSON MAY KNOW - A method and system for evaluating the reputation of a member of a social networking system is disclosed. Consistent with an embodiment of the invention, one or more attributes associated with a social networking profile of a member of a social network are analyzed. Based on the analysis, a ranking, rating or score is assigned to a particular category of reputation. When requested, the ranking, rating or score is displayed to a user of the social network. | 2015-09-24 |
20150269166 | Media Sequencing Method to Provide Location-Relevant Entertainment - Systems, methods, and computer-program products are described for determining current location information which includes determining whether an object is moving by comparing the current location information with previous location information. Future location information is calculated and a point of interest is filtered using the future location information. A media asset is then matched to the filtered point of interest and a current score is determined for the matched media asset. Determining a current score includes determining a window in which the matched media asset is geographically relevant to the future location information, and updating the matched media asset score when the future location information changes. An ordered playlist is dynamically generated according to the future location information by repeatedly prioritizing and sequencing matched media assets according to the current score for each matched media asset, and matched media assets are played or displayed in the ordered playlist. | 2015-09-24 |
20150269167 | PROVIDING RELEVANT NOTIFICATION BASED ON COMMON INTERESTS BETWEEN FRIENDS IN A SOCIAL NETWORKING SYSTEM - A social networking system provides relevant third-party content objects to users by matching user location, interests, and other social information with the content, location, and timing associated with the content objects. Content objects are provided based on relevance scores specific to a user. Relevance scores may be calculated based on the user's previous interactions with content object notifications, or based on interests that are common between the user and his or her connections in the social network. Context search is also provided for a user, wherein a list of search of results is ranked according to the relevance score of content object associated with the search results. Notifications may also be priced and distributed to users based on their relevance. In this way, the system can provide notifications that are relevant to user's interests and current circumstances, increasing the likelihood that they will find content objects of interest. | 2015-09-24 |
20150269168 | Systems And Methods Of Modeling Object Networks - According to one embodiment, a system is provided. The system includes a memory, at least one processor coupled to the memory and an object network modeler component executable by the at least one processor. The memory stores an object network including a plurality of objects, the plurality of objects including a first object, a second object, a third object, and a fourth object. The object network modeler component is configured to implicitly associate, within the object network, the first object with the second object and explicitly associate, within the object network, the third object with the fourth object. | 2015-09-24 |
20150269169 | AUTOMATED DYNAMIC REPRIORITIZATION OF PRESENTATION MATERIALS - A first selectable slide presentation priority level assigned to a slide presentation is determined responsive to detecting an indication from a user using an input device to start the slide presentation. Individual slides of the slide presentation determined to include an assigned individual slide priority level equal to or higher than the assigned first selectable slide presentation priority level are selectively presented. For each presented slide, the slide presentation is dynamically reprioritized to present any additional content-dependent slides determined to include a user-assigned inter-slide content dependency upon content of the presented slide. On any presented slide and any presented additional content-dependent slide that includes multi-priority content, any content item assigned with the first selectable slide presentation priority level is highlighted if any other content item on the respective slide includes a different assigned priority level. | 2015-09-24 |
20150269170 | Remote Storage and Provisioning of Local-Media Index - Embodiments described herein involve remote storage and provisioning of a local-media index. An example method may involve storing, by a computing system, a local-media index that identifies a plurality of multimedia items that are stored within a local area network and accessible within the local area network by a playback device of a media playback system within the local area network, and sending a message over a wide area network that indicates at least a portion of the local-media index to the media playback system. Another example method may involve, determining that a first local-media index is inaccessible over a wide area network to the media playback system, and then providing an identification of at least one multimedia item based on a second local-media index. | 2015-09-24 |
20150269171 | INFORMATION STORAGE SYSTEM - An information storage system includes: a data storing unit storing key value data in which a key is one of a plurality of elements of record data composed of the elements and the key is associated with a value including one or a plurality of record data; and a data structure converting unit converting a data structure of the key value data stored by the data storing unit into another data structure by changing the key. The data structure converting unit performs conversion of the data structure of the key value data stored by the data storing unit in accordance with a use condition of the key value data. | 2015-09-24 |
20150269172 | INFERRED OPERATIONS FOR DATA ANALYSIS - A method may include importing into a memory a set of data into a data structure having a plurality of rows and a plurality of columns, and metadata for the set of data. A rules engine determines one or more operations on particular columns of the set of data according to a set of rules. A rule may include a condition defined in terms of the metadata. Determined operations are input into a data analysis tool, the determined operations are performed, and results of the operations are displayed. The rule can include comparing a metadata attribute of a first column with a metadata attribute of a second column; comparing a metadata attribute of a first column with a metadata attribute associated with the rule; or comparing a first scope of a first column with a second scope of a second column. | 2015-09-24 |
20150269173 | METHOD AND SYSTEM FOR INCREMENTAL SEARCH WITH REDUCED TEXT ENTRY WHERE THE RELEVANCE OF RESULTS IS A DYNAMICALLY COMPUTED FUNCTION OF USER INPUT SEARCH STRING CHARACTER COUNT - A method and system are provided for processing a search request received from a user operating a text input device. The search request is directed at identifying a desired item from a set of items. Each of the items of the set of items has one or more associated terms. The method includes receiving a query input from a user directed at identifying the desired item. The query input comprises one or more characters input by the user on the text input device. As each character of the query input is received from the user, a group of items having one or more terms matching the characters received thus far of the query input is dynamically identified. The items in this group of items are ordered based on relevance values of the terms matching the characters and on the number of characters of the query input used in identifying the group of items. Identification of the group of items as ordered is transmitted to the user to be displayed on a device operated by the user. | 2015-09-24 |
20150269174 | METHOD AND APPARATUS FOR PERFORMING EXTENDED SEARCH - A method and apparatus for performing extended search are provided. The method includes receiving user-inputted keywords; extending the user-inputted keywords according to geographical information to acquire extended keywords; performing a search by using the extended keywords; and returning search results to the user. With the present technical solutions, privilege control can be effectively performed in a cloud storage system. With the present embodiments, more information may be provided to a user for reference. | 2015-09-24 |
20150269175 | Query Interpretation and Suggestion Generation under Various Constraints - A query processing system (QPS) is described herein for interpreting a user's input query against a structured knowledge base, to provide an output result. The output result may include one or more query suggestions, each providing a recommendation as to how a user may refine his or her query. In addition, or alternatively, the output result may specify one or more entity items which satisfy the user's query. In interpreting the user's query, the QPS may rely on a collection of rule modules which identify and process different types of constraints that may be expressed in the input query, including numeric constraint, nested constraints, comparison-based constraints, and so on. | 2015-09-24 |
20150269176 | User Interface Mechanisms for Query Refinement - A query processing system (QPS) for generating query suggestions to a user by matching the user's input query against a set of query-detection grammars defined by respective rule modules, and with respect to a structured knowledge base. In response to the matching operation, the QPS may generate a set of synthetic query suggestions to the user, representing refinements of the user's input query. The QPS can also present a refinement tool that conveys refinement options to the user. The QPS may also present one or more preview items to the user upon the user's selection of one of the synthetic query suggestions. Each synthetic query suggestion and each preview item is guaranteed to having a matching counterpart information item in the structured knowledge base. | 2015-09-24 |
20150269177 | Method and system for determining user interest in a file - A method and system for determining user interest in a file is disclosed. The method involves receiving a persistent command from a user to view a file, recording the duration of that persistent command, and determining a level of user interest based on the duration. Some embodiments also involve using the determined level of interest in social networking, using the determined level of interest for advertising or sales, and modifying the level of interest using statistical measures across multiple users or files. | 2015-09-24 |
20150269178 | SYSTEM AND METHOD FOR ENHANCED ACCURACY CARDINALITY ESTIMATION - Techniques are provided for improving the accuracy of analytics on big data using sketches and fixed-size buckets. In a technique for enhancing a unique count (cardinality) estimate of a large data set, a request for a cardinality estimate for the large data set is received. An initial cardinality estimate is determined using a sketch or a fixed-size bucket. If the initial cardinality estimate is within a range where the initial estimate could be further enhanced, the initial estimate is used for a lookup into a lookup table. Based on retrieved values from the lookup table and the initial estimate, an enhanced cardinality estimate is calculated. | 2015-09-24 |
20150269179 | SECOND LEVEL DATABASE FILE CACHE FOR ROW INSTANTIATION - In an example embodiment, one or more pages from a database are stored in a page cache stored in a shared memory, the one or more pages stored in a packed format. One or more rows from the database are stored in a row cache stored in the shared memory, the one or more rows stored in an unpacked format. A request for a row of the database is received. Then, the row cache is searched for the row. In response to a determination that the row cannot be found in the row cache, the page cache is searched for the row. Finally, the row is returned. | 2015-09-24 |
20150269180 | OZIP COMPRESSION AND DECOMPRESSION - A method, apparatus, and system for OZIP, a data compression and decompression codec, is provided. OZIP utilizes a fixed size static dictionary, which may be generated from a random sampling of input data to be compressed. Compression by direct token encoding to the static dictionary streamlines the encoding and avoids expensive conditional branching, facilitating hardware implementation and high parallelism. By bounding token definition sizes and static dictionary sizes to hardware architecture constraints such as word size or processor cache size, hardware implementation can be made fast and cost effective. For example, decompression may be accelerated by using SIMD instruction processor extensions. A highly granular block mapping in optional stored metadata allows compressed data to be accessed quickly at random, bypassing the processing overhead of dynamic dictionaries. Thus, OZIP can support low latency random data access for highly random workloads, such as for OLTP systems. | 2015-09-24 |
20150269181 | SYSTEM AND METHOD OF COMPRESSING DATA IN FONT FILES - A compressed font file including compressed data is received. The compressed data is decompressed to generate decompressed data. An attempt to validate the decompressed data is made. Within the decompressed data, a predetermined pattern of invalid data corresponding to an element of a font file is detected. The font file is reconstructed by replacing at least some of the invalid data with the element. | 2015-09-24 |
20150269182 | CONTROLLING SEGMENT SIZE DISTRIBUTION IN HASH-BASED DEDUPLICATION - Segment sizes are controlled by setting the size of a segment boundary in a hash-based deduplication system. A subsequence of size K of a sequence of characters S is set. Segment boundaries are set by using the sequence of the decreasingly restrictive logical tests if one of the sequence of the decreasingly restrictive logical tests returns a true value when applied on the sequence of characters S. | 2015-09-24 |
20150269183 | FILE REPLICATION USING FILE CONTENT LOCATION IDENTIFIERS - Systems and methods for file replication using file content location identifiers. An example method may comprise: receiving an identifier of a data structure associated with a file residing on a first file server, the data structure referencing a physical location of the contents of the file; identifying a file system operation to be performed with respect to a replica of the file residing on a second file server; and performing the file system operation by accessing the replica of the file using a file name alias comprising the identifier of the data structure. | 2015-09-24 |
20150269184 | METHODS AND SYSTEMS FOR MODELING A REPLICATION TOPOLOGY - Methods and systems for modeling a replication topology involve, for example, representing a plurality of replication components of a replication topology in a first binary matrix using a processor coupled to memory and generating a result matrix based at least in part on the first binary matrix likewise using the processor. Thereafter, also using the processor, replication components of the replication topology may be identified that are either enabled or non-enabled to receive replications from other replication components of the replication topology based at least in part on the result matrix. | 2015-09-24 |
20150269185 | TRANSACTION PROCESSING METHOD AND APPARATUS - The present invention provides a transaction processing method, which is applied to a node presenting a coordinator, where the coordinator is communicatively connected to nodes presenting participants. The method includes: sending, by the coordinator, a query message to each participant; drawing, by the coordinator, a conclusion according to response messages, executing, by the coordinator, the conclusion, and sending the conclusion to the participants, where the conclusion can be determined by a transaction ID, a object ID and a change information. | 2015-09-24 |
20150269186 | Database Virtualization - Aspects of the subject matter described herein relate database virtualization. In aspects, clusters of database servers may be located at various locations of the Internet. When a client seeks to access a logical database, the client may send a logical server and logical database name in a data structure. These names may be used to find a physical server(s) and database(s) that correspond to the logical database. Once the location is determined, a proxy component is used to intercept and/or forward communications between the client and the physical server(s) and database(s) corresponding to the logical database. Using this system, a client may access data from a logical database without knowing the physical address of the logical user database. | 2015-09-24 |
20150269187 | APPARATUS AND METHOD FOR PROVIDING VIRTUAL MACHINE IMAGE FILE - Provided is a method of providing a virtual machine image file in a cloud computing-based virtual desktop infrastructure. This method includes moving a golden image, an initial image provided from a shared storage, to a virtual machine driving server, converting the golden image into an image of a copy-on-write file format, and storing the same in a cache; allocating the converted virtual machine image to a virtual machine, and storing images of each virtual machine in the shared storage and managing the same to recover a virtual desktop when a disaster occurs. The method includes generating only data changed by the virtual machine, as a virtual machine image file, and managing the same, and hierarchically configuring a virtual machine image file based on a base image and storing the same in a cache memory in order to increase a loading rate of the virtual machine image file including the base image-based virtual machine image file. | 2015-09-24 |
20150269188 | METHOD AND DEVICE FOR PROVIDING INFORMATION USING BARCODE - A method of providing information using a bardcode and an electronic device thereof are provided. The method includes acquiring a barcode, extracting data based on the barcode, and generating an image including the extracted data. | 2015-09-24 |
20150269189 | RETRIEVAL APPARATUS, RETRIEVAL METHOD, AND COMPUTER PROGRAM PRODUCT - According to an embodiment, a retrieval apparatus includes a first receiving device, an obtaining device, a calculator, a determining controller, and a first display controller. The first receiving device receives selection of at least one mask image from among a plurality of predetermined mask images indicating retrieval target areas. The obtaining device obtains a first image. The calculator calculates a first feature quantity of an extraction area defined by the mask image in the first image. The determining controller searches for second information, in which a second image and a second feature quantity of each of a plurality of items are associated with each other, and determines the second image corresponding to the second feature quantity having a degree of similarity with the first feature quantity equal to or greater than a threshold value. The first display controller performs control to display the determined second image on a display. | 2015-09-24 |
20150269190 | METHOD AND SYSTEM FOR VEHICLE IDENTIFICATION - A vehicle identification system and method comprising (a) Calculating vehicle image and reference image of each vehicle by algorithm, in order to obtain respectively the first feature point set and second feature point set. (b) Comparing first feature point with second feature point to calibrate the vehicle image of each vehicle. (c) Establishing plurality of vehicle model image with a gradient bevel distance of the base of the conversion of such vehicles. (d) Capturing instant image of the vehicle. (e) Calculating instant image and reference image by algorithm to obtain respectively the third feature point and the second feature point. (f) Comparing the second feature point and the third feature point to calibrate the instant vehicle image. (g) The instant judgments greatest body image and the gradient of each pixel in each of the base vehicle model for each pixel of the image of the product to determine the real-time vehicle body image should compare of the vehicle model image of one of them. | 2015-09-24 |
20150269191 | METHOD FOR RETRIEVING SIMILAR IMAGE BASED ON VISUAL SALIENCIES AND VISUAL PHRASES - The present invention discloses a method for retrieving a similar image based on visual saliencies and visual phrases, comprising: inputting an inquired image; calculating a saliency map of the inquired image; performing viewpoint shift on the saliency map by utilizing a viewpoint shift model, defining a saliency region as a circular region which taking a viewpoint as a center and R as a radius, and shifting the viewpoint for k times to obtain k saliency regions of the inquired image; extracting a visual word in each of the saliency regions of the inquired image, to constitute a visual phrase, and jointing k visual phrases to generate an image descriptor of the inquired image; obtaining an image descriptor for each image of an inquired image library; and calculating a similarity value between the inquired image and each image in the inquired image library depending on the image descriptors by utilizing a cosine similarity, to obtain an image similar to the inquired image from the inquired image library. Through the present invention, noise in expression of an image is reduced, so that the expression of the image in a computer may be more consistent with human understanding of the semantics of the image, presenting a better retrieving effect and a higher retrieving speed. | 2015-09-24 |
20150269192 | DYNAMIC IDENTITY MATCHING IN RESPONSE TO THREAT LEVELS - A dynamic identity matching facility that enables an operator to determine the status of an individual based on identification information contained on an identification record provided by the individual. The operator scans the individual's identification information from the identification record using a scanning device. The facility decodes the scanned identification information and identifies a number of candidates based on the decoded identification information. For each identified candidate, the facility generates a candidate score. Based on the candidate score of each identified candidate, the facility selects a number of the identified candidates for display. The facility displays the selected candidates to the operator along with the candidate's criminal or other acts. | 2015-09-24 |
20150269193 | SCHEMA VALIDATION FOR METADATA BUILDER - Metadata is validated against a metadata schema by semantically validating metadata objects in metadata for a computer program, to confirm that required relationships among the metadata objects are present and conform to predefined rules. The metadata objects in the metadata for the computer program are also syntactically validated against a metadata schema for the metadata. Related methods, systems and computer programs are described. | 2015-09-24 |
20150269194 | INTERACTIVE USER INTERFACE FOR METADATA BUILDER - An interactive user interface for a metadata builder is provided by displaying a list of errors in metadata for a computer program and changing the list of errors that is displayed, responsive to receiving a change of the metadata for the computer system and processing the change of the metadata for the computer system. Specifically, an error is added to the list of errors that is displayed and/or is deleted from the list of errors that is displayed. The change of the metadata for the computer system may be an edit of the metadata object, a deletion of the metadata object, a cloning of a metadata object and/or an addition of a new metadata object. Related methods, systems and computer program products are described. | 2015-09-24 |
20150269195 | MODEL UPDATING APPARATUS AND METHOD - In one embodiment, a model updating apparatus includes a determiner, a selector, an obtainer, an updater. The determiner determines labels to be provided to each of data sets, using two or more models. Each of the data sets include at least one measured value measured by a sensor and a measurement target area of the sensor. The models are functions of the measured values. The selector selects a check target data set from the data sets, based on two or more labels determined by using the two or more models, respectively. The obtainer obtains a label provided by a user to the check target data set selected by the selector. The updater updates the models based on the check target data set and the label obtained by the obtainer. | 2015-09-24 |
20150269196 | MANAGING OBJECT LIFETIME IN A CYCLIC GRAPH - The present invention extends to methods, systems, and computer program products for managing object lifetime in a cyclic graph. Embodiments of the invention include reclaiming allocated system resources, for example, from a graph of objects that mixes different resource reclamation techniques (such as reference counting and garbage collection). In response to determining that garbage collection is to be performed, references between GC objects and Ref. Counted objects are detected. A reference type (e.g., direct, indirect, standard, tracked, weakened, etc.) for any detected references is also determined. Garbage collection is performed to determine if any allocated system resources can be reclaimed. Garbage collection considers references and references types between GC objects and Ref. Counted objects when determining if objects are to be reclaimed. | 2015-09-24 |
20150269197 | CONFORMING DATA STRUCTURE INSTANCES TO SCHEMA VERSIONS - In a method for managing versions of a schema, a processor receives a first version of a schema. A processor generates an annotated version of the first version of the schema, wherein one or more fields of the annotated version of the first version of the schema each correspond to a distinct identifier. A processor receives a first instance conforming to the first version of the schema. A processor identifies one or more values of the first instance, wherein each value of the one or more values corresponds to a field of the one or more fields. A processor assigns an identifier to at least one value of the one or more values based on the distinct identifier corresponding to the field of the at least one value. A processor stores the at least one value, such that the at least one value is associated with the assigned identifier. | 2015-09-24 |
20150269198 | CONFORMING DATA STRUCTURE INSTANCES TO SHEMA VERSIONS - In a method for managing versions of a schema, a processor receives a first version of a schema. A processor generates an annotated version of the first version of the schema, wherein one or more fields of the annotated version of the first version of the schema each correspond to a distinct identifier. A processor receives a first instance conforming to the first version of the schema. A processor identifies one or more values of the first instance, wherein each value of the one or more values corresponds to a field of the one or more fields. A processor assigns an identifier to at least one value of the one or more values based on the distinct identifier corresponding to the field of the at least one value. A processor stores the at least one value, such that the at least one value is associated with the assigned identifier. | 2015-09-24 |
20150269199 | SYSTEM AND METHOD FOR FETCHING THE LATEST VERSIONS OF STORED DATA OBJECTS - A distributed storage system may store data object instances in persistent storage and may cache keymap information for those data object instances. The system may cache a latest symbolic key entry for some user keys of the data object instances. When a request is made for the latest version of stored data object instances having a specified user key, the latest version may be determined dependent on whether a latest symbolic key entry exists for the specified user key, and keymap information for the latest version may be returned. When storing keymap information, a flag may be set to indicate that a corresponding latest symbolic key entry should be updated. The system may delete a latest symbolic key entry for a particular user key from the cache in response to determining that no other requests involving the keymap information for data object instances having the particular user key are pending. | 2015-09-24 |
20150269200 | Media-Item Database - Embodiments are described herein that allow for maintaining a media-item database. In one aspect, a method is provided that involves a computing system (a) receiving a first message from a first playback device, where the first message identifies at least a first service used by the first playback device to obtain a first media item for playback, a first service media-item identifier, and a first metadata, (b) receiving a second message from a second playback device, wherein the second message identifies at least a second service used by the second playback device to obtain a second media item for playback, a second service media-item identifier, and a second metadata, (c) determining that the first media item and the second media item are the same, and (d) responsively, storing association data that associates the first service media-item identifier and the second service media-item identifier. | 2015-09-24 |
20150269201 | METHOD TO CONSTRUCT A FILE SYSTEM BASED ON AGGREGATED METADATA FROM DISPARATE SOURCES - A system and method for constructing a file system based on aggregated metadata from disparate sources is described. The system scans basic attributes of files in a file system, extended attributes of the files in the file system, and application-specific attributes of files that are managed by corresponding applications in the file system. The system generates an aggregate metadata library for the corresponding files based on the basic attributes, extended attributes, and application-specific attributes and builds a unified file system based on the aggregate metadata library. | 2015-09-24 |
20150269202 | SYSTEM AND METHOD FOR COLUMN-SPECIFIC MATERIALIZATION SCHEDULING - A method of dynamically computing an optimal materialization schedule for each column in a column oriented RDBMS. Dynamic column-specific materialization scheduling in a distributed column oriented RDBMS is optimized by choosing a materialization strategy based on execution cost including central processing unit (CPU), disk, and network costs for each individual exchange operator. The dynamic programming approach is computationally feasible because the optimal schedule for a sub-plan is path independent. | 2015-09-24 |
20150269203 | ACCELERATED ACCESS TO OBJECTS IN AN OBJECT STORE IMPLEMENTED UTILIZING A FILE STORAGE SYSTEM - In one embodiment, a method for creating an object includes creating an object in an object store making use of a file system, obtaining an index node (inode) identifier (ID) for an inode associated with the object, creating an object ID for the object, wherein the object ID is unique from any other object IDs in the object store, merging the object ID with the inode ID, and modifying the inode to include at least the object ID. In another embodiment, a system includes a processor and logic integrated with and/or executable by the processor, the logic being configured to: create an object in an object store making use of a file system, obtain an inode ID for an inode associated with the object, create an object ID for the object, the object ID including the inode and modify the inode to include at least the object ID. | 2015-09-24 |
20150269204 | COLOR CODED SYMBOL BASED WORLD WIDE WEB INDEXING AND RETRIEVAL SYSTEM - Machines, systems, and methods for a color coded symbol based world wide web indexing and retrieval system is provided. A method for using color coded symbol permutations for indexing and retrieving information on the world wide web, comprising using color coded symbol permutations, relating one or more than one piece of information thereto, and storing said color coded symbol permutations and their related one or more than one piece information for future lookup. | 2015-09-24 |
20150269205 | METHOD AND APPARATUS FOR QUERYING DATA IN DATABASE - A method and an apparatus for querying data in a database, and the method includes: receiving a query instruction; determining a status of each block index in a block index set prestored in a global memory of a GPU; when each block index in the global memory of the GPU is in an asynchronous state, starting one or more GPU processes to filter the block index in the global memory of the GPU according to a query condition, to obtain a first block index query result; and determining a final data query result according to the first block index query result. In this method, querying is performed by directly using a GPU process, thereby omitting a process of repeatedly copying partitioned data from a memory in the prior art, shortening query time, and improving query efficiency. | 2015-09-24 |
20150269206 | Systems and Methods for Data Processing - Systems and methods are provided for data processing. For example, first digest values associated with first contents of a plurality of first data points are calculated, the plurality of first data points including a second data point and one or more third data points; a second digest value associated with a second content of the second data point is compared with one or more third digest values associated with third contents of the third data points, the third data points preceding the second data point; in response to the second digest value being the same as a fourth digest value associated with a fourth content of a fourth data point, the second content of the second data point is deleted, the fourth data point being within the one or more third data points; and a mapping between the second digest value and the fourth content is established. | 2015-09-24 |
20150269207 | SIMPLE AND EFFICIENT METHOD FOR RECYCLING DEVICE IDENTIFIERS - A method and system for simple and efficient recycling of entity IDs in a network may rely upon two tables storing records associated with a particular entity ID while avoiding the use of timestamps or a common time source. A first table may store X number of records associated with active entities, including active entity IDs. A second table, referred to herein as an entity ID table, may store Y number of records associated with deactivated entities, including available entity IDs for reuse and a delete index, which may record an ordinal value associated with deactivated entity IDs. The two tables may enable fast and computationally efficient recycling of entity IDs without having to perform costly sorting operations and without the use of timestamps or a common time source. | 2015-09-24 |
20150269208 | INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND COMPUTER PROGRAM - There is provided an information processing device including a query generation unit configured to generate, on the basis of a table in a database and any query with regard to the table, one or more different queries, and a table search unit configured to search for the number of tables that are different from the table and in which a result of the different query generated by the query generation unit is not in conflict with a result of the any query. | 2015-09-24 |
20150269209 | FOLLOWING DATA RECORDS IN AN INFORMATION FEED - Disclosed are some examples of systems, apparatus, methods, and computer program products related to automatically causing a following relationship to be established in an enterprise social networking system between a user and one or more customer relationship management (CRM) records. In some implementations, a workflow is configurable at least in part by one or more selections defining one or more conditions. Responsive to determining that one or more properties associated with a first CRM record satisfies the one or more conditions, a user is caused to follow the first CRM record. The following enables or causes updates associated with the first CRM record to be shared in a feed of the enterprise social networking system, where the feed can be provided to the user's device. Information based on the following of the first CRM record by the user can be displayed at the device. | 2015-09-24 |
20150269210 | PERSONAL CUSTOMER CARE AGENT - Information is aggregated and made available to users. A system monitors over the internet a first set of external information sources for a first user based on instructions from a first user profile that specifies information to aggregate for the first user. The system detects, based on the monitoring, new data at one of the first set of information sources. The system obtains the new data at the one of the first set of information sources, independent of preferences of the one of the first set of information sources. The system updates aggregated information for the first user with the new data from the one of the first set of information sources. The updated aggregated information for the first user is made available to the first user. | 2015-09-24 |
20150269211 | EVOLUTION AWARE CLUSTERING OF STREAMING GRAPHS - A system to manage clustering vertices of a streaming graph includes a memory storing a computer program, a vertex structure storing vertices of the graph, and a cluster structure storing clusters of the graph, and a processor. Each cluster structure comprises a plurality of edge structures represent edges of the graph and each edge structure comprises two of the vertices. The processor is configured to execute the program to cluster the vertices using the structures and a maximum cluster size that is constant. | 2015-09-24 |
20150269212 | DATA LOGGING FRAMEWORK - A data-logging framework (“logger”) includes a configuration file in which an application can define various data fields and locations at which the data fields are to be logged. Some data fields include validating functions that are used by the logger to determine whether a value of a data field is valid. The application can also define (a) canonical data fields using the logger and (b) derived data fields. Upon receiving the data fields and their values from the application, the logger can determine whether the data fields are defined in the configuration file, validate the values, and log the values at the specified locations. Values of any canonical and/or derived data fields are obtained by the logger and logged at the specified locations. | 2015-09-24 |
20150269213 | COMPACTING CHANGE LOGS USING FILE CONTENT LOCATION IDENTIFIERS - Systems and methods for compacting change logs using file content location identifiers. An example method may comprise: identifying a first change log record comprising an identifier of a first data structure referencing a first physical location of contents of a file before a first file system operation, the first change log record further comprising an identifier of a second data structure referencing a second physical location of the contents of the file after the file first system operation; identifying a second change log record comprising the identifier of the second data structure referencing the second physical location of the contents of the file before a second file system operation, the second change log record further comprising an identifier of a third data structure referencing a third physical location of the contents of the file after the second file system operation; and replacing the first change log record and the second change log record with a third change log record comprising the identifier of the first data structure and the identifier of the third data structure. | 2015-09-24 |
20150269214 | IDENTIFYING FILES IN CHANGE LOGS USING FILE CONTENT LOCATION IDENTIFIERS - Systems and methods for identifying files in change logs using file content location identifiers. An example method may comprise: detecting a file system operation associated with a file; and creating a change log record comprising an identifier of a first data structure referencing a first physical location of contents of the file before the file system operation, and an identifier of a second data structure referencing a second physical location of the contents of the file after the file system operation. | 2015-09-24 |
20150269215 | DEPENDENCY-AWARE TRANSACTION BATCHING FOR DATA REPLICATION - Techniques are provided for dependency-aware transaction batching for data replication. A plurality of change records corresponding to a plurality of transactions is read. Inter-transaction dependency data is generated, the inter-transaction dependency data including at least one inter-transaction dependency relationship between a plurality of pending transactions. Each inter-transaction dependency relationship indicates that a first transaction is dependent on a second transaction. A batch transaction is generated based on the inter-transaction dependency data. The batch transaction includes at least one pending transaction of the plurality of pending transactions. The batch transaction is assigned to an apply process of a plurality of apply processes configured to apply batch transactions in parallel. | 2015-09-24 |
20150269216 | MOBILE SENDER CONTROLLED DATA ACCESS AND DATA DELETION METHOD AND SYSTEM - A method and system are provided for remotely deleting data stored on the remote mobile communication device, and within the communication network, by initiating a delete command, or setting data time of existence when creating the data, from a sender mobile communication device. | 2015-09-24 |
20150269217 | EMBEDDED CHANGE LOGGING FOR DATA SYNCHRONIZATION - Embodiments of the present invention provide for synchronization client coordination with a change log service (CLS). In an embodiment of the invention, a change tracking thread on a synchronization client provided as part of a pervasive device is initiated. A synchronization message is sent to the CLS upon detecting a change to data. Synchronization is performed and upon completing synchronization, a synchronization stop message is sent to the CLS. Upon sending the synchronization stop message to the CLS, the change tracking thread on the synchronization client is stopped. | 2015-09-24 |
20150269218 | LOGICAL VALIDATION FOR METADATA BUILDER - Metadata objects in metadata for a computer program are logically validated to confirm that content of the metadata has referential integrity. The metadata objects may also be logically validated according to specific validation rules that apply to the type of the metadata object. Recursive or non-recursive techniques may be used, depending upon the size of the metadata. Related systems, methods and computer programs are described. | 2015-09-24 |
20150269219 | QUALIFICATION OF MATCH RESULTS - Qualification of data matches can be improved relative to existing approaches by use of first, second, and third similarity criteria, which can be used to identify a set of near match record pairs, identify a set of actual match record pairs and to flag as near matches those record pairs of the set of near matches that were identified as actual matches, and to identify and flag one or more suspect matches. | 2015-09-24 |
20150269220 | SYSTEM AND METHOD FOR CREATING A CUSTOMIZED DIGITAL IMAGE - There are provided methods and systems for providing viewers of a digital image with information about identifiable and scenes within the image. In an embodiment, digital images, uploaded to a host website, are customized through the incorporation of some number of selectable informational links and other text based information to provide viewers of the image real-time access to social and advertising related information regarding certain identifiable objects and scenes in the image. The selectable information links are incorporated within and around the digital image in a process referred to herein as image tagging. | 2015-09-24 |
20150269221 | Search by Example - A computer system uses a search engine to search a dataset using an initial query provided by a user and thereby to produce initial search results. The system enables the user to select portions of the initial search results. The system identifies metadata associated with the selected portions, and displays information representing that metadata in a form that is easily understandable by a person not trained in the annotation system in which the search results are encoded. The user may instruct the system to add one or more of the displayed metadata elements to the initial query, in response to which the system may add the specified metadata elements to the initial query to produce a modified query. The system may search the dataset using the modified query and thereby produce modified search results. The process may be repeated as desired by the user to further refine the search results. | 2015-09-24 |
20150269222 | SYSTEM METHOD, AND COMPUTER READABLE MEDIA FOR IDENTIFYING A USER-INITIATED LOG FILE RECORD IN A LOG FILE - A system, a method, and a computer readable media for identifying a user-initiated log file record in a log file are provided. The log file has a user-initiated log file record and a repeating pattern of log file records automatically generated by a software program. The system allows a user to identify first and second timestamp values corresponding to first and second times which identify a time interval of interest in the log file. The system further analyzes the log file to identify the user-initiated log file record having a timestamp value between the first and second timestamp values. The system further identifies the repeating pattern of log file records in the log file. | 2015-09-24 |
20150269223 | System for Accessing a Relational Database Using Semantic Queries - This invention is a system for integrating relational databases into a semantic web framework utilizing a simple mapping process and the SQL query optimizer present in the SQL database engine. | 2015-09-24 |
20150269224 | QUERY ROUTING BASED ON COMPLEXITY CLASS DETERMINATION - A computer implemented method, computer system, and computer program product performs a query on a relational database. When a query is received, a corresponding complexity class is determined for the query. The query is routed to a corresponding query processor based on the corresponding complexity class determined for the submitted query. The query is executed on the corresponding query processor according to a determined execution plan. | 2015-09-24 |
20150269225 | SYSTEM AND METHOD FOR PARALLELIZING GRID SEARCH METHOD FACILITATING DETERMINATION OF PK-PD PARAMETERS - Disclosed is a system and method for parallelizing grid search technique facilitating determination of PK-PD parameters. The method may comprise determining number of grids. The method may further comprise creating grid points based upon the number of grids (N) and a number of parameters (p). The method may further comprise distributing the grid points amongst number of threads. The method may further comprise evaluating an objective function value corresponding to each grid point in order to compute an objective function value associated with each of the grid points. Further, the method may comprise identifying a grid point having minimum objective function value. The grid point having the least objective function value may indicate the estimated initial PK-PD parameters. | 2015-09-24 |
20150269226 | TRANSACTION REPAIR - An aspect includes concurrently executing two or more transactions over a database. A plurality of transactions is executed in parallel while recording each transaction's sensitivities and output deltas. A sensitivity of a transaction identifies an aspect of a database state whose modification has a potential of altering an output of the transaction, and an output delta of the transaction indicates a change to the database state that is a result of the transaction being executed. The output deltas are fed from a first transaction through a filter for a second transaction. The filter is based on the second transaction's sensitivities. The filtered deltas are processed in the second transaction to incrementally compute revised deltas and sensitivities for the second transaction. For each transaction that successfully commits, the transaction's deltas are applied to update the database. | 2015-09-24 |
20150269227 | WINDOWLESS REAL-TIME JOINS - A method for performing windowless real-time joins. 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, prior to receiving data, initializing data structures. The method also can include, prior to receiving data, pre-computing steps to be performed upon receiving the data. The method additionally can include, upon receiving the data, performing windowless join updates. Other embodiments are provided. | 2015-09-24 |
20150269228 | PROGRESSIVE QUERY COMPUTATION USING STREAMING ARCHITECTURES - The described implementations relate to processing of electronic data. One implementation is manifest as a technique that can include obtaining a relational query that references one or more data items and associating progress intervals with the data items. The technique can also include converting the relational query into a corresponding streaming query, and providing the streaming query and the data items with the progress intervals to a stream engine that produces incremental results of the query. For example, the progress intervals can be based on row numbers of a relational database table. The progress intervals can be used to define event lifetimes of streaming events that are provided as inputs to the stream engine. | 2015-09-24 |
20150269229 | Virtual Pointer and Annotations Through Real Time Communications - An apparatus, system, and method, is described for the capturing and processing of virtual annotations that identify features on medical devices; the annotations may be captured using mobile computing devices, such as smartphones, and displayed on mobile display devices, such as, tablets; and communicated across a network using standard internet protocols. | 2015-09-24 |
20150269230 | FAST AND SCALABLE CONNECTED COMPONENT COMPUTATION - Finding connected components in a graph is a well-known problem in a wide variety of application areas such as social network analysis, data mining, image processing, and etc. We present an efficient and scalable approach to find all the connected components in a given graph. We compare our approach with the state-of-the-art on a real-world graph. We also demonstrate the viability of our approach on a massive graph with ˜6B nodes and ˜92B edges on an 80-node Hadoop cluster. To the best of our knowledge, this is the largest graph publicly used in such an experiment. | 2015-09-24 |
20150269231 | CLUSTERED SEARCH RESULTS - Methods, systems, and computer readable media are provided for organizing search results. In some implementations, a search system receives a search query. In some implementations, the search system generates one or more second search queries based on the first search query and data stored in a data structure such as a knowledge graph. In some implementations, the search system causes search results to be generated based on the second search query, and causes the generated search results to be presented. In some implementations, the search system organizes the search results based on the second search queries. | 2015-09-24 |
20150269232 | INFORMATION PROCESSING APPARATUS, CONTROL METHOD, AND PROGRAM - There is provided an information processing apparatus including an obtaining unit configured to obtain one or more other information elements corresponding to one information element based on a degree of association between the one information element and the other information elements, an extraction unit configured to extract a description of a type of association between the one information element and the obtained other information elements, and a presentation control unit configured to perform control in a manner that the one information element, the other information elements, the type of association, and the description of the type of association are presented. | 2015-09-24 |
20150269233 | Data Reduction With Specified Constraints - System and method for rendering data with specified constraints. A request for data from a data set may be received. The data set may include time-stamped historical data, including multiple reduced data sets, each having a respective resolution. The request may specify a time frame. A first reduced data set of the reduced data sets may be determined based on the specified time frame. First data from the first reduced data set corresponding to the specified time frame may be retrieved, and are usable for display on a display device. The data set may be generated from received raw data, where the raw data includes time-stamped historical data at a first resolution. The raw data may be reduced via multiple stages, thereby generating the reduced data sets at their respective resolutions. The reduced data are generated and represented in a way that is visually pleasing and technically accurate. | 2015-09-24 |
20150269234 | User Defined Functions Including Requests for Analytics by External Analytic Engines - Described herein are techniques enabling a query engine to process a query comprising a user defined function. The user defined function can include a request for analytics to be performed by an external analytic engine. The query engine can retrieve data from a database in accordance with the query and send the data and instructions to perform the analytics to the external analytic engine. The query engine can then receive analytic results from the external analytic engine. | 2015-09-24 |
20150269235 | RUN TIME INSERTION AND REMOVAL OF BUFFER OPERATORS - Insertion, in a data warehouse process, of a buffer operator between an upstream data operator and a downstream data operator. The processor processes a data record for the upstream data operator to pass to the downstream data operator. In response to determining that the downstream data operator is not ready to accept the data record from the upstream data operator, a buffer operator is inserted between the upstream data operator and the downstream data operator. The data record processed by the upstream data operator is passed to the buffer operator for storing into a buffer allocated for use by the buffer operator. The data record stored into the buffer is passed to the downstream data operator when the downstream data operator is ready to accept data. In another aspect, when the allocated buffer utilization decreases to a threshold value, the buffer operator is removed and the buffers are released. | 2015-09-24 |
20150269236 | SYSTEMS AND METHODS FOR ADDING DESCRIPTIVE METADATA TO DIGITAL CONTENT - Methods, computer-readable media, and systems for scheduling the association of metadata with content. In an embodiment, event information is obtained from a virtual calendar, wherein the event information comprises at least one event detail and one or more parameters defining a time period. First metadata is generated based on the event detail, and is stored, in association with the time period, in a memory. Then, subsequently, during the time period, the first metadata may be retrieved from the memory, and associated with one or more content items generated on the device. | 2015-09-24 |
20150269237 | Disaster Recovery of Converged Infrastructure Platforms - A method, computer and system for the backup and recovery of a converged infrastructure computer system is provided. The method and system provides backup and recovery of the data and applications on the servers themselves, but further provides backup and recovery of the configuration and mapping information of the converged infrastructure computer system itself. | 2015-09-24 |
20150269238 | Networking-Assisted Input/Output Order Preservation for Data Replication - Methods, systems, and articles of manufacture for networking-assisted I/O order preservation for data replication are provided herein. A method includes identifying, from one or more devices at a primary site, (i) each of multiple data changes and (ii) input/output chronological order information associated with the multiple data changes; determining one or more forwarding rules to be implemented in connection with delivering a command associated with each of said multiple data changes to one or more devices at a secondary site, wherein said forwarding rules are based on said input/output chronological order information; and delivering the command associated with each of said multiple data changes to one or more devices at the secondary site in accordance with said one or more forwarding rules to maintain a chronological order of the multiple data changes from the primary site to the secondary site. | 2015-09-24 |
20150269239 | STORAGE DEVICE SELECTION FOR DATABASE PARTITION REPLICAS - A system that implements a data storage service may store data in multiple replicated partitions on respective storage nodes. The selection of the storage nodes (or storage devices thereof) on which to store the partition replicas may be performed by administrative components that are responsible for partition management and resource allocation for respective groups of storage nodes (e.g., based on a global view of resource capacity or usage), or the selection of particular storage devices of a storage node may be determined by the storage node itself (e.g., based on a local view of resource capacity or usage). Placement policies applied at the administrative layer or storage layer may be based on the percentage or amount of provisioned, reserved, or available storage or IOPS capacity on each storage device, and particular placements (or subsequent operations to move partition replicas) may result in an overall resource utilization that is well balanced. | 2015-09-24 |
20150269240 | DATA EXTRACTION AND SPARSENESS DISCOVERY FROM MULTIDIMENSIONAL DATABASES - Techniques for a method for efficiently extracting data from multidimensional databases are disclosed herein. When extracting data from a subset of a multidimensional database, the method first extracts data from high-level cells within the subset. If there are any empty high-level cells, the method removes lower-level cells that roll-up into the empty high-level cell, without extracting data from these lower-level cells. The method improves the data extraction efficiency by reducing the overhead of extracting data from empty cells of multidimensional databases. | 2015-09-24 |
20150269241 | TIME SERIES CLUSTERING - A method of transforming time series data to cluster data is provided. Time series data including a plurality of time series is received. A distance between a first time series of the plurality of time series and each of a remaining set of time series of the plurality of time series is computed pairwise between each of the remaining set of time series of the plurality of time series and the first time series. The computed values of the distance are sorted in increasing value. Gap width values are computed as a difference between successive pairs of the sorted, computed values. Whether a cluster including the received time series data is uniform is determined based on the computed gap width values. Cluster data including the first time series and the remaining set of time series assigned to the cluster is output when the cluster is determined to be uniform. | 2015-09-24 |
20150269242 | EMAIL ANALYTICS - A method for performing email analytics is described. The method includes extracting emails from the configured email repository. The emails are then grouped into mail groups based on identification of content similarity of the emails. A network graph is then constructed for each of the mail group to identify an association of emails in the mail group based on header-level analysis of emails. Thereafter, email analytics is performed on the mail groups by clustering the mail groups into mail clusters based on temporal progression of emails in the mail groups. Key phrases are then determined based on a content analysis of emails in the mail groups in the mail clusters. The key phrases are then associated with the network graphs of the mail groups. | 2015-09-24 |
20150269243 | COMPUTER PRODUCT, SOFTWARE DIVIDING APPARATUS, AND SOFTWARE DIVIDING METHOD - A non-transitory, computer-readable recording medium stores a program that causes a computer to execute a process that includes dividing a target entity set into clusters, the target entity set being divided according to a selection of the target entity set to be processed among an entity group as a constituent element group of software, the target entity set being divided based on a weight that is related to a dependence relationship between entities of the entity group and identified by the dependence relationship, the target entity set being divided so that a total of the weights related to the dependence relationships between the entities within a same cluster will be higher than an expected value of the total; and selecting, when a count of entities within a cluster among the divided clusters exceeds a pre-stored upper-limit number of entities, an entity set within the cluster as the target entity set. | 2015-09-24 |
20150269244 | CLUSTERING ANALYSIS OF RETENTION PROBABILITIES - During an analysis technique, organization data for an organization (such as a company) and a set of potential predictors for retention are analyzed to generate Kaplan-Meier estimator curves. Then, clustering analysis is performed to determine natural groupings of Kaplan-Meier estimator curves. Note that the retention data may include, as a function of time, retention probabilities that the individuals remain in functions in an organization and a set of potential predictors for the retention probabilities. Moreover, the predictors for retention in the set of potential predictors are identified based on the determined natural groupings. For example, the identified predictors may be those for which at least two natural groupings have a large centroid separation. Furthermore, the identified predictors for retention may be used to determine remedial action to increase the retention probabilities. | 2015-09-24 |
20150269245 | SYSTEMS AND METHODS FOR ORGANIZING DATA SETS - A method is provided for organizing data sets. In use, an automatic decision system is created or updated for determining whether data elements fit a predefined organization or not, where the decision system is based on a set of preorganized data elements. A plurality of data elements is organized using the decision system. At least one organized data element is selected for output to a user based on a score or confidence from the decision system for the at least one organized data element. Additionally, at least a portion of the at least one organized data element is output to the user. A response is received from the user comprising at least one of a confirmation, modification, and a negation of the organization of the at least one organized data element. The automatic decision system is recreated or updated based on the user response. Other embodiments are also presented. | 2015-09-24 |
20150269246 | POINT CLOUD DATA HIERARCHY - One embodiment is directed to a system for presenting views of a very large point data set, comprising: a storage system comprising data representing a point cloud comprising a very large number of associated points; a controller operatively coupled to the storage cluster and configured to automatically and deterministically organize the point data into an octree hierarchy of data sectors, each of which is representative of one or more of the points at a given octree mesh resolution; and a user interface through which a user may select a viewing perspective origin and vector, which may be utilized to command the controller to assemble an image based at least in part upon the selected origin and vector, the image comprising a plurality of data sectors pulled from the octree hierarchy. | 2015-09-24 |
20150269247 | Method and Apparatus for Performing a Geometric Transformation on Objects in an Object-Oriented Environment using a Multiple-Transaction Technique - A large number of objects, such as objects representing beams and columns in an object-oriented enterprise engineering system, may be geometrically transformed in a model database by dividing the objects according to criteria into a number of ordered partitions and transforming the objects in each partition as an atomic operation. The number of objects that may be transformed is not constrained by the amount of memory available in the system. Objects that are to be transformed are organized into the ordered partitions, and the partitions are transformed in sequential order, such that all predecessors of a given object are transformed before, or in the same operation as, the given object. If a large transformation operation abnormally terminates before all the small transformation operations have been completed, the model database is, nevertheless, left in a consistent state. The transformation operation may be resumed from the point of interruption. | 2015-09-24 |
20150269248 | IMPORTING METADATA INTO METADATA BUILDER - First metadata for a first version of a computer program product and a first metadata schema is converted into second metadata for a second version of the computer program product and/or a second metadata schema. The converting may be performed by recursively processing an object class structure representing the second metadata, to construct objects and their contents pursuant to a set of ID references for the second metadata. The recursive processing may be performed by repeatedly calling methods of an object in the object class structure to populate the content of the object using the set of ID references. The repeatedly calling may be performed using object reflection. Related methods, systems and computer programs are described. | 2015-09-24 |
20150269249 | COMPUTER-IMPLEMENTED METHOD OF ARRANGING TEXT ITEMS IN A PREDEFINED ORDER - A computer-implemented method of and a device, such as a base station for a headset, for arranging text items in a predefined order, comprising storing, in the memory of a peripheral device, a collection of multiple text items arranged in multiple sets of text items and in multiple groups of text items; storing a respective code item with a respective group of text items; and storing a sort key that has values that designate a predefined order of the text items in each set. The sort key is appended to the text items and comprises at least one character with a value within the Private Use range of the Unicode format. | 2015-09-24 |
20150269250 | POLYGON-BASED INDEXING OF PLACES - In one embodiment, a method includes receiving an identification of a location. The method further includes accessing an inverted index that comprises a plurality of records, where each record corresponds to a map tile and identifies one or more places corresponding to the map tile. At least one of the places identified in the inverted index is identified in multiple records corresponding to multiple map tiles, where the map tiles collectively define an area that circumscribes the place. The method also includes identifying based on the inverted index one or more places associated with the location. | 2015-09-24 |
20150269251 | METHOD AND SYSTEM OF EVALUATING THE IMPACT OF DISTRIBUTED DIGITAL CONTENT - A method for evaluating the impact of distributed digital content, including identifying content produced by a publisher on a first domain, determining user activity data associated with the content on one or more social networks, calculating an instantaneous score for each of the social networks for the content based on the user activity data associated with the content on the respective social network, calculating a velocity score for each of the social networks for the content, the velocity score comprising a rate of change of the instantaneous score for the respective social network, calculating a social value score for the content based on the velocity scores of the one or more social networks, and sending the social value score to a computer associated with the publisher. | 2015-09-24 |
20150269252 | NONSTANDARD LOCALITY-BASED TEXT ENTRY - A computer-implemented method of providing text entry assistance data includes receiving at a system location information associated with a user, receiving at the system information indicative of predictive textual outcomes, generating dictionary data using the location information, and providing the dictionary data to a remote device. | 2015-09-24 |
20150269253 | INFORMATION PROCESSING DEVICE - This information processing device is provided with: data management means in which table-formatted data, with rows in which one group of tuple data units comprising a plurality of attribute data units are positioned and columns in which attributes are positioned, is stored so that the tuple data is collectively stored in a storage device by attribute data; and data processing means which executes predetermined processing with respect to a database. The data management means stores each attribute data unit that configures a tuple data unit in the order in which the tuple data units are positioned in the table format, in a plurality of chunks having storage areas of a predetermined capacity set for each of the attribute data units. Furthermore, the data management means acquires, for each attribute, deletion data information representing information specifying the table format order of the tuple data units that have attribute data units that have been deleted by the data processing means from the chunks that have been set for each attribute, and frees the chunks on the basis of the deletion data information. | 2015-09-24 |
20150269254 | Simplified Hierarchy Definition for Multidimensional Data Analysis - Techniques are described for allowing a user to define hierarchical relationships for a multidimensional data model without assistance from a data administrator. The hierarchical relationships can be stored as on the client device as part of report metadata so that they are customizable by the client. A graphical user interface is also described for generating reports using a reporting tool. Through move and select operations, a report along with its underlying hierarchical relationships can be customized by the client. | 2015-09-24 |
20150269255 | ALIGNMENT AND RE-ASSOCIATION OF METADATA FOR MEDIA STREAMS WITHIN A COMPUTING DEVICE - Techniques for re-associating dynamic metadata with media data are provided. A media processing system creates, with a first media processing stage, binding information comprising dynamic metadata and a time relationship between the dynamic metadata and media data. The binding information may be derived from the media data. While the first media processing stage delivers the media data to a second media processing stage in a first data path, the first media processing stage passes the binding information to the second media processing stage in a second data path. The media processing system re-associates, with the second media processing stage, the dynamic metadata and the media data using the binding information. | 2015-09-24 |
20150269256 | SYSTEM AND METHOD FOR CROSS-LIBRARY RECOMMENDATION - A music recommendation system receives a user selection of desired music, retrieves analysis data associated with the selected music, and generates a playlist of songs based on the analysis data. The analysis data is generated based on a processing of one or more audio signals associated with the selected music. The analysis data may downloaded from a central server. If the analysis data is not available from the central server, it is generated locally at a user end, and uploaded to the central server. A plurality of user-selectable shuffling mechanisms are provided to allow the order of the songs to be shuffled according to the selected shuffling mechanism. The end user device may also receive recommendation of new music from different providers based on the analysis data of music for which the recommendation is to be based. | 2015-09-24 |
20150269257 | FINDING SERVICES IN A SERVICE-ORIENTED ARCHITECTURE (SOA) NETWORK - A method and system for finding services in a service-oriented architecture network may include receiving, in a local service registry from a client, a search query for a particular service. The local service registry may include a local database listing registered services. The network may include querying the local database to determine a first list of services that satisfy the search query and determining a neighboring service registry, in a network of service registries, based on a property other than a property of the particular service being searched for. The method may include sending the search query to the neighboring service registry and receiving, from the neighboring service registry, a second list of services, registered with the neighboring service registry, that satisfy the search query. The method may include returning, to the client, the first list of services and the second list of services that satisfy the search query. | 2015-09-24 |
20150269258 | Automated Self-Censoring of Remotely-Sensed Data Based on Automated ROI Awareness and People Detection Using a Prioritized Contact Transport Stream - A system improves privacy without compromising effectiveness of data collection by allowing an autonomous or remotely operated camera system, such as that on an Unmanned Aerial Vehicle (UAV), satellite, or other robot to self-censor by removing incidentally-collected non-critical data at the source, before that data can become accessible offboard the remotely operated camera system. In an example in which a region of interest is defined as a building, the system may automatically remove data not corresponding to the building before transmitting or archiving such data. In another example in which a person is incidentally observed, the system may automatically remove data corresponding to the person before transmitting or archiving such data. | 2015-09-24 |
20150269259 | IMAGE, AUDIO, AND METADATA INPUTS FOR KEYWORD RESOURCE NAVIGATION LINKS - A system, method, and computer-readable medium, is described that implements a resource navigation links tool that receives one or more inputs, extracts information from the inputs into a submission string, submits the submission string to a resource navigation links tool, and receives resource navigation links based on the submission string. Inputs types may include images, audio clips, and metadata. The inputs sources may be processed to extract information related to the image source to build the submission string. | 2015-09-24 |
20150269260 | 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-24 |
20150269261 | WEB BROWSER ACCESSIBLE SEARCH ENGINE THAT IDENTIFIES SEARCH RESULT MAXIMA THROUGH USER SEARCH FLOW AND RESULT CONTENT COMPARISON - A search server searches web sites based upon a search term. Maxima categories are provided that sort search results based upon popularity and/or context similarity. A web browser displays the search result pages. A maxima determination module within the search server responds to the delivery of the initial search term by first categorizing search results applicability to the search term on the basis of maxima or by generating maxima categories with search results that correlated to the search term. Search results within each applicable maximum are then sorting on the basis of popularity within each of the maxima categories to effectuate popularity ranks for each search result or web page. User interaction with search results are monitored to better select search maxima and popularity ranks for subsequent search result requests for this search term, whereby the desirability of search results provided to the user improves over time. | 2015-09-24 |
20150269262 | METHODS FOR RETRIEVING INFORMATION AND DEVICES THEREOF - A method for retrieving information includes determining, by the information retrieval management computing device, when an identified subject of interest in a received query maps to one of one or more ontology entities. An identification is made, by the information retrieval management computing device, when the identified subject of interest is one of one or more existing subjects of interest when the identified subject of interest is determined to map to one of the ontology entities. One or more filters associated with the identified subject of interest are stored by the information retrieval management computing device. The one or more filters include: one or more new property conditions in the received query, one or more ontology property conditions associated with the mapped one of the ontology entities, and one or more existing property conditions associated with the one of the one or more existing subjects of interest when the identified subject of interest is identified as one of the existing subjects of interest; or the one or more new property conditions and the one or more ontology property conditions when the identified subject of interest is not identified as one of the existing subjects of interest. An updated query is automatically built based on the stored one or more filters by the information retrieval management computing device. One or more results are retrieved and provided, by the information retrieval management computing device, based on the automatically built updated query. | 2015-09-24 |