| 23rd week of 2013 patent applcation highlights part 56 |
| Patent application number | Title | Published |
|---|
| 20130144797 | Method And Apparatus For Recycling Electronic Devices - A recycling kiosk for recycling and financial remuneration for submission of an electronic device is disclosed herein. The recycling kiosk includes an inspection area with preferably two mirrored, domed hemispheres positioned about a transparent table and cameras for imaging an electronic device placed on the table. The recycling kiosk uses visual analysis to identify electronic devices, determine the condition of the electronic device and determine if the electronic device is authentic. | 2013-06-06 |
| 20130144798 | METHOD AND APPARATUS FOR VALUING PROPERTY - A method and apparatus for valuing every property in a predetermined geographic region at regular intervals and storing those valuations for ready access later in a layered data stratum, using customary sources of property valuation data to create a new layers of the data stratum and using the data stored in the one or more layers of the data stratum for the creation of tables, spreadsheets and maps for evaluations of changes and trends in property valuation. | 2013-06-06 |
| 20130144799 | COMPUTING DEVICE AND METHOD FOR EXTRACTING PATENT REJECTION INFORMATION - A computing device extracts claims, patent law clauses, and prior art documents from an Office action document according to preset regular expressions, and stores the extracted claims, patent law clauses, and prior art documents in an array stored in a storage unit of the computing device. The computing device identifies rejected claims of the Office action document from the extracted claims, and searches involved patent law clauses and prior art documents regarding the rejected claims in the Office action document. The computing device records each identified rejected claim with involved patent law clauses and prior art documents in the storage unit, according to importance ratings of the rejected claims and the relationships. | 2013-06-06 |
| 20130144800 | Identifying Recommended Merchants - Merchants are classified according to their reliability in shipping products when promised and ability to resolve complaints. A merchant trustworthiness evaluator (MTE) automatically gathers data from users about purchases online from a merchant, including an order identifier and an estimated ship date. In one embodiment, the MTE collects data from customers about their purchases through the use of a conversion pixel, transmitted to the customer by the merchant at the time of purchase. The MTE obtains shipment information from the merchant or shipment carrier once an order has been shipped. The MTE correlates the shipment data with the order data and compares for each order the estimated or promised and actual shipment dates. The MTE scores merchants and classifies each merchant based on its score. Merchant classifications can then be provided to prospective customers. | 2013-06-06 |
| 20130144801 | SYSTEM AND METHOD FOR IMPROVING THE EFFECTIVENESS OF SALES EFFORTS - Disclosed embodiments describe a system and method for improving the effectiveness and efficiency of tracking and managing a canvassing sales force. The method provides a portal to: assign locations and territories; track the travel of sales people; input the disposition of a location; display the disposition (as well as other user identified data) of a location on a user-retrievable map; and edit the disposition and other location specific data for a location by a plurality of users. Team leaders may then assess the effectiveness of sales efforts and make more effective decisions regarding territory assignments (whether team wide or individual) and whether further canvassing is necessary. | 2013-06-06 |
| 20130144802 | PERSONALIZING AGGREGATED ONLINE REVIEWS - A method for processing reviews includes identifying reviews that match a request criterion in a request from a user; filtering the identified reviews using preferences and characteristics of the user; and outputting a compilation of only those reviews filtered according to preference and characteristics of the user. | 2013-06-06 |
| 20130144803 | Method and System for Generating One Flow Models from Runtime Service Delivery Process - A method and system for generating new abstractions for existing process models and modifying existing process models in order to generate new process models by mining run-time service delivery processes. The method and system also “learns” new abstractions for business process models by modifying existing models. The method and system generates new business process models utilizing an online learning mechanism that mines run-time service delivery processes. | 2013-06-06 |
| 20130144804 | Income Product Selector - A first income need is determined to meet essential expenses for a user during retirement, and a second income need is determined to meet discretionary expenses for the user during retirement. A default target income mix is calculated to meet the first income need and the second income need. The default target income mix is a set of weights of one or more classes of income generating products. Qualitative investment preferences are quantified for the user. The default target income mix is adjusted using the quantification of the qualitative investment preferences to form an adjusted target income mix including a second set of weights of the one or more classes of income generating products. | 2013-06-06 |
| 20130144805 | GEOSPATIAL DATA BASED MEASUREMENT OF RISK ASSOCIATED WITH A VEHICULAR SECURITY INTEREST IN A VEHICULAR LOAN PORTFOLIO - A method of geospatial data based assessment of a vehicular security interest in a vehicular loan portfolio is disclosed. The method may involve permitting a party having a vehicular security interest and/or a party interested in acquiring the vehicular security interest and/or a vehicular loan portfolio access to dynamically determined vehicle location and pattern of usage information associable with the vehicle through a geospatial positioning device within the vehicle. A risk scoring methodology may be developed that may contribute to the assessment of the financial value of the vehicular security interest and/or the vehicular loan portfolio when there is a match between an event and the location and pattern of usage information associable with the vehicle. Subsequently, a risk score associated with the vehicular security interest and/or the vehicular loan portfolio based on the risk scoring methodology may be generated. | 2013-06-06 |
| 20130144806 | SYSTEM AND METHOD USING ASSET SALE AND LOAN FOR RISK TRANSFERENCE - Disclosed herein is a system and method for eliminating or transferring the non-economic risk of financial securities. The system and method serves to avoid non-economic losses in the first instance, and to counter the adverse capital impact of prior non-economic gap losses by providing capital relief consistent with a determined protected amount. A client makes a non-recourse loan to a provider. In return, the provider agrees to purchase a fixed income security (FIS) Portfolio from the client for an purchase price greater than the amount of the loan. If the aggregate principal payments (APP) of the FIS Portfolio exceed the purchase price, the parties engage in profit sharing of the APP over the purchase price. If the final market value of the FIS Portfolio is below the purchase price and above the loan amount, the losses are absorbed by the provider. In a broader implementation of the program, the client makes a revolving term loan to the provider, which over time the provider uses to acquire assets from the client to be used as collateral for the loan. | 2013-06-06 |
| 20130144807 | COMPUTERIZED SYSTEM AND METHOD FOR A STRUCTURED FINANCIAL PRODUCT - A computerized method and system is disclosed for creating custom structured financial products as well as standardized exchange traded structured financial products. The structured financial products include a fixed fund component and a derivative component. The fixed fund component is linked to an underlying asset. In addition, the risk profile of the derivative component is matched to the investor selected risk profile of the fixed fund component in order to provide the investor with a selectable level of risk. | 2013-06-06 |
| 20130144808 | IN-KIND DISTRIBUTION PROCESS FOR POOLED STABLE VALUE TRUST FUNDS - A highly efficient method is created for making an in-kind distribution of a defined contribution plan's beneficial interest in the investment assets of a pooled stable value fund, including, but not limited to a stable value collective trust fund. This is done by creating a sub-account within the insurer's, or other wrap provider's, separate account and allocating a pro rata share of the fund's investment assets to the sub account. The sub account is then wrapped by a pre-agreed version of the wrap provider's guarantee contract it would issue directly to a plan. Satisfying a plan withdrawal request in this manner would, among other things, mitigate the wrap provider's risk by eliminating the need to make a cash book value payments after a brief notice or “put” period. | 2013-06-06 |
| 20130144809 | IMMEDIATE LICENSE FOR MEDIA FILE - One example embodiment includes a method of licensing a media file. The method includes allowing a licensee to select a media file. The method also includes producing a licensing agreement. The method further includes granting the licensee access to the media file. | 2013-06-06 |
| 20130144810 | COMPUTER SYSTEM FOR DISTRIBUTING A VALIDATION INSTRUCTION MESSAGE - A computer-implemented system for providing validation instructions to European attorneys. The computer system is designed to send a validation instruction message to a number of European attorneys, asking them to validate a granted European patent. The computer system is designed to communicate with an interface, a specification database and a number of European agents. The system is set up so that when the computer system receives a European patent identifier and a country selection via the interface, the computer system: (a) obtains, from the specification database, a European patent specification corresponding to the European patent identifier; and (b) provides the European patent specification and a validation instruction message to a particular European agent corresponding to the country selection. The system is further adapted to calculate and bill the total validation cost up-front. | 2013-06-06 |
| 20130144811 | SYSTEM AND METHOD FOR COMPUTING A VARIABLE FUEL PRICE BASED ON EXHAUST GAS EMISSIONS OF A VEHICLE - The present invention provides a system and method of computing a variable fuel price based on exhaust gas emission of a vehicle. In one embodiment, a system includes an onboard unit fitted in a vehicle for measuring amount of exhaust gas emissions by the vehicle and a remote server communicatively connected to the onboard unit for computing a discount or surcharge on a base fuel price based on the amount of exhaust gas emissions by the vehicle. The system also includes a fuel station communicatively coupled to the remote server for filling fuel in a fuel tank of the vehicle at the discounted or surcharge fuel price. | 2013-06-06 |
| 20130144812 | PROBABILISTIC MODEL APPROXIMATION FOR STATISTICAL RELATIONAL LEARNING - Various technologies described herein pertain to approximating an inputted probabilistic model for statistical relational learning. An initial approximation of formulae included in an inputted probabilistic model can be formed, where the initial approximation of the formulae omits axioms included in the inputted probabilistic model. Further, an approximated probabilistic model of the inputted probabilistic model can be constructed, where the approximated probabilistic model includes the initial approximation of the formulae. Moreover, the approximated probabilistic model and evidence can be fed to a relational learning engine, and a most probable explanation (MPE) world can be received from the relational learning engine. The evidence can comprise existing valuations of a subset of relations included in the inputted probabilistic model. The MPE world can include valuations for the relations included in the inputted probabilistic model. The MPE world can be outputted when the input probabilistic model lacks an axiom violated by the MPE world. | 2013-06-06 |
| 20130144813 | Analyzing Data Sets with the Help of Inexpert Humans to Find Patterns - A combined computer/human approach is used to detect actionable insights in large data sets. Automated computer analysis used to identify patterns (e.g., possibly meaningful patterns or subsets within the data). These are presented to humans for feedback, where the humans may have little to no training in the statistical methods used to detect actionable insights. Feedback from the humans is used to improve the pattern detection and facilitate the detection of actionable insights. | 2013-06-06 |
| 20130144814 | CONDITIONAL PROBABILITY OPERATOR FOR EVENT PROCESSING SYSTEMS - An event processing system in which a computer receives an input event comprising one or more factors. The computer evaluates the factors of the input event based on an event processing rule containing a pattern detection operator and a conditional probability operator. The conditional probability operator can operate to calculate a conditional probability for a set of training data that a specified pattern will appear in the factors of an input event given a specified output event, and can further operate to assign a conditional rule value a binary value based on how the conditional probability compares to a target probability. | 2013-06-06 |
| 20130144815 | MAKING PREDICTIONS REGARDING EVALUATION OF FUNCTIONS FOR A DATABASE ENVIRONMENT - A prediction regarding one or more functions can be made for a database environment. In particular, a predication can be made with respect to values stored in at least one column of at least one table in a database, based on the evaluation of one or more functions for a subset of possible column values (i.e., resultant values derived from the evaluation of a subset of possible column values) without the need to calculate the function(s) for all of the actual entries in the column of the table(s). In effect, a functional predicate can be transformed (or translated) to a predicate that is dependent on the column values instead of the evaluation of one or more functions for the column values. | 2013-06-06 |
| 20130144816 | HEALTH CARE INCIDENT PREDICTION - Embodiments described herein relate to apparatuses and methods for incident prediction alerts for transmission to a health care organization system by applying rules to data sets. Each rule may define a set of data elements linked to an incident, and a processor may detect one or more sets of data elements in the data sets. The processor may normalize the data feeds, generate rules on historical data, generate prediction alerts by applying rules to near-real time data feeds, train to update rules, validate and error check rules, remove statistical noise, generate visualizations for the data feeds, and receive input and feedback data. | 2013-06-06 |
| 20130144817 | Parallel training of a Support Vector Machine (SVM) with distributed block minimization - A method to solve large scale linear SVM that is efficient in terms of computation, data storage and communication requirements. The approach works efficiently over very large datasets, and it does not require any master node to keep any examples in its memory. The algorithm assumes that the dataset is partitioned over several nodes on a cluster, and it performs “distributed block minimization” to achieve the desired results. Using the described approach, the communication complexity of the algorithm is independent of the number of training examples. | 2013-06-06 |
| 20130144818 | NETWORK INFORMATION METHODS DEVICES AND SYSTEMS - Methods and systems for predicting links in a network, such as a social network, are disclosed. The existing network structure can be used to optimize link prediction. The methods and systems can learn a distance metric and/or a degree preference function that are structure preserving to predict links for new/existing nodes based on node properties. | 2013-06-06 |
| 20130144819 | SCORE NORMALIZATION - Methods, systems, and apparatus, including computer programs encoded on computer storage media, for score normalization. One of the methods includes receiving initial training data, the initial training data comprising initial training records, each initial training record identifying input data as input and a category as output. The method includes generating a first trained predictive model using the initial training data and a training function. The method includes generating intermediate training records by inputting input data of the initial training records to a second trained predictive model, the second trained predictive model generated using the training function, each intermediate training record having a score. The method also includes generating a score normalization model using a score normalization training function and the intermediate training records. | 2013-06-06 |
| 20130144820 | METHOD OF LEARNING A CONTEXT OF A SEGMENT OF TEXT, AND ASSOCIATED HANDHELD ELECTRONIC DEVICE - An improved method of learning a context of a segment of text input enables facilitated text input on an improved handheld electronic device. In response to a series of inputs, segments and other objects are analyzed to generate a proposed character interpretation of the series of inputs. Responsive to detecting a replacement of a segment of the character interpretation with another segment, a combination object comprising the another segment and a preceding object is stored. In response to another series of inputs, the combination object can be employed by a processing algorithm to ascertain a preference for the another segment in the context of the preceding object of the combination object. | 2013-06-06 |
| 20130144821 | Digital-to-Analogue Converter and Neuromorphic Circuit Using Such a Converter - A digital-to-analogue converter, with application to electronic circuits with neuromorphic architecture, comprises: transistors of identical nominal geometrical characteristics, but of dispersed current-voltage characteristics, wherein when a constant gate-source voltage is applied to the different transistors, a current varying as a function of the dispersion circulates in the transistor; a digital table receiving a digital word and having a selection output selecting, as a function of the word to be converted, a transistor or transistors supplying a current of desired value representing this word in analogue form. The look-up table is loaded as a function of real measured current-voltage characteristics of different transistors of the set, to establish a look-up between words and current values. The wide variability of characteristics of the transistors, notably their leakage current for a gate-source voltage below the switch-on threshold, allows finding combinations of leakage currents which are a good representation of words to be converted. | 2013-06-06 |
| 20130144822 | Predicting A User Behavior Number of a Word - The present disclosure introduces a method, an apparatus and memory of predicting a user behavior number of a word for reducing the amount and the complexity of operation, saving the consumption of the equipment, and improving the accuracy and reliability of predictions. In an embodiment, a historical data sequence of the user behavior number of a word is converted from a time domain to a frequency domain. Based on the converted frequency domain, each estimated cycle and its effect rate value of the historical data sequence are ascertained. If the historical data sequence is stable, an average value of user behavior numbers of some historical data points before a prediction point is calculated as a user behavior number of the prediction point. Otherwise, the user behavior number is calculated based on a selected main cycle and a selected singularity. | 2013-06-06 |
| 20130144823 | APPARATUS AND METHOD FOR EXTENDING A DEFAULT MODEL OF A TERMINAL - Provided are an apparatus and method for adding a variety of concepts to a default model by combining a linked model with the default model and linked data that is to be matched with the linked model. The apparatus may generate first relationship information about a relationship between a concept included in the default model and a concept included in the linked model and second relationship information about a relationship between a concept included in the linked model and a concept included in the linked data. The apparatus may combine the default model, the linked model, and the linked data, based on the first and second relationship information. | 2013-06-06 |
| 20130144824 | CALCULATING RISK ASSESSMENT VALUE OF EVENT SEQUENCE - Provided are a method, an apparatus and a computer program for calculating a risk assessment value for an event sequence, which are capable of calculating the risk assessment value of each even sequence by calculating a totally ordered set on the basis of a partially ordered set indicating the event sequence. The risk assessment value of an event sequence that is a partially ordered set indicating some events of an event group of M kinds of events (M is a finite natural number) in a time series. The partially ordered set is converted into an approximate totally ordered set, and an M-dimensional feature vector is calculated based on the totally ordered set obtained by the conversion. A projection matrix for calculating the risk assessment value is calculated using the calculated M-dimensional feature vector. | 2013-06-06 |
| 20130144825 | CALCULATING RISK ASSESSMENT VALUE OF EVENT SEQUENCE - Provided are a method, an apparatus and a computer program for calculating a risk assessment value for an event sequence, which are capable of calculating the risk assessment value of each even sequence by calculating a totally ordered set on the basis of a partially ordered set indicating the event sequence. The risk assessment value of an event sequence that is a partially ordered set indicating some events of an event group of M kinds of events (M is a finite natural number) in a time series. The partially ordered set is converted into an approximate totally ordered set, and an M-dimensional feature vector is calculated based on the totally ordered set obtained by the conversion. A projection matrix for calculating the risk assessment value is calculated using the calculated M-dimensional feature vector. | 2013-06-06 |
| 20130144826 | PROCEDURE FOR DETERMINING THE PROBABILITY OF FINDING A PARKING PLACE - A procedure for determining the probability of finding a parking place within a certain period of time on a pre-set stretch of road of an area with a multiplicity of stretches of road. With this procedure, motion profiles are detected and statistically evaluated of users of radiolocation-aided, especially satellite-aided, navigation aids in the area. For each user a “parking place found” event is determined; the stretch of road in which the “parking place found” event occurred is detected; and the travel time is detected which the user expended in each of the stretches of the road until the “parking place found” event occurred. From the data thus acquired for a multiplicity of users, a probability is determined of finding a parking place within the set time span on the stretch of the road. | 2013-06-06 |
| 20130144827 | SYSTEMS AND METHODS FOR SUPPORTING FERTILIZER DECISIONS - Systems and methods for supporting fertilizer decisions are provided. The systems and methods may be configured to receive data relating to the application of a liquid fertilizer to a field having a number of rows. The data may include at least one fertilizer characteristic and yield data relating to each row of the number of rows. The systems and methods may be configured to receive a request from a user to analyze the data. The systems and methods may be configured to compare the at least one fertilizer characteristic and the yield data for each row of the number of rows. The systems and methods may be configured to communicate the results of the comparison to the user. | 2013-06-06 |
| 20130144828 | MODIFICATION OF DESCRIPTION LOGIC EXPRESSIONS - A method, executed by a computer system, or altering a base expression associated with an ontology, the method including:
| 2013-06-06 |
| 20130144829 | TRANSFORMATION OF A SOURCE MODEL TO A TARGET MODEL - An aspect of the invention includes transforming a source model to a target model. A source model is received and a transformation specification that includes a set of rules is accessed. Each rule includes a pattern description and a production component. The pattern description includes a pattern in the source model and the production component includes an algorithm for generating an output in the target model from the pattern. For each expression in the source model, the expression is decomposed into sub-expressions, matching rules in the transformation specification for the expression and the sub-expressions are detected, one of the matching rules having the most specific pattern description is selected, and the production component of the selected rule is executed to generate the output in the target model. The target model is created from the generated output. | 2013-06-06 |
| 20130144830 | METHOD AND DEVICE FOR DISTRIBUTING PATTERNS TO SCANNING ENGINES FOR SCANNING PATTERNS IN A PACKET STREAM - A method and a device for distributing patterns to scanning engines for scanning packets in a packet stream are provided. The method includes providing a plurality of scanning engines and patterns, calculating a respective distance metric for every pair of patterns, and providing a plurality of distribution functions. Further, the method includes calculating a respective sum of the calculated distance metrics for distributing the patterns for each of the distribution functions, and utilizing the sums for selecting a distribution function of the D distribution functions for distributing the patterns to the M scanning engines. A device for implementing the method is also provided. | 2013-06-06 |
| 20130144831 | Predicting Taxi Utilization Information - Techniques are described for automatically analyzing contingencies in information predicting taxi demand. This is to generate representative information regarding current or future taxi demand, and for using such generated representative taxi demand. Contingent demand information may be generated for a variety of types of useful measures of taxi demand rates, such as for projecting expected likelihood of finding a passenger at each of several road locations. Generated representative contingent taxi demand information may be used in various ways to assist taxi and livery service drivers plan optimal routes and schedules. The historical and/or recent contingent demand data may be used to generate the representative traffic flow information. This may include data readings from mobile data sensors in the one or more vehicles, data sensors in or near the roads, or aggregate data sources collected from one or more sensors or through publicly available data sets. | 2013-06-06 |
| 20130144832 | APPARATUS AND PROCESS FOR NONDETERMINISTIC COMPUTING - In the disclosed nondeterministic computing apparatus, a user problem to be solved is translated into an equivalent system of clause polynomial equations (CPEQS) in GF(2). A process for finding an inconsistency in CPEQS is disclosed, which performs elementary equation (or row) operations, such as Gaussian forward eliminations, for each variable v in CPEQS by treating different monomials as different single variables in v-order. The result is examined for two kinds of equations: an inconsistent equation 1=0 and an equation which left-hand side has constant monomial 1 and v occurs in all the other monomials such that v occurs at least once while its right-hand side is 0 to find v=1. To find v=0, a substitution of v with v⊕1 is performed on CPEQS in advance. If either 1=0, or, x=1 and x=0 simultaneously for some variable x in CPEQS, then CPEQS is inconsistent; otherwise CPEQS is consistent. | 2013-06-06 |
| 20130144833 | PROCESSING DATA IN A DATA WAREHOUSE - Data of a database environment, which includes hierarchy information and a matrix of values, is processed. The hierarchy information includes at least two sets of identification codes and defines at least two groups of identification codes. The matrix of values includes at least two columns of identification values. At least one simple filter object is generated based on a user input. Each simple filter object defines an ad hoc group of identification codes selected from a respective one of the sets of identification codes. A filtered operation object that specifies an operation and at least one of the simple filter objects is generated based on a user input. Each of the ad hoc groups differs from each of the groups defined by the hierarchy information. | 2013-06-06 |
| 20130144834 | UNIFORM RESOURCE LOCATOR CANONICALIZATION - A computer-implemented method includes receiving a plurality of uniform resource locators (URLs), where the URLs identify content files, and where the URLs include at least one parameter. Fingerprints of the content files are identified. A first entropy of values of the fingerprints conditional on values of a first parameter is determined, and a second entropy of values of the first parameter conditional on values of the fingerprints is determined. It is determined that the first parameter is irrelevant to the identification of a unique content file by the URLs based, at least in part, on the first and second entropy values. | 2013-06-06 |
| 20130144835 | APPARATUS, AND ASSOCIATED METHOD, FOR SYNCHRONIZING A DATABASE - An apparatus, and an associated method, facilitates synchronization of a database formed of data records. When a synchronization response to a synchronization request indicates that the data of the request is unsynchronizable, data associated with the synchronization request is marked. A retry procedure is subsequently utilized to attempt synchronization of the marked data records and to determine the individual data records that cannot be synchronized. | 2013-06-06 |
| 20130144836 | CANONICALIZATION OF UNIFORM RESOURCE IDENTIFIERS - One or more server devices may obtain a stored resource identifier associated with a resource identifier collection. The one or more server devices may further access a document index that stores information about canonical resource identifiers, where the information relates a particular canonical resource identifier to one or more other resource identifiers; determine whether the canonical resource identifier differs from the stored resource identifier; and replace the stored resource identifier with the canonical resource identifier, when the canonical resource identifier differs from the stored resource identifier. | 2013-06-06 |
| 20130144837 | CONTENT REPRODUCTION APPARATUS SEQUENTIALLY REPRODUCING A PLURALITY OF FILES - A content reproduction apparatus includes: an accepting unit which accepts specification of a file; and a control unit which executes a process in accordance with the specification of the file accepted by the accepting unit. The control unit detects identification information from a file name of the file whose specification is accepted by the accepting unit, and determines, based on the detected identification information, whether the file name of the specified file satisfies a predetermined condition and, in accordance with a result of the determination, specifies a file to be reproduced subsequently to the specified file. | 2013-06-06 |
| 20130144838 | TRANSFERRING FILES - Example methods, apparatus and articles of manufacture to transfer files are disclosed. A disclosed example method includes calculating ratios for nodes within a first file system, wherein the ratios are based on a ratio of a number of files at a node to a total file size of the files at the node and distributing the nodes among sub-traversal paths based on the ratios to minimize deviation of the ratios of the sub-traversal paths. | 2013-06-06 |
| 20130144839 | METHOD AND APPARATUS FOR USE IN DATA TRANSFER - Apparatus for use in transferring data to or from a plurality of storage media, comprises means for identifying a most recently written to data storage media of said plurality of data storage media. | 2013-06-06 |
| 20130144840 | OPTIMIZING RESTORES OF DEDUPLICATED DATA - For restoring deduplicated data, a method maintains a chunk index on a client computing system coupled to a client data store. The chunk index tracks chunks within files remaining on the client data store after storage of the files to a deduplicated server data store coupled to a server computing system. The method determines whether a valid entry for a first chunk exists in the chunk index. In addition, the method retrieves the first chunk from the server data store responsive to determining the valid entry for the first chunk does not exist in the chunk index. The method further retrieves the first chunk from the client data store specified in the valid entry of the chunk index responsive to determining that the valid entry exists in the chunk index and the first chunk resides in a first file at a first offset. | 2013-06-06 |
| 20130144841 | UNATTENDED BACKUP SYSTEM - The invention provides a process for performing automatic backups of a user's data contained in the local drives of at lest one computer of a local area network by means of a Residential Gateway, which is in turn connected to a provider's Backup Server. A backup method is thus provided, which enables creating a backup in an automatic way without the need of providing UPnP support | 2013-06-06 |
| 20130144842 | FAILOVER AND RESUME WHEN USING ORDERED SEQUENCES IN A MULTI-INSTANCE DATABASE ENVIRONMENT - An approach is disclosed for implementing failover and resume when using ordered sequences in a multi-instance database environment. The approach commences by instantiating a first database instance initially to serve as an active instance, then instantiating a second database instance to serve as an instance of one or more passive instances. The active database establishes mastership over a sequence and then processes requests for the ‘next’ symbol by accessing a shared sequence cache only after accessing a first instance semaphore. The active instance and the passive instance perform a protocol such that upon passive database detection of a failure of the active database, one of the passive database instances takes over mastership of the sequence cache, and then proceeds to satisfy sequence value requests. The particular order is observed in spite of the failure. | 2013-06-06 |
| 20130144843 | Online Data Fusion - An online data fusion system receives a query, probes a first source for an answer to the query, returns the answer from the first source, refreshes the answer while probing an additional source, and applies fusion techniques on data associated with an answer that is retrieved from the additional source. For each retrieved answer, the online data fusion system computes the probability that the answer is correct and stops retrieving data for the answer after gaining enough confidence that data retrieved from the unprocessed sources are unlikely to change the answer. The online data fusion system returns correct answers and terminates probing additional sources in an expeditious manner without sacrificing the quality of the answers. | 2013-06-06 |
| 20130144844 | COMPUTER SYSTEM AND FILE SYSTEM MANAGEMENT METHOD USING THE SAME - The present invention provides a computer system capable of providing the latest statistics on a file system in real time. The computer system includes a memory having a program for executing statistics on a file system, and a controller for executing the program. When the file system is accessed, the controller compares first statistic information before access processing on the file system with second statistic information after the access processing; and if it is determined that any difference exists between the first statistic information and the second statistic information, the controller updates the statistic result of the file system based on the difference. | 2013-06-06 |
| 20130144845 | REMOVAL OF DATA REMANENCE IN DEDUPLICATED STORAGE CLOUDS - A method implemented in a computer infrastructure including a combination of hardware and software includes receiving from a local computing device a request to securely delete a file. The method also includes determining the file is deduplicated. The method further includes determining one of: the file is referred to by at least one other file, and the file is not referred to by another file. The method additionally includes securely deleting links associating the file with the local computing device without deleting the file when the file is referred to by at least one other file. The method also includes securely deleting the file when the file is not referred to by another file. | 2013-06-06 |
| 20130144846 | MANAGING REDUNDANT IMMUTABLE FILES USING DEDUPLICATION IN STORAGE CLOUDS - A method includes receiving a request to save a first file as immutable. The method also includes searching for a second file that is saved and is redundant to the first file. The method further includes determining the second file is one of mutable and immutable. When the second file is mutable, the method includes saving the first file as a master copy, and replacing the second file with a soft link pointing to the master copy. When the second file is immutable, the method includes determining which of the first and second files has a later expiration date and an earlier expiration date, saving the one of the first and second files with the later expiration date as a master copy, and replacing the one of the first and second files with the earlier expiration date with a soft link pointing to the master copy. | 2013-06-06 |
| 20130144847 | De-Duplication of Featured Content - A system, computer-implemented method and computer-readable medium for managing duplicate articles are provided. A first and a second potentially duplicate article of a magazine edition are accessed, the first article associated with a first title and a first URL and the second article associated with a second title and a second URL. The titles are normalized. The first normalized title is compared to the second normalized title and the first URL is compared to the second URL to determine whether the first article and the second article are duplicates. It is determined that the first article and the second article are duplicates when the first normalized title is considered similar to the second normalized title and the first URL is considered similar to the second URL. Otherwise, it is determined that the first article and the second article are not duplicates. | 2013-06-06 |
| 20130144848 | DEDUPLICATED DATA PROCESSING RATE CONTROL - Workers are configured for parallel processing of deduplicated data entities in chunks. The deduplicated data processing rate is regulated using a rate control mechanism. The rate control mechanism incorporates a debt/credit algorithm specifying which of the workers processing the deduplicated data entities must wait for each of a multiplicity of calculated required sleep times. | 2013-06-06 |
| 20130144849 | DELTA COMPRESSION USING MULTIPLE POINTERS - Encoding a new version of a data module includes constructing a delta data module having data for providing the new version of the data module. The delta data module may indicate an encoding for copying data at an offset from one of a number of pointers into different versions of the data module. Decoding a delta data module to provide a new version of a data module includes copying, to the new version of the data module, data relative to a target pointer when an encoding in the delta data module indicates a matching pattern relative to the target pointer, and copying, to the new version of the data module, data relative to at least one other pointer when an encoding in the delta data module indicates a matching pattern relative to the at least one other pointer. | 2013-06-06 |
| 20130144850 | STREAM COMPRESSION AND DECOMPRESSION - A method for compressing a sequence of records, each record comprising a sequence of fields, comprises steps of buffering a record in a line of a matrix, reordering the lines of the matrix according to locality sensitive hash values of the buffered records such that records with similar contents in corresponding fields are placed in proximity, and consolidating fields in columns of the matrix into a block of codes. In this, consolidating yields codes of one of a first type comprising a sequence of individual fields and a second type comprising a sequence of fields with at least one repetition. The second type of code comprises a presence field indicating repeated fields and an iteration field indicating a number of respective repetitions. Decompression of the records from the block codes compressed above is also described. | 2013-06-06 |
| 20130144851 | EFFICIENT DATA EXTRACTION BY A REMOTE APPLICATION - A query controller accesses a cache comprising information related to data that is newly added to a database, responsive to detecting a data extraction application is ready to query the database for at least one data extraction rule. The information is added to the cache for each new data event received by a data processing application, prior to the data processing application adding the data parsed from each new data event to the database. The query controller evaluates each data extraction rule against the information in the cache to determine whether the information is relevant to at least one data extraction rule. The query controller sends a separate query by the data extraction application to the database only for any particular data extraction rules to which the information is relevant, such that the query controller reduces the number of queries sent for each query period to only queries based on data extraction rules that need to be reevaluated based on the information updated about data that is newly added to the database. | 2013-06-06 |
| 20130144852 | DISTRIBUTED EVENT SYSTEM FOR RELATIONAL MODELS - A distributed event system for a relational database is disclosed. An event data model operatively describes a target database. For a subject entity in the target database, the event data model declares and defines triggering events and respective corresponding operations. An event engine monitors database queries and events involving the subject entity and determines from the event data model corresponding operations. Execution of the determined corresponding operations is distributed to network-based agents. Agents may be filtered based on skills and/or credentials injected at runtime. Code binaries of the operations are downloaded to the agents for execution. | 2013-06-06 |
| 20130144853 | DEVICE AND METHOD FOR ACQUIRING RESOURCE LOCK - A lock control device receives a lock acquisition request from an application and transmits a lock acquisition request to a DBMS, receives a lock acquisition response from the DBMS, and transmits a lock acquisition response to the application, and each time, acquires statistical time information including the lock request counter, subsequent lock request counter, lock request time, lock acquisition time, initial lock acquisition time, and subsequent lock request time. The statistical processing device calculates the lock request count for each resource, subsequent lock request count for each resource, average lock wait time, and average lock acquisition delay expectation time, based on the statistical time information. Based on these values, the statistical processing device calculates an evaluation value which is the degree of expectation for the time eliminated from the lock wait time when lock acquisition is postponed, and outputs the lock order of the resources arranged in order of smallest evaluation value to a lock order table. | 2013-06-06 |
| 20130144854 | MODELING ACTIONS FOR ENTITY-CENTRIC SEARCH - In one embodiment, a web service engine server | 2013-06-06 |
| 20130144855 | DEVICES AND METHOD FOR SEARCHING DATA ON DATA SOURCES ASSOCIATED WITH A CATEGORY... - A mobile wireless communications device includes a display, at least one input device, and a processor coupled to the display and the at least one input device. The processor is configured to associate each of a plurality of search categories with each of a plurality of search data sources, based upon the at least one input device. The processor is also configured to determine a given search category of the plurality thereof associated with a search term input via the at least one input device. The processor is further configured to search the search data source associated with the given search category for the search term, and generate search results based thereupon, and display the search results on the display. | 2013-06-06 |
| 20130144856 | SEARCHING, SORTING, AND DISPLAYING VIDEO CLIPS AND SOUND FILES BY RELEVANCE - A documents database has a plurality of documents, including but not limited to text files, video clips and sound files. Each document is associated with at least one category of a plurality of categories in a categories database, and each category has at least one keyword. A search request having at least one search term is received from a user, and a categories database is searched for categories having a keyword corresponding to the user search term to identify first level categories. The other keywords from the identified first level categories are retrieved and the documents database is searched for documents having a user search term or a retrieved keyword. The identified documents are then ranked and presented to the user. Other search expansion techniques, and display techniques, are also discussed. | 2013-06-06 |
| 20130144857 | METHODS AND APPARATUS FOR SEARCHING THE INTERNET - Some embodiments relate to performing a search for content via the Internet, wherein user input specifying a search query is supplied to a mobile communications device, such as, for example, a smartphone. The mobile communications device separately issues the search query to a plurality of search engines and can receive the results from each search engine and display the results to the user. Thus, the user does not have to separately issue the query to each of the plurality of search engines. | 2013-06-06 |
| 20130144858 | SCHEDULING RESOURCE CRAWLS - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for scheduling resource crawls. In one aspect, a framework is provided for scheduling resource crawls such that a crawl scheduler determines the health of a document, i.e., whether it can be crawled, the popularity of the document, and the frequency of “interesting,” i.e., substantive, content changes, and based on this information, estimates an appropriate crawl interval for each web resource to improve crawl resource utilization. | 2013-06-06 |
| 20130144859 | DISTRIBUTED GLOBALLY ACCESSIBLE INFORMATION NETWORK IMPLEMENTED WITH A LOCAL INFORMATION NETWORK - A distributed information network is constructed for gathering information from sites distributed across a globally accessible computer network, i.e., the Internet. The distributed information network preferably includes a root server that stores a list of multiple distributed sites each represented by metadata. A network browser delivers an information search request to the root server, which in response develops a profiled information search request. The information provider of each of the distributed sites stores metadata corresponding to information content that is retrievable in response to the profiled information search request for search results derivable from the information content to which the metadata correspond. A profiled information communication link between the root server and each of the multiple distribution sites enables formation of a path for delivery of the search results to a destination site, from a site or sites represented by the metadata of the profiled information search request. | 2013-06-06 |
| 20130144860 | System and Method for Automatically Identifying Classified Websites - Systems, methods, and computer readable storage mediums are provided to automatically identifying a classified website. A website is determined to be a candidate site based on a set of heuristics. From among pages constituting the candidate site one or more pages are determined to be listing page candidates and one or more pages are determined to be detail page candidates. Then a listing page score is determined using a listing page classifier. Similarly, a detail page score is determined using a detail page classifier. The listing page and detail page scores each indicate the likelihood that the pages are part of a classified website. A candidate site score is determined based in part on a combination of the listing page score and the detail page scores. Then when the candidate site score is above a threshold the candidate site is determined to be a classified website. | 2013-06-06 |
| 20130144861 | WEB BROWSER ACCESSIBLE SEARCH ENGINE THAT IDENTIFIES SEARCH RESULT MAXIMA THROUGH USER SEARCH FLOW AND RESULT CONTENT COMPARISON - An Internet infrastructure contains a search server that delivers search result pages of web sites to client devices based upon a search string. Maxima categories are provided that sort search results or web pages based upon popularity and/or context similarity. A web browser contained within a client device is coupled to display various search result pages of web sites delivered by the search server. A maxima determination module within the search server responds to the delivery of the initial search string by first categorizing search results applicability to the search string on the basis of maxima or by generating maxima categories with search results contained therein that correlated to the search string. These search results within each applicable maximum are then sorting on the basis of popularity within each of the maxima categories to effectuate popularity ranks for each search result or web page. | 2013-06-06 |
| 20130144862 | Systems and Methods for Clustering User Reviews - Systems and methods for clustering user reviews are disclosed in which a plurality of user reviews are extracted from electronic documents. The electronic documents contain user reviews of a plurality of items of interest. A set of user reviews is identified in the plurality of user reviews as being associated with the same item of interest in the plurality of items of interest. Item identifying information included in the electronic documents is used for this identification. The set of user reviews is then associated with the same item of interest. Examples of item identifying information include unique product identifiers, brand names, model numbers, and category information. In some instances, the item identifying information is extracted from metadata included in the electronic document. In some instances, the electronic documents are obtained from e-commerce websites or product-review websites. | 2013-06-06 |
| 20130144863 | System and Method for Gathering, Restructuring, and Searching Text Data from Several Different Data Sources - Collecting and analyzing crime related information is one of the most important tasks of law enforcement agencies. Traditionally, crime related information is entered into structured database that allows law enforcement officers to later search the database. However, the user interface is often not well suited for easily finding relevant documents quickly. To improve the situation, a law enforcement information system that stores data in two different types of formats is disclosed. Crime related information is stored both in a traditional structured database and in a modified natural language database. The modified natural language database is then indexed and may be searched with an internet search engine type of user interface. | 2013-06-06 |
| 20130144864 | Systems and Methods for Aggregation of Online Social Network Content - A server contains an executable program and is in communication with an online social network. The server is accessed by a subscriber on a client system executing an application program interface to communicate with the server in which the server accesses indexes of data maintained on an online social network platform and retrieves the accessed data. The subscriber creates an account on the server. The executable program builds an index of relevant content for that subscriber to retrieve. The data is processed and aggregated on the server through a subscriber-specific relevancy engine on the server and the aggregated data is delivered to the subscriber on the client system in a searchable database. The subscriber may execute a search query on the client system in communication with the server and search query is processed returning relevant results to the user. | 2013-06-06 |
| 20130144865 | MANAGING ELECTRONIC PROCUREMENT TRANSACTIONS USING AN OPTIMIZED SEARCH TOOL - Various embodiments of systems and methods for retrieving open purchase orders using an optimized search tool are described herein. The method involves rendering a set of search parameters on a graphical UI of a computer. In an aspect, the method further includes receiving data relating to at least a first search parameter of the set of search parameters. Further, the method includes determining that data relating to at least a second search parameter of the set of search parameters is unavailable and determining the data relating to the at least second search parameter based on extrapolating the data relating to the at least first search parameter. In an aspect, the method involves performing a search based on the data relating to the at least first search parameter and the at least second search parameter. Based on the performed search, one or more open purchase orders are retrieved for further processing. | 2013-06-06 |
| 20130144866 | FAULT TOLERANCE BASED QUERY EXECUTION - Various embodiments of systems and methods for a fault tolerance based query execution are described herein. Queries are received from users, the queries including operators. A multi-query optimization is performed on the operators included in the queries to obtain a query plan. A fault tolerance degree is determined for the operators included in the query plan. Based on the fault tolerance degree of the operators, nodes are assigned to the operators included in the query plan. The assigned nodes execute the operators included in the query plan to execute the queries. In one aspect, the nodes simultaneously execute the operators included in the query plan. | 2013-06-06 |
| 20130144867 | DATABASE PROCESSING METHOD, DATABASE PROCESSING SYSTEM AND DATABASE SERVER - It is provided a database processing method including: a first step of receiving a query request instructing to output the requested data as query results in a designated order; a second step of generating a query execution plan including an order of accessing tables for storing the data based on the received query request; a third step of acquiring the data requested based on the query request from the database based on the generated query execution plan; a fourth step of generating intermediate results including the acquired data; a fifth step of sorting the generated intermediate results in the designated order; a sixth step of judging, for each of the intermediate results, whether an order of the sorted intermediate results has been determined; and a seventh step of outputting the intermediate results whose order has been determined as the query results in order from a head thereof. | 2013-06-06 |
| 20130144868 | Post Building and Search Creation - Various embodiments provide a social search engine that enables a user to create posts that are shared with various other users and which can be dynamically updated and modified by the user and/or others. In at least some embodiments, posts that are created by a user can be curated and tailored by the user to personalize their posts, as well as posts of others. Customization of posts can allow for creation of posts that serve as an “answer” for other search queries. Previously created posts can be revisited to add content such as links, media, and social interactions such as comments and the like. In at least some embodiments, a relevant post community can author a particular post which, in at least some instances, serve as an “answer.” | 2013-06-06 |
| 20130144869 | Trending - Embodiments include methods and systems for generating trending search magazines. Trending topics may be identified from news servers. A search magazine edition may be generated for a trending topic. The edition has a search magazine format, including a news section, a user-generated media section and an about section. News and article servers are searched for articles on the trending topic. Media is searched for on the trending topic. Descriptive information is searched for on the trending topic. The search results of these automatic searches are transformed into the search magazine format of the edition and provided for display in a current display view of a mobile device. | 2013-06-06 |
| 20130144870 | RESULTS RETURNED FOR LIST-SEEKING QUERIES - List-based search results are generated. According to one technique, items are extracted from multiple resources deemed relevant to a user-submitted search query, and a comprehensive master list of those items is compiled and returned to the query-submitted user in response to his submission. According to another technique, lists of items are identified within such query-relevant resources. For each list-containing resource deemed to be relevant to the query terms, a list is extract from that resource and included within that resource's abstract on the search results page returned to the user in response to his submission. Additionally, the resources may be re-ranked for generation of the search results page based on the lists contained within those resources in addition to (or regardless of) occurrences of query terms within those resources. | 2013-06-06 |
| 20130144871 | DYNAMIC CATALOG RANKING - A device receives, from a user device, a search query for video content listings in a video catalog. The device identifies, based on the search query, a set of relevant video assets from an index of the catalog content and determines dimensional values of the search query. The device determines a subset of the relevant video assets based on filtering usage metrics, for the set of relevant video assets, against the dimensional values. The device calculates a popularity value for each video asset in the subset of the relevant video assets and ranks each video asset in the subset of the relevant video assets to form a ranked list. The device sends, to the user device, a response to the search query that includes the ranked list. | 2013-06-06 |
| 20130144872 | Semantic and Contextual Searching of Knowledge Repositories - A method for semantic and contextual searching over a knowledge repository. The method includes creating a search query for each concept related to the target concept to form a search context, wherein the search query for each related concept comprises at least one word derived from a record of that concept previously authored in the project, running the search query on a search index of a knowledge repository to identify a record of the related concept for which the search query is created, and fetching the record of the target concept from the repository as a search result such that the fetched record of the target concept is linked in the knowledge repository to a record of the related concept returned as a result of running the search query on at least one record of the at least one related concept. | 2013-06-06 |
| 20130144873 | EVALUATION OF WEB PAGES - Determining a web page evaluation value includes obtaining a plurality of web pages with the same or approximately the same content; determining a plurality of generation times and a plurality of first evaluation values that correspond to respective ones of the plurality of web pages; identifying a web page among the plurality of web pages that has the earliest generation time; and determining a second evaluation value of the identified web page according to the plurality of first evaluation values. | 2013-06-06 |
| 20130144874 | METHOD AND SYSTEM FOR DOCUMENT CLASSIFICATION OR SEARCH USING DISCRETE WORDS - A method of operating a computerized document search system where information is matched against a database containing documents in response to user queries includes receiving a query identifying a source document that has information content related to the documents within the database. Important words within the source document are detected automatically, where at least one of the important words has been processed using at least two dictionary functions consisting of Derived Words, Acronym, Word Capitalization, and Hyphenation. An importance value is generated for important words in a processed document using a WordRatio and at least one of a selected set of values. A score is generated for a processed document based partly on the importance value of at least one important word in that document. A document list is created for identifying documents that are related to a source document. | 2013-06-06 |
| 20130144875 | SET EXPANSION PROCESSING DEVICE, SET EXPANSION PROCESSING METHOD, PROGRAM AND NON-TRANSITORY MEMORY MEDIUM - A receiving unit ( | 2013-06-06 |
| 20130144876 | INTELLIGENT RESULTS USING AN ASSISTANT - Information may be presented to a user by using a first application to receive a character stream of one or more noncompletion characters. The noncompletion characters indicate that additional characters may be received. The character stream is exchanged with a host that analyzes the character stream to generate results that are responsive to the user's predicted interest. Results are received and displayed so that the user may select one of the results to launch a code segment related to the selected result. | 2013-06-06 |
| 20130144877 | NETWORK SERVER EMPLOYING CLIENT FAVORITES INFORMATION AND PROFILING - An Internet infrastructure that supports searching of web links wherein a user profile is used to reorder search results in a search result list for improved searching. The Internet infrastructure consists of a plurality of client devices with web browsers that are incorporated with user-profiling modules and a search engine server. The process of searching and reordering includes the search engine server receiving a search string along with a user profile from the user-profiling module (or retrieving the user profile from a database). Then, the search engine server stores the user profile in a database that is associated with the search engine server and delivers search results based upon the search string, and reorders the search results based upon stored data in the database. | 2013-06-06 |
| 20130144878 | DATA DISCOVERY AND DESCRIPTION SERVICE - The subject disclosure relates to one or more computer-implemented processes for collecting, analyzing, and employing annotations of data sources. In particular, an annotation component is configured to receive annotations of data for a data source, wherein the respective annotations comprise different associations of a global terms with the data of the data source, a data store configured to store the annotations, and an interface component configured to render the data based on the annotations in response to a request for the data. In an aspect, storing information, the data also stores descriptions of the data sources and definitions of the global terms, and the interface component determines a subset of the information in the data store based on the annotations. A method is further provided comprising receiving a global term and determining data sources that have the global term associated with the data thereof based on the information in the data store. | 2013-06-06 |
| 20130144879 | TRUSTING CROWDSOURCED DATA WITH ISSUED TAGS - Embodiments control submission of crowdsourced data from a computing device to a cloud service. The cloud service receives a packet from the computing device having collected data and a single-use data tag associated therewith. The single-use data tag represents one of a threshold quantity of single-use data tags issued to the computing device. The cloud service validates the single-use data tag in the received packet by, for example, searching for the single-use data tag in a tag store maintained by the cloud service. The collected data from the received packet is stored by the cloud service based on the validation. After validation, the tag store is updated to prevent re-use of the single-use data tag. In some embodiments, the cloud service is a location service receiving crowdsourced beacon fingerprint data from a plurality of mobile computing devices. | 2013-06-06 |
| 20130144880 | BUSINESS PARTNER GROUPING - A method and system, the method including defining business criteria for business entities, the business criteria including at least one business object attribute; defining at least one business partner group set, each of the at least one business partner group set being associated with at least one business object attribute selected from the business criteria; and modifying, by the computer, a record of a business entity by assigning the business entity to one or more of the defined business partner group sets. | 2013-06-06 |
| 20130144881 | PARALLELIZATION OF ELECTRONIC DISCOVERY DOCUMENT INDEXING - A system and method for parallelizing document indexing in a data processing system. The data processing system includes a primary processor for receiving a list of data having embedded data associated therewith, at least one secondary processor to process the data as provided by the primary processor, a data processor to determine a characteristic of the embedded data and process the embedded data based upon the characteristic, and a messaging module to exchange at least one status message between the primary processor and the at least one secondary processor. | 2013-06-06 |
| 20130144882 | MULTIDIMENSIONAL INTEGRATIVE EXPRESSION PROFILING FOR SAMPLE CLASSIFICATION - An organized knowledge-supervised approach—Multidimensional Integrative eXpression Profiling (MIXP)—can not only improve sample classification accuracy by serving as a feature transformation approach, but also help in the discovery of groups of crucial molecular entities that have been too weak to detect individually through preexisting methods. Functionally related molecules that are individually expressed with low differentials, have often been considered as noise and ignored in traditional studies, but through the MIXP approach, they can be readily identified by virtue of their coordinate expression. | 2013-06-06 |
| 20130144883 | METHOD AND APPARATUS FOR INTEGRATEDLY MANAGING CONTENTS IN PORTABLE TERMINAL - Provided are a method of managing contents in a portable terminal which may, in integrated fashion, display contents stored in other locations on one screen and conveniently manage the contents according to similarity of the contents, and an apparatus thereof. The method for managing, in integrated fashion, contents in a portable terminal including: receiving contents having different storage locations and displaying, in integrated fashion, the received contents on one screen. Convenience to the user ease of operation can thus be improved when managing related contents stored at different locations. | 2013-06-06 |
| 20130144884 | METHOD FOR UNSUPERVISED CLUSTERING OF MULTIMEDIA DATA USING A LARGE-SCALE MATCHING SYSTEM - A method and apparatus for unsupervised clustering of a large-scale collection of multimedia data elements. The method comprises generating a first cluster from the large-scale collection by: matching each of the multimedia data elements to all other multimedia data elements in the large-scale collection, determining a clustering score for each match being performed, clustering multimedia data elements having a clustering score above a threshold to create the first cluster; and storing the first cluster in a storage unit. | 2013-06-06 |
| 20130144885 | FILE SEARCH APPARATUS AND METHOD USING ATTRIBUTE INFORMATION - A file search apparatus using attribute information, includes an attribute extraction unit configured to extract attribute information by analyzing a file; and a distributed index generation unit configured to generate an attribute-based index database on the basis of the attribute information of the file. Further, the file search apparatus includes a storage unit configured to store the attribute-based index database; and a file search unit configured to search, when a query is input, an index database corresponding to the query in the storage unit to generate a search result. | 2013-06-06 |
| 20130144886 | METHOD FOR MANAGING EMAIL - This disclosure includes method for managing email that includes providing a list of topics, a reference associated with the topics, and a defined importance value for each reference. The method also includes preparing a topic relevance algorithm for each topic, each topic having associated attributes, and each topic relevance algorithm formed by estimating a relationship value between a topic and its associated attributes based on defined relevance of reference. The method further includes preparing an importance algorithm having a weighted importance attributes formed by estimating a weight for each of the importance attributes based on defined importance of the reference, assessing a target mail using the topic relevance algorithms to determine a topic relevance and against the importance algorithm to determine an importance and determining that a target mail has a threshold importance for a particular topic relevance. | 2013-06-06 |
| 20130144887 | INTEGRATIVE PATHWAY MODELING FOR DRUG EFFICACY PREDICTION - An integrative pathway modeling approach and ranking/evaluating algorithms based on disease-specific pathway models can predict drug efficacy for patients based on their gene expression profiles. A disease-specific pathway model is first constructed with proteins and drugs important to the disease by using computational connectivity maps (C-Maps). Through the pathway model-based ranking algorithm, ideal drugs or optimized drug combination can be discovered for a patient to modulate the gene expression profile of this patient close to those in healthy individuals at pathway-level. | 2013-06-06 |
| 20130144888 | DYNAMIC NETWORK ANALYTICS SYSTEM - Embodiments of the invention is directed to a dynamic network analytics system capable of receiving and analyzing queries sent in data messages from data requesters. The queries contain a request from the data requester as to a risk level associated with an interaction conducted by a user. The dynamic network analytics system can determine an optimized process for determining the risk level of the interaction, based on an analysis of past interactions by the user and past interactions by users similar to the user. The dynamic network analytics system can retrieve data from internal and external data sources to generate a response to the query. The dynamic network analytics system conducts the optimized process and uses the retrieved data to generate risk assessments and risk scores in response to the query from the data requester. | 2013-06-06 |
| 20130144889 | Semantic and Contextual Searching of Knowledge Repositories - A system and an article of manufacture for semantic and contextual searching over a knowledge repository including creating a search query for each concept related to the target concept to form a search context, wherein the search query for each related concept comprises at least one word derived from a record of that concept previously authored in the project, running the search query on a search index of a knowledge repository to identify a record of the related concept for which the search query is created, and fetching the record of the target concept from the repository as a search result such that the fetched record of the target concept is linked in the knowledge repository to a record of the related concept returned as a result of running the search query on at least one record of the at least one related concept. | 2013-06-06 |
| 20130144890 | METHOD AND APPARATUS FOR OPERATING A FREQUENTLY ASKED QUESTIONS (FAQ)-BASED SYSTEM - Typical frequently-asked question (FAQ) systems perform keyword searches on queries to a database of answers to deliver an answer to a user. The present invention searches a user generated query in a classifier trained to search a database of questions in a set of FAQs. The questions in the database correspond to answers. Upon finding a relevant question, the system returns the corresponding answer to the user. Searching the query against the questions generates more accurate results for the user. | 2013-06-06 |
| 20130144891 | SERVER APPARATUS, INFORMATION TERMINAL, AND PROGRAM - Provided is a server apparatus, including: keyword storage capable of storing event-identification information and one or more keywords in relation to each other, the event-identification information identifying an event, the one or more keywords relating to the event; and a first keyword-registering section configured to obtain event-identification information and detailed information from an event-information registering server, the event-identification information identifying an event, the detailed information being on the event, to extract one or more first keywords from the obtained detailed information, and to register the one or more extracted first keywords and the event-identification information in relation to each other in the keyword storage. | 2013-06-06 |
| 20130144892 | METHOD AND APPARATUS FOR PERFORMING EXTENDED SEARCH - A method and apparatus for performing extended search are provided. The method includes receiving user-inputted keywords; extending the user-inputted keywords according to geographical information to acquire extended keywords; performing a search by using the extended keywords; and returning search results to the user. With the present technical solutions, privilege control can be effectively performed in a cloud storage system. With the present embodiments, more information may be provided to a user for reference. | 2013-06-06 |
| 20130144893 | Systems and Methods for Extraction of Concepts for Reuse-based Schema Matching - In one embodiment, an approach to automated recurring concept extraction, from a plurality of input data models (schemas) is presented. The approach converts input data models to graphs, with typed elements. The graphs are mined for closed subgraphs that have a defined minimum support. The identified subgraphs can be filtered with a relevance metric. These subgraphs are converted to schemas or an appropriate representation, and stored for reuse in a repository. The repository can be used to automate further transformation or mapping of schemas presented to a system that uses the repository. In one example, the repository is used in a schema covering process to perform schema transformation. | 2013-06-06 |
| 20130144894 | Method and Apparatus For Retrieving and Combining Summarized Log Data In a Distributed Log Data Processing System - A system can receive raw log data from log-producing devices. The system can parse the raw log data to generate parsed log data, including extracting fields from the raw log data, generating structured query language (SQL) statements from the extracted fields, and inserting the SQL statements in a database. The system can summarize the parsed log data, including identifying one or more SQL statements based on fields of commonality and fields of uniqueness, and creating summarized data that include a new statement condensed from the identified SQL statements. The system can then generate a report based on the summarized data. | 2013-06-06 |
| 20130144895 | Method and Apparatus for Parallel XML Processing - One embodiment of the present invention is an XML application module that processes an XML character stream, which module includes an XML interface module, a parallel bit stream module, a lexical item stream module, a parser and a parsed data receiver. The XML interface module applies the XML character stream as input to the parallel bit stream module and the parser; the parallel bit stream module forms parallel bit streams and applies them as input to the lexical item stream module; the lexical stream module forms lexical item streams and applies them as input to the parser; the parser forms a stream of parsed XML data and applies it as input to the parsed data receiver; and the parsed data receiver processes the stream of parsed XML data. The parsed data receiver may be, for example, a communication module of a portable communication device. | 2013-06-06 |
| 20130144896 | METHOD OF INTEGRATING DATA OF XML DOCUMENT WITH DATABASE ON WEB - Disclosed herein is a method of integrating data of an XML document with a DB on a web. In the method, an XML document provided with user-defined tags is designed. An XSL format document for normal data mapping and an XSL format document for repetitive data mapping are designed. Mapping information required to map the normal data and the repetitive data of the XML document to the XSL format document for normal data mapping and the XSL format document for repetitive data mapping is created. An XSL document for normal data mapping and an XSL document for repetitive data mapping are generated using the mapping information. An SQL query statement required to integrate the normal data and the repetitive data of the XML document with a DB is generated. Data of the XML document is integrated with the DB by executing the SQL query statement on the DB. | 2013-06-06 |
