49th week of 2013 patent applcation highlights part 72 |
Patent application number | Title | Published |
20130325779 | RELATIVE EXPERTISE SCORES AND RECOMMENDATIONS - Content recommendations customized to a user's knowledge are provided. The user's knowledge is assessed from the user's activity history and the expertise of the user regarding each of the various topics relative to a cohort group is determined. Based on the user's score, the user can be classified into various competency levels ranging from a novice to an expert in each topic. Content items for improving the user's scores in the various topics can be forwarded based on the user's classification and activity history. If the user is recognized as an expert in a particular topic, questions from other users regarding the particular topic can be directed to the user for the responses. | 2013-12-05 |
20130325780 | PREDICTIVE LOCATIONS BASED ON CONTEXT - Systems, methods, and devices use search terms, current state information, historical data, and expected location hints to predict where a user may be when a search may be relevant. In an embodiment, search terms entered on a first user computing device may be combined with location information resident on a second user computing device to determine where a user is likely to be and what results are likely to be relevant to a user in the future. In a further embodiment, relevant search terms indicative of time, such as “tomorrow” or “tonight,” and/or user-related information may also be used to return predictive search results. In a further embodiment, user-related information from other users may also be used to return predictive search results. | 2013-12-05 |
20130325781 | Tensor trace norm and inference systems and recommender systems using same - A convex regularized loss function is minimized respective to a prediction tensor of order K to generate an optimized prediction tensor of order K where K>2. The convex regularized loss function comprises a linear combination of (i) a loss function comparing the prediction tensor and an observation tensor of order K representing a set of observations and (ii) a regularization parameter including a K-th order matrix norm decomposition of the tensor trace norm of the prediction tensor. In some such embodiments, the observation tensor of order K represents a set of social network observations and includes at least dimensions corresponding to (1) users, (2) items, and (3) tags. The optimized prediction tensor of order K is suitably used to perform inference operations. | 2013-12-05 |
20130325782 | LATENT VARIABLE MODEL ESTIMATION APPARATUS, AND METHOD - To provide a latent variable model estimation apparatus capable of implementing the model selection at high speed even if the number of model candidates increases exponentially as the latent state number and the kind of the observation probability increase. A variational probability calculating unit | 2013-12-05 |
20130325783 | PROVIDING EVENT-PROCESSING RULES - A method and system are provided for providing event-processing rules in an event-processing environment. The method includes providing at least one generalised event-processing rule to a customer, receiving customer input of rule customization to produce a customized rule, and storing the customized rule in Polish notation for processing using stack-based processing. The method also includes receiving notification of an event for a customer, retrieving a customized rule relating to the customer, and processing the customized rule using stack-based processing. | 2013-12-05 |
20130325784 | Method of Analyzing a Scenario Represented as Elements of a Tensor Space, and Scored Using Tensor Operators - A mathematical model to represent multiple role events of a threat scenario, and a methodology to score the events given the data or evidence contained in a knowledge base is provided. The multiple role event can include any action encompassed by an independent clause having multiple syntactical roles (subject, object, location, etc . . . ) and containing multiple entities (person A, person B, object C, place D, etc . . . ). Multiple role events are represented as elements of a tensor space, and are scored using tensor operators built from the semantic graph associated with the knowledge base. | 2013-12-05 |
20130325785 | COMPUTERIZED SYSTEM FOR MONITORING AND CONTROLLING PHYSICAL DATA-PRODUCING APPARATUS - A computerized system for monitoring physical data for anomalies, which physical data are predictable given predetermined information, the system comprising a predetermined information data point generator operative to compute a sequence of model data points which the physical data, given predetermined information, can be expected to duplicate at each of a corresponding sequence of temporal sampling points; a wayward point monitor including a processor operative for monitoring the physical data including identifying wayward points within said physical data that are incongruous with the predetermined information; and an anomalous episode-prompted alarm generator operative for identifying anomalous episodes, each including a cluster of wayward points satisfying predefined anomalous episode-defining criteria and generating an alarm for each anomalous episode identified. | 2013-12-05 |
20130325786 | SPARSE HIGHER-ORDER MARKOV RANDOM FIELD - Systems and methods are provided for identifying combinatorial feature interactions, including capturing statistical dependencies between categorical variables, with the statistical dependencies being stored in a computer readable storage medium. A model is selected based on the statistical dependencies using a neighborhood estimation strategy, with the neighborhood estimation strategy including generating sets of arbitrarily high-order feature interactions using at least one rule forest and optimizing one or more likelihood functions. A damped mean-field approach is applied to the model to obtain parameters of a Markov random field (MRF); a sparse high-order semi-restricted MRF is produced by adding a hidden layer to the MRF; indirect long-range dependencies between feature groups are modeled using the sparse high-order semi-restricted MRF; and a combinatorial dependency structure between variables is output. | 2013-12-05 |
20130325787 | Temporal Predictive Analytics - A fuzzy complex event processing (CEP) system successfully processing noisy, incomplete, multi-source data in support of near real-time decision-making. The fuzzy CEP solution of the present invention supports decision-making by identifying and exploiting patterns hidden in complex data and can operate in a forensic mode against historical data, near real-time mode for proactive decision-making, or any combination thereof. Fusion algorithms and techniques are applied to observation data that may only partially satisfy an event description in time, space, or other relevant dimensions. Using context propagation, Bayesian reasoning, and spatiotemporal analysis, the present invention provides both predictive awareness of upcoming events and likelihood analysis for events that may have already occurred, but were not evident in the collected data, while at the same time minimizing false detections. | 2013-12-05 |
20130325788 | ETL DATA TRANSIT METHOD AND SYSTEM - A method and system for archiving data is provided. The method includes an extraction stage, a load stage, and a production merge stage. In the extraction stage, incoming files from a source system are extracted, where each incoming file has data records. Upon determining that the incoming files are of different data record types, the incoming files are split by record type. The files are also parsed. In a load stage, all files from a load ready directory are placed together in a single batch with a common RUNID for each data record type. In a production merge stage, all files made available from the load stage are processed. The processed files are loaded into a data warehouse. Each stage operates independently of any other stage. Each stage is also iterative and circular. | 2013-12-05 |
20130325789 | Defining and Mapping Application Interface Semantics - An example implementation includes a system having one or more processors, a definition module, a data store, and a workflow module. The definition module is executable by the one or more processors to determine a first semantic element for a first operation included in a first application interface representing a first service and a second semantic element for a second operation included in a second application interface representing a second service, such as an enterprise service bus. The definition module may further determine a mapping of the first semantic element with the second sematic element. The data store is configured to store the mapping of the first semantic element with the second sematic element by the definition module. The workflow module is executable by the one or more processors to integrate the first application interface with the second service based on the mapping. | 2013-12-05 |
20130325790 | MULTI-TENANT DATA INTEGRATION - An enterprise application integration system (EAIS) is disclosed that enables customer service applications to access and share data with enterprise information systems in real time. | 2013-12-05 |
20130325791 | Method and System for Analyzing Data Related to an Event - A system and method for analyzing data from a plurality of computer environments. A user may search for computer environments that meet a certain criterion. The computer environments are authenticated and data is copied from the computer environments to a memory location. The data may be marked so that a user may determine which computer environment provided the data. The user may add notations to the data during a review. Changes to data on the computer environments may be provided to a user using a syndication feed. | 2013-12-05 |
20130325792 | Method and System for Analyzing Data Related to an Event - A system and method for analyzing data from a plurality of computer environments. A user may search for computer environments that meet a certain criterion. The computer environments are authenticated and data is copied from the computer environments to a memory location. The data may be marked so that a user may determine which computer environment provided the data. The user may add notations to the data during a review. Changes to data on the computer environments may be provided to a user using a syndication feed. | 2013-12-05 |
20130325793 | Easy Query - A system and method for using an easy query in a business warehouse system environment that includes external end-user systems. A method includes providing a flag in a query to a business warehouse data system, the flag marking the query for access to the query by sources external to the business warehouse data system. The method further includes providing, by the at least one data processor the access points having a number of parameters that are fixed at a design time associated with the query, providing a query result to the access points of the sources external to the business warehouse system according to the number of parameters. The system and method provide an easy way of creating an access function at design time, as well as an easy way of result set consumption provided by the function at runtime. | 2013-12-05 |
20130325794 | Unified Semantic Ranking of Compositions of Ontological Subjects - The present invention discloses methods, systems, and tools for unified semantic ranking of compositions of ontological subjects. The method breaks a composition into a plurality of partitions as well as its constituent ontological subjects of different orders and builds a participation matrix indicating the participation of ontological subjects of the composition in other ontological subjects, i.e. the partitions, of the composition. Using the participation information of the ontological subjects into each other a similarity matrix is built from which the semantic importance ranks of the partitions of the composition are calculated. The method, systematically, enables the calculation of the semantic ranks of the ontological subjects of different orders of the composition. Various systems for implementing the method and numerous applications and services are disclosed. | 2013-12-05 |
20130325795 | Systems and Methods for Dynamically Loading Web Fonts and Dynamic Availability for Fonts Based on Language Settings - In a collaborative online document environment, a first user device is provided access to a document, via a network. A second user device is provided access to the document via the network. A list of fonts available to the second user device is received. The list is transmitted to the first user device. A request is received from the first user device to provide at least one of the fonts identified in the list. The at least one font is provided to the first user device. | 2013-12-05 |
20130325796 | System and Method for Integrating Databases in a Cloud Environment - A system and method for the integration of databases in a multi-tenant cloud environment. The method includes specific systems that integrate MS SQL and other database software with a cloud based infrastructure as a service platform, specifically OpenStack Nova. This method also includes certain optimization and rebalancing innovations to maximize databases in a cloud environment. | 2013-12-05 |
20130325797 | APPARATUS AND METHOD FOR PROVIDING PERSONALIZED INFORMATION TO A USER OF A USER DEVICE - A method and apparatus is disclosed for providing personalized information to a user of a user device connected to a communications network. A user of a user device connected to the communications network is identified and user information relevant to the identified user is obtained. A message is received, over the communications network, from the user device, and, responsive to receipt of the message, an information personalization process is performed. The information personalization process comprises: obtaining context information relating to the message received from the user device which context information is relatable to the user information; producing personalized information for the user of the user device based on the user information and the context information; and transmitting the personalized information to the user device over the communications network. | 2013-12-05 |
20130325798 | METHOD AND APPARATUS FOR STORING NODE - The present invention discloses a method and apparatus for storing node, pertaining to the field of the Internet communications. The method includes: receiving a write operation request and a node from a client; storing the node in a memory and setting the update time of the node as the time of receiving the node; and relocating one or more nodes from the memory to a file according to the update time of each of the nodes in the memory. The apparatus includes: a receiving module, a storage module, and a relocating module. The present invention can reduce the frequency of loading and relocating nodes to and from a memory, and improve performance of a server. | 2013-12-05 |
20130325799 | AUTOMATIC REPLICATION OF AMBIGUOUS DATA BASED ON A POINT SYSTEM - A method for automatic data synchronization between a source system and a buffer system. The method includes identifying a configurable set of penalties, wherein each penalty defines a number of penalty points associated with a respective one of a plurality of events related to data set stored by the source system. The method also includes, in response detecting one or more events, calculating a total penalty score using the penalty points corresponding to each of the events. The method also includes determining that the total penalty score satisfies a predetermined penalty threshold indicating that the copy of the data set stored on the buffer system is presumed stale and, in response, initiating a data replication operation that updates the copy of data set stored on the buffer system with current data from the data set stored on the source system. | 2013-12-05 |
20130325800 | FILE MIGRATION IN A NETWORK FILE SYSTEM - A computerized method for managing file migration in one or more storage devices. The method comprises separately categorizing a plurality of segments of a file stored in a pNFS storage according to at least one control data request received from at least one client in real time, receiving a request to migrate the file from at least one source storage location of the pNFS storage to at least one destination storage location of the pNFS storage, separately copying a plurality of different subsets of the file to the at least one destination storage location in a plurality of separate instances where in each the instance a respective the subset selected according to a respective the categorization, and deleting the file from the at least one source storage location. | 2013-12-05 |
20130325801 | APPLICATION-CONTROLLED SUB-LUN LEVEL DATA MIGRATION - An application programming interface (API) is used to migrate, from a specified source LUN to a specified target LUN, at least one specified sub-LUN data chunk, the API functioning as an interface between a storage controller and an owning application. | 2013-12-05 |
20130325802 | APPLICATION-CONTROLLED SUB-LUN LEVEL DATA MIGRATION - An application programming interface (API), functioning as an interface between a storage controller and an owning application, is used to migrate, from a specified source LUN to a specified target LUN, at least one specified sub-LUN data chunk, the at least one specified sub-LUN data chunk having a predefined chunk size fixed by the storage controller. A specified total migration size is incrementally reduced by each completed migration of the at least one specified sub-LUN data chunk until the total migration size is zero and the migration is completed. | 2013-12-05 |
20130325803 | USER INITIATED REPLICATION IN A SYNCHRONIZED OBJECT REPLICATION SYSTEM - A snapshot of selected objects in a source repository is created in response to the user-initiated replication. The snapshot is designated as a snapshot replication job. The snapshot replication job is added to the end of a replication queue to await execution for the synchronized object replication. Unsynchronized objects in a target destination are detected by comparing a state of the selected objects in the snapshot with a current state of the target destination at the time of execution of the snapshot replication job. The unsynchronized objects in the target destination are synchronized based upon the comparison of the state of the selected objects in the snapshot with the current state of the target destination at the time of execution of the snapshot replication job. | 2013-12-05 |
20130325804 | REPLICA IDENTIFICATION AND COLLISION AVOIDANCE IN FILE SYSTEM REPLICATION - A unique file-system node identification (ID) is created for each newly created node in a file system repository by combining a grid identification (ID), a repository identification (ID), and a node identification (ID) to form the unique file-system node ID. The unique file-system node ID is associated with a unique association identification (ID) for creating an association for linking the node from a source repository to a target repository when performing a replication operation between a repository and another repository. The different replication instances of the node in the file system repository are distinguished by the unique association ID assigned to each of the replication instances. | 2013-12-05 |
20130325805 | SYSTEM AND METHOD FOR TAGGING AND SECURELY ARCHIVING PATIENT RADIOLOGICAL INFORMATION - A system and method for tagging and securely archiving patient radiological data includes computing a unique token from at least one of a plurality of data set attribute values, creating a de-identified version of the data set, writing the unique token to the de-identified version of the data set, and transmitting the de-identified version of the data set to an archive for storage. The de-identified version of the data set may be retrieved from the archive by querying and retrieving the de-identified version of the data set having the unique token written thereto. | 2013-12-05 |
20130325806 | PRESERVING A STATE USING SNAPSHOTS WITH SELECTIVE TUPLE VERSIONING - Selective tuple versioning is used on a file system providing file system snapshots using selective tuple versioning for maintaining the state of the file system. | 2013-12-05 |
20130325807 | SHARED PLAYLIST SYNCHRONIZATION - Various embodiments relating to synchronizing changes to a shared list of items between different devices are provided. In one embodiment, a first set of change operations for a first version of a shared list may be received from a first device. The first set of change operations may be performed on the first version of the shared list to produce a second version of the shared list. A second set of change operations for the first version of the shared list may be received from a second device. The second set of change operations may be performed on the second version of the shared list to produce a third version of the shared list that maintains changes that are made by the first set of change operations but that are not made by the second set of change operations. | 2013-12-05 |
20130325808 | PRESERVING PAST STATES OF FILE SYSTEM NODES - A selective tuple versioning is used on a files system for preserving past states of file system nodes by adding a bitmap to a row for a node within a file system table for preserving the past state of the node in a file system. | 2013-12-05 |
20130325809 | METHOD FOR CONTENTS BACKUP AND AN ELECTRONIC DEVICE THEREOF - A method of operating an electronic device includes selecting contents to be backed up on the basis of a usage pattern of the contents, generating backup data of the contents, and transmitting the backup data to a backup server. A priority is assigned for determining whether to a backup of the contents should occur on the basis of the usage pattern of the contents. A backup target is selected according to at least one of the per-contents usage frequency and the priority. | 2013-12-05 |
20130325810 | CREATION AND EXPIRATION OF BACKUP OBJECTS IN BLOCK-LEVEL INCREMENTAL-FOREVER BACKUP SYSTEMS - Embodiments of the present invention provide a scalable, efficient way to backup data in a block-level incremental-forever backup system such that backup and expiration of data can be achieved at the granularity of a single backup version, without having to read or move data that is stored in backup storage. | 2013-12-05 |
20130325811 | FILE SYSTEM QUIESCING - Techniques are disclosed for quiescing a file system. One technique comprises freezing a file system, flushing a memory associated with the file system, and thawing the file system. One technique comprises receiving a request targeted to a file system and intercepting the request. | 2013-12-05 |
20130325812 | SYSTEM AND METHOD FOR ARCHIVE IN A DISTRIBUTED FILE SYSTEM - Provided is a system and method for archive in a distributed file system. The system includes at least one Name Node structured and arranged to map distributed data allocated to at least one Active Data Node, the Name Node further structured and arranged to direct manipulation of the distributed data by the Active Data Node. The system further includes at least one Archive Data Node coupled to at least one data read/write device and a plurality of portable data storage elements compatible with the data read/write device, the Archive Data Node structured and arranged to receive distributed data from at least one Active Data Node, archive the received distributed data to at least one portable data storage element and respond to the Name Node directions to manipulate the archived data. An associated method of use is also provided. | 2013-12-05 |
20130325813 | SYSTEM AND METHOD FOR ARCHIVE IN A DISTRIBUTED FILE SYSTEM - Provided is a system and method for archive in a distributed file system. The system includes at least one Name Node structured and arranged to map distributed data allocated to at least one Active Data Node, the Name Node further structured and arranged to direct manipulation of the distributed data by the Active Data Node. The system further includes at least one Archive Data Node coupled to at least one data read/write device and a plurality of portable data storage elements compatible with the data read/write device, the Archive Data Node structured and arranged to receive distributed data from at least one Active Data Node, archive the received distributed data to at least one portable data storage element and respond to the Name Node directions to manipulate the archived data. An associated method of use is also provided. | 2013-12-05 |
20130325814 | SYSTEM AND METHOD FOR ARCHIVE IN A DISTRIBUTED FILE SYSTEM - Provided is a system and method for archive in a distributed file system. The system includes at least one Name Node structured and arranged to map distributed data allocated to at least one Active Data Node, the Name Node further structured and arranged to direct manipulation of the distributed data by the Active Data Node. The system further includes at least one Archive Data Node coupled to at least one data read/write device and a plurality of portable data storage elements compatible with the data read/write device, the Archive Data Node structured and arranged to receive distributed data from at least one Active Data Node, archive the received distributed data to at least one portable data storage element and respond to the Name Node directions to manipulate the archived data. An associated method of use is also provided. | 2013-12-05 |
20130325815 | METHOD AND APPARATUS FOR MANAGING AND VERIFYING CAR TRAVELING INFORMATION, AND SYSTEM USING THE SAME - The present disclosure provides a method and apparatus for managing and verifying car traveling information, and a system using the same. The method for managing car traveling information includes receiving traveling image data and traveling record data; extracting computation data for integrity computation from at least one of the traveling image data and the traveling record data; generating integrity verification data by computing predetermined identification number data and the computation data; and generating integrity traveling data by combining the traveling image data, the traveling record data and the integrity verification data. In this way, integrity of an image from a black box for cars can be easily verified while maintaining an original copy of the image and related traveling record data. | 2013-12-05 |
20130325816 | APPARATUS AND METHOD FOR EVALUATING DATA POINTS AGAINST CADASTRAL REGULATIONS - A system for evaluating data points against cadastral regulations to include a plurality of software modules programmed into a computer system with software and hardware configured to store and update a cadastral rule database containing a plurality of rules for determining the validity of the cadastral data. The cadastral database obtained from a data source reference data that is indicative of a plurality of established reference data points wherein the received input data corresponds to a plurality of measured data points with steps to co-process the input data and the referenced data according to the plurality of cadastral rules to determine an indication for the plurality of data points. | 2013-12-05 |
20130325817 | LINEAR SWEEP FILESYSTEM CHECKING - A filesystem checker identifies a metadata block in a filesystem and determines a number of pointers pointing to the metadata block and a number of pointers embedded in the metadata block. The filesystem checker records the number of pointers pointing to the metadata block and the number of pointers embedded in the metadata block in a filesystem checker array. The filesystem checker verifies a consistency of the filesystem using data recorded in the filesystem checker array. | 2013-12-05 |
20130325818 | LOGO-ENABLED INTERACTIVE MAP INTEGRATING SOCIAL NETWORKING APPLICATIONS - A logo-enabled interactive map integrating social networking applications is provided. The interactive map may be configured to help end users discover and share information (e.g., events, deals, news occurrences, etc.) associated with a plurality of venues. | 2013-12-05 |
20130325819 | AUGMENTING METADATA USING USER ENTERED METADATA - In one embodiment, a method obtains metadata associated with a media program. The method receives user entered metadata from a first user for an object in a frame of the media program and compares the user entered metadata from the first user with user entered metadata from second users for the object. Then, the method verifies that the user entered metadata from the first user and the second users should be associated as augmenting metadata for the object in the media program based on the comparison. Upon verifying, the method performs: determining metadata storage including metadata for one or more other objects in the media program and storing the user entered metadata for the object in the media program in the metadata storage for the media program as the augmenting metadata. | 2013-12-05 |
20130325820 | VERIFYING DATA INTEGRITY UTILIZING DISPERSED STORAGE - A method begins by a processing module retrieving at least a threshold number of error coded data slices of a set of error coded data slices from storage units of a dispersed storage network (DSN) and identifying, based on an intentional error pattern, error coded data slices that were intentionally altered to produce identified error coded data slices. The method continues with the processing module decoding the set of error coded data slices to produce a recovered data segment and encoding the recovered data segment using an altered dispersed storage error encoding function to produce a test set of error coded data slices for comparing with corresponding error coded data slices. When the test set of error coded data slices substantially match the corresponding error coded data slices, the method continues with the processing module indicating that the recovered data segment has not been corrupted. | 2013-12-05 |
20130325821 | MERGING ENTRIES IN A DEDUPLCIATION INDEX - Provided are a computer program product, system, and method for merging entries in a deduplication index. An index has chunk signatures calculated from chunks of data in the data objects in the storage, wherein each index entry includes at least one of the chunk signatures and a reference to the chunk of data from which the signature was calculated. Entries in the index are selected to merge and a merge operation is performed on the chunk signatures in the selected entries to generate a merged signature. An entry is added to the index including the merged signature and a reference to the chunks in the storage referenced in the merged selected entries. The index of the signatures is used in deduplication operations when adding data objects to the storage. | 2013-12-05 |
20130325822 | CONTENT MANAGEMENT SYSTEM AND METHOD OF MANAGING RETENTION AND DISPOSITION OF CONTENT ITEMS - In specific embodiments, a content management system operable on one or more microprocessors comprises a content repository storing a plurality of content items and a content usage analyzer. The computer is usable to perform one or more operations on one or more contents items stored in the content repository, and when an operation is performed on a content item, audit data is captured related to the operation. The content usage analyzer is configured to identify an idle content item within the content repository based on the captured audit data. | 2013-12-05 |
20130325823 | UPDATING ACCESS CONTROL INFORMATION WITHIN A DISPERSED STORAGE UNIT - A method begins by a dispersed storage (DS) processing module of a storage unit receiving a write request for storing a data object that includes updated access control list (ACL) information. The method continues with the DS processing module determining whether the data object is a new data object or a revised version of an existing data object and determining write authority of the requesting entity based on information contained in a locally stored access control list. When the write request is regarding the revised version of the existing data object and the write authority includes authorization to issue the write request for the revised version of the existing data object and authorization to issue the updated ACL information, the method continues with the DS processing module storing the revised version of the existing data object and updating the access control list based on the updated ACL information. | 2013-12-05 |
20130325824 | OFFLINE VERIFICATION OF REPLICATED FILE SYSTEM - Embodiments of the invention include systems and methods for providing block-level verification of replicated file systems. Embodiments operate in context of data storage environments, which may typically have multiple file systems, snapshots of file systems, and replicas of file systems. In one illustrative scenario, a replica is created of a file system having multiple associated snapshots, and a user desires to verify the accuracy of the replica. A signature is created for each of the source active file system and the target replica file system, so that each signature includes records of both block-level signatures and block-level allocations. The signatures are compared to discover any differences. The differences may then be reconciled, where possible, to determine whether the differences indicate a corrupt or otherwise invalid replica. | 2013-12-05 |
20130325825 | Systems And Methods For Quantile Estimation In A Distributed Data System - In accordance with the teachings described herein, systems and methods are provided for estimating quantiles for data stored in a distributed system. In one embodiment, an instruction is received to estimate a specified quantile for a variate in a set of data stored at a plurality of nodes in the distributed system. A plurality of data bins for the variate are defined that are each associated with a different range of data values in the set of data. Lower and upper quantile bounds for each of the plurality of data bins are determined based on the total number of data values that fall within each of the plurality of data bins. The specified quantile is estimated based on an identified one of the plurality of data bins that includes the specified quantile based on the lower and upper quantile bounds. | 2013-12-05 |
20130325826 | MATCHING TRANSACTIONS IN MULTI-LEVEL RECORDS - A method for identifying matching transactions between two log files where each transaction includes one or more statements. Each log file record records the execution of a statement and includes a transaction identifier. Each record in turn in one log file is compared to an advancing window of records in the other log file. A first table contains associations of statements to transactions and transactions to statements for records in the window. If a match is found between a record in the one file and a record in the window, information associating partial transactions in the one file to potential transactions of the records in the window is added to a second table. If an end-of-transaction record is read from the one file, a best match is found between the ended transaction and the potential transactions based on information in the first and second tables. | 2013-12-05 |
20130325827 | INCREMENTAL OPTIMISTIC LOCKING OF DATA DISTRIBUTED ON MULTIPLE NODES TO AVOID TRANSACTION DEADLOCK - A transaction originator node identifies multiple data elements distributed at multiple enlisted nodes to lock for a transaction managed by the transaction originator node. The transaction originator node determines which of the enlisted nodes is a first enlisted node in a lock order for the transaction and sends an update request to the first enlisted node in the lock order to lock a data element residing at the first enlisted node. The transaction originator node sends update requests to remaining enlisted nodes in the lock order to cache the update requests until the remaining enlisted nodes receive a message to perform a lock. | 2013-12-05 |
20130325828 | System and Method For Providing High-Availability and High-Performance Options For Transaction Log - The present invention provides a method and system for using an operating system level I/O filter driver for providing transparent database transaction log file redundancy. In accordance with the method, the I/O filter driver intercepts a database management system request to write data to the database transaction log file. The I/O filter driver writes the data to at least two transaction log files. | 2013-12-05 |
20130325829 | MATCHING TRANSACTIONS IN MULTI-LEVEL RECORDS - A method for identifying matching transactions between two log files where each transaction includes one or more statements. Each log file record records the execution of a statement and includes a transaction identifier. Each record in turn in one log file is compared to an advancing window of records in the other log file. A first table contains associations of statements to transactions and transactions to statements for records in the window. If a match is found between a record in the one file and a record in the window, information associating partial transactions in the one file to potential transactions of the records in the window is added to a second table. If an end-of-transaction record is read from the one file, a best match is found between the ended transaction and the potential transactions based on information in the first and second tables. | 2013-12-05 |
20130325830 | TRANSACTIONAL FILE SYSTEM - A transactional file system wherein multiple file system operations may be performed as a transaction. An application specifies that file system-related operations are to be handled as a transaction, and the application is given a file handle associated with a transaction context. For file system requests associated with a transaction context, a file system component manages operations consistent with transactional behavior. Logging and recovery are also facilitated by logging page data separate from the main log with a unique signature that enables the log to determine whether a page was fully flushed to disk prior to a system crash. | 2013-12-05 |
20130325831 | SEARCH QUALITY VIA QUERY PROVENANCE VISUALIZATION - Methods and arrangements for enhancing search quality. Query search results are displayed, and search query provenance related to the search results is graphically depicted. There is graphically accorded an investigative function to avail investigation of at least one aspect of the search query provenance. | 2013-12-05 |
20130325832 | PRESENTING SEARCH RESULTS WITH CONCURRENTLY VIEWABLE TARGETS - A user of a device may formulate a search query that results in a presentation of search results set, and a selection of a search result may cause the device to present the target of the selected search result. However, in many scenarios, the target replaces or overlaps the search results set, and a user wishing to review the search results set or select a different search result must re-execute the search query or toggle between the search results set and respective targets. Instead, the search results set may be presented concurrently with a target of a selected search result. Upon selection of a search result, the device may be configured to resize the search results set to a condensed search results region, and present the target of the selected search result in a target region that is concurrently viewable with and not overlapping the condensed search results region. | 2013-12-05 |
20130325833 | LANGUAGE LEARNING OPPORTUNITIES AND GENERAL SEARCH ENGINES - Methods, computer systems, and computer-readable storage media for determining that a user of a general search engine has intent to not only view search results in a native language on a general search engine results page, but also to have non-native language learning opportunities presented on the general search engine results page. The non-native language learning opportunities include a set of search results drawn from a non-native language document source and presented in the non-native language. Other opportunities include a non-native language dictionary definition of a received search query, a non-native language translation of the search query, and on-demand translation tools available on the general search engine results page. | 2013-12-05 |
20130325834 | LINK ALLOCATION FOR SEARCH ENGINE OPTIMIZATION - A method, system and computer program product for allocating reference resources for search engine optimization, including obtaining a maximum number of reference resources to allocate, a set of search terms, and a preferred website domain. For each member in the set of search terms, a total number of web searches, a cost per click, the current position of the preferred website domain, the current traffic, and the current number of reference resources is determined. A solver is then used to calculate an allocation of reference resources. Displaying through a computer interface are the number of additional reference resources to allocate to each member of the set of search terms, generally to maximize the expected value that could be achieved if the new position of the preferred website for particular search terms is improved. | 2013-12-05 |
20130325835 | PRESENTATION OF SEARCH RESULTS WITH DIAGRAMS - Methods provide presentation of a plurality of search results and a diagram for each of the plurality of search results. The methods are carried out with computer readable program code, when read by a processor, that is configured for receiving a plurality of search results in response to a search request and accessing a database including signifier data for each of the plurality of search results. The signifier data may include information regarding at least a first signifier and a second signifier of each of the plurality of the search results. The methods may further include generating a first diagram of the first and second signifiers for each of the plurality of search results, the first diagram based at least in part on the signifier data, and presenting the plurality of search results and the first diagram for each of the plurality of search results via a browser application. | 2013-12-05 |
20130325836 | Systems and Methods for Providing Context Search Filtering - Included are embodiments for providing context search filtering. Some embodiments include receiving a search term for locating a document on a closed network, utilizing a closed network search algorithm to locate a plurality of documents on the closed network, and creating identifiers for the plurality of documents from the closed network, the identifiers being arranged in a predetermined order. Similarly, some embodiments include determining whether any of the identifiers relate to a common source and in response to determining that at least two of the identifiers relate to the common source, reorganizing the identifiers to incorporate the at least two identifiers under a common heading. Still some embodiments include providing a user interface that includes the common heading and at least a portion of the identifiers. | 2013-12-05 |
20130325837 | SYSTEM AND METHODS FOR UNIT OF MEASUREMENT CONVERSION AND SEARCH QUERY EXPANSION - A system and methods for unit of measurement conversion and search query expansion are described. The search query expansion may include identifying an initial unit of measurement associated with a property and an initial numeric value for the initial unit of measurement within a search query, automatically forming an expanded search query by expanding the search query to include at least one related unit of measurement associated with the property, and sending the expanded search query to a search engine to search a database. Other embodiments are described and claimed. | 2013-12-05 |
20130325838 | METHOD AND SYSTEM FOR PRESENTING QUERY RESULTS - Method, system, and programs for presenting query results are disclosed. An input is received from a user related to a search query. A first set of query results and a second set of query results are then obtained based on the search query. A query intent is detected based on the search query. A first presentation style associated with the detected query intent is determined for the first set of query results. The first and second sets of query results are provided to the user. The first set of query results are presented in the first presentation style. | 2013-12-05 |
20130325839 | Single Search Box Global - A global single search system that returns relevant search results for a user search query by identifying user intent and context implied therein. The system supports POI and address searches initiated from a single search box global only. Search query data is input in a single search box on a single search client to initiate a search for an arbitrary piece of data. Meta-data concerning a nature of a search is not provided to the single search system. A search servlet uses an ordered series of filter methods to extract specific aspects of user intent from a freeform search query, and accumulate intent information within a context shared by all filters. The system determines a data corpus to search based on context provided in a user search query. Relevant search results are returned to the single search client in a search response. The global single search system supports global markets. | 2013-12-05 |
20130325840 | METHOD AND SYSTEM FOR INTERACTIVE SEARCH RESULT FILTER - For filtering web search results, a method includes extracting metadata attributes and associated attribute values from web search results from a web search engine. The web search results organized into a results list with web page data grouped as an entry in the results list. The metadata attributes and associated attribute values extracted from the results list. The method includes presenting the extracted metadata attributes and receiving input from the user indicating one or more selected metadata attributes and a position indication for each selected metadata attribute. Each position indication indicates where in a custom report that attribute values for each selected metadata attribute are to appear. The method includes filtering the received results list based on the selected metadata attributes and displaying the filtered results list to the user in a custom report arranged by the selected position indication for each selected metadata attribute. | 2013-12-05 |
20130325841 | SQL TRANSFORMATION-BASED OPTIMIZATION TECHNIQUES FOR ENFORCEMENT OF DATA ACCESS CONTROL - Techniques are provided for a database server to identify a query that comprises an access check operator specifying a data access control policy, and if so, to re-write the query to produce an optimized query execution plan. A first technique rewrites a query comprising an access check operator based on the privileges associated with the database principal requesting the query. The rewritten query exposes the access predicates relevant to the requesting principal to subsequent database optimization processes. A second technique rewrites a query comprising an access check operator that specifies a data security policy that does not include a denied privilege. A third technique rewrites a query that comprises an access check operator specifying one or more database table columns that store row-specific access control lists. The rewritten queries are used to generate a query execution plan that provides for several query execution optimizations. | 2013-12-05 |
20130325842 | COMPUTER-READABLE STORAGE MEDIUM STORING UPDATE PROGRAM, UPDATE METHOD, AND UPDATE DEVICE - A computer-readable storage medium storing an update program that causes a computer to execute a process includes: acquiring an automaton performing matching of data in an input stream hierarchized by tags to a keyword in a query, the automaton in which an initial state, a start state indicating a start tag symbol, an end state indicating an end tag symbol, a transition between the initial state and the start state, a transition between the initial state and the end state, and a transition from the initial state to the initial state are defined; generating a path identifying the position of a start tag based on a hierarchy in the input stream when the start tag is read from the input stream; judging whether or not the generated path meets a condition corresponding to the keyword in the query; generating, when the generated path is judged to meet a condition. | 2013-12-05 |
20130325843 | Methods and Systems for Selecting and Presenting Content on a First System Based on User Preferences Learned on a Second System - A method of selecting and presenting content on a first system based on user preferences learned on a second system is provided. The method includes receiving a user's input for identifying items of the second content system and, in response thereto, presenting a subset of items of the second content system and receiving the user's selection actions thereof. The method includes analyzing the selected items to learn the user's content preferences for the content of the second content system and determining a relationship between the content of the first and second content systems to determine preferences relevant to items of the first content system. The method includes, in response subsequent user input for items of the first content system, selecting and ordering a collection of items of the first content system based on the user's learned content preferences determined to be relevant to the items of the first content system. | 2013-12-05 |
20130325844 | CAUSING DISPLAY OF SEARCH RESULTS - Apparatus has at least one processor and at least one memory having computer-readable code stored thereon which when executed controls the at least one processor:
| 2013-12-05 |
20130325845 | PRESENTATION OF SEARCH RESULTS WITH DIAGRAMS - Systems and computer program products provide presentation of a plurality of search results and a diagram for each of the plurality of search results. With computer readable program code, when read by a processor, the systems and products are configured for receiving a plurality of search results in response to a search request and accessing a database including signifier data for each of the plurality of search results. The signifier data may include information regarding at least a first signifier and a second signifier of each of the plurality of the search results. The code further includes generating a first diagram of the first and second signifiers for each of the plurality of search results, the first diagram based at least in part on the signifier data, and presenting the plurality of search results and the first diagram for each of the plurality of search results via a browser application. | 2013-12-05 |
20130325846 | LATENT COLLABORATIVE RETRIEVAL - A method, computer program product, and computer system for latent collaborative retrieval are described. A first mathematical representation of a query received from a user is generated. A second mathematical representation of a user profile is generated. A plurality of mathematical representations associated with a plurality of items is accessed. The first mathematical representation, the second mathematical representation, and the plurality of mathematical representations are transformed to have a uniform length. A first results subset of items is generated, based upon, at least in part, a first similarity measurement of the first mathematical representation and the plurality of mathematical representations. A second result subset of items is generated based upon, at least in part, a second similarity measurement of the second mathematical representation and the plurality of mathematical representations. A result set of items is generated based upon, at least in part, the first and second result subsets. | 2013-12-05 |
20130325847 | GRAPH-BASED SEARCHING - Improved, personalized searching through the use of personal connection graphs is presented. Responsive to receiving a search query, the search engine obtains a user sketch (representing a user's connection graph) and obtains search results responsive to the search query and also based, in part, as a function of a relationship distance between the user and the referenced content as determined by the user sketch. One or more search results pages are generated from the obtained search results and returned to the user. | 2013-12-05 |
20130325848 | HIERARCHAL CLUSTERING METHOD FOR LARGE XML DATA - The hierarchal clustering method for large XML data is a scalable technique that takes large XML data sets and measures distances between those sets of data and then arranges those data into groups according to the distance measurements. The method can cluster XML data by both content and structure, and can cluster homogeneous XML data. | 2013-12-05 |
20130325849 | Annotating Entities Using Cross-Document Signals - Techniques for annotating an entity in a document corpus using cross-document signals. A method includes determining which documents in a document corpus mention an entity of interest, clustering the documents that mention an entity of interest according to a temporal signal, a structural signal and/or a content signal, thereby forming at least one cluster of documents, and annotating at least one document in the at least one cluster of documents by marking each occurrence of the entity in the at least one document. | 2013-12-05 |
20130325850 | SYSTEMS AND METHODS FOR DISCOVERING SOCIAL ACCOUNTS - Methods and systems allow organizations to discover accounts, subscriptions, properties, sites and other online portals within each distinct social network platform and across disparate social network platforms, publishing platforms and networks that represent, claim to represent or are relevant to their organization and/or brands based on search terms and facilitate the statistical reporting and analysis of activities on the discovered properties. | 2013-12-05 |
20130325851 | Free-Text Search for Integrating Management of Applications - An integration mechanism for managing computing components may be provided. It may comprise collecting management information about the computing components using a data collection component, storing objects of the collected management information in a full-text search-index data-structure, generating for each collected object a displayable result snippet, searching the full-text search-index data-structure for matching objects based on a received parameter, retrieving all matching objects of the full-text search-index data-structure related to the search, and displaying the matching objects in form of the related result snippets, wherein the integration mechanism is independent from the computing components it is collecting management information from. | 2013-12-05 |
20130325852 | SEARCHING BASED ON AN IDENTIFIER OF A SEARCHER - A query is received to search data, where the query includes a search term. A search of the data is performed in response to the query, wherein the search produces result data based on the search term and an identifier of a searcher submitting the query. | 2013-12-05 |
20130325853 | DIGITAL MEDIA PLAYERS COMPRISING A MUSIC-SPEECH DISCRIMINATION FUNCTION - Embodiments are described for the discrimination of media files to be played by a digital media player, so that non-music or speech files can be filtered, ignored, tagged, or removed, leaving only desired files such as music files that will get played. Other non-desired files (e.g., video files) can be filtered, ignored, tagged, or removed, as well. In various embodiments, duplicate files can be filtered, ignored, tagged, or removed from the media files to be played by the digital media player. The resulting music files can be played as desired by a user, for example, in continuous or random play mode. | 2013-12-05 |
20130325854 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, INFORMATION PROCESSING PROGRAM, AND RECORDING MEDIUM - An information processing apparatus allows a user to easily find information about search targets which the user is likely to desire. Pieces of information about a plurality of searched search targets displayed as a search result include attribute values of search targets. The information processing apparatus specifies information selected by the user from displayed information, and compares an attribute value of a selected search target, with attribute values of search targets associated with display rankings which are higher than a display ranking of the selected search target associated with the specified information. When the attribute value of the selected search target is more advantageous for the user, the information processing apparatus performs control such that information about search targets whose attribute values are more advantageous for the user than that of the selected search target changes to a display mode which is more easily visually checked than the information about search targets whose attribute values are more disadvantageous for the user than that of the selected search target. | 2013-12-05 |
20130325855 | Venue Prediction Based on Ranking - A technique is disclosed for presenting possible check-in venues to a mobile device user, such as for the purpose of checking in with social networking services such as Foursquare. The disclosed technique operates by training a model during an initial training sequence. The trained model, representing a learned hypothesis, describes venues that are ranked according to their relevance to users who are also described by the model. During a subsequent run-time sequence, the system receives real-time geolocation data that represents users, wherein the data includes user geolocation and the level of accuracy of the geolocation. The system generates a set of candidate venues, ranks the generated candidate venues by applying the learned hypothesis, which can be dependent on the level of accuracy, and presents the user with the ranked venues as possible check-in venues. The user can then select the venue actually being checked into from the presented check-in venues. | 2013-12-05 |
20130325856 | APP RECOMMENDATION USING CROWD-SOURCED LOCALIZED APP USAGE DATA - Apps may be tagged with location data when they are used. Mobile device may anonymously submit app usage data. Aggregated app usage data from many mobile devices may be analyzed to determine apps that are particularly relevant to a given location (i.e., exhibiting a high degree of localization). Analysis may include determining the app usage intensity, whether hotspots exist or not at a given location, the spatial entropy of a particular app, the device populations in a particular area, etc. Based on the localized app analysis, apps may be ranked according to local relevance, and, based on this ranking, app recommendations may be provided to a user. | 2013-12-05 |
20130325857 | Method and Apparatus of Ordering Search Results - Ordering search results may include obtaining an exposed log file from a log system, computing a Bayesian posterior probability for relevancy between the log file and a search request, computing an expected value of the relevancy between the log file and the search request based on the Bayesian posterior probability, storing the search request and an identifier of the log file as a key and the expected value of the relevancy between the log file and the search request as a value into a search data structure, in response to receiving a search request submitted by a user, finding expected values of relevancy between the submitted search request and log files that are relevant to the submitted search request from the search data structure, and ordering the found log files in a descending order of the expected values. | 2013-12-05 |
20130325858 | PERSONALIZED PROFESSIONAL CONTENT RECOMMENDATION - A personalized content recommendation system includes a client interface configured to automatically monitor a user's information data stream transmitted on the Internet. A hybrid contextual behavioral and collaborative personal interest inference engine resident to a non-transient media generates automatic predictions about the interests of individual users of the system. A database server retains the user's personal interest profile based on a plurality of monitored information. The system also includes a server programmed to filter items in an incoming information stream with the personal interest profile and is further programmed to identify only those items of the incoming information stream that substantially match the personal interest profile. | 2013-12-05 |
20130325859 | USING CHRONOLOGY AS THE PRIMARY SYSTEM INTERFACE FOR FILES, THEIR RELATED META-DATA, AND THEIR RELATED FILES - Methods, Apparatuses, and Storage Medium associated with chronology based file management are disclosed herein. In embodiments, a method may include receiving a selection of a plurality of files or the plurality of files, and generating association data selectively associating the plurality of files with a plurality of events scheduled in a calendar of a user or time periods of the user. The method may further include storing the association data to facilitate subsequent selectively retrieval of the plurality of files in response to retrieval requests for files associated with selected ones of the plurality of events scheduled in the calendar of the user or the time periods of the user. Other embodiments may be described and claimed. | 2013-12-05 |
20130325860 | SYSTEMS AND METHODS FOR AUTOMATICALLY GENERATING A RESUME - A résumé of a developer working with a parallel processing development environment is, at least in part, automatically generated by the parallel processing development environment based upon information of the developers work experience within the development environment. | 2013-12-05 |
20130325861 | Data Clustering for Multi-Layer Social Link Analysis - Embodiments of the invention relate to a modeling activity area associated with groups of data items. Tools are provided to profile activity area involvement, both from the data item and from associated participants. The data items are placed into clusters and one or more activity areas are derived from the formed clusters. Each activity area is defined from the perspective of a single user. Participants in an activity area are connected to a user, but not necessarily to each other. The combination of formations of clusters and activity areas provides a multi-facetted organization of connections between data items and associated participants. | 2013-12-05 |
20130325862 | PIPELINED INCREMENTAL CLUSTERING ALGORITHM - Systems and methods are provided for large-scale, incrementing clustering. A plurality of processing nodes each include a processor and a non-transitory computer readable medium. The non-transitory computer readable medium stores a plurality of clusters of feature vectors and machine executable instructions for determining a plurality of values for a distance metric relating each of the plurality of clusters to an input feature vector and selecting a cluster having a best value for the distance metric. An arbitrator is configured to receive the selected cluster and best value for the distance metric from each of the plurality of processing nodes and determine a winning cluster as one of the selected clusters and a new cluster. A multiplexer is configured to receive the winning cluster and provide the winning cluster and a new input feature vector to each of the plurality of processing nodes. | 2013-12-05 |
20130325863 | Data Clustering for Multi-Layer Social Link Analysis - Embodiments of the invention relate to a modeling activity area associated with groups of data items. Tools are provided to profile activity area involvement, both from the data item and from associated participants. The data items are placed into clusters and one or more activity areas are derived from the formed clusters. Each activity area is defined from the perspective of a single user. Participants in an activity area are connected to a user, but not necessarily to each other. The combination of formations of clusters and activity areas provides a multi-facetted organization of connections between data items and associated participants. | 2013-12-05 |
20130325864 | SYSTEMS AND METHODS FOR BUILDING A UNIVERSAL MULTIMEDIA LEARNER - The present disclosure describes a method and system called “Universal Learner (UL),” which provides a unified framework to understand multimedia signals. The UL utilizes the loosely annotated multimedia data on the Web, analyses it in various signal domains, such as text, image, audio and combinations thereof, and builds an association graph called the “Multimedia Brain,” which basically comprises visual signals, audio signals, text phrases and the like that capture a multitude of objects, experiences and their attributes and the links among them that capture similar intent or functional and contextual relationships. | 2013-12-05 |
20130325865 | Method and Server for Media Classification - The embodiments of the present invention relates to a method and system for classifying media. The classification is achieved by using annotation ontolgies and by associating bottom level concepts of the annotation ontology tree with explanatory representation data of a selected representation domain and then comparing the explanatory representation data with transformation of the media in the selected representation domain. In this way tags can be generated which corresponds to bottom level concepts of the ontology tree which corresponds to explanatory representation data which can be found in the transformed media. | 2013-12-05 |
20130325866 | Community Profiling for Social Media - Embodiments of the invention relate to modeling communities associated with groups of data items. Tools are provided to iteratively assign data items to communities and to update topic and participant distribution in the assigned communities. As the distributions are updated, the characteristics of the communities are updated. Each activity area is defined from the perspective of a single user. Participants in a community are connected to a user, but not necessarily to each other. The combination of formations of communities and the statistical aspect of evaluating characteristics of the communities provides a multi-facetted organization of connections between data items and associated participants. | 2013-12-05 |
20130325867 | IDE INTEGRATED CATALOG AND DDIC-BRIDGE FOR IN-MEMORY DATABASE VIEWS - The disclosure generally describes computer-implemented methods, software, and systems for providing a homogeneous data model based on in-memory database views. One computer-implemented method includes creating an application view field associated with an application view, indicating a base database field in a base database table for the created application view field, collecting additional information associated with the indicated base database field, determining at least a data element and a domain associated with the indicated base database field using the collected additional information, determining, by operation of a computer using the collected additional information, that multiple determined catalog entries associated with the indicated base database field exist in a catalog, and proposing names for the application view field, wherein the proposed names are presented from most specific to least specific. | 2013-12-05 |
20130325868 | INFORMATION PROCESSING APPARATUS, CONTROL METHOD THEREFOR, AND PROGRAM FOR CLASSIFYING A PLURALITY OF DATA - An information processing apparatus classifies a piece of content data as a first or second category in response to a user operation while outputting the content data for a predetermined time. When the user operation is not performed from the start of the output of the content data to the termination, the information processing apparatus automatically classifies the content data as a third category. When there is a shortage of the number of pieces of content data classified as the first or second category, the information processing apparatus adds a piece of content data classified as the third category. | 2013-12-05 |
20130325869 | CREATING A CONTENT INDEX USING DATA ON USER ACTIONS - Personalized content is generated from different media items using a content index. The content index is generated or updated by identifying segments of media items that are of particular interest to users. User interactions with the media items are analyzed and metadata of segments of media items that are determined to be of particular interest to the users is recorded. The parameters associated with a request for personalized content for a user are matched with the recorded metadata to identify relevant media items or segments of media items which are transmitted to the user as the personalized content. | 2013-12-05 |
20130325870 | USING CONTENT - Among other things, the ability of people and entities to produce, distribute, and use text, images, video, and other items of digital content is enhanced by providing software tools that enable them to (a) clip items of the digital content on any platform that is capable of presenting the digital content, (b) store copies of the clipped items along with copies of items clipped by other people or entities, in a common storage place controlled by a host, (c) form and store meshes of tags to represent their mindsets about items of content. The tags include primary tags that express their direct observations about the content and secondary tags that express their observations about the primary tags and the secondary tags. Meshes of the tags are made available to the people who formed them and, if permitted by them, to other people and entities for use in understanding their mindsets and in producing, delivering, and using digital content. | 2013-12-05 |
20130325871 | Method and System for Collecting and Organizing Data Corresponding to an Event - A system and method for analyzing data from a plurality of computer environments. The computer environments are authenticated and data is imported to a memory location. The data is converted into a uniform format to enable expedited searching by one or more authenticated users. The data may be marked so that a user may determine which computer environment provided the data. The system may also create one or more indexes of the data to assist one or more users in searching the data. | 2013-12-05 |
20130325872 | Method and System for Collecting and Organizing Data Corresponding to an Event - A system and method for analyzing data from a plurality of computer environments. The computer environments are authenticated and data is imported to a memory location. The data is converted into a uniform format to enable expedited searching by one or more authenticated users. The data may be marked so that a user may determine which computer environment provided the data. The system may also create one or more indexes of the data to assist one or more users in searching the data. | 2013-12-05 |
20130325873 | SYSTEMS AND METHODS FOR LOAD-BALANCING BY SECONDARY PROCESSORS IN PARALLELIZED INDEXING - The invention relates to electronic indexing, and more particularly, to the parallelization of indexing. Systems and methods of the invention index data archives by breaking a job into work items and sending the work items to multiple processors that can each determine whether to index data associated with the work item or to create a new work item and have a different processor index the data. This gives the system an internal load-balancing that results in indexing jobs during which no processor stands idle while another processor indexes data of unexpected complexity. | 2013-12-05 |
20130325874 | Columnwise Storage of Point Data - A database query of point data among two or more axes of a database is received. The database stores point data in distinct integer vectors with a shared dictionary. Thereafter, the dictionary is scanned to determine boundaries for each axis specified by the query. In response, results characterizing data responsive to the query within the determined boundaries for each axis are returned. Related apparatus, systems, techniques and articles are also described. | 2013-12-05 |
20130325875 | Systems and Methods for Delivering Tailored Content Based Upon a Consumer Profile - The present disclosure includes a system, method, and article of manufacture for aggregating a consumer profile, identifying tailored content (e.g., in response to a trigger event and/or based upon a consumer profile), and/or tailoring a digital destination. For example, the systems may receive direct data indicating an interest in receiving specific content, aggregate that data into a consumer profile, compare the consumer profile to content, and/or identify tailored content based upon the comparison. Further, the systems may communicate the tailored content to a web client associated with a consumer, receive a transaction request from a web client, and/or receive bids associated with tailored content. In addition, these systems may prioritize tailored content comprising a plurality of tailored offers and/or forecast a budget for an upcoming experience. | 2013-12-05 |
20130325876 | METHOD OF RANKING AND DISPLAYING CERTIFIED CONTENT - A method of displaying and ranking certified and user-generated content from an individual user against content from other users. The user is prompted to input user-generated information and various related information and at least one visual recording is received and associated to create a user single trophy entry in a remote database. The user single trophy entry is ranked relative to other trophy entries in the remote database, and is displayed with a determined rank. Overlay data may be automatically received and associated based on the user-generated information and the related information. To create certified user single trophy entries a list of certification partners may be displayed and used. | 2013-12-05 |
20130325877 | Uses Of Root Cause Analysis, Systems And Methods - Sentiment-based and root cause-based analysis and recommendation engines are presented. The engines are preferably capable of leveraging a sentiment root cause for multiple purposes including integration with CRM applications, guiding search results, or recommending changes to documents. | 2013-12-05 |
20130325878 | COMMUNITY PLANNING SYSTEM WITH SENSORS AND SOCIAL MEDIA - An interactive, computerized system for community planning includes one or more databases storing a computer-generated community plan and supporting data associated with a geographical area. The system includes sensors providing data related to the geographical area, and a feedback module configured to receive feedback from a plurality of persons or entities associated with the geographical area or the community plan. The feedback may comprise social media activity data collected from one or more social media outlets. The system includes a scoring module to determine scores related to criteria associated with the community plan based upon the sensor data and the activity data. The system is configured to utilize the scores in the development, implementation, maintenance, or control of the community plan. The system includes a notification module to transmit or display a notification upon the occurrence of a suggested change to the community plan or a trade specification. | 2013-12-05 |