26th week of 2013 patent applcation highlights part 64 |
Patent application number | Title | Published |
20130166490 | PNEURON DISTRIBUTED ANALYTICS - A method and system for the integration of disparate data stored within an Information Technology infrastructure of a company is provided. The system and method enables holistic, real time control of data discovery, retrieval and analysis. The system combines data mining, retrieval and analytics at the source of the data, thereby solving traditional problems with disparate and distributed data, systems, business processes and analytics across an organization. The system enables a user to configure and target data, then apply rules, workflows and analytics from one central source. This process is accomplished by distributing functions in the form of software pneurons against the existing infrastructure for maximum processing while preserving a robust and extendable suite of definitions. The system uses the existing application, network and hardware assets and enables connection to the native data, maps only the data fields that need to be mapped to carry out the desired analysis, runs the analysis and then returns the data to a central location to be assembled, analyzed, organized and/or reported. | 2013-06-27 |
20130166491 | METHOD AND DEVICE FOR CLASSIFYING A PACKET - Embodiments of the present invention provide a method and a device for classifying a packet, which relates to the field of communications technologies, so as to reduce rule duplication in a classification process and improve classification efficiency. The method for classifying a packet provided by the embodiment of the present invention includes: receiving a packet ( | 2013-06-27 |
20130166492 | Digital Rights Management Using a Digital Agent - A method for digital rights management includes a digital agent for contacting a media host. Media content is compared to a user profile and an identification confidence level is assigned to the media based on the comparison. A digital agent contacts a host of the media based on the identification confidence level, the type of media, and the context of the media. The digital agent requests one or more actions of a media host based on user designations concerning information related to the media. The identification confidence level is generated based on a plurality of user characteristic confidence levels which are generated based on media being analyzed. | 2013-06-27 |
20130166493 | METHOD AND SYSTEM FOR ONLINE FERRORESONANCE DETECTION - The invention concerns a method and a system for online ferroresonance detection in a high voltage electrical distribution network. The method includes:
| 2013-06-27 |
20130166494 | HIERARCHICAL BEHAVIORAL PROFILE - In a hierarchical profile, each node represents at least one feature of behavioral data collected about an entity profiled, with the topmost node selected as the “statistically most informative” feature of the data. A profile can cover numerous domains and be predictively very powerful in each domain. A number of observations can be “aggregated” together into a single datapoint. In use, the structure of the profile is compared against current information associated with the entity to produce a recommendation or prediction. If the profile represents at least some data aggregation, then new observations are folded into the profile based on statistical weights of the aggregations. Because of the way the profile is created and updated, its hierarchical structure maps the collected observations. Therefore, as new observations are incorporated, if the new observations change the profile's structure significantly, then it can be hypothesized that something “interesting” has happened to the entity. | 2013-06-27 |
20130166495 | GENERATING A COMPILER INFRASTRUCTURE - In an embodiment, the compiler infrastructure allows execution of multidimensional analytical metadata from various databases by providing a generic transformation. A compilation request to execute a multidimensional analytical metadata is received. A type of the compilation request is determined to identify an associated transformation and corresponding transformation rules. Based upon the type of compilation request, a database of an application server is queried to retrieve the corresponding multidimensional analytical metadata. Based upon the identified transformation rules, the multidimensional analytical metadata is transformed into a generic metadata that is executable by any desired engine. An instance of a calculation scenario is generated based upon the transformation. The compiler infrastructure is generated by deploying the instance of the calculation scenario in the desired engine (e.g. in-memory computing engine.) | 2013-06-27 |
20130166496 | EXECUTING RUNTIME CALLBACK FUNCTIONS - In an embodiment, a runtime callback function is a part of a code that is invoked upon execution of an associated function. To execute the runtime callback function associated with an in-memory computing engine, multidimensional analytical metadata associated with an application server is received and transformed into an in-memory executable metadata, to generate an instance of an in-memory executable calculation scenario. The instance of the in-memory executable calculation scenario is analyzed to determine process callbacks associated with nodes of the in-memory executable calculation scenario. Based upon the determined process callbacks, the runtime callback function is executed by executing a selection callback at the nodes and a transformation callback at part providers associated with the in-memory executable calculation scenario. | 2013-06-27 |
20130166497 | DYNAMIC RECREATION OF MULTIDIMENSIONAL ANALYTICAL DATA - According to one aspect of systems and methods for dynamic recreation of multidimensional analytical data, lost sets of calculation scenarios that provide multidimensional analytical data results after aggregations and transformations of the multidimensional analytical data are recreated in the volatile storage of an in-memory computing engine. A multidimensional analytical data view (MDAV) compiler is triggered to read the MDAV metadata stored in an intermediate buffer in the MDAV compiler. The read MDAV metadata is compiled into a calculation scenario including calculation view metadata. The calculation view metadata is stored in the intermediate buffer. The recreated set of calculation scenarios is deployed on the in-memory computing engine. | 2013-06-27 |
20130166498 | Model Based OLAP Cube Framework - Systems, methods and computer program products that provide a framework for the creation, editing, manipulation and use of model-based, multidimensional analysis services (MAS) cubes are disclosed. A method of generating a model-based MAS cube comprises creating a data source comprising a data warehouse in the memory via the processor, creating a data source view providing a dimension, a fact and an outrigger from the created data source, and creating the MAS cube comprising at least one measure group. A key performance indicator (KPI) may be calculated from the MAS cube as a scorecard of a display associated with the processor. A user of the model-based MAS cube may create a new cube by targeting a set of facts and adding dimensions to the facts. | 2013-06-27 |
20130166499 | Determination of a Most Suitable Address for a Master Data Object Instance - The present disclosure involves computer-implemented methods, software, and systems for determining a most suitable address for a master data object instance for a given usage in a business transaction document, master data object, or business process. A computer-implemented method includes determining, using at least one computer, an address determination sequence, applying the address determination sequence to available address instances of a master data object instance, identifying a most suitable address from among the available instances, and retrieving an address value from the identified most suitable address instance. | 2013-06-27 |
20130166500 | EFFICIENT HANDLING OF ADDRESS DATA IN BUSINESS TRANSACTION DOCUMENTS - The present disclosure involves computer-implemented methods, software, and systems for efficiently handling address data in business transaction documents.. A computer-implemented method includes receiving a modification to address data associated with an existing address instance, receiving, using at least one computer, an indication of a modification type, creating a new snapshot instance, associating the modified address data with the new snapshot instance, retrieving a unique reference value for the new address snapshot instance, and associating the unique reference value identifying the new address snapshot instance with the address instance. | 2013-06-27 |
20130166501 | METHOD AND SYSTEM FOR DATA FILING SYSTEMS - A method for updating data to ensure the correct version of the data is available for a user of a second data system. In the second data system, an update request is received from a first data entity to update the data in a component of the second data system. The update request comprises an updated version of the data. The updated version of the data is compared with a currently stored version of the data in the second component to determine a change therein. An operating function representative of the change in the data is produced. The operating function is applied to the currently stored version of the standard data to produce resulting data. The operating function is stored to ensure the correct version of the data is capable of being output if requested. | 2013-06-27 |
20130166502 | SEGMENTED STORAGE FOR DATABASE CLUSTERING - This document describes, in various implementations, segmenting data of a database cluster into a plurality of segments, the data including a plurality of tuples, each segment including at least one of the tuples, and distributing the plurality of segments among nodes of the database cluster. Rebalancing of the data of the database cluster may be achieved by copying at least one of the plurality of segments from a source node of the database cluster to a destination node of the database cluster. | 2013-06-27 |
20130166503 | FILE CLOUD SERVICE APPARATUS AND METHOD - Disclosed is a file cloud service apparatus that is not a file cloud system for simply sharing a file between users, but a social file cloud server that enables social information about a file shared within a group to be used by including a comment of a user or scores on a file in file metadata information in group sharing. The file cloud service apparatus may construct a single system together with a file cloud client apparatus by adding social information of the user on the file and thereby may provide an efficient social sharing service. The file cloud service apparatus becomes a base for providing a user-oriented file cloud service. | 2013-06-27 |
20130166504 | SYSTEMS AND METHODS FOR VIRTUAL MACHINE MIGRATION - Migration or cloning of a source machine from a source platform to a destination platform includes collecting an image of the source machine in a storage device of a migration platform, converting the image of the source machine for deployment in a virtualization environment, deploying the converted image to a selected virtualization environment in the destination platform, and synchronizing data of the deployed converted image to current data on the source machine, if the data on the source machine has changed since the image of the source machine was collected. | 2013-06-27 |
20130166505 | MONITORING REPLICATION LAG BETWEEN GEOGRAPHICALLY DISPERSED SITES - A method for detecting replication lag is described. In an embodiment, a local timestamp is generated at a first computer. The local timestamp is stored in an electronic folder. If a replication triggering event occurs, the electronic folder is replicated at one or more target computers. If an update triggering event occurs, the local timestamp in the electronic folder is updated. If a detection triggering event occurs, a request for at least a portion of the electronic folder representing the local timestamp is sent to at least one target computer of the one or more target computers. At least the portion of the electronic folder representing the local timestamp is received from the at least one target computer. If the time difference between one or more of the received timestamps and the local timestamp exceeds a threshold amount, a system event is generated. | 2013-06-27 |
20130166506 | DATA CHANGE MANAGEMENT THROUGH USE OF A CHANGE CONTROL MANAGER - The present description refers to a computer implemented method, computer program product, and computer system to store a node dependency network that includes a plurality of data nodes and one or more links between two or more data nodes, each link representing a data dependency between instances of the two or more data nodes, to forward a requested change to a first data node from a first change control component to a change control manager, identify, by the change control manager based upon the links within the node dependency network, one or more dependent data nodes that are dependent upon the first data node, and determine one or more dependent changes to be performed to one or more instances of the dependent data nodes to maintain consistency among instances of the data nodes. | 2013-06-27 |
20130166507 | Declarative synchronization of shared data - Methods and apparatus, including computer systems and program products, related to declarative synchronization of shared data. One method includes receiving one or more changes to data maintained by one of multiple computer programs having respective local copies of the data, identifying an event characterizing synchronization of the data maintained by the computer program with the other computer programs (e.g., with a local copy managed by the other computer program), and initiating synchronization of the changes with one of the other programs having respective local copies (e.g., with the local copy managed by the other program) in response to the event occurring. The event can be characterized by an annotation. Identifying an event can include reading a property of a data object (e.g., in a data object graph of shared data). | 2013-06-27 |
20130166508 | Multiphase Approach To Data Availability - Embodiments include a method, apparatus and computer program product for providing access to a database data source during database maintenance. The method includes initiating maintenance of the database data source and managing the database maintenance to allow concurrent access to the database data source. | 2013-06-27 |
20130166509 | Version Management for Application Execution Environment - Methods, systems, and apparatus, including medium-encoded computer program products, for managing an application execution environment on a computer. One or more aspects of the subject matter described in this specification can be embodied in one or more methods of managing an application execution environment, the one or more methods including: identifying which of multiple different versions of the application execution environment are installed on a computer; and managing the different versions of the application execution environment on the computer; wherein the identifying and the managing are performed using one or more of the different versions of the application execution environment. | 2013-06-27 |
20130166510 | Deduplication of Encrypted Data - A mechanism is provided which allows to de-duplicate encrypted data such that the de-duplication ratio for encrypted data is similar to the de-duplication ration of the corresponding un-encrypted data and the purpose of encryption is not obfuscated, i.e. only the originator of the data (the client) can decrypt—and hence read—the data. This is achieved by interwoven the de-duplication algorithm with the encryption algorithm in a way that the data are encrypted with a key that is generated from the unencrypted data. Afterwards, that key is itself encrypted with an encryption key being private to a particular client. Due to the fact that the private key is not effecting the encrypted data stream, it can still be de-duplicated efficiently. | 2013-06-27 |
20130166511 | DETERMINING AN OVERALL ASSESSMENT OF A LIKELIHOOD OF A BACKUP SET RESULTING IN A SUCCESSFUL RESTORE - A point-in-time backup image is selected from a plurality of backup images of an image on a source computer system to be applied to the target computer system. A first assessment value is associated with an extent to which critical files and recovery metadata are included in the selected backup based on an include list of critical files and recovery metadata to include in the backup. A second assessment value comprises a backup status of the critical files and the recovery metadata. A third assessment value is indicative of an extent to which the selected backup satisfies requirements of a retention policy. A fourth assessment value is indicative of an extent to which computational resources and device drivers in the target computer system are compatible. An overall assessment value for the selected backup image is determined based on the determined first, second, third, and fourth assessment values. | 2013-06-27 |
20130166512 | METHODS AND SYSTEMS FOR IMPLEMENTING A SELF DEFENDING/REPAIRING DATABASE - This disclosure describes, generally, methods and systems for self defending and repairing a database. The method includes monitoring, at a database server, code modifications to a database management application. The database management application is configured to maintain the database. The method further includes determining that a code modification has occurred to the database management application. The method further includes checking the code modification for the presence of an authorization key, and in response to an invalid or non-existent authorization key, determining that the code modification is unauthorized. Further, the method includes quarantining the modified code in a secure storage location, and automatically accessing original code of the database management application and replacing the modified code with code from the original code of the database management application. | 2013-06-27 |
20130166513 | METHODS FOR ANALYZING A DATABASE AND DEVICES THEREOF - A method, non-transitory computer readable medium, and apparatus for analyzing a database includes obtaining SQL code defining one or more databases, each including a plurality of objects, wherein the SQL code is stored on one or more database servers. Defects in the SQL code are identified by applying a plurality of rules to the SQL code. Information regarding each identified defect is stored. The information regarding each identified defect is selectively provided to one or more defect closing interface modules. | 2013-06-27 |
20130166514 | Verifying Authenticity of Input Using a Hashing Algorithm - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for verifying a message based on application of a hashing algorithm. In one aspect, a method includes identifying a file and a key value and processing the file using multiple nonlinear functions to generate an output hash value, where the operations performed by the nonlinear functions are modified based on the key value. The file can then be verified based on the output hash value. | 2013-06-27 |
20130166515 | GENERATING VALIDATION RULES FOR A DATA REPORT BASED ON PROFILING THE DATA REPORT IN A DATA PROCESSING TOOL - In one embodiment, the method includes profiling a data file comprising one or more fields of data. The one or more fields of data contain an item of data; that is, a character, or group of characters that are related. Further, the method includes generating one or more profiling attributes based on profiling the data file. In an example, the one or more profiling attributes refer to profiling information relating to pattern, structure, content and format of data. Further, the method includes selecting at least one of the generated one or more profiling attributes and generating a validation rule based on the selected at least one profiling attribute. | 2013-06-27 |
20130166516 | APPARATUS AND METHOD FOR COMPARING A FIRST VECTOR OF DATA ELEMENTS AND A SECOND VECTOR OF DATA ELEMENTS - A data processing apparatus includes a comparison unit configured to perform an element comparison process performing a comparison of a first data element at a first index in the first vector with a second data element at a second index in the second vector. A hazard vector generation unit is configured to populate a hazard vector at an index determined by the first index with a value determined by the second index. The comparison unit performs the element comparison process by iteratively comparing data elements of the first vector with each element of a subset of the second vector. It then determines the subset of the second vector as those data elements at indices in the second vector which are less than a current index of the first vector and which are greater than previously determined values of the second index for which the match condition was true. | 2013-06-27 |
20130166517 | SYSTEMS AND METHODS FOR LOCATING APPLICATION SPECIFIC DATA - A system and a method for locating application-specific data that has been previously deleted and located in an address of the data storage device marked as being available for storing new data. The method includes accessing unidentified data from at least one data storage device; examining the unidentified data to detect at least one application-specific data pattern associated with at least one application; for each detected application-specific data pattern, executing an application-specific validation process to determine whether the unidentified data includes valid data associated with a corresponding application; and if it is determined that the unidentified data includes valid data associated with the corresponding application, then recovering the valid data. | 2013-06-27 |
20130166518 | Compression Of Genomic Data File - Systems and methods for compression of a genomic data file are described herein. In one embodiment, genomic sequences, sequence headers, and quality sequences associated with a plurality of data streams provided in a genomic data file are identified. Each of the genomic sequences includes at least one of primary characters and secondary characters. Further, the secondary characters from each of the genomic sequences may be removed to obtain an intermediate genomic sequence file and a quality score corresponding to the secondary character may be modified in quality sequences to obtain an intermediate quality sequence file. Based on the intermediate genomic sequence file and the intermediate quality sequence file, a modified genomic sequence file and a modified quality sequence file, respectively are generated. A compressed genomic data file is obtained using at least the modified genomic sequence and the modified quality sequence. | 2013-06-27 |
20130166519 | DEVICE ACCESS SYSTEM - Storage system that includes: an address search section for i) storing an address for frequent use data and a data index assigned to the address, ii) acquiring an address of write or read data, and iii) searching stored addresses with the acquired address, a frequent use data storage section for i) storing a tag related to the use data and the index, ii) acquiring the index when an address acquired by the search section has hit a stored address, and iii) identifying frequent use data that corresponds to the tag, a data comparator for i) acquiring the frequent use data from the storage section, ii) comparing the data with write data, and iii) identifying frequent use data that hit the write data, and an compression-expansion section for acquiring and compressing the write data and the frequent use data from the comparator, and for acquiring the read data. | 2013-06-27 |
20130166520 | MONITORING BEHAVIOR WITH RESPECT TO A SOFTWARE PROGRAM - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, used to monitor behavior with respect to a software program. In one aspect, a method includes playing media content using a first program that is limited to a first security context corresponding to a first domain of the first program, the first program having an object in the first security context corresponding to the media content; receiving an event including information indicating a monitoring program; instantiating the monitoring program in a second security context that is applicable to multiple domains, including the first domain, the instantiated monitoring program having access from the second security context to the object of the first program in the first security context; and receiving from the monitoring program information regarding playing of the media content. | 2013-06-27 |
20130166521 | DETERMINING WHETHER A SELECTED BACKUP SET SATISFIES A RETENTION POLICY - Provided are computer program product, system, and method for assessing a backup image comprising a backup of a source computer system to recover to a target computer system. A point-in-time backup image is selected from a plurality of backup images taken of an image on the source computer system, wherein the selected backup is to be applied to the target computer system. A determination is made from a plurality of retention policies applicable to files included in the source computer system a most restrictive retention policy. A determination is made as to whether the selected backup image satisfies the most restrictive retention policy. A retention status of the backup image is set based on whether the determined version of the selected backup satisfies the most restrictive retention policy. The retention status is presented for use in determining whether to use the selected backup image. | 2013-06-27 |
20130166522 | TIME SLIDER OPERATOR FOR TEMPORAL DATA AGGREGATION - Calculation of aggregated values in a history database table can be optimized using an approach in which an ordered history table is accessed. The ordered history table can include a sequential listing of commit identifiers associated with updates, insertions, and/or deletions to values in the database table. The ordered history table can be traversed in a single pass to calculate an aggregation function using an optimized algorithm. The optimized algorithm can enable calculation of an aggregated metric of the values based on a selected method for tracking invalidated values to their corresponding commit identifiers. The calculated metric is generated for a current version of the database table; and promoted. | 2013-06-27 |
20130166523 | Parallel Execution In A Transaction Using Independent Queries - Embodiments include a method, apparatus and computer program product for executing a database transaction in parallel using subtransactions. The method includes receiving a transaction at an application, the transaction having a first statement and a second statement, and determining whether operation of the first statement is independent from operation of the second statement. When it is determined that operation of the first statement is independent from operation of the second statement, assigning the first statement to a first subtransaction and the second statement to a second subtransaction, the first and second subtransactions being part of a transaction group. The method further includes executing the subtransactions using resources of the database. Finally, when execution of all of the subtransactions have successfully completed, committing all of the subtransactions. | 2013-06-27 |
20130166524 | DATA COMMUNICATION BETWEEN MODULES - A method is proposed for exchanging a data set between a transmitting module, associated with a first domain, and a destination module associated with a second domain. The transmitting module and the destination module are adapted to be loaded into a browser module having access to a local database for recording data and accessing the data recorded by one or more modules belonging to a single browsing domain and to any module loaded in the browser module that is also associated with said single browsing domain. The method comprises the following steps: storage, by a storage module associated with a third domain, of the data set in the local database; requesting a receiving module, associated with the third browsing domain, to read the data set; reading, by the receiving module, of the data set in the local database. | 2013-06-27 |
20130166525 | PROVIDING APPLICATION RESULTS BASED ON USER INTENT - Methods, computer systems, and computer-readable storage media for providing application results related to user intent with respect to a topic-of-interest are provided. A user search session is monitored and upon discerning a requisite level of user intent with respect to the topic-of-interest, applications residing on the user device that provide application results related to the user intent are determined. A request for the application results is communicated to the applications, and the applications results are received from at least a portion of the applications. The application results are integrated with a set of Web-based results; the results are ranked and are presented on a user interface. | 2013-06-27 |
20130166526 | CONVERSATIONAL QUESTION AND ANSWER - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for facilitating online conversation. In one aspect, a method includes obtaining a search query; identifying, by a search engine, resources that are responsive to the search query, wherein the resources include information that references an online conversation in which a user has submitted questions to be viewed by trusted participants and one or more of the trusted participants has replied to the question, and wherein the trusted participants include the user, one or more advertisers and one or more social network friends of the user; and providing information that identifies the resources for display. | 2013-06-27 |
20130166527 | SYSTEM AND METHODS THEREOF FOR DYNAMICALLY UPDATING THE CONTENTS OF A FOLDER ON A DEVICE - A method and system for dynamically updating contents of a folder on a mobile device. The system comprises identifying at least a folder on the mobile device as a dynamic folder; determining at least a context parameter respective of the dynamic folder; searching for applications that can be added to the dynamic folder respective of the at least context parameter; generating an icon respective of each application found by the search; and displaying each icon respective of each application in the dynamic folder. | 2013-06-27 |
20130166528 | System And Method For Generating A Search Index And Executing A Context-Sensitive Search - A search index is received at a server from a client device. The search index is predetermined by the client device based on content information and context information for objects browsed by the client device. Each object was individually browsed under concurrent control of a user of the client device. The context information is not inherent to the object and is determined from the user's browsing history. Search criteria is received at the server. An object having associated context information that matches the search criteria is retrieved based on the received search index. an identifier of the retrieved object is transmitted from the server. | 2013-06-27 |
20130166529 | COMPUTER-IMPLEMENTED SEARCH USING RESULT MATCHING - A computer search system compares search results received for searches falling within a defined parameter envelope used for grouping search requests. The parameter envelope may be defined by various parameters, for example, time of search, origin or search request, language, or other non-keyword data associated with each search request, excluding keywords used to define the search. Each new search result (comprising a list of search hits) for incoming search requests is compared to stored search results for search requests within the same parameter envelope. Search results that are found to be similar based on a pre-defined similarity measure are provided as related search results responsive to the incoming search requests. A client-side pseudo-browsing application may control interactions with the search engine, collecting true browsing input from the client and providing pseudo-browsing information to the search engine or other information provider. | 2013-06-27 |
20130166530 | Method and System for Analyzing Data Using a Query Answering System - A natural language query answering system includes an external data pre-processor configured to i) analyze a first data set, the first data set received via a communication network, to identify data in the first data set that corresponds to entities in a database comprising categorized entities, and ii) generate a second data set corresponding to the first data set and based on the analysis of the first data set, wherein the second data set includes information indicating how data in the second data set is to be interpreted by the natural language query answering system. The natural language query answering system is configured to retrieve data and/or process data from the second data set in response to natural language queries. | 2013-06-27 |
20130166531 | DATA BROWSER FOR GROUP-BY DATA ACCESS - Methods and apparatus, including computer program products, are provided for group-by access of a database. In one aspect there is provided a method. The method may include receiving from a user interface information defining a database and a database table; converting the received information into at least one instruction for performing the group-by and the sum at the database table included in the database; sending the at least one instruction to the database; receiving, in response to the at least one instruction sent, a result-set from the database, the result-set representative of the group-by and the sum of the database table; and providing the result-set to an interface. Related systems and articles of manufacture are also discloses. | 2013-06-27 |
20130166532 | STRING SEARCHES IN A COMPUTER DATABASE - A query optimizer improves string searches in a computer database that sequentially search for a string in a database record. The query optimizer optimizes the query to search records of a database from a specified start position other than the beginning of the record. The specified start position of the search may be determined by from historical information stored from previous searches. Alternatively, the query optimizer determines the specified start position of the search based on an overriding starting position provided by a system administrator. The query optimizer may also direct that the database record be reorganized to more efficiently search for strings in the record. | 2013-06-27 |
20130166533 | STRING SEARCHES IN A COMPUTER DATABASE - A query optimizer improves string searches in a computer database that sequentially search for a string in a database record. The query optimizer optimizes the query to search records of a database from a specified start position other than the beginning of the record. The specified start position of the search may be determined by from historical information stored from previous searches. Alternatively, the query optimizer determines the specified start position of the search based on an overriding starting position provided by a system administrator. The query optimizer may also direct that the database record be reorganized to more efficiently search for strings in the record. | 2013-06-27 |
20130166534 | Hybrid Database Table Stored as Both Row and Column Store - A hybrid database table is stored as both a row and a column store. One or more techniques may be employed alone or in combination to enhance performance of the hybrid table by regulating access to, and/or the size of, the processing-intensive column store data. For example during an insert operation, the column store data may be searched for a uniqueness violation only after certain filtering and/or boundary conditions have been considered. In another technique, a hybrid table manager may control movement of data to the column store based upon considerations such as frequency of access, or underlying business logic. In still another technique, querying of the hybrid table may result in a search of the column store data only after an initial search of row store data fails to return a result. | 2013-06-27 |
20130166535 | Generic outer join across database borders - Methods and apparatus, including computer program products, are provided for receiving an indication of a defined outer join to enable obtaining a first database table at a first database and a second database table at a second database; sending a first request to the first database to obtain the first database table; sending a second request to the second database to obtain the second database table; receiving, in response to the first and second requests, each of the first and second database tables; performing an outer join on the received first and second database tables, the outer join forming an output database table; and providing the output database table. | 2013-06-27 |
20130166536 | DATABASE QUERY GOVERNOR WITH TAILORED THRESHOLDS - A query governor intelligently sets tailored thresholds for a query accessing a computer database. The query governor preferably generates a tailored threshold for each query sent to the database for execution. The tailored threshold for the query is preferably compared to an estimated query execution time to determine whether to execute the query. The query governor uses one or more factors applied to a standard threshold to generate the tailored threshold. The factors preferably include user factors and query factors. These factors are dynamically adjusted by the query governor in an intelligent way to increase optimal use of the database. Other factors may include factors such as job priority factor, resource factor and an application factor. | 2013-06-27 |
20130166537 | DISTRIBUTED MULTI-STEP ABSTRACT QUERIES - Techniques for incorportating query results into an abstract database are described. Embodiments receive a first set of query results produced by executing a first abstract query using a first data abstraction model against a first database. One or more mappings between the first set of query results and one or more logical fields in a second data abstraction model are then determined, where the second data abstraction model models underlying physical data in a manner making a schema of the physical data transparent to a user of the second data abstraction model. Embodiments modify one or more logical field definitions to reference the first set of query results using the determined one or more mappings, such that abstract queries can be executed against both the second database and the first set of query results using the modified second data abstraction model. | 2013-06-27 |
20130166538 | Panoptic Visualization Document Database Management - A system includes a database management system engine, data manipulation subsystem and layout engine. The management system engine is configured to manage a database having stored therein a panoptic visualization document collection of document components each of which has associated metadata providing information about the respective document component, with the document components and metadata being stored in respective records of the database. The data manipulation subsystem includes a query language engine configured to receive a request for the respective records of document components and associated metadata, and the management system engine is configured to retrieve the requested, respective records from the database. The layout engine is configured to generate a layout of panoptically-arranged visual representations of the document components. And the query language engine is configured to communicate the layout and retrieved, respective records of the associated metadata. | 2013-06-27 |
20130166539 | DISTRIBUTED MULTI-STEP ABSTRACT QUERIES - Techniques for incorportating query results into an abstract database are described. Embodiments receive a first set of query results produced by executing a first abstract query using a first data abstraction model against a first database. One or more mappings between the first set of query results and one or more logical fields in a second data abstraction model are then determined, where the second data abstraction model models underlying physical data in a manner making a schema of the physical data transparent to a user of the second data abstraction model. Embodiments modify one or more logical field definitions to reference the first set of query results using the determined one or more mappings, such that abstract queries can be executed against both the second database and the first set of query results using the modified second data abstraction model. | 2013-06-27 |
20130166540 | SYSTEM AND METHOD FOR MONITORING AND ANALYZING SOCIAL NETWORK DATABASES - A system and method for monitoring and analyzing social network databases to determine actual key influencers is disclosed. Inputs are received from the user, which includes search keyword(s), time, date, language, area and country. Content corresponding to the user inputs is fetched from the social network databases. The fetched content is analyzed to identify a list of probable key influencers. Among the probable key influencers, actual key influencers are determined based on parameters associated with the probable key influencer. Reports may be generated based on the actual key influencers and the content they posted on the social network. | 2013-06-27 |
20130166541 | FAST INDEX WITH SUPPLEMENTAL STORE - A hardware and/or software search facility for searching and retrieving data stored on a mobile device. An index to the data is stored in fast memory (e.g., RAM) on the mobile device. The index contains a minimal amount of information necessary to present search results to a user. A supplemental data file is stored in storage that is local to or remote from the mobile device. The supplemental data files contain additional organized data that may be used to enhance the search results. In response to a search query, the facility uses the index to identify results that are responsive to the search query. The results are presented by the facility in accordance with predetermined rules. The facility may use the supplemental data file to perform further processing and present additional information. In some embodiments, the facility may mount or unmount indices and supplemental files from a device. | 2013-06-27 |
20130166542 | UNIFYING HETROGENOUS DATA - Systems of computer hardware for unifying data are presented including: a complex enterprise query client; a web sphere federation server (WSFS) electronically coupled with the complex enterprise query client, the WSFS configured for receiving a complex query from the complex enterprise query client; a first and second data service wrapper of a number of wrappers configured for transforming a first and second sub-query of the complex query corresponding with a first and second data type into a first and second data query; and a network traversal framework configured for receiving the first data query and the second data query, for sending consolidated first and second data results corresponding with the first and second data query to the first and second data service wrapper. | 2013-06-27 |
20130166543 | CLIENT-BASED SEARCH OVER LOCAL AND REMOTE DATA SOURCES FOR INTENT ANALYSIS, RANKING, AND RELEVANCE - A search engine that resides on a local computer to enable query intent analysis, results ranking, and relevance processing over data of both local and remote data sources. The architecture also employs a global access component, which is a unified interface to disparate data discovery paradigms. The global access component provides access to corresponding disparate datasets of the paradigms for creating aggregation of information. A local search engine creates the aggregations of information from the disparate datasets via the global access component and processes a query against the aggregations of information to return search results. | 2013-06-27 |
20130166544 | GENERATING RANKED SEARCH RESULTS USING LINEAR AND NONLINEAR RANKING MODELS - Generating ranked search results includes receiving a plurality of matching information items that match a search request, ranking at least some of the plurality of matching information items using a linear ranking model that linearly combines a first plurality of feature values to obtain a first set of ranked results, ranking at least some of the first set of ranked results using a nonlinear ranking model that nonlinearly combines a second plurality of feature values to obtain a second set of ranked results, and provide a search response based on the second set of ranked results. | 2013-06-27 |
20130166545 | GENERATING SIMULATED CONTAINMENT REPORTS OF DYNAMICALLY ASSEMBLED COMPONENTS IN A CONTENT MANAGEMENT SYSTEM - A content management system (CMS) uses a simulated containment report generation mechanism to generate a simulated containment report for elements in the repository based on logged properties that represent potential use of the element during dynamic content delivery that are not represented in formal relationships in the content management system. Properties such as probability, popularity, and recent usage that are not explicit relationships between parent documents and child elements are logged and used to determine which document maps may potentially reuse a selected element. In this manner a simulated containment report can be created for an element that allows the user to see the document maps that are most likely to include the element. | 2013-06-27 |
20130166546 | Single Access Method for Multiple Media Sources - Method and systems for searching for media instances of interest to a user are described. User input specifying criteria for content is received and parameters are defined based on the user input. A plurality of databases are searched for media instances meeting the defined parameters, wherein the plurality of databases includes at least one database containing broadcast television content information and at least one database containing non-broadcast television content information. Information about the media instances meeting the defined parameters is retrieved from the plurality of databases. The retrieved information is provided to the user. | 2013-06-27 |
20130166547 | GENERATING DYNAMIC HIERARCHICAL FACETS FROM BUSINESS INTELLIGENCE ARTIFACTS - Systems and methods for generating dynamic hierarchical facets from business intelligence artifacts are described herein. In accordance with one aspect of the present disclosure, grouping information is extracted from one or more business intelligence artifacts or a semantic layer. Facets or categories are dynamically linked based on the extracted grouping information to generate one or more hierarchical facets. The hierarchical facets may be incorporated in search results to facilitate ease of navigation. | 2013-06-27 |
20130166548 | System and Method for Providing Information Navigation and Filtration - A system and method for information navigation and filtration is provided. One or more query terms are received from a user. A preliminary relevance of one or more objects associated with an enterprise system is determined based on the query terms. The preliminary relevance may be propagated between objects. At least one rating is assigned to the one or more objects based on the preliminary relevance. An overall relevance of the one or more objects is established based on the at least one rating. The one or more objects are ranked according to the overall relevance. Data is provided as search results comprised of the one or more objects according to the ranking to the user. The search results may then be filtered based on at least one selected, dynamically generated filter. The filtered search results may be dynamically generated and provided to the user. | 2013-06-27 |
20130166549 | Providing Access to Media Content in Multiple Locations - A computer-implemented method for providing access to media content in multiple locations includes: storing media content in a system that has a memory and another storage; generating an object that represents the media content, the object including media content metadata and a media content reference configured to identify each of a memory location and a storage location; and making the object available to an application, the media content reference providing access to the stored media content at the memory location or at the storage location. | 2013-06-27 |
20130166550 | Integration of Tags and Object Data - Example systems and methods of integrating data tags with their associated object data are presented. In one implementation, a data object employed in a first computer application is accessed. Examples of the data object include, but are not limited to, structured data and unstructured data. Tagging data that is descriptive of the first data object is also accessed. The tagging data is stored in at least one of the first data object and a separate data object linked with the first data object. The tagging data and the first data object are processed using a second computer application. | 2013-06-27 |
20130166551 | CUBITS - A system may include display of a result set associated with one or more dimensions and one or more key figures, the result set comprising one or more members of each of the one or more dimensions and one or more values of each of the one or more key figures, reception of a selection of a portion of the result set, the portion associated with a first one or more of the one or more dimensions, a second one or more of the one or more key figures, and one or more rows of the result set, and storage of metadata defining the first one or more dimensions, the second one or more key figures, the one or more rows of the result set, and a condition, a schedule to evaluate the condition, and a notification type associated with the portion. | 2013-06-27 |
20130166552 | SYSTEMS AND METHODS FOR MERGING SOURCE RECORDS IN ACCORDANCE WITH SURVIVORSHIP RULES - According to some embodiments, a plurality of source records may be received from a plurality of data sources, with each source record including a plurality of fields. It may be determined that a match group of source records from different data sources relate to the same entity, and a single best record may be automatically created for the match group based on field values from different source records in the match group. The creating may includes, for example, assigning a first set of fields to a first survivorship group associated with a first survivorship rule and a second set of fields to a second survivorship group associated with a second survivorship rule. All records in the match group may then be simultaneously ranked in accordance with the first and second survivorship rules using a single query. The best record could then be stored for subsequent use by other applications. | 2013-06-27 |
20130166553 | Hybrid Database Table Stored as Both Row and Column Store - A hybrid database table is stored as both a row and a column store. One or more techniques may be employed alone or in combination to enhance performance of the hybrid table by regulating access to, and/or the size of, the processing-intensive column store data. For example during an insert operation, the column store data may be searched for a uniqueness violation only after certain filtering and/or boundary conditions have been considered. In another technique, a hybrid table manager may control movement of data to the column store based upon considerations such as frequency of access, or underlying business logic. In still another technique, querying of the hybrid table may result in a search of the column store data only after an initial search of row store data fails to return a result. | 2013-06-27 |
20130166554 | Hybrid Database Table Stored as Both Row and Column Store - A hybrid database table is stored as both a row and a column store. One or more techniques may be employed alone or in combination to enhance performance of the hybrid table by regulating access to, and/or the size of, the processing-intensive column store data. For example during an insert operation, the column store data may be searched for a uniqueness violation only after certain filtering and/or boundary conditions have been considered. In another technique, a hybrid table manager may control movement of data to the column store based upon considerations such as frequency of access, or underlying business logic. In still another technique, querying of the hybrid table may result in a search of the column store data only after an initial search of row store data fails to return a result. | 2013-06-27 |
20130166555 | METHOD AND APPARATUS FOR MANAGING CONTACT DATA BY UTILIZING SOCIAL PROXIMITY INFORMATION - An approach is provided for efficiently managing contact data in a phonebook by utilizing social proximity information at a device. An application and/or a widget processes and analyzes contact details associated with one or more contacts in order to determine a similarity to one or more other contact details associated with one or more users and/or one or more other contacts. Further, the application and/or the widget can determine one or more social proximity information items associated with the one or more contacts, the one or more users and/or the one or more other contacts and can utilize the social proximity information to manage (e.g., organize, group, sort, etc.) the contact data in the phonebook. | 2013-06-27 |
20130166556 | Independent Table Nodes In Parallelized Database Environments - A recipient node of a multi-node data partitioning landscape can receive, directly from a requesting machine without being handled by a master node, a first data request related to a table. A target node of a plurality of processing nodes can be identified to handle the data request. The determining can include the recipient node applying partitioning information to determine a target data partition of the plurality of data partitions to which the data request should be directed and mapping information associating each data partition of the plurality of data partitions with an assigned node of the plurality of processing nodes. The recipient node can redirect the data request to the target node so that the target node can act on the target data partition in response to the data request. | 2013-06-27 |
20130166557 | UNIQUE VALUE CALCULATION IN PARTITIONED TABLES - An estimation algorithm can generate a uniqueness metric representative of data in a database table column that is split across a plurality of data partitions. The column can be classified as categorical if the uniqueness metric is below a threshold and as non-categorical if the uniqueness metric is above the threshold. A first estimation factor can be assigned to the column if the column is classified as categorical or a larger second estimation factor can be assigned if the column is non-categorical. A cost estimate for system resources required to perform a database operation on the database table can be calculated. The cost estimate can include an estimated total number of distinct values in the column across all of the plurality of data partitions determined using the assigned first estimation factor or second estimation factor and a number of rows in the table as inputs to an estimation function. | 2013-06-27 |
20130166558 | METHOD AND SYSTEM FOR CLASSIFYING ARTICLE - The present invention discloses a method and system for classifying articles. The present invention can be not only capable of distinguishing the type of the article but also novelty to generate an overview article automatically in accordance with the initial prepared keyword combination or articles. Furthermore, the overview article described above comprises a representative topic corresponding to the content of the initial prepared articles, wherein the representative topic is also able to identify the field of the articles. Accordingly, by the said overview article, the present invention is capable of decreasing the time required to understand the spirit and the technical aspect of the articles so as to solve the long lasted problem of the prior art. | 2013-06-27 |
20130166559 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND PROGRAM - There is provided an information processing apparatus including a transmission section which transmits, to an external device that has collected an index pertaining to a feature of an output of a sensor for each classification, classification information for specifying the classification, and a reception section which receives information about the index corresponding to the classification information. | 2013-06-27 |
20130166560 | Intuitive Management of Electronic Files - A method includes identifying interrelated files stored on one or more storage devices for each topic grouping. The interrelated files correspond to a particular topic grouping and are determined based on metadata associated with the interrelated files. A relative importance for each of the interrelated files within each topic grouping is determined. The relative importance indicates an importance of each of the interrelated files in a corresponding topic grouping relative to the other files in the corresponding topic grouping based on metadata associated with the interrelated files. A montage of visual representations of the interrelated files for each topic grouping is displayed using a visual indication of the relative importance. | 2013-06-27 |
20130166561 | SYMANTIC FRAMEWORK FOR DYNAMICALLY CREATING A PROGRAM GUIDE - An application server includes a Semantic Analysis Core Service (SACS) function that communicates with a Semantic Analysis Client (SAC) in a Set Top Box (STB). The SACS groups programs available for rendering to a subscriber into program clusters. The SACS generates the program clusters based on a determined semantic similarity between the programs, and on parameters that indicate a subscriber's preference for certain program content. The program that are semantically similar to existing clusters within a predetermined viewing window are provided to the STB and output to the subscriber on a display as a program preference list or channel line-up. The STB also monitors the subscriber's interaction with the programs and calculates a preference score for each program indicating the subscriber's continuing, or waning, interest in a given program. The preference score is used to update the score of the program cluster to which the program belongs. | 2013-06-27 |
20130166562 | Renaming Multiple Files - Techniques for renaming multiple files. A system establishes a rename state for a first file in a collection of files and, in the rename state, receives user input specifying a name for the first file. In response to the user input specifying the name, the system renames the first file according to the name and establishes a rename state for a second file in the collection of files. In the rename state, the system can display both the current name of the file and the file extension associated with the file. The system can protect the file extension such that the user cannot change the file extension in the rename state. | 2013-06-27 |
20130166563 | Integration of Text Analysis and Search Functionality - Example systems and methods of integrating text analysis and search functionality are presented. In one example, a plurality of documents, as well as search information comprising search terms for a search category, are accessed. Each of the documents that include at least one of the search terms is identified. The identified documents are analyzed to determine those of the identified documents that are logically associated with the search category. Each of the documents determined to be logically associated with the search category are tagged with the search category. | 2013-06-27 |
20130166564 | PROVIDING INFORMATION RECOMMENDATIONS BASED ON DETERMINED USER GROUPS - Classifying a user into a user group is described, including: obtaining action record information associated with a user with respect to a plurality of information categories; determining a preference value for at least one of the plurality of information categories based at least in part on the action record information; determining a demand preference dispersion value for the user based at least in part on the preference value, wherein the demand preference dispersion value represents a degree to which the user has dispersed interest across the plurality of information categories; and determining whether the user is to be associated with a demand-focused user group based at least in part on the demand preference dispersion value. | 2013-06-27 |
20130166565 | INTEREST BASED SOCIAL NETWORK SYSTEM - A system and method provide an interest based social network defined by a community of users who share the same topic interests. The methods and systems provide a collection of webpages based on a category of topics. Users may generate notes and ratings for each topic, which are then displayed on and integrated into the topic webpage. Users may also relate different topics, such that related topics will be provided in user searches of the topics. The method and system includes a category of topics hierarchy, with each topic being associated with a plurality of categories and sub-topics. The method and system additionally allow mapping of user comments and notes into the interest based social network from external social networks, and mapping of user comments and notes from the interest based social network to external social networks. | 2013-06-27 |
20130166566 | ACCELERATED QUERY OPERATORS FOR HIGH-SPEED, IN-MEMORY ONLINE ANALYTICAL PROCESSING QUERIES AND OPERATIONS - An additional data structure can be initialized for a column of compressed data to include a prefix storing, for each block of values in the column, a total number of bits set in previous blocks in the bit vector. A block number can be determined for a target block of the plurality of blocks, for example by checking whether or not a specified row number is located in the prefix. If the specified row number is located in the prefix, the prefix value of the prefix is returned, the most frequently occurring value is returned if a corresponding bit in the bit vector in the specified row number is not located in the prefix, or a position of the specified row in an index vector for the column is returned. | 2013-06-27 |
20130166567 | PROCESSING AND PUBLISHING DIGITAL CONTENTS INCLUDING ENCYCLOPEDIA - Techniques, devices and systems for publishing digital contents such as encyclopedia are provided. One method for such digital publishing includes obtaining entries of encyclopedic resource files; indexing attributes of each of the entries by using preset indexing rules; reorganizing the entries based on the attributes; and publishing the reorganized entries by applying a preset template. | 2013-06-27 |
20130166568 | SCALABLE ANALYSIS PLATFORM FOR SEMI-STRUCTURED DATA - A method of operating a query system includes retrieving objects from a data source, wherein each of the retrieved objects includes (i) data and (ii) metadata describing the data. The method includes dynamically creating a cumulative schema by inferring a schema from each of the retrieved objects and merging the inferred schema with the cumulative schema. The method includes storing the data of each of the retrieved objects in a storage service. The method includes receiving, from a user, a query, and responding to the query based on data stored by the storage service. | 2013-06-27 |
20130166569 | INTELLIGENT EVENT QUERY PUBLISH AND SUBSCRIBE SYSTEM - Indexing and routing to event data is described. Event data is assigned an identifier that identifies the data type and the contents of event data within an enterprise system. The event data may be real-time event data. With the identifier, a source of the event data is determined, and the source can be queried for the event data in real-time. The identifier is indexed along with other event data identifiers. Based on the location of the event data, the system sends out a query toward the data source to obtain the information, but also to route the query to the data source, rather than attempting to pull data towards the query source and process it at the query source. | 2013-06-27 |
20130166570 | COMPUTER SYSTEM MANAGEMENT METHOD AND MANAGEMENT APPARATUS - An object of the present invention is to appropriately select a volume or the like to be allocated to a host computer, thereby decreasing work efficiency. Upon being inputted with a precondition (for example, a user ID, a host ID and a work label ID) based on information inputted from a user, a management server | 2013-06-27 |
20130166571 | EVALUATING TYPEABILITY OF DOMAIN NAMES - Methods and systems are disclosed for assessing an identifier. The method comprises receiving, via an interface, a string of characters making up the identifier and determining a keyboard type for a keyboard. The method further comprises calculating, by a calculator module, a typeability score for the identifier based on the string of characters and the keyboard type, wherein the typeability score signifies a difficulty of typing the identifier on the determined keyboard type. In certain embodiments, the method further comprises determining a finger positioning corresponding to a position of a typer's fingers on the keyboard, and the typeability score is further based on the finger positioning. In some embodiments, the finger positioning is based on the typer's typing habits. | 2013-06-27 |
20130166572 | DEVICE, METHOD, AND PROGRAM FOR EXTRACTING ABNORMAL EVENT FROM MEDICAL INFORMATION - An abnormality score calculating means calculates abnormality scores which are information indicating abnormality of medical data, based on specificity of the medical data. An abnormality score vector generating means creates at least one or more abnormality score vectors which are information obtained by integrating the abnormality scores. Further, a side effect detecting means which decides a likelihood of a side effect indicated by the abnormality score vector, based on a predetermined rule, and detects an abnormality score vector the likelihood of which is set in advance and which satisfies conditions as information indicating the side effect. | 2013-06-27 |
20130166573 | Managing Business Objects Data Sources - Methods, computer-readable media, and systems for managing business objects data sources. A search query that includes multiple query terms is received. Each query term at least partially represents metadata associated with one of multiple business objects data sources that each stores multiple data items. Multiple search index documents are searched to identify one or more business objects data sources that are each associated with metadata at least partially represented by each query term. Multiple metadata tables are searched to identify metadata associated with each identified business objects data source. The identified business objects data sources are searched for data items that satisfy the identified metadata. Representations of the data items and the metadata are provided in response to receiving the search query. | 2013-06-27 |
20130166574 | SOCIAL NETWORK SERVICE SYSTEM AND METHOD FOR RECOMMENDING FRIEND OF FRIEND BASED ON INTIMACY BETWEEN USERS - A social network service (SNS) system and method for recommending a friend of a friend based on an intimacy between users are provided. The SNS system includes an extracting unit to extract communication information from each of a friend relationship between a user and a first-group friend and a friend relationship between the user and a second-group friend. The system also includes a calculating unit to calculate an intimacy of each of the friend relationships based on the extracted communication information. The system includes a generating unit to generate a list of recommended second-group friends based on the calculated intimacy. | 2013-06-27 |
20130166575 | DATABASE DISPLAING OR RECORDING EVENTS BY TIME SEQUENCE AND METHOD THEREOF - A database of displaying or recording events by time sequence and a method thereof, particularly a database that displays and records the events with different title data in a single cross-year list are disclosed. The method of displaying and recording the database includes displaying a plurality of time marks through a user interface, sequentially arranging and stacking a plurality of data blocks under the time marks, and each data block includes a title field and a data field, and title data are disposed in the title fields, and a plurality of event data is disposed in the matched data fields of the title data according to event content and time of occurrence and under the time marks, so that the event data indifferent data blocks are compared with one another based on the time marks, so as to improve the convenience of data comparison. | 2013-06-27 |
20130166576 | DYNAMIC, HIERARCHICAL BLOOM FILTERS FOR NETWORK ROUTING - A system may include an address manager configured to map a data item including a plurality of attributes to a blocked Bloom filter (BBF) of a plurality of blocked Bloom filters. The system also may include a blocked Bloom filter (BBF) generator configured to map each attribute of the plurality of attributes to a corresponding block of the blocked Bloom filter. | 2013-06-27 |
20130166577 | Providing Contextually-Relevant Content - Techniques for providing contextually-relevant content include identifying content items accessed through a portal by a plurality of users, each user associated with one or more roles of a plurality of roles within the portal; updating a trace log to include information associated with the identified content, the information including associations between each identified content item and the role accessing each identified content item; receiving, from a user associated with a particular role of the plurality of roles, a search query through the portal for one or more content items; determining a plurality of search results responsive to the search query, the search results relating to the content items; for the particular role, filtering the plurality of search results based on the trace log; and generating a plurality of filtered search results for presentation through the portal. | 2013-06-27 |
20130166578 | SYSTEM AND METHOD FOR AUTOMATIC PRESENTATION OF CONTENT-RELATED DATA WITH CONTENT PRESENTATION - A content item is requested by a user via the user's computing device. In response, data, such as a set of facts, related to the requested content item is identified and served with the requested content item for presentation with the content item at the user's computer device. The related data can comprise facts related to the content item, and the related data can be presented as a graphic, such as part of a multi-dimensional graph, in connection with the presentation of the content. The related data can be retrieved from a facts database using search criteria formed using tags obtained for the requested content item. | 2013-06-27 |
20130166579 | INFORMATION PROCESSING APPARATUS AND COMPUTER READABLE MEDIUM - An information processing apparatus includes a detecting unit and a history processing unit. The detecting unit detects a first operation and a second operation. The first operation is an operation of inputting a document to an electronic tray. The second operation is an operation of retrieving a document from the electronic tray. The history processing unit performs a predetermined process related to cancellation history in a case where an operation detected by the detecting unit is the second operation, if history information indicates that the first operation has already been performed, if document identification information indicating a document on which the first operation has been performed matches document identification information indicating a document on which the second operation has been performed, and if operator identification information indicating an operator who has performed the first operation matches operator identification information indicating an operator who has performed the second operation. | 2013-06-27 |
20130166580 | Media Processor - In embodiments, the present invention provides method and system for determining if an existing pass log may be reused. The method may include associating an existing pass log with an encoding profile. The method may further include computing with a processor a signature for the encoding profile and for a target encoding profile. The method may include comparing with the processor at least a portion of the two signatures and based on a result of the comparing, storing in a processor accessible memory at least one of an indication that the pass log file may be used in conjunction with the target encoding profile and an indication that the pass log file cannot be used in conjunction with the target encoding profile. | 2013-06-27 |
20130166581 | Shorthand for Data Retrieval from a Database - A method and apparatus for convenient and fast entry of a search string for searching a database. A subset of the alphabet (such as the vowels) is used for entry of a search string, and database matches are determined according to the appearance of the subset characters in the search fields of the database records. The use of the alphabet subset reduces the size of the entry keypad and simplifies user entry of the search string. | 2013-06-27 |
20130166582 | OPERATION OF A USER INTERFACE - Embodiments relate to a user interface with an aspect having a method for operating a user interface including detecting a sequence of actions with respect to the user interface and accessing a database having a plurality of pattern keys, wherein each of the pattern keys define a sequence of actions with respect to the user interface and a specific end result for the sequence of actions. The method also includes matching the detected sequence of actions with respect to the user interface and responsive to one of the pattern keys in the database and performing a predefined action in the user interface in relation to the specific end result of a matched pattern key. | 2013-06-27 |
20130166583 | NETWORK MONITORING BY USING PACKET HEADER ANALYSIS - A computer method and a system for detecting the file type of an electronic file, the method including the steps of: (a) using a predetermined number of bytes at the beginning of the file to create a list of probable file types; (b) testing the file against a detection rule for each file type in the list until a match is found; if no match is found (c) testing the file against other known detection rules for the types to find a match. | 2013-06-27 |
20130166584 | SYSTEMS AND METHODS FOR EXTRACTING BUSINESS PROCESS METRICS FROM A UML MODEL - The invention relates to a system and method for extracting business process metrics from a Unified Modeling Language (UML) model. This invention involves the use of Object Constraint Language (OCL) and custom stereotypes to extract the design metrics from a UML model. The business process parameters to be measured are defined and custom stereotypes for each design element present in the business process parameters are also defined. A UML diagram is generated to represent the steps required to complete the business process. The UML diagrams are based on UML 2.0 or its higher version. The queries are written in OCL and run on the activity or sequence diagram to extract the desired metrics. | 2013-06-27 |
20130166585 | METHOD AND SYSTEM FOR GENERATING QUERY-RELATED SUGGESTIONS - Methods and systems are provided that may be utilized to determine one or more suggestions of entities relating to a user query. | 2013-06-27 |
20130166586 | SYSTEM AND METHOD FOR USING SKYLINE QUERIES TO SEARCH FOR POINTS OF INTEREST ALONG A ROUTE - A method and system for searching for points of interest along a route is disclosed. A relation that includes records that associate link identifiers, point of interest identifiers, and distances between the links and the points of interest is generated during the compilation process of a first version of a geographic database. The relation is stored in compiled database products. When a compiled database product is being used by a navigation system, for example, navigation application software programs use the relation to accurately and efficiently find points of interest along a computed route. Navigation systems can also use the relation to service skyline queries and responsively generate skyline graphs of points of interest. | 2013-06-27 |
20130166587 | User Interface for Viewing Targeted Segments of Multimedia Content Based on Time-Based Metadata Search Criteria - A system and method for navigating digital media assets including a navigation system configured to receive a search query in response to a user input and process the search query by applying the search query to a search index of digital media asset conventional and time-based metadata and determining search results of titles of and start points in time within digital media assets that satisfy the search query. The navigation system may then display the search results to the user through the user interface. The search results may be displayed in a hierarchical format, wherein the title of the digital media asset is displayed and upon selecting the title of the digital media asset, the start points in time within that digital media asset are displayed or played as a video to the user through the user interface. | 2013-06-27 |
20130166588 | EXECUTION PLAN PREPARATION IN APPLICATION SERVER - A system and method for execution plan preparation. One or more processors executing an application process of an application server receive a request from a client computer over a network. The one or more processors parse the request to determine one or more components of the request. An execution plan for the request is generated based on the one or more components determined by the parsing, and the execution plan is then sent to a database for execution of the request by a database process. | 2013-06-27 |
20130166589 | SPLIT PROCESSING PATHS FOR A DATABASE CALCULATION ENGINE - A dynamic split node defined within a calculation model can receive data being operated on by a calculation plan generated based on the calculation model. A partition specification can be applied to one or more reference columns in a table containing at least some of the received data. The applying can cause the table to be split such that a plurality of records in the table are partitioned according to the partition specification. A separate processing path can be set for each partition, and execution of the calculation plan can continue using the separate processing paths, each of which can be assigned to a processing node of a plurality of available processing nodes. | 2013-06-27 |