48th week of 2010 patent applcation highlights part 65 |
Patent application number | Title | Published |
20100306206 | SYSTEM AND METHOD FOR HIGH PRECISION AND HIGH RECALL RELEVANCY SEARCHING - A method and system for performing high precision and high recall relevancy searching is provided. According to embodiments of the present invention, a relevance rule is generated based on a user model and language from within one or more relevant and non-relevant documents. A query is created based on the relevance rule wherein the query may be applied to a corpus to identify relevant and non-relevant documents. The relevance rule may be iteratively refined in order to increase the accuracy of the query. The resulting query may be used by a litigator during the discovery phase of a litigation to respond to a request for production. | 2010-12-02 |
20100306207 | METHOD AND SYSTEM FOR TRANSFORMING XML DATA TO RDF DATA - A method for transforming Extensible Markup Language (XML) data to Resource Description Framework (RDF) data. The method includes the steps of: receiving a predefined mapping file; retrieving the correspondences between XML elements and/or attributes in the XML data and/or properties and concepts of the RDF data as specified by the mapping file, wherein the correspondence is represented by elements of the mapping file; processing elements of the mapping file to obtain XML elements and/or attributes and generate corresponding RDF resources; and generating the RDF data by using the generated RDF resources. A corresponding transformation engine apparatus is configured to perform the foregoing method. | 2010-12-02 |
20100306208 | ABSTRACT PIPELINE COMPONENT CONNECTION - The subject disclosure pertains to systems and methods for connecting pipeline components such as data flow pipeline components. Pipeline components are wrapped in metadata components that include the component as well as abstracted metadata in the form of input and output metadata descriptors. A connector can arbitrate metadata differences between pipeline components based on the metadata descriptors, thereby preventing upstream modifications from invalidating or breaking components downstream. Native or plug-in heuristic and/or related components can provide the functionality necessary to resolve metadata differences. | 2010-12-02 |
20100306209 | PATTERN MATCHER AND ITS MATCHING METHOD - A pattern matching method is disclosed. The method includes following steps. A character is searched in a skip table of a pattern such that a flag value and a skip value are returned. The sliding window is shifted according to the skip value when the flag value indicates the character is not a pattern end. The character plus at least one byte preceding the character is hashed when the flag value indicates the character is the pattern end such that a character hashing value is returned. A pattern end portion is hashed, wherein the size of the pattern end portion is equal to the size of the character plus the size of the byte such that a pattern hashing value is returned. The character hashing value is compared with the pattern hashing value. An exact matching process is performed when the character hashing value is equal to the pattern hashing value. | 2010-12-02 |
20100306210 | CLUSTERING IDENTICAL OR DISJOINT KEYWORD SETS FOR USE WITH AUCTIONS FOR ONLINE ADVERTISING SPACE - Embodiments of methods, apparatuses, or systems relating to clustering identical or disjoint keyword sets for use with auctions for online advertising space. | 2010-12-02 |
20100306211 | METHOD AND APPARATUS FOR AUTOMATIC GEO-LOCATION SEARCH LEARNING - An approach is provided for automatic geo-location search learning. A geo-location search learning platform receives a query specifying words, and initiates a point-of-interest search on the query, an address search on the query, and a partial search on some of the words. The geo-location search learning platform then combines results of the point-of-interest search, the address search, and the partial search, determines context information for a user; and sorts the combined results based on the context information thereby recommending the researched results to the user in a priority list as sorted. | 2010-12-02 |
20100306212 | Fetching Optimization in Multi-way Pipelined Database Joins - A method of performing a multi-way join of a plurality of database relations includes executing a plurality of pipelined two-way joins with the database relations. Each two-way join has two sequential phases. In the first phase, missing attributes of the input relations that are required to evaluate a joining criterion specific to said two-way join are fetched from a non-volatile memory device, and the input relations are joined according to the criterion. In the second phase, any additional missing attributes of the input relations are fetched from the non-volatile memory device as assigned by an optimization process executed prior to commencing the multi-way join. | 2010-12-02 |
20100306213 | Merging Search Results - Merging search results is required, for example, where an information retrieval system issues a query to multiple sources and obtains multiple results lists. In an embodiment a search engine at an Enterprise domain sends a query to the Enterprise search engine and also to a public Internet search engine. In embodiments, results lists obtained from different sources are merged using a merging model which is learnt using a machine learning process and updates when click-through data is observed for example. In examples, user information available in the Enterprise domain is used to influence the merging process to improve the relevance of results. In some examples, the user information is used for query modification. In an embodiment a user is able to impersonate a user of a specified group in order to promote particular results. | 2010-12-02 |
20100306214 | IDENTIFYING MODIFIERS IN WEB QUERIES OVER STRUCTURED DATA - Described is using modifiers in online search queries for queries that map to a database table. A modifier (e.g., an adjective or a preposition) specifies the intended meaning of a target, in which the target maps to a column in that table. The modifier thus corresponds to one or more functions that determine which rows of data in the column match the query, e.g., “cameras under $400” maps to a camera (or product) table, and “under” is the modifier that represents a function (less than) that is used to evaluate a “price” target/data column. Also described are different classes of modifiers, and generating the dictionaries for a domain (corresponding to a table) via query log mining. | 2010-12-02 |
20100306215 | Ranking Results of Multiple Intent Queries - Techniques and systems are disclosed providing improved ranking of results to an online search-based query. One or more user types are identified for a search-based query, which may correspond to a number of user relevant results and which ones are selected. A user profile can be determined for the respective user types for the search-based query, which may identify a proportion of the users that belong to that type, and how many results are relevant to that type. A set of relevant results can be identified for the respective user types for the query, based on a number of results used by the user type. An improved ranking of the results can be determined for the query, from the one or more sets of relevant results, based on the user profiles and a desired user satisfaction metric for a desired number of users. | 2010-12-02 |
20100306216 | SHORT PATHS IN WEB GRAPHS WITH SMALL QUERY TIME - Short paths are found with a small query time in scale-free directed graphs using a two-phase process by which data structures comprising shortest path trees are first pre-computed for a group of central vertices called “hubs” that have short paths to most other vertices in the graph. In a query time phase, a short path between two vertices of interest in the graph is found by looking up the path to the root in each of the shortest path trees. | 2010-12-02 |
20100306217 | Mechanism for Separating Content from Noisy Context in Template-Based Documents for Search Indexing - In one embodiment, a mechanism for separating content from noisy context in template-based documents for search indexing is disclosed. In one embodiment, a method includes selecting a plurality of documents for index comparison, identifying one or more identical elements found in each of the plurality of documents, and removing the one or more identical elements from consideration in an indexing process of the plurality of documents. | 2010-12-02 |
20100306218 | SYSTEMS AND METHODS FOR INTERFACING WITH HEALTHCARE ORGANIZATION CODING SYSTEM - Systems and methods for interfacing with a healthcare organization's coding system. | 2010-12-02 |
20100306219 | Cache-Based Predicate Handling For Queries On XML Data Using Uncorrelated Path-Based Row Sources - The approaches described herein provide an efficient way to process certain kinds of queries that retrieve XML data stored in an object-relational database. An XML query may include a predicate condition that joins two row sources. One or both of the row sources required for predicate evaluation may be path-based; that is, consume and produce rows of XMLType data. Such a path-based row source may be modified to use the predicate condition to filter the rows it generates so that only rows satisfying the predicate condition need to be further processed. A small cache structure introduced into the path-based row source may be used to optimize the evaluation of the predicate row. Once populated with row data, the cache structure may be reorganized to optimize the performance of predicate evaluation. | 2010-12-02 |
20100306220 | Efficient Way To Evaluate Aggregations On XML Data Using Path-Based Row Sources - The approaches described herein provide an efficient way for a database server to process certain kinds of queries that require the evaluation of an aggregation function over XML data stored in an object-relational database. An aggregation function takes multiple inputs and generates a single output. A database server first determines whether the query qualifies for this particular kind of optimization, then creates a query execution plan that specifies the use of an enhanced path-based row source, eliminating the need for a second path-based row source for computing the aggregation function. The enhanced path-based row source specified in the query execution plan computes an aggregation function and stores the result of that function computation in a column of each row. The XPath evaluation results that are the individual inputs to the aggregation function are only stored temporarily until they are used to compute the aggregation function. | 2010-12-02 |
20100306221 | EXTENDING RANDOM NUMBER SUMMATION AS AN ORDER-PRESERVING ENCRYPTION SCHEME - A method and system for cryptographically indexing, searching for, and retrieving documents is provided. In some embodiments, an encryption system is provided that generates a document index that allows users to retrieve documents by performing encrypted queries for keywords associated with the documents. In some embodiments, each keyword maps to the same number of encrypted document identifiers. In some embodiments, an extractor graph is employed to map an indication of each keyword to a number of buckets storing encrypted document identifiers. In some embodiments, an order-preserving encryption system is provided. The encryption system uses an ordered index that maps encrypted instances of ordered attribute values to documents that are associated with those values. The ordered index enables queries containing query operators that rely on order, such as less than (“<”) or greater than (“>”), to be successfully performed on encrypted attribute values. | 2010-12-02 |
20100306222 | CACHE-FRIENDLY B-TREE ACCELERATOR - A system and method for accelerating searches of B-trees. An auxiliary index that is optimized for use with a cache is used in conjunction with a B-tree. A hash type of auxiliary index maintains pointers to key entries in the B-tree leaf nodes. The hash type of index may be searched, and a resulting pointer is used to locate records of the B-tree, bypassing a search of the B-tree. A top level type of auxiliary index maintains pointers to leaf nodes or internal nodes of the B-tree. A top level index may be searched, and a search of the B-tree is performed beginning with the node found by using the top level index. A monitoring mechanism may automatically start, change, or discard the auxiliary index based on an amount of cache memory, types of searches, or other factors. The auxiliary index may be optimized for high performance in read only searches, while the B-tree provides transaction durability. | 2010-12-02 |
20100306223 | Rankings in Search Results with User Corrections - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for improving search with user corrections. In one aspect, a methods performed by a data processing apparatus include the actions of receiving a value result set, accessing historical records of user corrections stored at one or more data storage devices, the historical records describing user corrections of the characterization of instance attributes by values, determining that the historical records of user corrections describe a first user correction involving a first value in the value result set, and changing a confidence parameter embodying a confidence that the first value correctly characterizes the attribute of the instance. The value result set comprises a collection of one or more values. The values are candidates for characterizing an attribute of an instance. The first value is involved in the correction as either a corrected value or an uncorrected value. | 2010-12-02 |
20100306224 | Online Measurement of User Satisfaction Using Long Duration Clicks - Determine a plurality of first dwell durations for a plurality of first web pages, each first dwell duration indicating a time period a user has spent with a first web page. Access a plurality of first quality ratings for the first web pages, each first quality rating indicating a quality of a first web page as a part of a search result generated for a first search query. Access a predefined quality rating threshold. Correlate the first dwell durations and the first quality ratings. And, determine a dwell duration threshold, such that a second user spending a second dwell duration greater than or equal to the dwell duration threshold with a second web page indicates that the second user is satisfied with the second web page identified in a second search result generated by a search engine in response to a second search query requested by the second user. | 2010-12-02 |
20100306225 | Identifying Terms To Include In Content - A term to be included in an item is identified. A value of a first parameter of online activity associated with the term is determined. A determination that the value of the first parameter satisfies a first threshold is made and an item that includes the term is generated. The item is forwarded for placement in a medium. After the item has been placed in the medium, one or more search queries including the term are received over a predetermined time period. A value for a second parameter of online activity associated with the one or more search queries is determined. Based on the determined value of the second parameter, a determination that the placement of the item in the medium was effective is made. | 2010-12-02 |
20100306226 | Electronic Advertisement System - A keyword, first online query volume information for the keyword in a first geographic region, and second online query volume information for the keyword in a second geographic region are received. A first parameter is calculated based on the first online query volume information and the second online query volume information, and the first parameter is determined to satisfy a threshold. In response to the determination that the first parameter satisfies the threshold, a first medium distributed in the first geographic region is identified and an item including the keyword is forwarded for placement in the first medium. Revenue generated by placement of the item in the first medium is determined. | 2010-12-02 |
20100306227 | METHODS, SYSTEMS AND COMPUTER PROGRAM PRODUCTS FOR PROVIDING A DISTRIBUTED ASSOCIATIVE MEMORY BASE - Systems, methods and computer program products are provided for a distributed associative memory base. Such methods may include providing a distributed memory base that includes a network of networks of associative memory networks. The memory base may include a network of associative memory networks, a respective associative memory network comprising associations among a respective observer entity and a plurality of observed entities that are observed by the respective observer entity. Ones of the associative memory networks are physically and/or logically independent from other ones of the associative memory networks. Methods include imagining associations from the associative memory base using a plurality of streaming queues that correspond to ones of a plurality of rows of ones of the associative memory networks. | 2010-12-02 |
20100306228 | DYNAMIC MENUS FOR MULTI-PREFIX INTERACTIVE MOBILE SEARCHES USING PREDICTIVE TEXT TO YIELD TARGETED ADVERTISEMENTS - The present invention includes systems and methods for retrieving information via a flexible and consistent targeted search model that employs interactive multi-prefix, multi-tier and dynamic menu information retrieval techniques (including predictive text techniques to facilitate the generation of targeted ads) that provide context-specific functionality tailored to particular information channels, as well as to records within or across such channels, and other known state information. Users are presented with a consistent search interface among multiple tiers across and within a large domain of information sources, and need not learn different or special search syntax. A thin-client server-controlled architecture enables users of resource-constrained mobile communications devices to locate targeted information more quickly by entering fewer keystrokes and performing fewer query iterations and web page refreshes, which in turn reduces required network bandwidth. | 2010-12-02 |
20100306229 | Systems and Methods for Improved Web Searching - Systems and methods are provided for improved web searching. In one implementation, suggested search queries are provided based on previous search queries and click data. A weighted bi-partite graph or index may be used to identify related search queries based on overlapping clicked URLs. According to a method, query-click log data of a search engine is processed to generate sets of suggested search queries, data corresponding to each suggested search query, and a set of clicked URLs related to each suggested search query. Additionally, or independently, methods may be provided for contextually correcting spelling errors within sets of suggested search queries using a contextual algorithm, and/or identifying and discarding sets of suggested search queries and URLs that lead to restricted material, such as restricted content and related URLs. | 2010-12-02 |
20100306230 | PERSONAL INFORMATION MANAGEMENT SYSTEM AND PERSONAL INFORMATION MANAGEMENT METHOD - A personal information management system is characterized in describing a telephone number while reading out a coordinate position on an application sheet on which a coded coordinate position on the sheet is printed, transmitting by a mobile phone a handwriting image read out by a digital pen to a database managing server, analyzing by the database managing server image data received by a wireless communication terminal device, extracting the telephone number allocated to the wireless communication terminal device, and, in accordance with the extracted telephone number, detecting personal information associated with the telephone number from a telephone number/address associating type database. With this, in letter mailing service, etc., an opportunity for the exposure of personal information is shortened, so that the possibility of the leakage of personal information is reduced, repetitive descriptions of the same content are avoided, and troublesome work can be eased. | 2010-12-02 |
20100306231 | COLLABORATIVE SEARCH TOOLS - Described herein are technologies pertaining to search in general, and collaborative searching in particular. Graphical items are generated that are representative of searches. The graphical items include graphical indicia that indicate which search results were included in other, related searches. | 2010-12-02 |
20100306232 | MULTIMEDIA SYSTEM PROVIDING DATABASE OF SHARED TEXT COMMENT DATA INDEXED TO VIDEO SOURCE DATA AND RELATED METHODS - A multimedia system may include a plurality of text comment input devices configured to permit a plurality of commentators to generate shared text comment data based upon viewing video data from a video source. The system may further include a media processor cooperating with the plurality of text comment input devices and configured to process the video source data and shared text comment data, and generate therefrom a database comprising shared text comment data indexed in time with the video source data so that the database is searchable by text keywords to locate corresponding portions of the video source data. The media processor may be further configured to combine the video source data and the shared text comment data into a media data stream. | 2010-12-02 |
20100306233 | SEARCH AND REPLAY OF EXPERIENCES BASED ON GEOGRAPHIC LOCATIONS - Users are enabled to record and retrieve their experiences temporally and based on geographic locations. Experiences such as meetings, conferences, emails, other forms of communications are indexed along a timeline and associated with geographic locations. A user interface provides replay of experiences with links to associated documents, recordings, etc. employing a user friendly map feature. | 2010-12-02 |
20100306234 | CACHE SYNCHRONIZATION - Methods, systems, and media are provided for synchronizing information across multiple environments of a synchronization system. A search query is received into a frontend infrastructure of a first synchronization environment. The frontend infrastructure checks a local cache manager to see if results already exist for the search query. If existing results are not found, then one or more backend search engines of the first synchronization environment are utilized for the search query. The search results from the backend search engines are saved into the local cache manager of the first synchronization environment. A cache sync notification is created to identify the contents and location of the actual saved results. The cache sync notification is saved in a cache synchronization service located within the first synchronization environment, and broadcast to all other synchronization environments within the synchronization system. The actual results can be retrieved from any other synchronization environment. | 2010-12-02 |
20100306235 | Real-Time Detection of Emerging Web Search Queries - A current query model is constructed representing a first histogram of a first set of counts corresponding to a first set of search queries and a current time interval. One or more historical query models are constructed, each uniquely representing a different second histogram of a different second set of counts corresponding to a different second set of search queries and a different historical time interval. A third search query is received. A first generation probability is calculated for the third search query with respect to the current query model. One or more second generation probabilities are calculated for the third search query with respect to the historical query models. A ratio is calculated based on the first generation probability and the second generation probabilities. The third search query is identified as corresponding to an emerging event if the ratio satisfies a predetermined threshold requirement. | 2010-12-02 |
20100306236 | Data Policy Management System and Method for Managing Data - A method for managing data includes identifying nodes of an archiving file system executing on one or more computers that have been updated, acquiring time ordered node state change events within the archiving file system, storing the node state change events, and reading the stored node state change events. The method further includes acquiring current information contained within the nodes that has been updated, updating data contained within a database system executing on the one or more computers to reflect the acquired information, querying the database system, and enforcing data policies upon the archiving file system based on the results of the query. | 2010-12-02 |
20100306237 | HIDING SEARCH BOX BASED ON SEARCH PROVIDER SETTINGS - The display of a search box within a toolbar is controlled based on the search provider settings of search box native to an application or operating system, such as a search box natively provider by a web browser. The search box is maintained within the toolbar when the search provider for the native search box differs from the toolbar search provider. The search box may be removed or “hidden” from the toolbar when the search provider for the native search box is the same as the toolbar search provider. | 2010-12-02 |
20100306238 | PARALLEL SEGMENTED INDEX SUPPORTING INCREMENTAL DOCUMENT AND TERM INDEXING - Techniques are disclosed for generating an index that supports both incremental document indexing and incremental term indexing. Documents and search terms may be received for which an index is to be generated. From this information, an index may be generated, partitioned in a first dimension by documents to create master segments and in a second dimension by search terms to create slave segments. A request to update the index to include a new document or a new search term may be received. The new document or new search term may be added to the index without modifying the entire index. Further, document identifiers may be synchronized across all segments. Synchronization refers to maintaining consistency of document identifiers across segments, despite renumbering of document identifiers during certain operations such as merging segments. | 2010-12-02 |
20100306239 | ASSOCIATING WORKS WITH UNIQUE IDENTIFIERS - Multiple attempts can be made to match received information associated with a work and one of multiple identifiers stored in a database. Each of the identifiers in the database is uniquely associated with one of a plurality of specific works. A first search can be made to determine if an identifier in the received information includes an identifier that matches one of identifiers stored in the database. If the identifier in the received information does not match any of the identifiers in the database, a second matching attempt can be made to determine if the received attributes match attributes of a work associated with one of the identifiers in the database. Based on the results of the matching, various actions can be taken to associate or assign one of the unique identifiers with the work related to the received information. | 2010-12-02 |
20100306240 | INSTANCE SPACE BASED MANAGEMENT PACK INFRASTRUCTURE - Techniques are described herein for using a management pack to define a structure of management packs. A management pack is business logic expressed in terms of an extensible language, such as extensible markup language (XML). Instances of entities that are described by a management pack are stored in an instance space that is defined by the management pack. An entity can be a computer, software program, employee, customer, management pack, management pack element, or anything else in the system that an administrator may wish to describe. A management pack that defines the structure of management packs is referred to as a “management pack management pack” (MPMP). Accordingly, management packs (including MPMPs) having a structure that is defined by a MPMP are stored in an instance space that is defined by the MPMP. The instance space that is defined by the MPMP is materialized in a database. | 2010-12-02 |
20100306241 | INTELLIGENT FEED SYSTEM FOR CREATING A REPRESENTATION OF A WEB PAGE FOR A SEARCH ENGINE - The invention provides a method of providing information over a network, including transmitting a representation of a web page or a link to the search engine for the search engine database, receiving at least one tracking signal indicative of use at the client location of at least some of the web pages in the list, and transmitting a second list of web pages to the search engine, the second list being a subset of web pages, the subset being selected based on the tracking signals. | 2010-12-02 |
20100306242 | Methods and Systems for Annotation of Digital Informatin - Methods and system for performing annotation of digital information are provided. One method includes searching for items of interest using a search engine. Once the URIs associated with the item of interest are identified, a plurality of attributes are provided that may be associated with each URI. A user may provide the values for the attributes or the system may suggest values for the attributes based on information associated with each URI. Once the attributes and values are assigned, the annotated URI along with the attributes and values is stored. Another method provides for sharing of the annotated information. A user may communicate annotated information to an external storage system for sharing with other users having access to the external storage system. Another method provides for automatic updates of the annotation entries by periodically fetching the digital information associated with each URI and updating the values associated with each attribute. | 2010-12-02 |
20100306243 | ELECTRONIC DEVICE FOR DISPLAYING SHORTCUT KEYS AND METHOD THEREOF - An electronic device for displaying shortcut keys, comprising: a storage unit; a first display unit; a second display unit; and a CPU (central processing unit) comprising: a detecting module configured for detecting whether there is an running application, and displaying the running application on the first display unit; a shortcut key acquiring module configured for acquiring a setting information of shortcut keys and storing the acquired setting information of the shortcut keys in the storage unit if there is an running application; and a display module configured for displaying the acquired setting information of the shortcut keys on the second display unit. | 2010-12-02 |
20100306244 | Method of the Combination of Patent Applicants or Patent Inventors in a Patent Analysis - A method of the combination of patent applicants or patent inventors in a patent analysis comprises following steps: (a) creating a name database, which comprises a plurality of applicants' or inventors' name sheets and each of the name sheets includes different names of one applicant or one inventor; wherein each of the name sheets has a corresponding sheet title; (b) creating a thematic patent database of specific technical theme through patent searching among the patent literatures of all the countries in the world; (c) searching in the thematic patent database by using said sheet title as the search field, and matching applicants' or inventors' names in said thematic patent database with names in said name sheet, then marking the matched patents; and (d) combining names of applicants or inventors in said marked patents. The use of this method can improve the combination efficiency of patent applicants or patent inventors greatly. | 2010-12-02 |
20100306245 | NAVIGATION SYSTEM - A navigation system is provided with setting screen displaying means for displaying a setting screen for setting information related to a plurality of search condition parameters; parameter obtaining means for collectively obtaining the information related to the plurality of search condition parameters based on a single input operation that is made via an input portion; and information searching means for searching for preferred information based on the information related to the plurality of search condition parameters obtained by the parameter obtaining means. | 2010-12-02 |
20100306246 | Method and System for Managing User Information in Instant Messaging Systems - The present disclosure discloses a method for managing user information in an instant messaging system in order to address the problems of increasing system workload, increasing network overhead and deteriorated system performance in existing technologies due to frequent access of user information management server or servers when user information is searched. According to a disclosed method, an access server obtains and stores information of contacts of a logged-in user; the access server notifies user information of the logged-in user to other access servers; the access servers that receive the notification store the user information of the logged-in user upon determining that contact(s) is/are found locally therein; and when the access server needs to obtain the information of the contacts of the user, the access server performs a search either locally or in other access servers. Furthermore, a communication system is also provided. The disclosed method and system are believed to result in greatly reduced frequency of searching user information in the user information management servers, reduced workload of the user information management servers, improved performance of searching user information and reduced network overhead of the system. | 2010-12-02 |
20100306247 | Apparatus, Method and System for Accessing Digital Rights Management Information - Digital rights management (DRM) and content distribution systems need to reference unique works of autorship to facilitate distribution, access control, and usage tracking and reporting of the works. The apparatus, method, and system disclosed herein is a DRM and content distribution system that uses the digital object identifier (DOI) as a unique identifier for the works of authorship that are the subject of transactions within the system and that travel with the instantiations of the works of authorship. A method of accessing a digital work from a computer is disclosed. The method associates at least one usage right with the digital work to create a protected digital work. The usage rights include displaying the digital work, copying the digital work, fowarding the digital work to another computer, or printing the digital work. The method selects a unique identifier such as a DOI for the digital work and stores the protected digital work and the unique identifier in a directory such as a library of digital works of autorship or a portion of a peer-to-peer network. The method issues a query from the computer to the directory to generate a result set that includes the unique identifier. The method uses the unique identifier to retrieve the protected digital work from the directory. Furthermore, a method is taught to employ multiple resolution capabilities for the super-distribution of DOI referenced content via E-mail and otherwise. | 2010-12-02 |
20100306248 | DOCUMENT PROCESSING METHOD AND SYSTEM - A method and system for expanding a document set as a search data source in the field of business related search. The present invention provides a method of expanding a seed document in a seed document set. The method includes identifying one or more entity words of the seed document; identifying one or more topic words identifying one or more topic words related to the based entity word in the seed document where the entity word is located; forming an entity word-topic word pair from each identified topic word and the entity word on the basis of which each topic word is identified; and obtaining one or more expanded documents through web by taking the entity word and topic word in the each entity word-topic word pair as key words at the same time. A system for executing the above method is also provided. | 2010-12-02 |
20100306249 | SOCIAL NETWORK SYSTEMS AND METHODS - Embodiments of computer-implemented methods and systems are described, including: in a computer network system, providing a user page region viewable by a user; providing to the user, in the user page region, indicators of each of three categories, the categories consisting essentially of: (i) what the user has, (ii) what the user wants, and (c) what the user has thought or is thinking; wherein the user page region accepts a post by the user; after the post by the user, displaying the post in a group page region, viewable by a set of one of more persons other than the user, the set of persons being separated from the user at locations on a network; before the displaying, requiring the user to select one of the three categories to be associated with the post; and displaying the category selected by the user, with the post, in the group page region. | 2010-12-02 |
20100306250 | DATA PROCESSING APPARATUS, DATA TRANSMISSION METHOD, AND COMPUTER-READABLE RECORDING MEDIUM FOR DATA TRANSMISSION - A data processing apparatus includes plural transmission units that transmits transmission data to one or more users, a storage part that stores a destination group table therein, the destination group table including a data structure in which data of one or more of the plural transmission units are associated with user data of the one or more users, a reception part that receives selection data indicating selection of the one or more users, receives designation data indicating designation of one or more of the plural transmission units, and extracts the user data from the storage part according to the selection data and the designation data, and a transmission request part that requests transmission of the transmission data to at least one of the plural transmission units according to the user data extracted by the reception part. | 2010-12-02 |
20100306251 | System and Related Method for Digital Attitude Mapping - A system and related method for the electronic processing of text onto a two-dimensional coordinate system to analyze the attitudinal mindset associated with the text. The system provides a report of the results of the analysis. The system and related method may also be employed to generate text based on a desired attitudinal mindset to impart. The system includes a computer system embodying functions that enable a user to analyze the text. The system includes one or more functions to parse attitudinal words and functional words and associate two-dimensional coordinates with the attitudinal words. The system further includes one or more functions for mapping the associated two-dimensional coordinates to show the geographic locations of each attitudinal word of the text in relation to each other attitudinal word of the text. The system delaminates attitudinal words into attitudinal equivalence and category and enables the generation of a report of the mindset associated with the analyzed text. | 2010-12-02 |
20100306252 | Efficient Use of Peer Cache Space In Large Scale File Distributions - A mechanism for providing efficient use of peer cache space in large scale file distributions. A peer computer receives a download plan for a requested file. The download plan specifies a number of peer servers where the file is stored, a minimum number of peer servers required to store the file, and a saturation level for the file in the zone. When the peer computer downloads the file from one or more peer servers listed in the download plan, the peer computer determines whether the file is required to be cached at the peer computer by comparing the minimum number of peer servers in the plan required to store the file against the number of peer servers listed in the plan. If the minimum number required to store the file is greater the number of peer servers listed in the plan, the peer computer caches the file. | 2010-12-02 |
20100306253 | Tiered Managed Storage Services - Systems and methods for managed access to tiered storage are disclosed. One such system comprises a plurality of storage systems and a tier manager. Each storage system implements a tier selected from the group of online and other than online. The tier manager is configured to ensure that a specified file is available on a specified tier, responsive to a client request. | 2010-12-02 |
20100306254 | SYSTEMS AND METHODS FOR OBJECT-BASED MODELING USING COMPOSITE MODEL OBJECT HAVING INDEPENDENTLY UPDATABLE COMPONENT OBJECTS - Embodiments relate to systems and methods for object-based modeling using a composite model object having independently updatable component objects. A modeling client can host modeling logic and an application programming interface (API) to create, access, manipulate, and import/export modeling objects used in modeling applications, such as engineering, medical, financial, and other modeling platforms. In aspects, the source data accepted into the modeling client can include consumer or business-level applications, whose spreadsheet, database or other content can be extracted and encapsulated in extensible markup language (XML) or other object-oriented format. Various model objects can be extracted from source data, and aggregated into a composite model object encapsulating the underlying set of component model objects. In aspects, each of the component model objects can be accessed, updated, and stored independently of the other constituent objects. The modeling client can exchange composite or other modeling objects with external platforms on a programmatic basis. | 2010-12-02 |
20100306255 | SYSTEMS AND METHODS FOR EXTRACTING DATA CELL TRANSFORMABLE TO MODEL OBJECT - Embodiments relate to systems and methods for extracting a data cell transformable to a model object. Aspects relate to object-based modeling using modeling objects that can be extracted from spreadsheet cells, database entries, or other sources. A modeling client can host modeling logic and an application programming interface (API) to create, access, manipulate, and import/export modeling objects used in modeling applications, such as engineering, medical, financial, and other modeling platforms. In aspects, the source data can be accepted into the modeling client from consumer or business-level applications, whose cell, database, or other data content can be extracted and encapsulated in object-oriented format, such as extensible markup language (XML) format. Modeling operations can therefore be performed on or incorporate data that was not originally strictly configured for object-based modeling applications. The extracted model object can also be exchanged with other applications or platforms. | 2010-12-02 |
20100306256 | Distributed Database Write Caching With Limited Durability - A distributed database system includes a central data server, and a plurality of application nodes for receiving connections from clients. Each application node is in communication with the central data server, and has a data cache which maintains local copies of recently used data items. The central data server keeps track of which data items are stored in each data cache and makes callback requests to the data caches to request the return of data items that are needed elsewhere. Data items, including modified data items, are cached locally at a local application node so long as the locally cached data items are only being accessed by the local application node. The local application node handles transactions and stores changes to the data items. The local application node forwards changes, in order by transaction, to the central data server to insure consistency, thereby providing limited durability write caching. | 2010-12-02 |
20100306257 | CONTENT IDENTIFICATION AND MANAGEMENT IN CONTENT DISTRIBUTION NETWORKS - Peer-to-peer file sharing and uploading of content to content server systems is increasing in popularity on the Internet. Content signals can be edited and combined with other content programming, and or altered in ways that make it difficult to identify using conventional techniques. Content identification based on content fingerprints is used to retrieve related metadata, which in turn, is used to manage use of the content signal in content distribution systems. The content signal is uploaded to a computer within a network of computers in the content distribution system. A content fingerprint of the content signal is computed and sent to a database to look up related metadata. The metadata is received and used to manage use of the content signal in the content distribution system based on the metadata. This can include blocking uploading or rendering of audio or video, controlling streaming of audio or video, linking to a licensing server, which provides usage control rules, etc. | 2010-12-02 |
20100306258 | LIGHTWEIGHT DIRECTORY ACCESS PROTOCOL CLIENT - A method, apparatus and computer program product for updating data for an application, including invoking a client application; identifying an application having data to be updated; and sending a query to a directory server via the client application, the query identifying the data. | 2010-12-02 |
20100306259 | MENU SEARCHING OF A HIERARCHICAL MENU STRUCTURE - A menu search system allows a user to search through a menu structure, rather than only navigate hierarchically through the menu structure. When a user selects a menu search mode, the menu search system allows the user to enter text and, as the text is entered, searches the menu hierarchy for menu items with names that match the text. The menu search system then displays the matching menu items so that the user can select a displayed menu item of interest. | 2010-12-02 |
20100306260 | NUMBER SEQUENCES DETECTION SYSTEMS AND METHODS - Numbered sequences detection includes (i) extracting one or more numbered item token patterns from a document comprising an ordered sequence of text units, each numbered item token pattern including an incremental portion and a fixed portion that matches at least one text unit of the document and (ii) identifying at least one numbered sequence in the document conforming with a matching numbered item token pattern of the extracted one or more numbered item token patterns. The identified at least one numbered sequence comprises an ordered sub-sequence of text units of the document that match the matching numbered item token pattern. The detection may further comprise determining that a second type of numbered sequence nests in the document between consecutive text units belonging to a numbered sequence of a first type, and optimizing one or more numbered sequences of the second type based on information provided by the determining. | 2010-12-02 |
20100306261 | Localized Gesture Aggregation - Systems, methods and computer readable media are disclosed for a localized gesture aggregation. In a system where user movement is captured by a capture device to provide gesture input to the system, demographic information regarding users as well as data corresponding to how those users respectively make various gestures is gathered. When a new user begins to use the system, his demographic information is analyzed to determine a most likely way that he will attempt to make or find it easy to make a given gesture. That most likely way is then used to process the new user's gesture input. | 2010-12-02 |
20100306262 | Extending Dynamic Matrices for Improved Setup Capability and Runtime Search Performance of Complex Business Rules - A mechanism by which rule attributes of varying types and numbers can be stored and searched in an efficient manner is provided by storing attribute values of each rule in a child table of a parent rule table. The child table is normalized and contains a foreign key pointing back to the parent rule table and has attribute-value pairs as table columns of the child table. Each rule is then represented by one row of the parent rule table and one or more corresponding rows of the child rule details table. A variable and unlimited number of attribute dimensions is supported among the rules, and search performance is improved through the use of database indexes on the rule details table attribute columns. Metadata representing the structure of the child rule details table will identify the data attributes for each dimension. | 2010-12-02 |
20100306263 | APPARATUSES AND METHODS FOR DETERMINISTIC PATTERN MATCHING - Apparatuses and methods to perform pattern matching are presented. In one embodiment, an apparatus comprises a memory to store a first pattern table comprising information indicative of whether a byte of input data matches a pattern and whether to ignore other matches of the pattern occur in remaining bytes of the input data. The apparatus further comprises one-byte match logic coupled to the memory, to determine, based on the information in the first pattern table, a one-byte match event with respect to the input data. The apparatus further comprises a control unit to filter the other matches of the pattern based on the information of the first pattern table. | 2010-12-02 |
20100306264 | OPTIMIZING PUBLISH/SUBSCRIBE MATCHING FOR NON-WILDCARDED TOPICS - A method, a system and a computer program product for matching a publication to at least one subscriber are disclosed. After receiving a publication request, a matching engine accesses a hash table to determine whether there is a non-wildcarded match corresponding to the publication request. If the matching engine finds the non-wildcarded match in the hash table, the matching engine omits validating a topic of the publication and provides the non-wildcarded match to the broker device without waiting for a result of searching a wildcarded match. Otherwise, the matching engine validates the topic of the publication. The matching engine also starts to search a wildcarded match in a wildcarded subscription data store. Upon finding the wildcarded match, the matching engine provides the wildcarded match to the broker device. The matching engine provides each result of the findings asynchronously to the broker device. | 2010-12-02 |
20100306265 | DATA AND EVENT MANAGEMENT SYSTEM AND METHOD - A management system and method for facilitating the management of data and events. The system includes a server, a processor, and a feed in communication with the server. The feed provides real-time information relating to a predetermined group of people and/or facilities. The processor is operable to process the information delivered by the feed and update a first database. The system also includes a computer processing unit (CPU), an interface and a document associating circuit. The CPU processes the server and the second database so as to provide information onto a display. The document associating circuit is operable to process the first and second databases so as to associate documents stored in the first and second databases with each event displayed on the calendar and deliver the associated document with a selected event. | 2010-12-02 |
20100306266 | METHOD AND APPARATUS FOR DETERMINING HOW TO TRANSFORM APPLICATIONS INTO TRANSACTIONAL APPLICATIONS - A computing device monitors an application that includes at least one object over a time period. The computing device identifies a usage pattern of the at least one object over the time period. The computing device recommends, based on the usage pattern, at least one of a) that the at least one object be converted to a transactional object and b) a locking strategy for the at least one object. | 2010-12-02 |
20100306267 | SYSTEMS AND METHODS FOR DATA UPLOAD AND DOWNLOAD - Systems and methods which provide a hybrid network based solution for digital data file backup are shown. Embodiments utilize a transport mass storage system to provide transmission of digital data files between user equipment and a network based mass storage system. A manifest may be used to manage transporting and/or storage of digital data files. User equipment may then access the digital data files stored to the network mass storage system for various purposes using a network link. Subsequent, incremental backups and other transfers of relatively small amounts of digital data files are preferably accomplished using a network link for the transfer. | 2010-12-02 |
20100306268 | SYSTEM AND METHOD FOR IMPLEMENTING EFFECTIVE DATE CONSTRAINTS IN A ROLE HIERARCHY - A system providing a method for implementing effective date constraints in a role hierarchy is described. In one embodiment, for example, the method comprises the steps of: storing data that represents a first effective date constraint on a role of a role hierarchy, the first effective date constraint having a start date and an end date; storing data in a database that represents a second effective date constraint on a grant of the role to a grantee, the second effective date constraint having a start date and an end date; storing data in a database that represents a third effective date constraint on the grantee, the third effective date constraint having a start date and an end date; and computing a net effective date constraint for the role by computing the intersection of the first effective date constraint, the second effective date constraint, and the third effective date constraint. | 2010-12-02 |
20100306269 | METHOD AND APPARATUS FOR LARGE SCALE DATA STORAGE - A logical apparatus and associated methods provide highly scalable and flexible data storage in a network of computers. The apparatus provides flexible organizational and access control mechanisms and a practical and efficient way to work with smaller portions of a data storage system at a given time to enable sparse population, caching, paging and related functions. A data structure, called a virtual container, comprises references to objects stored in a data storage system such that the same object can be visible from different virtual containers, if such virtual containers hold references to said object. Access controls further enhance the effectiveness of the methods and structures to enable multiple simultaneous organizational schemes and selective sharing of objects. Participating nodes provide access to objects stored on said nodes and their participating peer nodes, employing the data storage apparatus, such that balance in the network is achieved by data placement decisions that may combine common constraints and a node's individual self interest. | 2010-12-02 |
20100306270 | GENERATING A LOCAL COPY OF A VIRTUALIZED APPLICATION PACKAGE FROM A LOCAL INSTALLATION - Technologies are described herein for generating a local copy of a virtualized application package from a local installation. An empty copy of the virtualized application package is generated from a skeleton file. The skeleton file contains a hash value computed from each data block in the virtualized application package. The component files of the application are retrieved from a virtual file system representation of the location installation of the application, and each component file is divided into one or more blocks of data. A hash value is computed for each block of data and the skeleton file is searched for a hash value corresponding to a data block of the virtualized application file that matches the hash value computed for each block of data. If a match is found, the block of data is copied to the corresponding data block of the empty copy of the virtualized application package. | 2010-12-02 |
20100306271 | Query Networks Evaluation System and Method - A query network is disclosed, comprising sets of nodes and edges connecting pairs of nodes. The nodes of the query network are associated with edge-defining queries. A method is taught for fully evaluating such a query network. A language is further disclosed for constructing queries. The query network may be used to model a social network, a professional network or the like. | 2010-12-02 |
20100306272 | SYSTEMS AND METHODS FOR OBJECT-BASED MODELING USING HIERARCHICAL MODEL OBJECTS - Embodiments relate to systems and methods for object-based modeling using hierarchical model objects. A modeling client can host modeling logic and an application programming interface (API) to create, access, manipulate, and import/export modeling objects used in modeling applications, such as engineering, medical, financial, and other modeling platforms. In aspects, the source data accepted into the modeling client can include consumer or business-level applications, whose spreadsheet, database or other content can be extracted and encapsulated in extensible markup language (XML) or other object-oriented format. Various model objects can be extracted from source data, and aggregated into a hierarchical model object encapsulating and preserving the underlying object layers. In aspects, one or more of the model object layers can functionally combine at least two other layers, to relate levels of data in hierarchical fashion. The modeling client can exchange composite or other modeling objects with external platforms on a programmatic basis. | 2010-12-02 |
20100306273 | APPARATUS, SYSTEM, AND METHOD FOR EFFICIENT CONTENT INDEXING OF STREAMING XML DOCUMENT CONTENT - An apparatus, system, and method are disclosed for efficient content indexing of streaming XML document content. A forest generator generates an XML pattern forest from a set of structured index path expressions, the XML pattern forest includes trees and twigs generated from structured index path expressions uniquely associated with a namespace indicator for an XML node. The XML node is identified in a stream of at least one XML document. A comparison module compares the XML node to nodes of trees and twigs of the XML pattern forest. A determination module determines a match between the XML node and an index node in one of a tree and a twig of the XML pattern forest. The index node has a path from an ancestor node to the index node that matches the axis steps of at least one of the structured index path expressions. A storage module stores an index entry for the XML node in response to the determined match, the index entry includes a XML document identifier, an XML node name, a namespace indicator for the XML node, and XML node content. | 2010-12-02 |
20100306274 | Extending Configuration Management Databases Using Generic Datatypes - A computer implemented method, data processing system, and computer program product for allowing users with minimal database skills to produce efficient, extended configuration management databases. Input is received from a user to extend a configuration management database, wherein the input includes a generic data type. The generic data type is mapped to a database data type of the configuration management database. An SQL statement is then generated to create the database data type in the configuration management database. Responsive to a successful execution of the SQL statement, the tables in the configuration management database are updated with the database data type to reduce a number of tables created for the database data type. | 2010-12-02 |
20100306275 | CONFIGURATION MANAGEMENT VISUALIZATION - Embodiments herein include systems, methods, software, and data structures to generate and render visualizations of configuration items (CIs) represented in a Configuration Management Database (CMDB). One embodiment includes receiving a request for a CI graph from a client including a focus CI identifier represented in a CMDB. The focus CI may be used to retrieve data of related CIs, the data including CI identifiers. A process is then executed for each retrieved CI identifier to retrieve CI data as a function of the received CI identifier and to build a node XML and an edge XML representation of relations between the CIs. This method also includes aggregating the node and edge XML representations into a single XML document and then translating the document into a markup language document capable of being rendered in a graphical user interface. The markup language document is then transmitted to the requestor. | 2010-12-02 |
20100306276 | DYNAMIC GROUP LABELS - Disclosed are methods and apparatus for managing dynamic groups. In one embodiment, a method of creating or modifying a group of users is disclosed. A request is received from a first user to create or modify a current group. One or more rules are also received from the first user for specifying members of the current group based on user information that was or will be collected for a plurality of users. In one embodiment, the collected user information includes at least user presence information or user communication data. A membership policy for the current group is then retained based on the received one or more rules. The membership policy for the current group is accessibly usable so as to dynamically allow a selected set of users, who each have corresponding collected user information which meets the membership policy, to become members of the current group, wherein the selected set of users is changeable over time as different user information is collected over time. | 2010-12-02 |
20100306277 | XML DATA MODEL FOR REMOTE MANIPULATION OF DIRECTORY DATA - An XML data model and systems and methods for using the same are described herein that enable entities to interact with a remote directory service, such as an LDAP-style directory service, using industry standard Web services protocols that represent resources using XML, such as WS-Transfer and WS-Enumeration. | 2010-12-02 |
20100306278 | METHOD AND SYSTEM OF SPLITTING AND MERGING INFORMATION SPACES - An approach is provided for managing split and merge operations for information spaces with respect to their information content. | 2010-12-02 |
20100306279 | Methods and Apparatus for Propagating Functional Dependencies with Conditions - Methods and apparatus are provided for propagating functional dependencies with conditions. Propagation covers are computed using an SPC view of a dataset, wherein the SPC view comprises selection, projection and Cartesian product operations. Selection operations are processed to extract equivalence classes. Cartesian product operations are processed to obtain a renamed set of the plurality of conditional functional dependencies, that have attributes appearing in the SPC view. Domain constraints from the equivalence classes are applied to the renamed set to remove attributes not in the SPC view. Projection operations are processed using a reduction by resolution procedure to identify inferences that can be propagated to the SPC view from the conditional functional dependencies having attributes that do not appear in the SPC view. Domain constraints of the equivalence classes are converted to conditional functional dependencies; and a minimal cover of the SPC view is determined. | 2010-12-02 |
20100306280 | Swarm-Based Synchronization Over a Network of Object Stores - An object set may be redundantly stored by a set of computers, each configured to store a local representation of corresponding objects. When a computer changes the object set (e.g., by adding or altering an object), the updated object may be synchronized across the computers by iteratively forming and using an ad hoc swarm network from the neighbors of a node storing the updated object. This swarm network may operate cooperatively, where each node distributes object chunks to other nodes as quickly as possible, and may disregard concepts of competitive swarm networks such as fairness and cheating avoidance, which may not apply to cooperative swarming and might otherwise slow the propagation of the object. An alternative “ask” technique may be included to identify and recover missed object updates, and a computing environment host may be included as an authoritative object source and/or as an object store of last resort. | 2010-12-02 |
20100306281 | SYSTEMS AND METHODS FOR EXTRACTING DATABASE DIMENSIONS AS DATA MODELING OBJECT - Embodiments relate to systems and methods for extracting a model object from a multi-dimensional source database. A modeling client can host modeling logic and an application programming interface (API) to create, access, manipulate, and import/export modeling objects used in modeling applications, such as engineering, medical, financial, and other modeling platforms. In aspects, the source data accepted into the modeling client can include consumer or business-level applications, whose database or other content can be extracted and encapsulated in object-oriented format, such as extensible markup language (XML) format. The resulting model object can be pivoted along selected dimensions, or otherwise manipulated. The modeling client can exchange one or more modeling object directly with external platforms, such as mainframe modeling platforms, via the application programming interface (API) on a programmatic basis. Costs and maintenance savings over mainframe-based modeling tools can thereby be achieved, while providing greater power than consumer or business-level tools. | 2010-12-02 |
20100306282 | Hierarchial Classification - The hierarchical approach may start at the bottom of the hierarchy. As it moves up the hierarchy, knowledge from children and cousins is used to classify items at the parent. In addition, knowledge of improper classifications at a low level are raised to a higher level to create new rules to better identify mistaken classifications at a higher level. Once the top of the hierarchy is reached, a top down approach is used to further refine the classification of items. | 2010-12-02 |
20100306283 | INFORMATION OBJECT CREATION FOR A DISTRIBUTED COMPUTING SYSTEM - An endpoint stores information objects to a director, rather than to local storage, and stores links to information objects stored by the director. The devices may also automatically construct information objects from files upon creation of the files. An example endpoint device includes a processing unit configured to determine a file type for a file to be stored, wherein the file comprises an unstructured data object, and automatically append metadata to the file to create an information object based on the determined file type, wherein an information object comprises a structured data object having a structure that is consistent with a uniform structure for files as used by a director device, and a network interface configured to send the information object to the director device for storage, wherein the processing unit is configured to store a link to the information object stored by the director device. | 2010-12-02 |
20100306284 | File System and File System Converting Method - A file system converting method converts a first file system to a second file system. The first file system manages a storages apparatus via a file allocation table (FAT). The file system converting method includes formatting the FAT to divide the storage apparatus into a plurality of storage units, and establishing a storage unit index table to record information of the plurality of storage units. | 2010-12-02 |
20100306285 | Specifying a Parser Using a Properties File - A system for generating a parser and using the parser to parse a target file includes a target file description, an output format description, a Parser generator, a Parser, a target file, and a result object. The target file description and the output format description are included in one or more “properties files”, which are text files that include one or more name/value pairs (“properties”). The target file description and the output format description are input into the Parser generator, which outputs the Parser. The target file is input into the Parser, which outputs the result object. The target file description specifies one or more parsers and/or tokenizers that can be used to parse the target file. The parsers and/or tokenizers specified by the target file description are part of the generated Parser. These parsers and/or tokenizers make the Parser more flexible, which enables the Parser to parse semi-structured data. | 2010-12-02 |
20100306286 | DISTRIBUTED STEAM PROCESSING - A method and system for forming hybrid cluster to process log files are described. In example embodiments, a method configures a node to execute as a first slave node. The first slave node executes in a first operating environment. The method also adds the first slave node to a Hadoop cluster. The Hadoop cluster includes a second slave node that operates in a second and different operating environment. | 2010-12-02 |
20100306287 | Method and apparatus for global addressing of parcels of land - A method and apparatus for defining a globally-standardized system of addressing for parcels of land is disclosed. The system utilizes physical characteristics of land parcels to identify the unique address and location of said land parcels (herein also referred to as the NSE coordinates) in a global coordinate system. In a preferred embodiment, the geographical center of the land parcel is determined and used as the defining physical characteristic of the land parcel. That geographical center is mapped against the latitude and longitude system currently used as a standard to define positions on the Earth. This method provides an alternative to the various addressing conventions established by national, regional or local governmental entities. The method is adapted to execution on either a general purpose or special purpose computer system to transform physical characteristics of land parcels into useful address and location information and tangible display representations. | 2010-12-02 |
20100306288 | REBALANCING OPERATION USING A SOLID STATE MEMORY DEVICE - Systems and methods to manage database data are provided. A particular method includes automatically identifying a plurality of storage devices. The storage devices include a first device of a first type and a second device of a second type. The first type includes a solid state memory device. The method may further identify a high priority data set of the database. A rebalancing operation is conducted that includes moving the high priority data set to the solid state memory device and substantially evening distribution of other data of the database among the storage devices. | 2010-12-02 |
20100306289 | SORTABLE FLOATING POINT NUMBERS - The invention comprises methods for manipulating floating point numbers on a microprocessor where the numbers are sortable. That is, the numbers obey lexicographical ordering. Hence, the numbers may be quickly compared using bit-wise comparison functions such as memcmp( ). Conversion may result in a sortable floating point number in the form of a sign, leading bits of the exponent, and sets of digit triples in the form of declets (sets of 10 bits). In a variable-length version, numbers may be compressed by storing the number of trailing zero declets in lieu of storing the zero declets themselves. | 2010-12-02 |
20100306290 | METHOD AND APPARATUS FOR SPATIO-TEMPORAL COMPRESSIVE SENSING - A method and apparatus for spatio-temporal compressive sensing, which allows accurate reconstruction of missing values in any digital information represented in matrix or tensor form, is disclosed. The method of embodiments comprises three main components: (i) a method for finding sparse, low-rank approximations of the data of interest that account for spatial and temporal properties of the data, (ii) a method for finding a refined approximation that better satisfies the measurement constraints while staying close to the low-rank approximations obtained by SRMF, and (iii) a method for combining global and local interpolation. The approach of embodiments also provides methods to perform common data analysis tasks, such as tomography, prediction, and anomaly detection, in a unified fashion. | 2010-12-02 |
20100306291 | Barrel shifter - A data processing apparatus is described which comprises processing circuitry responsive to data processing instructions to execute data processing operations and a register file having a set of registers for storing data values for processing by the processing circuitry. The data processing apparatus comprises first shift circuitry which is arranged to receive a data value from the register file and is responsive to a first control signal indicating a first shift amount S | 2010-12-02 |
20100306292 | DSP Engine with Implicit Mixed Sign Operands - A processor may have at least one multiplier unit which can be controlled to operate in a signed, an unsigned, or a mixed sign mode; a multiplier unit mode decoder coupled with the multiplier unit which receives location information of a first and second operands, wherein the multiplier mode decoder controls the multiplier unit when in the mixed sign mode depending on the location information to operate in a signed mode, an unsigned mode, or a combined signed/unsigned mode. | 2010-12-02 |
20100306293 | Galois Field Multiplier - A Galois field multiplier is provided, comprising a multiplication circuit for inputting two m bits binary multiplicators and outputting their product, wherein m is an integral power of 2, and the output of said multiplication circuit is consisted of a high bits portion output and a low bits portion output; a memory for storing a Galois field multiplication coefficient array calculated from a selected Galois field primitive polynomial; a first module for performing operation on the output of said multiplication circuit and the Galois field multiplication coefficient array stored in said memory to obtain the product of the two m bits binary multiplicators over Galois field. The Galois field multiplier has small hardware footprint, short response latency and strong universality. | 2010-12-02 |
20100306294 | Mechanism for String Hashing Using a Random Number Generator - In one embodiment, a mechanism for string hashing using a random number generator is disclosed. In one embodiment, a method includes dividing an input stream provided to a hashing module into a plurality of subsets of ‘n’ bits, entangling, by a mixer of the hashing module, one of the subsets of ‘n’ bits by a next sequential output of a pseudo-random number generator (PRNG), adding a product of the entangling to an accumulator of the hashing module, repeating the entangling and adding until all subsets of the plurality of subsets have been processed, and returning a value in the accumulator as a hash result value. | 2010-12-02 |
20100306295 | PROTECTION OF A PRIME NUMBER GENERATION FOR AN RSA ALGORITHM - A method for protecting a generation, by an electronic circuit, of at least one prime number by testing the prime character of successive candidate numbers, including: for each candidate number: the calculation of a reference number involving at least one first random number, and at least one primality test based on modular exponentiation calculations; and for a candidate number having successfully passed the primality test: a test of consistency between the candidate number and its reference number. | 2010-12-02 |
20100306296 | ADDING ENTROPY FOR IMPROVED RANDOM NUMBER GENERATION IN A COMPUTER SYSTEM - A parallel computer system adds entropy to improve the quality of random number generation by using parity errors as a source of entropy because parity errors are influenced by external forces such as cosmic ray bombardment, alpha particle emission, and other random or near-random events. By using parity errors and associated information to generate entropy, the quality of random number generation in a parallel computer system is increased. | 2010-12-02 |
20100306297 | FILTER - An infinite impulse response (IIR) filter is provided for receiving an input signal and outputting a filtered signal. The filter comprises feedback circuitry for feeding back said filtered signal, the feedback circuitry comprising a first delay element for delaying said filtered signal; and a sub-unit, for receiving said delayed filtered signal, for outputting a summed signal which is the difference between said delayed filtered signal and a further-delayed filtered signal, and for outputting a multiplied signal which is an inverted further-delayed filtered signal multiplied by a first filter coefficient. At least said input signal, said delayed filtered signal, said multiplied signal, and said summed signal are employed to generate said filtered signal. | 2010-12-02 |
20100306298 | DEVICE FOR DFT CALCULATION - A device to perform DFT calculations, for example in a GNSS receiver, including two banks of multipliers by constant integer value, the values representing real and imaginary part of twiddle factors in the DFT. A control unit selectively routes the data through the appropriate multipliers to obtain the desired DFT terms. Unused multipliers are tied to constant input values, in order to minimize dynamic power. | 2010-12-02 |
20100306299 | Circuits and Methods for Performing Exponentiation and Inversion of Finite Field Elements - An exponentiation circuit for computing an exponential power of a finite field element includes combinatory logic circuits that map input digits of a multi-digit field element P to output digits of an output multi-digit field element β | 2010-12-02 |
20100306300 | Sparse Matrix Padding - Zero elements are added to respective lines (e.g., rows/columns) of a sparse matrix. The added zero elements increase the number of elements in the respective lines to be a multiple of a predetermined even number “n” (e.g., 2, 4, 8, etc.), based upon an n-fold unrolling loop, where n=2, 4, 8, etc. By forming a sparse matrix having lines (e.g., rows or columns) that are multiples of the predetermined number “n”, the n-fold unrolling loop thereby acts upon a predetermined number of elements in respective iterations, avoiding unnecessarily costly operations (e.g., additional loop unrolling code) on remainder non-zero elements (e.g. remainder row/column elements not within an n-fold unrolling loop) left in a row or column after unrolling. This improves the efficiency of sparse matrix linear algebra solvers and key sparse linear algebra kernels (e.g., SPMV) thereby improving the overall performance of a computer (e.g., running an application). | 2010-12-02 |
20100306301 | ARITHMETIC PROCESSING UNIT THAT PERFORMS MULTIPLY AND MULTIPLY-ADD OPERATIONS WITH SATURATION AND METHOD THEREFOR - Sum and carry signals are formed representing a product of a first and a second operand. A bias signal is formed having a value determined by a sign of a product of the first and the second operand. An output signal is provided based on an addition of the sum signal, the carry signal, a sign-extended addend, and the bias signal. A portion of the output signal, a saturated minimum value, or a saturated maximum value, is selected as a final result based on the sign of the product and a sign of the output signal. | 2010-12-02 |
20100306302 | TECHNIQUE FOR DETERMINING IF A LOGICAL SUM OF A FIRST OPERAND AND A SECOND OPERAND IS THE SAME AS A THIRD OPERAND - A system is used to determine if a sum of a first operand and a second operand is the same as a third operand wherein a comparison to the third operand is of variable length. This is particularly useful in a content addressable memory (CAM) where the likelihood of hit is commonly improved over a set associative cache and allows for the CAM to identify different things. For example, an entry can be one length to identify a page of a memory and another entry be a different length to identify a page of memory. This is better understood by reference to the following description and the drawings. | 2010-12-02 |
20100306303 | DISTRIBUTED STORAGE SYSTEM, CONNECTION INFORMATION NOTIFYING METHOD, AND RECORDING MEDIUM IN WHICH DISTRIBUTED STORAGE PROGRAM IS RECORDED - A distributed storage system that includes: a plurality of node apparatuses connected to a plurality of different networks through a high order apparatus group or a low order apparatus group, the distributed storage system comprising: a first node apparatus that includes: a first storage unit which stores connection relationship information on the high order apparatus group and the low order apparatus group connected through the network; and a second node apparatus that includes: an acquisition unit which acquires first connection information, which indicates the high order apparatus group or the low order apparatus group that is a connection destination of the node apparatus, from the first node apparatus based on location information indicating locations of the plurality of node apparatuses; and a transmission unit which transmits the first connection information acquired by the acquisition unit to any of the plurality of node apparatuses included in the distributed storage system. | 2010-12-02 |
20100306304 | MECHANISM FOR APPLICATION MOBILITY IN A CELL SITE-BASED CONTENT DISTRIBUTION NETWORK - A method in an electronic device provides a mechanism for maintaining application mobility in a communication network, such as a content distribution network. In one exemplary embodiment, a user device transitions from a source content server in a first access network of the communication network to a destination content server in a second access network of the communication network. The source content server hands off responsibility for serving the content to the destination content server. In some embodiments, a tunnel is created between the source content server and the destination content server. | 2010-12-02 |
20100306305 | SYSTEMS AND METHODS FOR PROVIDING A COMPLETE VIEW OF LARGE COMPUTING NETWORKS - The management tool can determine and store all information that is relevant to the computing systems in the network. The management tool can generate and provide reports that are customizable by a requester. The management tool can receive a request to generate a report which specifies the information relevant to the computing systems to be included in the report. The management tool can search the stored information and generate the report with the stored information that matches the request. The reports can include network topology maps based on the request and geographic maps based on the request. | 2010-12-02 |