25th week of 2013 patent applcation highlights part 71 |
Patent application number | Title | Published |
20130159281 | EFFICIENT QUERYING USING ON-DEMAND INDEXING OF MONITORING TABLES - Embodiments are directed to replicating database tables for efficient data querying and to using a background task to update a database index table on a periodic basis. In one scenario, a computer system accesses an existing, original time-based database table that includes various entities and properties for each entity. Each entity also includes a time stamp value. The computer system receives an indication that the new index table is to be indexed according to a user-specified property and sorts the new index table based on both the value of the user-specified property and the time stamp value of the entity to which the user-specified property belongs. The computer system then periodically copies the entities and associated properties of the original time-based database table into a new database index table. | 2013-06-20 |
20130159282 | DETERMINING A DENSITY OF A KEY VALUE REFERENCED IN A DATABASE QUERY OVER A RANGE OF ROWS - A method, apparatus and program product that determine a density of a key value referenced in a database query over at least one range of rows, and utilize the determined density to optimize the database query. By doing so, the density of various key values may be determined and compared, and a bit map may be generated over the range of rows of the key value that is denser, resulting in a reduction of resources to build and use the bit map. Moreover, from the bit map over the range of rows to be selected after using the determined density, dense regions may be identified that can be used to optimize block I/O's according to the number of rows to be selected based on the query. | 2013-06-20 |
20130159283 | INTERMEDIATE RESULT SET CACHING FOR A DATABASE SYSTEM - A method for storing intermediate result sets in a database is provided. An access plan for a single query for accessing data stored in the database system is received. An intermediate result set is generated during execution of the access plan. A value of an intermediate result set rating of the intermediate result set is determined during execution of the access plan at runtime of the query for determining if the intermediate result set, generated during the execution of the access plan, is to be stored. Based on determining that the value of the intermediate result set rating meets a predefined criterion, the determined intermediate result set is stored for a longer period of time than the runtime of the query as a stored intermediate result set. | 2013-06-20 |
20130159284 | AUTONOMIC REFRESH OF A MATERIALIZED QUERY TABLE IN A COMPUTER DATABASE - A method autonomically refreshes a materialized query table (MQT) in a computer database to improve database performance and utility. In preferred embodiments, the query optimizer autonomically initiates a refresh of MQT depending on an estimated time for the query to access the base tables. In other preferred embodiments, the query optimizer estimates the time for the query to access the base tables and compares it to the estimated time to refresh the MQT to determine whether to refresh the MQT and run the query over the MQT rather than the base tables. | 2013-06-20 |
20130159285 | MANY-CORE ALGORITHMS FOR IN-MEMORY COLUMN STORE DATABASES - A pattern can be identified in at least part of a query whose definition is received in a query request. The identified pattern can be matched with a set of pre-defined patterns, each of which has associated therewith at least one pre-compiled query execution sub-component of a plurality of pre-compiled query execution sub-components retained in a library. A plan for executing the query can be generated, for example by incorporating the pre-compiled query execution sub-component associated with the matched pattern into the plan based on a pseudo code representation of the plan derived from the definition. | 2013-06-20 |
20130159286 | GENERATION OF A QUERY PLAN FOR ACCESSING A DATABASE - A method of generating a query plan for accessing a database, comprising: receiving (S | 2013-06-20 |
20130159287 | DATABASE QUERY OPTIMIZER THAT TAKES NETWORK CHOICE INTO CONSIDERATION - In a networked computer system that includes multiple nodes and multiple networks interconnecting the nodes, a database query optimizer takes network choice into consideration when optimizing a query. The query optimizer logs historical information for queries that includes network information. A network monitor determines network characteristics of the multiple networks. The query optimizer then selects a network for a query based on the network characteristics, and optionally based on the historical information as well. The result is a query optimizer that takes network choice into consideration, thereby providing a query that is optimized according to the characteristics of the networks. | 2013-06-20 |
20130159288 | INFORMATION GRAPH - Disclosed are electronic systems and techniques that generate an information graph with associated validation measures related to information obtained from data sources for providing recommendations about a potential candidate for a financial product. Search results are used to gather data associated with a potential client for loan offers. Levels of certainty are initiated from the associations and used to modify the search criteria or identifying data for searching further. A credit worthiness score related to the potential client is configured based on the information graph. | 2013-06-20 |
20130159289 | System, Method and Computer Program Product for a Behavioral Database Providing Quantitative Analysis of Cross-Border Policy Process and Related Search Capabilities - A system, method, or computer program product for translating non-quantitative, text-based data into a quantitative risk management tool(s) including: receiving, by a computer processor(s), non-quantitative data relating to cross-border public policy; receiving, by the processor(s), at least one tag relating to said non-quantitative data; storing, by the processor(s), said non-quantitative data and said at least one tag in a database; and providing, by the processor(s), quantitative risk management tools designed to provide customized, automatic daily graphical illustrations of policy activity levels on a cross-border basis using concepts and other meta-tagging tools to generate graphs. Tools may mining data to extract quantitative and graphical information from stored, tagged non-quantitative data and may semantically search those documents as well as assess correlations and covariances of cross-border policy processes, and deliver quantitative and/or graphical output results. | 2013-06-20 |
20130159290 | INTELLIGENT RESULTS BASED ON DATABASE QUERIES - Information may be presented to a user by using a first application to receive a character stream of one or more noncompletion characters. The noncompletion characters indicate that additional characters may be received. The character stream is exchanged with a host that analyzes the character stream to generate results that are responsive to the user's predicted interest. Results are received and displayed so that the user may select one of the results to launch a code segment related to the selected result. | 2013-06-20 |
20130159291 | RANKING SEARCH RESULTS USING WEIGHTED TOPOLOGIES - Identifiers of items generated in response to a query are each ranked in a way that considers the other identified items. Topologies are generated that correspond to features of the identified items. Each topology may be a Markov chain that includes a node for each identified item and directed edges between the nodes. Each directed edge between a node pair has an associated transition probability that represents the likelihood that a hypothetical user would change their preference from a first node in the pair to the second node in the pair when considering the feature associated with the topology. The topologies are weighted according to the relative importance of the features that correspond to the topologies. The weighted topologies are used to generate a stationary distribution of the identified items, and the identified items are ranked using the stationary distribution. | 2013-06-20 |
20130159292 | EFFICIENT DOCUMENT PROCESSING SYSTEM AND METHOD - A document processing system and method are disclosed. In the method local scores are incrementally computed for document samples, based on local features extracted from the respective sample. A global score is estimated for the document based on the local scores currently computed, i.e., on fewer than all document samples. A confidence in a decision for the estimated global score is computed. The computed confidence is based on the local scores currently computed and, optionally, the number of samples used in computing the estimated global score. A classification decision, such as a categorization or retrieval decision for the document is output, based on the estimated score when the computed confidence in the decision reaches a threshold value. | 2013-06-20 |
20130159293 | GENERATING A SUPPLEMENTAL DESCRIPTION OF AN ENTITY - A statistically overrepresented token in the descriptions of users associated with a target entity may be descriptive of the target entity. This may be true regardless of whether a primary description of the entity includes the overrepresented token. Accordingly, the entity description machine may access multiple descriptions of multiple users associated with the target entity. A portion of the multiple descriptions may each include a token descriptive of the target entity and of a subset of the multiple users. The entity description machine may determine that the token is overrepresented among the tokens within the multiple descriptions and generate a supplemental description of the target entity, where the supplemental description includes the overrepresented token. Once the supplemental description is generated, the entity description machine may use the supplemental description in referencing the target entity. | 2013-06-20 |
20130159294 | SYSTEMS AND METHODS FOR IMPROVING THE RANKING OF NEWS ARTICLES - A system ranks results. The system may receive a list of links. The system may identify a source with which each of the links is associated and rank the list of links based at least in part on a quality of the identified sources. | 2013-06-20 |
20130159295 | METHOD FOR IDENTIFYING AND RANKING NEWS SOURCES - A search engine and/or news aggregator considers events and stories described in electronic documents, a location of a searcher/reviewer, and a situs associated with content of the document to determine how/if they should be presented to users. | 2013-06-20 |
20130159296 | ACTIVITIES BASED DYNAMIC DATA PRIORITIZATION - A system, and computer program product for activity based dynamic data prioritization are provided in the illustrative embodiments. A user activity corresponding to a user is selected. A query is constructed corresponding to the user activity. The query is executed on a data source to obtain a result set of data. A prioritization rule is constructed using a feature of the query and a policy. Data items in the result set of data are prioritized according to the prioritization rule to form prioritized data. The prioritized data is presented relative to the user activity. | 2013-06-20 |
20130159297 | ACTIVITIES BASED DYNAMIC DATA PRIORITIZATION - A method for activity based dynamic data prioritization is provided in the illustrative embodiments. A user activity corresponding to a user is selected. A query is constructed corresponding to the user activity. The query is executed on a data source to obtain a result set of data. A prioritization rule is constructed using a feature of the query and a policy. Data items in the result set of data are prioritized according to the prioritization rule to form prioritized data. The prioritized data is presented relative to the user activity. | 2013-06-20 |
20130159298 | SYSTEM AND METHOD PROVIDING SEARCH RESULTS BASED ON USER INTERACTION WITH CONTENT - The present disclosure is directed to providing search results based on user interaction with content. A server receives identification of a plurality of clicks of encoded uniform resource locator (URL) links and identifies, for each of the plurality of clicks, data about a user who clicked an encoded URL link and traffic data associated with a device from which the user clicked the encoded URL link. The server may store a record comprising data about the user and traffic data associated with each click. The server may determine, based on the records, a relevancy score for each content identified from decoding the encoded URL links. The server may communicate, responsive to receiving a request to search content based on a keyword, a set of search results based on the keyword and the relevancy score. | 2013-06-20 |
20130159299 | USER INTERFACE METHODS AND SYSTEMS FOR SELECTING AND PRESENTING CONTENT BASED ON USER RELATIONSHIPS - A user-interface method of selecting and presenting a collection of content items based on user navigation and selection actions associated with the content is provided. The method includes associating a relevance weight on a per user basis with content items to indicate a relative measure of likelihood that the user desires the content item. The method includes receiving a user's navigation and selections actions for identifying desired content items, and in response, adjusting the associated relevance weight of the selected content item and group of content items containing the selected item. The method includes, in response to subsequent user input, selecting and presenting a subset of content items and content groups to the user ordered by the adjusted associated relevance weights assigned to the content items and content groups. | 2013-06-20 |
20130159300 | Computer-Implemented System and Method for Clustering Similar Documents - A computer-implemented system and method for clustering similar documents is provided. Concepts are identified for a set of documents and occurrence frequencies are determined for each concept in the documents set. A distance quantifying a similarity for each of the documents in the set with one or more clusters of documents is calculated. Each document is mapped to at least one of the one or more document clusters. | 2013-06-20 |
20130159301 | Electronic Device, Recording Medium Management Method and Program - A non-transitory computer-readable medium having embodied thereon a program for implementing functions of managing a recording medium in an electronic device, includes a recording medium management module that includes: an acquisition module configured to acquire an upper limit to the number of recording media registered in the electronic device; and a registering module configured to register the recording medium in which the program is installed in the electronic device such that the acquired upper limit is not exceeded. The recording medium management module may link date and time information to a recording medium identifier identifying the recording medium in which the program is installed, and register the information and the identifier as linked in a management database used to manage the recording medium. | 2013-06-20 |
20130159302 | INSTANT DYNAMIC STRATEGY SYSTEM AND METHOD - An instant dynamic strategy method is provided for dynamically providing a strategy according to external sensed information. The method includes receiving external sensed information; analyzing the sensed information so as to generate target data and conditional data according to user requirements; and transmitting the target data and the conditional data to an external dynamic strategy module such that the dynamic strategy module collects and analyzes strategic data according to the target data and the conditional data so as to generate a strategy. Compared with prior art that provides strategies based on fixed databases and fixed strategic rules, the present invention takes into account external information so as to achieve a desired strategic effect. | 2013-06-20 |
20130159303 | COMPUTER SYSTEM, DATA RETRIEVAL METHOD AND DATABASE MANAGEMENT COMPUTER - A computer system, comprising: a computer for outputting a result in response to a request; and a storage system for storing data output based on the request, the computer including: a request reception module for receiving the request; a processing procedure generation module for generating a plurality of processing procedures including an order of access to the data stored in the plurality of storage devices; a data division module for dividing the data; an information obtaining module for obtaining load information indicating a load condition of the storage system; an allotment determination module for determining, based on the obtained load information, allotments for allocating the divided data to be processed by the generated plurality of processing procedures; and a processing execution module for executing, based on the determined allotments, the generated plurality of processing procedures in parallel. | 2013-06-20 |
20130159304 | METHOD AND SYSTEM FOR PROVIDING STORAGE DEVICE FILE LOCATION INFORMATION - A method and system are disclosed that permit a host application to obtain cluster location data, for example logical addresses associated with the clusters of a file, and to allow a host application to communicate the logical block address mapping information to firmware of a storage device. The method includes the host transmitting one or more clusters or partial clusters having a signature to the storage device where the storage device knows or has been instructed by the host to look for the signature. The storage device may receive clusters having a signature and, responsive to a host request, return logical address information to a host for the location in the storage device of the marked clusters. The host may parse a data structure on the storage device to obtain remaining cluster location information using a file's first cluster location or may request that the storage device return the cluster location information. | 2013-06-20 |
20130159305 | Entity Clustering via Data Services - A method is provided for forming an entity cluster. In this method, a plurality of entities found in one or more data sources are identified. An entity may represent a word or a phrase found in the one or more data sources. The plurality of entities may then be organized into groups, where each group has a master entity and a set of subordinate entities. The groups are formed using a first comparison criteria. Then, using a second comparison criteria, a first group is associated with a second group. The second comparison criteria may compare the master entities associated with the first and second groups. Based on the association between the first group and the second group, the method can then determine that the first entity is related to the second entity. | 2013-06-20 |
20130159306 | System And Method For Generating, Updating, And Using Meaningful Tags - A system and method for generating tag glossaries and use thereof is provided. A set of tags is accessed. Each tag is associated with a glossary that includes one or more terms and definitions for the terms. A new tag is generated and a new glossary is generated for the new tag based on the glossaries associated with the set of tags. The tag glossaries can be used to provide context for documents associated with the tags, to determine appropriate tags for untagged documents, to help in search for other documents, and to build indices for documents or collections of documents. | 2013-06-20 |
20130159307 | DIMENSION LIMITS IN INFORMATION MINING AND ANALYSIS - Provided are methods, systems, and computer readable media for user interaction with database methods and systems. In an aspect, a user interface can be generated to permit dynamic display generation to view data. The system can comprise a visualization component to dynamically generate one or more visual representations of the data to present in the state space. | 2013-06-20 |
20130159308 | Interactive Global Map - Systems and methods are provided for generating an interactive map for displaying and analyzing a compressive intellectual property landscape within a given field. Based on content analysis of relevant patents and patent applications, this prior art map provides a systematic review of vast quantities of data, thereby allowing the user to discern critical technology and product trends, prior art references, and the strategies of both leading and emerging competitors. Each patent represented on the map can be analyzed within the context of the prior art landscape to uncover novel features, strong claims, and business and technology trends. This comprehensive view can provide a foundation for creating effective corporate strategies in-tune with the realities of the intellectual property terrain. | 2013-06-20 |
20130159309 | METHOD AND APPARATUS FOR PREDICTING OBJECT PROPERTIES AND EVENTS USING SIMILARITY-BASED INFORMATION RETRIEVAL AND MODELING - Method and apparatus for predicting properties of a target object comprise application of a search manager for analyzing parameters of a plurality of databases for a plurality of objects, the databases comprising an electrical, electromagnetic, acoustic spectral database (ESD), a micro-body assemblage database (MAD) and a database of image data whereby the databases store data objects containing identifying features, source information and information on site properties and context including time and frequency varying data. The method utilizes a model comprising application of multivariate statistical analysis and principal component analysis in combination with content-based image retrieval for providing two-dimensional attributes of three dimensional objects, for example, via preferential image segmentation using a tree of shapes and to predict further properties of objects by means of k-means clustering and related methods. | 2013-06-20 |
20130159310 | METHOD AND APPARATUS FOR PREDICTING OBJECT PROPERTIES AND EVENTS USING SIMILARITY-BASED INFORMATION RETRIEVAL AND MODELING - Method and apparatus for predicting properties of a target object comprise application of a search manager for analyzing parameters of a plurality of databases for a plurality of objects, the databases comprising an electrical, electromagnetic, acoustic spectral database (ESD), a micro-body assemblage database (MAD) and a database of image data whereby the databases store data objects containing identifying features, source information and information on site properties and context including time and frequency varying data. The method comprises application of multivariate statistical analysis and principal component analysis in combination with content-based image retrieval for providing two-dimensional attributes of three dimensional objects, for example, via preferential image segmentation using a tree of shapes and to predict further properties of objects by means of k-means clustering and related methods. By way of example, one of a criminal activity and a fraudulent activity event, an intrusion event and a fire event and residual objects may be predicted and located and qualified such that, for example, properties of the residual objects may be qualified, for example, via black body radiation and micro-body databases including charcoal assemblages. | 2013-06-20 |
20130159311 | SYSTEM AND METHODS FOR GENERATION OF A CONCEPT BASED DATABASE - A method for generating a concept database respective of a plurality of multimedia data elements (MMDEs) comprises generating a plurality of items from a received MMDE of the plurality of MMDEs; determining the items that are of interest for signature generation; generating at least one signature responsive to at least one item of interest of the received MMDE of the plurality of MMDEs; clustering a plurality of signatures received from the signature generator responsive of the plurality of MMDEs; reducing the number of signatures in each cluster to a create a signature reduced cluster (SRC) of the cluster; associating metadata with the SRC to a concept structure comprised of a plurality of SRCs and their associated metadata; and generating at least one index for mapping the received MMDE to at least one concept structure, wherein the concept database includes concept structures and the generated indices for the plurality of MMDEs. | 2013-06-20 |
20130159312 | 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). | 2013-06-20 |
20130159313 | Multi-Concept Latent Semantic Analysis Queries - A method includes accessing text, identifying a plurality of terms from the text, determining a plurality of term vectors associated with the identified plurality of terms, and clustering the determined plurality of term vectors into a plurality of clusters, the plurality of clusters comprising a first and a second cluster, the first and second clusters each comprising two or more of the determined term vectors. The method further includes creating a first pseudo-document according to the first cluster, creating a second pseudo-document according to the second cluster, identifying a first set of terms associated with the first cluster using latent semantic analysis (LSA) of the first pseudo-document, identifying a second set of terms associated with the second cluster using LSA of the second pseudo-document, and combining the first and second sets of terms into a list of output terms. | 2013-06-20 |
20130159314 | PERSONALIZED BOOKMARKS FOR SOCIAL NETWORKING SYSTEM ACTIONS BASED ON USER ACTIVITY - A social networking system provides a personalized set of bookmarks to a user based on the user's interactions with the bookmarks and/or the items associated with the bookmarks. The personalized set of bookmarks is grouped by category, and the categories are ordered in accordance with rankings for the categories. The rankings for the categories are determined based on the highest ranked item from each category of item, and the ranking of the items is determined based on the user's interactions with the bookmarks and/or associated items. | 2013-06-20 |
20130159315 | METHODS FOR PREFIX INDEXING - According to one aspect of the invention, in response to one or more terms to be indexed, each of the terms is indexed in a regular index. In addition, for each of the terms having multiple characters, at least one prefix portion of the term is indexed in a prefix index, where the regular index is used for regular searches and the prefix index is used for prefix searches without having to combine a plurality of postings lists of the regular index at the point in time. | 2013-06-20 |
20130159316 | DISAPPEARING INDEX FOR MORE EFFICIENT PROCESSING OF A DATABASE QUERY - A disappearing index allows faster processing of a database query without the startup time of a prior art sparse index. The disappearing index starts as a full index but is trimmed of index values that point to a row in the table that is not selected by the query. Thus the traditional index disappears as it becomes a sparse index tailored to the query. The query is able to execute faster using the now sparse index since the target database table is not accessed for duplicate values in the base table of the query. The query optimizer may determine to use a disappearing index based on estimates of the number of duplicate values in the base table. When the query is complete, the created disappearing table may be discarded or used for other queries that match the selection of the query that created the disappearing index. | 2013-06-20 |
20130159317 | HIGH PRECISION SET EXPANSION FOR LARGE CONCEPTS - A set expansion system is described herein that improves precision, recall, and performance of prior set expansion methods for large sets of data. The system maintains high precision and recall by 1) identifying the qualify of particular lists and applying that quality through a weight, 2) allowing for the specification or negative examples in a set of seeds to reduce the introduction of bad entities into the set, and 3) applying a cutoff to eliminate lists that include a low number of positive matches. The system may perform multiple passes to first generate a good candidate result set and then refine the set to find a set with highest quality. The system may also apply Map Reduce or other distributed processing techniques to allow calculation in parallel. Thus, the system efficiently expands large concept sets from a potentially small set of initial seeds from readily available web data. | 2013-06-20 |
20130159318 | Rule-Based Generation of Candidate String Transformations - Candidate string transformations may be generated from applying applicable transformation rules from a rules index. Candidate string transformations may be eliminated based on a score associated with the candidate string transformation. The score may be based on probabilistic values associated with the applied applicable transformation rules. | 2013-06-20 |
20130159319 | LIKEFARM DETERMINATION - A plurality of web documents that include indicators corresponding to one or more selectable like objects may be obtained. A corresponding web domain associated with each of the plurality of obtained web documents may be determined. A domain total like object count of the indicators corresponding to the one or more selectable like objects may be determined for each one of the obtained plurality of web documents, for each determined corresponding web domain. A candidate group of the corresponding web domains may be determined based on a comparison of a predetermined first threshold value with one or more of the domain total like object counts. A likefarm domain confidence score may be determined for each one of a second group of the corresponding web domains based on a decision tree function that is based on a plurality of domain attributes. | 2013-06-20 |
20130159320 | CLICKTHROUGH-BASED LATENT SEMANTIC MODEL - There is provided a computer-implemented method and system for ranking documents. The method includes identifying a number of query-document pairs based on clickthrough data for a number of documents. The method also includes building a latent semantic model based on the query-document pairs and ranking the documents for a search based on the latent semantic model. | 2013-06-20 |
20130159321 | METHOD AND APPARATUS FOR OPTIMIZING ACCESS PATH IN DATABASE - Apparatuses and methods for optimizing access path are provided. Execution of a query statement is sampled to obtain the information about a plurality of executing instances, the information about each executing instance comprises the literal value of the query statement in the instance and the filter factor corresponding to the literal value. The plurality of instances are grouped into a plurality of groups based on the filter factors corresponding to the literal values. The average filter factor of each group and the occurrence frequency of the group are obtained. The candidate access path created for the average filter factor of each group is accordingly obtained, and by taking the occurrence frequencies as weights, the weighted execution cost of each candidate access path is calculated for each group. The candidate access path with the minimum sum of the weighted execution costs for all groups is determined as the optimal access path. | 2013-06-20 |
20130159322 | CONTACT RECOMMENDATION SYSTEM FOR A USER COMMUNICATION - Techniques are described for allowing a first user to efficiently send contact information to a second user using a messaging application such as email programs, instant messaging programs, social media websites, or chat rooms. The messaging application may maintain a name database that stores names relevant to a first user. When the first user then inputs a name into a user communication (e.g., an email, instant message, or voice message), the messaging application provides the first user with the names stored in the name database that match the name in the user communication. Additionally, the messaging application may use ranking data associated with each matched name to order the names according to relevance. The first user can then select the correct name (if there are multiple matched names) which prompts the messaging application to automatically send contact information to the intended recipient of the user communication. | 2013-06-20 |
20130159323 | RECOMMENDING TAGS BASED ON USER RATINGS - A method of recommending tags for user includes receiving a current rating of current user on current objects; determining a candidate tag set based on the current user and the current rating; ordering each candidate tag in the candidate tag set based on index value thereof; and recommending tags for the current user based on the ordering. | 2013-06-20 |
20130159324 | Multi-Source Multi-Step Search in Enterprise Software Systems - A search query is received that is associated with two or more data sources so that a source-specific query is generated for each data source using a data source definition associated with the corresponding data source and the search query. Thereafter, searches are executed for a first set of data sources using the corresponding source-specific queries. These search results from the first set of data sources are consolidated. In addition, searches are executed for a second set of data sources using the corresponding source-specific queries. These search results from the second set of data sources are then consolidated with the consolidated search results from the first set of data sources. In some implementations, at least one search comprises a main search followed by a sub-search that filters results from the main search. Related apparatus, systems, techniques and articles are also described. | 2013-06-20 |
20130159325 | BI-MODEL RECOMMENDATION ENGINE FOR RECOMMENDING ITEMS AND PEERS - A networked peer and item recommendation system makes recommendations to users such as documents of interest and peers with whom the users may want to connect. User profile information is maintained in a profiles database. A log enables the collection of user behavior information. A cluster filtering algorithm determines a cluster that a querying user belongs to. A collaborative filtering algorithm locates other users having implicit and explicit profiles in the database that are similar to the profile of the querying user. A dynamic expert verification algorithm is associated with the collaborative filtering algorithm to verify the qualifications of users and produce bias towards users with higher quality interactions. A search engine returns items based on a keyword provided by the querying user. A sorting algorithm sorts the items returned by the cluster filtering algorithm, collaborative filtering algorithm and search engine for presentation to the querying user. | 2013-06-20 |
20130159326 | SOLUTION MONITORING SYSTEM - A solution monitoring system is provided for gathering, filtering, and analyzing information associated with solutions for managing monitoring, upgrades, and migrations. Telemetry may be recorded for various types of solution events and various properties of solutions as part of an add-in intelligence. Furthermore, add-in management tools are provided for administrators and end users. | 2013-06-20 |
20130159327 | APPARATUS AND METHOD FOR VISUALIZING DATA - Proposed is a data visualizing apparatus for visualizing data as effectual information using a correlation between forensic data collected from various sources. The proposed data visualizing apparatus may visualize, as effectual information, single-source single-data, single-source multi-data, and multi-source multi-data. | 2013-06-20 |
20130159328 | Fast Streams and Substreams - Various embodiments provide data structures and algorithms for efficiently computing a time ordered stream that is the combination of a time ordered substream for individual persons of interest. In addition, various embodiments provide an approach for identifying how many changes of interest have happened to a particular stream since it was last viewed. | 2013-06-20 |
20130159329 | KNOWLEDGE MANAGEMENT SYSTEM - The present design is a knowledge management system including a mapping engine configured to receive survey responses for a survey campaign completed by a survey participant and a set of mapping rules containing rules configured to map the survey responses to a set of knowledge resources specific to the activities, interactions and behaviors of a survey participant based upon the survey responses. The knowledge resources include information helpful to the survey participant to carry out a job related expected behavior or duty of the survey participant. The mapping engine is further configured to receive information about the activities and interactions of a survey participant, survey campaign, and knowledge resources that may be stored on a database, and transmit information about the set of knowledge resources to a designated entity, such as the survey participant or a system administrator. | 2013-06-20 |
20130159330 | System and Methods for Tasking, Collecting, and Dispatching Information Reports - A system for tasking, collecting, storing, and dispatching time-sensitive location-based information reports via an electronics communication network, comprising a central relational database management system, multiple computer-implemented services, and applications residing on computer-based mobile communication devices. The system provides: methods to convey the value of specific types of geospatial time-sensitive information from a world-wide population of information consumers to a world wide population of “eye witness” reporters (i.e. suppliers); methods to collect payment from the consumers and, in turn, pay the suppliers of valid information reports that satisfy a consumers' specific criteria; methods to distribute streams of geospatial-based information reports to geospatial viewing applications; methods to aggregate information demand from multiple information-tasking subscriptions; methods to subscribe and receive alerts with regards to tasking subscriptions; and methods to validate and score information reports. | 2013-06-20 |
20130159331 | SYSTEMS AND METHODS FOR DETERMINING RELATED PLACES - Techniques for providing location-based recommendations are described. Some embodiments provide a Location-Based Recommendation System (“LRBS”) that provides recommendations regarding physical places based on content items, such as Web pages, user reviews, directory listings, or the like, that describe or otherwise reference those places. In one embodiment, the LBRS is configured to, in response to an indication of a first place, determine one or more other places that are similar to the first place, and then provide indications of the determined places as recommendations to a user or other entity. In another embodiment, the LBRS is configured to, in response to an indication of a user, determine one or more places that may be of interest to the user, and then provide indications of the determined places as recommendations. In some embodiments, the LBRS may determine recommendations based on content vectors associated with places and/or users. | 2013-06-20 |
20130159332 | MANAGEMENT SYSTEM, MANAGEMENT APPARATUS, AND MANAGEMENT METHOD FOR ELECTRONIC DEVICE - A collection unit collects attribute information of each of a plurality of electronic devices, and registers the collected attribute information in mounted device information correspondingly to a mounting position of the electronic device in a management system. A determination unit refers to device definition information in which attribute information of each electronic device mounted on the management system is registered correspondingly to a mounting position, determines as a comparison object position a mounting position in which the attribute information registered in the mounted device information is not matched with the attribute information registered in the device definition information and, when a plurality of comparison object positions are present, determines whether the attribute information of the mounted device information corresponding to one comparison object position is matched with the attribute information of the device definition information corresponding to another comparison object position. | 2013-06-20 |
20130159333 | SYSTEM AND METHOD FOR DETERMINING SIMILARITIES BETWEEN ENTITIES - Provided are a system and method to determine similarities. The method includes gathering metadata from at least one posting by a First User on a first Social Network to define at least one First Field associated with at least one First Entity, each associated First Field having a value. The method evaluates responses to the posting by at least one Third Party, and in response to the Third Party using one or more of the First Fields, increments the value of each used First Field. An indication of the values of each First Field associated with each First Entity is provided, the indicated values permitting a determination of similarity to at least one Second Entity querying for at least two Fields. An associated system for determining similarity is also disclosed. | 2013-06-20 |
20130159334 | METHOD FOR IDENTIFYING AND EXTRACTING UNDESIRABLE ACTIVITIES OF MOTORISTS FROM DMV AND INSURANCE CARRIER DATA STREAMS | 2013-06-20 |
20130159335 | SYSTEMS AND METHODS FOR PROVIDING SOCIAL ELECTRONIC LEARNING - A social electronic learning system, including a plurality of computing devices for communicating with a plurality of users in an educational community, and at least one server in communication with each of the plurality of computing devices, each server in communication with at least one data storage device configured to host a plurality of electronic portfolios, each electronic portfolio associated with one or more users of the plurality of users in the educational community, wherein each server is configured such that one or more users may associate one or more digital items with each electronic portfolio, and the plurality of users may take actions on the digital items in each electronic portfolio depending on authorization criteria. | 2013-06-20 |
20130159336 | CONDITION MATCHING SYSTEM, LINKED CONDITIONAL MATCHING DEVICE, AND CONDITION MATCHING PROCESSING METHOD - A condition matching system is provided which can specify users who match predetermined conditions, in the state where various categories of user information are held decentrally, while suppressing processing load and network load. User ID supplying means | 2013-06-20 |
20130159337 | METHOD, APPARATUS AND COMPUTER READABLE RECORDING MEDIUM FOR A SEARCH USING EXTENSION KEYWORDS - Disclosed herein are a method, an apparatus, and a computer readable recording medium for a search using extension keyword. According to an aspect of the present invention, there is provided a method for a search using extension keyword, the method including mapping search keywords transmitted from a user terminal to at least one concept keyword, extending the concept keyword to plurality of concept keywords having association with each other so that a concept keyword extension data-set is generated, and generating extention keywords corresponding to the concept keyword extension data-set. | 2013-06-20 |
20130159338 | SYSTEM AND METHOD FOR PROVIDING A USER INTERFACE WITH SEARCH QUERY BROADENING - A system and method for providing a user interface with search query broadening is described. A query defining a search executable on potentially retrievable information is accepted. The query is parsed. A broadened query is provided. At least one of the broadened query and results of a search executed on the broadened query is presented. | 2013-06-20 |
20130159339 | Data Container Access in a Database System - A database system receives a request to access one of a plurality of data containers. Such request includes a file identification (ID) corresponding to the requested data container. Using this file ID, metadata associated with the requested data container is accessed. The metadata is stored in a page of page chain and such metadata identifies a location of the requested data container (so that it can be accessed). Thereafter, the metadata is used to enable access to the requested data container. The file ID in the request can encapsulate a page number and at least one index. This page number identifies a page in the page chain storing the metadata and the index identifies a location within the identified page where the metadata can be found. Related apparatus, systems, techniques and articles are also described. | 2013-06-20 |
20130159340 | QUOTE-BASED SEARCH - A user search for quotes attributable to people or information regarding the quotes is fulfilled by providing the relevant information from a quote index. The quote index is built from a data store comprising articles that include quotes given by people. Quotes are extracted from the articles along with the relevant attributes such as the keywords, topics and entities. The extracted keywords, topics and entities are indexed with unique identifiers. A quote index is built by storing the quotes along with the keywords, topics and related entities. Quotes or information associated with the quotes based on various criteria is retrieved and presented in different formats. | 2013-06-20 |
20130159341 | METADATA CACHE MANAGEMENT - Managing a cache includes determining from metadata of a received service request whether a cache data response may satisfy the request as a function of recognizing a cacheable method name specification within request metadata by a service provider associated with the request, and determining whether the request is an inquiry or a request as a function of comparing an update frequency specification or a time interval period to a value of a time parameter associated with the cacheable method name in the metadata, in order to decide if the request may be satisfied by the cached data. Aspects also include searching the cache for the data response if determined the data is cacheable and the request is an inquiry, and sending the request on to a service provider if the data response is not a cacheable response, or the request is an update request. | 2013-06-20 |
20130159342 | AUTOMATICALLY MAKING CHANGES IN A DOCUMENT IN A CONTENT MANAGEMENT SYSTEM BASED ON A CHANGE BY A USER TO OTHER CONTENT IN THE DOCUMENT - A content management system detects a change to one part of a document, and to generate a corresponding change in a different part of the same document. Dynamic inclusion rules define conditions that, when satisfied, allow automatically changing a link in a document to a new link when corresponding data in the document is added or changed. If a change corresponds to a defined dynamic inclusion rule, a corresponding query in the rule is evaluated according to the changes in the document. When there is enough information to run the query, the query is automatically executed in a background process. If there is a single link that satisfies the query, the document may be updated with the new link. If multiple links satisfy the query, the top ranked query result may be automatically selected, or the user may select which link should be included in the document. | 2013-06-20 |
20130159343 | Embedded Business Metadata - A methodology is disclosed for improving searches of a distributed Internet network. A distributed Internet network is searched for a particular information type, searching for a field identified using a predetermined identifier indicating that the field comprises information of the particular information type. When the field identified using the predetermined identifier is found, an association of the contents of the field with the search results is made, and repeated using the same predetermined identifier. Information of a particular information type may then be served in a field identified using a predetermined identifier that identifies the field as containing information of the particular information type. | 2013-06-20 |
20130159344 | DYNAMICALLY SPLITTING MULTI-TENANT DATABASES - An online service includes managed databases that include one or more tenants (e.g. customers, users). A multi-tenant database may be split between two or more databases while the database being split continues processing requests. For example, web servers continue to request operations on the database while content is being moved. After moving the content, tenant traffic is automatically redirected to the database that contains the tenant's content. | 2013-06-20 |
20130159345 | METHODS AND APPARATUSES FOR FACILITATING DETERMINATION OF AVAILABLE SPECTRUM - Methods and apparatuses are provided for facilitating determination of available spectrum. A method may include receiving a query originated by a white space device for an indication of available frequency spectrum at a location of the white space device. The method may further include determining whether the location of the white space device is within an area served by a first database. In an instance in which it is determined that the location of the white space device is not within the area served by the first database, the method may additionally include determining a second database and causing access information for the second database to be provided to the white space device. The determined second database may serve an area including the location of the white space device. Corresponding apparatuses are also provided. | 2013-06-20 |
20130159346 | COMBINATORIAL DOCUMENT MATCHING - Embodiments of the present invention disclose a method and system for combinatorial document matching. According to one embodiment, a target document and a plurality of source documents are received by the system. Thereafter, consolidated source document information associated with the plurality of source documents and permutated concept data affiliated with the target document are created. Based on comparisons of the permutated concept data and the consolidated source document information, a set of relevant documents from the plurality of source documents are determined. | 2013-06-20 |
20130159347 | AUTOMATIC AND DYNAMIC DESIGN OF CACHE GROUPS - A system and method is provided for automatic and dynamic adaptation of cache groups in a database system having one or more processors. The method includes analyzing a database query and determining if a set of predicates in a predicate pattern are suitable for inclusion in one or more cache groups, with the one or more cache groups having one or more cache tables; mapping value-based predicates in the predicate pattern to a filling column in the one or more cache tables; and mapping equi-join predicates in the predicate pattern to a referential cache constraint in the one or more cache tables. New cache groups can be created for predicate patterns occurring more frequently and existing cache groups can be deleted if the frequency of the predicate pattern falls below a predetermined threshold value. | 2013-06-20 |
20130159348 | Computer-Implemented Systems and Methods for Taxonomy Development - Systems and methods are provided for generating a set of classifiers. A location is determined for each instance of a topic term in a collection of documents. One or more topic term phrases are identified, and one or more sentiment terms within each topic term phrase. Candidate classifiers are identified by parsing words in the one or more topic term phrases, and a colocation matrix is generated. A seed row of the colocation associated with a particular attribute is identified, and distance metrics are determined by comparing each row of the colocation matrix to the seed row. A set of classifiers are generated for the particular attribute, where classifiers in the set of classifiers are selected using the distance metrics. | 2013-06-20 |
20130159349 | UNIFIED USER IDENTIFICATION WITH AUTOMATIC MAPPING AND DATABASE ABSENCE HANDLING - An identification system that may be used in heterogeneous computing environments provides a fail-free path to providing identifiers from a single canonical namespace. Objects or gateways requiring an identifier for access are accessed using an identifier for the canonical namespace. If an entity requests access using an identifier from another namespace, an external database is consulted to determine if a mapping exists for the identifier to another identifier the canonical namespace. If no mapping exists, or the external database is unavailable, then an identifier is automatically generated in the canonical namespace and is used for the access. An internal database is updated with the automatically generated identifier, providing a mechanism to add mappings without administrative intervention. To access resources requiring an identifier from another particular namespace, a canonical namespace identifier may be mapped to another identifier in the particular namespace, or a generic identifier may be used. | 2013-06-20 |
20130159350 | Sensor Fusion Interface for Multiple Sensor Input - The subject disclosure is directed towards a sensor fusion interface that enables interaction between one or more entities of a physical environment and a computerized device component. A plurality of sensor modules generate multiple sensor input data associated with one or more entities in an environment and store such data in a shared library in accordance with a uniform and common schema. The multiple sensor input data is refined until a certain level of accuracy is achieved. Using the sensor fusion interface, entity state data is extracted from the shared library and exposed to the computerized device component. | 2013-06-20 |
20130159351 | Asset Identity Resolution Via Automatic Model Mapping Between Systems With Spatial Data - Techniques for mapping between data models where objects represented in the data models include common physical objects or assets are provided. In one aspect, a method for mapping between data models, each of which describes a location of objects in a physical area includes the following steps. Common attributes are found in each of the data models. Location attributes are found among the common attributes in each of the data models, i.e., those attributes that describe the location of the objects in the physical area. The location attributes are used to identify a given one of the objects common to each of the data models, based on a placement of the given object by the data models at a same location (at a same time) in the physical area to establish a common identity of the object within the models. Attributes other than location attributes may then be mapped. | 2013-06-20 |
20130159352 | GENERATING SKETCHES SENSITIVE TO HIGH-OVERLAP ESTIMATION - A versioning system determines an amount by which a first collection and a second collection of data objects overlap. The system divides the first collection of data objects into m possibly overlapping groups of average size s and computes one combined hash result for each group. The system then constructs a first sketch vector with n elements based on the combined hash results. A respective element of the first sketch vector is selected, using a selection function, from the combined hash results that are computed with the hash function corresponding to the element's index. Next, the system receives a second sketch vector for the second collection of data objects, and determines a sketch-vector overlap between the first and second sketch vectors. The system then computes a data-object overlap between the first and second collections of data objects based on the sketch-vector overlap. | 2013-06-20 |
20130159353 | GENERATING A TEST WORKLOAD FOR A DATABASE - A method of transferring files in a data-processing network using a current node within the network includes reading an outbound content and outbound characteristics of an outbound file. An outbound message is created having outbound strings including a first set of the outbound strings representing the outbound characteristics and a second set of the outbound strings representing the outbound content. The outbound message is sent to a receiver node within the network. An inbound message is received from a sender node within the network. The inbound message has inbound strings including a first set of the inbound strings representing inbound characteristics and a second set of the inbound strings representing inbound content. An inbound file having the inbound content is stored, and the inbound characteristics are applied to the inbound file. | 2013-06-20 |
20130159354 | GENERATING REMOTELY ACCESSIBLE REPOSITORIES FROM LANGUAGE META-MODELS - Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for generating a repository comprising receiving a language meta-model; receiving annotations, each annotation including meta-data; annotating the language meta-model based on the annotations to provide an annotated language meta-model; and generating one or more repository modules based on the annotated language meta-model, the repository being defined based on the one or more repository modules. | 2013-06-20 |
20130159355 | CONFIGURABLE VIEWS FOR A DATABASE - According to some embodiments, a business enterprise platform may install a database associated with a customer of the business enterprise platform. The business enterprise platform may then provide to the customer at least one pre-defined configurable view of the information in the database. Moreover, customization of the pre-defined configurable view of the information in the database by the customer and/or a service provider may be automatically facilitated. | 2013-06-20 |
20130159356 | FIELD TRANSFORMATIONS FOR USER INTERFACE DATA ELEMENTS - A method and system, the method may include determining a user interface to be displayed, the user interface including a user interface data element associated with a service input parameter. Information about the service input parameter may be provided to a field transformation as a transformation input, and a transformation output may be received from the field transformation. | 2013-06-20 |
20130159357 | METHOD OF CONTEXT AWARE DATA-CENTRIC STORAGE FOR WIRELESS SENSOR NETWORKS - There is provided a method of context aware data-centric storage for dynamically changing a data storage range comprising: collecting data from entire sensor nodes, after establishing a data storage range of an entire sensor network, dividing areas, and transmitting a message of data storage range information to the entire sensor nodes by a base station; storing the collected data in a storage sensor node by determining whether there is a node responsible for storing the collected data to carry out operation depending on the determination result; determining whether the data storage has not been carried out for a period of time longer than a specified time in each sensor node after storing the data; and to determining whether the scale of invalid range is not smaller than Γ. | 2013-06-20 |
20130159358 | Forming Configuration Information about Components of Systems which Include Components for which Acquisition of Configuration Information is Restricted - A mechanism is provided for managing configuration information about components of a management target system. Identification is made of the existence of a first component from configuration information about one or more other components except the first component. Pattern data is stored for analogizing configuration information about a component for which acquisition of the configuration information is restricted, the pattern data being associated with a set of one or more conditions and attribute values. Pattern data is retrieved whose configuration information about a component related to the first component, among the one or more other components, satisfies the set of conditions. Analogized configuration information is formed about the first component using attribute values associated with the retrieved pattern data. | 2013-06-20 |
20130159359 | Dynamic Storage Tiering In A Virtual Environment - Various systems and methods for performing dynamic storage tiering in a virtual environment. For example, one method can involve identifying a location of a storage object within a virtual machine file, where the virtual machine file includes multiple storage objects. The method then involves detecting whether the storage object meets a criterion of a tiering policy. If the storage object meets the criterion, the storage object is moved from one tier of a multi-tier storage system to another tier of the multi-tier storage system. | 2013-06-20 |
20130159360 | INFORMATION PROCESSING APPARATUS, DATA STORAGE METHOD AND COMPUTER-READABLE RECORDING MEDIUM - An information processing apparatus includes a unit to store a partial data constituting a part of a processing target file to be stored on an object storage as a new object on an object storage, and to add object management information containing data extent information indicating a position and a size of the partial data within the processing target file, name information representing an object name of the new object and storage sequence information indicating a storage sequence of the new object to update history information on the processing target file; and a unit to read and output readout target data from the object storage on the basis of the readout target extent information and each object management information in the update history information related to the processing target file. | 2013-06-20 |
20130159361 | ACCESS TO A FILE SYSTEM WITH SEMANTIC INDEXING - A method for enabling the user of an application running on an information processing system to access a set of files organized into a directory tree, by means of an element of a human-machine interface comprising means of browsing within said tree from an initial position to a final position, wherein said initial position is determined based on a correlation between first semantic information provided by the application and second semantic information associated with the directories. | 2013-06-20 |
20130159362 | METHOD AND SYSTEM FOR PROVIDING STORAGE DEVICE FILE LOCATION INFORMATION - A method and system are disclosed that permit a host application to obtain cluster location data, for example logical addresses associated with the clusters of a file, and a host application to communicate the logical block address mapping information to firmware of a storage device. The method includes the host transmitting one or more clusters or partial clusters having a signature to the storage device where the storage device knows or has been instructed to look for the signature. The storage device may receive clusters having a signature and, responsive to a host request, return logical address information to a host for the location in the storage device of the marked clusters. The host may parse a data structure on the storage device to obtain remaining cluster location information using a file's first cluster location or may request that the storage device return the cluster location information. | 2013-06-20 |
20130159363 | METHOD FOR CONTROLLING FILE REQUEST ACCESS - A mirror file number corresponding to a file being requested is transmitted to a host OS. A determination is made as to whether or not caching is performed in the host OS, and reading of the data of the mirror file number is requested to a block device if it is determined that the data of the mirror file number that was transmitted is not cached. The block device acquires the memory address where the corresponding actual contents are stored, corresponding to the sector number, acquires the sequence number corresponding to the contents, changes the acquired sequence number, and reads the data of the acquired memory address. The read data is converted to data with a modified sequence number attached, and the data is provided to the host OS. If it is determined that the data is cached in the host OS, the cached data is provided. | 2013-06-20 |
20130159364 | PARALLEL LOG STRUCTURED FILE SYSTEM COLLECTIVE BUFFERING TO ACHIEVE A COMPACT REPRESENTATION OF SCIENTIFIC AND/OR DIMENSIONAL DATA - Collective buffering and data pattern solutions are provided for storage, retrieval, and/or analysis of data in a collective parallel processing environment. For example, a method can be provided for data storage in a collective parallel processing environment. The method comprises receiving data to be written for a plurality of collective processes within a collective parallel processing environment, extracting a data pattern for the data to be written for the plurality of collective processes, generating a representation describing the data pattern, and saving the data and the representation. | 2013-06-20 |
20130159365 | Using Distributed Source Control in a Centralized Source Control Environment - A method is presented for using a distributed source control system with a centralized source control system. A first set of files is obtained from a source control repository and stored on a first electronic computing device. The first set of files comprises all or part of a code base in the centralized source control system. A request is received for at least part of the code base from a second electronic computing device in a distributed source control system. As a result of the request, at least a part of the first set of files is sent to the second electronic computing device. A change set for the first set of files is received from the second electronic computing device. The change set is processed to be in a format compatible with the source control repository. The change set is submitted to the source control repository. | 2013-06-20 |
20130159366 | DATA DISTRIBUTION SYSTEM - Distributing data is disclosed. A first request for data associated with a first file is received at a first node. It is determined, at the first node, that the first file is located on a second node. A second request for data associated with the first file is received at the first node. It is determined that a third node should have an instance of the first file. The third node is caused to have an instance of the first file. | 2013-06-20 |
20130159367 | Implementation of Negation in a Multiplication Operation Without Post-Incrementation - A multiplier circuit for generating a product of at least first and second multiplicands includes encoding circuitry comprising a plurality of encoders. Each of the encoders is operative to receive at least a subset of bits of the first multiplicand and to generate a partial product corresponding to the subset of bits of the first multiplicand. The encoding circuitry is further operative to incorporate a negation of the product as a function of at least a first control signal supplied to the multiplier circuit. The multiplier circuit further includes summation circuitry coupled with the encoding circuitry. The summation circuitry is operative to sum each of the partial products generated by the encoding circuitry to thereby generate the product without performing post-incrementation. | 2013-06-20 |
20130159368 | Method and Apparatus for Calculating an N-Point Discrete Fourier Transform - Described embodiments provide an apparatus for calculating an N-point discrete Fourier transform of an input signal having multiple sample values. The apparatus includes at least one input configured to receive the sample values and a counter to count sample periods. Also included are at least two parallel multipliers to multiply each sample value, with each of the multipliers having a corresponding multiplication factor. There is at least one multiplexer to select one of the at least two parallel multipliers. An adder sums the scaled sample values and an accumulator accumulates the summed sample values. N is an integer and the at least two parallel multipliers are selectable based upon the value of N and the value of the sample period count. | 2013-06-20 |
20130159369 | APPARATUS AND METHOD FOR PERFORMING DISCRETE FOURIER TRANSFORM - A Discrete Fourier Transform (DFT) apparatus is provided. The DFT apparatus includes a first delay, a second delay, an operator, and a multiplier. The first delay delays one sampling data by N-sample in a time axis when the one sampling data is input. The second delay delays an output value of a frequency component for a previous sampling data by 1-sample. The operator performs an operation based on the input one sampling data, the one sampling data delayed by the N-sample in the time axis, and the 1-sample delayed output value of the frequency component for the previous sampling data. The multiplier multiplies an output value from the operator by a twiddle factor | 2013-06-20 |
20130159370 | PATTERN RECOGNITION OF A DISTRIBUTION FUNCTION - Various embodiments of systems and methods for pattern recognition of a distribution function are described herein. An influenced distribution function corresponding to an influenced attribute is compared with other distribution functions corresponding to other attributes. Based on the comparison, a correlation is determined between the influenced distribution function and an influencing distribution function from the other distribution functions. Based on the determination, a raw distribution function corresponding to an influenced attribute is extracted using the influenced distribution function and the influencing distribution function. The extracted raw distribution function and the influencing distribution function may be classified. | 2013-06-20 |
20130159371 | Arithmetic Logic Unit Architecture - Embodiments of the present invention include an apparatus, method, and system for acoustic modeling. In an embodiment, an arithmetic logic unit for computing a one-dimensional score between a feature vector and a Gaussian probability distribution vector is provided. The arithmetic logic unit includes a computational logic unit configured to compute a first value based on a mean value and a variance value associated with a dimension of the Gaussian probability distribution vector and a dimension of a feature vector, a look up table module configured to output a second value based on the variance value, and a combination module configured to combine the first value and the second value to generate the one-dimensional score. | 2013-06-20 |
20130159372 | MATRIX-BASED DYNAMIC PROGRAMMING - Embodiments relate to dynamic programming. An aspect includes representing a dynamic programming problem as a matrix of cells, each cell representing an intermediate score to be calculated. Another aspect includes providing a mapping assigning cells of the matrix to elements of a result container data structure, and storing cells of the matrix to elements of the result container data structure in accordance with the mapping. Another aspect includes calculating intermediate scores of all cells of the matrix, whereby intermediate scores of some of the cells of the matrix are stored to a respectively assigned element of the result container data structure in accordance with the mapping. Another aspect includes during the calculation of the intermediate scores, dynamically updating the assignment of cells and elements in the mapping and assembling a final result of the dynamic programming problem from the intermediate scores stored in the result container data structure. | 2013-06-20 |
20130159373 | MATRIX STORAGE FOR SYSTEM IDENTIFICATION - A sparse matrix used in the least-squares method is divided into small matrices in accordance with the number of elements of observation. An observation ID is assigned to each element of observation, a parameter ID is assigned to each parameter, and the IDs are associated with parameters of elements as ID mapping. A system determines positions of nonzero elements in accordance with whether or not ID mapping exists, the correspondence between observation IDs and parameter IDs, and the positions of the small matrices, and selects a storage scheme for each small matrix based thereon. The system selects a storage scheme in accordance with conditions, such as whether or not a target element is a diagonal element, whether or not a term decided without ID mapping exists, and whether or not the same ID mapping is referred to. | 2013-06-20 |
20130159374 | Method And Apparatus For Messaging In The Cloud - The distributed message handling system is created by using session states to represent the plurality of session contexts in the message handling system. The session states are flat representations of the session context which completely describe the session. Utilizing the session states to handle system message requests allows the message handling system to distribute the handling of the message requests to a plurality of state machines. Advantageously, the distributed messaging system allows the message handling system to dynamically allocate message handling resources to application instances based on demand. Such dynamic allocation allows providers to efficiently allocate resources to meet demand while meeting application execution demands. | 2013-06-20 |
20130159375 | Methods and Systems for Generation and Execution of Miniapp of Computer Application Served by Cloud Computing System - A first application is executed on a cloud computing system for a first period of time. User input signals associated with execution of the first application during the first period of time are recorded. A second application is generated to correspond to a portion of the first application as executed during a second period of time within the first period of time. The second application is defined by program instructions of the first application executed during the second period of time. A miniapp is generated to include the second application and the user input signals recorded during execution of the first application during the second period of time. | 2013-06-20 |
20130159376 | SYSTEMS AND METHODS FOR A COMPUTING RESOURCE BROKER AGENT - A resource broker agent may be configured to monitor computing resources available on a computing device. The resource broker agent may be further configured to request additional computing resources in response to detecting a request to perform a computing task that cannot be adequately performed with the computing resources currently available on the computing device. The additional computing resources may be requested from one or more remote resource providers via a network. The additional computing resources may comprise remote execution of portions of the computing task. The resource broker agent may be further configured to perform the requested computing task by use of a virtualized computing environment of the computing device. | 2013-06-20 |
20130159377 | PROACTIVE AUTOMATED PERSONAL ASSISTANT - Embodiments relate to a platform for providing information to a user based on the user's context. User context may be determined by the platform and may include the time and date, the user's location, the user's scheduled activities, the users current activities, the user's budget, the weather forecast at the user's location, etc. Agents, software components that may run in the cloud and may perform useful tasks for users, may be created and used by the platform. A topic is a collection of metadata that defines how information is handled in different situations. Topics may be created for and by users, may be associated with events and/or locations, and may be configured to use agents to provide potentially useful information, such as ads, coupons, notifications, and alerts, to users subscribed to the topic. | 2013-06-20 |
20130159378 | SINGLE APPROACH TO ON-PREMISE AND ON-DEMAND CONSUMPTION OF SERVICES - The present disclosure involves systems, software, and computer implemented methods for deployment of services independent of a particular deployment model. One process includes operations for receiving a selection for a user productivity service from a client device, the client device located in a corporate network. A request for a particular method of deployment of the user productivity service is received. At least a portion of the user productivity service is transmitted to the client device if the request is for on-demand deployment of the user productivity service. At least a portion of the user productivity service is transmitted to a server in the corporate network if the request is for on-premise deployment of the user productivity service. | 2013-06-20 |
20130159379 | APP SYSTEM PLATFORM - Embodiments illustrated and described herein provide systems, methods, and software of an app system platform that enables apps to provide rich user experiences in accessing and utilizing functionality of an enterprise-class computing system, such as an ERP system. Some such embodiments include groups of mapper objects in a web framework for each supported app that handle specific data types communicated between the app and a web platform. The mapper objects transform data between app consumable formats and formats of connector objects. The connector objects operate to transform data between the respective connector object formats and data formats of consumable by an enterprise-class computing system via interfaces. These and other embodiments are illustrated and described herein. | 2013-06-20 |
20130159380 | PROVISIONING HIGH PERFORMANCE COMPUTING CLUSTERS - Provisioning a cloud based high performance computing cluster. The method includes from a cloud based provisioning service deployed in a cloud based computing provider, providing a user interface. The method further includes receiving user input at the cloud based provisioning service from the user interface. The method further includes from the user input, determining a configuration for a cloud based user service for the user. Using the cloud based provisioning service, the method further includes provisioning the cloud based user service for the user, in the cloud, based on the determined configuration. | 2013-06-20 |