50th week of 2012 patent applcation highlights part 54 |
Patent application number | Title | Published |
20120317062 | RECONFIGURABLE AND CUSTOMIZABLE GENERAL-PURPOSE CIRCUITS FOR NEURAL NETWORKS - A reconfigurable neural network circuit is provided. The reconfigurable neural network circuit comprises an electronic synapse array including multiple synapses interconnecting a plurality of digital electronic neurons. Each neuron comprises an integrator that integrates input spikes and generates a signal when the integrated inputs exceed a threshold. The circuit further comprises a control module for reconfiguring the synapse array. The control module comprises a global final state machine that controls timing for operation of the circuit, and a priority encoder that allows spiking neurons to sequentially access the synapse array. | 2012-12-13 |
20120317063 | SYNAPSE FOR FUNCTION CELL OF SPIKE TIMING DEPENDENT PLASTICITY (STDP), FUNCTION CELL OF STDP, AND NEUROMORPHIC CIRCUIT USING FUNCTION CELL OF STDP - A synapse for a spike timing dependent (STDP) function cell includes a memory device having a variable resistance, such as a memristor, and a transistor connected to the memory device. A channel of the memory device is connected in series with a channel of the transistor. | 2012-12-13 |
20120317064 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND PROGRAM - An information processing apparatus may include a processor to acquire information associated with behavior of a user and information associated with satisfaction degree of the user, and to analyze an association between the information associated with behavior and the information associated with satisfaction degree | 2012-12-13 |
20120317065 | PROGRAMMABLE PROBABILITY PROCESSING - In an aspect, in general, a programmable computation device performs computations of an inference task specified by a plurality of variables and a plurality of factors, each factor being associated with a subset of the variables. The device includes one or more processing elements. Each processing element includes a first storage for a definition of a factor, a second storage for data associated with the inputs and/or outputs of at least some of the computations, and one or more computation units coupled to the first storage and the second storage for performing a succession of parts of the at least some of the computations that are associated with a factor, the succession of parts defined by data in the storage for the definition of the factor. | 2012-12-13 |
20120317066 | INTEREST LEVEL MEASUREMENT SYSTEM, INTEREST LEVEL MEASUREMENT DEVICE, INTEREST LEVEL MEASUREMENT METHOD, AND INTEREST LEVEL MEASUREMENT PROGRAM - Data that indicates an action state of a user is acquired by a user terminal. Area stay information that includes position information of an area in which the user stays and stay time information of a time during which the user stays in the area is acquired. The data acquired by the user terminal is stored, and the stored data is read according to the acquired area stay information. A behavior status of the user is determined based on the read data, and a behavior status time-series pattern that indicates the behavior status of the user is created. A behavior feature value that indicates a feature of a behavior of the user is calculated based on the created behavior status time-series pattern. An area interest level that indicates a degree and tendency of the user's interest in the area is determined using the calculated behavior feature value. | 2012-12-13 |
20120317067 | EVALUATING RECOMMENDATIONS - Generally described, embodiments of the present disclosure are directed toward the identification of items for inclusion in a recommendations list that may be displayed concurrently with an item selected by a user or users. The recommended items may be items that are of potential interest to the user and/or may be items that are related to the selected item. More specifically, embodiments of the present disclosure provide a method and system for generating one or more recommendations lists, providing those lists to users, evaluating users' interactions with those lists, and modifying the engines or techniques used to identify items that are to be included in the recommendations lists. | 2012-12-13 |
20120317068 | Method For Generating Rules and Parameters for Assessing Relevance of Information Derived From Internet Traffic - A method is disclosed for generating a set of optimal rules and parameters for use by an evaluation engine on a volume of information extracted from a stream of IP packets associated with a web browsing session conducted over a network in order to filter user-initiated traffic flowing across the network from non-user-initiated traffic. Deep packet inspection is performed to extract the volume of information from the stream that conforms to at least one discrimination criteria. An initial iteration of application of the evaluation engine to the volume is performed by selecting initial discrimination criteria and rules for generating the filtered results and a distance between the filtered results and known actual user-initiated traffic is measured. Subsequent iterations of application of the evaluation engine to the volume are performed by changing the discrimination criteria and/or rules until there is no significant improvement in the measured distance. | 2012-12-13 |
20120317069 | THROUGHPUT SUSTAINING SUPPORT SYSTEM, DEVICE, METHOD, AND PROGRAM - A throughput sustaining support system (device) according to the present invention has: a throughput sustaining decision unit which decides whether or not throughput can be sustained without exceeding a throughput expected value in a server system based on correspondence data between a throughput value of the server system and a surplus amount of a system resource measured using the expected throughput value which is the throughput value expected upon the number of requests in advance for the server system and pattern data which indicates a pattern of a processing request matching an operating situation of the server system; and a decision result output unit which outputs a decision result as to whether or not the throughput can be sustained without exceeding the expected throughput value decided by the throughput sustaining decision unit. | 2012-12-13 |
20120317070 | System, Process and Software Arrangement for Providing Multidimensional Recommendations/Suggestions - A process, system and computer software are provided to facilitate at least one recommendation to one or more users and/or one or more applications using multidimensional data. In particular, a multidimensional space is defined, wherein each dimension is capable of providing variable information. At least one dimension corresponds to user profiles. The multidimensional space is filled with multidimensional data corresponding to dimensions of the multidimensional space. Then, information from the multidimensional space is retrieved. Further, the recommendation is generated based on the retrieved information. In addition, it is possible to generate a recommendation-specific query. This can be performed by generating the recommendation-specific query to access a multidimensional cube and retrieve data stored therein. Then, the recommendation can be issued based on the data retrieved from the multidimensional cube. | 2012-12-13 |
20120317071 | Content transfer - The present invention provides a method of transferring content from a file and a database. In this case, the file includes content instances, each content instance being associated with a respective field, and each field having a respective type. The transfer is achieved by determining the type of each field, and then storing each content instance in a store in accordance with the determined field type of the associated field. Each content instance can then be transferred to the database in accordance with the determined field type. A similar procedure is provided for creating XML files based on content within the database. | 2012-12-13 |
20120317072 | SYSTEM ANALYSIS PROGRAM, SYSTEM ANALYSIS METHOD, AND SYSTEM ANALYSIS APPARATUS - A computer-readable, non-transitory medium stores the system analysis program which can accurately analyze the operational status of a system without modifying functions of the system for providing services. A message analysis unit analyzes the contents of collected messages, and determines the times of occurrence of the messages, the process types requested by the messages, and whether or not each of the messages is a request message or a response message. In response to an instruction for model generation, a model generation unit generates a transaction model satisfying at least one limiting condition related to caller-called relationships between processes, based on a set of messages selected in accordance with a selection criterion based on the certainty of existence of caller-called relationships. Then, in response to an instruction for analysis, an analysis unit analyzes the processing status of a transaction based on a protocol log conforming to the transaction model. | 2012-12-13 |
20120317073 | Replication Support for Procedures with Arguments of Unsupported Types - A method, system and computer readable storage medium for replicating procedures with unsupported table data type arguments such as Boolean arguments. The method includes identifying the argument of an unsupported table data type in a procedure to be replicated, mapping the argument to an equivalent supported value, and creating a table containing a column representing the argument as the supported table data type and sending data corresponding to the unsupported table data type argument to a replication server. | 2012-12-13 |
20120317074 | SYSTEMS AND METHODS FOR MANAGING REPLICATED DATABASE DATA - Systems and methods for replicating database data and generating read-only copies of the replicated data in a clean shutdown state. For example, systems can include a tracking module (e.g., a filter driver) that monitors transactions from a database application to a source storage device to generate log entries having at least one marker indicating a known good state of the application. The systems further include a computer coupled to a target storage device comprising a database and log files. The computer processes the transactions, based on the log entries, to replicate data to the target storage device; performs a first snapshot on data stored in the database and log files; replays into the database data stored in the log files; performs another snapshot on the database; and reverts the database back to a state in which the database existed at the time of the first snapshot. | 2012-12-13 |
20120317075 | SYNCHRONIZING PRIMARY AND SECONDARY REPOSITORIES - Various embodiments of systems and methods for synchronizing a primary repository and a secondary repository in a business infrastructure are disclosed. Content of artifacts present in the primary repository and the secondary repository are indexed. Based upon a search criteria received on the secondary repository, an integrated search service provided on the secondary repository is invoked to perform a combinatorial query on the indexed content and retrieve an identifier of each artifact corresponding to the search criteria. Based upon relevancy parameters, the retrieved identifiers are ranked and rendered as a categorized table including a first column and a second column for identifiers present in the primary repository and the second repository respectively. Based upon a user action received on the ranked identifiers in the first column of the categorized table, the associated artifacts are determined and downloaded from the primary repository to the secondary repository. | 2012-12-13 |
20120317076 | DDL Command Filtering - System, method and articles of manufacture for filtering a data definition language (DDL) command. The method includes providing a filtering function with one or more rules for filtering the DDL command. The method further includes receiving the DDL command for replication. The method also includes filtering the DDL command from replication based on the one or more rules. | 2012-12-13 |
20120317077 | IDENTIFICATION OF MOVED OR RENAMED FILES IN FILE SYNCHRONIZATION - A method for synchronizing files is provided. Current metadata including a filename and a hash identifier for each file of the synchronized folder is created. The current metadata is compared to previous metadata. Based on the comparison, a first file and a first folder added to the synchronized folder and a second file and a second folder deleted from the synchronized folder are identified. The hash identifiers of the first and second files are compared. If the hash identifiers match, the filenames of the first and second files are compared. If the filenames do not match, the first file is identified as a renamed file. Metadata is sent to a synchronized device with information related to the first folder sent before information related to the first file, which is sent before information related to the second folder. | 2012-12-13 |
20120317078 | Replication Support for Structured Data - A method, system and computer readable storage medium for replicating structured data stored in a database. The method includes identifying the stored structured data, mapping the data to an unstructured data type, and sending the mapped data to one or more replicate databases as unstructured data. | 2012-12-13 |
20120317079 | Systems and methods of data replication of a file system - The invention relates to methods for replicating a primary file system on a primary host to a secondary file system on a secondary host including determining a primary data block to replicate by reading a space map block entry (b, e) of the primary data block, wherein b represents the first snapshot and e the last snapshot to use the primary data block; computing a checksum of a primary data block and sending its number to the secondary host and determining a secondary data block that corresponds and computing its checksum then comparing the primary and secondary data block checksums and replicating the primary data block on the secondary file system when the primary and secondary checksums mismatch for the primary file system. In another aspect of the method if the primary and secondary checksums mismatch the method sends all data blocks from the primary file system allocated after a reliable snapshot on the secondary file system to the secondary host to be written on the secondary file system. | 2012-12-13 |
20120317080 | METHOD AND SYSTEM FOR ARCHIVING SUBJECT-SPECIFIC, THREE-DIMENSIONAL INFORMATION ABOUT THE GEOMETRY OF PART OF THE BODY - A method and system for archiving 3D geometry information for a plurality of subjects, and on a particular part of the body (which may also be the whole body) is described. The method and system allow an organizing and an analyzing step, resulting in scalable characteristic components for the particular part of the body, and an approximation of the geometry of that particular part of the body for a specific subject by a combination of a sub-set of those characteristic components with corresponding scale factors, which are then stored. The method comprises the steps of: *organizing for each of said plurality of subjects the 3D geometry information according to a pre-determined standard, thus obtaining organized 3D geometry information; analyzing the organized 3D geometry information of said plurality of subjects, resulting in averaged 3D geometry information of said particular part of the body; and—scalable characteristic components of said particular part of the body; such that for each of said plurality of subjects said organized 3D geometry information can be approximated by a combination of said scalable characteristic components relative to said averaged 3D geometry information; comparing, for at least one out of said plurality of subjects, said organized 3D geometry information with said averaged 3D geometry information and determining a subset of said scalable characteristic components and corresponding scale factors, for approximating to a given accuracy said organized 3D geometry information relative to said averaged 3D geometry information by a combination of said scalable characteristic components out of said subset, each characteristic component scaled with its corresponding scale factor; storing, for at least one specific subject out of said plurality of subjects, said approximated organized 3D geometry information by storing—said averaged 3D geometry information;—said subset of said scalable characteristic components and said corresponding scale factors for said specific subject. | 2012-12-13 |
20120317081 | DETECTING WASTEFUL DATA COLLECTION - A method and system comprises a duplication identifier module to analyze data input information to automatically identify duplicate expected inputs associated with a process. The system includes logical process model information defining a logically structured series of process activities and data input information representing a plurality of expected inputs associated with respective process activities, with each expected input being indicative of expected collection of a corresponding data element during execution of the associated process activity. Each duplicate expected input comprises one of the plurality of expected inputs for which there is at least one other expected input with respect to a common corresponding data element. | 2012-12-13 |
20120317082 | QUERY-BASED INFORMATION HOLD - Systems and methods for implementing a query-based hold on electronic items hosted by a communication device and/or system. Electronic items from a plurality of user-specific folders are purged and copied to a discovery hold folder. The purged items, along with all existing items, contained within the discovery hold folder are evaluated against the query-based hold criteria. Items that fail to meet the query-based hold criteria are permanently deleted from the discovery hold folder. Items that meet the query-based hold criteria are maintained within discovery hold folder. | 2012-12-13 |
20120317083 | SYSTEM AND METHOD FOR DELETION OF DATA IN A REMOTE COMPUTING PLATFORM - Embodiments of a system and method to perform a secure deletion of a set of data from a remote cloud computing system are described. As described, in some embodiments, a user of a cloud computing service that provides data storage may securely delete his stored set of data by acquiring elevated access privileges to the stored set of data, designating at least one most significant bit in at least one data block therein as a sentinel and recording its value and position, updating the value of the sentinels and thereby rendering the data unusable, and verifying the success of the operation by checking the new value of the sentinels against the original value. In some embodiments, the verification process may be repeated in order to ensure that the data has been rendered useless across all nodes of the remote cloud platform. | 2012-12-13 |
20120317084 | METHOD AND SYSTEM FOR ACHIEVING DATA DE-DUPLICATION ON A BLOCK-LEVEL STORAGE VIRTUALIZATION DEVICE - A method and system for achieving data de-duplication on a block-level storage virtualization device belonging to the field of data storage technologies, is disclosed. The method comprises: deleting the duplicate data in the actual physical data corresponding to the specified virtual LBA address space to obtain the data extents after physical data is de-duplicated; establishing the correspondence between the virtual LBA address space and the data extents after the physical data is de-duplicated; according to the correspondence and metadata information of the data extents, obtaining the storage position information of the actual physical data corresponding to the virtual LBA address space pointed by external data read and write requests to complete the I/O redirection. This invention also provides a system for achieving data de-duplication on a block-level storage virtualization device. This invention can delete duplicate data across hosts and storage devices, to achieve a wider scope of data de-duplication. | 2012-12-13 |
20120317085 | SYSTEMS AND METHODS FOR TRANSMITTING CONTENT METADATA FROM MULTIPLE DATA RECORDS - Systems and methods are provided for cataloging content metadata from a variety of sources and providing metadata to client devices. A processing device receives inconsistent data records representative of a common content element, with different values for a metadata field descriptive of a common attribute of the content element. The processor assign confidence scores metadata fields from each data record, and use these confidence scores to select the metadata that is transmitted to the client device. | 2012-12-13 |
20120317086 | GENERAL PURPOSE DATA CONTAINER METHOD AND APPARATUS FOR IMPLEMENTING AV/C DESCRIPTORS - Disclosed herein is a data management system for AV/C descriptor data. The system includes a data container hierarchical structure. The system also includes a methodology for compiling data from the containers into a read buffer upon receipt of a request from a requestor. The data presented to the requestor will preferably be in a format that may be understood by other device requestors that may or may not be utilizing this same container system. | 2012-12-13 |
20120317087 | Location-Aware Search Ranking - A training system is described for generating at least one ranking module using features derived, in part, from region information. The region information encodes characteristics about regions which are associated with queries in search log data. A query processing system is also described for applying the ranking model generated by the training system to process queries in real time. In one implementation, the training system can also generate plural ranking models corresponding to plural respective map areas. The training system can also generate a mapping model which correlates each region with a ranking model to be applied when processing queries that originate from that region. The query processing system can process a query by determining a region associated with the query and then identifying and applying a ranking model which corresponds to the region. | 2012-12-13 |
20120317088 | Associating Search Queries and Entities - The subject disclosure is directed towards processing data to obtain associations between queries and entities. Association is modeled using a query-entity click graph, blending general query-click logs with vertical query-click logs. Smoothing techniques address the data sparsity in such graphs, including interpolation using a query synonymy model. The association models may be applied to the task of recommending products to web queries, by annotating queries with products from a large catalog and then mining query-product associations through web search session analysis. | 2012-12-13 |
20120317089 | Scheduler for Search Engine Crawler - A scheduler for a search engine crawler includes a history log containing document identifiers (e.g., URLs) corresponding to documents (e.g., web pages) on a network (e.g., Internet). The scheduler is configured to process each document identifier in a set of the document identifiers by determining a content change frequency of the document corresponding to the document identifier, determining a first score for the document identifier that is a function of the determined content change frequency of the corresponding document, comparing the first score against a threshold value, and scheduling the corresponding document for indexing based on the results of the comparison. | 2012-12-13 |
20120317090 | SUPPORT FOR INTERNATIONAL SEARCH TERMS - TRANSLATE AS YOU CRAWL - A search engine server delivers search results to a web browser of a client device communicatively coupled to the search engine server via the Internet. The system identifies new web pages in a source language during crawling, translates them into a plurality of destination languages, creates reverse indexes in respective languages, and stores both reverse indexes and cache web pages in a database. Upon the entry of search strings by a user using a web browser, the search engine server responds by delivering links of web pages in the user-desired language (the language of the search string or a language chosen by the user) as well as web pages translated from a plurality of destination languages, ranked based upon popularity or other means. The search engine server contains a plurality of translators that translate new web pages, links that are obtained during crawling, in to a plurality of destination languages. | 2012-12-13 |
20120317091 | SYSTEM AND METHOD FOR USERS TO GET NEWLY UPDATES - Most valuable newly-updated information in current social network systems and web search engines become useless before users can timely search them out. The inventive system uses the communication mechanism and the preset query mechanism to help users timely get newly updates. System components include: a web crawler, a filter and a classifier to mine public newly-updated web pages from the web; a database to store various newly updates; an integrator to collect newly updates from other sources; a controller to send newly updates to corresponding users; a query box to store each user's preset queries and manager users' preferences; a communication platform to help users easily get preset queries. The method can help current social network systems and web search engines make better use of their newly updated data. Web search engines can better cooperate with social networks by using the method. | 2012-12-13 |
20120317092 | APPARATUS AND METHOD FOR CALCULATING THE SELECTIVITY OF A RANGE QUERY FOR MULTIDIMENSIONAL DATA - An apparatus and method for calculating the selectivity of a range query for multidimensional data using a multidimensional histogram are provided. A data space may be partitioned into one or more sub-spaces based on a sum of skew values of the one or more sub-spaces, a space-partitioning tree may be generated for the data space, and a multidimensional histogram may be generated for the data space based on the space-partitioning tree. A range query for multidimensional data may be processed based on the multidimensional histogram. | 2012-12-13 |
20120317093 | PERFORMING PARALLEL JOINS ON DISTRIBUTED DATABASE DATA - The present invention extends to methods, systems, and computer program products for performing parallel joins on distributed database data. Embodiments of the invention include a phased semi-join reduction strategy using replication and shuffle operations to join a first and a second data source. A filter building phase uses replication and pushes down a “Distinct” (e.g., SQL) operator to produce a list of join keys for the first data source (one side of the join). A shuffle phase for the second data source is modified to join to the key list produced in the first phase as a row filtering mechanism. A join phase then joins the first and second data sources. | 2012-12-13 |
20120317094 | Sideways Information Passing - Methods, systems and program products for query optimization using sideways information passing. In one implementation, a join clause in a query is identified that specifies an outer table of tuples to be joined with an inner table, the outer table having one or more attributes, and each of the attributes of the outer table having values stored in an attribute file that is distinct from attribute files in which the values of other attributes are stored. A plan for the query is created which, when executed, causes selection of a subset of tuples of the outer table to serve as input to the join clause in place of the outer table based on one or more predicates applied to the inner table. | 2012-12-13 |
20120317095 | DETERMINING A DENSITY OF A KEY VALUE REFERENCED IN A DATABASE QUERY OVER A RANGE OF ROWS - A method, apparatus and program product that determine a density of a key value referenced in a database query over at least one range of rows, and utilize the determined density to optimize the database query. By doing so, the density of various key values may be determined and compared, and a bit map may be generated over the range of rows of the key value that is denser, resulting in a reduction of resources to build and use the bit map. Moreover, from the bit map over the range of rows to be selected after using the determined density, dense regions may be identified that can be used to optimize block I/O's according to the number of rows to be selected based on the query. | 2012-12-13 |
20120317096 | Relational Query Planning for Non-Relational Data Sources - A query plan for executing a query within a relational database system including at least one non-relational data source is generated by analyzing expressions that reference a non-relational data source within a query for the database system via an interface for that non-relational data source, determining for each analyzed expression at least one of the database system and interface capable of processing that analyzed expression for executing the query, providing an indicator for each of the analyzed expressions that indicates at least one of the database system and interface determined to process that analyzed expression, and generating the query plan for execution of the query, via the database system, based on the indicators for the expressions of the query. | 2012-12-13 |
20120317097 | Presenting Images as Search Results - In one embodiment, accessing a set of characters of a search query currently entered into a text entry box; compiling a first set of search results based on the set of characters currently entered into the text entry box, wherein the compiling is re-executed responsive to changes to the set of characters entered into the text entry box; associating an image with each search result from the first set of search results; and presenting the first set of search results as a first set of images adjacent to the text entry box. | 2012-12-13 |
20120317098 | SEARCH DEVICE AND SEARCH PROGRAM - An index generating unit divides each name data of search target data both into words and into characters, calculates start and end scores showing a start and an end of each of the words and start and end scores showing a start and an end of each of the characters, links them to each entry word which constructs the name data as a list (a name ID, a position, and start and end scores), and stores this list in an index storage unit. A searching unit decomposes an input character string into partial character strings, acquires corresponding candidate entries from the index storage unit, and judges the continuity between candidate entries on the basis of lists to add a comparison score according to the continuity to a candidate entry. | 2012-12-13 |
20120317099 | CONTROLLING DISCLOSURE OF TRACE DATA RELATED TO MOVING OBJECT - A system for controlling disclosure of trace data related to moving object, including a first receiving module for receiving, for at least one moving object in a first region, a first record aggregate; a second receiving module for receiving, for at least one moving object in a second region, a second record aggregate; a calculating module for calculating trace data from at least one attribute value of a first identifier that is in received first and second record aggregates in response to data search request; an anonymizing module for calculating to satisfy a condition of the moving object passing through at least one region; and a transmitting module for returning calculated trace data as a search result if the moving object moves in calculated ranges and if the moving object has the first identifier that is in both the received first and second record aggregates. | 2012-12-13 |
20120317100 | STRING PATTERN CONCEPTUALIZATION FROM DETECTION OF RELATED CONCEPTS BY ANALYZING SUBSTRINGS WITH COMMON PREFIXES AND SUFFIXES - A reference string set including a group of strings is set. At least two specific tuples of substring triples is found inside the reference string set of strings. Each tuple is considered as a candidate for representing a related concept. Each concatenation of the substrings triples is an explicit member of the reference string set. Each middle substring of the substring triples is unequal to another middle substring within the substring triples found inside the reference string set. Each prefix substring is equal to all other prefix substrings within the substring triples found inside the reference string set. Each suffix substring is equal to all other suffix substrings within the substring triples found inside the reference string set. Either the prefix substring or the suffix substring is not empty. | 2012-12-13 |
20120317101 | METHOD AND SYSTEM FOR QUALIFYING KEYWORDS IN QUERY STRINGS - A method and system for qualifying keyword(s) or phrase(s) to formulate a query string for submitting a search request when the query string contains one or more keywords that may have multiple meanings associated therewith. Database information containing keywords and associated meanings or forms of the keywords is maintained and a requester is prompted to identify one or more of the meanings of a keyword when building the query string. One or more advertisements pertaining to the associated meanings or forms of the keywords in the query string is presented to the requester submitting a search request. | 2012-12-13 |
20120317102 | RANKING EXPERT RESPONSES AND FINDING EXPERTS BASED ON RANK - In a computerized social network, expert and user chat sessions are stored and rated probabilistically. Later user requests for information are met with an expert ranking, based on a balance of similarities between expert profile and questions; similarity between expert profile and prior chat sessions, and dynamically updated chat session ratings. New sessions can be rated automatically with reference to keywords distilled from past sessions responsive to user ratings—and based on session length. | 2012-12-13 |
20120317103 | RANKING DATA UTILIZING MULTIPLE SEMANTIC KEYS IN A SEARCH QUERY - A method, computer-readable medium, and system for ranking data are disclosed. It may be automatically determined that a search query includes multiple semantic keys. Respective sets of semantic sub-keys may be determined for each of the multiple semantic keys. Documents including at least one instance of a semantic sub-key associated with the multiple semantic keys may be ranked above documents which do not include at least one instance of a semantic sub-key associated with the multiple semantic keys. In this manner, ranking of documents associated with search results may be improved by utilizing semantic sub-keys associated with multiple semantic keys included in the search query. | 2012-12-13 |
20120317104 | Using Aggregate Location Metadata to Provide a Personalized Service - Functionality is described herein which generates a plurality of item models based on the aggregate behavior of users, such as the aggregate behavior of the users in selecting network-accessible sites and/or issuing particular queries. In one implementation, each item model estimates a probabilistic distribution of locations for an individual, given that the individual selects a particular item (e.g., a particular site or query). The functionality can use the item models to provide a personalized service to an end user. For example, in one scenario, the functionality can generate a plurality of location-based features based on the item models. The functionality can then learn a ranking model based on the location-based features. In a real-time phase of operation, a query processing system uses the ranking model to personalize search results for an end user. | 2012-12-13 |
20120317105 | Method and Apparatus for Updating Index and Sequencing Search Results Based on Updated Index in Terminal - The present invention provides a method and an apparatus for updating an index and sequencing search results based on the updated index in a terminal. The method comprises: retrieving whether there is any modification in a file; if there is any modification in the file, performing an increment index the modified file to generate new index file, wherein the increment index includes a number of times that the modified file is selected historically; merging the new index file into the original index file; obtaining key words input by the user; querying the search results related to the key words, sequencing the search results according to the relevance between the search results and the key words and the number of times that the modified file is selected historically and displaying the sequenced search results to the user. By the present invention, the user experience of the mobile terminal is improved. | 2012-12-13 |
20120317106 | Information Providing System - An internal state of a user and a situation of the user are complementarily used to recommend optimal information for the individual user. An information providing system according to the present invention estimates a current strength of a desire of the user and a current situation of the user to refer to a database describing combinations of the strength and the situation to thereby present items that can satisfy both the desire of the user and the situation of the user. | 2012-12-13 |
20120317107 | Methods and Systems for Classifying Search Results to Determine Page Elements - This invention relates to determining page elements to display in response to a search. A method embodiment of this invention determines a page element based on a search result. The method includes: (1) determining a set of result classifications based on the search result, wherein each result classification includes a result category and a result score; and (2) determining the page element based on the set of result classifications. In this way, a classification is determined based on a search result and page elements are generated based on the classification. By using the search result, as opposed to just the query, page elements are generated that corresponds to a predominant interpretation of the user's query within the search results. As result, the page elements may, in most cases, accurately reflect the user's intent. | 2012-12-13 |
20120317108 | SMART COLLABORATIVE BRAINSTORMING TOOL - Methods and a system are disclosed for a collaborate brainstorming interface that defines a collaboration session with a three dimensional holographic mind map. An intelligent agent guides a collaboration session that is structured by the interface. The intelligent agent detects key words, work flow steps and user interactions in the session to initiate searches that are filtered using artificial intelligence. The results are presented to developers interacting through the interface. | 2012-12-13 |
20120317109 | Client-Side Modification of Search Results Based on Social Network Data - In particular embodiments, a method comprising, accessing, at a client device, a set of search results in a structured document loaded into a client application, wherein the search results correspond to a search query of a first user, accessing a data store of social graph information to determine if one or more second users having an association with the first user have accessed any of the search results, and visually distinguishing, at the client device, in a user interface of the client application each of the one or more search results that have been accessed by one or more second users. | 2012-12-13 |
20120317110 | INTERESTINGNESS RANKING OF MEDIA OBJECTS - Media objects, such as images or soundtracks, may be ranked according to a new class of metrics known as “interestingness.” These rankings may be based at least in part on the quantity of user-entered metadata concerning the media object, the number of users who have assigned metadata to the media object, access patterns related to the media object, and/or a lapse of time related to the media object. | 2012-12-13 |
20120317111 | METHOD AND APPLICATION FOR MANAGING DIGITAL FILES - A web-based digital file storage system is disclosed. The storage system may include a digital file repository for storing and retrieving digital files, such as photos, a digital tagging system configured to assign digital tags to the digital files, a sorting system, and a user interface. | 2012-12-13 |
20120317112 | OPERATION LOG MANAGEMENT SYSTEM AND OPERATION LOG MANAGEMENT METHOD - In an example of operation log management system, a storage device stores a plurality of operation log records obtained from an operation log in a client computer. The plurality of operation log records each contains an operation type of a corresponding operation and a group identifier for identifying a group to which the corresponding operation belongs. Each of at least a part of the plurality of operation log records contains at least one of identifiers of input data and output data of a corresponding operation. A processor groups the plurality of operation log records into groups by the group identifiers, identifies operation log records which belong to different groups and whose output data identifier and input data identifier match, and associates the different groups to which the identified operation log records belong as components of one integrated group. A display device displays information representing the integrated group. | 2012-12-13 |
20120317113 | COMPUTING DEVICE, STORAGE MEDIUM, AND METHOD FOR PROCESSING BILL OF MATERIAL OF ELECTRONIC PRODUCTS - In a method for processing a bill of material (BOM) of an electronic product using a computing device, each electronic component of the electronic product is identified according to a function description of the electronic component, and an identification code for each of the electronic components is generated. The method creates a functional BOM of the electronic components according to characteristic data of the electronic components, and classifies the electronic components into different groups of the functional BOM according to the identification code of each of the electronic components. The method further counts a total number of the electronic components in each of the classified groups, generates assembly information of the electronic product according to the functional BOM, and displays the assembly information of the electronic product on a display device that is connected to the computing device. | 2012-12-13 |
20120317114 | INFORMATION PROCESSING DEVICE, METHOD, AND COMPUTER PROGRAM PRODUCT - An information processing device, method and computer program product use a candidate attribute area identification portion configured to receive information associated with a cluster including at least one data item. The candidate attribute area identification portion identifies at least one named attribute area for each of the at least one data item. A relatedness assessment portion assesses a relatedness between the cluster and each of the at least one named attribute area. A cluster name generation portion generates a cluster name based on the assessed relatedness, wherein said cluster name includes at least a part of one of the at least one named attribute area. | 2012-12-13 |
20120317115 | INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, PROGRAM, AND INFORMATION PROCESSING SYSTEM - There is provided an information processing device including an event cluster creation unit configured to create an event cluster including, among a plurality of types of content, reference content serving as a reference and related content, the related content having a different type from the reference content and indicating the same event as the reference content, and a meta information appending unit configured to create meta information about the event on the basis of the event cluster and append the meta information to the event cluster. | 2012-12-13 |
20120317116 | APPARATUS AND METHOD FOR MANAGING SYSTEMS EACH INCLUDING A PLURALITY OF CONFIGURATION ITEMS - An apparatus generates configuration group information by classifying, based on first log information storing messages outputted by a first plurality of configuration items of a first system, into first configuration groups each including one or more configuration items that have outputted messages having a commonality. The apparatus generates relation class information that defines, in association with the first configuration groups, first one or more message propagation relations. The apparatus classifies a second plurality of configuration items of a second system into second configuration groups included in the first configuration groups, based on the configuration group information and second log information storing messages outputted by the second plurality of configuration items, and applies second one or more message propagation relations that are associated, by the relation class information, with third configuration groups included in the second configuration groups, to the second plurality of configuration items. | 2012-12-13 |
20120317117 | Information Visualization System - Provided is an information visualization system that can present information most suitable for the sensitivity and interest of a user. The information visualization system according to the present invention uses interest degrees of the user for items to calculate relevance between the items and generates an item map reflecting the relevance as coordinate values of the items. | 2012-12-13 |
20120317118 | DATABASE DATA DICTIONARY - Systems and methods are provided for manipulating data sets. In accordance with one implementation, a computerized system is provided for storing, managing, indexing, interrelating, and/or retrieving data sets in a manner independent of the data model. The system includes an element module configured to store and uniquely identify elements and an element relation module configured to store relationships between the elements in the element module. The computerized system may also comprise a class module configured to store attributes of elements in a class and a type definition module configured to define the class and the attributes related to the class. The computerized system may further comprise a state machine module, the state machine module including a state machine transition module and a status module. | 2012-12-13 |
20120317119 | Product Line Type Development Supporting Device - Product line type development is supported by analyzing inter-feature dependency relations based on the use state of feature in existing products and uses the analysis result. | 2012-12-13 |
20120317120 | SYSTEM AND METHOD FOR MINING CATEGORY ASPECT INFORMATION - In various example embodiments, systems and methods for providing category aspect information by mining historical data is provided. In example embodiments, historical data is compiled. The historical data comprises user behavior data based on actions performed with past queries by users. Listing data is accessed. The listing data includes aspect data for each listing. The historical data is then joined with the listing data and a determined category of the listing to create joined data. Demand scores based on the joined data are determined. The determined demand scores is then sorted to determine at least one relevant aspect name for a category. | 2012-12-13 |
20120317121 | METHODS AND SYSTEMS FOR USING DISTRIBUTED MEMORY AND SET OPERATIONS TO PROCESS SOCIAL NETWORKS - Systems and methods for managing and evaluating a social network. The social network is represented as a graph structure and stored in distributed memory. A viable path from one node that is not directly connected to another node in the graph structure may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found providing a connection between the nodes. When midpoint nodes are found, the paths connecting the one node to the other node may be reconstructed. | 2012-12-13 |
20120317122 | DISPERSED STORAGE NETWORK VIRTUAL ADDRESS FIELDS - A dispersed storage network includes a dispersed storage device to store data. The dispersed storage device includes a processing module operable to slice a data segment of a data object into data slices. The processing module further creates a slice name for each of the data slices. The slice name includes routing information containing a vault identifier that identifies a vault associated with the data object, in which the vault identifies at least one user. The slice name further includes a source data name containing an identifier of the data object. | 2012-12-13 |
20120317123 | SYSTEMS AND METHODS FOR PROVIDING MEDIA RECOMMENDATIONS - Systems and methods are described for providing content recommendations by maintaining preference values indicative of a user's preference (e.g., degree of like or dislike) for different assets and updating these preference values based on observed events and known relationships between events and content elements. Also disclosed herein are systems and methods for providing content recommendations using polarity scores, which represent how much user preferences for certain content differ from the average user preference for that content. | 2012-12-13 |
20120317124 | DATABASE PARTITIONING BY VIRTUAL PARTITIONS - A database may be virtually partitioned into virtual partitions. The virtual partitions are mapped to physical databases of a database. Data records added to the database are each assigned to a virtual partition and stored in the physical database mapped to the assigned virtual partition. The identifier generated for a data record includes an identifier of the assigned virtual partition. When additional databases are created, virtual partitions are remapped to the larger space of physical databases. | 2012-12-13 |
20120317125 | METHOD AND APPARATUS FOR IDENTIFIER RETRIEVAL - A method for identifier retrieval. The method can include the steps of: extracting candidate identifiers from a data source according to a source identifier; obtaining a profile of the source identifier and profiles of the candidate identifiers from the data source; and selecting a target identifier associated with the source identifier from the candidate identifiers according to the profile of the source identifier and the profiles of the candidate identifiers. The method may efficiently, accurately and rapidly find a target identifier associated with a source identifier. | 2012-12-13 |
20120317126 | SYSTEM AND METHOD FOR NEAR AND EXACT DE-DUPLICATION OF DOCUMENTS - A system, method and computer program product for identifying near and exact-duplicate documents in a document collection, including for each document in the collection, reading textual content from the document; filtering the textual content based on user settings; determining N most frequent words from the filtered textual content of the document; performing a quorum search of the N most frequent words in the document with a threshold M; and sorting results from the quorum search based on relevancy. Based on the values of N and M near and exact-duplicate documents are identified in the document collection. | 2012-12-13 |
20120317127 | COHORT DRIVEN SELECTION OF MEDICAL DIAGNOSTIC TESTS - A computer implemented method, system, and/or computer program product create a suggested diagnostic test selection. A description of a current patient includes a current medical complaint, medical history, and physical examination result for the current patient. A cohort for the current patient is made up of persons who have a substantially similar medical complaint, medical history, and physical examination result as the current patient. Past diagnostic test sets used to make correct medical diagnoses for persons in the cohort are identified and stored in a cohort diagnostic test database. The past diagnostic test sets are sorted based on increasing levels of detrimental effects posed by each of the past diagnostic test sets. The sorted diagnostic test sets are then presented to a health care provider for the current patient. | 2012-12-13 |
20120317128 | METHOD AND APPARATUS FOR PROCESSING N SORT QUERIES IN MULTI-RANGE SCAN - Disclosed is a method and an apparatus for optimally processing N sort queries in a multi-range scan, including: allocating a buffer based on a first number of extracted records included in the queries; extracting first data related to first attributes in a first list included in the queries and storing the extracted first data in the buffer; extracting second data related to the first attributes that are not extracted in the first list included in the queries; and updating the buffer so as to satisfy the queries by comparing the data stored in the buffer with the second data, wherein the queries are N sort queries in a multi-range scan for at least one record sorted based on the first attributes and second attributes. | 2012-12-13 |
20120317129 | ROLE-BASED SECURITY POLICY FOR AN OBJECT-ORIENTED DATABASE SYSTEM - A system for adding security data to a search index comprises a processor and a memory. The processor is configured to select an object in a search index, wherein an entry associated with the object is stored in the search index and add security entity data to an entry of the search index corresponding to the selected object. A memory is coupled to the processor and is configured to provide the processor with instructions. | 2012-12-13 |
20120317130 | COMPUTER PRODUCT, SEARCH METHOD, SEARCH APPARATUS, AND NODE - Nodes respectively store a multilayer transposed Bloom filter. A client selects a node N | 2012-12-13 |
20120317131 | DISASTER RESPONSE SYSTEM - Health care data and other information about a person is stored in memory accessible to a server. The server allows users to access the health care data and information, such as across a communication network. In some embodiments a biometric identifier for a person is stored with the information. The biometric identifier can be used to control access to a person's records and to quickly locate information associated with a particular person during a disaster. | 2012-12-13 |
20120317132 | Instance-Based Command Execution, Approval, and Notification Framework - An action approval framework may be provided. Upon receiving a selection of an action and at least one action parameter from a user, the requested action may be evaluated to determine if that action requires approval. Once the required approval has been received, or if the action may be automatically approved, the requested action may be performed. | 2012-12-13 |
20120317133 | TASK CONTEXT RECOVERY - A data store stores display content indexed to a word segment. The display content comprises a time stamp and a screen shot captured in response to entering the word segment using an input. A process module searches the data store for the word segment, presents the display content indexed to the word segment, and replays an action for the display content. | 2012-12-13 |
20120317134 | DATABASE TABLE COMPARISON - Techniques are disclosed for comparing database tables. In one embodiment, the database tables are partitioned. Queries are generated for retrieving each partition. For each generated query, a stored procedure is invoked, using the respective generated query as an input parameter to the stored procedure. The stored procedure is configured to generate a checksum based on the partition retrieved from executing the respective query. The application compares the generated checksums to determine if the partitions and/or tables are consistent. | 2012-12-13 |
20120317135 | MITIGATION OF DATA LEAKAGE IN A MULTI-SITE COMPUTING INFRASTRUCTURE - Embodiments of the invention relate to a method, system, and computer program product to dynamically mitigate data leakage in a file sharing environment. Mandatory access control policies are provided to address and maintain restrictions on file sharing both with respect to security rules of an organization and restrictions pertaining to discretionary sharing decisions. In addition, suggestions for potential recipients for file sharing are supported, as well as examination of abnormal recipients in response to the discretionary sharing decisions. | 2012-12-13 |
20120317136 | SYSTEMS AND METHODS FOR DOMAIN-SPECIFIC TOKENIZATION - Systems and methods are provided for identifying a content domain associated with seed information, and searching metadata based on seed information. A processor receives seed information and accesses a database of tokens, each token associated with a content domain and each content domain associated with two or more tokens. For example, the content domain may be “Music” and the token may include “feat,” “with,” or “duet.” The processor determines whether a portion of the seed information matches a token in the database of tokens, and in response to determining that a portion of the seed information matches a token, the processor identifies the content domain associated with the matching token and determines whether at least some of the seed information, including the matching token, corresponds to some of the metadata in a database of data records. | 2012-12-13 |
20120317137 | METHOD FOR MULTI-DIMENSIONAL DATABASE STORAGE AND INQUIRY - A method for data storage is disclosed. The method includes the following steps: establishing an entity table for storing entity information in a database ( | 2012-12-13 |
20120317138 | COMMUNICATION APPARATUS AND ADDRESS LEARNING METHOD - A communication apparatus operates as a node of a network. The communication apparatus includes a port-state managing unit that updates, every time failure occurrence in the network is detected, state information indicating a state of the network, a database updating unit that updates, based on a transmission source address and a reception port of a received frame and the state information managed by the port-state managing unit, a database that determines an output port when a frame in which the transmission source address is a destination address is received, and an output-destination determining unit that determines an output port of the received frame by searching through the database using, as search keys, the destination address of the received frame and the state information managed by the port-state managing unit. | 2012-12-13 |
20120317139 | Content transfer - The present invention provides a method of transferring content from a file and a database. In this case, the file includes content instances, each content instance being associated with a respective field, and each field having a respective type. The transfer is achieved by determining the type of each field, and then storing each content instance in a store in accordance with the determined field type of the associated field. Each content instance can then be transferred to the database in accordance with the determined field type. A similar procedure is provided for creating XML files based on content within the database. | 2012-12-13 |
20120317140 | Content transfer - The present invention provides a method of transferring content from a file and a database. In this case, the file includes content instances, each content instance being associated with a respective field, and each field having a respective type. The transfer is achieved by determining the type of each field, and then storing each content instance in a store in accordance with the determined field type of the associated field. Each content instance can then be transferred to the database in accordance with the determined field type. A similar procedure is provided for creating XML files based on content within the database. | 2012-12-13 |
20120317141 | SYSTEM AND METHOD FOR ORDERING OF SEMANTIC SUB-KEYS - A method, computer-readable medium, and system for ordering data are disclosed. It may be automatically determined that a search query includes multiple semantic keys, where each semantic key of the multiple semantic keys is associated with a respective set of semantic sub-keys of a plurality of sets of semantic sub-keys. A sort key may be automatically determined based on an analysis of the plurality of sets of semantic sub-keys. An ordering of the semantic sub-keys may be automatically determined based on the sort key. As such, where the ordering of semantic sub-keys is output for presentation, the information may be presented in a manner that is easier to understand and interact with. | 2012-12-13 |
20120317142 | SYSTMEN AND METHOD FOR DATA MANAGEMENT IN LARGE DATA NETWORKS - A system and method for storing an input data network, in the form of graph is provided. The system includes a master node and a plurality of slave nodes. The master node is operable to receive the data network in the form of a graph, the graph including a plurality of vertices connected by edges; calculate a probability of co-retrieval for each of the plurality of vertices; and assign each of the plurality of vertices to one of the plurality of compute nodes based on the calculated probability of co-retrieval. Another method and system are provided for converting a dataset into a graph based index and storing the index on disk. Respective systems and methods of querying such data networks are also provided. | 2012-12-13 |
20120317143 | STRING ANALYSIS BASED ON THREE-VALUED LOGIC - Performing string analysis based on three-valued logic by including expressing a property of a string in a computer software application as a three-valued logic shape predicate, performing a three-valued logic shape analysis using the shape predicate to reach a fixpoint solution, and evaluating the fixpoint solution to determine a three-valued logic value of the property. | 2012-12-13 |
20120317144 | DATA MANAGEMENT TOOL - A data management system includes a record database, an account database, a scenario database, and a computing device. The computing device includes a data management tool that is configured to identify scenarios based on information stored in the record database and store the identified scenarios in the scenario database. Further, the data management tool may associate identified scenarios with customer records stored in the account database. Upon receipt of a scenario selected by a user, the data management tool may automatically generate a query that identifies at least one customer record associated with the selected scenario, execute the query, and create a sample billing record for each customer record identified. | 2012-12-13 |
20120317145 | METHOD AND APPARATUS FOR FILE ASSURANCE - A system and associated processes for file assurance. A user may use the system to maintain control over a file that is distributed to another user. The user may specify a number of file access options, such as read-only, report distribution, or track edits. The system may encrypt the file with the file access options included. The file may be altered so as to make the file no longer readable by an application designed to read the file without the system, or a corresponding system associated with the recipient user. The system or corresponding system may enforce the file access options selected by the user. Further, in some embodiments, the system may report the occurrence of file access or the performance of specific operations on the file to the user. | 2012-12-13 |
20120317146 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR VALIDATING ONE OR MORE METADATA OBJECTS - In accordance with embodiments, there are provided mechanisms and methods for creating, exporting, viewing and testing, and importing custom applications in a multitenant database environment. These mechanisms and methods can enable embodiments to provide a vehicle for sharing applications across organizational boundaries. The ability to share applications across organizational boundaries can enable tenants in a multi-tenant database system, for example, to easily and efficiently import and export, and thus share, applications with other tenants in the multi-tenant environment. | 2012-12-13 |
20120317147 | Tracking Modifications to Values of Various Fields in a Database Serve - Storing historical/previous values of a field of a relational database in the same table. The previous values can be conveniently used to revert back to any of such previously stored values. Thus, for each update/modify operation, the present value is stored as a previous value. In one embodiment, the previous values are stored in a VARRAY associated with each field. The indexed entries of the VARRAY store the present as well as previous values of the field. | 2012-12-13 |
20120317148 | SYSTEM AND METHOD TO REPRESENT THE GENEALOGY OF PHYSICAL AND ABSTRACT OBJECTS - The present invention relates to systems and methods for representing interrelated data objects in a database as a hierarchical rooted tree, and also involves a computer program for visualizing, creating, and modifying such trees. | 2012-12-13 |
20120317149 | METHODS AND SYSTEMS FOR PROCESSING GRAPHS USING DISTRIBUTED MEMORY AND SET OPERATIONS - Systems and methods for operating a database using distributed memory and set operations, and for evaluating graphs stored in the database. Any system may be represented as a graph structure having nodes and edges. The graph structure is stored in a distributed memory system using a key/value schema wherein each node is stored as a key and a set of neighbor nodes is stored as the corresponding value. A short path from one node to another may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found indicating connections between the nodes. When the midpoint nodes are found, the paths connecting the nodes may be reconstructed. | 2012-12-13 |
20120317150 | Minimize Downtime with Immediate Upgrade of Data in Databases - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for updating data stored within the database. In some implementations, actions include determining a cut-off date, defining a first group of data within a first table based on the cut-off date, defining a second group of data within the first table based on the cut-off date, providing the second group of data in a second table, converting the first group of data from a first data structure to a second data structure to provide converted first data within the first table, making the converted first data available for access over a network, converting the second group of data from the first data structure to the second data structure to provide converted second data in the second table, and making the converted second data available for access over the network. | 2012-12-13 |
20120317151 | Model-Based Method for Managing Information Derived From Network Traffic - A network intelligence solution (“NIS”) is arranged to access a stream of IP (Internet Protocol) packets associated with communications over a network between a network access device and a server. The NIS performs deep packet inspection (“DPI”) to extract a volume of information from the accessed stream that conforms to at least one discrimination criteria and further utilizes an evaluation model that applies rules to filter the volume of information to distinguish user-initiated traffic flowing across the network from non-user-initiated traffic. The filtered results are written to a database and may be analyzed to determine network usage and/or other network characteristics. | 2012-12-13 |
20120317152 | Multiple Address Verification System for Delivery Routing - The present disclosure pertains to collecting various different ways of designating a destination address or physical location (Source Databases A,B,C), and associating them to a single, canonical form (Canonical Database, FIG. | 2012-12-13 |
20120317153 | CACHING RESPONSES FOR SCOPED AND NON-SCOPED DOMAIN NAME SYSTEM QUERIES - In the described embodiments, while executing a DNS resolver, a processing subsystem in an electronic device with a set of network interfaces receives a scoped request from an application to determine an IP address for a domain name. Generally, a DNS query generated from a scoped request is to be transmitted only on network interfaces specified in the scoped request, whereas a DNS query generated from a non-scoped request can be transmitted on any of the network interfaces. The processing subsystem then generates a DNS query from the scoped request and transmits the DNS query on the specified network interfaces. Upon receiving a response to the DNS query, the processing subsystem stores a record of the response in a scoped portion of a DNS resolution cache that is used only for storing responses to scoped requests. The DNS resolution cache also comprises a non-scoped portion that is used only for storing responses to non-scoped requests. | 2012-12-13 |
20120317154 | Table For Storing Parameterized Product/Services Information Using Variable Field Columns - Computer implemented systems store descriptions of multiple different types of marketplace items as a collection of parameter-value pairs, using a table having a plurality of rows and columns, wherein values for at least two of the items are stored in cells of first and second ones of the rows, respectively; keys that provide information that can be used to decipher differential mappings of a plurality of the columns to a plurality of parameters in different ones of the rows; and one or more interfaces that collectively display previously stored parameters and values to a human end-user. | 2012-12-13 |
20120317155 | Hybrid Data Management System and Method for Managing Large, Varying Datasets - A hybrid data management/storage system is provided which includes two or more integrated or connected data management systems. An external application and/or user interacts with the hybrid data management/storage system using a unified interface. Incoming raw data may be directed to be stored in any of a plurality of data management systems based on the incoming data object having one or more of a number of predefined characteristics, including for example size and/or data type. Metadata corresponding to all incoming data objects may be stored in a particular data store, regardless of whether the incoming object's raw data is stored in a different one of the plurality of data stores. | 2012-12-13 |
20120317156 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND STORAGE MEDIUM - An information processing apparatus includes a processing unit configured to monitor a storage area and to process data in response to the data being stored into the storage area, a storage unit configured to store setting information containing area information indicating the storage area monitored by the processing unit, a readout unit configured to read out the setting information from the storage unit, and a control unit configured to determine whether the storage area monitored by the processing unit exists based on the setting information, and to enable a user interface for receiving a user operation to store the data into the storage area determined to exist. | 2012-12-13 |
20120317157 | FILE SYSTEM LOCATION VERIFICATION USING A SENTINEL - A new file system is mounted to a mount point of an existing file system implemented in a computational system. A sentinel indicator is stored in the mount point. Prior to initiating an input/output (I/O) operation by a program, a determination is made by the program as to whether the sentinel indicator exists. In response to determining by the program that the sentinel indicator exists, the I/O operation is performed by the program. In certain alternative embodiments, in response to determining by the program that the sentinel indicator exists, the I/O operation is not performed by the program. | 2012-12-13 |
20120317158 | FILE SYSTEM LOCATION VERIFICATION USING A SENTINEL - A new file system is mounted to a mount point of an existing file system implemented in a computational system. A sentinel indicator is stored in the mount point. Prior to initiating an input/output (I/O) operation by a program, a determination is made by the program as to whether the sentinel indicator exists. In response to determining by the program that the sentinel indicator exists, the I/O operation is performed by the program. In certain alternative embodiments, in response to determining by the program that the sentinel indicator exists, the I/O operation is not performed by the program. | 2012-12-13 |
20120317159 | MODULAR OPERATOR, DEVICE HAVING THE SAME, AND OPERATING METHOD THEREOF - A modular operator, a smart card including the same, and a method of operating the same are provided. The modular operator includes: an input unit configured to receive first data, second data, and a modulus; and an accumulator configured to perform an accumulation operation on the first data and a first portion of the second data, to shift the accumulation operation result to the right as much as the number of bits of the first portion, and to perform an accumulation operation on a result of a shifted accumulation operation, a second part, of the second data, which is shifted to the right as much as the number of bits of the first portion, and the modulus. | 2012-12-13 |
20120317160 | MATRIX CALCULATION METHOD, PROGRAM, AND SYSTEM - A matrix calculation system for calculating funny matrix multiplication (FMM) of a matrix A and a matrix B, including: sequentially calculating a permutation of indices {ai} in which values are arranged in a non-decreasing order with respect to each i-th row where i=1 to the number of rows of the matrix A; storing a value, which is greater than expected as a value of a matrix, for C[i, j] with respect to each j-th column where j=1 to the number of columns of the matrix A in the i-th row; sequentially calculating a permutation of indices {bj} in which values are arranged in a non-decreasing order with respect to each j-th column where j=1 to the number of columns of the matrix B; and setting the values of C[i, j], which are i and j components of the matrix C. | 2012-12-13 |
20120317161 | SYSTEMS AND METHODS FOR DETERMINING RECOMMENDED MEDIA CONTENT FOR EXCHANGE BETWEEN VEHICLES - An onboard computer system including instructions causing a processor to store a first-user media profile indicating media preferences of a user. The processor also determines that the vehicle is encountering a second vehicle and receives a second-user media profile. The processor also evaluates the profiles to determine whether the profiles bear a predetermined similarity and, in response to determining the similarity exists, identifies recommended media, based on characteristics of the profiles, and initiates provision of the recommended media to one of the users of the first vehicle and the user of the second vehicle. | 2012-12-13 |