53rd week of 2009 patent applcation highlights part 72 |
Patent application number | Title | Published |
20090327281 | METHOD AND SYSTEM FOR RANKING WEB PAGES IN A SEARCH ENGINE BASED ON DIRECT EVIDENCE OF INTEREST TO END USERS - A method and system for ranking Web pages in a Web search engine is described. One illustrative embodiment receives a Web search query from a particular user, the query including at least one keyword; identifies one or more Web pages that contain the at least one keyword; determines, for each of the one or more Web pages, a raw page ranking; adjusts the raw page ranking of each of at least one Web page among the one or more Web pages based on direct evidence of how interesting that Web page is to users to produce an adjusted page ranking, the direct evidence being derived from clickstream data collected from the users; and presents, as search results, the at least one Web page to the particular user in accordance with the adjusted page rankings. | 2009-12-31 |
20090327282 | SOCIAL MOBILE SEARCH - Search and retrieval of information shared between members of a social mobile networks is facilitated. The search returns results in an order that is based on relevance measurements unique to each member. A comprehensive map of the interactions and behaviors that take place between the members of a social mobile network is discovered and maintained. Such maps are used to assign a unique relevance measurement for each member of each social mobile network. | 2009-12-31 |
20090327283 | TECHNIQUES FOR WEB SITE INTEGRATION - Disclosed is a method and device for finding documents, such as Web pages, for presentation to a user, automatically or in response to a user expression of interest, which documents are part of a Web site being accessed by the user, and which documents relate to a document, such as a Web page, being accessed in the Web site. The method takes advantage of information retrieval techniques. The method generates the search query to use to find documents by reference to the text of the document in the Web site being accessed by the user. The method further uses a weighting function to weigh the terms used in the search query. | 2009-12-31 |
20090327284 | INFORMATION SEARCH APPARATUS, AND INFORMATION SEARCH METHOD, AND COMPUTER PRODUCT - A computer-readable recording medium stores therein an information search program that causes a computer to search for text items described in a text file. The information search program causes the computer to execute receiving input of a search keyword; searching an index file for a writing keyword that includes the search keyword, the index file including writing keywords described, for respective entries, in an order identical to the order in which the text items are described in the text file; identifying an entry that corresponds to the writing keyword retrieved at the searching; and outputting the identified entry. | 2009-12-31 |
20090327285 | SEMANTIC RECONSTRUCTION - Determining a semantic relationship is disclosed. Source content is received. Cluster analysis is performed at least in part by using at least a portion of the source content. At least a portion of a result of the cluster analysis is used to determine the semantic relationship between two or more content elements comprising the source content. | 2009-12-31 |
20090327286 | METHODS AND SYSTEMS FOR IMPROVING A SEARCH RANKING USING LOCATION AWARENESS - Systems and methods improve search rankings for a search query by using location data associated with queries and documents related to the search query. In one aspect, a search query is received, a location score is determined, a topical score is determined, and an ordering of documents related to the search query is determined based, at least in part, on the location score and the topical score. | 2009-12-31 |
20090327287 | METHOD AND SYSTEM FOR PERFORMING A SEARCH ON A NETWORK - A computer-implemented method and system for performing a trusted search is described. A credibility score is assigned to a Web site based on whether the Web site meets at least a portion of trust criteria. The Web site is stored in an index of trusted Web sites if the credibility score assigned to the Web site is within a predefined range of credibility scores. The Web site is displayed on a machine if the Web site is determined to contain information that is relevant to a search query. | 2009-12-31 |
20090327288 | CONTENT ENUMERATION TECHNIQUES FOR PORTABLE DEVICES - Arrangements and techniques for enumerating portable device contents via a content management device are discussed herein. The portable device is caused to create and store a first data structure, referred to herein as a portable database, corresponding to the contents of a media library stored thereon. Upon connection to a content management device, the portable database is copied to the content management device, and is used in conjunction with information stored by the content management device in a second data structure, referred to herein as a device content table, to efficiently enumerate and provide other manipulation of the contents of the media library stored on the portable device. | 2009-12-31 |
20090327289 | METHODS AND SYSTEMS FOR MANAGING SIMILAR AND DISSIMILAR ENTITIES - Search criteria and potential targets of searches are each represented by a classification of attributes. The search classifications and target classifications are compared to determine whether a target matches or loosely matches the search criteria. The search classifications and target classifications may be modified to increase the chance of a match or loose match. A user can request to modify a classification using a visual interface in which information about the classification is presented. The matching approach may be implemented in conjunction with conventional matching methods to provide classifications. The matching approach is capable of interacting with users of the approach to dynamically alter the classifications being searched based on any given set of search results. | 2009-12-31 |
20090327290 | SELECTIVE EXPOSURE TO A DATA CONSUMER - A method for consuming data includes determining a scope of summarization for a data set in response to receiving a request from a summarization program, obtaining a lock on the data within the scope of summarization and consuming the data from the summarization program within the scope of data summarization. The summarization program includes methods configured to obtain concurrent locks on different portions of the data set. The consumption of the data may be governed by specific rules. | 2009-12-31 |
20090327291 | PRIMITIVES FOR SOFTWARE TRANSACTIONAL MEMORY - Software transactional memory (STM) primitives are provided that allow the results of prior open calls to be used by subsequent open calls either as-is or through another STM primitive that consumes the results of the previous invocation. The STM primitives are configured to ensure that the address of a shadow copy representing a memory location will not changed across a wide range of operations and thereby enable re-use of the shadow copy. | 2009-12-31 |
20090327292 | ENSURING CONSISTENCY AMONG SHARED COPIES OF A DATA ELEMENT - Disclosed is a “light weight” protocol used to coordinate shared copies of a data element. A central repository holds a master copy of the data element. Applications “subscribe” to the data element (or to an aspect of it) by sending a message to the central repository. Whenever the data element (or aspect) is changed, applications that have subscribed to the data element (or aspect) are notified of the change. When an application wishes to change the value of a subscribed aspect, it sends an update request to the central repository. The central repository changes the master copy of the data aspect to the requested value and then informs all subscribed applications of the new data value. If two applications both wish to change the value of the same data aspect, they send their update requests, and the central repository processes them in the order in which they are received. | 2009-12-31 |
20090327293 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING SYSTEM, STORAGE MEDIUM, INFORMATION PROCESSING METHOD, AND DATA SIGNAL - An information processing apparatus includes a document information storage unit that stores a derivation relationship designating a first document as a parent and a second document generated after an operation as a child, and an operator that performed the operation; an organization information storage unit that stores a structure of an organization hierarchy and members belonging to each of organizations; and a document output permission/prohibition determination unit that, upon receiving a document output request, determines whether or not to permit output of the requested document, by checking an operator of the requested document or an operator of a document corresponding to an ancestor of the requested document in a tree structure of the derivation relationships against members belonging to an organization including a requesting person as a member or an organization being located at a higher level than the organization including the requesting person in the organization hierarchy. | 2009-12-31 |
20090327294 | Structured Coauthoring - A system is presented for structured coauthoring of a document, the system comprising a server. The server includes one or more documents organized into sections, a document permissions module that stores user access permissions for each section of a document, a document update processing module that processes requests from a user to share document updates with other users and that processes requests from a user to receive document updates from other users and a document rendering module that renders a document for display on a client so that sections of the document are updated with shared document updates made by users. The user access permissions determine the extent to which a user can modify each section of the document. | 2009-12-31 |
20090327295 | MAINTENANCE OF EXO-FILE SYSTEM METADATA ON REMOVABLE STORAGE DEVICE - An interface between a host computing device and a transient storage device (TSD) eliminates the need for a full directory crawl of the storage volume on the TSD to maintain a metadata database. The metadata database is incrementally updated instead of being completely regenerated on every connection between the TSD and a highly capable host. This function helps the host device more efficiently track and maintain exo-file system metadata. Host devices discover and use this new TSD function to efficiently update the metadata database. Host devices provide parameters governing the operation of the TSD to the TSD. Cooperatively, the TSD logs addresses corresponding to storage locations of changes made to the data on the storage volume and, upon discovering a capability of the host device to update the metadata database, the TSD provides discovery to the host device regarding an availability of the metadata database and the log of addresses. | 2009-12-31 |
20090327296 | PRESERVING INDIVIDUAL INFORMATION PRIVACY BY PROVIDING ANONYMIZED CUSTOMER DATA - A method of preserving individual information privacy for each of a plurality of customers while providing aggregated information about the plurality of customers includes storing static customer data and dynamic customer data of the plurality of customers in a protected database. The method includes restricting shared access to the static customer data and the dynamic customer data to a set of approved privacy-preserving queries. The privacy preserving queries include a privacy-preserving aggregation query that uses one or more parameters to indicate a characteristic of interest for which aggregation of the static customer data and the dynamic customer data is requested. The privacy-preserving aggregation query may be configured to retrieve aggregated customer data related to the characteristic of interest. The aggregated customer data may be returned in response to the privacy-preserving aggregation query not including any personally identifiable information of any particular one of the plurality of customers. | 2009-12-31 |
20090327297 | ESTABLISHING PATIENT CONSENT ON BEHALF OF A THIRD PARTY - A database system, which stores electronic medical records, may assign a child-application-identification-code to a healthcare provider via a clinical system intermediary acting on behalf of the healthcare provider. The database system may associate the child-application-identification-code assigned to the healthcare provider with a privacy statement and terms of use associated with the clinical system. The privacy statement and terms of use may be presented to the patient when the patient is prompted by the database system to approve or deny a request by the healthcare provider to access the electronic medical record of the patient stored at the database system. | 2009-12-31 |
20090327298 | Multimedia journal with selective sharing, sealed entries, and legacy protection - A multimedia journal system comprising one or more journal servers and one or more client devices allows users to create an electronic journal. Journals may be redundantly stored in multiple locations so as to protect the journals from damage or destruction. The system also allows control of access to a journal or the parts thereof, and will allow a journal's owner to designate family members, friends, or others access to the journal in the event the owner passes away. Entries may be sealed to prevent or identify subsequent modifications or tampering. A sealed questionnaire is also provided, which users may answer periodically to track changes in their thoughts, feelings, or ideology. The system may be accessible via the World Wide Web. | 2009-12-31 |
20090327299 | REPLICATING MODIFICATIONS MADE TO CONTENTS OF A SHARED FOLDER - Replicating modifications made to contents of a shared folder. As a part of replicating modifications made to contents of a shared folder, modifications made to a shared folder located on a first computer system and replicated in a second folder that is located on a second computer system are accessed from a second computer system. One or more folders are identified that are associated with the second folder and that are accessible from one or more other computer systems. The one or more folders are caused to have replicated in them modifications that were made to the shared folder. | 2009-12-31 |
20090327300 | MANIFEST-BASED ENHANCED PRESENCE PUBLISHING - Architecture that facilitates the formalization of contracts across multiple points of presence of a given user so that the multiple presence points can harmoniously publish presence. Enhanced presence publishing rules are formalized as a contract by all the endpoints of a given infoworker. An infoworker can signed on from different releases of software endpoints and to have a consistent presence experience. The infoworker can modify the publishing rules contract in a discoverable fashion by the other infoworker software endpoints. A container contract is provided having default container memberships (presence levels) and static publications. The rules associated with setting and verifying consistency of the default presence store container memberships (presence levels) is formalized. Additionally, the rules associated with making static publications at first time software endpoint registration and verifying consistency of the static publications at subsequent endpoint bootstrapping are formalized. | 2009-12-31 |
20090327301 | Distributed Configuration Management Using Constitutional Documents - Described is a technology in a distributed configuration network management environment, in which constitutional (governing, authoritative) documents are used to perform management tasks. The constitutional documents are structured so as to be consistent, self-contained and independently validated, yet may be combined with other constitutional documents to perform a management task. A constitutional document includes a schematic language statement, data transformation statements, and rule statements. In usage, the structured document is distributed to an agent on a client machine, which processes the structured document by transforming data and applying rules, such as to enforce network policy on client machines. | 2009-12-31 |
20090327302 | Synchronization and Collaboration Within Peer-to-Peer and Client/Server Environments - Tools and techniques are described for synchronization and collaboration within peer-to-peer and client/server environments. These tools may provide methods that include establishing peer-to-peer relationships between two or more client systems. These relationships enable the client systems to create respective local instances of workspaces, shared between the client systems to allow them to collaborate with one another. The client systems may participate in peer-to-peer synchronization flows with one another, with the synchronization flows representing updates made local to the shared workspaces of the client systems. The methods may also establish establishing a client/server relationship between one of the client systems and a server system. Through this client/server relationship, the client and server systems may participate in client/server synchronization flows, with these flows representing updates made to the local shared workspace at the client system. | 2009-12-31 |
20090327303 | INTELLIGENT ALLOCATION OF FILE SERVER RESOURCES - A solution provides an efficient process for a user to complete operations within a file server system. A user's future requests, such as reading or writing files, are predicted based on previous operations. An effective amount of a file server's resources are allocated to accommodate the predicted future requests, thereby reducing the amount of required system time for performing operations corresponding to a file server memory. | 2009-12-31 |
20090327304 | SYSTEMS AND METHODS FOR TOKENIZING AND INTERPRETING UNIFORM RESOURCE LOCATORS - Aspects include methods, computer readable storing instructions for such methods, and systems for processing text strings such as URLs that comprise patterns of parameters and values for such parameters, delimited in a site-specific manner. Such aspects provide for accepting a number of text strings that are expected to have a common delimiting strategy, then deeply tokenizing those text strings to arrive at a set of tokens from which are selected anchor tokens used to form patterns having the anchor tokens separated by wildcard portions for recursive processing. The patterns formed can be mapped to a tree of nodes. Information concerning relationships between nodes and between tokens within a given node, as well as other heuristics concerning which tokens are parameters and which are values can be used as observed events for producing probabilities that certain tokens are parameters or values, using a dynamic programming algorithm, such as a Viterbi algorithm. | 2009-12-31 |
20090327305 | CONTENT MANAGEMENT AND ACCESS SYSTEMS AND METHODS - An exemplary method includes receiving data representative of a content instance over a network from an access device associated with a user, storing the data representative of the content instance, providing the user with an interface configured to allow the user to define at least one access rule corresponding to the content instance, the at least one access rule based on at least one user profile and at least one access device profile, receiving a communication from another access device over the network, and performing a predefined action related to the content instance in response to the communication and in accordance with the at least one access rule. | 2009-12-31 |
20090327306 | ARRANGEMENT FOR ANONYMOUS API DOWNLOADED RESOURCES FOR ADVANCED CONTENT - Provided are arrangements for downloading resources and managing downloaded resources. A file is requested from a HTTP server, the file associated with an original URI. The file is downloaded and assigned a handle. The file is then stored in a storage location such as a file cache or in a persistent storage location. Upon command of an advanced content playlist or sequence, the file is called by calling the handle of the file. The storing of the file may include storing the file in a location where the file is subject to an automatic removal operation. The file may be an image file or any other type of file, especially multimedia files. The automatic removal operation may occur upon a quitting or restarting of the application. If another request is made for another file, the prior downloaded file may be replaced. | 2009-12-31 |
20090327307 | Personal routine system and method thereof for automatic tracking, automatic recording, and searching of a personal routine - A personal routine system that automatically traces and links a users' time, locations and activities. The person routine system includes a position recording unit for recording the user's location information, a routine tracking system having a first mapping module for matching data and files the data with the user's time and location information, and a service platform. The routine tracking system also provides a browse function and a search function for the matched records and transfers them to the service platform. The service platform stores the records transmitted from a second network interface into a second storage unit and uses a user interface to display the records stored in the second storage unit and further provides the browse and search functions. | 2009-12-31 |
20090327308 | SYSTEMS AND METHODS FOR PROVIDING A CONSUMPTION NETWORK - Systems and methods for providing a consumption network are provided. A method according to the invention may include receiving purchase information on a mobile device and recording the purchasing information. The information may be transmitted to a central database. At the central database, the information may be recorded and transmitted from the central database to a pre-determined group of users. Alternatively, the information may be transmitted to a group of users directly from the mobile phone associated with the purchasing. | 2009-12-31 |
20090327309 | METHOD FOR PROTECTING FILES OF DIGITAL PHOTO FRAME - A method for protecting files of a digital photo frame includes an applying module of the digital photo frame detecting whether there are files in a storage system, which is accessed by the digital photo frame. If not, the applying module copies the files of the storage module to the storage system. If yes, the applying module judges whether the files of the storage module are the same as the files of the storage system. If not, the applying module copies the files of the storage module to the storage system. | 2009-12-31 |
20090327310 | METHODS FOR PROVIDING ACCESS TO FILES ON AN ELECTRONIC DEVICE USING A PHONE NUMBER FOR AUTHENTICATION AND RELATED ELECTRONIC DEVICES AND COMPUTER PROGRAM PRODUCTS - A method of operating a first electronic device to access files on a second electronic device includes registering with a proxy server to obtain a communication session identification, sending a request to the second electronic device to access files thereon, the request comprising the communication session identification and a phone number associated with the first electronic device, and receiving a notification from the proxy server that a connection has been established with the second electronic device responsive to the second electronic device accepting the request. | 2009-12-31 |
20090327311 | SYSTEMS AND METHODS FOR IMPLEMENTING A TENANT SPACE IN A PROVIDER-TENANT ENVIRONMENT - The present invention discloses methods and systems for hosting tenants in a computer-based environment in which a provider stores a shared data structure. Each of the tenants may store shared-metadata referencing the shared data structure, while a first tenant may store a tenant-specific data structure specific to the first tenant for access by the first tenant. Based on the shared-metadata and in response to a data request from the first tenant, the system may the query the provider or the first tenant for requested data and provide the requested data based on the querying. | 2009-12-31 |
20090327312 | ORGANIZING RESOURCES INTO COLLECTIONS TO FACILITATE MORE EFFICIENT AND RELIABLE RESOURCE ACCESS - The present invention extends to methods, systems, and computer program products for organizing resources into collections to facilitate more efficient and reliable resource access. Namespace managers communicate with one another to form a federation namespace infrastructure. The infrastructure can efficiently route, migrate, and process namespace requests, such as, for example, namespace registration requests from providers requesting to manage portions of namespaces and lookup requests from consumers requesting access to managed resources. Resources can be registered in and made accessible from multiple different namespaces. Resources can be identified using nested queries that filter results at multiple levels of a hierarchical namespace. | 2009-12-31 |
20090327313 | EXTENSIBLE INPUT METHOD EDITOR DICTIONARY - An extensible reading system is described that provides a method of extending the readings supported by an IME application without updating the entire application. The extensible reading system separates the IME reading dictionary from the IME application, so that the user can update or supplement the dictionary with new readings without modifying the IME application. The extensible reading system receives custom readings from a user that include a sequence of keyboard characters and a selection of a language character that is to be inserted into a document when a user inputs the sequence of keyboard characters. Thus, the extensible reading system allows the user to update the readings for mapping keyboard characters to language characters much more frequently. | 2009-12-31 |
20090327314 | EXTENDED USER PROFILE - A method of extending user profile. A user specific data related to an application is received and stored for integration with a user profile. A template for the application is received and stored. The template tailors the user specific data based on aesthetic preferences of the user to generate a tailored user specific data. The user profile is extended based on the user specific data for the application and the template for the application. The user profile comprising the tailored user specific data may be provided for rendering. Local information, e.g., geographical location, of the user may be determined to tailor the user profile based on the local information. The user specific data and/or the template may be in a markup language format. Update to the user specific data and/or template may be pushed when available. | 2009-12-31 |
20090327315 | METHOD FOR INDEXING PHOTOS IN DIGITAL PHOTO FRAME - A method for indexing photos in a digital photo frame includes inputting a category to the digital photo frame, inputting information of a photo to the digital photo frame, analyzing and indexing the information of the photo according to its relationship with previously input information of other photos, and building an index diagram to display on the digital photo frame. | 2009-12-31 |
20090327316 | Dynamic Tree Bitmap for IP Lookup and Update - The subject invention provides a data structure and method for IP lookups, insertions, and deletions using a dynamic tree bitmap structure (DTBM) that utilizes an array of child pointers for each node instead of the typical TBM approach using one pointer to an array of children. | 2009-12-31 |
20090327317 | METHOD AND APPARATUS FOR A FUZZY DISTRIBUTED DECISION SUPPORT SYSTEM - A method supports a decision-making process in a time critical scenario managed by a distributed workflow consisting of a plurality of distributed nodes. The method includes assessing a given situation with available information to establish confidence percentages for possible decisions associated with the given situation and the distributed workflow. A distributed workflow architecture is provided that allows the distributed workflow to use the confidence percentages to enable a decision maker to get knowledge of a best possible course of action when executing the distributed workflow. Fuzzy logic is used to compute and maintain the confidence percentages for the possible decisions based on the available information. Furthermore, an appropriate workflow management system is proposed. | 2009-12-31 |
20090327318 | INFORMATION EXCHANGE BETWEEN A HANDHELD DEVICE AND ANOTHER COMPUTER SYSTEM USING AN EXCHANGE MANAGER AND UNIFORM RESOURCE LOCATOR (URL) STRINGS - A method and electronic system for exchanging data between a handheld device and another computer system using universal resource locator (URL) strings. With respect to sending information from the handheld, an application may define a URL string that may indicate 1) a transport mechanism and 2) a destination for the information. Exemplary transport mechanism strings include: IRODEX:// (infrared); BTOBEX:// (radio frequency Bluetooth); SMS://; SMTP:// (email); SYNC:// (synchronization); HTTP:// (Internet); FTP:// (file transport protocol); etc. Information and the associated URL string is forwarded from the application to an exchange manager API. The exchange manager API is connected to a plurality of exchange library APIs, one for each supported transport mechanism. If no transport mechanism is defined, the user is asked to define one. If no destination is specified, the user is asked to define one. The exchange manager then provides the required communication using the specified URL string. On receiving information, the URL can define its source. If none is given, the exchange manager requests from the user a specific application and verifies the addition of the information to the database associated with the application. When URL strings are fully defined, the communication of information can be somewhat transparent to the user. The handheld device can be a palmtop computer system. | 2009-12-31 |
20090327319 | HYBRID DATA MODEL AND USER INTERACTION FOR DATA SETS IN A USER INTERFACE - A first data model in which a large dataset is stored is maintained, wherein a first set of operations is allowed to be performed on the first data model. The first data model is reduced to a second data model that is of a smaller size than the first data model. Selected operations of the first set of operations are restricted from being performed on the second data model. A second set of operations is performed on the second data model, wherein the second set of operations is a subset of the first set of operations, and wherein the second set of operations does not include the selected operations that have been restricted from being performed on the second data model. | 2009-12-31 |
20090327320 | CLUSTERING AGGREGATOR FOR RSS FEEDS - A method for merging really simple syndication (RSS) feeds. Stories containing one or more terms may be merged into one or more clusters based on one or more links between the stories. A cluster frequency with which the terms occur in each cluster may be determined. A diameter for each cluster may be determined. A cluster that is most similar to one of the clusters may be determined based on the cluster frequency. The most similar cluster with the one of the clusters may be determined based on each diameter, and each cluster frequency. | 2009-12-31 |
20090327321 | DOCUMENT TEMPLATES FOR SCHEMA-BASED DATA TRANSFER INTO AND OUT OF A DATA-BASED APPLICATION - Systems and methods are described for using templates associated with a document application to facilitate schema-based data transfers into and out of a database associated with a database application. Such templates may be made available to a user so that the user can easily export various data entities out of the database for display, editing, or report generation as well as to import new or edited data entities into the database. The templates may include fixed or user-customizable reports that are populated with data entities exported from the database and/or that present data and graphics derived from such data entities. The templates may also be created during an initial data transfer between a first document and the database and then saved for use in performing subsequent data transfers between other documents and the database. | 2009-12-31 |
20090327322 | INFORMATION WORKER CREATING COMPONENT APPLICATION WITHOUT WRITING CODE TO CREATE THE APPLICATIONS - A data processing system for data exchange across application boundaries is provided. The system includes a canvas memory in which to open multiple applications. A transform component generates data structures across the canvas memory in at least one application form and automatically transforms the data structures to at least one other application form to mitigate application boundaries between disparate applications. | 2009-12-31 |
20090327323 | Integrating Data Resources by Generic Feed Augmentation - Data integration in a data processing system is provided. A data mashup specification is received and an interleaved sequence of operations as defined by the data mashup specification is executed. The interleaved sequence of operations comprises at least one of an import operation, an augment operation, or a publish operation. In executing the interleaved sequence of operations a determination is made as to the next operation to execute. An outer context is formed and added to a binding context of the next operation. If the next operation is an import operation, a data resource is imported from a data source and an input generic feed is generated. If the next operation is an augment operation, a set of augmented generic feeds is produced from a set of input generic feeds. If the next operation is a publish operation, a new data resource is produced from a specified augmented generic feed. | 2009-12-31 |
20090327324 | METHOD OF REFACTORING A RUNNING DATABASE SYSTEM - A database development system is provided. The system includes a current-state source representation of a database that can be captured in a model of the database and a metadata component that preserves user intentions describing when a user interacts with the system to perform a refactoring operation (or other code enhancement) for use in subsequent operations by the system. A deployment component is provided that utilizes the preserved user intentions to optimize behavioral upgrades to the system, where simulations can be run against the model to facilitate efficient and automated deployments. | 2009-12-31 |
20090327325 | META MODELING IN DECISION SUPPORT SYSTEM - A method, system, and computer program product for providing troubleshooting data for reported fault conditions on equipment is provided. An engineering model is configured for the equipment. The engineering model includes at least one failure scenario and an associated symptom. The engineering model is stored in an equipment model database. A meta model representative of at least one relationship between the engineering model and a reported fault condition for the equipment is instantiated. A user input for the reported fault condition is stored in a decision support system (DSS) database. The DSS database forms a wrapper over the equipment model database based on the user input. The meta model is further instantiated using user input data from the DSS database. An optimal troubleshooting procedure for the equipment is determined based on the meta model as instantiated. | 2009-12-31 |
20090327326 | METHOD AND SYSTEM FOR MIGRATING DOCUMENTS - A method for exporting native source documents (NSDs) from a document repository. The method includes identifying a first NSD to export, where the first NSD includes a first version of content and first metadata, and identifying a second NSD to export, where the second NSD comprises a second version of the content and second metadata. The method further includes generating a source content definition file (CDF) document that includes a global property, a first version-specific property for the first version of the content, a reference to the first version of the content, a second version specific-property for the second version of the content, and a reference to the second version of the content. The method further includes storing the source CDF document in a persistent storage device. | 2009-12-31 |
20090327327 | METHOD, APPARATUS AND COMPUTER PROGRAM PRODUCT FOR PROVIDING CONTEXT TRIGGERED DISTRIBUTION OF CONTEXT MODELS - A method for providing context triggered distribution of context models may include receiving current context information related to a first device, accessing a context profile and a security profile associated with the first device, and developing a composite context tree based on at least a portion of the current context information related to the first device and context information related to at least one other device based at least in part on the context profile defining, for a current context of the first device, aspects of the current context information to be utilized for the developing of the composite context tree. An apparatus and computer program product corresponding to the method are also provided. | 2009-12-31 |
20090327328 | Platform-Independent Data Application Description Language - Technologies are described herein for generating a platform-independent data application. In one method, a definition of a data schema is received for defining data types. A definition of a user interface is also received for access data stored in the data types. Further, a definition of business logic is received for enforcing validation rules and actions associated with the data types. The definitions of the data schema, the user interface, and the business logic are each received in a platform-independent format and used to generate the platform-independent data application. | 2009-12-31 |
20090327329 | PRICE ESTIMATION OF OVERLAPPING KEYWORDS - In this invention, systems and methods for providing a price estimate for two or more keywords are provided. More specifically, a price estimate is determined and provided when each keyword has terms in common, where each keyword includes one or more terms. For example, a first keyword (e.g., “car”) and a second keyword (e.g., “new car”) share a common word. Thus, the price estimate of these keywords will factor in the commonality between the keywords and provide a more accurate price estimate to the advertiser, when bidding on the keywords. A more accurate price estimate allows the advertiser to better estimate their advertising budget when factoring in the overlapping keyword traffic, and accordingly, bid on more keywords. | 2009-12-31 |
20090327330 | APPARATUS AND METHOD FOR DYNAMICALLY MATERIALIZING A MULTI-DIMENSIONAL DATA STREAM CUBE - A computer readable storage medium comprises executable instructions to generate a stream cube to store data received from multiple data sources. A plurality of multi-dimensional data streams are generated to represent the received data. A materialization strategy is repeatedly determined for the stream cube. The stream cube is materialized according to the materialization strategy to record the multi-dimensional data streams. | 2009-12-31 |
20090327331 | AD SYSTEM THAT INTERACTS WITH PLURAL AD ENGINES - An ad system allows a user to create and manage an ad campaign that is administered by two or more ad engines. The ad system interacts with the ad engines using a channel abstraction interface module. For each ad engine, the channel abstraction interface module translates ad information from an engine-agnostic format that is associated with the ad system to an engine-specific format that is associated with the ad engine. | 2009-12-31 |
20090327332 | METHOD FOR IMPLEMENTING A BIT-REVERSED INCREMENT IN A DATA PROCESSING SYSTEM - In a data processing system, a first instruction is received at an input of a processor. A specifier indicates both a first portion of a value and a second portion of the value. The first portion of the value is identified to be modified by the processor and the second portion of the value is identified to remain unchanged. The first instruction is decoded, and in response the processor modifies the first portion of the value by performing a bit-reversed increment to form a modified first portion. The modified first portion is combined with the second portion of the value which remained unchanged to form a first address. The first address is stored in first storage circuitry. A second instruction is decoded and in response the processor accesses data located at the first address which is assigned to a second storage circuit. | 2009-12-31 |
20090327333 | Correlating Multiple Detections of Wireless Devices Without a Unique Identifier - At a plurality of first devices, wireless transmissions are received at different locations in a region where multiple target devices may be emitting. Identifier data associated with reception of emissions from target devices at multiple first devices is generated. Similar identifier data associated with received emissions at multiple first devices are grouped together into a cluster record that potentially represents the same target device detected by multiple first devices. Data is stored that represents a plurality of cluster records from identifier data associated with received emissions made over time by multiple first devices. The cluster records are analyzed over time to correlate detections of target devices across multiple first devices. | 2009-12-31 |
20090327334 | Generating Measures of Video Sequences to Detect Unauthorized Use - A system that generates a first measure for a first version of a video sequence having a finite length, the first measure corresponding to measured transitions of a video object of the first video scene, drops pictures to obtain a second version of the video sequence of finite length, and generates a second measure for the second version, the second measure having a similar value to the first measure, the second measure corresponding to measured transitions of the video object of the first video scene. | 2009-12-31 |
20090327335 | Systems and Methods For Generating Vendor-Independent Computer-Aided Diagnosis Markers - Certain embodiments of the present invention provide a system for vendor-independent computer-aided diagnosis (CAD) marker generation including a parser adapted to parse CAD marker data into parsed data and a marker generator adapted to generate generic marker data based on the parsed data and a configuration file. The generic marker data includes a set of point pairs. | 2009-12-31 |
20090327336 | GUIDED CONTENT METADATA TAGGING FOR AN ONLINE CONTENT REPOSITORY - A method for tagging content. The method includes receiving an initial metadata tag and associating the initial metadata tag with an object of an online repository. Based on the initial metadata tag, a metadata tag knowledgebase is accessed to derive at least one suggested metadata tag. A confirmation regarding the at least one suggested metadata tag is received and the suggested metadata tag is associated with the object. The object is then uploaded to the repository, and the metadata tag knowledgebase is updated to reflect tags associated with the object. | 2009-12-31 |
20090327337 | DYNAMIC ONTOLOGY-DRIVEN TEMPLATE SELECTION - One aspect of the present invention includes dynamically selecting templates through the use of an ontology. In one embodiment, an ontology is defined to structure information system content, and an ontology classification is then assigned when content is provided to the information system. Based on this classification, the most appropriate template classified in the ontology is applied to the content. If a template exists at the content item's ontology level, this template is applied to the content. If no template exists, then the ontology tree is navigated upward to locate a template at the nearest ancestor ontology level. If a template was found by navigating the ontology tree, then this template is applied to the content item. | 2009-12-31 |
20090327338 | HIERARCHY EXTRACTION FROM THE WEBSITES - The present invention provides methods and systems for building object hierarchy. The method includes: obtaining a set of web pages from a website; conducting an inter-page analysis on the obtained web pages to extract a hierarchy of the web pages; conducting an intra-page analysis on each of the obtained web pages to identify the semantic blocks within the web page and extract a hierarchy of the semantic blocks for all the web pages; and fusing the hierarchy of the semantic blocks with the hierarchy of the web pages to generate a coordinated hierarchy. In one embodiment, the nodes on the generated coordinated hierarchy are then mapped into corresponding objects to generate the coordinated object hierarchy. Compared with the prior arts, the object hierarchy building systems and methods according to the present invention can build the object hierarchy in a more accurate and efficient way by fusing the inter-page analysis result and the intra-page analysis result. | 2009-12-31 |
20090327339 | PARTITION TEMPLATES FOR MULTIDIMENSIONAL DATABASES - Systems and methods for storing and retrieving data items in multidimensional databases are provided. Data partition templates are generated for grouping data partitions that are similar to one another, that is, that contain information specified according to particular common characteristics (for instance, time, product, geography, etc.). The data partition template includes one or more rules concerning how the data stored in partitions associated with the data partition template should be processed. A template object having the rule(s) associated therewith is generated for the data partition template. Once a data partition template is generated, a plurality of partitions are generated in accordance therewith. Each of the plurality of partitions utilizes the template object associated with the data partition template. In this way, the overhead associated with managing the partitions is significantly decreased. | 2009-12-31 |
20090327340 | System and Method for Managing Data Using a Hierarchical Metadata Management System - A system and associated method for managing data using a hierarchical metadata management system (HMMS). First, storing each pointer of at least one pointer in a metadata object wherein said pointer resides in a first repository, each unique file resides in a second repository, and said metadata object resides in third repository. Next, deleting each pointer from the first repository. Upon receipt from the first repository of an event indicating both a unique file and a pointer no longer resides in the first repository, searching for the pointer in each metadata object residing in the third repository pertaining to a HMMS. After searching and locating the pointer in a metadata object in the third repository, restoring the pointer to the first repository. Finally, notifying a hierarchical storage management system (HSM) that the pointer currently resides in the first repository thus allowing the HSM to retrieve the unique file from the second repository. | 2009-12-31 |
20090327341 | PROVIDING MULTIPLE DEGREES OF CONTEXT FOR CONTENT CONSUMED ON COMPUTERS AND MEDIA PLAYERS - Multiple degrees of context for media content that is consumable on computing platforms including PCs and personal media players is provided by logically organizing context objects into halos that surround each piece of consumable content. The context objects represent information and experiences that are contextually associated with media content to enable users to easily discover content and experiences that they will find interesting in a rich and personal manner. As a user navigates from a content item to a context object in the halo, the context object itself morphs into content that is then surrounded by a new halo of context objects to which the user may navigate. The organization of media content and information into halos enables an effective contextual paradigm that cuts across strict hierarchical structures to allow the user experience to be much more seamless and free-flowing. | 2009-12-31 |
20090327342 | DENSITY-BASED CO-LOCATION PATTERN DISCOVERY - Described is using density to efficiently mine co-location patterns, such as closely located businesses frequently found together in business listing databases, geographic search logs, and/or GPS-based data. A data space of such information is geographically partitioned into a grid of cells, with dense cells scanned first. A dynamic upper bound of prevalence measure of co-location patterns is maintained during the scanning process. If the current upper bound is smaller than a threshold, the scanning is stopped, thereby significantly reducing the computation cost for processing many cells, while providing suitable results. | 2009-12-31 |
20090327343 | SCHEMA-BASED DATA TRANSFER BETWEEN A DATA-BASED APPLICATION AND A DOCUMENT APPLICATION - Systems and methods are described for performing a schema-based data transfer between a database associated with a data-based application and a document associated with a document application. In one implementation, connection information established during an initial schema-based data transfer between the database and the document is maintained in association with the document. This connection information is then used to facilitate subsequent updating of the document based on information currently residing in the database as well as subsequent updating of the database based on information currently residing in the document in a manner that is highly automated and easy to use. | 2009-12-31 |
20090327344 | MEDIA FOUNDATION SOURCE READER - Techniques are provided to allow developers to use a unified application programming interface to access multimedia data from different containers and in different formats. | 2009-12-31 |
20090327345 | ABSTRACTION LAYER FOR ONLINE/OFFLINE RESOURCE ACCESS - A resource abstraction layer for use in a media processing environment includes a configuration file and a set of computer-executable instructions. Both network-based and locally-accessible resources are indirectly accessible via the resource abstraction layer. The configuration file has at least two data structures—a first data structure storing “virtual resource identifiers,” which reference particular resource usable in connection with rendering a particular media presentation, and a second data structure storing “virtual location identifiers,” which reference one or more locations at which particular resources are stored. The set of computer-executable instructions facilitates use of the configuration file, and seamless indirect access by the media processing environment to particular resources, regardless of where such resources are located. Temporary resources may be rendered while a particular resource is being accessed via the resource abstraction layer. | 2009-12-31 |
20090327346 | SPECIFYING MEDIA CONTENT PLACEMENT CRITERIA - To control advertisement or other media content placement in content, content owners or other interested parties may include ad or media content placement metadata in the content item. Media content placement metadata may provide specifications such as a maximum media content (e.g., ad) duration, media content rating, media content size, payment information, placement location on a screen (i.e., for videos or images) and the like. The media content metadata may be extracted and used to retrieve matching media content such as advertisements for inclusion during play of a corresponding content item. | 2009-12-31 |
20090327347 | RELATIONSHIP DATA MANAGEMENT - Some embodiments provide a system for processing relationship data that expresses relationship between various entities. In some embodiments, the entities are entities associated directly with an enterprise. The entities in some embodiments described below also include entities associated indirectly with the enterprise through other entities. However, one of ordinary skill will realize that some embodiments might only track relationships between entities directly associated with an enterprise. In some embodiments, the system consolidates disparate relationship data sets that relate to the same set of entities. For instance, in some embodiments, the system includes several data storages that store relationship data. For at least two entities, at least two different data storages store two different relationship data sets that differently express the relationship between the two entities. The system includes a hierarchy manager that receives the two different relationship data sets and consolidates the two different relationship data sets into one relationship data set that best expresses the relationship between the two entities. | 2009-12-31 |
20090327348 | JOB SUPPORT SYSTEM AND ITS METHOD - Action frame table part | 2009-12-31 |
20090327349 | Information processing apparatus, information processing method and information processing program - The present invention provides an information processing apparatus which can direct a user to a playlist different from a playlist being reproduced. There is provided the information processing apparatus including a content storage unit storing a plurality of contents therein, a playlist storage unit storing a plurality of playlists which is related to at least some of the plurality of contents, a reproducing unit sequentially reproducing a plurality of contents belonging to a first playlist in a plurality of playlists, a candidate content extracting unit extracting one or more candidate contents relating to a content being reproduced by the reproducing unit from the content storage unit, a playlist extracting unit extracting a second playlist to which the extracted candidate contents belong from the playlist storage unit, and a playlist switching unit switching a playlist to be reproduced by the reproducing unit from the first playlist into the second playlist. | 2009-12-31 |
20090327350 | INTERACTIVE REVIEW SYSTEM AND METHOD - A system, computer-implemented method, and a computer program product for defining rental property data associated with one or more rental properties within a review datastore. One or more user-definable rules are applied to the rental property data to generate suspect data. At least a portion of an interactive review form is populated with at least a portion of the suspect data. A user is enabled to provide user input associated with the suspect data via one or more data-entry fields included within the interactive review form. The user input is stored within the review datastore. | 2009-12-31 |
20090327351 | ELECTRONIC PRODUCT DESIGN - Automated electronic document design systems and method for designing and modifying product templates. When a user initiates a product design session, a product template is presented for user editing and a product description identifier is assigned to the product being designed. Document templates are assembled from individual composite elements. The individual identifiers of the component elements that make up the template being viewed by the user are associated with the description identifier. Tools are provided to allow a user to change one or more of the composite elements of the template. When a user changes an element, the identifier of the newly selected element is associated with the description identifier. Component elements of one template can be individually used, as appropriate, to prepare customized templates for another part of the same document or for different documents. | 2009-12-31 |
20090327352 | RECONCILIATION AND REMEDIATION WITH COMMUNICATION ARCHIVES - Techniques for reconciliation and remediation of messages sent by a server for storage in an archive are described. Some techniques may comprise receiving a message to be reconciled corresponding to a message sent by a server to be stored in an archive. The received message may be categorized for reconciliation, and a delivery confirmation query may be issued to the archive according to categorization of the message for reconciliation. Based on the response to the delivery confirmation query, it can be determined with certainty whether the message sent to the archive for storage is indeed stored at the archive. Other embodiments are described and claimed. | 2009-12-31 |
20090327353 | METHOD FOR MEASURING WEB SITE PERFORMANCE - An approach for systematically and objectively assessing the health of a web site, or other complex system, using two layers of information. A scoring method is used to provide an objective qualitative judgment, together with detailed areas of analysis if desired. A set of metrics is identified, and a health score for each metric is calculated based upon assessment parameters or angles, based upon the actual data and upon the expectations. The overall health score of the system is then calculated as a composite metric based upon the individual metric health scores. A total score, together with a visual representation of the individual metric scores, is presented to the end user. The two layers of information utilized in the general framework include the domain (which determines the set of metrics and assessment parameters, e.g., web site analysis) and the model (or processing desired, e.g., a scoring model or alert model). | 2009-12-31 |
20090327354 | NOTIFICATION AND SYNCHRONIZATION OF UPDATED DATA - Techniques for notification and synchronization are described. Some techniques may comprise receiving a synchronization request and establishing an updating session connection. The updating session may be based on a delay interval parameter specifying a length of a delay interval and a collection parameter specifying one or more collections to be synchronized. When data for the collections to be synchronized is unchanged, the updating session may be maintained, and the synchronization request may be kept pending. Upon receiving a notification from a data store during the delay interval that updated data is available for one or more of the collections to be synchronized, a synchronization session connection is established with the data store to retrieve the updated data. A notification and synchronization message comprising the updated data may be sent as a response to the pending synchronization request. Other embodiments are described and claimed. | 2009-12-31 |
20090327355 | SYSTEM AND METHOD FOR COORDINATING A POINT-IN-TIME COPY AMONG MULTIPLE DATA PROVIDERS - A system and method for coordinating a point-in-time copy (PITC) of a file or set of data distributed (e.g., striped) across multiple data providers (e.g., filers, file servers, storage arrays). A service coordinator receives a PITC request for a parent file, initializes the PITC's metadata and instructs the data providers to generate PITC subcomponents for the portions (e.g., sub-mirrors) of the file that they store. A scoreboard is created to track the status of the PITC, and includes an entry for each PITC subcomponent. Quality of service characteristics for the PITC may be copied from the parent and/or received with the request. If those characteristics cannot be attained, the PITC may be aborted. As PITC subcomponents are completed, they are returned to the service coordinator for assembly of the PITC. | 2009-12-31 |
20090327356 | METHOD AND SYSTEM FOR IMPROVED TRANSITION BETWEEN ALTERNATING INDIVIDUAL AND COMMON CHANNEL PROGRAMMING VIA SYNCHRONIZED PLAYISTS - Embodiments of the present invention provide a method, apparatus and system for a synchronized playlist calculation, which is used to calculate playlists and filler media for seamless transitions during the alternation of individual and common channel programming. In various embodiments of the present invention, an optimum switching (synchronization) point is determined for the individual channels. Subsequently, channels not having a termination/end point consistent with the determined switching point are padded with respective filler content (media) to coordinate the termination points of the channels to be synchronized. The amount of filler content needed for each channel is determined respectively for a channel. Similarly, a switching (synchronization) point is determined for the common channel to provide accurate transitions. | 2009-12-31 |
20090327357 | TIME BASED FILE SYSTEM FOR CONTINUOUS DATA PROTECTION - A plurality of tokens corresponding to a plurality of data units written to a rewritable file system is stored, wherein an ordering relationship is maintained among the plurality of tokens, wherein the ordering relationship is such that a first token corresponding to a first data unit is of a lesser numerical value in comparison to a second token corresponding to a second data unit, and wherein the first data unit is written at an earlier point in time in comparison to the second data unit. The rewritable file system is reverted to an indicated point in time based on the ordering relationship that is maintained among the stored plurality of tokens. | 2009-12-31 |
20090327358 | RESOLVING CONFLICTS IN CONTENT MANAGEMENT SYSTEMS - A conflict resolution system is described for reducing false conflicts among entities synchronized within a content management system. A typical content management system maintains a version for an entity that is incremented each time an endpoint modifies the entity, including changes that affect the metadata rather than the content of the entity. The conflict resolution system adds a new content version that is updated when the content of the entity changes. By comparing content version information, endpoints can automatically resolve false conflicts that occur when an endpoint has modified the metadata of the entity. | 2009-12-31 |
20090327359 | METHOD OF CHECKING VERSION NUMBER OF ENCRYPTION INFORMATION, AND OPTICAL DISC PLAYBACK DEVICE - In the case of a BD or the like, when encryption information used for copyright protection is updated, the version number of defective encryption information is stored into an area of a commercial medium other than the content recording area, and the user is prompted to update to a newer version number. | 2009-12-31 |
20090327360 | EFFICIENT FILE MANAGEMENT THROUGH GRANULAR OPPORTUNISTIC LOCKING - Improved methods and systems for granular opportunistic locking mechanisms (oplocks) are provided for increasing file caching efficiency. Oplocks can be specified with a combination of three possible granular caching intentions: read, write, and/or handle. An oplock can be specified with an identifier that indicates a client/specific caller to avoid breaking the original oplock due to an incompatibility from other requests of the same client. An atomic oplock flag is added to create operations that allow callers to request an atomic open with an oplock with a given file. | 2009-12-31 |
20090327361 | DATA REPLICATION FEEDBACK FOR TRANSPORT INPUT/OUTPUT - Architecture for efficiently ensuring that data is stored to the desired destination datastore such as for replication processes. A copy of data (e.g., messages) sent to a datastore for storage is stored at an alternate location until a received signal indicates that the storage and replication was successful. As soon as the feedback signal is received, the copy is removed from the alternate location, and hence, improves input/output (I/O) and storage patterns. The feedback mechanism can also be used for monitoring the status of data transport associated with log shipping, for example, and taking the appropriate actions when storage (e.g., replication) is not being performed properly. | 2009-12-31 |
20090327362 | INCREMENTAL BACKUP OF DATABASE FOR NON-ARCHIVE LOGGED SERVERS - Systems and methods for computer system data backup. A computer system includes an application server operating on a first host and a backup application configured to create new target database images for a sequence of backup datasets. The backup datasets include data from source databases associated with the application server. At least one of the source databases is hosted on a remote source host separate from the first host. The computer system includes a client registered with the application server and installed on a backup host. The client stores a seed document in each of the new target database images and modifies each seed document to specify which portions of a backup dataset in the sequence are to be stored in each new target database image. The backup application updates each new target database image based on the contents of a seed document. | 2009-12-31 |
20090327363 | SYSTEMS AND METHODS FOR PROCESSING ELECTRONICALLY TRANSMITTED HEALTHCARE RELATED TRANSACTIONS - Systems and methods for the processing, modifying, and/or performance of a clinical, administrative and/or financial “value-add” service to an electronic healthcare related transaction from a healthcare provider to a third party such as a pharmacy. A prescription switch provider receives an incoming transaction from a healthcare provider system. The switch provider may then parse the transaction to review or modify data contained in the transaction and/or perform a value-add service or function based on the data contained in the transaction. Alternatively, the switch provider may copy the transaction for parallel processing. The transaction may be forwarded to a third party system, and a response message from the switch provider or the third party may be transmitted to the healthcare provider system pertaining to the modified transaction data and/or value-add service performed. | 2009-12-31 |
20090327364 | Method of redundant data storage - Embodiments of the invention concern a method of redundant data storage in a peer-to-peer overlay network (N), and a network node ( | 2009-12-31 |
20090327365 | METHOD AND SYSTEM FOR COPYING A FILE USING A PORTABLE ELECTRONIC DEVICE - A method, system and computer-usable medium for copying a file are disclosed. | 2009-12-31 |
20090327366 | SYSTEM AND METHOD FOR CUSTOMIZING THE STORAGE AND MANAGEMENT OF DEVICE DATA IN A NETWORKED ENVIRONMENT - A system and method for customizing the storage of data according to data attributes are provided. A user is provided with a graphical user interface for generating data archive profiles. The data archive profiles can include information regarding the attributes of the device data, specifications regarding the storage of the data, specifications regarding the retrieval of the archived data, and management of the archived data during storage. The execution of the data archive profiles facilitates the individual processing of specific data types or individual pieces of identifiable data. | 2009-12-31 |
20090327367 | Common Block Storage Infrastructure - Common block storage infrastructure techniques are described in which files are created through interaction with a file system to reserve extents in a volume on behalf of volume storage drivers, which may form a driver stack that resides logically on top of the volume. The files protect the reserved extents within the volume for use by the volume storage drivers, such as to store metadata related to operations performed by the drivers. When reserved extents are created, a location of the reserved extents is communicated through the driver stack to a corresponding volume storage driver. Volume storage drivers may also be configured to discover their corresponding reserved extents and communicate these to upper-level drivers and components. Accordingly, when a volume storage driver manipulates data in the volume, it may do so with awareness of the reserved extents of the other volume storage drivers. | 2009-12-31 |
20090327368 | Dynamic Write Balancing in a Data Storage System - Available storage locations are identified by searching through a free blocks object non-sequentially. The free blocks object may be logically divided into sections, and the sections may be searched non-sequentially. Each section may be logically divided into a number of sub-sections, and the sub-sections of the various sections may be searched non-sequentially. A new section may be added to the free blocks object, and the added section may be searched until a predetermined threshold or condition is reached, at which point non-sequential searching may begin or resume. | 2009-12-31 |
20090327369 | METHOD AND APPARATUS FOR MULTI-FORMAT DATA EXCHANGE - Multi-format file transfer can be accomplished, without the need for storing files in each of a plurality of formats, by linking a plurality asset-containing first folders ( | 2009-12-31 |
20090327370 | DEFRAGMENTATION OF DIGITAL STORAGE MEDIA - The invention concerns a technique for defragmenting digital storage media (disks). The invention is based on a filter driver or corresponding technology receiving all I/O to and/or from the file system driver, and which by itself is able to send I/O requests to the file system driver FIG. | 2009-12-31 |
20090327371 | Storage control device - The storage control device includes: a control unit that stores a data file that includes main data and file information in a write-once type storage medium having a data information area containing a plurality of clusters having a predetermined size; an acquisition unit that acquire size information of the clusters from the storage medium; a calculation unit that calculates a number of clusters required for storing file information corresponding to each data file in data storing area using the number of data files to be stored in the storage medium, the size of file information, and the size information of the clusters; and a setting unit that sets a data information area corresponding to the number of clusters calculated by the calculation unit as a storage area for file information. | 2009-12-31 |
20090327372 | Garbage Collection via Multiobjects - Computer system, method and article of manufacture for garbage collection in computer systems that combines individual objects into linearized trees called multiobjects and thereafter utilizes multiobjects to implement most memory management operations such as detection of dead objects and compaction without the need to inspect individual objects, thereby improving performance and reducing power consumption. | 2009-12-31 |
20090327373 | METHOD FOR PERFORMING MEMORY LEAK ANALYSIS INSIDE A VIRTUAL MACHINE - A method, system, computer program product, and computer program storage device for performing a memory leak analysis inside a virtual machine is disclosed. By utilizing thread stack(s), class statics, and/or a list of root objects, a DFS algorithm starts execution at root objects in the thread stack(s), class statics, and/or a list of root objects. Upon fully processing an object, a reachability (sum of sizes of all child objects plus a size of the object itself) of the object is calculated. When the reachability of the object is larger than a threshold and when all reachabilities of children of the objects are less than another threshold (i.e., a largest child reachability of the object is less than another threshold), the object is determined as a potential source of a memory leak. | 2009-12-31 |
20090327374 | METHOD AND APPARATUS FOR PERFORMING CONCURRENT GARBAGE COLLECTION - One embodiment of the present invention provides a system that facilitates performing concurrent garbage collection. Note that the system uses hardware-supported GC barriers. During operation, the system executes a first mutator thread. While executing the first mutator thread, the system performs a garbage-collection operation using a garbage-collector thread. Performing the garbage-collection operation involves: discovering a live object in a from-space, which is being collected; creating a copy of the live object to a to-space, where live objects are copied to during garbage collection; and replacing the live object in the from-space with a forwarding pointer which points to a location of the copy of the live object in the to-space. Note that in some embodiments, the system marks cache lines comprising the live object in from-space as “forwarded,” which prevents any mutator threads from touching the cache lines. Additionally, in some embodiments, the system determines if the first mutator thread holds any additional references to the from-space. If so, the system leaves the first mutator thread marked as “dirty,” wherein dirty is the initial state for mutator threads. If not, the system marks the first mutator thread as “clean.” | 2009-12-31 |
20090327375 | Method and Apparatus for Handling Edge-Cases of Event-Driven Disposition - Retention of data is managed and data holds are enforced. At least one event consumer data source contains data that is subject to a retention schedule that defines rules for the disposition of the data. An enterprise retention management (ERM) application accepts at least one hold request that defines at least a portion of the data that must be held from disposition. A disposition request is also accepted by the ERM that comprises an instruction to dispose of at least a portion of the data based on the rules within the retention schedule. The disposition request is filtered to dispose of the portion of data identified in the disposition request minus the held data, which comprises disposition survivor data. An event-driven disposition mechanism disposes of the disposition survivor data as soon as possible after the disposition survivor data is released from hold or unlocked. | 2009-12-31 |
20090327376 | B-FILE ABSTRACTION FOR EFFICIENTLY ARCHIVING SELF-EXPIRING DATA - Systems and methods are provided for data processing and storage management. In an illustrative implementation an exemplary computing environment comprises at least one data store, a data processing and storage management engine (B-File engine) and at least one instruction set to instruct the B-File engine to process and/or store data according to a selected data processing and storage management paradigm. In an illustrative operation, the illustrative B-File engine can generate a B-File comprising multiple buckets and store sample items in a random bucket according to a selected distribution. When the size of the B -FILE grows to reach a selected threshold (e.g., maximum available space), the B-File engine can shrink the B-File by discarding the largest bucket. Additionally, the B-File engine can append data to existing buckets and explicitly cluster data when erasing data such that data can be deleted together into the same flash block. | 2009-12-31 |
20090327377 | Copying entire subgraphs of objects without traversing individual objects - Copying or compacting performance in garbage collection is improved by copying a first memory area (preferably comprising multiple objects) to a second memory area without traversing individual objects in the copied memory area and adjusting all copied memory locations identified as pointers in a metadata data structure. An entire linearized subgraph of the object graph can be copied at a time. | 2009-12-31 |
20090327378 | Instruction-Based Parallel Median Filtering - An instruction-based parallel median filtering processor and method sorts in parallel each combination of pairs of inputs into greater and lesser values; determines from that sorting the minimum, maximum and median filter values of the inputs; processes one of those values and provides the processed value as an input; and applies an instruction for providing one of the values to the processing step, and at least one other instruction for enabling indication of at least one of the maximum, minimum, median filter values. | 2009-12-31 |
20090327379 | RANDOM NUMBER GENERATING DEVICE - A random number generating device includes: a pulse voltage generator configured to generate a pulse voltage having an amplitude of 26 mV or more; a random noise generating element including source and drain regions formed at a distance from each other on a semiconductor substrate, a tunnel insulating film formed on a portion of the semiconductor substrate located between the source region and the drain region, and a gate electrode formed above the tunnel insulating film and to which the pulse voltage is applied, the random noise generating element configured to generate a random noise contained in a current flowing between the source region and the drain region; and a random number generating unit configured to generate a random number signal based on the random noise. | 2009-12-31 |
20090327380 | Circuit and method of generating a random number using a phass-locked-loop circuit - A circuit that generates a random number includes a phase-locked loop circuit and a sampling circuit. The phase-locked loop circuit generates an internal clock signal that is synchronized with a reference signal in which the internal clock has a random noise. The sampling circuit samples the reference signal in response to the internal clock signal to generate a random data bit. The circuit of generating a random number is capable of generating a random number with high randomness and is capable of operating at a relatively low frequency. | 2009-12-31 |