12th week of 2011 patent applcation highlights part 45 |
Patent application number | Title | Published |
20110071974 | PROPERTY EXTRACTION APPARATUS AND METHOD - According to one embodiment, a property extraction apparatus includes a state transition machine conversion unit, storage unit, state transition machine contraction unit, and property conversion unit. The state transition machine conversion unit converts an input property into a state transition machine configured by a plurality of transition functions expressed using a plurality of transition labels. The storage unit stores contraction rules that allow to remove a non-input transition. The state transition machine contraction unit contracts the state transition machine by converting a transition label corresponding to a signal to be ignored into a non-input transition in the state transition machine in accordance with contraction instruction information which represents the signal to be ignored, and rewriting the transition functions by applying the contraction rules that allow to remove the non-input transition. The property conversion unit which converts the state transition machine after the contraction processing into an output property. | 2011-03-24 |
20110071975 | Deriving a Hierarchical Event Based Database Having Action Triggers Based on Inferred Probabilities - Inferring a probability of a first inference absent from a database at which a query regarding the inference is received. The query is used as a frame of reference for the search. The database returns a probability of the correctness of the first inference based on the query and on the data. An action trigger is executed responsive to at least one of a) the probability of the first inference exceeding a first pre-selected value, b) a significance of the inference exceeding a second pre-selected value, c) a rate of change in the probability of the first inference exceeding a third pre-selected value, d) an amount of change in the probability of the first inference exceeding a fourth pre-selected value, and e) combinations thereof. At least one of the probability of the first inference and the action trigger is stored in the database. | 2011-03-24 |
20110071976 | RETAIL AUTOMOTIVE AFTERMARKET PARTS ASSORTMENT PLANNING - Identifying parts for an assortment. Receiving data characterizing: storage capacity by part category, parts in the category, rules applicable to the category. Assembling rule sets requiring compliance with each rule for a part to be a rule set group member. Receiving data prioritizing rule sets. Beginning with highest priority rule set, proceeding by order of rule set priority, determining if each part is rule set group member. For parts not a member of the rule set group, determining if each of those parts is a member of the next highest priority rule set group. Receiving data for prioritizing parts in a rule set group. Allocating parts to the assortment beginning with the highest prioritized part in the highest prioritized rule set group, and continuing in order of part priority within a rule set group, then continuing through subsequently prioritized rule set groups until inventory storage capacity is reached. | 2011-03-24 |
20110071977 | SEGMENTED GRAPHICAL REPRESENTATIONS FOR RECOMMENDING ELEMENTS - Systems, methods and machine-readable media are disclosed for providing segmented graphical representations of elements, such as songs, videos, pictures, graphics, or address book contacts. In some embodiments, an electronic device may identify remote and/or local elements based on a seed element and may display a segmented graphical representation of the seed element (e.g., a tiled album cover). At least one of the segments may be associated with one or more of the identified elements. In response to receiving a user selection of a segment, the electronic device may perform any of a number of suitable actions based on the associated elements. For example, for remotely stored media elements, the electronic device can retrieve and play a preview of the media elements from a server. | 2011-03-24 |
20110071978 | System, Method, and Computer-Readable Medium for Plagiarism Detection - A system, method, and computer-readable medium for detecting plagiarism in a set of constructed responses by accessing and pre-processing the set of constructed responses to facilitate the pairing and comparing of the constructed responses. The similarity value generated from the comparison of a pair of constructed responses serves as an indicator of possible plagiarism. | 2011-03-24 |
20110071979 | Data Governance Manager for Master Data Management Hubs - Improved data governance solutions to enterprise-level master data storage hubs are provided by implementing data governance functionality across the operational systems, analytical systems, and master data hubs of an enterprise. Data governance functionality is provided across the systems and hubs of an enterprise by providing visibility into the operational data, analytical data, and master data of an enterprise, by providing visibility into the data quality measuring processes that have been executed on the operational and analytical data, and by providing functionality for correcting fragmented, inconsistent, and erroneous information within operational and analytical data. | 2011-03-24 |
20110071980 | PERFORMANCE IMPROVEMENT OF A CAPACITY OPTIMIZED STORAGE SYSTEM INCLUDING A DETERMINER - A system for storing data comprises a performance storage unit and a performance segment storage unit. The system further comprises a determiner. The determiner determines whether a requested data is stored in the performance storage unit. The determiner determines whether the requested data is stored in the performance segment storage unit in the event that the requested data is not stored in the performance storage unit. | 2011-03-24 |
20110071981 | AUTOMATED INTEGRATED HIGH AVAILABILITY OF THE IN-MEMORY DATABASE CACHE AND THE BACKEND ENTERPRISE DATABASE - A cluster manager is configured to manage a plurality of copies of a mid-tier database as a mid-tier database cluster. The cluster manager may concurrently manage a backend database system. The cluster manager is configured to monitor for and react to failures of mid-tier database nodes. The cluster manager may react to a mid-tier database failure by, for example, assigning a new active node, creating a new standby node, creating new copies of the mid-tier databases, implementing new replication or backup schemes, reassigning the node's virtual address to another node, or relocating applications that were directly linked to the mid-tier database to another host. Each node or an associated agent may configure the cluster manager to behave in this fashion during initialization, based on common cluster configuration information. Each copy of the mid-tier database may be, for example, a memory resident database. Thus, a node must reload the entire database into memory to recover a copy of the database. | 2011-03-24 |
20110071982 | Offline Restructuring of DEDB Databases - An IMS DEDB database restructure operation creates an empty offline DEDB having the desired structure. The offline database is populated with data from a source (online) database while keeping the source database online (i.e., available for access and update operations). Updates to the source database made during this process are selectively processed in parallel with the offline DEDB load operation. When the contents of the offline database is substantially the same as the source or online database, the source database is taken offline, final updates to the offline database are applied whereafter the offline database is brought online, thereby replacing the source database. It is significant to note that updates occurring to the source or online DEDB are applied to the offline DEDB. | 2011-03-24 |
20110071983 | SERVER IMAGE MIGRATION - A system includes a first site having a first server and a first storage system, a second site including a second server and a second storage system, and a third site coupled to the first and second sites, the third site having gold images. A method of migrating a virtual server image comprises storing a first gold image at the first site; storing a second gold image at the second site; creating a first snapshot volume at the first site based on the first gold image; sending the first gold image ID, update data of the first gold image, and address information for the update data, from the first site to the second site; creating a second snapshot volume at the second site based on the second gold image corresponding to the first gold image ID; allocating storage for storing the update data at the second site with reference to the address information; and storing the update data in the allocated storage. | 2011-03-24 |
20110071984 | Area-Specific Reload of Database - A hierarchical database stores data for the database in a plurality of areas. A disclosed technique allows reorganization of one or more areas of the database without stopping the entire database. The areas to be reorganized are first stopped, then the areas are unloaded, reorganized, and reloaded, before restarting the reorganized areas. In-memory control blocks for the areas are updated to indicate to the database software that the areas have been reorganized, without stopping the entire database. | 2011-03-24 |
20110071985 | DETERMINING COMPONENT USAGE FOR DATABASES - Determinations are made regarding which database components are installed with a database installation. A recovery manual generator accesses system recovery data to generate a system recovery manual based on the system recovery data. A database feature auditor determines, based in part on the system recovery data, which database features are installed at database installations, which may be at multiple database sites. | 2011-03-24 |
20110071986 | Method for mass-deleting data records of a database system - The present invention concerns a method for mass-deleting a plurality of data records ( | 2011-03-24 |
20110071987 | FILE HANDLING FOR NAMING CONFLICTS - A file operations engine is provided that manages many user interactions with their files via a computer system. The operation engine may provide a user with the option to keep both files that have a file name conflict. It may further permit the user to rename a file involved with a file name conflict. The operations engine may also automatically rename one of the files of a file name conflict by appending a character to a root of the filename. The character may include the lowest integer available for the root in a destination for the files. The operations engine may provide the option to keep both files as part of a pre-calculation of potential errors for a requested operation. The operations engine may place file name conflicts in an error queue and permit the user to select an option to keep both files after the conflict is encountered. | 2011-03-24 |
20110071988 | DATA REVISION SYNCHRONIZATION IN A DISPERSED STORAGE NETWORK - A method begins by a processing module determining dispersed storage (DS) units that are storing a set of encoded data slices associated with a data segment and sending a revision level check request message to each of the DS units. The method continues with the processing module receiving revision level check response messages from at least some of the DS units within a time period to produce received revision level check response messages and determining concurrency of a revision level of the set of encoded data slices stored by the DS units based on the received revision level check response messages. The method continues with the processing module initiating a revision concurrency process when less than a threshold number of encoded data slices have concurrency of the revision level. | 2011-03-24 |
20110071989 | FILE AWARE BLOCK LEVEL DEDUPLICATION - A system provides file aware block level deduplication in a system having multiple clients connected to a storage subsystem over a network such as an Internet Protocol (IP) network. The system includes client components and storage subsystem components. Client components include a walker that traverses the namespace looking for files that meet the criteria for optimization, a file system daemon that rehydrates the files, and a filter driver that watches all operations going to the file system. Storage subsystem components include an optimizer resident on the nodes of the storage subsystem. The optimizer can use idle processor cycles to perform optimization. Sub-file compression can be performed at the storage subsystem. | 2011-03-24 |
20110071990 | Fast History Based Compression in a Pipelined Architecture - A novel and useful system and method of fast history compression in a pipelined architecture with both speculation and low-penalty misprediction recovery. The method of the present invention speculates that a current input byte does not continue an earlier string, but either starts a new string or represents a literal (no match). As previous bytes are checked if they start a string, the method of the present invention detects if speculation for the current byte is correct. If speculation is not correct, then various methods of recovery are employed, depending on the repeating string length. | 2011-03-24 |
20110071991 | SYSTEMS AND METHODS FOR GEOMETRIC DATA COMPRESSION AND ENCRYPTION - Systems, methods, and physical computer-readable storage media for performing geometric data compression and geometric data decompression and/or geometric data encryption and geometric data decryption. A virtual geometric compression object is generated within a computer system by defining a plurality of discrete elements arranged in a geometric shape and assigning one or more data bit values to each of the plurality of discrete elements. The virtual geometric compression object is used by the computer system to compress sequences of uncompressed data bits into compression definitions. A compression definition defines a path through the virtual geometric compression object corresponding to a sequence of uncompressed data bits. In a reverse manner, for data decompression, at least a portion of a virtual geometric compression object is generated and a compression definition is used to extract a corresponding sequence of uncompressed data bits from the portion of the virtual geometric compression object. | 2011-03-24 |
20110071992 | ATTRIBUTE RULE ENFORCER FOR A DIRECTORY - An attribute rule enforcer evaluates the attributes of a call to add, modify, or delete information in a directory, such as a lightweight directory access protocol (LDAP) directory. The attribute rule enforcer determines if the attributes of the call comply with predetermined rules governing the directory's content. The directory attribute rule enforcer may be located at the front end of the directory's access server, and intercepts calls to the directory access server. If the directory attribute rule enforcer determines that the attributes of a call complies with the rules governing the content of the directory, it will forward the call to the directory's access server for action. If, on the other hand, the directory attribute rule enforcer determines that the attributes of a call do not comply with the rules governing the content of the directory, the attribute rule enforcer will reject the call. Further, it may forward an appropriate error message to the source of the call. | 2011-03-24 |
20110071993 | METHOD AND SYSTEM FOR EFFICIENT ENFORCEMENT OF DERIVED LOCKS IN A HIERARCHICAL STRUCTURE - An improved approach is described for handling locks and locking for hierarchical structures. The approach efficiently captures lock information for hierarchical nodes as well as for the enforcement of derived locks. Support is provided for locking of leaf nodes as well as for locking of intermediate nodes. | 2011-03-24 |
20110071994 | METHOD AND SYSTEM TO SECURELY STORE DATA - Secure management of data is provided by selectively accessing multiple databases. The method and system includes substituting data of a predetermined field in a record with a key generated to correspond to the data, storing the record with the key in the predetermined field in a first database and associating the key with the data and storing the association in a second database. | 2011-03-24 |
20110071995 | SYSTEMS AND METHODS FOR IMPLEMENTING MULTI-APPLICATION TABS AND TAB SETS - A sharing model enables users to easily and conveniently create and share standard and custom database objects, and applications, among users or groups of users. The sharing model includes systems and methods that allow users to conveniently create and customize tabs and tab sets that define relationships between custom objects and fields, standard objects and fields, and applications. A tab visually represents a user interface into an element of an application or into a database object. Selection of a tab provides a user access to the object or element of the application represented by the tab. A tab set is a group of related tabs that work as a unit to provide application functionality. New tabs and tab sets may be defined and tab set views may be customized so that an end user can easily and conveniently switch between the various objects and application elements represented by the displayed tabs and tab set views. | 2011-03-24 |
20110071996 | SYSTEMS AND METHODS FOR IMPLEMENTING MULTI-APPLICATION TABS AND TAB SETS - A sharing model enables users to easily and conveniently create and share standard and custom database objects, and applications, among users or groups of users. The sharing model includes systems and methods that allow users to conveniently create and customize tabs and tab sets that define relationships between custom objects and fields, standard objects and fields, and applications. A tab visually represents a user interface into an element of an application or into a database object. Selection of a tab provides a user access to the object or element of the application represented by the tab. A tab set is a group of related tabs that work as a unit to provide application functionality. New tabs and tab sets may be defined and tab set views may be customized so that an end user can easily and conveniently switch between the various objects and application elements represented by the displayed tabs and tab set views. | 2011-03-24 |
20110071997 | SYSTEMS AND METHODS FOR DIRECTION OF COMMUNICATION TRAFFIC - An internet traffic redirection architecture is disclosed that allows for directing of various traffic to specified sites. The system and method allow a controller, such as an ISP, to benefit from unresolved IP Address requests and keyword and hotword queries by capturing this traffic and directing it to participating partners who provide content relevant and/or geographically relevant results. The system and method can decrease lost traffic, irrelevant keyword and hotword search results, and irrelevant redirection by web browsers resident on user's personal computers. | 2011-03-24 |
20110071998 | NETWORK SYSTEM AND COMMUNICATION DEVICE - A network system includes a first communication device, a second communication device and a keyword database. The first communication device includes a first input device and a first search device. The first input device allows a user to input a keyword. The first search device is capable of carrying out a first search process that includes sending the keyword input to the first input device to a search engine and receiving a search result. The keyword database stores the keyword used for the first search process. The second communication device is composed separately from the first communication device. The second communication device includes a keyword acquisition device and a second search device. The keyword acquisition device is capable of acquiring the keyword from the keyword database. The second search device is capable of carrying out a second search process that includes sending the keyword acquired by the keyword acquisition device to a search engine and receiving a search result. | 2011-03-24 |
20110071999 | SELECTING AND PRESENTING USER SEARCH RESULTS BASED ON USER INFORMATION - A search engine stores different taxonomies that each specifies categories and relationships between the categories. When the search engine receives a request having a search query, the search engine determines which taxonomy, if any, it should use to generate a search engine results page. The search engine bases this determination upon information provided to it in the request, in one embodiment. For example, the search engine might select a taxonomy based on the particular environment from which the search query originated. However, the search engine can select the taxonomy based on other information, such as a role of the user. Thus, a medical researcher and a financial analyst for a particular corporation could receive search engine results pages that were generated with appropriate taxonomies for each of them. | 2011-03-24 |
20110072000 | SYSTEMS AND METHODS FOR PROVIDING ADVANCED SEARCH RESULT PAGE CONTENT - The present invention provides a method and system for generating search results including receiving a search request and accessing a corpus of data relating to web content to determine relevant content. The method and system includes determining at least one semantic object in the search results set and generating an object filter on the basis of the at least one semantic object. The method and system further includes generating a search result output display for the presentation of at least a portion of the search result set and active data links for one or more of the semantic objects and toggling the search result output display to present at least a portion of a subset of the search results set in response to selection of a given active data link, the subset including content having semantic object associated therewith. | 2011-03-24 |
20110072001 | SYSTEMS AND METHODS FOR PROVIDING ADVANCED SEARCH RESULT PAGE CONTENT - The present invention provides a method and system for generating search results including receiving a search request including at least one search term and accessing a corpus of data to determine relevant content for inclusion in a search result set on the basis of the search request. The method and system includes determining a plurality of applications associated with the search request and generating a search result output display for the presentation of at least a portion of the search result set and at least a portion of the applications. | 2011-03-24 |
20110072002 | SYSTEM AND METHOD OF SEARCH VALIDATION - A method of validating results of a host search engine ( | 2011-03-24 |
20110072003 | METHOD AND APPARATUS FOR CREATING AND UTILIZING INFORMATION SIGNATURES - An approach is provided for efficiently searching information in an information space utilizing information signatures. A signature application receives queries over information sources. The signature application, for each of the queries, generates a polynomial by defining the each query against the information sources as input parameters in polynomial form. The signature application provides irreducible polynomials over a finite field of a degree of orthogonality by factoring polynomials generated from the queries. The signature application adjusts the degree of orthogonality of the irreducible polynomials to provide adjusted irreducible polynomials, each of which is a signature and corresponds to a signature fragment, such that the signature fragments have overlapping portions. The signature application causes at least in part storage of the signatures or the signature fragments in a signature domain over an information space. | 2011-03-24 |
20110072004 | EFFICIENT XPATH QUERY PROCESSING - A system, method and program product for processing an inputted XPath query against an XML document. A method is disclose that includes: generating a path index and an MTree structure index from the XML document using a computing device, wherein the MTree structure index has at least one qpath; executing a query against the path index to generate an initial sequence containing a node for each qpath in the XML document that satisfies the query; generating a hash map from the initial sequence from an MTree structure index containing path ids that are located along qpaths in a second MTree structure index; and testing the path id of each node located along a qpath of the Mtree structure index against the path id in the hash map to generate a result sequence. | 2011-03-24 |
20110072005 | Nearest-Neighbor Geographic Search - Disclosed herein is a method and apparatus for use in searching a geographic database to retrieve geographic objects one cell from a neighborhood of cells at a time. A cell neighborhood can be defined using a grid of cells and an initial, or center, point. A first neighborhood is identified based on its proximity to the initial search point, and corresponds to a first geographic area defined using the initial point and a distance from the initial search point in a number of directions. In a case that more than one cell neighborhood is used, each subsequent cell neighborhood is defined so that it excludes cells belonging to a previously-searched cell neighborhood. A subsequent neighborhood corresponds to a geographic area that is a distance from the initial point greater than the distance associated with a previously-searched neighborhood. | 2011-03-24 |
20110072006 | MANAGEMENT OF DATA AND COMPUTATION IN DATA CENTERS - Data and computation may be unified (i.e., integrated) in a data center using a single query interface. Users may interact with the data center via a query interface to provide a query (i.e., a computation) to the data center. The results of the query may be referred to as derived datasets and may be managed by a cache server. In an implementation, a derived dataset is uniquely referenced by the query that computes it. Shared common computations are computed only once and may be reused by other computations. The result of a query may be computed (if not previously cached) and returned to the user. Infrequently used derived datasets may be garbage collected (e.g., deleted or otherwise removed from storage) by a garbage collector. This integration of data and computation provides efficient resource management for data center. | 2011-03-24 |
20110072007 | SYSTEM AND METHOD FOR CACHING DATABASE REPORTS - A method of report caching includes recording a user ID, a timestamp including at least a connection date and at least one SQL query associated with a report requested by a user from the database system for each connection of the user to the database system over a predetermined period. A plurality of intervals is defined in the predetermined period. Retrieved are instances of the user ID associated with connections of the user to the database system during at least a threshold number of the intervals based on a position that a current date associated with a current connection of the user to the database system occupies in a current interval. The at least one SQL query is executed to generate the report from the database system on the current date before request for the report from the user. The report is stored in a cache for user's retrieval. | 2011-03-24 |
20110072008 | Query Optimization with Awareness of Limited Resource Usage - System, method, computer program product embodiments and combinations and sub-combinations thereof for tuning query execution performance in a database management system are described. In an aspect, query optimization in a database management system (DBMS) with awareness of limited resource usage includes identifying limited resource usage for each possible plan being considered for query execution by a query engine. A determination of whether any possible plan has limited resource usage that does not exceed a threshold level is made, and when at least one possible plan does not exceed the threshold level, the identified limited resource usage is included as a consideration during plan selection by the query engine. In an embodiment, temporary database usage is identified for each possible plan. | 2011-03-24 |
20110072009 | SPACE EFFICIENT VISUALIZATION OF PEDIGREE DATA - A method of visually representing pedigree data is provided. A root individual in a genealogical dataset is identified. A first parent and a second parent of the identified root individual are identified from the genealogical dataset. A third parent and a fourth parent of the identified first parent are identified from the genealogical dataset. A pedigree visualization relative to the identified root individual is presented which includes a root indicator, a first parent indicator, a second parent indicator, a third parent indicator, and a fourth parent indicator. The first parent indicator is presented in a first direction relative to the root indicator, the second parent indicator is presented in a second direction relative to the root indicator, wherein the second direction is opposite the first direction, the third parent indicator is presented in a third direction relative to the first parent indicator, wherein the third direction is perpendicular to the first direction, and the fourth parent indicator is presented in a fourth direction relative to the first parent indicator, wherein the fourth direction is opposite the third direction. | 2011-03-24 |
20110072010 | SYSTEMS AND METHODS FOR PERSONALIZED SEARCH SOURCING - The present invention provides a method and system for customized search results in an advanced search results page including vertical searching pivot points for personalizing and refining searching operations. The method includes tracking user network activities and receiving a search query from the user, the search query including a plurality of search terms. The method and system includes identifying a plurality of preferred content sources based on the tracked network activities and retrieving content items in response to the search query. The method and system filters the content items based on the preferred content sources and therein generates a search result page displaying at least a portion of the filtered content items and at least one of the preferred content sources, wherein the display of the at least one preferred content source allows the user to pivot the search results portion based solely on the preferred content source. | 2011-03-24 |
20110072011 | METHOD AND SYSTEM FOR SCORING TEXTS - A computer-implemented method, computer-readable medium and system for scoring a text are disclosed. Themes within one or more texts may be determined and used to score each text, where an overall score for each text may indicate a respective importance and/or value of each text. The score for each text may be determined based upon a number of themes, type of themes, frequency of theme elements associated with the themes, distribution of theme elements associated with the themes, location of themes in the text, some combination thereof, etc. In this manner, the importance or value of one or more texts may be determined more accurately using information within each text with reduced reliance upon external information. Additionally, more relevant search results can be returned to a user by using internal information to perform ranking operations and/or filtering operations associated with a search. | 2011-03-24 |
20110072012 | SYSTEM AND METHOD FOR INFORMATION SEEKING IN A MULTIMEDIA COLLECTION - An apparatus and method facilitate combined query based searching with serendipitous browsing in a multimedia collection. A user selects objects to label from a local map, which may include representations of objects retrieved from the collection as being responsive to a text or image base query. The text and image portions of the object can be independently labeled. Unlabeled objects are scored and ranked based on the applied labels of labeled objects, which may take into account cross-media pseudo-relevance and user selectable (or default) parameters, such as a forgetting factor, which tends to place greater weight on more recently labeled objects, and a modality parameter, which laces greater weight on the modality (text, image, or hybrid) currently selected by the user. The local map is modified, based on the ranking, optionally after reranking of objects to improve the diversity of the displayed objects. | 2011-03-24 |
20110072013 | ALGORITHM AND IMPLEMENTATION FOR FAST COMPUTATION OF CONTENT RECOMMENDATIONS - In various example embodiments, a system and associated method for fast computation content recommendation is provided. A dynamic user profile for a user is determined. The dynamic user profile is based on one or more fingerprints of viewed documents by the user. One or more relevant documents are determined based on the dynamic user profile and the fingerprints of documents in the system. A list of the one or more relevant documents is then provided to the user. | 2011-03-24 |
20110072014 | PATENT MAPPING - The present inventive subject matter provides systems, methods, software, and data structures for patent mapping, storage, and searching. Some such embodiments include mapping patent documents, claims, and claim limitations. Some further embodiments provide for searching a universe of patent documents by patent document, claim, limitation, class, element, or concept. | 2011-03-24 |
20110072015 | TAGGING CONTENT WITH METADATA PRE-FILTERED BY CONTEXT - Generate tags for content from metadata pre-filtered based on context. A plurality of data items is accessed. Each of the data items has metadata. A context for a user is determined (e.g., at a moment of content capture). One or more of the data items are selected based on the determined context. Upon receipt of content, the received content is compared with the selected data items to identify matches. Metadata is selected from the metadata associated with the matching data items. The selected metadata is associated with the captured content. | 2011-03-24 |
20110072016 | DENSITY-BASED DATA CLUSTERING METHOD - A density-based data clustering method, comprising a parameter-setting step, a first retrieving step, a first determination step, a second determination step, a second retrieving step, a third determination step and first and second termination determination steps. The parameter-setting step sets parameters. The first retrieving step retrieves one data point and defines neighboring points. The first determination step determines whether the number of the data points exceeds the minimum threshold value. The second determination step arranges a plurality of first border symbols. The second retrieving step retrieves one seed data point from the seed list, arranges a plurality of second border symbols and defines seed neighboring points. The third determination step determines whether a data point density of searching ranges of the seed neighboring points is the same. The first termination determination step determines whether the clustering is finished. The second termination determination step determines whether to finish the method steps. | 2011-03-24 |
20110072017 | DOMAIN INDEPENDENT SYSTEM AND METHOD OF AUTOMATING DATA AGGREGATION - A computer automated method of aggregating data includes the steps of inputting a set of user-defined instructions into a computer database system, inputting a user query into the computer database system, mining the computer database system for data relevant to the user query, creating a data set comprising said data relevant to the user query, and aggregating data in the data set using domain metrics selected based on any of predefined and configurable rules and past user usage. | 2011-03-24 |
20110072018 | HIERARCHICAL ADMINISTRATION OF RESOURCES - A method and system for administering assets in a hierarchical manner is provided. A plurality of assets (e.g., computing resources, servers) are provided. A system administrator can create asset groups and administrative groups. One or more assets can be assigned to an asset group. One or more asset groups can be assigned to an administrative group. Accordingly, a user that is assigned to an administrative group has the capability to manage the assets assigned to the user's administrative group. | 2011-03-24 |
20110072019 | DOCUMENT MANAGING APPARATUS, DOCUMENT MANAGING METHOD, AND STORAGE MEDIUM - An object list LO in which information of each object included in a structured document has been collected in a list format is formed. Objects in which a distance in the vertical direction of a document is equal to a threshold value or less are included in one object group and the objects in the object group G are grouped as one group. After that, in the case where a length in the horizontal direction of each of circumscribed rectangles of two or more objects included in the object group G is equal to a length in the vertical direction or more and a length in the horizontal direction of at least one of the two or more objects is smaller than a threshold value, a block reforming process is executed. In the block reforming process, among the objects in the object group G, the objects in which the distance in the horizontal direction is equal to the threshold value or less are grouped as one object group GC. | 2011-03-24 |
20110072020 | Expediting Reverse Geocoding With A Bounding Region - A method for reverse geocoding location information obtained by a wireless communications device comprises determining the location information for a location, communicating the location information to a reverse geocoding server that reverse-geocodes the location information to generate location description data for a bounding region that geographically surrounds the location, receiving the location description data from the reverse geocoding server for the bounding region containing the location, and caching the location description data for the bounding region in a memory cache on the device. When the current location remains within one or more bounding regions cached on the device, location description data is fetched from the cache, thus improving application responsiveness. Only when the current location is no longer within the bounding region(s) does the device communicate a new request to the reverse geocoding server. | 2011-03-24 |
20110072021 | Semantic and Text Matching Techniques for Network Search - In one embodiment, access a search query comprising one or more query words, at least one of the query words representing one or more query concepts; access a network document identified for a search query by a search engine, the network document comprising one or more document words, at least one of the document words representing one or more document concepts; semantic-text match the search query and the network document to determine one or more negative semantic-text matches; and construct one or more negative features based on the negative semantic-text matches. | 2011-03-24 |
20110072022 | METHOD OF MANAGING LIFE STORIES - System, method, and apparatus for users in an online computer system to write and keep in perpetuity their life Stories, Legacies, and Memorials and tie them together with relationships within social networks. A computer system collects data in the form of text or uploaded files entered by an individual who in turn can indicate other individuals to whom they have a relationship and include them in networks. The individual may cross reference chronological chapters with categories for referencing. The individual may select Guardians to control their data after they are deceased or otherwise incapacitated. A separate Foundation ensures storing the data in to ensure there is enough money to store the data in perpetuity. | 2011-03-24 |
20110072023 | Detect, Index, and Retrieve Term-Group Attributes for Network Search - In one embodiment, concept tag a network document comprising document words based on a set of document concepts, each of the document words being indexed with its position within the network document, such that for each of the document words, if the document word represents one of the document concepts, index a document concept tag corresponding to the one document concept with the position of the document word within the network document. Concept tag a search query based on a set of query concepts by associating appropriate query concept tags with selected query words. For each of the query words associated with the query concept tags, determine zero or more first positions within the network document at which the document words match the query word or its synonym and zero or more second positions within the network document at which the document concept tags correspond to the query concept tag. | 2011-03-24 |
20110072024 | METHOD AND SYSTEM FOR PROBABILISTICALLY QUANTIFYING AND VISUALIZING RELEVANCE BETWEEN TWO OR MORE CITATIONALLY OR CONTEXTUALLY RELATED DATA OBJECTS - In one embodiment the present invention provides a novel method for probabilistically quantifying a degree of relevance between two or more citationally or contextually related data objects, such as patent documents, non-patent documents, web pages, personal and corporate contacts information, product information, consumer to behavior, technical or scientific information, address information, and the like. In another embodiment the present invention provides a novel method for visualizing and displaying relevance between two or more citationally or contextually related data objects. In another embodiment the present invention provides a novel search input/output interface that utilizes an iterative self-organizing mapping (“SOM”) technique to automatically generate a visual map of relevant patents and/or other related documents desired to be explored, searched or analyzed. In another embodiment the present invention provides a novel search input/output interface that displays and/or communicates search input criteria and corresponding search results in a way that facilitates intuitive understanding and visualization of the logical relationships between two or more related concepts being searched. | 2011-03-24 |
20110072025 | RANKING ENTITY RELATIONS USING EXTERNAL CORPUS - Exemplary methods and apparatuses are disclosed that may be used to provide or otherwise support ranking entity relations utilizing the vocabulary of at least one external corpus for use in search engine information management systems. | 2011-03-24 |
20110072026 | System for handling program meta-data - A method of accessing program meta-data is disclosed. The method includes receiving a plurality of program meta-data virtual containers, at least one of the virtual containers comprising normalized program meta-data of programs having instances in a plurality of time windows, receiving an input indicating a selected time window, the input at least one of comprises and refers to a time-window identifier identifying the selected time window, and using the time-window identifier to filter the plurality of virtual containers, so as to obtain a subset of the program meta-data which corresponds to the selected time window. Related apparatus and methods are also disclosed. | 2011-03-24 |
20110072027 | SYSTEM AND METHOD FOR CUSTOMIZED FILE COMPARISON - A method and related data processing system and computer readable medium. A method includes receiving, in a data processing system, a first file and a second file, and receiving comparison rules. This method includes comparing the first file and the second file, by the data processing system, according to the comparison rules, and producing an output report corresponding to the comparison. | 2011-03-24 |
20110072028 | METHOD FOR READING A NONVOLATILE MEMORY BY MEANS OF METADATA AND OF A LOOK-UP TABLE - An example method for writing and reading data in electrically erasable and programmable nonvolatile memory (EEPROM) cells may include writing, in erased blocks of a first memory zone, data each having a logical address defined in relation to a virtual memory; writing, in a second memory zone, metadata structures associated with the data present in the first memory zone, configuring, in a volatile memory zone, for each logical address of a data stored in the first memory zone, addresses of metadata structures comprising the logical address, reading the look-up table and then reading metadata structures that the look-up table designates, to find, from the logical address of a data, an address in the first memory zone of a block containing a valid data having the logical address. | 2011-03-24 |
20110072029 | Method, System and Computer Readable Medium for Addressing Handling from an Operating System - A method, system and computer readable medium for information handling within an operating system, including providing a record retrieval program; providing an input device within a window or screen of the operating system and configured to enter an execute command which initiates a record retrieval from local and remote information sources using the record retrieval program; using the record retrieval program to enter first information into search fields provided in the record retrieval program; entering the execute command using the input device after the step of entering the first information; searching, using the record retrieval program, the local and remote information sources for second information associated with the first information; and displaying the second information in the record retrieval program, when one of the local and remote information sources includes second information associated with the first information. | 2011-03-24 |
20110072030 | ACTIVE AUDITING IN A DATABASE SYSTEM - An auditing system receives a set of audit rules from a database administrator, which define a search criteria used to identify a database object that is desired to be audited. The auditing system uses the audit rules to search through a database to identify a corresponding set of database objects that satisfy at least one of the set of audit rules. Then, the system generates audit commands that configure a database management system to audit the identified set of database objects. | 2011-03-24 |
20110072031 | Method for modifying a query by use of an external system for managing assignment of user and data classifications - Disclosed is a data processing-implemented method, a data processing system, and an article of manufacture for modifying a query during compilation of the query. The query includes a request for an element of data from a table in a database and parameters identifying the requested element. The data processing-implemented method includes determining available information from parameters for locating a classification of the requested element and a classification associated with the query, the requested data classification controlling access to the requested element according to the query associated classification, requesting a suggested action from an external system for obtaining a comparison of the requested data classification and the query associated classification based on the available information, receiving the suggested action from the external system responsive to the sent request, and incorporating the suggested action into the query, the suggested action effecting comparison of the requested data classification with the query associated classification. | 2011-03-24 |
20110072032 | Transfer of Data Structures in Sub-Linear Time For Systems with Transfer State Awareness - A method for data transfer in a data processing system, and corresponding system and machine-readable medium. One method includes receiving by the data processing system a request for a data structure from a calling process, and splitting the data structure into a plurality of substructures by the data processing system. That method includes transferring the plurality of substructures to the calling process by the data processing system, wherein at least two of the substructures are transferred in parallel, and maintaining a transfer state for each substructure in the data processing system. | 2011-03-24 |
20110072033 | SUGGESTING RELATED SEARCH QUERIES DURING WEB BROWSING - Described is the presenting of suggested queries for web pages that are not search engine results pages, based upon the URL and/or content of a currently displayed page. The suggested query set may be dynamically extracted (locally or remotely) based upon the content of the web page, and/or obtained from a data store of per-URL suggested query sets, e.g., generated from historical logs. Also described are various techniques for generating suggested queries, and user interface mechanisms that display and allow interaction with suggested queries. | 2011-03-24 |
20110072034 | PRIVACY-SENSITIVE COOPERATIVE LOCATION NAMING - A location database may be configured to store a set of subjective, arbitrary, and/or ephemeral names assigned to a location by various users. When a user of a device arrives at a particular location, the device may retrieve and present to the user the set of names assigned to the location. Moreover, the names may be associated with a privacy designation, which may permit an author of a location name to indicate whether the name of a location should be shared with the public or restricted to access by the user (or to a specified group of users, etc.) Other access criteria may also be specified, e.g., read-only access to a name for the public and read/write access to a particular group of users. Within the set of names of a location, particular names may be designated as authoritative, and may be presented to users with emphasis. | 2011-03-24 |
20110072035 | KNOWLEDGE-BASED METHOD FOR USING SOCIAL NETWORKING SITE CONTENT IN VARIABLE DATA APPLICATIONS - A method and system automatically obtain user page data from at least one social networking site, using at least one computerized device and automatically monitor the social networking site using the computerized device to detect an event. Upon the detection of an event, the method and system automatically identify a variable information document from a repository based on the topical content of the event using the computerized device. The method and system automatically select data from the user page data that matches the topical content of the event using the computerized device; automatically generate a variable data print instance by combining the images and text from the user page with the variable information document using the computerized device; and automatically output the variable data print instance to a user of the social networking site using the computerized device. | 2011-03-24 |
20110072036 | PAGE-BASED CONTENT STORAGE SYSTEM - A page-based content storage system may be provided by a method of managing content which includes generating, from a plurality of electronic files containing displayable content, a plurality of viewpages, where each viewpage contains one or more portions of the displayable content and each viewpage is displayable in a single-page view. The method further includes assembling the viewpages into a journal to provide a page-based storage structure configured to enable individual, selective management of the viewpages based on properties associated with the one or more portions of the displayable content. The method further includes visually presenting the viewpages as single-page views accessible via a page-based user interface of a computing system. | 2011-03-24 |
20110072037 | INTELLIGENT MEDIA CAPTURE, ORGANIZATION, SEARCH AND WORKFLOW - A media capture system employing a method for capturing a media stream and embedding time-based links into the resulting output for the purpose of associating the media information with other artifacts and thereby having the capability of searching for one or more pieces of information, retrieving that information, and displaying segments of the media content based on the search criteria specified by the user. The queried information may be text descriptions, pointer titles, thermal reading levels, motion periods and/or motion levels, object types, as well as other interesting information. | 2011-03-24 |
20110072038 | WEB SITE WITH CONTENT BASED ON REFERRING LINK INFORMATION - Custom content for a website is communicated to a user computer responsive to receiving a request at a hosting computer from the user computer to access the website. If the request contains keywords from a previous search request initiated at the user computer, it is determined whether the keywords set forth in the request match an entry in a database associating certain sets of keywords to specific content for display on a user computer. If so, the specific content is communicated to the user computer responsive to the match. | 2011-03-24 |
20110072039 | SYSTEMS, METHODS, AND SOFTWARE APPLICATIONS FOR PROVIDING AN IDENTITY AND AGE-APPROPRIATE VERIFICATION REGISTRY - Systems, methods and software applications for providing an identity and age-appropriate verification registry. A system for providing an identity and age-sensitive information registry includes various modules. In one implementation, system may include a registration module configured to allow parents and their children to register an account with the registry; and a request processing module configured to enable third parties to query the registry to see if any individual is registered and has authority or consent to access age-sensitive content, products or services or share data that could become publicly available by the third party. | 2011-03-24 |
20110072040 | IMAGE DISPLAY DEVICE, METHOD, AND PROGRAM - It is an object of the present invention to search for image data with an intuitive operation to which active elements are added. | 2011-03-24 |
20110072041 | SYSTEMS AND METHODS FOR MANAGING LOCATION OF MEDIA INI A STORAGE SYSTEM - A system and method for operating a storage library. The system comprises a management server, a media agent connected to the management server, a library connected to the media agent and a database connected to the management server. The management server controls the media agent to monitor for the addition or removal of a piece of media in the library. When the media agent determines that the piece of media has been added to the library or removed from the library, the media agent causes the library to read a media label stored as data on the piece of media, the media label including an identifier identifying the piece of media. When a backup or restore is performed, the system checks the media label to ensure that the correct media is being used. Inventory procedures are disclosed. Media labels are stored in a database along with an indication of the corresponding slot where the media is stored, a time when the label was put on the medium, and a confidence parameter indicating how confident the system is that the particular medium is stored in the respective slot. | 2011-03-24 |
20110072042 | Method and System for Recovering Missing Information at a Computing Device Using a Distributed Virtual File System - A method of recovering information missing from a virtual file system is implemented at a computing device that is communicatively connected to one or more storage devices. Upon receipt of a request for a file associated with an instance of the virtual file system, the computing device retrieves a set of blocks associated with the file from one of the storage devices and identifies one or more of the set of blocks as missing blocks after failing to retrieve the missing blocks from the storage devices. For each missing block, the computing device retrieves one or more parity blocks from one of the storage devices and computes the missing block by applying a predefined recovery scheme to the retrieved parity blocks. Finally, the computing device reconstructs the requested file using the computed missing blocks and other blocks associated with the requested file. | 2011-03-24 |
20110072043 | COMPUTER-IMPLEMENTED PERSONAL INFORMATION MANAGER METHOD AND SYSTEM - A computer system for managing personal information. The computer system includes a dedicated computer configured to receive and store personal information transmitted by a user computer to monitor the use of the dedicated computer by a monitored individual to obtain an activity or inactivity status, and to automatically and electronically transmit an inactivity notification to the monitored individual based on the occurrence of an inactivity status to obtain a response to the inactivity notification. The computer system also includes a mortality tracking computer configured to receive mortality information based on a mortality database having one or more records and to search the mortality database records for a unique identifier of the monitored individual to obtain a mortality search result based on a lack of response to the inactivity notification. | 2011-03-24 |
20110072044 | ACCESS CONTROL SYSTEM AND METHOD FOR WIRELESS APPLICATION PROVISIONING - A method for controlling access to content on a network, the method comprising the steps of associating access credentials with content to be published for download receiving a content download request from a mobile device, the content download request including access information, matching the received access information with the published content access credentials to permit access to the published content and allowing the permitted content to be downloaded by the mobile device. | 2011-03-24 |
20110072045 | Creating Vertical Search Engines for Individual Search Queries - In one embodiment, access a first search query received by a search engine; dynamically construct a list of network resources for the first search query, the list of network resources comprising one or more network resources that are relevant to the first search query, the list of network resources being determined based on analysis of a plurality of user-provided network resources; conduct a first search through the list of network resources using the first search query; and generate a first search result for the first search query based on a result of the first search. | 2011-03-24 |
20110072046 | SYSTEMS AND METHODS FOR PROVIDING ADVANCED SEARCH RESULT PAGE CONTENT - The present invention provides a method and system for generating search results including receiving a search request and accessing a corpus of data to determine relevant content for inclusion in a search result set on the basis of the search request. The method and system includes determining at least one pivot data point, the at least one pivot data point being contextually related to the search result set on the basis of a review of the search result set and generating an active data link for refinement of the search result set on the basis of the data pivot point. The method and system further includes generating a search result output display for the presentation of at least a portion of the search result set and the active data links and toggling the search result output display to present refinement of the search results set. | 2011-03-24 |
20110072047 | Interest Learning from an Image Collection for Advertising - Described herein is a technology that facilitates learning interests for advertising based on automated analysis of images. In several embodiments a person's interests are automatically learned based on the person's photographs for targeted advertising. Techniques are described that facilitate automatically detecting a user's interest from images and suggesting user-targeted ads. As described herein, these techniques include computer-annotating images with learned tags, performing topic learning to obtain an interest model, and performing advertisement matching and ranking based on the interest model. | 2011-03-24 |
20110072048 | CONCEPT-STRUCTURED IMAGE SEARCH - The concept-structured image search technique described herein pertains to a technique for enabling a user to indicate their semantic intention and then retrieve and rank images from a database or other image set according to this intention. The concept-structured image search technique described herein includes a new interface for image search. With this interface, a user can freely type several key textual words in arbitrary positions on a blank image, and also describe a region for each keyword that indicates its influence scope, which is called concept structure herein. The concept-structured image search technique will return and rank images that are in accordance with the concept structure indicated by the user. One embodiment of the technique can be used to create a synthesized image without actually using the synthesized image to perform a search of an image set. | 2011-03-24 |
20110072049 | Dynamic Process Management System for Processing Data in Various Environments - The present invention relates to a dynamic process management system for processing data in various environments. The dynamic process management system includes an interface unit for receiving a specific command from a user, a process-based management unit for mapping relevant processes to memory using information about the processes in compliance with the command received through the interface unit, and a code-based unit for storing classes related to the process information. Accordingly, the present invention is advantageous in that only the data desired by the user can be acquired using user-defined processes. | 2011-03-24 |
20110072050 | ACCESSING DIGITAL MEDIA CONTENT VIA METADATA - A method of using a controller unit to access content stored on a digital content storage device having one or more records containing metadata associated with the content on the storage device. The method includes downloading from the storage device to a controller unit at least some of the metadata; storing the downloaded metadata in a database accessible to the controller unit; and accessing content on the storage device from the controller unit using at least a portion of the downloaded metadata in the database. | 2011-03-24 |
20110072051 | PROCEDURE AND DISPOSITIVE ALLOWING THE DISPLAYING OF INFORMATION ASSOCIATED TO ONE OR SEVERAL KEY WORDS ON A COMPUTER SCREEN - The invention relates to a process which makes it possible to display on a computer screen information associated with one or more key words and in which:
| 2011-03-24 |
20110072052 | SYSTEMS AND METHODS FOR ANALYZING ENTITY PROFILES - Embodiments of the subject invention comprise a computer based system and methods to collect and compare the attributes of a group of entities using data representing topic data of the entity and interaction data between entities. Embodiments of the invention comprise using minimally invasive means to automatically collect and model both an entity's attributes such as their knowledge/work/interest as well as model the social interactions of the entity together with a means to identify opportunities to influence changes in the entity attributes. Minimally invasive means to collect and model attributes include semantic analysis and topic modeling techniques. Means to model social interactions include social network analysis techniques that can incorporate location data of the entity. Embodiments of the invention further provide a sharable index of the attributes of the entities and the group of entities. | 2011-03-24 |
20110072053 | METHOD FOR EFFICIENT DATA TRANSFORMATION - A digraph including a plurality of ordinary nodes, at least one of a composition node and a decomposition node, and a plurality of arcs interconnecting any of said nodes. | 2011-03-24 |
20110072054 | Multimedia Service System Based on User History - Disclosed is a user history based multimedia service system, wherein user history data include a multimedia consumption type and/or consumption behavior of the user. The consumption type data includes a start time or end time of the multimedia content consumption (i.e., simple view data), content recording time and format, content backup time and format, and content transfer time and format. The consumption behavior data includes a content access/play data such as a normal finish, skimmed, skipped, slowed, or replay, and a stopped data of the content access/play. The consumption type or consumption behavior data include information on program identification and information on access to the consumption type/consumption behavior data. The respective data is provided for each user and program. | 2011-03-24 |
20110072055 | Methods and Apparatus for a Plug-In Model for Publishing Structured Meta-Data Based Discovery - Methods and apparatus for publishing services and performing queries for service in a network are described herein. Service descriptions writing in a native search description language are translated to a normalized schema. The normal schema is published to the network. Queries to the network, which may be written in any native search description language, are also translated to normalized schema prior to performing the search. Accordingly, all services available can be published and located in a query without consideration of the native search description language. | 2011-03-24 |
20110072056 | INTERNET-BASED GRAPHICS APPLICATION PROFILE MANAGEMENT SYSTEM FOR UPDATING GRAPHIC APPLICATION PROFILES STORED WITHIN THE MULTI-GPU GRAPHICS RENDERING SUBSYSTEMS OF CLIENT MACHINES RUNNING GRAPHICS-BASED APPLICATIONS - A multi-user computer network, in which graphics performance of client machines running graphics-based applications is optimized using an automated Internet-based graphics application profile management system. The automated Internet-based graphics application profile management system includes an Internet-based communication server, operably connected to the infrastructure of the Internet, and to a central database server, through an application server. The central database server stores graphic application profiles (GAPs) for different graphics-based applications that are capable of running on the client machines. The graphics application profiles are stored in a profile database in the multi-GPU graphics rendering subsystem of each client machine. The Internet-based communication server communicates with each client machine over the Internet, and automatically programs updated graphics application profiles (GAPs) in the profile database of each client machine. This allows for the graphics performance of each client machine to be optimized during the run-time of the graphics-based applications. | 2011-03-24 |
20110072057 | INFORMATION PROCESSING APPARATUS AND METHOD, AND PROGRAM STORAGE MEDIUM - In an information processor which records many contents or has many contents already recorded therein, and can generate an arbitrary combination of the contents, a weight is computed for each of the contents based on either data stored in a history data file ( | 2011-03-24 |
20110072058 | Method and System for Large Volume Data Processing - Disclosed are a method and a system for large volume data processing for solving the problem of system collapse caused by processing delays resulting from a failure of processing a large volume of data within a scheduled time. The method allocates a server to divide a source file into multiple small files, according to a source file naming scheme, and allocates multiple servers to distributedly process the small files. The allocation of servers can be based on the filenames named according to a file naming scheme. The disclosed method deploys multiple servers to divide and process large data files, thereby maximally improving the processing power of the system and ensuring the system to complete the processing of the files within scheduled times. Furthermore, the system promises good scalability. | 2011-03-24 |
20110072059 | Method and System for Synchronizing a Virtual File System at a Computing Device with a Storage Device - A method of synchronizing a virtual file system is implemented at a computing device. The virtual file system has a hierarchical tree structure including a plurality of tree nodes, each tree node having associated metadata and corresponding to a respective component of the virtual file system. Upon receipt of a request to generate a revision of a virtual file system in at least one storage device, the computing device serializes each tree node's associated metadata into an object, generates an object ID from the serialized object, and stores the object in the storage device if the object ID is not found in an object-storage mapping table associated with the virtual file system. Finally, the computing device inserts the object ID into the object-storage mapping table and stores the object-storage mapping table in the storage device after processing the last tree node. | 2011-03-24 |
20110072060 | FILE SYSTEM HAVING TRANSACTION RECORD COALESCING - An electronic data system comprises memory storage having stored data, file system software, and a transaction file. The transaction file is maintained by the file system software, and includes a plurality of transaction records corresponding to transactions that have been or are to be executed on one or more files and/or the or more directories of the file system. The file system software operates to organize and maintain the stored data in the files and directories and also to coalesce multiple transaction records meeting one or more criteria into fewer coalesced transaction records. The physical memory space required by the transaction file is reduced by the transaction record coalescing. The coalesced transaction records may be constructed so that they represent a logical result of applying each transaction record of a transaction record set in chronological order. Once the coalesced transaction records have been committed in the file system, the physical memory used by the original transaction records in the set may be reclaimed for further use (e.g., to store further transaction records) or may be otherwise removed from further use (e.g., when the physical memory is located in a block of memory in a flash-like memory device that has reached its maximum number of write and/or erase cycles). | 2011-03-24 |
20110072061 | OPTIMIZED STARTUP VERIFICATION OF FILE SYSTEM INTEGRITY - A computer system that may be used in implementing a transaction based file system is disclosed. The computer system includes a processor, random access memory that may be accessible by the processor, and a persistent data storage device that is likewise accessible by the processor. The computer system also may include file system software. The file system software may be executed by the processor and operates to manage the file data and the file system structure of the files stored on the persistent data storage device. Additionally, the file system software may maintain a transaction file that includes a plurality of transaction records. Each of the transaction records has a header section and a data section. The header section of each transaction record may include one or more fields that are designated to store information corresponding to a file transaction that is represented by the transaction record. If the operation of the file system software is interrupted, the file system software may resume its execution using a startup process in which a reconstructed file system may be generated in the random access memory. During system restart, the startup process may skip verification of the data section of a transaction record when the transaction record meets one or more predetermined criterion. For example, the startup process may make a distinction between transaction records merely affecting file data versus transaction records that affect the metadata of the file system. As transactions are found during the startup process, the file system software may identify whether a transaction impacts file data or metadata. Since only the metadata is required to ensure that the file system is in a consistent state after startup, the transaction records relating to metadata may be selected as the only subset of transaction records that are subject to complete verification. Verification of other transaction records may, for example, be limited to a check of the information contained in the header section of each remaining transaction record. | 2011-03-24 |
20110072062 | Method and System for Resolving Conflicts Between Revisions to a Distributed Virtual File System - A method of resolving conflicts between revisions to a distributed virtual file system is implemented at a computing device that is communicatively connected to a plurality of storage devices. The virtual file system at the computing device has a first revision of the virtual file system. Upon receipt of a request to synchronize the first revision of the virtual file system with the storage devices, the computing device retrieves one or more blocks from the storage devices, which are associated with a second revision of the virtual file system. The computing device then merges a first component of the first revision with a corresponding component of the second revision if a first predefined condition is met or identifies a second component of the first revision as being conflicted with a corresponding component of the second revision if a second predefined set of conditions is met. | 2011-03-24 |
20110072063 | Abstraction Apparatus for Processing Data - An abstraction apparatus for processing data is provided. The abstraction apparatus implements an abstraction layer that supports a variety of physical objects (hardware). The abstraction apparatus only manages information related to data denormalization and/or denormalization separately without embedding the information in the logical objects (software), thereby reducing overhead due to the normalization and/or denormalization. | 2011-03-24 |
20110072064 | REDUCE INTERFERENCE FOR KVM SYSTEM - Embodiments of the invention provide methods and apparatus for designing a filter configured to reduce the effects of noise in an electrical signal transferred between a KVM (Keyboard, Video, Mouse) device and another device. Designing the filter may involve determining a filter architecture, wherein the filter architecture defines a desired type of frequency response for the filter, determining one or more parameters of the filter, wherein the parameters define one or more performance characteristics of the filter, and optimizing the one or more parameters to achieve a specific desired frequency response of the filter. | 2011-03-24 |
20110072065 | Method for efficient DCT calculations in a programmable processor - The present invention relates to a efficient implementation of integer and fractional 8-length or 4-length, or 8×8 or 4×4 DCT in a SIMD processor as part of MPEG and other video compression standards. | 2011-03-24 |
20110072066 | Apparatus and method for performing fused multiply add floating point operation - A fused multiply add floating point unit | 2011-03-24 |
20110072067 | Aggregation of Multiple Information Flows with Index Processing - A method is disclosed that enables the monitoring of a diverse set of both real-time and non-real-time communication streams, as well as the aggregation of information related to those streams into a collective dialog. A server of the illustrative embodiment continually performs an aggregation of events that are related to media streams, applications, and presenter and participant actions, into a particular scope of communication. Index entries, which are indicia to events, are created by things that presenters and participants are doing already, such as posting a meeting agenda inviting participants, posting a presentation or document, transitioning from one slide or page to another, participants speaking alternately during a meeting or presentation, and so forth. The server uses the indicia to then perform processing across information flows associated with the communication streams. | 2011-03-24 |
20110072068 | LOCATION UPDATE METHOD, HETEROGENEOUS NETWORK COMMUNICATIONS SYSTEM AND DEVICE - A location update method, and a heterogeneous network communications system and a device are provided herein. The method includes: an information server receives a location update request message from a multimode terminal; the information server searches the pre-stored location area mapping information for the location area information of the second interface; and the information server sends the location update request message of the second interface to a second Paging Coordinator (PC) corresponding to the second interface, where the request message carries the found location area information of the second interface so that the second PC can update existing location area information of the second interface. The system includes an information server, a first PC and a second PC. Therefore, the interfaces of the multimode terminal do not need to initiate location update frequently, message interactions between the terminal and the network are reduced, and not all interfaces of the multimode terminal need to report location area information, thus saving power. | 2011-03-24 |
20110072069 | Systems and Methods for Providing a Desktop Image to an Information Handling System - An information handling system (IHS) is provided in the context of providing a desktop image. The IHS may include a storage device and a client device. The IHS may also include a management server configured to establish communication between the storage device and the client device. In addition, the client device may be configured to boot directly from the storage device and wherein the data communication occurs only between the storage device and the client device. | 2011-03-24 |
20110072070 | ASYNCHRONOUS INVOCATION OF WEB SERVICES USING MOBILE CLIENT APPLICATIONS - Implementations of the present disclosure provide methods of invoking a web service using a mobile client. In some implementations, a method includes defining a correlation between a plurality of input components of an application that is executed on the mobile client and a plurality of parameters of a web service application, generating a text file based on the correlation, storing the text file in memory of the mobile client, generating an invocation message at the mobile client based on the text file and a user input, and transmitting the invocation message to a server to invoke the web service application. | 2011-03-24 |
20110072071 | METHOD AND APPARATUS FOR LOCATION-BASED, JUST IN TIME SOCIAL NETWORKING - In one embodiment, the present disclosure is a method and apparatus for location-based, just in time social networking. In one embodiment, a method for providing a social network includes receiving a request from a first user of the social network to provide information from a location of interest specified by the first user, and locating a group comprising at least one other user of the social network, where each of the at least one other user is currently at the location of interest and has volunteered to provide information from the location of interest, wherein the group is selected from a larger group of other users who are at a plurality of locations of interest. | 2011-03-24 |
20110072072 | System and method for unitized maneuvers for multi-player games - There is provided a system and method for facilitating unitized maneuvers for a shared environment to mitigate the effects of network latency. There is provided a method for use by a processor of a server for facilitating unitized maneuvers for a shared environment, the method comprising receiving a first message generated by a first client of a plurality of clients in response to the first client initiating a first unitized maneuver on a first object for rendering the shared environment and sending a second message to a second client of the plurality of clients in response to receiving the first message to communicate the first unitized maneuver so as to cause the second client to render the first object executing the first unitized maneuver in the shared environment approximately synchronously with the first client until a first end time determinable using parameters of the first unitized maneuver. | 2011-03-24 |
20110072073 | SYSTEMS AND METHODS FOR FORMATTING MEDIA CONTENT FOR DISTRIBUTION - Systems and methods are described for processing media programs for distribution on a network. Media programs are received from one or more sources and placed on a queue in an appropriate format. Programs are retrieved from the queue and processed by any number of servers to format the program and/or its metadata for distribution on the network. | 2011-03-24 |