| 23rd week of 2015 patent applcation highlights part 41 |
| Patent application number | Title | Published |
|---|
| 20150154192 | 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-06-04 |
| 20150154193 | SYSTEM AND METHOD FOR EXTRACTING FACTS FROM UNSTRUCTURED TEXT - A system and method for extracting facts from unstructured text files are disclosed. Embodiments of the disclosed system and method may receive a text file as input and perform extraction and disambiguation of entities, as well as extract topics and facts. The facts are extracted by comparing against a fact template store and associating facts with events or topics. The extracted facts are stored in a data store. | 2015-06-04 |
| 20150154194 | NON-EXCLUSIONARY SEARCH WITHIN IN-MEMORY DATABASES - Methods for non-exclusionary searching within clustered in-memory databases are disclosed. The non-exclusionary search methods may allow the execution of searches where the results may include records where fields specified in the query are not populated or defined. The disclosed methods include the application of fuzzy matching and scoring algorithms, which enables the system to search, score and compare records with different schemata. This may significantly improve the recall of relevant records. | 2015-06-04 |
| 20150154195 | METHOD FOR ENTITY-DRIVEN ALERTS BASED ON DISAMBIGUATED FEATURES - A method for entity-driven alerts based on disambiguated features, is disclosed. According to an embodiment, disclosed method may refer to entity-driven alerts based on trending or new knowledge of a disambiguated feature. The alerts may be sent to a user when new knowledge is discovered about the disambiguated feature, a new association (such as new features, facts, quotations, or topic IDs related, among others) with the feature of interest, and/or new trending changes are emerging about the feature of interest. According to various embodiments, method for entity-driven alerts based on disambiguated features may reduce the number of false positives resulting in a normal search query. Which in turn, may increase the efficiency of monitoring, allowing for broadened universe of alerts. | 2015-06-04 |
| 20150154196 | ALERTING SYSTEM BASED ON NEWLY DISAMBIGUATED FEATURES - The present disclosure relates to a method of alerting users regarding newly disambiguated features. More specifically, a newly disambiguated feature may pass through different filters/restrictions, such as, the known knowledge base. The disclosed known knowledge base may filter the newly disambiguated feature, comparing the newly disambiguated features to the existing features to discover a new feature of interest. Particularly, the disclosed new feature of interest may include a new person, a new phone number, a new place, a new company, among others. Finally, if there is a new feature that did not match with the existing disambiguated features in the known knowledge base, then an alert may be emitted to a user. | 2015-06-04 |
| 20150154197 | METHOD FOR OBTAINING SEARCH SUGGESTIONS FROM FUZZY SCORE MATCHING AND POPULATION FREQUENCIES - A method for obtaining and providing search suggestions using entity co-occurrence is disclosed. The method may be employed in any search system that may include at least one search engine, one or more databases including entity co-occurrence knowledge and trends co-occurrence knowledge. The method may extract and disambiguate entities from search queries by using an entity and trends co-occurrence knowledge in one or more database. Subsequently, a list of search suggestion may be provided by each database, then by comparing the score of each search suggestion, a new list of suggestion may be built based on the individual and/or overall score of each search suggestion. Based on the user's selection of the suggestions, the trends co-occurrence knowledgebase can be updated, providing a means of on-the-fly learning, which improves the search relevancy and accuracy. | 2015-06-04 |
| 20150154198 | METHOD FOR IN-LOOP HUMAN VALIDATION OF DISAMBIGUATED FEATURES - Methods for providing in-loop validation of disambiguated features are disclosed. The disclosed methods may include disambiguating features in unstructured text that may use co-occurring features derived from both the source document and a large document corpus. The disambiguating systems may include multiple modules, including a linking on-the-fly module for linking the derived features from the source document to the co-occurring features of an existing knowledge base. The system for disambiguating features may allow identifying unique entities from a knowledge base that includes entities with a unique set of co-occurring features, which in turn may allow for increased precision in knowledge discovery and search results, employing advanced analytical methods over a massive corpus, employing a combination of entities, co-occurring entities, topic IDs, and other derived features. The disclosed method may use validation to provide input to the system for disambiguating features. | 2015-06-04 |
| 20150154199 | AUTOMATIC REGISTRATION - A method, system, apparatus, article of manufacture, and computer-readable storage medium provide the ability to merge multiple point cloud scans. A first raw scan file and a second raw scan file (each including multiple points) are imported. The scan files are segmented by extracting segments. Features are extracted from the segments. A set of candidate matching feature pairs are acquired by registering/matching/pairing features from one scan to features from another scan. The candidate pairs are refined based on an evaluation of all of the matching pairs. The candidate pairs are further refined by extracting sample points from the segments (within the matched pairs) and refining the pairs based on the points. The feature pairs are scored and then merged based on the scores. | 2015-06-04 |
| 20150154200 | DESIGN AND IMPLEMENTATION OF CLUSTERED IN-MEMORY DATABASE - An in-memory database system and method for administrating a distributed in-memory database, comprising one or more nodes having modules configured to store and distribute database partitions of collections partitioned by a partitioner associated with a search conductor. Database collections are partitioned according to a schema. Partitions, collections, and records, are updated and removed when requested by a system interface, according to the schema. Supervisors determine a node status based on a heartbeat signal received from each node. Users can send queries through a system interface to search managers. Search managers apply a field processing technique, forward the search query to search conductors, and return a set of result records to the analytics agents. Analytics agents perform analytics processing on a candidate results records from a search manager. The search conductors comprising partitioners associated with a collection, search and score the records in a partition, then return a set of candidate result records after receiving a search query from a search manager. | 2015-06-04 |
| 20150154201 | DISAMBIGUATION FRAMEWORK FOR INFORMATION SEARCHING - Methods, software and devices for responding to a user query are disclosed. A user query received from a user is matched to stored responses to obtain initial matched responses. A confidence metric indicating the likelihood of the initial matched responses satisfying the user query is calculated. Upon determining the confidence metric to be below a specified threshold, the user query is supplemented with contextual data. The user query, supplemented by contextual data, is further matched to stored responses by applying disparate matching techniques to obtain further matched responses, where at least one of the disparate matching techniques differs from techniques used to obtain the initial matched responses. Degree-of-match metrics are calculated taking into account the contextual data, where each degree-of-match metric indicates a quality of match between the user query and a matched response. At least one of the matched responses is presented to the user. | 2015-06-04 |
| 20150154202 | RANKING SEARCH RESULTS BASED ON THE FREQUENCY OF ACCESS ON THE SEARCH RESULTS BY USERS OF A SOCIAL-NETWORKING SYSTEM - Particular embodiments access a search query submitted by a first user of a social-networking system; identify one or more web pages in response to the search query; for each of the one or more web pages, determine a value indicating a number of user clicks associated with the web page by one or more second users of the social-networking system who are connected to the first user within the social-networking system; and send a set of hyperlinks for the one or more web pages, wherein hyperlinks for web pages where the value is greater than zero are visually emphasized over other hyperlinks. | 2015-06-04 |
| 20150154203 | Method And System For Visually Indicating A Replay Status Of Media Items On A Media Device - A device is provided for visually indicating a replay status of media items on a media device. Aspects of the device include displaying in a graphical user interface (GUI) of the media device a representation of a first media item; displaying a profile score of the first media item that is based on user preferences; and displaying a replay score for the first media item. | 2015-06-04 |
| 20150154204 | SIGNATURE-BASED SYSTEM AND METHOD FOR GENERATION OF PERSONALIZED MULTIMEDIA CHANNELS - A system and method for generating personalized channels of multimedia content are presented. The method comprises receiving a captured multimedia content from a user; generating a signature based on the captured multimedia content; searching for additional multimedia content that match the captured multimedia content based on the generated signature and at least one compared signature, wherein each compared signature of the at least one compared signature is associated with an additional multimedia content; and generating a personalized channel to be displayed on a web-browser of a user device, wherein the personalized channel comprises the captured multimedia content and at least one multimedia content of the additional multimedia content. | 2015-06-04 |
| 20150154205 | System, Method and Computer-Accessible Medium for Clipping and Sharing Media - Systems, methods and computer-accessible media are provided for generating media clips that can receive first information related to media, second information related to a position of a window of time, and third information related to a further position of the window of time based on a movement of the window of time while maintaining the time interval. The window of time generally has a time interval with a preset maximum time. The media clip can be generated based on the second information and the third information. Information related to content can be received and combined with the media clip into a single digital file. Information about the media can be requested, and users can purchase the media from an online store. Revenue can be generated through a referral to the online store. | 2015-06-04 |
| 20150154206 | SECURE MANAGEMENT OF MESSAGE ARCHIVES - A first server device may receive a group identifier, a first list including one or more first user device identifiers, and an instruction to archive messages associated with the one or more first user device identifiers; receive a second list including one or more second user device identifiers that are associated with the group identifier; and generate a third list including one or more third user device identifiers that are in the first list and the second list. The first server device may receive a message associated with a user device identifier; determine that the message is to be archived when the user device identifier associated with the message is included in the third list; and provide the message to a second server device based on the determination that the message is to be archived. | 2015-06-04 |
| 20150154207 | Non-transitory Computer-Readable Medium and Device - A non-transitory computer-readable medium stores computer-readable instructions that, when executed by a processor of a device, perform processes including a first generation operation generating first sound data, a storage operation storing the first sound data in a storage device, an acquisition operation acquiring a first value defined based on a storage amount, a determination operation determining whether the first value is larger than a threshold value, a setting operation setting a total time to a first total time in response to the determination operation determining that the first value is larger than the threshold value and to a second total time, which is shorter than the first total time, in response to the determination operation determining that the first value is not larger than the threshold value, and a second generation operation generating the second sound data from a specified number of pieces of the first sound data. | 2015-06-04 |
| 20150154208 | Integrated Application Server and Data Server Processes with Matching Data Formats - In one embodiment, the present invention includes a computer-implemented method comprising storing data in an application using an application custom data type and application custom data structure. The data is stored in a database using the application custom data type and the application custom data structure. In one embodiment, a request is sent to access the data from the application to the database. The data is retrieved from the database in response to the request in the application custom data type and the application custom data structure. In one embodiment, the data is sent from the database to a shared memory in the application custom data type and the application custom data structure and the data is retrieved by the application from the shared memory in the application custom data type and the application custom data structure. | 2015-06-04 |
| 20150154209 | ONLINE LOGO TOOL - An online tool allows a user, such as an online merchant, to access a page of a service provider, select a format, customize funding sources and designs, and copy and paste the code to the merchant page to quickly and easily create a customized funding source graphic. | 2015-06-04 |
| 20150154210 | COMPUTER ECOSYSTEM WITH AUTOMATICALLY CURATED CONTENT - Electronic images are programmatically analyzed and metadata associated with the images automatically populated with contextually relevant tags and markers for later referencing the images for curated entertainment. Algorithms for facial recognition, spatial recognition, object recognition, brand recognition, geo-specific data and time specific events can be programmatically applied to this end. Additional cross-referencing is afforded to prior searches, and existing databases and data sets are compared to provide more relevant context and update the metadata. | 2015-06-04 |
| 20150154211 | FILE STORAGE SERVICE SYSTEM AND METHOD FOR THE SAME - In a file storage service system, a computer stores files in a hybrid cloud. The computer comprises an extension metadata table which stores file storage conditions and target availability and an arrangement planned cloud table which stores a first identifier of a first cloud included in the hybrid cloud. The computer further comprises: an arrangement number calculation unit which selects a second cloud included in the hybrid cloud and satisfying the storage conditions and stores an identifier of the selected second cloud as the first identifier of the first cloud in the arrangement planned cloud table when availability of the selected second cloud satisfies the target availability; and a file arrangement management unit which stores a file uploaded from a client terminal in the first cloud identified by the first identifier stored in the arrangement planned cloud table by referring to the extension metadata table. | 2015-06-04 |
| 20150154212 | CONTENT MANAGEMENT APPARATUS, CONTENT MANAGEMENT METHOD AND CONTENT MANAGEMENT PROGRAM - The present invention relates to a content management apparatus to which a plurality of storage devices are connectable. The content management apparatus includes: a selection section configured to select, from among a plurality of storage devices connected to the content management apparatus, a storage device as an aggregation destination to which identification information for identifying contents is aggregated; a management section configured to aggregate and store the identification information of the contents stored in the storage devices connected to the content management apparatus, into the storage device as the aggregation destination selected by the selection section; and a provision section configured to provide a content corresponding to information selected from the identification information stored in the storage device as the aggregation destination. | 2015-06-04 |
| 20150154213 | INFORMATION PROCESSING METHOD AND ELECTRONIC DEVICE - Disclosed is an information processing method and an electronic device. The method comprises: determining K folders satisfying a preset condition and changing a display property of each of the K folders; and changing, when at least one of the K folders is opened using a first application, a display policy for the at least one folder. The present disclosure provides a filtering mechanism for user data which is capable of addressing the inconvenience in data processing due to display of all the data when the electronic device has a large amount of data, and improves user experience. | 2015-06-04 |
| 20150154214 | REFERENT BASED SEARCH SUGGESTIONS - Computer-implemented methods for providing suggestions for a search based on previously viewed content are provided. In one aspect, a method includes receiving information on previously viewed content, and receiving a request to enter a query into a search field subsequent to receiving the information on the previously viewed content. The method also includes identifying, based on the content, at least one entity referred to in the content, and providing an identifier of the at least one entity for display with the search field. Systems and machine-readable storage media are also provided. | 2015-06-04 |
| 20150154215 | SELF-REMOVAL OF ENTERPRISE APP DATA - Self-removal of enterprise application data (e.g., managed application data) is disclosed. It may be determined that a data removal condition has been satisfied. Based at least in part on the determination, data removal information may be generated for a plurality of applications including a managed set of mobile applications. The data removal information may be provided to at least a first application included in the plurality of applications. The first application may provide the data removal information to a data storage location accessible to at least a second application upon a data removal-related event. | 2015-06-04 |
| 20150154216 | SYSTEM AND METHODS FOR PRIORITIZING DATA IN A CACHE - Implementations described and claimed herein provide a system and methods for prioritizing data in a cache. In one implementation, a priority level, such as critical, high, and normal, is assigned to cached data. The priority level dictates how long the data is cached and consequently, the order in which the data is evicted from the cache memory. Data assigned a priority level of critical will be resident in cache memory unless heavy memory pressure causes the system to reclaim memory and all data assigned a priority state of high or normal has been evicted. High priority data is cached longer than normal priority data, with normal priority data being evicted first. Accordingly, important data assigned a priority level of critical, such as a deduplication table, is kept resident in cache memory at the expense of other data, regardless of the frequency or recency of use of the data. | 2015-06-04 |
| 20150154217 | File Update Tracking - Embodiments are directed towards managing and tracking item identification of a plurality of items to determine if an item is a new or existing item, where an existing item has been previously processed. In some embodiments, two or more item identifiers may be generated. In one embodiment, generating the two or more item identifiers may include analyzing the item using a small item size characteristic, a compressed item, or for an identifier collision. The two or more item identifiers may be employed to determine if the item is a new or existing item. In one embodiment, the two or more item identifiers may be compared to a record about an existing item to determine if the item is a new or existing item. If the item is an existing item, then the item may be further processed to determine if the existing item has actually changed. | 2015-06-04 |
| 20150154218 | HASHING SCHEME USING COMPACT ARRAY TABLES - Embodiments include a method, system, and computer program product for creating an array table. In one embodiment the method includes identifying keys associated with values in a database and identifying bits common between the plurality of keys using logical functions and removing the common hits to form condensed keys. The method also includes modulating the condensed keys using identified common bits to create transformed keys and populating the plurality of array tables using the transformed keys and associated values. | 2015-06-04 |
| 20150154219 | COMPUTING RESOURCE PROVISIONING BASED ON DEDUPLICATION - Technologies are generally described for systems, devices and methods effective to provision computing resources based on deduplication. In an example, a resource cost may be produced. The resource cost may relate to execution of a first virtual machine at a data center. A processor may receive a first representation related to an image of the first virtual machine. The processor may receive a second representation related to one or more instances of second virtual machines being executed by the data center. The processor may compare the first and second representations to produce a deduplication value for the first virtual machine. The processor may transform the deduplication value to produce the resource cost. | 2015-06-04 |
| 20150154220 | SYNCHRONIZED DATA DUPLICATION - A system and method for data deduplication is presented. Data received from one or more computing systems is deduplicated, and the results of the deduplication process stored in a reference table. A representative subset of the reference table is shared among a plurality of systems that utilize the data deduplication repository. This representative subset of the reference table can be used by the computing systems to deduplicate data locally before it is sent to the repository for storage. Likewise, it can be used to allow deduplicated data to be returned from the repository to the computing systems. In some cases, the representative subset can be a proper subset wherein a portion of the referenced table is identified shared among the computing systems to reduce bandwidth requirements for reference-table synchronization. | 2015-06-04 |
| 20150154221 | DEDUPLICATION METHOD AND DEDUPLICATION SYSTEM USING DATA ASSOCIATION INFORMATION - A deduplication method using data association information includes extracting information about a target file and at least one reference file associated with the target file as association information before duplication determination is performed. The at least one reference file is identified by the association information as a comparison target set for comparison when the duplication determination of the target file is performed. The duplication determination is performed with the target file with respect to the at least one reference file in the selected comparison target set. | 2015-06-04 |
| 20150154222 | Efficiency of File Synchronization in a Linear Tape File System - A mechanism is provided for improved file synchronization of a magnetic tape. A destination device determines whether one or more file checksums exist in an extended file attribute associated with an identified file. Responsive to one or more file checksums existing in the extended file attribute associated with the identified file, the destination device reads the one or more file checksums out of the extended file attribute without accessing the magnetic tape. The destination device transmits the one or more file checksums to a source device. The source device segments the data of the new file into fixed-length blocks that do not overlap one another. The source device calculates one or more new file checksums for each of the fixed-length blocks. The source device transmits the one or more new file checksums to the destination device. | 2015-06-04 |
| 20150154223 | INFORMATION SYNCHRONIZATION METHOD, DEVICE AND COMMUNICATION TERMINAL BASED ON PERSONAL INFORMATION MANAGEMENT SYSTEM - The present document provides an information synchronization method, apparatus and communication terminal based on a personal information management system. A user data server at a network side stores status information of a first user and copies the status information of the first user to a name card of the first user stored by a second user in a PIM server; and the PIM server synchronizes the status information of the first user in the name card of the first user to a communication terminal of the second user. The scheme described above enables different specific users to acquire or query specific information of the other party by a communication terminal such as mobile phone. | 2015-06-04 |
| 20150154224 | METHOD, DEVICE, PROCESSING CENTER AND SYSTEM FOR DESKTOP SYNCHRONIZATION - The present invention provides a method, device, processing centre and system for desktop synchronization and relates to the technical field of network. The method comprises the steps of: obtaining desktop data from a processing center; determining whether an application program corresponding to the desktop data has been installed; associating the desktop data with the corresponding application program if it is determined that the corresponding application program has been installed. The present invention resolves the problem that the present cloud storage scheme could only simply store and synchronize files or folders, and achieves the effects that the desktop can be synchronized across each platforms, and the files in the desktop data can be used, edited and modified after the synchronization across platforms, by associating the locally application program with the desktop data while synchronizing the desktop data. | 2015-06-04 |
| 20150154225 | CONTINUOUS FULL SCAN DATA STORE TABLE AND DISTRIBUTED DATA STORE FEATURING PREDICTABLE ANSWER TIME FOR UNPREDICTABLE WORKLOAD - A distributed data store includes a storage layer comprised of a plurality of storage nodes, each storage node configured to receive and queue table operations, and an aggregation layer comprised of aggregator nodes configured to route table operations to storage nodes in the storage layer and merge results of table operations returned by storage nodes in the storage layer. Each storage node includes in part scan threads dedicated to continuous and full scanning of segments of a table that are respectively associated with processor cores upon which such scan threads are running. | 2015-06-04 |
| 20150154226 | FILE LINK MIGRATION - File link migration is described. A method may include identifying a first file link referencing a file residing at a first computer system, and identifying, at the first computer system, a first inode data structure referenced by the first file link, the first inode data structure comprising a first link count. The method may also include creating a second inode data structure at a second computer system, wherein the second data structure comprises a second link count, and creating a second file link to reference the second inode data structure at the second computer system. The method may also include, responsive to determining that the first link count matches the second link count, migrating file data referenced by the first data structure to the second computer system. | 2015-06-04 |
| 20150154227 | METHOD FOR PROCESSING INPUT/OUTPUT REQUEST, HOST, SERVER, AND VIRTUAL MACHINE - A method for processing an I/O request and a computer system are provided. The method includes: receiving an I/O write request from a virtual machine; writing first data to be written as requested by the I/O write request into a local persistent storage area; determining a file type of a file to which the first data belongs; and writing the first data into a remote shared storage area if the file type of the file to which the first data belongs is a user file or a system file. Thus access traffic on the remote shared storage area can be reduced. | 2015-06-04 |
| 20150154228 | HIERARCHICAL SPATIAL CLUSTERING OF PHOTOGRAPHS - A computer-implemented method of organizes photographs for display on an on-line map by selecting from a plurality of photographs a candidate set of photographs based on scores of the photographs, determining clusters from the selected photographs for display on the on-line map. | 2015-06-04 |
| 20150154229 | SCALABLE ATTRIBUTE-DRIVEN IMAGE RETRIEVAL AND RE-RANKING - Retrieval of images of objects from a large-scale database of object images, based on a query image. The database may, for example, contain images of objects such as faces, vehicles, people and luggage. Semantic attributes such as doors or windows in the case of vehicles are used as high level semantic cues to determine identities of objects in the images. Salient visual characteristics of the images are labeled with attribute information, and a transformation is learned so as to transform the labeled visual characteristics into a discrimination vector that discriminates between the labels. A similarity metric is learned using the discrimination vectors, such that different images depicting the same object are determined to be close while those having different objects are determined to be far apart. Candidates are retrieved based on a query image, and a re-ranking step may be applied to improve results. Validation experiments are described. | 2015-06-04 |
| 20150154230 | Photographic Picture Quality Improvement Recommendation System Using Objects - A computer program product comprising computer executable instructions stored on a non-transitory computer readable medium such that when executed by a processor, causes the processor to identify an object of interest in a visual media element, analyze the object of interest according to a defined set of rules to form a recommendation for improvement of the visual media element, and recommend the improvement to the visual media element to a user. A method comprising receiving a visual media element as an input, determining a relevant object of interest within the visual media element, analyzing an aesthetic appearance of the relevant object of interest according to a guideline, and recommending a change to the visual media element for conforming to the guideline. | 2015-06-04 |
| 20150154231 | METADATA MANAGEMENT AND GENERATION USING PERCEPTUAL FEATURES - The present invention provides methods and systems to improve network searching for watermarked content. In some implementations we employ keyword searching to narrow the universe of possible URL candidates. A resulting URL list is searched for digital watermarking A system is provided to allow customer input. For example, a customer enters keywords or network locations. The keywords or network locations are provided to a watermark-enabled web browser which accesses locations associated with the keywords or network locations. Some implementations of the present invention employ a plurality of distributed watermark-enabled web browsers. Other aspects of the invention provide methods and system to facilitate desktop searching and automated metadata gathering and generating. In one implementation a digital watermark is used to determine whether metadata associated with an image or audio file is current or fresh. The metadata is updated when it is out of date. Watermarks can also be used to link to or facilitate so-called on-line “blogs” (or online conversations). | 2015-06-04 |
| 20150154232 | SYSTEM AND METHOD FOR ASSOCIATING IMAGES WITH SEMANTIC ENTITIES - A system and computer-implemented method for associating images with semantic entities and providing search results using the semantic entities. An image database contains one or more source images associated with one or more images labels. A computer may generate one or more documents containing the labels associated with each image. Analysis may be performed on the one or more documents to associate the source images with semantic entities. The semantic entities may be used to provide search results. In response to receiving a target image as a search query, the target image may be compared with the source images to identify similar images. The semantic entities associated with the similar images may be used to determine a semantic entity for the target image. The semantic entity for the target image may be used to provide search results in response to the search initiated by the target image. | 2015-06-04 |
| 20150154233 | DEPENDENCY MANAGER FOR DATABASES - The present disclosure relates to in-memory databases or search engines using a dependency manager or configuration manager for maintaining configuration in the database system. The system may include a supervisor that may request and receive data from dependency manager, where the supervisor may be linked to other components in the system. The dependency manager may be used as a container for data metadata, and software components, which may be used in the system configuration. The configuration may be developed through a dependency system, where the dependency manager may keep an entire dependency tree for all software and data in the system. Similarly, dependency manager may create a deployable package to guarantee deployment integrity and to ensure a successful execution of any suitable software and data in the system. | 2015-06-04 |
| 20150154234 | USING VERSIONING TO BACK UP MULTIPLE VERSIONS OF A STORED OBJECT - Using a versioning feature of an authoring application to back up multiple versions of a stored object in single, version-enabled instance stored on backup media is disclosed. In some embodiments, an indication is received that a subsequent version data associated with an object an existing instance of which is stored in a backup storage location is to be backed up. A version control mechanism of an authoring application that created or updated the object as stored in a primary storage location is invoked to incorporate the subsequent version data into the existing instance of the object as stored in the backup storage location. | 2015-06-04 |
| 20150154235 | SMART CONTAINERS - Smart containers are disclosed. A system for managing content comprises an interface to receive an operation associated with an instance of a smart container. The smart container comprises a logical structure configure using a definition to manage associated content. The system for managing content comprises a processor configured to determine whether the operation is allowable based at least in part on a policy; and in the event that the operation is allowable, perform the operation. A memory is coupled to the processor and is configured to provide the processor with instructions. | 2015-06-04 |
| 20150154236 | INDEXING CONTENT AND SOURCE CODE OF A SOFTWARE APPLICATION - In a method for generating a searchable index from an analysis of a software application, receiving a first software application. The one or more processors determine that a first source code of the first software application is inaccessible. The one or more processors stimulate the first software application. The one or more processors analyze textual data resulting from the stimulation of the first software application. The one or more processors classify one or more images resulting from the stimulation of the first software application. The one or more processors index the analyzed textual data and the classified one or more images resulting from the stimulation of the first software application. | 2015-06-04 |
| 20150154237 | REAL TIME CONTENT SEARCHING IN SOCIAL NETWORK - Indexing and retrieving real time content in a social networking system is disclosed. A user-term index includes user-term partitions, each user-term partition comprising temporal databases. As a post is received from a user, a user identifier, a post identifier, and a post is extracted. An object store communicatively coupled to a temporal database for recently received content is queried to determine whether terms in the post has already been stored. A term identifier is stored in the user-term index with the user and post identifiers. A forward index stores the post by post identifier. Responsive to a search query, the user-term index is searched by the user's connections and the terms. A real time search engine compiles the results of the user-term index query and retrieves the stored posts from the forward index. The search results may then be ranked and cached before presentation to the searching user. | 2015-06-04 |
| 20150154238 | Systems and Methods for Generating a Cross-Product Matrix In a Single Pass Through Data Using Single Pass Levelization - Systems and methods are provided for a data processing system having multiple executable threads that is configured to generate a cross-product matrix in a single pass through data to be analyzed. An example system comprises memory for receiving the data to be analyzed, a processor having a plurality of executable threads for executing code to analyze data, and software code for generating a cross-product matrix in a single pass through data to be analyzed. The software code includes threaded variable levelization code for generating a plurality of thread specific binary trees for a plurality of classification variables, variable tree merge code for combining a plurality of the thread-specific trees into a plurality of overall trees for the plurality of classification variables, effect levelization code for generating a plurality of sub-matrices of the cross-product matrix using the plurality of the overall trees for the plurality of classification variables, and cross-product matrix generation code for generating the cross-product matrix by storing and ordering the elements of the sub-matrices in contiguous memory space. | 2015-06-04 |
| 20150154239 | METHOD AND APPARATUS FOR MULTIDIMENSIONAL DATA STORAGE AND FILE SYSTEM WITH A DYNAMIC ORDERED TREE STRUCTURE - An approach is provided to determine one or more dynamic ordered tree structures and transition tree structures (e.g., based on one or more transitions of a device) to facilitate querying and/or accessing data stores. An apparatus and method determines to generate at least one index structure, determines to associate index objects of the generated index structure with one or more data objects of at least one data store, determines to generate at least one transition index structure based on the at least one generated index structure, and determines to associate the transition index structure with index objects corresponding to one or more data objects of at least one data store based on a transition of a device. Also, the method and apparatus determines to generate at least one query, and determines to generate at least one transition index structure where a current index structure to resolve the query is absent. | 2015-06-04 |
| 20150154240 | DYNAMIC INHERITANCE OF METADATA CONCEPTS FROM PROJECT RESOURCES INTO A SEMANTIC MODEL - The present disclosure describes methods, systems, and computer program products for inheriting metadata concepts from product resources into a semantic model. One computer-implemented method includes defining a plurality of core data foundations, defining a derived data foundation by linking the plurality core data foundations to the derived data foundation, defining a plurality of core business layers, defining a derived business layer by linking the plurality of core business layers to the derived business layer, and compiling, by a computer, the derived business layer with the derived business layer as a universe. | 2015-06-04 |
| 20150154241 | ELECTRONIC DEVICE AND METHOD FOR QUERYING CONTACT PERSONS - An electronic device includes a touch input device to receive touch inputs and a storage device to store a plurality of information of contact persons. The electronic device can respond to a user input to create an index list recording relationships between the information of the contact persons and graphic information. When the user inputs graphic information via the touch input device, the electronic device queries the information of the contact person corresponding to the graphic information input by the user according to the created index list. | 2015-06-04 |
| 20150154242 | Automatic Detection Of Expiration Time Of Event-Based Articles - Methods and systems for detecting expiration time of an article include receiving the article for a pre-planned event. The article is analyzed to identify one or more attributes. The article is matched to an event identifier using the article attributes. The event identifier is pre-defined and stored in an event database. The event identifier acts as an index to the event database for obtaining event characteristics of the pre-planned event. The article attributes are examined to identify event phase indicators that correlate to a specific event phase of the pre-planned event. The expiration time of the article is computed based on the specific event phase identified for the pre-planned event. The expiration time is used to rank the article and for considering assigning the article to a content pool of articles that is selected for publishing for the specific event phase of the pre-planned event. | 2015-06-04 |
| 20150154243 | INCREMENTAL SCHEMA CONSISTENCY VALIDATION ON GEOGRAPHIC FEATURES - Aspects of the invention relate generally to updating interconnected feature data stored in a repository while maintaining highly consistent views of the data. More specifically, aspects relate to updating some features in bulk while providing for incremental updates for others which are not completely independent of the bulk edits. Features which may be updated incrementally may contain references to other features and may be validated on an as-needed basis. These “incremental” features may also be associated with “backreferences,” which link two features together and are used in the validation process. For example, where feature A contains a link to feature B and feature B does not also include a link to feature A, if any edits are performed on feature B, a backreference may direct the server to determine whether the references in A are still consistent with the edits to B before the edit goes into a live state. | 2015-06-04 |
| 20150154244 | INTEGRITY CHECKING AND SELECTIVE DEDUPLICATION BASED ON NETWORK PARAMETERS - An approach for managing a data package is provided. Network throughput is determined to exceed a threshold. A sender computer determines a hash digest of the data package by using a hash function selected based on central processing unit utilization. If the hash digest is in a sender hash table, then without sending the data package, the sender computer sends the hash digest and an index referring to the hash digest so that a recipient computer can use the index to locate a matching hash digest and the data package in a recipient hash table. If the hash digest is not in the sender hash table, then the sender computer adds the data package and the hash digest to the sender hash table and sends the data package and the hash digest to the second computer to check the integrity of the data package based on the hash digest. | 2015-06-04 |
| 20150154245 | SYSTEM AND METHOD OF QUALITY ASSESSMENT OF A SEARCH INDEX - Systems, methods, and computer program products for enabling assessment of the quality of a search index. In one embodiment, objects are processed to produce corresponding text that is stored and indexed. The objects are also processed to identify and store corresponding metadata values for indexing. Error conditions that are detected during the processing of objects to generate corresponding text are tracked and compared to determine the most severe of the error conditions. An indication of the most severe error condition is stored in a first consolidated error field. Errors that are encountered in the identification and storage of metadata values are counted and this count is stored in a second consolidated error field. Both of the consolidated error fields are indexed in the same manner as the text and metadata for the objects, so that the stored error information can be used in queries of the search index. | 2015-06-04 |
| 20150154246 | Recommendation Engine using Inferred Deep Similarities for Works of Literature - A recommendation engine for works of literature uses patterns of flow and element similarities for scoring a first user-rated work of literature against one or more recommendation candidate works of literature. Cluster models are created using meta-data modeling the works of literature, the meta-data having literary element categories and instances within each category. Each instance is described by an index value (position in the literature) and significance value (e.g. weight or significance). Cluster finding process(es) invoked for each instance in each category find Similarity Concept clusters and Consistency Trend clusters, which are recorded into the cluster models representing each work of literature. The cluster model can be printed or displayed so that a user can visually understand the ebb and flow of each literary element in the literature, and may be digitally compared to other cluster models of other works of literature for potential recommendation to a user. | 2015-06-04 |
| 20150154247 | SYSTEM AND METHOD FOR SURFACE DATA MANAGEMENT AT WORKSITE - A system for surface data management for a machine is provided. A first controller maintains an updated surface data and an updating time. A second controller maintains a surface data and a recording time. The second controller transmits a time request for the updating time associated with a destination location. The second controller receives the updating time associated with the destination location. The second controller is compares the updating time with the recording time, each associated with the destination location. If the updating time is more recent than the recording time, the second controller transmits a data request for the updated surface data associated with the destination location and receives the updated surface data. The second controller compares the updated surface data with the surface data, each associated with the destination location and determines a change in the surface data associated with the destination location based on the comparison. | 2015-06-04 |
| 20150154248 | REPRESENTING MULTIDIMENSIONALITY OF A DATA TABLE - A method and associated systems for representing multidimensionality of a data table by combining a first set of data elements, units, or cells of the table into a multidimensional, expandable, second data unit. One or more processors of a computer system: determine a set of a first data units to be combined; determine a type of multidimensionality of the second data unit after combination; and combine, as a function of the type of multidimensionality, the first set of the first data units into the second data unit. The type of multidimensionality may be horizontal, vertical, or higher-dimensional (that is, greater than two-dimensional) dimensionality. | 2015-06-04 |
| 20150154249 | DATA INGESTION MODULE FOR EVENT DETECTION AND INCREASED SITUATIONAL AWARENESS - A system and method for detecting and summarizing events based on data feeds from a plurality of sources. Such sources may include social media networks, text messages, news feeds among others. The system may receive raw information from such sources containing data related with possible events. Method for event detection may include pre-processing and normalizing data input from any source registered, this may also include; extracting and disambiguating events and entities, associate event and entities, correlate events and entities associated from a data input which results from a different data source, for validating/verifying an event. Subsequently, the validated/verified event may be stored in a local data storage and/or in a web-server. | 2015-06-04 |
| 20150154250 | PATTERN IDENTIFICATION, PATTERN MATCHING, AND CLUSTERING FOR EVENTS DERIVED FROM MACHINE DATA - Methods and apparatus consistent with the invention provide the ability to organize and build understandings of machine data generated by a variety of information-processing environments. Machine data is a product of information-processing systems (e.g., activity logs, configuration files, messages, database records) and represents the evidence of particular events that have taken place and been recorded in raw data format. In one embodiment, machine data is turned into a machine data web by organizing machine data into events and then linking events together. | 2015-06-04 |
| 20150154251 | SYSTEMS AND METHODS TO ADAPT SEARCH RESULTS - Methods and systems to adapt search results are described. The system receives search information that includes a constraint over a network. The system generates a first search result based on the search information. The system communicates a first user interface, over the network, to the client device. The first user interface is formatted based on first formatting level information. The system receives a first request, over the network, from the client device. The first request includes a description of a first interaction with the first search result. The system identifies a first formatting level based on at least one interaction that was received previous to receiving the first request. The system transitions to a second formatting level based on the first formatting level and the first interaction. The second formatting level is associated with second formatting level information. | 2015-06-04 |
| 20150154252 | ENHANCED SERVICE ENVIRONMENTS WITH USER-SPECIFIC WORKING SETS - Systems, methods, and software are disclosed herein for implementing enhanced search environments. In one implementation, an enhanced service environment includes a working set service that receives event signals initiated by working set agents in various application services. The working set agents communicate the event signals to nominate events occurring in the application services for inclusion in a working set of information specific to a user. The nominations may be based at least in part on a working set model specific to the user. In response to receiving the event signals, the working set service determines which of the events qualify for inclusion in the working set of information based at least in part on the working set model. For each event that qualifies for inclusion, the working set is modified to include at least the event. | 2015-06-04 |
| 20150154253 | Method and System for Performing Search Queries Using and Building a Block-Level Index - A method and a computer-readable medium for method for searching a plurality of documents. Each document is structured into a set of blocks and each block is associated with a block ID. The method includes receiving a search query including a search term having at least one search term attribute; identifying at least one block ID based on a correlation between the at least one search term attribute and the set of blocks; and identifying at least one document based on a correlation between the set of blocks and the documents. Methods for generating a data structure for searching documents are also described. | 2015-06-04 |
| 20150154254 | INTELLIGENTLY UTILIZING NON-MATCHING WEIGHTED INDEXES - System, method, and computer program product to intelligently utilize non-matching weighted objects, by determining that a sort sequence of a query does not match a sort sequence of a shared weight object of a database, modifying the query based on the sort sequence of the query, and executing the modified query to obtain a result set, wherein the result set does not include a set of rows that would have been returned using the shared weight object to process the unmodified query. | 2015-06-04 |
| 20150154255 | Estimating Statistics for Generating Execution Plans for Database Queries - A database system identifies missing statistics that is not available for processing database queries and determines the missing statistics. The database system generates execution plans for database queries. The database system requests certain statistical information for generating a database query. If the database system determines that the requested statistical information is not available, the database system stores information describing the requested statistical information as missing statistics. The missing statistics may identify one or more columns associated with tables processed by the database query. The database system performs statistical analysis of database tables to generate the missing statistics so that the statistical information is available for generating execution plans for subsequent queries. The database system may rank the missing statistics based on the number of times the missing statistics was identified by the database system while processing database queries. | 2015-06-04 |
| 20150154256 | Physical Planning of Database Queries Using Partial Solutions - A database system determines execution plans for database queries by evaluating a number of partial solutions for each database query. The database system determines a partial solutions limit on the number of partial solutions to be evaluated for determining the execution plan of the query. The database system determines a plurality of partial solutions, each partial solution corresponding to a portion of the execution plan for processing the database query. The database system evaluates a number of candidate partial solutions for determining a partial solution. The number of candidate partial solutions evaluated is determined based on the partial solutions limit. The database system combines the plurality of partial solutions to obtain an execution plan for the database query. The database system executes the database query by executing the execution plan. | 2015-06-04 |
| 20150154257 | System and method for adaptive query plan selection in distributed relational database management system based on software-defined network - Systems and methods are disclosed for selecting a query plan in a database by monitoring network state information and flow information; and selecting an adaptive plan for execution with a query manager that receives the network state information and flow information, including: receiving a query, parsing the query, generating and optimizing a global query plan; dividing the global query plan into local plans; sending the local plans to corresponding data store sites for execution with separate threads; and orchestrating data flows among the data store sites and forwarding a final result to a user. | 2015-06-04 |
| 20150154258 | System and method for adaptive query plan selection in distributed relational database management system based on software-defined network - Systems and methods are disclosed for operating a software-defined network (SDN) by slicing the SDN into differentiated queues according to different priorities to prioritizes the queries based on the user's request; reserving necessary bandwidth for specific queries to ensure specific performance levels based on the user's request; providing information to a query plan executor; and managing performance of analytical queries in distributed relational databases. | 2015-06-04 |
| 20150154259 | SQL QUERY ON A NOSQL DATABASE - A computing system can include a processor to execute stored instructions and a memory that stores instructions. The memory can include computer-implemented code to receive a structured query language (SQL) query requesting data from a non-structured query language (NoSQL) database. The memory can also include computer-implemented code to identify a query qualification and a related table in a NoSQL database. The memory can further include computer-implemented code to determine a row iterator class and computer-implemented code to access the identified related table. Additionally, the memory can include computer-implemented code to return the requested data. | 2015-06-04 |
| 20150154260 | BIOMETRIC MATCHING ENGINE - The present disclosure concerns a method of identifying a biometric record of an individual in a database ( | 2015-06-04 |
| 20150154261 | FLEXIBLY PERFORMING ALLOCATIONS IN DATABASES - Allocation within a database environment is performed by processing a sequence of steps, each of which is described by an allocation processing block. The allocation processing block receives three inputs (input tables or input view) and computes a result. Related apparatus, systems, techniques and articles are also described. | 2015-06-04 |
| 20150154262 | Platform for Continuous Graph Update and Computation - A continuous stream data (e.g., messages, tweets) is received by ingest nodes of a platform. The ingest nodes may analyze the data to create a transaction of graph updates, assign a sequence number to the transaction, and distribute the graph updates with the sequence number to graph nodes of the platform. The graph nodes may store graph updates from ingest nodes, and then the ingest nodes may report graph update progresses in a progress table. A snapshot may be taken based on the progress table, and then graph-mining computation may be implemented. Tolerate failures and decaying may be supported and incremental expansion may be allowed to cope with increasing update rates and computation needs. | 2015-06-04 |
| 20150154263 | EVENT DETECTION THROUGH TEXT ANALYSIS USING TRAINED EVENT TEMPLATE MODELS - A system and method for detecting events based on input data from a plurality of sources. The system may receive input from a plurality of sources containing information about possible events. A method for event detection involves pre-processing and normalizing a data input from a plurality of sources, extracting and disambiguating events and entities, associate event and entities, correlate events and entities associated from a data input to results from a different data sources to determine if an event has occurred, and store the detected events in a data storage. | 2015-06-04 |
| 20150154264 | METHOD FOR FACET SEARCHING AND SEARCH SUGGESTIONS - Methods for faceted searching within clustered in-memory databases are disclosed. Faceted searching may be used to generate search suggestions. The faceted search engine may be able to use non-literal key algorithms for a partial prefix fuzzy matching and may include a feature disambiguation module. The disclosed search engine may be capable of processing large amounts of unstructured data in real time to generate search suggestions. | 2015-06-04 |
| 20150154265 | SEARCH SUGGESTIONS USING FUZZY-SCORE MATCHING AND ENTITY CO-OCCURRENCE - A method for generating search suggestions by using fuzzy-score matching and entity co-occurrence in a knowledge base is disclosed. Embodiments of the method may be employed in any search system that may include an entity extraction computer module that may perform partial entity extractions from provided search queries, a fuzzy-score matching computer module that may generate algorithms based on the type of entity extracted and perform a search against an entity co-occurrence knowledge base. The entity co-occurrence knowledge base, which may include a repository where entities may be indexed as entities to entities, entities to topics, or entities to facts among others, may return fast and accurate suggestions to the user to complete the search query. The suggestions may include alternates to the partial query provided by the user that may enhance and save time when performing searches. | 2015-06-04 |
| 20150154266 | Providing Leaf Page Sublinks In Response To A Search Query - Methods and apparatus for providing leaf pages as sublinks for a webpage in response to a search query. A search query may be received from a user and search results obtained based on the search query. A plurality of leaf pages associated with a webpage of the search results may be identified. The webpage may be provided as a main search result to the search query and sublinks to the leaf pages may be provided as sublinks of the main search result. At least one category of the leaf pages may be identified and the sublinks to the leaf pages may be sorted according to a sorting scheme of the category. | 2015-06-04 |
| 20150154267 | METHOD OF DISPLAYING SEARCH RESULTS - A system and method are provided that display search results and user location on a map. A floor selector interface may be displayed with the map. The floor selector interface may include one or more floor selectors, each of which correspond to a floor in a multi-story building. Upon selection of a floor selector, first search result and location indicators may be displayed transparently or semi-transparently to indicate whether the user or the search results are on the selected floor. If the user or the search results are on a non-selected floor, such indicators may be displayed differently, such as with a different transparency. The floor selector interface may also include second search result and location identifiers. Such second identifiers may be displayed at particular floor selectors corresponding to the present elevation of the user and search results, respectively. | 2015-06-04 |
| 20150154268 | METHOD OF DISCOVERING AND EXPLORING FEATURE KNOWLEDGE - Methods and systems for discovering and exploring feature knowledge included in large corpora are disclosed. The described systems and methods may include the application of in-memory analytics to records, where the analytic methods applied to the records and the level of precision of the methods may be dynamically selected by a user. | 2015-06-04 |
| 20150154269 | ADVANCED FIELD EXTRACTOR WITH MODIFICATION OF AN EXTRACTED FIELD - The technology disclosed relates to formulating and refining field extraction rules that are used at query time on raw data with a late-binding schema. The field extraction rules identify portions of the raw data, as well as their data types and hierarchical relationships. These extraction rules are executed against very large data sets not organized into relational structures that have not been processed by standard extraction or transformation methods. By using sample events, a focus on primary and secondary example events help formulate either a single extraction rule spanning multiple data formats, or multiple rules directed to distinct formats. Selection tools mark up the example events to indicate positive examples for the extraction rules, and to identify negative examples to avoid mistaken value selection. The extraction rules can be saved for query-time use, and can be incorporated into a data model for sets and subsets of event data. | 2015-06-04 |
| 20150154270 | EXTREME VISUALIZATION ENABLING EXTENSION FOR LARGE DATA SETS - The present disclosure describes methods, systems, and computer program products for enabling extreme visualization for large data sets stored in a database. One computer-implemented method includes receiving a request for an input schema to feed to a data specification language (DaSL) and a metadata outline of typed objects exposed by a database view identified in the request, requesting extraction of the input schema and metadata outline from the database, creating an instance of a DaSL compiler based upon the input schema, generating, by a computer, a DaSL query corresponding to objects selected from the metadata outline, requesting compilation of the DaSL query, and receiving a calculation plan and topology cursors responsive to the compilation of the DaSL query. | 2015-06-04 |
| 20150154271 | TIME-DELAYED REPLICATION FOR DATA ARCHIVES - In one embodiment, an apparatus includes a processor and logic integrated with and/or executable by the processor configured to cause the processor to receive data to store to a first cluster, store one or more copies of the data to the first cluster, and set a time-delayed copy consistency point time-delayed cops consistency point indicating an amount of time in which data stored to the first cluster is aged prior to being copied from the first cluster to a second cluster. In another embodiment, a method for time-delayed replication includes receiving data to store to a first cluster, storing one or more copies of the data to the first cluster, and setting a time-delayed copy consistency point, the time-delayed copy consistency point indicating an amount of time in which data stored to the first cluster is aged prior to being copied from the first cluster to a second cluster. | 2015-06-04 |
| 20150154272 | MANAGING DATA OPERATIONS IN AN INTEGRATED DATABASE SYSTEM - A mechanism for managing data operations in an integrated database system. The method includes receiving a request to perform a data operation and retrieving a data set from a primary data source (PDS) in view of the request. The method also includes storing the data set in a temporary data store (TDS). The method further includes performing the data operation on the stored data set in the TDS. | 2015-06-04 |
| 20150154273 | PLAYLIST GENERATION METHOD AND APPARATUS - A method and system for playlist generation is disclosed. In one aspect, the system may include at least one analysis module for receiving and analyzing an unknown work and generating a corresponding representation thereof, and at least one identification (ID) server for receiving the representation from the analysis modules and determining the identity of the unknown work. | 2015-06-04 |
| 20150154274 | COPY OF REPLICATION STATUS FOR SYNCHRONIZATION - For synchronizing replication status, a copy module continuously replicates data from a first device designated with a device status of primary to a second device designated with a device status of secondary. A first peer-to-peer remote copy (PPRC) relationship is established between the first and second devices. The first and second devices store replication information comprising a bitmap with a replication status for each data block of the first device. The copy module further copies an instant point-in-time copy of the data from the second device to a copy device. In addition, the copy module copies the replication information from the second device to the copy device and links the replication information of the second device and copy devices. | 2015-06-04 |
| 20150154275 | Data Warehouse Queries Using SPARQL - Disclosed is a system allowing to query data warehouses using SPARQL. An aspect of the system may support the representation of multidimensional data as virtual graphs. Another aspect of the system may provide mapping of SPARQL queries directed against multidimensional data vis-à-vis the graphs to native queries directed against the multidimensional data. Responses from the native queries may then be translated to a SPARQL response format. | 2015-06-04 |
| 20150154276 | DYNAMIC EDITING OF DATA REPRESENTATIONS USING CASCADING WEIGHTS - A method and system for representing data includes providing a data representation according to defined variables and a functional relationship between the defined variables and receiving an assigned weight assigned to a defined variable. The method includes receiving a modification of a selected defined variable, and providing a further data representation according to a recalculation of an unselected defined variable, based upon the functional relationship, the assigned weight and the modified variable. Assigned weights and a plurality of modifications of the weighted variable are received. A further data representation is provided according to a further recalculation of the weighted variable based upon a weight selected from the assigned weights according to a previous modification of the weighted variable. The recalculating is performed according to a number of modifications performed since the previous modification of the weighted variable and according to a period of time since the previous modification of the weighted variable. | 2015-06-04 |
| 20150154277 | Methods and Systems for Machine Learning to Discover Application Compatibility Status - A system and method is provided for discovering application compatibility status, the method being performed by one or more processors, the method comprising receiving a request for determining compatibility of a first application with a platform and organizing a plurality of data points associated with the first application into a plurality of elements. The method also comprises comparing the plurality of elements with a plurality of elements associated with one or more analyzed applications, wherein the one or more analyzed applications have been previously analyzed for compatibility with the platform. The method further comprises identifying a compatibility status of the first application with the platform based on the comparison; and providing, for display, the compatibility status of the first application. | 2015-06-04 |
| 20150154278 | Recommendation Engine using Inferred Deep Similarities for Works of Literature - A recommendation engine for works of literature uses patterns of flow and element similarities for scoring a first user-rated work of literature against one or more recommendation candidate works of literature. Cluster models are created using meta-data modeling the works of literature, the meta-data having literary element categories and instances within each category. Each instance is described by an index value (position in the literature) and significance value (e.g. weight or significance). Cluster finding process(es) invoked for each instance in each category find Similarity Concept clusters and Consistency Trend clusters, which are recorded into the cluster models representing each work of literature. The cluster model can be printed or displayed so that a user can visually understand the ebb and flow of each literary element in the literature, and may be digitally compared to other cluster models of other works of literature for potential recommendation to a user. | 2015-06-04 |
| 20150154279 | APPARATUS AND METHOD FOR BUILDING RELATION MODEL BASED ON RESOURCE MANAGEMENT ARCHITECTURE - An apparatus and method for building a relation model based on a resource management architecture. The apparatus includes: an object information generator configured to acquire information on resources existing in a network and to separate the acquired information into objects according to predetermined types of resources to generate objects and information on the objects; a data manager configured to acquire necessary data existing in the network to process and store the data; and a relation model manager configured to receive the information on the objects and the necessary data, to analyze the received information on the objects and the necessary data to generate information associated with relations between the resources, and to build a relation model based on the generated information associated with the relations. | 2015-06-04 |
| 20150154280 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR MANAGING AND ORGANIZING PIECES OF CONTENT - A system for managing and organizing content includes a source capable of operating at least one application (i.e., content manager, taxonomy manager, etc.). The application(s) are capable of providing a plurality of pieces of content and a plurality of master taxonomies, each master taxonomy including at least one piece of content placed at one or more locations. After providing the pieces of content and the master taxonomies, the application(s) can identify a subset of the pieces of content and at least one master taxonomy, where the subset includes at least one piece of content. The application(s) can then generate at least one client taxonomy based upon the identified subset and the master taxonom(ies) such that the subset of the pieces of content can thereafter be organized in the client taxonom(ies). The system can also include a client capable of organizing the subset in the client taxonom(ies). | 2015-06-04 |
| 20150154281 | SYSTEMS AND METHODS FOR VISUALIZATION OF DATA ANALYSIS - Exemplary systems and methods for visualization of data analysis are provided. In various embodiments, a method comprises accessing a database, analyzing the database to identify clusters of data, generating an interactive visualization comprising a plurality of nodes and a plurality of edges wherein a first node of the plurality of nodes represents a cluster and an edge of the plurality of edges represents an intersection of nodes of the plurality of nodes, selecting and dragging the first node in response to a user action, and reorienting the interactive visualization in response to the user action of selecting and dragging the first node. | 2015-06-04 |
| 20150154282 | DATA SEARCH APPARATUS AND METHOD FOR CONTROLLING THE SAME - A storage section stores positional information and a physical amount for each of a plurality of physical amount set points arranged in a three-dimensional model. A division section generates division data corresponding to each of a plurality of second regions obtained by dividing a first region including the three-dimensional model so as to make the number of physical amount set points included in each second region equal. When a position in the three-dimensional model is designated, a search section acquires from the storage section a physical amount for a physical amount set point corresponding to the designated position of physical amount set points which division data corresponding to a second region, of the plurality of second regions, including the designated position includes. | 2015-06-04 |
| 20150154283 | PLUGGABLE ARCHITECTURE FOR EMBEDDING ANALYTICS IN CLUSTERED IN-MEMORY DATABASES - Disclosed are pluggable, distributed computing-system architectures allowing for embedding analytics to be added or removed from nodes of a system hosting an in-memory database. The disclosed system includes an API that may be used to create customized, application specific analytics modules. The newly created analytics modules may be easily plugged into the in-memory database. Each user query submitted to the in-memory database may specify different analytics be applied with differing parameters. All analytics modules operate on the in-memory image of the data, inside the in-memory database platform. All the analytics modules, may be capable of performing on-the-fly analytics, which may allow a dynamic and comprehensive processing of search results. | 2015-06-04 |
| 20150154284 | AGGREGATING RESULTS FROM NAMED ENTITY RECOGNITION SERVICES - An aggregation service aggregates extraction results from diverse named entity recognition (“NER”) services, which can help improve the quality of extracted information. In some cases, the aggregation service considers differences in entity type classifications when aggregating extraction results from different NER services. The aggregation service can also consider performance characteristics (e.g., error rates) for the different NER services. For example, the aggregation service receives extraction results generated for a document corpus according to an entity type schema for each of multiple different NER services, then aggregates the extraction results based at least in part on relations between entity types for the NER services. For a given annotation area, the computing system can identify hypotheses and rank the hypotheses according to an aggregation approach. For some types of aggregation approach, the computing system uses weight values, error path values and/or other performance characteristics determined during training for the NER services. | 2015-06-04 |
| 20150154285 | SYSTEM AND METHOD FOR DETERMINING CONTEXT - The invention relates to determining a context of a system so that the system can be controlled or the context information be used in the system. The context of a system is described with tags or words that characterize e.g. the state of the system, the surroundings of the system and the state of the user. These tags are determined at multiple time instances. The tags are collected over a first time span and a second time span, and the two (or more) sets of tags are used to determine the context of the system. If the determination using the two sets gives a different result, that is, there is a large distance between the two derived contexts, it is determined that a change in context has occurred. Detecting the change in context can be used to control the system, e.g. by changing the applications presented to the user on the user interface, or by changing the state and/or priority of applications. | 2015-06-04 |
| 20150154286 | METHOD FOR DISAMBIGUATED FEATURES IN UNSTRUCTURED TEXT - A method for disambiguating features in unstructured text is provided. The disclosed method may not require pre-existing links to be present. The method for disambiguating features in unstructured text may use co-occurring features derived from both the source document and a large document corpus. The disclosed method may include multiple modules, including a linking module for linking the derived features from the source document to the co-occurring features of an existing knowledge base. The disclosed method for disambiguating features may allow identifying unique entities from a knowledge base that includes entities with a unique set of co-occurring features, which in turn may allow for increased precision in knowledge discovery and search results, employing advanced analytical methods over a massive corpus, employing a combination of entities, co-occurring entities, topic IDs, and other derived features. | 2015-06-04 |
| 20150154287 | METHOD FOR PROVIDING RECOMMEND INFORMATION FOR MOBILE TERMINAL BROWSER AND SYSTEM USING THE SAME - The present disclosure provides a method and system for providing recommend information for mobile terminal browser. The method includes: a mobile terminal browser classifying each website within a historical website record, calculating a score of each classifier of each website, adding scores of identical classifiers to obtain an addition result of each classifier; the mobile terminal browser ranking the various classifiers according to the addition results; starting from a classifier having a highest score, extracting a set number of classifiers and sending the extracted classifiers to a server; the server generating recommend information associated with the classifiers and sending the generated recommend information to the browser for display. The solution of the present disclosure can provide recommend information to each mobile terminal browser based on the historical website information of user access. | 2015-06-04 |
| 20150154288 | METHOD AND SYSTEM FOR PROCESSING LOG DATA - Provided is a method of processing log data and a system for operating the method, in which the log data processing system may include a first storage module, a second storage module, a log collection module configured to collect log data generated by a task process associated with a customer, classify the log data into first log data and second log data based on a type of the log data, and transmit the first log data to the first storage module and the second log data to the second storage module, and a log graph generation module configured to generate a log data graph of at least one of data stored in the first storage module and data stored in the second storage module. | 2015-06-04 |
| 20150154289 | SYSTEMS AND METHODS FOR CATEGORIZING AND MODERATING USER-GENERATED CONTENT IN AN ONLINE ENVIRONMENT - Exemplary embodiments provide systems, devices and methods for computer-based categorization and moderation of user-generated content for publication of the content in an online environment. Exemplary embodiments automatically determine a probability value indicating that the user-generated content is either a positive example or a negative example of one or more unsuitable categories. If the user-generated content is determined to be a positive example of any of the unsuitable categories to a predefined degree of certainty, exemplary embodiments may automatically exclude the content from publication in the online environment. | 2015-06-04 |
| 20150154290 | Producing Visualizations of Elements in Works of Literature - A visualization of literary elements of a work of literature, such as a novel or short story, is generated from meta-data records representing a digital work of literature including literary elements (humor, drama, adventure, etc.), characters, and plot devices related to a position within the work of literature where each appears. A significance level is determined for each of the elements, characters and plot devices at each position within the work of literature, and these are plotted into a sequential graph having position (e.g. timeline) axis and a significance level axis. The sequential graph is then output for printing or display. Human-generated and machine-generated meta-data may be ingested equally well by the method. Colors, line thickness, and a broken line patterns may be employed for greater visual meaning. And, the sequential graph may be annotated according to segments (e.g. chapters, sections) and dominant genre within each segment. | 2015-06-04 |
| 20150154291 | Managing Behavior in a Virtual Collaboration Session - Systems and methods for managing behavior in a virtual collaboration session. In some embodiments, an Information Handling System (IHS) may include a processor and a memory coupled to the processor, the memory including program instructions stored thereon that, upon execution by the processor, cause the IHS to: receive engagement metrics from a participant of a virtual collaboration session, wherein the engagement metrics are indicative of the participant's level of engagement in the virtual collaboration session; calculate a score based upon the engagement metrics; and provide the score to the participant. | 2015-06-04 |
