52nd week of 2011 patent applcation highlights part 59 |
Patent application number | Title | Published |
20110320385 | FAIR VALUE MODEL BASED SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR VALUING FOREIGN-BASED SECURITIES IN A MUTUAL FUND - A system and method for determining fair value prices of financial securities of international markets includes steps of selecting a universe of securities of a particular international market, computing overnight returns of each security in the selected universe over a predetermined past period of time, selecting at least one return factor of a domestic financial market from a plurality of return factors, computing, for each selected return factor, the return factor's daily return over said predetermined past period of time, calculating, for each selected return factor, a return factor coefficient for each security in the selected universe by performing a time series regression to obtain the contribution of each return factor's return to the security's overnight return, and storing each calculated return factor coefficient in a data file. | 2011-12-29 |
20110320386 | EXTRAPOLATING EMPIRICAL MODELS FOR CONTROL, PREDICTION, AND OPTIMIZATION APPLICATIONS - The present disclosure provides novel techniques for defining empirical models having control, prediction, and optimization modalities. The empirical models may include neural networks and support vector machines. The empirical models may include asymptotic analysis as part of the model definition as allow the models to achieve enhanced results, including enhanced high-order behaviors. The high-order behaviors may exhibit gains that are non-zero trending, which may be useful for controller modalities. | 2011-12-29 |
20110320387 | Graph-based transfer learning - Transfer learning is the task of leveraging the information from labeled examples in some domains to predict the labels for examples in another domain. It finds abundant practical applications, such as sentiment prediction, image classification and network intrusion detection. A graph-based transfer learning framework propagates label information from a source domain to a target domain via the example-feature-example tripartite graph, and puts more emphasis on the labeled examples from the target domain via the example-example bipartite graph. An iterative algorithm renders the framework scalable to large-scale applications. The framework propagates the label information to both features irrelevant to the source domain and unlabeled examples in the target domain via common features in a principled way. | 2011-12-29 |
20110320388 | System, Method and Computer Program for Pattern Based Intelligent Control, Monitoring and Automation - The present invention relates to control, monitoring, and automation. The present invention more specifically relates to pattern-based intelligent control, monitoring and automation. The invention performs pattern-based monitoring. It collects signal data from one or more signals. The signal data define signal data streams. It then transforms each of the signal data streams into trends. It also discovers patterns based on the trends within each signal data stream and/or across the signal data streams. The patterns are optionally used for diagnostics and root cause analysis, online plant monitoring and operation control, plant optimization, and other environments where a causal link or correlation may exist between related inputs, states and/or outputs. | 2011-12-29 |
20110320389 | SYSTEMS AND METHODS FOR SAFETY AND BUSINESS PRODUCTIVITY - The present invention is a safety and business productivity system having the following components. One or more cameras capture video data having attribute data, the attribute data representing importance of the cameras. One or more video analytics devices process the video data from one or more of the cameras and detect primitive video events in the video data. A correlation engine correlates two or more primitive video events from the video analytics devices weighted by the attribute data of the cameras used to capture the video data. An alerting engine generates one or more alerts and performs one or more actions based on the correlation performed by the correlation engine. | 2011-12-29 |
20110320390 | METHOD FOR IDENTIFICATION, PREDICTION AND PROGNOSIS OF CANCER AGGRESSIVENESS - A survival model, for each of one or more pairs of genes, includes a function of a corresponding measure of the ratio of expression levels of the pairs of genes. For each pair of genes, there is a corresponding a cut-off value, such that patients are classified according to whether the corresponding measure is above or below the cut-off value. It is proposed (in an algorithm called “DDgR”) that the cut-off value should be selected so as to maximise the separation of the respective survival curves of the two groups of patients. It is further proposed that, for each of a number of genes or gene pairs, a selection is made from multiple survival models. The selection is according to whether a proportionality assumption is obeyed and/or according to a measure of data fit, such as the Baysian Information Criterion (BIC). Specific gene pairs identified by the methods are named. | 2011-12-29 |
20110320391 | Method and Apparatus for Predicting Application Performance Across Machines with Different Hardware Configurations - A method and system for predicting performance of an application on a machine of a predetermined hardware configuration simulates the performance of the application under a plurality of different simulated hardware configurations; builds a predictive model of the performance of the application based on the results of the simulations; obtains the performance of the application on a plurality of actual machines, each of the machines having a different hardware configuration; and Bayesian reinterprets the predictive model built from the results of the simulations using the performance of the application on the plurality of actual machines, to obtain a final predictive model of the performance of the application having an accuracy greater than the predictive model built from the results of the simulations. | 2011-12-29 |
20110320392 | METHODS FOR PREDICTING CANCER RESPONSE TO EGFR INHIBITORS - The presently-disclosed subject matter relates to biomarker profiling of samples obtained from carcinoma subjects who are candidates for treatment with a therapeutic EGFR inhibitor. More specifically, the presently-disclosed subject matter provides methods of biomarker profiling which allow one skilled in the art to predict whether a patient is likely to respond well to treatment with an EGFR inhibitor. | 2011-12-29 |
20110320393 | 100GBPS SECURITY AND SEARCH ARCHITECTURE USING PROGRAMMABLE INTELLIGENT SEARCH MEMORY - Memory architecture provides capabilities for high performance content search. The architecture creates an innovative memory that can be programmed with content search rules which are used by the memory to evaluate presented content for matching with the programmed rules. When the content being searched matches any of the rules programmed in the Programmable Intelligent Search Memory (PRISM) action(s) associated with the matched rule(s) are taken. Content search rules comprise of regular expressions which are converted to finite state automata (FSA) and then programmed in PRISM for evaluating content with the search rules. PRISM architecture comprises of a plurality of programmable PRISM Memory clusters (PMC) which comprise of a plurality of programmable PRISM Search Engines (PSE). Groups of PMCs can be programmed with the same rules and used in parallel to apply these rules to multiple data streams simultaneously to achieve increased performance. PMC groups provide 10 Gbps performance with 10 PMC groups enabling 100 Gbps content search and security performance. | 2011-12-29 |
20110320394 | Creation and Revision of Network Object Graph Topology for a Network Performance Management System - An embodiment of the invention comprises, providing an initial object graph to a database, the initial object graph being generated by applying a set of rules to resources included in a resource set at a specified time, or by revising a previous object graph at the previous time, the resource set at the specified time comprising an initial resource set. The method includes providing the initial object graph to a working memory, maintained in separation from the database; discovering a changed fact associated with one of the resources of the initial resource set; and upon discovering the changed fact, determining modifications required by the changed fact to the initial object graph. If modifications are required, the initial object graph is revised in the working memory to include such modifications. The same revisions are then made to the initial object graph in the system database. | 2011-12-29 |
20110320395 | Optimization of Multi-channel Commerce - Content provided by a decision engine system is described. Content, stored in a server system, is provided to a plurality of display units at a plurality of touch point devices. One or more features are determined to optimize the content provided to the plurality of display units. The content is updated syndicated across the plurality of display units at the plurality of touch point devices based on the determination. | 2011-12-29 |
20110320396 | SYSTEMS AND METHODS FOR ANALYZING AND SYNTHESIZING COMPLEX KNOWLEDGE REPRESENTATIONS - Techniques for analyzing and synthesizing complex knowledge representations (KRs) may utilize an atomic knowledge representation model including both an elemental data structure and knowledge processing rules stored as machine-readable data and/or programming instructions. One or more of the knowledge processing rules may be applied to analyze an input complex KR to deconstruct its complex concepts and/or concept relationships to elemental concepts and/or concept relationships to be included in the elemental data structure. One or more of the knowledge processing rules may be applied to synthesize an output complex KR from the stored elemental data structure in accordance with an input context. Multiple input complex KRs of various types may be analyzed and deconstructed to populate the elemental data structure, and input complex KRs may be transformed through the elemental data structure to output complex KRs of different types, providing semantic interoperability to KRs of different types and/or KR models. | 2011-12-29 |
20110320397 | IMPULSE REGULAR EXPRESSION MATCHING - Disclosed is a method and apparatus for matching regular expressions. A buffer of symbols giving a number of the last occurrence positions of each symbol is maintained. When two constants match on either side of a regular expression operator, the buffer of symbols is queried to determine if a member of the complement of the regular expression operator occurred between the two constants. If so, then the operator was not satisfied. If not, then the operator was satisfied. | 2011-12-29 |
20110320398 | Apparatus and Method for Dynamically Materializing A Multi-Dimensional Data Stream Cube - A computer readable storage medium comprises executable instructions to generate a stream cube to store data received from multiple data sources. A plurality of multi-dimensional data streams are generated to represent the received data. A materialization strategy is repeatedly determined for the stream cube. The stream cube is materialized according to the materialization strategy to record the multi-dimensional data streams. | 2011-12-29 |
20110320399 | ETL BUILDER - A method of building a staging database which examines the staging database metadata and constructs a schedule of operations to extract the data, transform it and load it into the staging database by using normalisation, translation blocks and filtering to create a business view of the data that can be seen using standard query languages. This is applied to products such as Navision in building an OLAP cube for use in business intelligence applications. | 2011-12-29 |
20110320400 | Global Information Management System and Method - A global information management system (GIMS) includes a collection of standards and methods that allow information management on a global scale. A GIMS computer network includes a central registration database (CRD) and one or more GIMS computer systems connected over a network. Each GIMS computer system includes a relational database having a set of standardized tables. The CRD may provide a GIMS network-unique system ID to each GIMS computer system. Each GIMS computer system uses the GIMS network-unique system ID as part of a primary key for each record generated by and stored in the set of standardized tables of the GIMS database. The GIMS enables global database normalization through the globally unique identification of database records. | 2011-12-29 |
20110320401 | SYSTEM AND METHOD FOR REMOTE UPDATES - In one embodiment, accessing, using a computing device, a batch file comprising a plurality of events generated by a remote game client application executing an instance of a computer-implemented game; accessing, in response to the batch file, a game state data object associated with the instance of the computer-implemented game, wherein the game state data object includes one or more game state parameters formatted as serialized unstructured data; parsing the game state data object to identify the one or more game state parameters; processing the plurality of events in the batch file against game logic to update one or more of the game state parameters; re-serializing the one or more game state parameters into an updated game state data object; and storing the game state data object in a memory cache. | 2011-12-29 |
20110320402 | MANAGEMENT OF MEDIA FILES - Apparatus, systems, and methods provide a mechanism to enhance the management of mobile devices for users of the mobile devices. Various embodiments include apparatus and methods to manage media content for a mobile device with respect identification, in a management system, of the media content of the mobile device. Additional apparatus, systems, and methods are disclosed. | 2011-12-29 |
20110320403 | APPROACHES FOR THE REPLICATION OF WRITE SETS - Approaches for replicating data in a distributed transactional system. At a first node of a cluster, a per-transaction write set that comprises a plurality of write operations that are performed against a first data store maintained by the first node is committed. The per-transaction write set is replicated from the first node to a second node of the cluster. At the second node, the plurality of write operations, specified by the per-transaction write set, may be performed in parallel against a second data store maintained by the second node. At the second node, two or more threads may perform a portion of the plurality of write operations against data blocks stored within an in-memory buffer. | 2011-12-29 |
20110320404 | STANDBY INDEX IN PHYSICAL DATA REPLICATION - Generating a standby index on a standby database server in a physical log-shipping data replication environment. Embodiments of the invention include providing a primary database server and a standby database server, replicating a primary database and a primary database index from the primary database server to the standby database server, generating a standby index on the standby database server, and cataloging the standby index on the standby database server. | 2011-12-29 |
20110320405 | DETACHABLE COMPUTER WITH VARIABLE PERFORMANCE COMPUTING ENVIRONMENT - Computing devices are often designed in view of a particular usage scenario, but may be unsuitable for usage in other computing scenarios. For example, a notebook computer with a large display, an integrated keyboard, and a high-performance processor suitable for many computing tasks may be heavy, large, and power-inefficient; and a tablet lacking a keyboard and incorporating a low-powered processor may improve portability but may present inadequate performance for many tasks. Presented herein is a configuration of a computing device featuring a display unit with a resource-conserving processor that may be used independently (e.g., as a tablet), but that may be connected to a base unit featuring a resource-intensive processor. The operating system of the device may accordingly transition between a resource-intensive computing environment and a resource-conserving computing environment based on the connection with the base unit, thereby satisfying the dual roles of workstation and portable tablet device. | 2011-12-29 |
20110320406 | METHOD, APPARATUS OR SOFTWARE FOR TRANSFERRING A STORAGE REPLICATION SYSTEM BETWEEN STORAGE SYSTEMS - A method, apparatus or software is disclosed for transferring storage replication system configurations between heterogonous storage systems. | 2011-12-29 |
20110320407 | SHARED DATA COLLECTIONS - A data sharing mechanism may allow programs to share access to data collections. The mechanisms that implement the sharing may allow programs written in any language to read and write a shared collection. The mechanisms may make the shared nature of the collection relatively transparent to the program and to the programmer, by allowing a program to operate on the data more or less as if it were purely local data. The sharing of collections may be managed by a shared object runtime on each machine on which a collection is used, and by a shared object server. The shared object server maintains the true state of the collection, and deterministically resolves collections when programs operate on the same collection without knowledge of each other's operations. The mechanisms by which collections are shared may be implemented so as to be agnostic as to the kind of data in the collection. | 2011-12-29 |
20110320408 | METHOD AND APPARATUS FOR A PAGED UPDATE PROTOCOL - An approach is provided for providing an update feed to clients. An update document comprising one or more update statuses of one or more resources is generated. At least one of the one or more resources is identified using a respective obfuscation identifier. The update document is divided into one or more pages. The one or more pages are archived. | 2011-12-29 |
20110320409 | GUARANTEED IN-FLIGHT SQL INSERT OPERATION SUPPORT DURING AN RAC DATABASE FAILOVER - The present invention is directed to methods and systems of implementing a guaranteed SQL insert operation. In one embodiment, the method may include initiating an SQL insert operation for a database, receiving an SQL exception indicating that a failover for the database has occurred, and in response to the SQL exception, caching the SQL insert operation and caching the SQL insert operation as an SQL merge operation. The method further includes determining that a primary key is associated with the SQL insert operation, and in response to determining that a primary key is associated with the SQL insert operation, executing the SQL merge operation. | 2011-12-29 |
20110320410 | SYSTEM AND METHOD FOR GENERATING DYNAMIC QUERIES - A first query is retrieved by a computing device. A second query is retrieved by the computing device, wherein the second query is linked to the first query. A derivative query is generated by the computing device based, at least in part, upon merging at least a portion of the second query with at least a portion of the first query, wherein generating the derivative query includes retrieving the first query and the second query prior to generation of the derivative query. The computing device determines whether the derivative query contains one or more conflicts. If it is determined that the derivative query contains one or more conflicts, the one or more conflicts in the derivative query are resolved by the computing device. | 2011-12-29 |
20110320411 | SYSTEM AND METHOD FOR A COMPUTER BASED FORMS LANGUAGE - A computational platform and related methods that generally combines the object model and the programming model into a single set of constructs (e.g., Forms, relations, entities, relationships). These constructs provide the characteristics of inheritance, linkage, immutability, versioning, and substitution in a single structure that can store the objects, processes, and instructions/ programs, and provide for convergence and divergence of information in information streams, a database graph, or a database web distributed across a set of nodes. | 2011-12-29 |
20110320412 | USING REPEATED INCREMENTAL BACKGROUND CONSISTENCY CHECKING TO DETECT PROBLEMS WITH CONTENT CLOSER IN TIME TO WHEN A FAILURE OCCURS - Provided are techniques for identifying an incremental consistency checking job. During a run of the incremental consistency checking job, one or more queries are issued for a set of content holding objects in an object repository. For each of the issued one or more queries, whether content in the set of content holding objects in the object repository and associated content elements in the content repository is consistent is verified; in response to determining that content is not consistent, one or more inconsistencies are recorded; in response to determining that a desired number of content elements to process in each time interval has been reached and not all of the content holding objects in the object repository have been processed, the incremental consistency checking job is scheduled for a subsequent run; and, in response to determining that all of the content holding objects in the object repository have been processed, the incremental consistency checking job is marked as complete and a new incremental consistency checking job is scheduled. | 2011-12-29 |
20110320413 | Detection of Obscured Copying Using Discovered Translation Files and Other Operation Data - Systems and methods that automatically compare sets of files to determine what has been copied even when sophisticated techniques for hiding or obscuring the copying have been employed. The file compare system comprises a file compare program that uses various operational data and user interface options to detect illicit copying, highlight and align matching lines, and to produced a formatted report. A discovered translations file is used to match translated tokens. Other operation data files specify rules that the file program then uses to improve its results. The generated report contains statistics and full disclosures of the discovered translations used and the other methods used in creating the exhibits. The system includes a bulk compare program that automatically detects likely file pairings and candidates for validation as suspected translations, which can be used on iterative runs. The user is given full control in the final output and the system automatically reforms the reports and recalculations the statistics for consistent and accurate final presentation. | 2011-12-29 |
20110320414 | METHOD, SYSTEM AND COMPUTER-READABLE STORAGE MEDIUM FOR DETECTING TRAP OF WEB-BASED PERPETUAL CALENDAR AND BUILDING RETRIEVAL DATABASE USING THE SAME - The present disclosure relates to a method, system and software executable by a processor associated with non-transitory computer-readable storage medium for detecting a trap of web-based calendar pages and building a retrieval database. According to an aspect of the disclosure, detecting a trap of web-based calendar pages includes clustering, by a clustering module, URLs corresponding to web pages stored in a database according to a predetermined standard, generating a regular expression by analyzing a date pattern included in a clustering result, and detecting, a cluster suspected of being a trap of web-based perpetual calendar pages using the generated regular expression. | 2011-12-29 |
20110320415 | PIECEMEAL LIST PREFETCH - Prefetching data using a piecemeal list prefetching method. This is achieved by various means, including building a plurality of data pages, sorting the plurality of data pages into sequential data pages and a list of non-sequential pages, prefetching the sequential data pages using a first prefetching technique, and prefetching the non-sequential list of data pages using a second prefetching technique. | 2011-12-29 |
20110320416 | Eliminating Redundant Processing of Data in Plural Node Systems - According to a present invention embodiment, a system avoids duplicate processing of database objects to ensure operation integrity in a database system including a plurality of nodes. The system comprises a computer system including at least one processor. The computer system receives a data operation from a secondary node, executes the received data operation, and identifies each database object that is relocated based on the executed data operation. The computer system communicates to the secondary node operations performed by the computer system for execution of the data operation and an indication of each relocated database object. The secondary node stores an identifier reflecting the relocation for each relocated database object to prevent re-processing of the relocated database objects for the data operation. Embodiments of the present invention further include a method and computer program product for avoiding duplicate processing of database objects in substantially the same manner described above. | 2011-12-29 |
20110320417 | DATABASE COMPRESSION - Apparatus, systems, and methods may operate to receive a set of ordered user-selected compression rules as a compression rule set comprising at least one compression threshold condition, to create or transform a database object with rows to be selectively compressed according to the compression rules in the compression rule set (providing a transformed object), and to publish at least a portion of the transformed object to one of a storage medium or a display screen. Other apparatus, systems, and methods are disclosed. | 2011-12-29 |
20110320418 | DATABASE COMPRESSION ANALYZER - Apparatus, systems, and methods may operate to receive requests to execute a plurality of compression and/or decompression mechanisms on one or more database objects; to execute each of the compression and/or decompression mechanisms, on a sampled basis, on the database objects; to determine comparative performance characteristics associated with each of the compression and/or decompression mechanisms; and to record at least some of the performance characteristics and/or derivative characteristics derived from the performance characteristics in a performance summary table. The table may be published to a storage medium or a display screen. Other apparatus, systems, and methods are disclosed. | 2011-12-29 |
20110320419 | Management of temporal data by means of a canonical schema - Computer programs embodied in computer-readable media for managing temporal data in relational databases are provided. According to one embodiment, a computer program comprises logic for storing temporal data in tables stored in a database and using a single schema. The schema includes a first column designating an identifier of an object represented in a row of a table and columns designating an effective-time period. For a past effective-time period, the state of the object as it existed is described by atemporal data in the row. For a present effective-time period, the present state of the object is described. For a future effective-time period, the state of the object as it will exist is described by the atemporal data. Additional logic stores additional data in the tables, such as business data describing the state of the object. | 2011-12-29 |
20110320420 | Decentralized, distributed internet data management - In a light-weight transactional system architecture, each component providing a service performs its own scheduling and transaction management. An invocation of one of these services (through remote method invocation) results in the creation of a local transaction (child of the invoking transaction and parent of any transaction that might be triggered by invoking the services of other servers). The information that is required to build a global composite transaction is implicitly added by the system to each call. Each transaction is, however, independently handled at each server. That is, the servers neither communicate among themselves nor rely on a centralized component to make scheduling or recovery decisions. In this way, components can be dynamically added or removed from the system without compromising correctness. Regardless of the configuration, the system according to the invention guarantees that transactions executed over these servers are correct and recoverable at a global and local level. | 2011-12-29 |
20110320421 | SYSTEM AND METHOD OF NETWORK DATA ACCESS MANAGEMENT - Disclosed is a system and method of network data access management, a client terminal sends out a file request to a server, said server transmits said file request to a database and fetches a file corresponding to said file request from said database and transmits it back to said client terminal, said server transmits and stores file information of said file into a virtual database, such that when said client terminal edits said file, it will also modify said file information of said corresponding file in said virtual database simultaneously, and upon finishing editing said file, said virtual database transmits said edited file information to said database through said server. Then, said database will modify said file in said database as based on said edited file information, thus decreasing number of access of said database by said client terminal, reducing bandwidth required significantly, and increasing efficacy of network data access. | 2011-12-29 |
20110320422 | System and Method for Delivery of Business Information Through an Electronic Address Book - Systems and methods are provided to deliver business information to users through users' online address books. Data aggregation servers associate individual businesses with one or more unique identifiers. The data aggregation servers collect, store and periodically update business information relating to individual businesses from a variety of sources, such as the businesses themselves and third party sources, such as online publications and message boards. The data aggregation servers store the information in association with the unique identifier. Electronic address book applications hosted on user devices store address book entries for individual businesses in local address book databases. The entries for each business include the unique identifier, and the online address book applications use the unique identifier to retrieve business information relating to individual businesses from the data aggregation servers. | 2011-12-29 |
20110320423 | INTEGRATING SOCIAL NETWORK DATA WITH SEARCH RESULTS - A user of a social network may submit a search query relating to one or more topics to a search engine indexing a set of data items, but the search results, while authoritative and informative, may be highly impersonal with respect to the user. Conversely, the user may search for social data items within the social network relating to the topics, and such social data items may be more highly personalized to the user, but may also be inaccurate or incomplete. Instead, the search query may be applied to both the search engine and the social network, and the selected search results and social data items may be integrated into a presentation featuring both authoritative and personalized information about the topics associated with the search query. | 2011-12-29 |
20110320424 | ASSESSING AND ADAPTING COMPONENT PARAMETERS - A parameter-selection technique that allows preferred permutations to be rapidly identified based on real-world user behavior is described. In particular, a set of web pages that include different permutations of the set of parameters are generated. Then, at least a subset of these web pages is provided to the users in response to their requests. For example, the requests may be associated with user selections of search results, which are associated with search queries provided by the users to a search engine. While the users interact with the subset of the set of web pages, their actions and the associated context (with respect to the different permutations) are tracked. Next, the tracked user actions are used to identify the web pages associated with the preferred permutations of the set of parameters. | 2011-12-29 |
20110320425 | SYSTEM AND METHOD FOR PROVIDING INTELLIGENCE CENTERS - Disclosed herein, among other things, is a system comprising a content repository, a communication portal developer, a content manager, and an analytic engine. The content repository is adapted to store electronic content in a computer-readable storage medium. The communication portal developer includes at least one wizard to create a plurality of customizable portals without coding software. Each customizable portal is accessible to one or more selected visitors through a web browser. The content manager is adapted to publish selectable electronic content to selectable portals. The content manager includes at least one wizard to populate and manage the electronic content within the content repository. The analytic engine analyzes electronic content use and visitor behavior while logged into their customizable portal. In various embodiments, the analytics are provided in real time or near real time. Other embodiments are disclosed herein. | 2011-12-29 |
20110320426 | RICH SITE MAPS - Providing a website map to a user. A method includes gathering information about web pages in a website, including information related to web page relationships, controls, and executable code underlying one or more web pages in the website. A relationship map is created. The relationship map includes representations of relationships between the web pages, the controls and the executable code underlying one or more web pages in the website. The method further includes graphically displaying at least a portion of the relationship map in a graphical user interface at the computing system. | 2011-12-29 |
20110320427 | SYSTEM AND METHOD FOR COLLECTING DOCUMENT - Provided is a system and method for collecting a document. The system may include an identification information receiver to receive, from a host of a site, identification information of a document of which an update may occur, a collection request transfer unit to transmit a collection request for the document based on the identification information, an update information collector to receive update information of the document from the host, and a search result provider to provide, to the host, a search result extracted from the update information of the document, in response to the search request being received from the host. The system for collecting the document may reduce load of a web site, and may improve accuracy of the document to be collected. | 2011-12-29 |
20110320428 | DATA-DISCRIMINATE SEARCH ENGINE UPDATES - Techniques are provided for data-discriminate search engine updates, where, in accordance with a first crawling session frequency associated with a first update type, a search engine index is updated by recording an update to a first set of data, where the update to the first set of data is of the first update type, and, in accordance with a second crawling session frequency associated with a second update type, the search engine index is updated by recording an update to a second set of data, where the update to the second set of data is of the second update type, where the first crawling session frequency is of a different frequency than the second crawling session frequency. | 2011-12-29 |
20110320429 | SYSTEMS AND METHODS FOR AUGMENTING A KEYWORD OF A WEB PAGE WITH VIDEO CONTENT - The present disclosure relates to systems and methods for delivering related video content to a user in response to user actions on augmented keywords on a web page. A server may receive from a browser, in response to an indication of a mouse over a keyword currently displayed on a web page of a client, a keyword identified for augmentation via a user interface overlay. The server may identify, responsive to receiving the keyword, a plurality of videos related to the keyword. A content relevancy engine may determine an order of relevance of the plurality of videos to the keyword. The server may transmit to the client, within a predetermined time period from the indication, the user interface overlay to include a selected one or more videos of the plurality of videos with a higher order of relevance. | 2011-12-29 |
20110320430 | OBJECT RECOMMENDATION METHOD AND SYSTEM - A method for recommending an object in a communication network using a bookmark, said method comprising, for an object search engine in the communication network, the acts of indexing a bookmark created by a first user in association with search keywords comprising an identifier of the first user and an identifier of at least one second user with whom the first user wants to share the bookmark; providing to a second user, in response to a search request from said second user, a search result comprising a link usable for accessing an object linked with the bookmark. | 2011-12-29 |
20110320431 | STRONG TYPING FOR QUERYING INFORMATION GRAPHS - Described herein is using type information with a graph of nodes and predicates, in which the type information may be used to determine validity of (type check) a query to be executed against the graph. In one aspect, each node has a type, and each predicate indicates a valid relationship between two types of nodes. A type checking mechanism uses the type information to determine whether a query is valid, which may be the entire query prior to query processing/compilation time, or as the query is being composed by a user. One or more valid predicates for a given node may be discovered based upon the node type, such as discovered to assist the user during query composition. Also described is using the type information to optimize the query. | 2011-12-29 |
20110320432 | Managing Parameters in Filter Expressions - A mechanism is provided for generating a filter expression using tree parameters receives an expression wherein operators of the expression bind multiple data items to a single parameter to form a received expression, generates a default prompt control using received metadata and the received expression and prompts for an input selection using the default prompt control. Responsive to receiving selected values in response to the default prompt control to form received values the computer-implemented process generates a native database query using the received expression with the single parameter and the received values, wherein the single parameter is a tree parameter. | 2011-12-29 |
20110320433 | Automated Joining of Disparate Data for Database Queries - Described is associating metadata with different sources of data (e.g., database tables) that allows a single view of data from the sources to be created. An administrator creates baseviews corresponding to database tables and associates metadata with the baseviews, including primary key metadata for the baseviews and meta-tags for one or more of the columns of each baseview. A user selects fields (corresponding to table columns) from a starting baseview, along with fields from any other baseview that has metadata that matches the starting baseview's metadata. A join mechanism automatically creates the view if a metadata match is detected. | 2011-12-29 |
20110320434 | ENERGY MONETARY COST AWARE QUERY OPTIMIZATION - Embodiments of the invention provide a method of optimizing a query, including determining an execution plan for use in executing the query, based on a monetary cost of the energy needed to execute the query. A query optimization component may determine a plurality of execution plans for the query. The query optimization component may then select one of the plans to use in executing the query based on the monetary cost calculated for the plan. | 2011-12-29 |
20110320435 | STATIC QUERY OPTIMIZATION - In some embodiments, a computer-implemented method for tuning queries for a multi-tenant database system is provided. A processor retrieves actual statistics associated with data stored on one or more servers in the multi-tenant database system. The data may be associated with one or more tenants of the multi-tenant database system. A subset of the actual statistics is selected, wherein the subset of the actual statistics is related to tenants having a data trait targeted for optimization. The processor determines synthetic statistics based on the subset of the actual statistics. An original query is received at the multi-tenant database system, wherein the original query operates upon data associated with a tenant that has the data trait targeted for optimization. The processor determines an optimal query plan based on the original query and synthetic statistics. Finally, the processor executes the original query based on the optimal query plan. | 2011-12-29 |
20110320436 | OPTIMIZING ACCESS TIME OF FILES STORED ON STORAGES - When each file of a number of files is accessed, at least a number of times each file has been accessed is kept track of. Each file is stored on a storage of a number of storages. Periodically, at least one file is moved among the number of storages, based at least on the number of times each file has been accessed. As such, the at least one file is moved from being stored on a first storage to being stored on a second storage, to optimize subsequent access time of the at least one file. The storages are physically distinct storage devices. At least one of the storage devices has different storage characteristics as compared to one or more other of the storage devices. | 2011-12-29 |
20110320437 | Infinite Browse - An online article is enhanced by displaying, in association with the article, supplemental content that includes entities that are extracted from the article and/or entities that are related to entities that are extracted from the article. The supplemental content further includes information about each of the entities. The information about an entity may be obtained by searching for the entity in one or more searchable repositories of data. For example, the supplemental content may include, for each entity, video, image, web, and/or news search results. The supplemental content may further include information such as stock quotes, abstracts, maps, scores, and so on. The entities are selected using a variety of analyses and ranking techniques based on contextual factors such as user-specific information, time-sensitive popularity trends, grammatical features, search result quality, and so on. The entities may further be selected for purposes such as generating ad-based revenue. | 2011-12-29 |
20110320438 | RULE SUMMARY - A rule summarizing engine and method is disclosed for traversing functional relations in a telecom database and rendering the functional relations in human readable form. The rule summarizing engine and method obtains a database of rules established by operators using a Graphical User Interface to establish functional relations between conditions and actions in a telecom network device. The rule summarizing engine end method traverses either an indicated portion or the entire database and renders the functional relations hitherto established into a readily readable structured form. The rule summarizing engine and method is particularly useful for assisting error finding in functional relations established in a telecom database over other methods known in the art. | 2011-12-29 |
20110320439 | Cooperative Model Between An Application Server And A Database - Methods and apparatus, including computer program products, are provided for implementing a cooperative model between an application and a database. In one aspect, there is provided a computer-implemented method. The method may include receiving from an application a command to perform an operation at a database; accessing metadata representative of the application; configuring, based on at least the metadata, a result of the operation; and sending the configured result to shared memory accessible by the application. Related apparatus, systems, methods, and articles are also described. | 2011-12-29 |
20110320440 | PLACEMENT OF SEARCH RESULTS USING USER INTENT - Technologies are described herein for placing search results on a search engine results page (SERP). A query may be received. The query may be transmitted to a plurality of search result providers. A first set of search results and a second set of search results may be received from the search result providers. Intent features may be extracted from the first set of search results. User intent of the second set of search results may be inferred based on the extracted intent features. The first set of search results and the second set of search results may be ranked based on the inferred user intent. The SERP may be rendered according to the ranked first set and second set of search results. | 2011-12-29 |
20110320441 | ADJUSTING SEARCH RESULTS BASED ON USER SOCIAL PROFILES - Many contemporary computing scenarios involve the submission by a user of a search query to be applied to a data set (such as a set of web pages indexed by a web search engine.) Additionally, many users participate in social networking and have generated a social profile, including demographic information, interests, and associations with other users who also have social profiles. It may be advantageous to improve the presentation of search results from search queries by adjusting the search queries according to a prediction of user interest of the user in the topics associated with respective search results, based on the information in the social profile of the user. For example, search results relating to topics in which the user or the user's friends have expressed an interest within the social network may be presented before other search results, thereby improving the relevance of the search results to the user. | 2011-12-29 |
20110320442 | Systems and Methods for Semantics Based Domain Independent Faceted Navigation Over Documents - Systems and associated methods providing a document corpus navigation interface including domain independent facets are described. Embodiments provide a list of domain independent facets, extract facet values from the document corpus, learn the facet values from the corpus, map each document to one of the values of each of the facets, and automatically determine a weight of the relationship. | 2011-12-29 |
20110320443 | Navigation to Popular Search Results - Systems, methods, and computer media for enhancing search results, as well as user interfaces for performing search queries and navigating search results, are provided. A search query is received from a user. A plurality of web pages relevant to the search query are identified. At least one of the relevant web pages is identified as popular. A search result page is generated including a search result listing and a search result page header. The search result page header includes a link to the popular web page to provide the user with a quick and easy way to select a popular web page relevant to the user's search query. | 2011-12-29 |
20110320444 | System and Method for Evaluating Search Queries to Identify Titles for Content Production - Systems and methods are provided to select potential titles for online content using search query logs from web search service providers. A plurality of search queries are collected from one or more web search service providers. A lifetime value is determined for each of the search queries. Potential titles are then selected from the plurality of search queries using selection criteria including the lifetime value of the search queries. The potential titles can then be provided to content developers who develop online content based on the potential titles. | 2011-12-29 |
20110320445 | Computer-Implemented Method for Clustering Data and Computer-Readable Medium Encoded with Computer Program to Execute Thereof - Inferences acquired by applying clustering analysis cannot be reliably assessed before data-originated errors are quantified, an exacting task that is often not performed. This invention presents a clustering method suited for this purpose. Designed for systems with normally distributed error, a common trait to many data systems, and built on a framework of agglomerative hierarchical clustering, this invention treats each observation as a Gaussian distribution function, uses an exact mathematical relation to track error, and gives results from which quantitative statistics are easily extracted. | 2011-12-29 |
20110320446 | Pushing Search Query Constraints Into Information Retrieval Processing - This patent application relates to interval-based information retrieval (IR) search techniques for efficiently and correctly answering keyword search queries. In some embodiments, a range of information-containing blocks for a search query can be identified. Each of these blocks, and thus the range, can include document identifiers that identify individual corresponding documents that contain a term found in the search query. From the range, a subrange(s) having a smaller number of blocks than the range can be selected. This can be accomplished without decompressing the blocks by partitioning the range into intervals and evaluating the intervals. The smaller number of blocks in the subranges(s) can then be decompressed and processed to identify a doc ID(s) and thus document(s) that satisfies the query. | 2011-12-29 |
20110320447 | High-Dimensional Stratified Sampling - In one aspect, a processing device of an information processing system is operative to perform high-dimensional stratified sampling of a database comprising a plurality of records arranged in overlapping sub-groups. For a given record, the processing device determines which of the sub-groups the given record is associated with, and for each of the sub-groups associated with the given record, checks if a sampling rate of the sub-group is less than a specified sampling rate. If the sampling rate of each of the sub-groups is less than the specified sampling rate, the processing device samples the given record, and otherwise does not sample the given record. The determine, check and sample operations are repeated for additional records, and samples resulting from the sample operations are processed to generate information characterizing the database. Other aspects of the invention relate to determining which records to sample through iterative optimization of an objective function that may be based, for example, on a likelihood function of the sampled records. | 2011-12-29 |
20110320448 | TELEPHONE NUMBERS WITH ALPHABETIC PATTERNS - An exemplary process includes storing telephone numbers in a telephone number database, identifying which telephone numbers in the telephone number database have digits that occur in an alphabetic pattern as defined by a reference list, and designating the telephone numbers with digits occurring in the alphabetic pattern as patterned telephone numbers. An exemplary process of identifying alphabetic patterns includes assigning at least one letter in an alphabet to a first digit, assigning at least one other letter in an alphabet to a second digit, accessing a telephone number database storing telephone numbers having a plurality of digits, identifying a letter combination created by at least two digits of at least one of the telephone numbers in the telephone number database, and determining whether the letter combination forms an alphabetic pattern as defined by a reference list. | 2011-12-29 |
20110320449 | TELEPHONE NUMBER GROUPS - A method includes receiving a list of sequential telephone numbers, and iteratively: identifying a first number and a last number of the list, selecting a group size, creating a group of sequential telephone numbers from the list of sequential telephone numbers based on the selected group size, and removing the created group from the list of sequential telephone numbers. Creating the group may include determining whether a first number in the list of sequential telephone numbers ends with a predetermined digit, assigning the first number as a start number of the group, and identifying an end number in the group based on the start number and the selected group size. | 2011-12-29 |
20110320450 | LOCATION BASED GROUPING OF BROWSING HISTORIES - Methods and systems that present URLs from a history of records organized by locations are described. Each record may be stored to represent a URL accessed for retrieving a web page by a browser hosted in a device at a certain point in time. Additionally, the record may include a location data indicating a physical location of the device at the certain point in time. Optionally, a timestamp indicating the certain point in time may be included in the record. Groups of the records may be clustered according to the locations. In one embodiment, at least one of the groups may be selected for presentation on a display according to where the display is currently located. | 2011-12-29 |
20110320451 | APPARATUS AND METHOD FOR SORTING DATA - A method and system for sorting data of an input file containing multiple records associated with multiple tables of a database. The multiple records include key values. The key values are segmented into ranges of key values for each table. Each range of key values for each table is a segment having a segment value. Multiple key values are selected for the multiple records. A block number, which contains a unique permutation of the segment values of the segments, is generated. The segment values denote the ranges of key values encompassing the multiple key values in each record. A sort key value for each record is ascertained, based on the generated block number for each record, and added to each record. The multiple records are sorted according to the sort key values in the multiple records. The sorted multiple records are stored in an output file. | 2011-12-29 |
20110320452 | INFORMATION ESTIMATION APPARATUS, INFORMATION ESTIMATION METHOD, AND COMPUTER-READABLE RECORDING MEDIUM - An information estimation apparatus | 2011-12-29 |
20110320453 | System And Method For Grouping Similar Documents - A system and method for grouping similar documents is provided. Frequencies of occurrences are determined for terms and noun phrases within a set of documents. A subset of the documents is selected by removing those documents having terms and noun phrases that fall outside a bounded range of upper and lower conditions for frequency of occurrence. Each of the documents in the subset is mapped to a cluster of documents based on a similarity of the documents to the cluster documents. | 2011-12-29 |
20110320454 | MULTI-FACET CLASSIFICATION SCHEME FOR CATALOGING OF INFORMATION ARTIFACTS - A system and method for constructing a hierarchical multi-faceted classification structure includes organizing a plurality of visual categories into a multi-relational reference ontology that accounts for a plurality of different types of relationships. Media artifacts are categorized into the plurality of visual categories. The categories of artifacts are refined based on faceted ontology relationships or constraints from the multi-relational reference ontology. The multi-relational reference ontology and the one or more media artifacts with relationships are stored as the hierarchical multi-faceted classification structure in computer readable memory storage. | 2011-12-29 |
20110320455 | HINT SERVICES FOR FEATURE/ENTITY EXTRACTION AND CLASSIFICATION - Systems, methods and articles of manufacture are disclosed for extracting a feature of an entity. A data record that includes the feature may be received. The feature may be characterized. Data related to the feature may be retrieved from a data source. The feature may be recharacterized based on the retrieved data. The data source may be updated with an association between the recharacterized feature and the retrieved data. | 2011-12-29 |
20110320456 | TIPS MANAGEMENT SYSTEM AND PROCESS FOR MANAGING ORGANIZATION-WIDE KNOWLEDGE TIPS - The invention provides a method, a system, and a computer program product for managing and distributing knowledge tips in an organization. A member of the organization submits a knowledge tip and one or more data points corresponding to the knowledge tip in a Tips Management System (TiMS). The member associates the knowledge tip with at least one predefined category. A member selects knowledge tips by defining a criterion in TiMS. The member selects category(ies) and/or projects(s) and provides delivery parameters for planning the delivery of knowledge tips to the at least one member. The TiMS delivers the selected knowledge tips to the each member as per the delivery parameters. | 2011-12-29 |
20110320457 | METHOD FOR CREATING AND USING AFFECTIVE INFORMATION IN A DIGITAL IMAGING SYSTEM - An image file for storing a still digital image and metadata related to the still digital image, the image file including digital image data representing the still digital image, and metadata that categorizes the still digital image as an important digital image, wherein the categorization uses a range of levels and the range of levels includes at least three different integer values. | 2011-12-29 |
20110320458 | IDENTIFICATION OF NAME ENTITIES VIA SEARCH, DETERMINATION OF ALTERNATIVE SEARCHES, AND AUTOMATIC INTEGRATION OF DATA ACROSS A COMPUTER NETWORK FOR DYNAMIC PORTAL GENERATION - A dynamic portal generation system includes an indexing module that indexes structured and unstructured data in a database. The database includes information residing in associated standalone applications having documents from information sources, and a name-entity repository that includes name entities and their corresponding name-entity types. A search module searches the information residing in the indexed information to obtain a search result. A name-entity extraction module extracts a matching name-entity that corresponds to a name-entity in the name-entity repository. A portal generation module dynamically generates a portal triggered by the search query. The portal generation module aggregates the search result by a type or a source to form search result segments, renders data extracted from the search result segments in corresponding formats, integrates relevant actions corresponding to search result segments and displays actionable portlets that enable the user to perform additional operations on the information residing in associated standalone applications. | 2011-12-29 |
20110320459 | TERM IDENTIFICATION METHOD AND APPARATUS - A method of assigning an identifier to a mention of an entity in a document carried out by computing apparatus including a display and one or more user operable input devices. A plurality of candidate identifiers are received from a term identification module in respect of a mention of an entity in a document, each candidate identifier being a reference to an entity in connection with which entity property data is stored in one or more entity databases. A list is displayed in a first region of the display, the list having a plurality of user-selectable entries, each entry in the list concerning the entity referred to by one of the said plurality of candidate identifiers, each entry comprising properties of the respective entity. At least one of the said properties is retrieved from the said one or more entity databases. In response to the selection by a user of an entry in the list, additional properties of the entity which the selected entry concerns are displayed in a second region of the display, the additional properties being retrieved at least in part from the one or more said databases. Responsive to an identifier assignment instruction received from a user in connection with a selected entity which a list entry concerns, an identifier of the selected entity is assigned as identifier of the mention of the entity. Filters are provided to enable a user to restrict the entities in connection with which a list entry is provided to those which fulfil user specified criteria. The properties which are displayed in the first and second region of the display are customisable for different domains and applications. | 2011-12-29 |
20110320460 | EFFICIENT REPRESENTATION OF DATA LINEAGE INFORMATION - Presenting data lineage information by assigning a score to a data asset along a path between a data source and a data destination, where a predefined scoring function is applied to a characteristic of the data asset, and presenting via a computer-controlled output medium a description of the data source, the data destination, and the path between the data source and the data destination, where the description includes the data asset if the score meets predefined inclusion criteria. | 2011-12-29 |
20110320461 | CENTRALIZED WEB-BASED SOFTWARE SOLUTION FOR SEARCH ENGINE OPTIMIZATION - A system and method for modifying a parameter of a website in order to optimize an organic listing of the website at one or more search engines is described. Several embodiments include methods and systems for generating scored representations based upon different portions of data associated with a website, and then combining the scored representations to achieve a result. The result indicates a feature of the website that may be modified in order to optimize the organic ranking of the website at one or more search engines. | 2011-12-29 |
20110320462 | METHOD AND APPARATUS FOR RECOMMENDING INFORMATION TO USERS WITHIN A SOCIAL NETWORK - A method and an apparatus for recommending information to users within a social network. The method builds a recommendation list with at least one two-tuple, where each two-tuple comprises a target user name and an information item and ranks the recommendation list by using two-tuples in the recommendation list as a basic unit. By selecting a two-tuple in the recommendation list, the user can recommend a corresponding information item to a user represented by a target user name. An apparatus is also provided by using a builder for building for a user a recommendation list comprising at least one two-tuple and a sorter for ranking the recommendation list by using two-tuples in the recommendation list as a basic unit, such that, by selecting a two-tuple in the recommendation list. | 2011-12-29 |
20110320463 | IMAGE SEARCH DEVICE AND IMAGE SEARCH METHOD - An object of the present invention is to provide an image search device and an image search method by which search efficiency is improved. The image search device includes a personal characteristic database ( | 2011-12-29 |
20110320464 | RETRIEVAL DEVICE - In conventional retrieval techniques for narrowing down a candidate when there are a plurality of candidates as retrieval results, a method results in a huge number of candidates in order to prevent omission of candidates, whereby the administration cost is increased, and another method involves always processing all candidates, whereby the processing time becomes longer and the response performance is lowered. Retrieval history storage means stores a retrieval history including a content input from input means and a candidate list, narrowing-down method selecting means selects, according to the content of the stored retrieval history, a narrowing-down method from a method of limiting search targets to top-ranked candidates and a method of performing a search again based on inputs made in the past, candidate score update means sets, from the search history, a search candidate and a score thereof according to the selected narrowing-down method, and updates a candidate score based on a character string received from the input means with reference to an index for search, candidate determining means determines a candidate to be presented based on a number of candidates and score distribution which are updated, and candidate presenting means presents, to the user, the determined candidate with reference to name information data. | 2011-12-29 |
20110320465 | ANALYSIS PREPROCESSING SYSTEM, ANALYSIS PREPROCESSING METHOD AND ANALYSIS PREPROCESSING PROGRAM - An analysis preprocessing system is provided which is capable of, when large amounts of data are received from a large number of data generation sources, rapidly passing those data to means for analyzing the data in order of time of generation thereof. Data acquisition means | 2011-12-29 |
20110320466 | METHODS AND SYSTEMS FOR FILTERING SEARCH RESULTS - Methods and systems of filtering search results are presented. The filtering may comprise receiving a search query term having a plurality of meanings in a search language; selecting a resolving language including a plurality of resolving language terms, wherein each resolving language term corresponds to one meaning or a related set of meanings of the plurality of meanings of the search query term; identifying a plurality of hits stored on a data source, wherein each hit is a data object associated with one of the resolving language terms; displaying at least two of the plurality of hits; receiving a selection of one of the displayed hits; and displaying one or more of the plurality of hits associated with the same resolving language term as the resolving language term associated with the selected hit. | 2011-12-29 |
20110320467 | Using Message Sampling To Determine The Most Frequent Words In A User Mailbox - A method is presented for generating a list of frequently used words for an email application on a server computer. When a request is received for a word frequency list for emails stored in a user's mailbox, a word frequency list is returned if one exists. If the word frequency list does not exist, an asynchronous process is started on the server computer to generate a word frequency list. If the word frequency list exists but it is older than an aging limit, an asynchronous process is started on the server computer to regenerate the word frequency list. The word frequency list is stored in the user's mailbox along with a timestamp indicating the date and time that the list was created or updated. | 2011-12-29 |
20110320468 | MODULAR SYSTEM AND METHOD FOR MANAGING CHINESE, JAPANESE AND KOREAN LINGUISTIC DATA IN ELECTRONIC FORM - Embodiments can include means for categorizing lexical data, means for accurately describing the structure hierarchical data, means for accommodating lexicons having disparate data structures, means for pooling data from separate lexicons into aggregate lists, means for gathering data from participating users, and specified interfaces for handwriting recognition, optical character recognition, and text-to-speech and speech-to-text conversion. Embodiments can provide significant enhancements in data description, data connectivity and access, data presentation, data enhancement, and input functionality. The input means may be coupled with an electronic implementation of the character lookup invention by the same inventor to facilitate the lookup of individual characters. An exemplary embodiment can comprise a linguistic services center that interfaces with various natural language processing modules such that users of one module can take advantage of the wealth of linguistic information provided in the system. The resulting system may greatly minimize the frustration and inconvenience users typically experience when using Japanese, Chinese, or Korean in electronic contexts. A revenue sharing and data security system is disclosed for encouraging competitors to make their data available to the system in a way that lexical data providers, the OS provider, the LSC provider, and the user may all mutually benefit. | 2011-12-29 |
20110320469 | SHARED ARCHIVES IN INTERCONNECTED CONTENT-ADDRESSABLE STORAGE SYSTEMS - Some of the embodiments herein provide a seamless cloud of storage. This storage may be content-addressable storage. An end application may or may not be exposed to the fact that content-addressable storage is used. Various embodiments herein provide event notification, which may allow applications or users to subscribe to particular events (such as storage of an X-ray by a particular entity). Some embodiments provide for a shared archive. A shared archive may provide homogeneous access to medical data, etc. that was previously stored into the CAS cloud by heterogeneous applications, varied data types, etc. Additionally, embodiments herein allow for the creation and distribution of virtual packages. For example, a user may create a virtual package for all images related to a patient so that she may have a virtual package of all of her medical data to present to a referring physician. | 2011-12-29 |
20110320470 | GENERATING AND PRESENTING A SUGGESTED SEARCH QUERY - The present invention is directed to presenting a suggested search query. Responsive to receiving a user-devised search parameter, a suggested search query is identified. The user-devised search parameter might have been previously received by a search system, or alternatively, might be a unique query that has not been previously received. A suggested search query might be generated using various techniques, such as by applying an n-gram language model. A classification of the suggested search query is determined, and the suggested search query is presented together with a visual indicator, which signifies the classification. | 2011-12-29 |
20110320471 | Movie Recommendation System and Movie Recommendation Method - There is provided a movie recommendation system, including: a scene metadata obtaining module for obtaining metadata which contains keywords associated with scenes, and time axis information indicating times at which the keywords appear, the scenes included in a movie content; a movie content information obtaining module for obtaining information of a movie content to be reproduced by a user; a contents preference information obtaining module for obtaining contents preference information, which is generated by assigning preference of the user to the keywords that are contained in the obtained metadata, based on the obtained information of the movie content; and a scene recommendation module for outputting at least one keyword preferred by the user from among the keywords contained in the movie content, based on the obtained contents preference information, in association with a scene recommended to the user. | 2011-12-29 |
20110320472 | COMPLEX QUERY HANDLING - Processing a query for a database includes: receiving a portion of a query from a client device in a server implemented by at least one processor, the portion of the query comprising an incomplete component; determining that the incomplete component is one of multiple predefined types with the server; providing the incomplete component to an auto-complete function specific to the determined type of the incomplete component; receiving in the server a suggestion for completing the query from the auto-complete function, the suggestion being specific to the type of the incomplete component; and providing the suggestion from the server to the client device. | 2011-12-29 |
20110320473 | DYNAMIC DETERMINATION OF MIGRATION DATA - A method and apparatus for the dynamic determination of migration data is described herein. In one embodiment, a process can be provided to search user data in a first system for migration data without requiring user interaction. The search of user data can be based on a blacklist. The blacklist can include one or more folders which should not be searched for migration data or one or more files which should not be included in the migration data. A search of system data for migration data can be performed without requiring user interaction. The search of system data can be based on a whitelist. The whitelist can include one or more file types. | 2011-12-29 |
20110320474 | Availability of Database Objects During Database Operations - A method, computer program product, and system for providing access to a database object during modification of that object. Upon receipt of a data definition language (DDL) operation specifying a modification to the database object, currently executing database transactions are invalidated in a two-step process of a soft invalidation followed by a hard invalidation. The soft invalidation permits the current database transactions to continue executing while modifying the logical structure of the database object in accordance with the DDL operation, and the hard invalidation waits for the database transactions started prior to the DDL operation to finish execution before modifying the physical structure of the database object in accordance with the DDL operation. After the modification to the logical structure is complete, new database transactions are allowed to execute against the modified database object, thus improving the availability of the object while it is being modified. | 2011-12-29 |
20110320475 | METHODS, APPARATUSES AND COMPUTER PROGRAM PRODUCTS FOR EXTENDING THE CAPABILITIES OF PLATFORM-INDEPENDENT APPLICATIONS ON DEVICES - An apparatus for extending the functionalities of a platform-independent application(s) may include a processor and a memory storing executable computer code that cause the apparatus to at least perform operations including generating a request via a platform-independent application(s). The request comprises a query including information requesting a platform-dependent device to execute instructions. The computer program code may cause the apparatus to send the request to a network entity and receive a message from the network entity comprising data instructing the device to execute the instructions. The computer program code may also cause the apparatus to execute the instructions, via the device, in response to analyzing data of the message and provide results of the executed instructions to the network entity to enable sending of the results to the platform-independent application which may use the results to extend its functionalities. Corresponding computer program products and methods are also provided. | 2011-12-29 |
20110320476 | TELEVISION-BASED SEARCH USING METADATA - A system includes a device such as a television interfaced to one or more servers through a network connection. The device (television) has software that accesses metadata related to a video stream and incorporates at least one search term from the metadata along with optional viewer-provided terms into a search query that is sent to one or more search engines through the network, returning one or more search results which are formatted and displayed on the device. | 2011-12-29 |
20110320477 | Dynamic Icon Overlay System and Method of Producing Dynamic Icon Overlays - A dynamic icon overlay system of a present invention embodiment dynamically generates icon overlays to be applied to a primary file icon of a target file. The icon overlays convey information regarding the target file and are relevant to an end user. The icon overlay system determines icon overlays to be applied to the primary file icon based on attributes associated with an end user of the target file that are correlated with attributes of the target file itself. The system applies the icon overlay to the primary icon and displays the primary icon with the applied icon overlay at an end user system. The applied icon overlay for the same target file may vary for different end users based on user attributes. | 2011-12-29 |
20110320478 | USER MANAGEMENT OF ELECTRONIC DOCUMENTS - Described is the user management of electronic documents. Content selected from a first electronic document is received. Metadata are generated corresponding to the received selected content and a location of the received content in the first electronic document. The metadata are stored and a search term is subsequently received that is also in the received content. In response to a search against a repository, search results are displayed. The search results include an indicator of the first electronic document and an indicator of a second electronic document that includes the search term. The indicator of the first electronic document is displayed higher in the search results than the second electronic document. | 2011-12-29 |
20110320479 | COLLECTIONS FOR STORAGE ARTIFACTS OF A TREE STRUCTURED REPOSITORY ESTABLISHED VIA ARTIFACT METADATA - At least one unique collection of storage artifacts can be specified to indicate that the storage artifact is a member of the unique collection. Each storage artifact can be a discrete object comprising digitally encoded content that is stored as a node within a tree structure of a tangible storage medium. The collection can be referenced by a set of different storage artifacts to form a collection of related storage artifacts. Each storage artifact can correspond to different collections, wherein membership within a collection is independent of a storage path within the tree structure. A file management action relating to the storage artifact can be performed. The file management action can be dependent upon the storage artifact being a member of the unique collection. | 2011-12-29 |
20110320480 | Enterprise Evidence Repository - A controller is configured to generate and propagate instructions to an execution agent which, in turn, is configured to collect and deposit collected artifacts into a repository. Write access to a location in the repository for collected artifacts that are to be deposited into a specified location is granted to the execution agent. Once the execution agent deposits the collected artifacts in the specified location in the repository, a summary of collected artifacts is propagated to the controller. The controller manages appropriate levels of access to the collected artifacts, while the repository enforces the level of access. The controller can grant read only access to the collected artifacts or it can allow for controlled changes to be made to the metadata associated with the collected artifact. An agent processes the data and generates additional metadata that can be associated with the collected artifacts and then saved in the repository. A system can have more than one repository, where the controller allocates storage in an appropriate repository and issues instructions to the execution agent with the location in an appropriate repository. The summary of the actual collections is then propagated to the controller from the repositories. | 2011-12-29 |
20110320481 | SEARCHING AND MATCHING OF DATA - Described herein is a technology for facilitating searching and matching of data. In some implementations, an input data string, including one or more ideographic elements, is received and converted to a Latin-based input data string. One or more input keys may be generated based on the Latin-based input data string. A reference database may be searched for one or more candidate records indexed by at least one of the one or more input keys. If the one or more candidate records are found, a match score is determined for the one or more candidate records. | 2011-12-29 |
20110320482 | CONTEXT-BASED RECOMMENDER SYSTEM - The present invention relates to a recommender system and method comprising a first extractor (S | 2011-12-29 |
20110320483 | MEDIA FILE MANAGEMENT SYSTEM AND METHOD FOR HOME MEDIA CENTER - The present invention provides a media file management system and method for a home media center, which enable media files such as images or photos, music and movies included in a variety of information appliances to be conveniently edited on a screen of a display apparatus connected to a home media center. A search window in which media files to be searched are displayed or an edit window in which a media file to be edited is displayed are created. Then, if a user selects a file edit command for a media file displayed in the search window, the selected file edit command is executed and results of the execution of the file edit command are displayed in the edit window. | 2011-12-29 |
20110320484 | SYSTEM AND METHOD FOR VERIFICATION OF PERSONAL IDENTITY - A system and method for storing identifying information and telephone numbers associated with individuals, and cross-referencing said information so as to link a first individual to other referee individuals capable of identifying the first individual as a result of a telephone conversation. When a relying party wishes to confirm the identity of a contracting party, the system is contacted and, using identifying information pertaining to said contracting party, identifies the set of referee individuals capable of identifying said contracting party, contacts a referee selected at random from the set, and places the contracting party in telephonic communication with the referee. At the conclusion of said telephonic communication, said system invites the referee to state the name of the first individual; by comparing the voice sample with a stored voice sample, the apparatus then provides identity confirmation to said relying party. | 2011-12-29 |