32nd week of 2013 patent applcation highlights part 60 |
Patent application number | Title | Published |
20130204832 | Trend or Pattern Trigger Device - The present invention implements, in a trend or pattern trigger device or system, the generation of hypotheses automatically while considering any collection of data by automatically assessing with templates or charts the presence of patterns in the data without a priori postulation of what the pattern might be. The trend or pattern examination templates or charts contain quantifiable thresholds for data or change in data so that trends or patterns in data can be discerned inductively and automatically without preconceived notions of what or where the patterns or trends might be. | 2013-08-08 |
20130204833 | PERSONALIZED RECOMMENDATION OF USER COMMENTS - Techniques are described herein for facilitating the consumption of user-generated comments by determining which comments will be of most interest to each individual user. Once the comments that will be of most interest to a particular user are determined, the user-generated comments are presented to that user in a manner that reflects that user's predicted interest. A variety of factors may be used to predict, automatically, the interest each individual user would have in each user-generated comment. For example, interest predictions for a user may be based on the user's prior rating of comments, various types of profile and/or demographic information about the user, the user's social network connections, the authors of the comments, the author of the target subject matter, the user's propensity to comment, etc. | 2013-08-08 |
20130204834 | Decision Tree Creation and Execution in an Interactive Voice Response System - Decision trees may be created and executed to manage calls in an interactive voice response (IVR) system. Users may be provided with one or more user interfaces to design, create, and modify decision trees. User may add and edit the rules, logic, and instructions of the decision tree, as well as additional information such as labels, headers, comments, and formatting. One or more decision tree files may be created including the rules, logic, and instructions of the decision tree, which are compatible with an execution engine. One or more decision tree development files also may be created including additional information to be used by a decision tree development application to provide the development environment. | 2013-08-08 |
20130204835 | METHOD OF EXTRACTING NAMED ENTITY - Presented is a method of extracting named entities from a large-scale document corpus. The method includes identifying named entities in the corpus and forming a set of seed entities manually or automatically using some existing resources, constructing a named entity graph to discover same-type probability between any given pair of named entities, expanding the set of seed entities and performing a confidence propagation of the seed entities on the named entity graph. | 2013-08-08 |
20130204836 | METHOD AND APPARATUS FOR CONSTRUCTING DATA WAREHOUSE TO MANAGE MASS BUILDING ENERGY INFORMATION - A method and apparatus for constructing a data warehouse for managing mass building energy information are provided. The apparatus for constructing a data warehouse in order to manage mass building energy information includes a primitive database generator for constructing primitive databases in each building based on energy control point information, a time series data warehouse generator for generating time series data warehouses based on the constructed primitive databases, a space time series data warehouse generator for reconstructing the generated time series data warehouses based on an object construction information table including space information about objects for control points of the plurality of buildings to be controlled to generate space time series data warehouses, and a view database generator for generating view databases by a search condition in accordance with the search condition for energy usage information based on the generated space time series data warehouses. | 2013-08-08 |
20130204837 | METHOD AND SYSTEM TO EVALUATE RISK OF CONFIGURATION CHANGES IN AN INFORMATION SYSTEM - A system and method to manage configuration of an information system comprises an automated risk evaluation for a requested change of a configuration item in an information system. Change history information indicative of the effects of multiple historical changes to respective configuration items may accessed, and the automated risk evaluation may be based at least in part on the change history information. The requested change may be authorized or as part based on an assessment of a risk value which is calculated in the automated risk evaluation. Additional apparatus, systems, and methods are described. | 2013-08-08 |
20130204838 | METHOD AND SYSTEM FOR INTELLIGENT MANY-TO-MANY SERVICE ROUTING OVER EPP - Method and system for routing EPP requests over a network are provided. A routing system includes multiple frontend service interfaces, one or more gateways, a management server, and a backend service platform that provides multiple application services. The frontend service interfaces are addressable using virtual IP addresses (“VIP”) and can be provided by the gateways. The routing system defines a many-to-many mapping between the frontend service interfaces and a set of services provided by the backend service platform. A requestor can send a request over EPP to a targeted service interface to access one or more backend services, by sending the request to a target IP or domain name that corresponds to a VIP associated with the targeted service interface. Using the many-to-many mapping and the VIP of the targeted service interface, the routing system can identify backend services sought by the request and provide the requestor with access to the backend services. | 2013-08-08 |
20130204839 | Validating Files Using a Sliding Window to Access and Correlate Records in an Arbitrarily Large Dataset - Data records in files may be validated by sequentially accessing the data records while allowing random data access within a sliding window. The data records may also be validated by caching record values. Variable-length record lists in one or more files may be reduced to fixed length record lists while accessing arbitrary record list items. | 2013-08-08 |
20130204840 | SYSTEM, METHOD, AND INTERFACES FOR WORK PRODUCT MANAGEMENT - A method includes receiving an initial electronic file where the initial electronic file is associated with a work product. The method further includes resolving, automatically, an electronic file content type associated with the initial electronic file and executing, automatically, at least one subscription program associated with the electronic file content type of the initial electronic file. The method further includes retrieving an enhanced electronic file based on a matter security level. The enhanced electronic file is associated with an indication of completion of the at least one subscription program. Another embodiment includes extracting a set of metadata from the initial electronic file and storing the set of metadata from the initial electronic file in a memory. Yet another embodiment includes populating, automatically, at least one field within a field-oriented electronic file from the set of metadata. | 2013-08-08 |
20130204841 | SYSTEM AND METHOD FOR GUARANTEEING CONSISTENT DATA SYNCHRONIZATION FROM A VOLATILE DATA SOURCE - Systems and methods for, among other things, updating a destination data set of hierarchical data in relation to a source set of hierarchical data. The method, in certain embodiments, includes receiving an indication that the source data set has one or more changes, initiating a comparison between the source data set and the destination data set, identifying differences and related hierarchical relationships, and altering the destination data set by performing changes in an order that preserves the hierarchical relationships. The method may use the change notifications as an indicator to start the comparison and restart the comparison upon the receipt of a new notification. By using this method, the two data sets can be kept synchronized while preserving hierarchical relationships between the data elements in an environment where the source data set experiences unpredictable changes and cannot be locked. | 2013-08-08 |
20130204842 | METHOD AND SYSTEM FOR SYNCHRONIZATION OF DATA EDITED IN PARALLEL - Fundamental methods, memory systems and processors systems to synchronize replicas of data by exchanging editing plans to replicas are first explained in Section 1. Other sections show derived methods and systems. Major derived methods and systems are expressed as independent claims. Section 2 shows synchronization supported by server providing relay function. Updating of replica is performed, using editing plans arranged in a sequence determined by the server. Section 3 shows synchronization supported by server providing ordinal numbers. Updating of replica is performed, using editing plans arranged in a sequence of ordinal numbers provided by the server. Section shows synchronization keeping reference consistency. Section 5 shows synchronization of edited data and edited definition of data. Even if definition of data is edited, replicas can synchronize each other. Section 6 shows synchronization by version control, which removes editing plans with old version before updating of replicas. | 2013-08-08 |
20130204843 | ADAPTIVE QUIESCE FOR EFFICIENT CROSS-HOST CONSISTENT CDP CHECKPONTS - A disaster recovery system, including a target datastore for replicating data written to source datastores, and a checkpoint engine (i) for transmitting, at multiple times, quiesce commands to a plurality of host computers, each quiesce command including a timeout period that is adjusted at each of the multiple times, (ii) for determining, at each of the multiple times, whether acknowledgements indicating that a host has successfully stopped writing enterprise data to the source datastores, have been received from each of the host computers within the timeout period, (iii) for marking, at each of the multiple times, a cross-host checkpoint in the target datastore and reducing the timeout period for the quiesce commands at the next time, if the determining is affirmative, and (iv) for increasing, at each of the multiple times, the timeout period for the quiesce commands transmitted at the next time, if the determining is not affirmative. | 2013-08-08 |
20130204844 | COMBINED STREAM AUXILIARY COPY SYSTEM AND METHOD - A system and method for transferring data in a library storage system. The library storage system comprises a management server including a storage policy. A media agent is connected to the management server. A plurality of storage media and a data source are connected to the media agent. The data source is divided into at least a first and a second portion of data. The portions of data are transferred from the data source to a first and second primary storage medium using a first and a second data stream respectively. The media agent then causes the first and second portion of data to be transferred from the first and second storage medium to a third auxiliary storage medium using a third combined data stream. Auxiliary copying is performed in chunks and multiple streams are copied in parallel. | 2013-08-08 |
20130204845 | SYSTEMS AND METHODS OF STORING AND MANAGING CONFIGURATION DATA IN TELECOMMUNICATIONS SYSTEMS AND DEVICES - Systems and methods of storing and managing data, such as configuration data, in telecommunications systems and devices. The data are stored as objects, each data object having an associated type, and each object type having at least one instance of the data object. Each instance of each data object has a primary key field, which identifies that instance of the data object. Each instance of each data object can have zero or more foreign key fields, each of which can be used to make reference to the primary key of at least one other data object. By employing at least the foreign key fields and the primary keys of the respective data objects, various referential relationships, branching referential relationships, and many-to-many relationships among one or more groups of the object types can be defined and maintained, for use in storing and/or managing the data with increased flexibility and efficiency. | 2013-08-08 |
20130204846 | ENFORCING TEMPORAL UNIQUENESS OF INDEX KEYS UTILIZING KEY-VALUED LOCKING IN THE PRESENCE OF PSEUDO-DELETED KEYS - Techniques are described for identifying conflicts between a prospective temporal key and an index of temporal keys, the index sorted based on a time value associated with each of the temporal keys. Embodiments determine whether a first temporal key within the index of temporal keys conflicts with the prospective temporal key. Here, the keys within the index may be sorted based upon a respective time value associated with each of the keys. Upon determining that the first temporal key conflicts with the prospective temporal key, the prospective temporal key is designated as conflicting with at least one existing temporal key in the index of temporal keys. | 2013-08-08 |
20130204847 | SMART GRID ONTOLOGY UPDATE DEVICE - According to one embodiment, an ontology update device, which updates a smart grid ontology including an equipment class and individual properties of the class is provided. A storage stores two or three higher-order layers within a domain ontology (DO) layer including specs of the equipment class and the properties, a meta-ontology (MO) layer including specs of metadata of the class and the properties, and an axiomatic ontology (AO) layer including the metadata specs. An access controller controls access to the smart grid ontology so that access is allowed only from a database (DB) or an adapter of a lower-order layer existing in a limited number of specific nodes for a higher-order node. An updater updates the DO layer so that the DO layer is consistent with the MO layer. | 2013-08-08 |
20130204848 | DEDUPLICATED DATA PROCESSING RATE CONTROL - A plurality of workers is configured for parallel processing of deduplicated data entities in a plurality of chunks. The deduplicated data processing rate is regulated using a rate control mechanism. The rate control mechanism incorporates a debt/credit algorithm specifying which of the plurality of workers processing the deduplicated data entities must wait for each of a plurality of calculated required sleep times. The rate control mechanism limits a data flow rate based on a penalty acquired during a last processing of one of the plurality of chunks in a retroactive manner, and operates on at least one vector representation of at least one limit specification to accommodate a variety of available dimensions corresponding to the at least one limit specification. | 2013-08-08 |
20130204849 | DISTRIBUTED VIRTUAL STORAGE CLOUD ARCHITECTURE AND A METHOD THEREOF - The present disclosure relates to a distributed information storage system which functions as virtual cloud storage overlay on top of physical cloud storage systems. The disclosure discloses transparently solving all the data management related security, virtualization, reliability and enables transparent cloud storage migration, cloud storage virtualization, information dispersal and integration across disparate cloud storage devices operated by different providers or on-premise storage. The cloud storage is owned or hosted by same or different third-party providers who own the information contained in the storage which eliminates cloud dependencies. This present disclosure functions as a distributed cloud storage delivery platform enabling various functionalities like cloud storage virtualization, cloud storage integration, cloud storage management and cloud level RAID. | 2013-08-08 |
20130204850 | METHOD AND SYSTEM FOR COMPRESSING DATA RECORDS AND FOR PROCESSING COMPRESSED DATA RECORDS - System and method to compress data records by providing data records with a binary structure; dividing the data records into several bit vectors; reducing the size of each bit vector by dividing the bit vector into consecutive partial areas of equal size, each partial area consisting of n bits, classifying the partial areas as trivial partial areas, quasi-trivial partial areas and non-trivial partial areas, combining one non-trivial or several consecutive non-trivial partial areas into one so named R block, and removing the trivial partial areas; as well as combining one quasi-trivial or several consecutive quasi-trivial partial areas into one so named O block. | 2013-08-08 |
20130204851 | METHOD AND APPARATUS FOR COMPRESSING AND DECOMPRESSING GENETIC INFORMATION OBTAINED BY USING NEXT GENERATION SEQUENCING (NGS) - Provided are methods and apparatuses for compressing genetic information, the methods and apparatuses obtaining read information about reads and alignment information about positions of the reads that are aligned to a reference sequence, and generating a compressed file comprising information about an address of a block corresponding to the aligned reads. Also, a method and apparatus for decompressing genetic information obtains a compressed file with respect to the genetic information, determines an address of a block corresponding to input gene search information, from the compressed file, and selectively decompresses genetic information corresponding to the determined address. | 2013-08-08 |
20130204852 | APPARATUS AND METHOD FOR TRANSMITTING DATA - A data transmission apparatus and method. Information exchange between virtual worlds is achieved by encoding information on a virtual world into metadata and transmitting the metadata to another virtual world. In particular, since the information on the virtual world is encoded into a binary format, high speed data transmission may be achieved. | 2013-08-08 |
20130204853 | Related Data Dependencies - A computer-implemented method for use in maintaining currency of a projection index of a plurality of database objects. The computer-implemented method includes creating the projection index representative of a connection between a first database object and at least a second database object, determining an entity dependency between the first database object and at least the second database object, determining a path dependency between the first database object and at least the second database object, and updating the projection index in response to a modification of one or both of the entity dependency and the path dependency. | 2013-08-08 |
20130204854 | EFFICIENT METADATA INVALIDATION FOR TARGET CKD VOLUMES - A method for invalidating metadata associated with a target count-key-data (CKD) volume is disclosed. The method initially receives a command for a target CKD volume. The command is either an “establish” command for establishing a point-in-time copy relationship, or a “withdraw” command for withdrawing a point-in-time copy relationship. The method determines a track range, spanning a number of data tracks in the CKD volume, associated with the command. Each data track in the track range is associated with a metadata track. For each metadata track whose associated data tracks are fully contained in the track range, the method performs a first procedure. For each metadata track whose associated data tracks are not fully contained in the track range, the method performs a second procedure different from the first procedure. A corresponding apparatus and computer program product are also disclosed. | 2013-08-08 |
20130204855 | DATABASE MANAGEMENT METHOD - A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heap tuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control. | 2013-08-08 |
20130204856 | SELECTIVE LOGGING BASED ON SET PARAMETER - Logging for an identified asset is coordinated when provided by applications implemented on multiple network elements. An indicator is set, prior to activity occurring related to the asset, to log information for the asset based on specified criteria. A first application implemented on a first network element generates, based on the indicator, a first detailed log for activity occurring related to the asset. A representation of the asset is passed to a downstream application implemented on a second network element. A second detailed log for activity occurring related to the asset is generated by the downstream application based on the indicator. The first detailed log is correlated with the second detailed log. | 2013-08-08 |
20130204857 | ASYNCHRONOUS CACHING TO IMPROVE USER EXPERIENCE - A request for information is received, and results corresponding to the request are obtained. The results are provided to a ranking module that ranks them based on user-specific and environmental-specific ranking characteristics in order of how likely they are to be selected by the user in response to the user's request. Before the user selects one of the results, an asynchronous caching component caches the top ranked results so that if they are selected by the user they can quickly be retrieved from cache. | 2013-08-08 |
20130204858 | SYSTEMS AND METHODS FOR INCREASING RELEVANCY OF SEARCH RESULTS IN INTRA WEB DOMAIN AND CROSS WEB DOMAIN SEARCH AND FILTER OPERATIONS - An object of this invention is to filter the results of a website search or a published list on a website, by applying mathematical or logical criteria selected by the user or program, to any of the informational details of an element in the search result or list. An object of this invention is to expand the set of details associated with each element of the search result or published list by gathering user specified information associated with each element from the same or different websites. An object of this invention is to allow the user to identify details of interest of an element in the search result or published list and to limit the presentation of the results to the details of interest. An object of this invention is to accomplish this functionality in a generic manner independent of a specific or set of websites. | 2013-08-08 |
20130204859 | PROVIDING TEMPORAL BIAS FOR SEARCH-RESULT-WEBPAGE ITEMS - A method, system, and medium are provided to temporally bias items included in a search results webpage. The items include navigational links, search results, advertisements, or any other content or items included in a search results webpage. User engagement with the items via the search-engine results page and/or other webpages is tracked. A user-engagement score and an age of the items are determined. A temporal-bias factor is calculated using a decay function that increases in intensity with the age of the items. A rank score is calculated for each item based on the user-engagement score and the temporal-bias factor—the temporal-bias factor decreasing the rank score as a function of the age of the items. The items are ranked based at least in part on the rank score and one or more of the items are chosen for presentation in a search-engine results page. | 2013-08-08 |
20130204860 | Apparatus and Method for Comparing and Statistically Extracting Commonalities and Differences Between Different Websites - The statistics from a reference page serves as a seed to compare the selected page statistics between other webpages. The statistics of all results can be graphically displayed, if desired, in a display or popup window. These results can be analyzed for the determination of a category so an appropriate search expression or a statistical mask can be developed. In addition, statistics of several pages and compare and analyze the results for search term commonality. This step determine how strongly tied the scanned data content of two different webpages are to each other. These results can be analyzed against each other to generate common search terms, a final histogram, and how this histogram compares to the reference histogram. The search expression term can be a Boolean expression or a statistical mask. The statistical mask is used as a seed to start another search moving closer to the final target or desire goal. | 2013-08-08 |
20130204861 | METHOD AND APPARATUS FOR FACILITATING FINDING A NEAREST NEIGHBOR IN A DATABASE - A method and apparatus for facilitating finding a nearest neighbor in a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving information indicative of a query point and information indicative of a node in the database tree; determining, by use of a processor, a lower-bound estimate based on the node and the query point, wherein the lower-bound estimate corresponds to a distance from the query point to the node; determining, by use of the processor, a temporary result corresponding to a distance to a nearest neighbor based on at least one child node of the node, the query point, and the lower-bound estimate; pruning one or more of the plurality of nodes based on the lower-bound estimate and a pruning bound; and returning a result indicative of a nearest neighbor of the query point. | 2013-08-08 |
20130204862 | INTERNET SEARCHING AND SOCIAL INTERACTION TECHNIQUES - According to techniques of this application, a method for presenting data representative of a website includes associating a plurality of webpage icons with a corresponding plurality of webpages in a website. Each of the webpage icons correspond to differing degrees of significance of the webpages. Each of the webpage icons are communicative of the differing degrees of significance of the webpages (for example the first webpage icon may be larger than the second webpage icon). There may be two, three, or more webpage icons that are communicative of differing degrees of significance of the webpages. The webpage icons are positioned in different areas of map view data. The map view data may be transmitted for presentation on a display. | 2013-08-08 |
20130204863 | System and Method for Displaying Search Results - In a computer implemented method, a credibility rating is requested and received, or web activity is tracked, from a web user on a web page. A search request is received from a searcher, and a plurality of links is selected, including a link to the web page to display as search results to the searcher. The link to the web page is then displayed within the search results in an order based, at least in part, on the credibility rating or web activity. Multiple credibility ratings or user web activities on that web page from other users can also be received and stored, and the order of display can be based on these as well. The order of display may be based more on credibility ratings or web activity tracked from web users affiliated with the searcher in a social network. | 2013-08-08 |
20130204864 | INFORMATION PROVISION DEVICE, INFORMATION PROVISION METHOD, PROGRAM, AND INFORMATION RECORDING MEDIUM - An information provision device ( | 2013-08-08 |
20130204865 | DURABLE MEMENTO SYSTEM - Durable memento system that enables the storage of data associated with mementos, which are objects that serve to provide a reminder of a person, place, thing, or an event. Embodiments are configured to store and recall data including but not limited to pictures, movies, sounds, text, or other information such as performance data indirectly associated with a memento such as but not limited to a keepsake, souvenir, gift, gift card, medal or award, tool or any combination thereof. One or more embodiments may include a visual and/or machine-readable and/or human-readable code to associate the data with the memento. The durable data may be stored remote from the memento, which prevents obsolescence by securing data robustly. This enables the data to be accessed years later even if the file formats or display technology for the data has changed by that time and even if the original memento has been lost. | 2013-08-08 |
20130204866 | OBJECT TAG METADATA AND IMAGE SEARCH - Techniques are disclosed for ordering images. The technique includes receiving a request, the request including keywords and parameters specifying desired image characteristics. Further, the technique includes identifying a set of images responsive to the request based on a match of the keywords to tags associated with objects depicted in the set of images. Finally, the technique includes determining an ordering of the identified set of images by comparing the received parameters with metadata fields associated with respective tags of the objects and returning an indication of the set of images and the determined ordering of the images. | 2013-08-08 |
20130204867 | Selection of Main Content in Web Pages - A system and method for selecting main content ( | 2013-08-08 |
20130204868 | System and Method for Presenting Geolocated Relevance-Based Content - System and method for presenting geolocated relevance-based content. In one example, presence of a user is detected at a location. A plurality of search queries associated with the location are obtained. At least one search query is identified from the plurality of search queries based on information associated with the user. A search result is then generated based on the at least one identified search query to the user. | 2013-08-08 |
20130204869 | READING COMPREHENSIBILITY FOR CONTENT SELECTION - Briefly, embodiments of methods or systems to measure or employ reading comprehensibility are described. | 2013-08-08 |
20130204870 | SOURCING TERMS INTO A SEARCH ENGINE - Information may be presented to a user by receiving a selection of one or more terms passively displayed in a document, loading the terms to a search configuration, generating first results responsive to a user's predicted interest as expressed in the search configuration, and enabling display of the first results. | 2013-08-08 |
20130204871 | METHOD AND APPARATUS FOR SOCIAL CONTENT CURATION AND RANKING - A method and apparatus for ranking documents obtained in a search. The document rank is determined based on social engagement data for each document. The number of social sharing events for the document are summed then normalized to generate a quality score for determining rank. Various weighting factors may be applied to derive the quality score. | 2013-08-08 |
20130204872 | SEMANTIC MODEL OF EVERYTHING RECORDED WITH UR-URL COMBINATION IDENTITY-IDENTIFIER-ADDRESSING-INDEXING METHOD, MEANS, AND APPARATUS - A computer program product embodied on a non-transitory computer readable storage medium, comprising non-transitory computer executable program code configured to perform the steps of: receiving a representation of an unlabeled event; labeling the unlabeled event according to a unitary relative event ontology; and storing the labeled event in the computer readable storage medium. The unitary relative event ontology can comprise an information description vector comprising a plurality of ontological primitives, and the plurality of ontological primitives can comprise a point description element, a reference-body description element, an observer description element, a position description element, a scene description element, and a specification description element. | 2013-08-08 |
20130204873 | IDENTIFICATION OF ELECTRONIC CONTENT SIGNIFICANT TO A USER - Content that is significant to a user may be determined. An indication that a user finds content within a document significant may be received. In response to the received indication, the document may be analyzed to identify a set of topics associated with the content of the document. From the set of topics, a subset of topics responsible for the user finding the document significant may be identified. A user profile associated with the user may be updated based on the subset of topics. | 2013-08-08 |
20130204874 | Hyper Adapter and Method for Accessing Documents in a Document Base - The present invention relates to a hyper adapter ( | 2013-08-08 |
20130204875 | Automatic Configuration Of A Product Data Management System - The invention relates to a computer-implemented configuration system, a method of configuration and a computer program product. The configuration system serves to automatically configure a product data management system (P). The product data management system (P) serves to manage parts data sets ( | 2013-08-08 |
20130204876 | System, Method and Computer Program Product for Automatic Topic Identification Using a Hypertext Corpus - A system, method, and/or computer program product for automatic topic identification using a hypertext corpus may include a) receiving a content document(s); b) identifying or lexically scoring candidate topic(s) in the received content document based on label(s) used in a corpus to link to or relate to the candidate topics; c) evaluating or semantically scoring the candidate topic(s) of the received document based on a relationship between two or more candidate topics in the corpus; and d) weighting candidate topics for relevance based on algorithmic or statistical analysis of links or relationships in the corpus. | 2013-08-08 |
20130204877 | ATTRIBUTION USING SEMANTIC ANALYISIS - A method, system, and computer program product for semantic attribution of a request. Source data statements for the request are received. A selection of a domain for the received source data statements is received. The received source data statements are semantically analyzed, which includes matching elements in the received source data statements to respective one or more entries in an ontology associated with the selected domain. The ontology includes items and relationships that define the selected domain. Each element in the received source data statements is a word or a phrase. The one or more entries are assigned to the matched elements, respectively, to annotate each matched element with a respective annotation consisting of the respective one or more entries. The annotated elements are saved with the respective annotations. | 2013-08-08 |
20130204878 | MUSIC RECOMMENDATION METHOD WITH RESPECT TO MESSAGE SERVICE - A music recommendation method and a music recommendation system are provided. The music recommendation method includes: selecting music files according to a theme of the message service and music, a mood of the music, a similarity between content of the message service and content of the music; and recommending selected music files to a user. | 2013-08-08 |
20130204879 | WEB PAGE RETRIEVAL METHOD AND DEVICE - Embodiments of the present application relate to a web page retrieval method, a web page retrieval device, and a computer program product for retrieving a web page. A web page retrieval method is provided. The method includes receiving a query, retrieving an attribute identifier of a web page to be retrieved and a query range related to the attribute identifier, based on the query, obtaining a range of attribute values, determining whether an intersection between the range of attribute values to be retrieved and a plurality of index ranges established in advance in a system receiving the inputted query exists, in the event that the intersection exists, retrieving a web page relating to intersecting index ranges, the attribute identifier of the web page corresponding to the attribute identifier of the web page to be retrieved, and the attribute values intersecting the query range, and returning the retrieved web page. | 2013-08-08 |
20130204880 | METHODS AND SYSTEMS FOR LIST FILTERING BASED ON KNOWN ENTITY MATCHING - Methods and systems are disclosed for implementing data matching techniques. In some embodiments, methods and systems may be implemented for filtering a received record associated with at least one record attribute against an entity record. The methods and systems comprise, for example, applying a record attribute weight to the at least one record attribute associated with the received record, performing at least one matching technique that compares the at least one record attribute of the received record against the entity record, wherein the at least one matching technique is associated with a corresponding matching technique multiplier, calculating a matching score based on a result of the at least one matching technique and the multiplier associated with the at least one matching technique, and comparing the matching score to a threshold to determine whether the received record represents a suspect entity. | 2013-08-08 |
20130204881 | APPARATUS, SYSTEMS AND METHODS FOR INTERACTIVE DISSEMINATION OF KNOWLEDGE - Embodiments of apparatus, systems and methods facilitate knowledge dissemination and promote knowledge acquisition, in part, by automatically presenting elements of an interlinked knowledge base to optimize learning efficiency. In some embodiments, content associated with a plurality of linked subject items in a knowledge base is disseminated to a user based on rankings determined using a priority value associated with candidate subject items. The candidacy is determined and the priority value is computed based on, at least in part, user-specific understanding values corresponding to the candidate subject items; user-specific understanding values of at least one of a plurality of basic subject items linked to the candidate subject items, and user-specific understanding values of at least one of plurality of advanced subject items linked to the candidate subject items. Content associated with the plurality of candidate subject items may be displayed to the user in order of rank based upon user interest. | 2013-08-08 |
20130204882 | Systems And Methods of Detecting, Measuring, And Extracting Signatures of Signals Embedded in Social Media Data Streams - A system for scoring micro-blogging messages is provided, including an extractor, and evaluator, a calculator, and a publisher. The extractor may be configured to receive micro-blogging messages, to detect messages containing terms of interest, to extract raw data, and to store the data in a database. The evaluator may be configured to access and parse the stored data into tokenized data, and to store the tokenized data in a database. The evaluator may also be configured to identify relevant micro-blogging messages; to tag message as indicative; and to filter messages from low-volume or malicious sources before being tagged as indicative. The calculator may be configured to access a sentiment dictionary; to calculate a sentiment score of the tokenized data, and to calculate a sentiment signature for a term of interest. The publisher may be configured to provide access to clients of the system. | 2013-08-08 |
20130204883 | COMPUTATION OF TOP-K PAIRWISE CO-OCCURRENCE STATISTICS - Various technologies described herein pertain to computing top-K pairwise co-occurrence statistics using an upper bounding heuristic. Upper bound values of a co-occurrence statistic for items in a set can be computed based on a query item, and items can be sorted into an order. The items and the query item are represented by respective portions of a tensor. An item from the order associated with a highest upper bound value can be selected, an actual value of the co-occurrence statistic can be computed for the selected item, the upper bound value for the selected item can be replaced with the actual value for the selected item, and the selected item can be repositioned in the order. When the top-K items in the order lack an item associated with an upper bound value, the top-K items and actual values of the co-occurrence statistic for the top-K items can be outputted. | 2013-08-08 |
20130204884 | System to Automate Mapping of Variables Between Business Process Applications and Method Therefor - Profiles associated with two applications are received. Each profile identifies a set of data fields identified by a corresponding full path name. Associations between data fields of the profiles are identified based on mapping pairs included in a full path mapping database, mapping pairs included in a shortest unique path mapping database, and mapping pairs included in a leaf mapping database. A prioritized list of mapping suggestions is provided based on the identified associations. A mapping suggestion can include a data manipulation operation according to information associated with a corresponding mapping pair. | 2013-08-08 |
20130204885 | DOCUMENT PROCESSING EMPLOYING PROBABILISTIC TOPIC MODELING OF DOCUMENTS REPRESENTED AS TEXT WORDS TRANSFORMED TO A CONTINUOUS SPACE - A set of word embedding transforms are applied to transform text words of a set of documents into K-dimensional word vectors in order to generate sets or sequences of word vectors representing the documents of the set of documents. A probabilistic topic model is learned using the sets or sequences of word vectors representing the documents of the set of documents. The set of word embedding transforms are applied to transform text words of an input document into K-dimensional word vectors in order to generate a set or sequence of word vectors representing the input document. The learned probabilistic topic model is applied to assign probabilities for topics of the probabilistic topic model to the set or sequence of word vectors representing the input document. A document processing operation such as annotation, classification, or similar document retrieval may be performed using the assigned topic probabilities. | 2013-08-08 |
20130204886 | Multi-Source, Multi-Dimensional, Cross-Entity, Multimedia Encryptmatics Database Platform Apparatuses, Methods and Systems - The MULTI-SOURCE, MULTI-DIMENSIONAL, CROSS-ENTITY, MULTIMEDIA ENCRYPTMATICS DATABASE PLATFORM APPARATUSES, METHODS AND SYSTEMS (“EXDB”) transform data aggregated from various computer resources using EXDB components into updated entity profiles and/or social graphs. In one implementation, the EXDB aggregates data records including search results, purchase transaction data, service usage data, service enrollment data, and social data. The EXDB identifies data field types within the data records and their associated data values. From the data field types and their associated data values, the EXDB identifies an entity. The EXDB generates correlations of the entity to other entities identifiable from the data field types and their associated data values. The EXDB also associates attributes to the entity by drawing inferences related to the entity from the data field types and their associated data values. Using the generated correlations and associated attributes, the EXDB generates an updated profile and social graph of the entity. The EXDB provides the updated profile and social graph for an automated web form filling request. | 2013-08-08 |
20130204887 | METHOD AND SYSTEM FOR SIMPLIFYING OBJECT MAPPING FOR A USER INTERFACE - A system and method for simplifying object mapping for user interfaces on a computer system. The method comprising receiving a client request for action and associating the client request to a logical object, converting the logical object to a physical object that resides in an object relational mapping, and mapping between the physical object and a relational database. | 2013-08-08 |
20130204888 | COMMUNICATION HISTORY AGGREGATION AND PRESENTATION - A unified communication application can allow a user to communicate with contacts across multiple electronic communication services. The unified communication application can aggregate communication history between the user and another person. A set of communication files associated with user identifiers of the user and the other person can be obtained, arranged, and presented to the user in an order based on a timestamp of each conversation line in the files. | 2013-08-08 |
20130204889 | METHOD AND SYSTEM FOR AUTOMATIC CONTENT RECOGNITION NETWORK OPERATIONS - A network fingerprint manager within an automatic content recognition (ACR) system may be operable to receive one or more versions of media content associated with a network. One or more proxy content may be generated by the network fingerprint manager for each version of the received media content. The network fingerprint manager may generate a set of fingerprints from a particular one of the generated one or more proxy content for each version of the received media content. The particular one being fingerprinted may comprise proxy content with highest quality among the generated proxy content. The set of fingerprints and corresponding content ID and media time for each version of the received media content may be stored. The network fingerprint manager may generate real-time fingerprints from content in a received network feed. The network fingerprint manager may compare the generated real-time fingerprints to the stored sets of fingerprints for matching. | 2013-08-08 |
20130204890 | DOCUMENT MANAGEMENT SYSTEM AND METHOD THEREOF - A document management system that defines an index type for each management unit for managing a plurality of documents, individually selects a search area and an index acquisition area, from which the index type is acquired, displays in a list the index types defined for the management unit in a selected index acquisition area, makes a user select a desired index type from among the index types displayed in a list, sets a search condition using the selected index type, and searches for a document corresponding to the search condition from among a plurality of documents managed by the management unit belonging to the search area. | 2013-08-08 |
20130204891 | FILL IN THE BLANKS WORD COMPLETION SYSTEM - A word completion system based on a partial but exact template that entails a finite number of matches. The key component is a closed ended template made up of cues representing one or more characters, constrained by the exact number of characters in the desired word. It can be edited with pinpoint accuracy to regenerate a new result set in real time to reflect the change. The exact number of characters in the template can be indicated by a discrete signal with a designated gesture or keying in a number. The system is substantially interactive without requiring command line input or a scripting language. A delimiter or a designated signal is used to select an entry from the result set to complete the target word. The proposed method is inherently deterministic and extensible to different writing systems and portable to a wide range of hardware platforms. | 2013-08-08 |
20130204892 | BIASING SEARCH RESULTS TOWARD TOPICS OF INTEREST USING EMBEDDED RELEVANCE LINKS - Redirection (“biasing”) architecture that automates the selection of topical terms in a search query, and provides a user-selectable (e.g., clickable) interface which enables the user to quickly and easily re-formulate and execute a new query using terms that return more focused search results. The redirection of search by biasing the terms (strings) can also be performed by indicating that certain results are not interesting to the user. For example, one way using an existing search engine, is to apply a search operator (e.g., a hyphen) to indicate that certain terms must not occur in the search results (negation). Accordingly, by automatically selecting topical terms to negate, constructing a query, and embedding the negation in a link with each results page result, considerable manual and cognitive effort is saved. | 2013-08-08 |
20130204893 | METHODS FOR GENERATING A UNIFIED VIRTUAL SNAPSHOT AND SYSTEMS THEREOF - A method, computer readable medium, and system for generating a unified virtual snapshot in accordance with embodiments of the present invention includes invoking with a file virtualization system a capture of a plurality of physical snapshots. Each of the physical snapshots comprises content at a given point in time in one of the plurality of data storage systems. A unified virtual snapshot is generated with the file virtualization system based on the captured plurality of the physical snapshots. | 2013-08-08 |
20130204894 | Multi-Source, Multi-Dimensional, Cross-Entity, Multimedia Analytical Model Sharing Database Platform Apparatuses, Methods and Systems - The MULTI-SOURCE, MULTI-DIMENSIONAL, CROSS-ENTITY, MULTIMEDIA ANALYTICAL MODEL SHARING DATABASE PLATFORM APPARATUSES, METHODS AND SYSTEMS (“AMSDB”) transform data aggregated from various computer resources using AMSDB components into updated entity profiles and/or social graphs. In one implementation, the AMSDB aggregates data records including search results, purchase transaction data, service usage data, service enrollment data, and social data. The AMSDB identifies data field types within the data records and their associated data values. From the data field types and their associated data values, the AMSDB identifies an entity. The AMSDB generates correlations of the entity to other entities identifiable from the data field types and their associated data values. The AMSDB also associates attributes to the entity by drawing inferences related to the entity from the data field types and their associated data values. Using the generated correlations and associated attributes, the AMSDB generates an updated profile and social graph of the entity. The AMSDB provides the updated profile and social graph for an automated web form filling request. | 2013-08-08 |
20130204895 | NAVIGATION SYSTEM WITH SEARCH-TERM BOUNDARY DETECTION MECHANISM AND METHOD OF OPERATION THEREOF - A method of operation of a navigation system includes: detecting a search string; determining a forward-element using a forward-boundary within the search string in a forward direction; determining a backward-element in a backward direction up to the forward-boundary using a backward-boundary within the search string; and determining a matching result for the search string using the forward-element and the backward-element for displaying on a device. | 2013-08-08 |
20130204896 | PARALLEL PROCESSING OF CONTINUOUS QUERIES ON DATA STREAMS - A continuous query parallel engine on data streams provides scalability and increases the throughput by the addition of new nodes. The parallel processing can be applied to data stream processing and complex events processing. The continuous query parallel engine receives the query to be deployed and splits the original query into subqueries, obtaining at least one subquery; each subquery is executed in at least in one node. Tuples produced by each operator of each subquery are labeled with timestamps. A load balancer is interposed at the output of each node that executes each one of the instances of the source subquery and an input merger is interposed in each node that executes each one of the instances of a destination subquery. After checks are performed, further load balancers or input managers may be added. | 2013-08-08 |
20130204897 | COMBINED WORD TREE TEXT VISUALIZATION SYSTEM - An example method includes identifying instances of a search term in a source text, and identifying prefix strings and suffix strings comprising tokens preceding and subsequent to the search term in the source text. The method further includes displaying a visualization interface that includes the search term within a combined tree diagram that includes a prefix tree and a suffix tree extending to either side of the search term. The prefix tree displays the prefix strings and the suffix tree displays the suffix strings, and both have user-selectable branches. The method further includes providing, in response to a user input selecting a branch in the prefix tree or in the suffix tree, a visual indication of a prefix string and a suffix string in the visualization interface that form a matching sequence that originate together in the source text, for matching sequences that are connected through the selected branch. | 2013-08-08 |
20130204898 | TEXT SEARCH APPARATUS AND TEXT SEARCH METHOD - The text search apparatus has an information storage that stores plural transposed indexes associating characters or character strings appearing in a document to be searched with the appearance positions of the characters or character strings. The transposed indexes were generated for a document in which beginning marks are added in front of texts to be subject to forward matching search. The incremental searcher of the text search apparatus adds a beginning mark in front of a search keyword and executes a forward matching search using a set of transposed indexes. The main searcher executes a partial match search using the same set of transposed indexes. | 2013-08-08 |
20130204899 | Method and device for monitoring and analyzing signals - A method and system for monitoring and analyzing at least one signal are disclosed. An abstract of at least one reference signal is generated and stored in a reference database. An abstract of a query signal to be analyzed is then generated so that the abstract of the query signal can be compared to the abstracts stored in the reference database for a match. The method and system may optionally be used to record information about the query signals, the number of matches recorded, and other useful information about the query signals. Moreover, the method by which abstracts are generated can be programmable based upon selectable criteria. The system can also be programmed with error control software so as to avoid the re-occurrence of a query signal that matches more than one signal stored in the reference database. | 2013-08-08 |
20130204900 | ASCRIBING ACTIONABLE ATTRIBUTES TO DATA THAT DESCRIBES A PERSONAL IDENTITY - There is provided a method that includes (a) receiving an inquiry to initiate a search for data for a specific individual, (b) determining, based on the inquiry, a strategy and flexible predictiveness equations to search a reference database, (c) searching the reference database, in accordance with the strategy, for a match to the inquiry; and (d) outputting the match. The method may also output flexible feedback related to the match that reflects inferred quality of the match experience which can be used by an end-user to determine the degree to which the matched entity meets that end-user's quality-based criteria. There is also provided a system that performs the method, and a storage medium that contains instructions that control a processor to perform the method. | 2013-08-08 |
20130204901 | APPARATUS, SYSTEM, AND METHOD FOR DATA ANALYSIS - In alternative embodiments, the invention provides computer-implemented methods comprising: (a) representing a plurality of Data Node Archive (DNA) data elements, or a plurality of non-deoxyribonucleic acid (non-DNA) data elements, in a model having a format or organization in accordance with (or equivalent to, or analogous to) a biological deoxyribonucleic acid (DNA) model format or equivalent thereof; or, (b) a computer-implemented method comprising a subset of, substantially all, or all of the steps as set forth in the flow chart of FIG. | 2013-08-08 |
20130204902 | Enhanced B-Trees with Record Merging - In some implementations, a B+tree (b plus tree) can provide concurrent access to data while modifying nodes of the B+tree. In some implementations, a top-down B+tree can be provided where nodes of the B+tree can be proactively merged, rebalanced and split to prevent recursive operations moving up the B+tree. In some implementations, node (or page) record data can be merged to consolidate record entries within nodes of the B+tree while only locking 1-3 nodes of the tree at the same time. In some implementations, record data can be merged across multiple nodes of the B+tree. In some implementations, ranges of data can be removed from the tree while only locking 1-3 nodes of the tree at the same time. In some implementations, range of data can be replaced with new data while only locking 1-3 nodes of the tree at the same time. | 2013-08-08 |
20130204903 | PROBABILISTIC FINGERPRINT CHECKING FOR PREVENTING DATA LEAKAGE - A data-leakage prevention capability is presented herein. The data-leakage prevention capability prevents leakage of data, of a file set having a plurality of files, from a secure network using online fingerprint checking of data flows at a boundary of the secure network. The online fingerprint checking is performed using a set of data structures configured for the file set. The data structures for the file set are configured based on file set characteristics information of the file set and a target detection lag indicative of a maximum number of bits within which a data leakage event for the file set is to be determined. The data structure configuration is computed for a plurality of data structures configured for use in monitoring the files of the file set. The data structure configuration includes a plurality of data structure locations and data structure sizes for the respective plurality of data structures. | 2013-08-08 |
20130204904 | SYSTEMS AND METHODS OF PROVISIONING DATA STORAGE AND RUNTIME CONFIGURATION IN TELECOMMUNICATIONS SYSTEMS AND DEVICES - Systems and methods of provisioning data storage and runtime configuration in telecommunications systems and devices. The systems and methods employ at least one decentralized revision control system as a data repository for storing data, such as configuration data, and at least one data provisioning component as an interface for accessing the configuration data stored in the data repository. By employing the decentralized revision control system in conjunction with the data provisioning component, the systems and methods can provide a data storage and runtime configuration provisioning framework that is data agnostic, application agnostic, and user agnostic, while further providing at least the capability of tracking and maintaining the version history of the configuration data. | 2013-08-08 |
20130204905 | REMAPPING LOCALITY-SENSITIVE HASH VECTORS TO COMPACT BIT VECTORS - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving a hash vector r, a vector of locality-sensitive hash values, each hash value being an element of the hash vector r, each element having an index position; and generating a compact vector v corresponding to the hash vector r, wherein the compact vector v is a vector of compact elements each having an index position, wherein each compact element corresponds to the element of the hash vector r having the same index position, and wherein each compact element is a b-bit integer selected from the set of all b-bit integers {0, 1, . . . , 2 | 2013-08-08 |
20130204906 | MECHANISM FOR FACILITATING DYNAMIC MANAGEMENT OF ASSETS IN AN ON-DEMAND SERVICES ENVIRONMENT - In accordance with embodiments, there are provided mechanisms and methods for facilitating dynamic management of assets in an on-demand services environment. In one embodiment and by way of example, a method includes receiving, in real-time, a request for performance of one or more tasks relating to management of assets. The management of assets may include management of data relating to the assets, where the assets may include hardware assets or software assets, wherein the request is received at a first computing system. The method may further include performing, in real-time, the one or more tasks. The one or more tasks may include dynamically customizing, according to the request, data relating to the assets. | 2013-08-08 |
20130204907 | Data Management at a Directory Database - A method for data management at a directory database ( | 2013-08-08 |
20130204908 | Media Bundle Overlays - A media bundle and one or more media bundle overlays allow modifying content that is to be played by a playback framework of an electronic device with multimedia content objects contained in the media bundle overlays without modifying the media bundle. A runtime data structure dynamically incorporates the multimedia content contained in the media bundle with multimedia content contained in the media bundle overlays. Manifest objects in the media bundle and some media bundle overlays describe multimedia content contained in the media bundle and the corresponding media bundle overlays. Multimedia content contained in the multimedia bundle overlays may supplement or replace multimedia content contained in the media bundle. | 2013-08-08 |
20130204909 | User-guided Multi-schema Integration - Methods, systems, and computer-readable storage media for user-guided multi-schema integration and include actions of receiving a plurality of schemas, each schema defining a data structure and including a plurality of intermediate elements and a plurality of leaf elements, receiving leaf correspondences that match leaf elements between schemas of the plurality of schemas, processing the plurality of schemas and the leaf correspondences using closed frequent itemset mining to define a first plurality of redundancy groups, each redundancy group including a proposed correspondence between intermediate elements of schemas, displaying the first plurality of redundancy groups to a user, receiving user input, the user input including one or more actions to one or more redundancy groups in the first plurality of redundancy groups, processing the plurality of schemas, the leaf correspondences and the one or more actions to define a second plurality of redundancy groups, and displaying the second plurality of redundancy groups. | 2013-08-08 |
20130204910 | EFFICIENT XML/XSD TO OWL CONVERTER - Techniques and tools are described for converting XML documents and XML schema documents to OWL. An OWL model ontology can be generated by receiving XML schema documents, performing schema consolidation, and generating the OWL model ontology from the consolidated XML schema. An OWL instance ontology can be generated by receiving XML documents and XML schema documents and generating an OWL instance ontology from the XML documents and the XML schema documents. OWL model extraction and OWL instance generation can be performed in parallel and without the need for intermediate XSLT documents. Schema consolidation can comprise collecting schema documents, merging schema documents, and reorganizing the merged schema document to create a consolidated schema document. | 2013-08-08 |
20130204911 | REAL TIME PERFORMANCE MONITORING - Systems and methods for real time performance monitoring of an application are described. In one implementation, when a metrics collection request is obtained from a user device, a data storage location is selected from a plurality of data storage locations based on a location status associated with the data storage location. The metrics data, for monitoring the performance of the application, is then provided to the user device through a data store from the selected data storage location in real time. | 2013-08-08 |
20130204912 | METHOD, PROGRAM AND SYSTEM FOR GENERATING HASH CODES TO IDENTIFY OBJECTS - A computer-implemented method, system, and article of manufacture for generating hash codes to identify objects. The method increases variation in object hash codes to reduce conflict between object hash codes and enables them to be added to pinned objects. The method includes: generating a seed value for each heap area and generating the hash code on the basis of address of the object and seed value of the heap area to which the object is allocated. The article of manufacture includes computer readable instructions which, when implemented, cause a computer to perform the steps of the above method. The computer-implemented system includes a processor; and a memory which includes a hash code, an object, a seed value, and a heap area, wherein the processor is configured to perform the steps of the above method. | 2013-08-08 |
20130204913 | FILE LIST GENERATION METHOD, SYSTEM, AND PROGRAM, AND FILE LIST GENERATION DEVICE - A file list generation method of the present invention includes: a first step of acquiring, from a file server, an operation history list showing additions, changes, and deletions performed on file data in a search target file after the last search index creating operation, the file server managing the search target file; and a second step of, when more than one operation history about a single file is included in the acquired operation history list, obtaining only the latest operation histories and then consolidating the operation histories and operation histories of the other files, and outputting the consolidated list as a difference list showing the differences from the history list of operations performed on the search target file after the last search index creating operation. | 2013-08-08 |
20130204914 | PATIENT IDENTIFICATION BASED ON IMMUTABLE CHARACTERISTICS - Techniques are described herein that are capable of identifying patients based on immutable characteristics. For instance, each patient identifier is based on immutable characteristics of the patient who is to be identified by that patient identifier. Examples of an immutable characteristic of a patient include but are not limited to the patient's first name, the patient's last name, the patient's birth date, the patient's birth city, the patient's birth state, the patient's birth country, the patient's mother's maiden name, the patient's gender, etc. For instance, portions of a patient identifier that identifies a patient may be based on respective subsets of immutable characteristics of the patient. Logical operations may be performed with respect to the respective portions of the patient identifier to determine a checksum identifier to facilitate detection of an error with respect to reproduction (e.g., scanning, manually typing, etc.) of the patient identifier. | 2013-08-08 |
20130204915 | RANDOM NUMBER GENERATING METHOD - A random number generating method includes sending a signal source for outputting a data sequence and randomly retrieving a segment of data having an operation length as a seed; converting the seed into a first operation value, determining whether a difference between the first operation value and a second operation value is larger than a threshold value, and determining whether a total number of times the first operation value has been inputted into the operation value processing step is larger than a predetermined value. The first operation value is reset by a reset algorithm; otherwise the sample selection step is re-performed. The operation values are converted into a random number. A total number of bits of the random number is calculated. The operation value setting step is performed or a latest random number having a length equal to the operation length is set as the seed. | 2013-08-08 |
20130204916 | RESIDUE-BASED ERROR DETECTION FOR A PROCESSOR EXECUTION UNIT THAT SUPPORTS VECTOR OPERATIONS - A residue generating circuit for an execution unit that supports vector operations includes an operand register and a residue generator coupled to the operand register. The residue generator includes a first residue generation tree coupled to a first section of the operand register and a second residue generation tree coupled to a second section of the operand register. The first residue generation tree is configured to generate a first residue for first data included in the first section of the operand register. The second residue generation tree is configured to generate a second residue for second data included in a second section of the operand register. The first section of the operand register includes a different number of register bits than the second section of the operand register. Configuring a residue-generation tree to be split into multiple residue generation trees facilitates residue checking multiple independent vector instruction operands within a full width dataflow in parallel or alternatively residue checking a full width operand of a standard instruction. | 2013-08-08 |
20130204917 | MANAGING PARTITIONS IN A SCALABLE ENVIRONMENT - Systems and methods are provided that enable a general framework for partitioning application-defined jobs in a scalable environment. The general framework decouples partitioning of a job from the other aspects of the job. As a result, the effort required to define the application-defined job is reduced or minimized, as the user is not required to provide a partitioning algorithm. The general framework also facilitates management of masters and servers performing computations within the distributed environment. | 2013-08-08 |
20130204918 | COMPUTING ENVIRONMENT CONFIGURATION AND INITIALIZATION - According to one aspect of the present disclosure a method and technique for automatically configuring a set of resources for deployment as a computing environment is disclosed. The method includes: executing a configuration management application, the configuration management application configured to automatically connect to and discover each hardware element forming a networked set of resources; determine whether each discovered hardware element is specified for the computing environment; responsive to determining that each discovered hardware element is specified for the computing environment, determine a configuration setting for each respective discovered hardware element; responsive to determining that the configuration setting of the discovered hardware element conflicts with a desired configuration setting for deployment of the discovered hardware element, automatically configure the discovered hardware element to the desired configuration setting; and automatically load and configure a management interface to enable deployment of the networked set of resources as a computing environment. | 2013-08-08 |
20130204919 | CONTENT REPRODUCTION APPARATUS, CONTROL INFORMATION PROVIDING SERVER, AND CONTENT REPRODUCTON SYSTEM - Provided is a content reproduction apparatus including a reproduction control unit that controls reproduction of a link-type content including a plurality of scenarios that each include content data and control information regarding reproduction of the content data, and a control information acquisition unit that acquires the control information. The reproduction control unit controls the reproduction of the link-type content by reproducing the content data in accordance with the control information including event information used to transition from a current scenario to another scenario. | 2013-08-08 |
20130204920 | TRANSFERRING SESSION DATA BETWEEN NETWORK APPLICATIONS - In a method for transferring session data from a first application accessible via at least one DNS name in a first DNS domain to a second application accessible via at least one DNS name in a second DNS domain, a computer receives via the first application a first HTTP request from an HTTP client, and in response, the computer establishes a first session with the HTTP client. The computer receives, from the HTTP client, a second HTTP request comprising an identifier of the second application, and in response, the computer stores in a memory a data structure identifiable by a data structure identifier and containing data pertaining to the first session. Responsive to storing the data structure, the computer transmits, to the HTTP client, an HTTP response comprising the data structure identifier, a redirection status code, and a URI comprising a DNS name in the second DNS domain. | 2013-08-08 |
20130204921 | DIAGNOSTICS AGENTS FOR MANAGED COMPUTING SOLUTIONS HOSTED IN ADAPTIVE ENVIRONMENTS - A solutions manager supports computing solutions running on hosts in an adaptive computing environment by utilizing remote processes or agents placed on the hosts. A remote agent is associated with a computing solution and placed on the host on which the computing solution is running. When the computing solution is relocated to a new host, the remote agent associated with the computing solution is also automatically relocated and restarted on the new host. | 2013-08-08 |
20130204922 | Asset Control and Management System - An embodiment provides a method for managing a hydrocarbon asset. The method includes creating an interactive community of agents, wherein each agent comprises code and functional data structures configured to direct a processor to access resource on a network. At least one of the agents is configured to be a workflow agent, wherein the work-flow agent is configured to pursue a plan to accomplish a goal. The work-flow agent is provided with sensors to determine environmental conditions. The workflow agent is provided with the ability to communicate with other intelligent agents. The workflow agent is configured to select the plan based, at least in part, on information obtained from the sensors. | 2013-08-08 |
20130204923 | SYSTEMS AND METHODS FOR SHARED ACCESS TO GAMING ACCOUNTS - A web server provides a host website to receive user profile and financial information to establish user gaming accounts that are shared by a plurality of on-line gaming venues. Each gaming venue, operated by different entities, provides gaming activities on a respective website. The host website provides a plurality of links to the participating on-line gaming venues and each gaming venue has shared access to the same user gaming account to facilitate user participation. | 2013-08-08 |
20130204924 | METHODS AND APPARATUSES FOR PROVIDING APPLICATION LEVEL DEVICE TRANSPARENCY VIA DEVICE DEVIRTUALIZATION - Methods and apparatuses are provided for providing application level device transparency via device devirtualization. A method may include providing a devirtualization server driver on a host system. The method may further include receiving, at the devirtualization server driver, a request from a devirtualization client driver on a guest system for access to a physical device implemented on the host system. The request may be associated with a guest application on the guest system. The method may additionally include causing the guest application to be provided with access to directly control the device as if the device were present on the guest system without implementing a driver specific to the device on the guest system. Control of the device may be concurrently shared between the guest application and the host system. A corresponding apparatus is also provided. | 2013-08-08 |
20130204925 | Methods And Systems For Fast Account Setup - Methods and systems are provided for collecting, storing, and transmitting account information in a matchable form, and for using this information to quickly set up accounts. Account information is maintained and shared between one or more client devices and an intermediate server. Account information can be reconciled locally to determine whether to add or enable an active account or an account proxy to a client device. Account proxies can be quickly enabled by a single user action. The methods and systems allow enabled accounts and account proxies to be removed from a first client device without propagating the deletion to a second client device. | 2013-08-08 |
20130204926 | INFORMATION PROCESSING SYSTEM, INFORMATION PROCESSING DEVICE, CLIENT TERMINAL, AND COMPUTER READABLE MEDIUM - There is provided an information processing system including: a client terminal; and a management server that manages the client terminal, wherein: the client terminal includes a transmission section that transmits notification data containing information denoting an operation state of at least an own machine; and the management server includes: a reply section that sends back reply information in return for notification data from the client terminal; and an information insertion section that inserts task information about a task of the client terminal into the reply information. | 2013-08-08 |
20130204927 | VIDEO STREAM MANAGEMENT FOR REMOTE GRAPHICAL USER INTERFACES - Embodiments enable display updates other than a video stream in a graphical user interface (GUI) to be rendered, encoded, and transmitted exclusive of the video stream. A virtual machine generates a GUI that includes an encoded video stream and other display updates. A virtual graphics processing unit (VGPU) stack associated with the VM renders the other display updates of the GUI to a framebuffer. The rendered display updates are encoded and transmitted to a client for display. The encoded video stream, or a modified (e.g., reduced bit rate) version of the encoded video stream, may be transmitted to the client, such that the client can display the encoded video stream within the GUI. For example, the encoded video stream may be selectively transmitted to the client based on the performance capabilities of the client. | 2013-08-08 |
20130204928 | SYSTEM AND METHOD FOR INFORMATION MANAGEMENT - A system for information management includes a remotely accessible server configured for receiving a request from a user for a service provided by at least one designated service provider and for receiving a response from the at least one designated service provider; means controlled by the server for providing a first user interface that allows the user to download a preset template, to modify the template with user specific content, and to select the at least one designated service provider with a predetermined set of criteria; means controlled by the server for generating a virtual content module associated with the user that contains the modified template; means controlled by the server for transmitting a first notification message to the at least one designated service provider. | 2013-08-08 |
20130204929 | Information Generation System And Method Therefor - Provided are an information generation system and a method therefor capable of generating an operating system corresponding to a request from a user, wherein among operating system resource information managed by a server device, a desired operating system constituting component can be selectively transmitted to a client device. Among the operating system resource information and application resource information managed by a server device | 2013-08-08 |
20130204930 | VIRTUAL PRESENCE MODEL - In one embodiment of the invention, a system provides virtual presence model in servers. An embodiment of the invention also has video streaming capability and can allow a user to select which video to watch as the large, central video with some statistics and data on Side portions of the user interface. | 2013-08-08 |
20130204931 | METHOD AND DEVICE FOR GUARANTEEING PERFORMANCE IN STREAM DATA PROCESSING - A method and device for guaranteeing performance of stream data processing wherein a latency guarantee and a processing accuracy guarantee are possible while ensuring a real-time property. An execution system determination unit evaluates an amount of data currently present in a queue of an input data reception unit, calculation time, and the processing accuracy. Then, during a query process, if the amount of data in the queue increases for some reason, and is likely to be larger than the requested latency, the execution system determination unit changes the system to a calculation system by which the latency can be reduced within a range that a final quality can be allowed, on the basis of the evaluation result. Under the condition that the accuracy is reduced, if the latency is likely to be greatly lower than the requested latency, the system changes to a calculation system having a higher processing accuracy. | 2013-08-08 |