29th week of 2013 patent applcation highlights part 53 |
Patent application number | Title | Published |
20130185227 | METHOD AND SYSTEM FOR EVALUATING PRICING OF ASSETS - Methods are provided for detecting price manipulation in assets by receiving data indicating returns on an asset, generating a histogram of returns data, determining a first area under a curve of the histogram in a first interval, determining a second area under the curve of the histogram in a second interval; and calculating a bias ratio which comprises a ratio based on the first area and the second area. | 2013-07-18 |
20130185228 | System and Method of Data Collection, Analysis and Distribution - A computer based system for the collection, analysis and dissemination of data related to financial transactions using an Internet interface in order to minimize investment risk. The system includes a computer processor and a plurality of software applications adapted to run on said processor for performing a variety of functions. The processor and software together operate as a computer engine. A database is connected with the engine for storing data related to the transactions. Means are provided for inputting data to the database, and an application programing interface is carried by the engine for communication with software carried on third party systems through data feeds connected to the engine. A web application interface connected to the engine allows a user of the system to access the engine through a local terminal and display. The application interface permits the user to conduct searches of the database for information pertaining to a particular financial deal, said deal including a financial transaction or project and project profile. The software applications include at least one application programming interface for tracking deal analysis and storing the analysis on the database. The application interface permits a user to view the stored analysis on the user's local display. | 2013-07-18 |
20130185229 | APPARATUS AND METHOD FOR MANAGING STORAGE OF DATA BLOCKS - A data block storage management capability is presented. A cloud file system management capability manages storage of data blocks of a file system across multiple cloud storage services (e.g., including determining, for each data block to be stored, a storage location and a storage duration for the data block). A cloud file system management capability manages movement of data blocks of a file system between storage volumes of cloud storage services. A cloud file system management capability provides a probabilistic eviction scheme for evicting data blocks from storage volumes of cloud storage services in advance of storage deadlines by which the data blocks are to be removed from the storage volumes. A cloud file system management capability enables dynamic adaptation of the storage volume sizes of the storage volumes of the cloud storage services. | 2013-07-18 |
20130185230 | MACHINE-LEARNING BASED CLASSIFICATION OF USER ACCOUNTS BASED ON EMAIL ADDRESSES AND OTHER ACCOUNT INFORMATION - A trust level of an account is determined at least partly based on a degree of the memorability of an email address associated with the account. Additional features such as those based on the domain of the email address and those from the additional information such as name, phone number, and address associated with the account may also be used to determine the trust level of the account. A machine learning process may be used to learn a classification model based on one or more features that distinguish a malicious account from a benign account from training data. The classification model is used to determine a trust level of the account, and/or if the account is malicious or benign, and may be continuously improved by incrementally adapting or improving the model with new accounts. | 2013-07-18 |
20130185231 | PREDICTING DIAGNOSIS OF A PATIENT - Method, system, and computer program product are provided for predicting diagnosis of a patient performed by a computerized device. The method may include: modeling data from a group of successfully diagnosed patients, wherein the data is modeled as treatment paths of patients including referrals to medical practitioners; and predicting diagnosis for a current patient by comparing a treatment path of the current patient with the modeled treatment paths of successfully diagnosed patients, including calculating a probability of a given diagnosis from the modeled treatment paths. The method may include: defining a set of medical entities including medical practitioners to which a patient has been referred; and gathering treatment paths of successfully diagnosed patients, wherein the treatment path links medical entities in a directional route. Predicting diagnosis for a current patient may use the modeled data to calculate the probability of each model instance for each diagnosis and choosing the model instance of the diagnosis that maximizes the treatment path probability. | 2013-07-18 |
20130185232 | PROBABILISTIC EVENT NETWORKS BASED ON DISTRIBUTED TIME-STAMPED DATA - Described herein are techniques for producing probabilistic event networks (Bayesian network based representation of node dependencies, whereas nodes comprise event occurrences, explicit times of occurrences, and the context of event occurrences) based on distributed time-stamped data. An aspect provides a method for predicting events from event log data via constructing a probabilistic event net and using the probabilistic event net to infer a probabilistic statement regarding a future event using a network inference mechanism. Other embodiments are disclosed. | 2013-07-18 |
20130185233 | SYSTEM AND METHOD FOR LEARNING POSE CLASSIFIER BASED ON DISTRIBUTED LEARNING ARCHITECTURE - A system and method for learning a pose classifier based on a distributed learning architecture. A pose classifier learning system may include an input unit to receive an input of a plurality of pieces of learning data, and a plurality of pose classifier learning devices to receive an input of a plurality of learning data sets including the plurality of pieces of learning data, and to learn each pose classifier. The pose classifier learning devices may share learning information in each stage, using a distributed/parallel framework. | 2013-07-18 |
20130185234 | System and Method for Using Genetic Algorithm for Optimization of Targeting Systems, Based on Aggregated Scoring Models - In our presentation here, as examples, we describe methods and systems with various optimization techniques. More specifically, they are directed to methods for applying genetic algorithms, and the use of genetic algorithms in optimizing targeting systems that use an aggregated scoring model. In general, the genetic algorithm principle gives guidelines for constructing practical search techniques when the number of possible trials is extremely large. The examples and other features and advantages of the system and method for using Genetic Algorithm for Optimization of Targeting Systems are described. | 2013-07-18 |
20130185235 | NON-TRANSITORY COMPUTER READABLE MEDIUM STORING A PROGRAM, SEARCH APPARATUS, SEARCH METHOD, AND CLUSTERING DEVICE - Provided is a non-transitory computer readable medium storing a program causing a computer to function as a learning data acquiring unit that acquires learning data, a memory unit that performs machine learning using the learning data about cluster division where Markov chains of transition via a link from a node to a node on a network formed from plural nodes are divided into plural clusters each of which is indicated by a biased Markov chain and calculates a steady state of each biased Markov chain, a search condition receiving unit that receives a search condition from a user, a cluster extracting unit that extracts clusters suitable for the search condition, a partial network cutting unit that cuts a partial network formed by a node group belonging to the clusters, and an importance calculating unit that calculates importance of each node on the partial network. | 2013-07-18 |
20130185236 | MONITORING DATA ANALYZING APPARATUS, MONITORING DATA ANALYZING METHOD, AND MONITORING DATA ANALYZING PROGRAM - An object of the present invention is to reduce a prediction error even if a monitoring target system has a plurality of patterns of use. A monitoring data analyzing apparatus includes a log data file | 2013-07-18 |
20130185237 | DEVICE AND METHOD FOR DATA PROCESSING - A neuromorphic data processing device comprising a plurality of spiking neurons, with each of these neurons comprising: an integrator designed to receive successive analogue pulses each having a certain value, and accumulate the values of the pulses received in a recorded value, referred to as accumulation value, and a discharger designed to emit a pulse, referred to as discharge pulse, according to the accumulation value, and a silicon support having two surfaces, the neurons being carried out on at least one of the two surfaces, the integrator of each neuron comprising a metal via of the TSV type between the two surfaces of the silicon support, the metal via of the TSV type forming a capacitor with the silicon support and having an electric potential forming the accumulation value wherein the values of the pulses received are accumulated and according to which the discharge pulse is emitted. | 2013-07-18 |
20130185238 | SPLITTING DEVICE, SPLITTING METHOD, AND RECORDING MEDIUM - A splitting device includes a memory and a processor configured to execute a program including a procedure. The procedure includes: setting a halt condition with a number of point data points to halt equal splitting as to a target region for equal splitting to split equally; splitting the target region for equal splitting, until the number of point data points in the target region for equal splitting is less than the halt condition, by taking the target region for equal splitting, as a region where a point data group exists; setting a region having point data of a number or more according to the halt condition obtained by performing the splitting, to the target region for equal splitting; performing the uniform splitting regarding each region group having less point data than the number according to the halt condition obtained by performing the splitting. | 2013-07-18 |
20130185239 | Accelerated Decision Tree Execution - A method for accelerated decision tree execution in a processor of a digital system is provided that includes receiving at least some attribute values of a plurality of attribute values of a query for the decision tree in a pre-processing component, evaluating the received attribute values in the pre-processing component according to first early termination conditions corresponding to a first decision to determine whether or not the received attribute values fulfill first early termination conditions, and querying the decision tree with the plurality of attribute values when the received attribute values do not fulfill the first early termination conditions. | 2013-07-18 |
20130185240 | Rule-Based Binding - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for rule-based binding. In one aspect, a method includes receiving first input to a graphical user interface (GUI) associating a property of a data model presented in the GUI with a data view component of a document presented in the GUI, wherein a change to a value of the data view component is reflected in a value of the property in the data model when the document is used in a workflow, and wherein the workflow is a logical sequence of documents, including the document, that is processed according to the logical sequence such that values for one or more data view components associated with the documents are received. | 2013-07-18 |
20130185241 | DYNAMIC DETERMINATION OF NEEDED AGENT RULES - A method for updating rule statistics in an execution environment by an agent that utilizes a rule engine, comprising collecting an activation statistic when a rule is activated, collecting a firing statistic when a rule is fired; and storing the activation statistic and the firing statistic in a rule history once processing by the rule engine is complete. | 2013-07-18 |
20130185242 | DATA SOURCE FOR PARALLEL INFERENCE - Systems, methods, and other embodiments associated with data sources adapted for parallel inference on triples associated with a semantic model are described. One example method includes creating a source table that is partitioned on triple predicate and stores triples for entailment. The source table may store compact triple identifiers that have been mapped to triple identifiers from the semantic model. | 2013-07-18 |
20130185243 | ALERT MANAGEMENT SYSTEM AND METHOD - A system and related method for automating alert decision-making in a computer network are disclosed. The system and method act to receive an alert request from an event management system, and then carries out operations using several sets of inference rules, associating the alert request to a generic conceptual data model of alert request and alert resolution. The generic model is specialized to represent the specific environment being monitored. The alert request is enriched with contextual and network information in order to generate one or several alert resolution actions. | 2013-07-18 |
20130185244 | ORGANICALLY RANKED KNOWLEDGE CATEGORIZATION IN A KNOWLEDGE MANAGEMENT SYSTEM - Embodiments of the present invention address deficiencies of the art in respect to expert modeling in a KM system and provide method, system and computer program product for organically ranked knowledge and categorization for a KM system. In one embodiment of the invention, a method for organically ranked knowledge and categorization in a KM system can be provided. The method can include bookmarking answer content for a first end user of the knowledge management system, suggesting a set of categories previously associated with the answer content by other end users of the knowledge management system, and categorizing the bookmarked answer content with a category selected from the set of categories. | 2013-07-18 |
20130185245 | SOCIAL NETWORK ANALYSIS FOR CHURN PREDICTION - Traditional methods of prediction of the likelihood of churning in a given market such as wireless telecommunications are improved by inclusion of social network analysis to predict churning by members of a population in response to churning by any given individual member of that population. A sphere of influence of individual members of the population on other members of the population are modeled and analyzed through a plurality of degrees of separation and quantitatively evaluated by a number of relational algebraic joins in which at least one such join includes weights to assert a diminishing influence with number of degrees of separation. | 2013-07-18 |
20130185246 | APPLICATION QUALITY TESTING TIME PREDICTIONS - Techniques for application quality testing time predictions are described that provide customized processing time predictions for application testing. Testing times for various stages of testing are collected during application testing. The collected testing data may be stored in association with various attribute values ascertained for the applications. The collected timing data is used to predict processing times for applications that match defined profiles. The profiles may be defined to include selected attributes and values used to identify applications having corresponding attributes and values. The collected timing data may be processed to derive predictions for processing times on a profile-by-profile basis. When a new application is submitted, the application is matched to a particular profile based on attribute values possessed by the application. Then, processing time predictions associated with the matching profile may be obtained, assigned to the application, and output for presentation to a developer of the application. | 2013-07-18 |
20130185247 | Computer-Implemented System And Method For Identifying Tasks Using Temporal Footprints - A computer-implemented system and method for identifying tasks using temporal footprints is provided. A database of temporal footprints is maintained. Each temporal footprint is representative of a different task and includes one or more significant patterns of two or more sequential events. Events performed by one or more users are tracked. At least one pattern including sequential occurrences of two or more of the tracked events is identified. The identified pattern is compared to each of the significant patterns of the temporal footprints. A footprint score for the identified pattern is determined with respect to each temporal footprint. The task associated with the temporal footprint having the highest footprint score is assigned to the identified pattern. | 2013-07-18 |
20130185248 | SYSTEM AND METHOD FOR ANALYZING AND REPORTING EXTENSIBLE DATA FROM MULTIPLE SOURCES IN MULTIPLE FORMATS - A system and method for analyzing and reporting data from multiple sources is provided. The system is a foundation for an analytical platform that covers not only traditional relational data, but also a new generation of extensible data formats designed for the web, such as those based on XML (FIXML, FpML, ebXML, XBRL, ACORD, etc.), as well as HTML, E-mail, Excel, PDF, and others. In a preferred embodiment, the eXtensible on-line analytical processing (XOLAP), is a scalable client/server platform that allows the multi-dimensional analysis of modern data types, as well as traditional relational data, by bringing them all into an internal common XML-based model, without the time and expense of creating a data warehouse. | 2013-07-18 |
20130185249 | EFFICIENT LOADING OF DATA IN DATABASES - A computer implemented method, system and computer program product for managing data in databases generates a control file for a database by utilizing a definition file associated with the database and predefined column definitions, organizes data within a data file in a predefined format, wherein the data is desirable to be loaded in the database, and loads the data from the data file to the database by utilizing the control file and the data file. | 2013-07-18 |
20130185250 | SYSTEM AND METHODS FOR INTEGRATING SOFTWARE LAYERS FOR OLAP - In accordance with aspects of the disclosure, a system and methods may be provided for integrating software layers in OLAP including receiving, at an OLAP engine, a dynamic result set structure passed from an application layer via one or more other software layers. The dynamic result set structure may include a description of entities for a target layer. The system and methods may include enhancing raw data, at the OLAP engine, acquired from a database associated with a source layer based on the description of entities for the dynamic result set structure and passing one or more references to one or more memory locations for data elements in the dynamic result set structure from the OLAP engine to the application layer via the one or more other software layers for acquiring each data element associated with each corresponding reference in the dynamic result set structure. | 2013-07-18 |
20130185251 | EFFICIENT LOADING OF DATA IN DATABASES - A computer implemented method, system and computer program product for managing data in databases generates a control file for a database by utilizing a definition file associated with the database and predefined column definitions, organizes data within a data file in a predefined format, wherein the data is desirable to be loaded in the database, and loads the data from the data file to the database by utilizing the control file and the data file. | 2013-07-18 |
20130185252 | Document Revision Manager - Methods, systems, tools and computer program products are provided that enable a document revision management system to utilize lockless collaboration such that a plurality of users can edit a plurality of document versions concurrently. The system uses a directed acyclic graph to store information concerning ancestry of versions of related documents and to track revisions between parent and children versions. The system provides users the ability to save versions as private or published and to apply security parameters so that only certain users or groups of users may see specific revisions and/or versions. The system can redact portions of the revision history for non-authorized users. Automated publication notifications can be distributed by the system to document moderators to update them of available changes to documents. The system allows for automated merging of non-conflicting changes as well as moderated merging when human interaction is desired and/or required. | 2013-07-18 |
20130185253 | WEB SERVICE FOR USER AND SUBSCRIPTION DATA STORAGE - A data service that manages user and subscription data for multiple services. The data service maintains a database of the user and subscription data and provides an interface that allows the other services, that act as clients to the data service, to access that data. The data service avoids the need for the client services to implement a framework to manage the storage of user and subscription data. The data service also allows user profile data to be updated by one client service and used by all others. Further, data, such as usage history or information on policy violations, may be shared by multiple services. | 2013-07-18 |
20130185254 | System for the Centralized Storage of Wireless Customer Information - A system for storing subscriber information in a centralized location includes a processor, memory coupled to the processor, and a data storage device coupled to the processor. The data storage device includes a subscriber profile portion for storing personal information about a subscriber. The subscriber profile portion includes a subscriber identification portion for storing an identification string. The subscriber profile portion is associated with an account type portion for storing account information, a portal portion for storing portal information, and an account status portion for storing account status information. The data storage device further includes a subscription portion for storing subscription information. The subscription portion is associated with a device portion for storing device information, a services portion for storing services information, and a mobile subscription portion for storing mobile subscription information. | 2013-07-18 |
20130185255 | DATABASE MANAGEMENT METHOD - A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heap tuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control. | 2013-07-18 |
20130185256 | Controlling the Placement of Data in a Storage System - A method, computer readable storage medium and computer system for controlling the allocation of data to one of a plurality of storage units of a storage system, the method comprising: accessing a source storage unit comprising the data; gathering file system level (FS-level) metadata from the source storage unit; analyzing the gathered FS-level metadata for determining if the data should be moved to one of the other storage units, said other storage unit acting as a destination storage unit; and in case the data should be moved, displaying an indication of the destination storage unit and/or automatically moving the data to the determined destination storage unit. | 2013-07-18 |
20130185257 | CLOUD DATA RESILIENCY SYSTEM AND METHOD - An exemplary cloud data system includes a primary datacenter device that maintains a complete copy of a file. A plurality of secondary datacenter devices maintain respective encoded, partial copies of the file. At least some of the encoded partial copies are sufficient to recreate the complete copy of the file. The primary datacenter device makes any changes to the complete copy of the file responsive to any write operation on the file. The primary datacenter device provides correspondingly changed encoded partial copies to the respective secondary datacenter devices. | 2013-07-18 |
20130185258 | UNIFIED LOCAL STORAGE SUPPORTING FILE AND CLOUD OBJECT ACCESS - A method and system for providing unified local storage support for file and cloud access is disclosed. The method comprises writing a chunk on a storage server, and replicating the chunk to other selected storage servers when necessary. The method and system further comprise writing a version manifest on the storage server; replicating the version manifest to other selected storage servers when necessary. Object puts or appends are implemented by first chunking the object, determining if the chunks are new, transferring the chunks if required, followed by creation of a new version manifest referencing the chunks. Finally, the method and system include providing concurrent file-oriented read and write access consistent with the stored version manifests and chunks. | 2013-07-18 |
20130185259 | SYSTEM AND METHOD FOR SCALABLE REFERENCE MANAGEMENT IN A DEDUPLICATION BASED STORAGE SYSTEM - A system and method for managing a resource reclamation reference list at a coarse level. A storage device is configured to store a plurality of storage objects in a plurality of storage containers, each of said storage containers being configured to store a plurality of said storage objects. A storage container reference list is maintained, wherein for each of the storage containers the storage container reference list identifies which files of a plurality of files reference a storage object within a given storage container. In response to detecting deletion of a given file that references an object within a particular storage container of the storage containers, a server is configured to update the storage container reference list by removing from the storage container reference list an identification of the given file. A reference list associating segment objects with files that reference those segment objects may not be updated response to the deletion. | 2013-07-18 |
20130185260 | DATA BACKUP AND RESTORAL APPARATUS, SYSTEM, AND METHODS - A method for maintaining incremental backups of a file. The method includes identifying a target file to be backed up. The method also includes comparing the target file to a one or more previously backed up files, in order to identify differences of the target file from a corresponding previously backed up file. The method also includes generating a delta version of the target file that records the identified differences from the previously backed up file. | 2013-07-18 |
20130185261 | System and Method for Identifying and Mitigating Redundancies in Stored Data - In an example of an embodiment of the invention, a repeating pattern is identified within stored data comprising a plurality of data files, each data file comprising at least a header section and a data section stored in an unknown format. At least one occurrence of the repeating pattern is identified as a header section of a respective data file, and a data section of the respective data file is identified based, at least in part, on a location of the at least one occurrence of the repeating pattern. The identified data section of the respective data file is backed up. Systems are also disclosed. | 2013-07-18 |
20130185262 | TRANSACTION LOG MANAGEMENT - Managing a log-full condition of a transaction log in a transaction processing system, where the transaction log has a plurality of log records each associated with a particular transaction. When a log-full condition is detected, the active transaction having the oldest log entry of all active transactions is identified and logging for all transactions except for the identified transaction is temporarily suspended. A dynamic transaction backout of the identified transaction is initiated, with the writing of a backout record for the identified transaction to the log being delayed. Confirmation that the backout has completed is awaited before trimming the log. Then the delayed backout record for the identified transaction is written to the log, and normal logging is resumed. | 2013-07-18 |
20130185263 | SELF LEARNING BACKUP AND RECOVERY MANAGEMENT SYSTEM - A system and method provide for a reception of data at a computer processor. The data relates to a dataset in a computer system. The computer processor calculates a weight for the dataset as a function of the data, and the processor executes an action on the dataset as a function of the weight. In an embodiment, the action is a backup of data on the computer system, and through recalculation of the weight over a period of time, the backup schedule, backup media, and other parameters are altered based on the changing weight for a dataset. | 2013-07-18 |
20130185264 | MAINTAINING A MIRRORED FILE SYSTEM FOR PERFORMING DEFRAGMENTATION - A computational device maintains logical mirroring of a first file system with a second file system. A first set of input/output (I/O) requests is satisfied from the first file system while the second file system is undergoing defragmentation. A second set of I/O requests is satisfied from the second file system while the first file system is undergoing defragmentation. | 2013-07-18 |
20130185265 | METHOD FOR HORIZONTAL SCALE DELTA ENCODING - Data can be transferred between computers at remote sites by transferring the data itself, or by transferring files showing how data at an originating site can be recreated from data already present at a receiving site. As part of the data transfer, a determination can be made as to what is the most appropriate way for the transfer to take place. Further, in cases where data is not transferred directly between originating and receiving sites, it is possible that some preparatory steps might be performed to improve the efficiency of the transfers to the receiving sites when they do take place. Additional efficiencies can be obtained in some cases by using the parallel processing capabilities provided by a cloud based architecture. | 2013-07-18 |
20130185266 | LOCATION INDEPENDENT FILES - Managing data units by converting the data units into data segments and access files describing how to retrieve the data segments using hash values for the data segments. In a data store operation, the data unit is divided into data segments and an access file is generated. The access file includes segmenting scheme information for the data segments, hashing scheme information for the hash values, hash identification information describing the hash values, and location information identifying the locations at which the data segments are available. In a data retrieval operation, data from the data unit is retrieved by accessing the data segments and extracting the data therefrom, where the data segments are retrieved based on the access file for the data unit. | 2013-07-18 |
20130185267 | METHODS AND SYSTEMS FOR COMPRESSING AND COMPARING GENOMIC DATA - Systems and methods are disclosed for compressing and comparing data such as genomic data. The disclosed systems and methods may include selecting a segment, creating a delta representation of the segment, the delta representation comprising a script, and storing the script. Furthermore, the disclosed systems and methods may include receiving a first script comprising a compressed version of a first segment and receiving a second script comprising a compressed version of a second segment. The disclosed systems and methods may further include comparing the first script to the second script and determining if the first segment matches the second segment based upon the comparison of the first script to the second script. | 2013-07-18 |
20130185268 | METHODS OF COMPRESSING AND STORING DATA AND STORAGE DEVICES USING THE METHODS - A method of compressing and storing data may include generating target code words by compressing target data to be stored in a memory device by using an initially set compression algorithm; and/or storing in the memory device the target code words according to a data pattern that is repeated in the target code words. A method of compressing and storing data may include generating target code words by compressing target data to be stored in a memory device by using an initially set compression algorithm; and/or storing in the memory device delta-encoded information obtained by performing delta-encoding on the target code words based on source code words including the data pattern. | 2013-07-18 |
20130185269 | REAL-TIME SELECTION OF COMPRESSION OPERATIONS - Exemplary method, system, and computer program product embodiments for real-time selection of compression operations are provided. In one embodiment, by way of example only, available compression operations are initialized according to an assigned success factor. The available compression operations are tested for determining if at least one of the compression operations yields a compression ratio greater than a minimal compression ratio. The available compression operations selected in real time for compressing at least one of the data blocks is applied. Additional system and computer program product embodiments are disclosed and provide related advantages. | 2013-07-18 |
20130185270 | LOCK ACCELERATION - A method for locking resources, including: receiving, by an accelerator, a first request from a first client to lock a first resource; evaluating, by a computer processor of a server, a hash function using an identifier of the first resource as an input to the hash function; identifying, by the computer processor and based on evaluating the hash function, a first hash bucket in a shared memory residing in a physical memory of the server; detecting that the first hash bucket is occupied; and sending the first request to a master lock monitor residing in a user space of the server based at least on detecting that the first hash bucket is occupied. | 2013-07-18 |
20130185271 | OPTIMIZED B-TREE - The present technology includes an optimized b-tree. To improve concurrent access, a read lock can be applied to traversed nodes of a b-tree in a lock coupling. A read locked node can be promoted to a write locked node upon a determination that the node is likely to be modified, wherein the locked node first restricts access to further functions and then applies a write lock to the node when all existing functions accessing the node end. If one of the other functions attempts to promote the later function can be canceled and removed from the tree. A node can be promoted if the node is likely to be modified when considering multiple factors such as type of function, whether it is a leaf node, the number of keys in the node, or the number of keys in a child node. | 2013-07-18 |
20130185272 | GRAPHICAL SEARCH ENGINE - An Internet search engine with associated user interface is provided to facilitate use, particularly on devices with limited display size. Each search result is displayed using a graphical image associated with the result, and optionally associated text. Each result may be displayed using a significant portion of the total display area available. The amount of display area used to display a search result may vary depending upon the availability of significant images or relative importance of a search result to the underlying query. | 2013-07-18 |
20130185273 | MAP-BASED ITEM INFORMATION NETWORK - A method for following information about an item is disclosed. The method can include selecting an item; setting parameters for the item; setting location preferences for the item; setting notification preferences for the item; and setting communication preferences for the item. The item can be selected by searching a network using a map-based search interface, and information can be received through the network by at least one of notifications or messages based on at least one of the item parameters, the location preferences, the notification preferences, or the communication preferences. | 2013-07-18 |
20130185274 | SEARCH ENGINE OPTIMIZATION PERFORMANCE VALUATION - A way to promote a web site is via search engine optimization (SEO). Traditionally, SEO practitioners have charged a fixed fee for performing SEO services. An analyzer can determine a first probability that a search query for a campaign term will result in a referral from a search engine, determine second probabilities that are associated with a plurality of particular positions in a search engine results page, combine the search query volume information, the first probability, and the second probability for the position with a monetary value to generate an organic price, combine the organic prices for the plurality of positions to value the SEO services for the campaign term. The analyzer evaluates the effectiveness of SEO activities and can generate a volume-based value for SEO services. In addition, disclosed techniques can also be used to identify candidate terms for future SEO activities. | 2013-07-18 |
20130185275 | METHODS AND SYSTEMS FOR SEARCHING ENTRIES IN SMART DEVICES - Systems and methods for allowing a smart device user to perform searches for contacts stored on the contacts directory of the smart device on the basis of parameters other than first name, last name or company name. Such parameters may include, for example, an email address, a telephone number, an area code, a nickname, an address, a zip code, another identifier, or any combination of the above. The user may be able to find specific contacts on the basis of identifiers other than first name, last name and/or company name such as an email address, a telephone number, an area code, a nickname, an address, a zip code, another identifier, or any combination of the above parameters. | 2013-07-18 |
20130185276 | System for Search and Customized Information Updating of New Patents and Research, and Evaluation of New Research Projects' and Current Patents' Potential - The embodiments herein relate to intellectual property management and, more particularly, to a tool for searching and evaluating relative commercial potential of an invention. A user may select any of the services such as search, draft, innovation evaluation, commercial potential evaluation and so on. A search tool automatically generates a key string based on user inputs, searches in associated databases, organizes search results and delivers to the user. The keywords are improved or modified automatically by the search tool so as to improve subsequent search results. The keywords are improved by considering parameters such as field of search, search history of the user and so on. Further, new keywords are added to a dictionary so as to improve search strings each time. Drafting tools may be used to draft patent applications in specific format. Further, a research commercialization evaluator is used to analyze commercial potential of an invention. | 2013-07-18 |
20130185277 | ECOSYSTEM FOR MANUALLY MARKED SEARCHABLE FEEDS ON PUBLISHER SITES - Techniques for generating and publishing searchable feeds for websites are provided. An indication is received of content of interest of a selected website. The selected website is crawled to retrieve a plurality of pages. The retrieved pages are processed according to the indicated content of interest to generate structured content. The structured content is indexed to generate an index. A query interface is provided that receives queries directed to the index, applies the received queries to the index, and transmits responses to the received queries. | 2013-07-18 |
20130185278 | QUERY OPTIMIZATION IN A PARALLEL COMPUTER SYSTEM TO REDUCE NETWORK TRAFFIC - A database query optimizer optimizes a query that uses multiple networks. The query optimizer optimizes a query to reduce network traffic on a network or node that is overloaded or above an established parameter in a node/network attribute table. The query optimization to reduce network traffic may result in a sub-optimal query in other respects such as execution time. The result is a query optimizer that rewrites or optimizes a query to execute on multiple nodes or networks to reduce traffic on a network or node according to the loading characteristics and assigned attributes of a node or network. | 2013-07-18 |
20130185279 | QUERY OPTIMIZATION IN A PARALLEL COMPUTER SYSTEM WITH MULTIPLE NETWORKS - A database query optimizer optimizes a query that uses multiple networks. The database query optimizer optimizes a query that uses multiple networks to satisfy the query by splitting the query execution to use multiple networks. Thus, the query optimizer rewrites or optimizes a query to execute on multiple nodes or networks to more efficiently execute the query and reduce network traffic on a network. The query optimizer uses plan cache statistics to determine whether to use multiple networks to optimize the query. | 2013-07-18 |
20130185280 | MULTI-JOIN DATABASE QUERY - A method includes performing a query of a database. The query includes joining a first Domain-Model-sub-class table with a Domain-Model table based on identity attributes present in both the first Domain-Model-sub-class table and Domain-Model table to produce a first joined table. The query further includes joining the first joined table with an access control list (ACL) entry table based on an ACL object identity attribute present in both the first joined table and the ACL entry table to produce a second joined table. The query also includes joining the second joined table with a second Domain-Model-sub-class table based on an ACL security identity present in both the second joined table and the second Domain-Model-sub-class table to produce a third joined table. | 2013-07-18 |
20130185281 | FLEXIBLE DATABASE AND ITERATIVE SPATIAL SEARCH PROCESS - A flexible database and iterative spatial search process is described. In an embodiment, a flexible database server is described which takes input queries in the form of XML strings describing a search specification and parses them using a stored procedure. Searching is performed by generating a temporary table for each term in the search specification and then comparing the temporary tables to pre-existing tables within the database to identify datasets that meet the search specification. An application is also described which generates the XML string in response to user input and which displays the results to a user. The application provides a user interface which enables users to select attributes of results, such as the spatial data associated with a dataset, to include in a second search specification and to trigger this new search. | 2013-07-18 |
20130185282 | CLIENT AND DATABASE PROBLEM DETERMINATION AND MONITORING - Provided are techniques for collecting client information for client applications running on a client computer, wherein the client information includes a client application identifier for each client application that issues queries to a database along with text of each of the queries that the client application issues; collecting database monitoring information that includes text of each query issued against the database and performance information for each query; combining the client information and the database monitoring information based on the text of the queries to obtain combined information that provides the client application identifier and the performance information for each of the queries; and identifying a problem query and at least one client application that has issued the problem query using the combined information. | 2013-07-18 |
20130185283 | QUERY OPTIMIZATION IN A PARALLEL COMPUTER SYSTEM WITH MULTIPLE NETWORKS - A database query optimizer optimizes a query that uses multiple networks. The database query optimizer optimizes a query that uses multiple networks to satisfy the query by splitting the query execution to use multiple networks. Thus, the query optimizer rewrites or optimizes a query to execute on multiple nodes or networks to more efficiently execute the query and reduce network traffic on a network. The query optimizer uses plan cache statistics to determine whether to use multiple networks to optimize the query. | 2013-07-18 |
20130185284 | GROUPING SEARCH RESULTS INTO A PROFILE PAGE - Methods are disclosed for grouping search results into a profile page. A search engine accepts a user search string and generates a first set of results. In response to the first set of results, a query generator generates queries corresponding to a number of entities sharing a common name. The search engine executes the queries, returning responsive data sets. An entity resolver merges the data sets to ensure that each unique entity is represented by a single data set. A threshold may be defined such that results meeting a certain level of similarity are merged. A profile generator creates a profile page for each unique entity using biographical data contained in the respective data sets, and generates a results page containing links to each unique profile. The results page is then sent to the user for display on a graphical user interface. | 2013-07-18 |
20130185285 | METHOD AND APPARATUS FOR MULTIPLE PERSONALITY SUPPORT AND DYNAMIC PERSONALITY SELECTION - Apparatus and methods establish and maintain a plurality of profiles defining different personalities in association with a single user account. Further, apparatus and methods described herein enable a group communication session including receiving a request from an originator to initiate a group communication session, where the request identifies a plurality of participants. Further, these aspects include selecting an originator profile from a plurality of different established originator profiles to be displayed to each of the plurality of participants, where each of the plurality of different established originator profiles is associated with a single user account. Further, in these aspects, a first selected originator profile to be displayed to a first one of the plurality of participants differs from a second selected originator profile to be displayed to a second one of the plurality of participants. | 2013-07-18 |
20130185286 | SEARCHING FOR ASSOCIATED EVENTS IN LOG DATA - To retrieve a sequence of associated events in log data, a request expression is parsed to retrieve types of dependencies between events which are searched, and the constraints (e.g., keywords) which characterize each event. Based on the parsing results, query components can be formed, expressing the constraints for individual events and interrelations (e.g., time spans) between events. A resultant span query comprising the query components can then be run against an index of events, which encodes a mutual location of associated events in storage. | 2013-07-18 |
20130185287 | USER INTERFACES FOR A DOCUMENT SEARCH ENGINE - A method includes receiving a search query, identifying a document based on the search query, and providing a search result based on the document. The search result includes, for example, an image associated with the document, an excerpt from the document that is associated with the search query, and links to other excerpts in the document that are associated with the search query. The method may also include providing other information associated with the document. | 2013-07-18 |
20130185288 | PRODUCT SEARCH DEVICE, PRODUCT SEARCH METHOD, AND COMPUTER PROGRAM PRODUCT - According to an embodiment, a product search device includes an obtaining unit, a determiner, a first controller, a reception unit, a retrieval unit, and a second controller. The obtaining unit obtains a first image including plural items. The determiner determines to which group each of the items in the obtained first image belongs among plural groups into which products related to the items are categorized in accordance with a predetermined categorization condition. The first controller displays the group to which each of the items belongs on a display unit. The reception unit receives a user input specifying at least one of the groups displayed on the display unit. The retrieval unit searches a storage unit storing the groups and second images of the products in an association manner, and extracts the second image corresponding to the specified group. The second controller displays the extracted second image on the display unit. | 2013-07-18 |
20130185289 | POPULARITY OF CONTENT ITEMS - Search results may be yielded based on a search query. A search query inspired by a user may be received. Based on the search query, multiple search results each including links may be determined. The multiple search results may include a first search result that includes a link to a first digital instance that describes or embodies a first content item, and a second search result that includes a link to a second digital instance that describes or embodies a second content item. A perceived popularity may be assessed for each of the first and second content items. The perceived popularity may be a measure of the popularity of the first and second content items, and may be distinct from a popularity of the first and second digital instances. A presentation of the multiple search results may be determined based on the accessed perceived popularity. | 2013-07-18 |
20130185290 | METHOD AND APPARATUS FOR SEARCHING MESSAGE DATA IN A PORTABLE ELECTRONIC DEVICE - A method and apparatus for searching message data in a portable electronic device are provided. A threaded message inbox is provided at a display of the device, the message data grouped as threads. Search criteria are received and a search of an index of the threaded message inbox is initiated using the search criteria, the index comprising key words extracted from the message data. Additional message data is received while the search is being performed, the additional message data belonging to a given thread. Additional message data is searched in addition to the index. Search results are generated based on whether at least one of data from additional message data and data from the index meets the search criteria. Search results are provided in threads at the display. Search results are automatically updated in response to receiving additional message data when the additional message data meets the search criteria. | 2013-07-18 |
20130185291 | ONLINE RATING AND FEEDBACK SYSTEM - The present invention provides, in at least one embodiment, a system and method to improve the rating process by asking for feedback through a simple tag interface, which allows a user to rate content. The tag interface has an overall rating and at least one tag to be rated by the user. The user's rating of the tag helps classify the content for other users and the system forming a link between the user's overall rating and tag rating indicates the user's tastes. By systematically asking the users to evaluate a small subset of qualities in the form of tags, as opposed to asking each user to evaluate a large amount of tags, the system pieces together a large understanding of the content in a way that is very simple for the users. | 2013-07-18 |
20130185292 | APPLICATION RECOMMENDATION SYSTEM - Systems and method for receiving mobile device usage data from mobile electronic devices using security applications with enhanced access privileges. The mobile device usage data includes user-specific and application usage data. Application classification databases are searched for application characteristics of applications available for download from multiple marketplaces. Using the application characteristics, a weighted application relationship graph that includes relationship scores for application pairs that describe the degree to which applications in each of the application pairs are related to, is generated. Based on the mobile device usage and the relationship scores, a list of recommended applications can be generated for a particular user. The list of recommended applications includes the applications determined to be associated with at least one of the applications installed on the user's mobile device with a relationship score greater than a threshold. The method then sends the list of recommended applications to the user's mobile device. | 2013-07-18 |
20130185293 | SYSTEM FOR FORENSIC ANALYSIS OF SEARCH TERMS - A “data breach” or loss of sensitive data can cause an organization to lose revenues or suffer other damages. Analyzing data to locate a breach and to identify its source, however, is difficult because the data can come from many sources in an unstructured format and, typically, there is a large amount of data to analyze. A forensic analysis system, according to one embodiment, collects unstructured data from disparate sources, like the Internet, and peer-to-per filesharing and social media networks, and generates structured representations of the data, called virtual profiles. The system forms relationships among the virtual profiles. The system uses the virtual profiles and relationships to reduce the amount of information to be analyzed while including additional information that is related for analysis. By analyzing a smaller amount of related information, a cyber forensic analyst is better able to identify a data breach or other suspicious or illegal activity. | 2013-07-18 |
20130185294 | RECOMMENDER SYSTEM, RECOMMENDATION METHOD, AND PROGRAM - A recommender system includes: an input section | 2013-07-18 |
20130185295 | INFORMATION PROVISIONING DEVICE, INFORMATION PROVISIONING METHOD, PROGRAM, AND INFORMATION RECORDING MEDIUM - An information provisioning device ( | 2013-07-18 |
20130185296 | PROCESSES AND SYSTEM FOR ACCESSING EXTERNALLY STORED METADATA ASSOCIATED WITH A MEDIA ASSET USING A UNIQUE IDENTIFIER INCORPORATED INTO THE ASSET ITSELF - An enhanced metadata structure and associated process is provided which captures and stores metadata gathered about the source and usage of a media asset or file. The source and usage metadata is integrated, such as by encoding within the enhanced media file, as the media asset is transferred and used. The integrated metadata accumulates, as a trail of source information and usage information in the enhanced media asset, and can be extracted upon arrival at a target computer system. | 2013-07-18 |
20130185297 | PROCESSES AND SYSTEM FOR ACCESSING EXTERNALLY STORED METADATA ASSOCIATED WITH A MEDIA ASSET USING A UNIQUE IDENTIFIER INCORPORATED INTO THE ASSET ITSELF - An enhanced metadata structure and associated process is provided which captures and stores metadata gathered about the source and usage of a media asset or file. The source and usage metadata is integrated, such as by encoding within the enhanced media file, as the media asset is transferred and used. The integrated metadata accumulates, as a trail of source information and usage information in the enhanced media asset, and can be extracted upon arrival at a target computer system. | 2013-07-18 |
20130185298 | PROCESSES AND SYSTEM FOR ACCESSING EXTERNALLY STORED METADATA ASSOCIATED WITH A MEDIA ASSET USING A UNIQUE IDENTIFIER INCORPORATED INTO THE ASSET ITSELF - An enhanced metadata structure and associated process is provided which captures and stores metadata gathered about the source and usage of a media asset or file. The source and usage metadata is integrated, such as by encoding within the enhanced media file, as the media asset is transferred and used. The integrated metadata accumulates, as a trail of source information and usage information in the enhanced media asset, and can be extracted upon arrival at a target computer system. | 2013-07-18 |
20130185299 | METHOD AND SYSTEM FOR PERFORMING SYSTEM MAINTENANCE IN A COMPUTING DEVICE - The present disclosure provides a computer-implemented method of performing system maintenance in a computing device. The method includes launching a maintenance application in a pre-operating system environment of a computing device ( | 2013-07-18 |
20130185300 | DIVIDING DEVICE, DIVIDING METHOD, AND RECORDING MEDIUM - A dividing device includes: a memory configured to store a program including a procedure; and a processor configured to execute the program, the procedure including: extracting correlation information from source code of software, the information correlating relationships between an originating entity of the relationship and a receiving entity of the relationship, which are identified by dependent relationships of a group of entities, which is the group of elements that structure the software, and dividing the group of entities into clusters, so as to be include in the cluster a lot of the dependent relationship which a weight related to the dependent relationships is large, based on the weight related to the dependent relationships identified by the correlation information extracted by the extracting. | 2013-07-18 |
20130185301 | INSERTING DATA INTO AN IN-MEMORY DISTRIBUTED NODAL DATABASE - A database loader loads data to an in-memory database across multiple nodes in a parallel computing system. The database loader uses SQL flags, historical information gained from monitoring prior query execution times and patterns, and node and network configuration to determine how to effectively cluster data attributes across multiple nodes. The database loader may also allow a system administrator to force placement of database structures in particular nodes. | 2013-07-18 |
20130185302 | INSERTING DATA INTO AN IN-MEMORY DISTRIBUTED NODAL DATABASE - A database loader loads data to an in-memory database across multiple nodes in a parallel computing system. The database loader uses SQL flags, historical information gained from monitoring prior query execution times and patterns, and node and network configuration to determine how to effectively cluster data attributes across multiple nodes. The database loader may also allow a system administrator to force placement of database structures in particular nodes. | 2013-07-18 |
20130185303 | CONCEPTUAL WORLD REPRESENTATION NATURAL LANGUAGE UNDERSTANDING SYSTEM AND METHOD - A Natural Language Understanding system is provided for indexing of free text documents. The system according to the invention utilizes typographical and functional segmentation of text to identify those portions of free text that carry meaning. The system then uses words and multi-word terms and phrases identified in the free to text to identify concepts in the free text. The system uses a lexicon of terms linked to a formal ontology that is independent of a specific language to extract concepts from the free text based on the words and multi-word terms in the free text. The formal ontology contains both language independent domain knowledge concepts and language dependent linguistic concepts that govern the relationships between concepts and contain the rules about how language works. The system according to the current invention may preferably be used to index medical documents and assign codes from independent coding systems, such as, SNOMED, ICD-9 and ICD-10. The system according to the current invention may also preferably make use of syntactic parsing to improve the efficiency of the method. | 2013-07-18 |
20130185304 | RULE-DRIVEN RUNTIME CUSTOMIZATION OF KEYWORD SEARCH ENGINES - Described herein are methods, systems, apparatuses and products for rule-driven runtime customization of keyword search engines. An aspect provides a method for rule-driven customization of keyword searches, including: receiving by a computer an input keyword query; determining from the input keyword query and a dataset to be queried at least one rule selected from the group consisting of: a re-write rule; a category ranking rule, and a category grouping rule; and applying the at least one rule to generate search results based on domain knowledge of the dataset. Other embodiments are disclosed. | 2013-07-18 |
20130185305 | KEYWORD ASSIGNMENT APPARATUS AND RECORDING MEDIUM - A keyword assignment apparatus includes a feature value extraction unit, a classification unit, a classification frequency measurement unit, and a keyword assignment unit. The feature value extraction unit is configured to extract a feature value vector, which consists of feature values, from an input image. The classification unit is configured to perform classification to the feature value vector extracted by the feature value extraction unit. The classification frequency measurement unit is configured to measure a frequency of the classification classified by the classification unit. The keyword assignment unit is configured to assign keywords to the input image based on the classification classified by the classification unit and the frequency measured by the classification frequency measurement unit. | 2013-07-18 |
20130185306 | Entity Matching Using Machine Learning - Techniques for information retrieval include receiving a plurality of data records, each data record including data fields associated with a business enterprise, the data fields including a name of the business enterprise; updating a plurality of database records associated with the received plurality of data records stored in a database, each database record including attributes including the name of the business enterprise and an alias associated with the name of the business enterprise; receiving a query for a particular database record, the query including at least one of the name of the business enterprise or the alias associated with the name of the business enterprise; and preparing for display, in response to the query, one or more of the database records based on at least one of the name of the business enterprise or the alias associated with the name of the business enterprise. | 2013-07-18 |
20130185307 | METHODS AND SYSTEMS OF SUPERVISED LEARNING OF SEMANTIC RELATEDNESS - A method of evaluating a semantic relatedness of terms. The method comprises providing a plurality of text segments, calculating, using a processor, a plurality of weights each for another of the plurality of text segments, calculating a prevalence of a co-appearance of each of a plurality of pairs of terms in the plurality of text segments, and evaluating a semantic relatedness between members of each the pair according to a combination of a respective the prevalence and a weight of each of the plurality of text segments wherein a co-appearance of the pair occurs. | 2013-07-18 |
20130185308 | SYSTEM AND METHOD FOR EXTRACTION OF OFF-TOPIC PART FROM CONVERSATION - A system and method extract off-topic parts from a conversation. The system includes a first corpus including documents of a plurality of fields; a second corpus including only documents of a field to which the conversation belongs; a determination means for determination as a lower limit subject word a word for which IDF value for the first corpus and IDF value for the second corpus are each below a first certain threshold value; a score calculation part for calculation as a score a TF-IDF value for each word included in the second corpus; a clipping part, for sequential cutting out of intervals from text data that are contents of the conversation; and an extraction part for extraction as an off-topic part an interval where average value of the score of words included in the clipped interval is larger than a second certain threshold value. | 2013-07-18 |
20130185309 | DATA QUALITY ANALYSIS - The present subject matter relates to systems and methods for determining quality of data. In one implementation, the method comprises identifying at least one column of the data repository based on an importance index associated with the at least one column, wherein the importance index is indicative of the criticality of the data stored in the at least one column; and retrieving at least one data quality analysis rule associated with the at least one column. The method further comprises assigning a rule weightage parameter to each of the at least one data quality analysis rule and a column weightage parameter to each of the identified columns and analyzing the data stored in the identified columns based on the at least one data quality analysis rule. Based in part on the analysis a data quality score, indicative of the quality of data stored in the data repository is computed. | 2013-07-18 |
20130185310 | METHOD AND SYSTEM FOR HUMAN JOINT TREATMENT PLAN AND PERSONALIZED SURGERY PLANNING USING 3-D KINEMATICS, FUSION IMAGING AND SIMULATION - The present document describes a method for producing a knee joint treatment plan and/or surgery plan for a patient, the method comprising: obtaining 3D kinematic data of the knee joint in movement; determining, from the 3D kinematic data, scores characterising the joint function of the patient, the one or more scores being relative to one or more criteria; and comparing the scores to data in a database which characterize a plurality of treatment plans and/or surgery plans to generate the list of one or more treatment plans and/or surgery plans which match the scores. | 2013-07-18 |
20130185311 | EMAIL SUGGESTOR SYSTEM - The email suggestor system and method provide an efficient and effective way to capture a user identifier, such as an email address of a consumer in a retail environment. The email suggestor system generates one or more suggested first text portions based on input data, outputs at least one of the suggested first text portions, and receives a selection of a first text portion. The email suggestor system generates one or more suggested second text portions of a user identifier based on the input data, outputs at least one of the suggested second text portions, and receives a selection of a second text portion. The email suggestor system generates a user identifier including the selected first text portion and the selected second text portion. The email suggestor system uses received feedback response to refine and/or train one or more models with which it generates the suggested text portions. | 2013-07-18 |
20130185312 | 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-07-18 |
20130185313 | 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-07-18 |
20130185314 | GENERATING SCORING FUNCTIONS USING TRANSFER LEARNING - Data sources, such as web pages or databases, store or output entities that include data or other information. To compare entities generated by different data sources, and to identify duplicate entities, a scoring function is generated for each pair of data sources that can generate a similarity score that represents the similarity of two entities from the data sources in the pair. To generate the scoring functions, training data is generated for each pair of data sources and reviewed by a judge. The training data is used to generate the scoring functions using machine learning. In order to reduce the amount of training data that is used, transfer learning techniques are applied to use information learned from generating one scoring function for a pair of sources when generating a scoring function for a subsequent pair of sources. | 2013-07-18 |
20130185315 | Identification of Events of Interest - Example embodiments relate to identification of events of interest from a feed including a plurality of events. Example embodiments may determine an interestingness score for each of a plurality of time intervals, each time interval including one or more events from the feed of events. Example embodiments may then select a time interval or output a visualization of the time interval, where the score of the time interval indicates that the time interval is likely to contain events of interest. | 2013-07-18 |
20130185316 | CONTROLLING ACCESS TO STORED INFORMATION - This document describes, in various implementations, controlling access to information stored in a storage device. The information stored in the storage device is accessed in a desired order without sorting the stored information prior to access. | 2013-07-18 |
20130185317 | PDF ADDRESS EXTRACTOR FOR MAIL - A computer system for extracting address information from PDF documents to create a database of address information that can be used to generate address sheets for mail. It is preferred that the mail be accountable mail requiring feedback on the mailing process. | 2013-07-18 |
20130185318 | DATA PROVIDING APPARATUS, ELECTRONIC APPARATUS, DATA PROCESSING SYSTEM, AND METHOD OF DATA PROCESSING - A data processing system includes an electronic apparatus including a script implementation unit which receives a Web page including a script via a network, and sends a request for obtaining data based on the script to a data providing apparatus which is connected via a network, the request for obtaining data including identification data of target data to obtain, and attribute data of the electronic apparatus; and the data providing apparatus including a conversion unit which converts a data format of target data stored in a data storing unit identified by the identification data included in the request for obtaining data sent from the electronic apparatus to another data format based on the attribute data of the electronic apparatus included in the request for obtaining data, and a sending unit which sends the target data with the other data format to the electronic apparatus. | 2013-07-18 |
20130185319 | COMPRESSION PATTERN MATCHING - Systems and methods are provided for data comparisons in a compression algorithm to optimize the compression of data. An exemplary method includes receiving input data. The method further includes generating a hash table address for the input data. The method further includes obtaining a pointer associated with the hash table address. The method further includes reading a data library with the pointer to obtain an associated piece of historical data. The method further includes comparing the historical data to the input data to determine a match. | 2013-07-18 |
20130185320 | DISPLAY PROGRAM, DISPLAY APPARATUS, INFORMATION PROCESSING METHOD, RECORDING MEDIUM, AND INFORMATION PROCESSING APPARATUS - A character string which is set in advance is stored (S | 2013-07-18 |
20130185321 | APPARATUS AND METHOD FOR SCHEDULING USER DEFINED OPERATOR (UDO) IN DATA STREAM MANAGEMENT SYSTEM (DSMS) - An apparatus and a method of optimizing queries through scheduling User Defined Operators (UDOs) in a Data Stream Management System (DSMS), are provided. The apparatus includes a query optimizer configured to receive queries, each of the queries including the UDOs and data streams subject to respective operations of the UDOs, and group the data streams and UDOs into scheduling units, each of the scheduling units including one of the data streams and one of the UDOs. The apparatus further includes a scheduler configured to schedule an execution order in which the scheduling units are executed. | 2013-07-18 |
20130185322 | SYSTEMS AND METHODS FOR PROVIDING AN ELECTRONIC CONTACT CARD - Systems and methods for providing an electronic contact card are shown, and specifically, systems and methods for providing an electronic contact card in a format compatible with electronic contact books associated with computing devices. | 2013-07-18 |
20130185323 | SOCIAL NETWORK SERVICE - A computer-based system for the implementation of a social network service is provided. The system includes a user information database, a groups database and an interests database. A referral generator analyses information stored within the databases to identify common interests between users and/or groups, and prompt users with suggested associations. Interests may be regional in nature, facilitating in-person communications in addition to communications via the social network service. | 2013-07-18 |
20130185324 | LOCATION-TYPE TAGGING USING COLLECTED TRAVELER DATA - A method and system are disclosed for automatically tagging locations using collected traveler information. Traveler information, including a time/date stamp and a unique identification associated with the traveler are collected and stored in a database with locations corresponding to transportation stops. A location query, which includes a location type, an analysis period, optionally, an analysis approach, and a user selected threshold are received and a number of time/location stamps for each location is determined based upon an interval associated with the selected type. The maximum number of time/location stamps for that location is determined, and using the selected threshold, a minimum number of stamps required to designate a location as the selected type is determined. When the number of time/location stamps within the time interval for the selected type is greater than or equal to the minimum number calculated, the location is tagged as the selected location type. | 2013-07-18 |
20130185325 | METHODS AND APPARATUS FOR PROVIDING CONTENT BASED ON SOCIAL NETWORKS - Methods and apparatus for providing content based on social networks are provided. In particular, a user's social relationships or activities on a social network may be utilized to determine content such as products and/or items of interest to present to the user. | 2013-07-18 |
20130185326 | NAME SEARCH USING MULTIPLE BITMAP DISTRIBUTIONS - Provided are a computer implemented method, computer program product, and system for matching names. For a first bitmap distribution, it is determined whether a first bitmap signature of a query name and a second bitmap signature of a target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a first preliminary value. For a second bitmap distribution that is different from the first bitmap distribution, it is determined whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a second preliminary value. The first preliminary value and the second preliminary value are combined, and, if the combination results in a value of true, it is determined that the query name and the target name are to be further processed. | 2013-07-18 |