Patent application number | Description | Published |
20090157683 | Method and System for Accessing Selected Content - A system, method and computer product for accessing content by receiving as input an anchor, where the anchor is associated with selected content within an existing document, the document for example being an existing web page, and upon selecting the anchor, displaying the selected content to the user. Also disclosed is a system, method and computer product for identifying content, creating an anchor for the selected content and transmitting the selected content to one or more users over a communication link. | 06-18-2009 |
20100235361 | Optimizing Questionnaires - Online and other electronic surveys are increasingly being looked upon as highly useful and versatile tools for gauging popular opinions in a variety of areas. Challenges continually arise in terms of optimizing questionnaires so as to maximize their effectiveness in mapping trends among a population over time. There is broadly contemplated herein, in accordance with at least one embodiment, of the invention, the automation of the usage of value dependencies by way of exposing and eliminating redundancy in survey or questionnaire databases. Dynamically, updated information can be used to continuously evolve a selection of questions, while fairness can be ensured in this selection by averting a situation of continual non-selection of certain questions. | 09-16-2010 |
Patent application number | Description | Published |
20090300006 | TECHNIQUES FOR COMPUTING SIMILARITY MEASUREMENTS BETWEEN SEGMENTS REPRESENTATIVE OF DOCUMENTS - Keyword frequency data for a plurality of document-derived segments is represented in a matrix form in which each segment is represented as a vector of dimensionality equal to the number of keywords. The matrix may be subdivided into a plurality of sub-matrices, each preferably corresponding to a non-overlapping portion of the plurality of keywords. When determining a similarity measurement between any pair of segments, at least a portion of the keyword frequency data for each sub-matrix's non-overlapping keywords are used to determine a sub-matrix dot product for the pair of segments. The resulting plurality of sub-matrix dot products are then summed together in order to provide the similarity measurement. Keywords that are synonyms of each other may be accommodated through the modification of keyword frequency data. Where the keyword frequency data in the matrix representation is relative sparse, compressed views of the matrix representation may be provided. | 12-03-2009 |
20100254604 | METHOD FOR THE LOGICAL SEGMENTATION OF CONTENTS - A document to be segmented is converted into a common representation format, if necessary. Parsing of the document results in a document model that is analyzed based on at least one structure-dependent function to identify segments within the document. In one embodiment, the structure-dependent function may comprise a template, or a best-fit template of a plurality of templates, used for comparison with the document model. In other embodiments, the structure-dependent function may comprise table of contents information, font properties within the document model and/or an average segment size determined according to previously identified segments in one or more additional documents that are related to the document under consideration. Semantic-content dependent functions may be applied to further refine the analysis by identifying sub-segments within the extracted segments, or by identifying segments that may be properly merged according to the similarity of their respective semantic content. | 10-07-2010 |
20130185056 | SYSTEM FOR GENERATING TEST SCENARIOS AND TEST CONDITIONS AND EXPECTED RESULTS - A requirements testing system facilitates the review and analysis of requirement statements for software applications. The requirements testing system automatically generates test artifacts from the requirement statements, including test scenarios, test conditions, test hints, and expected results. These test artifacts characterize the requirements statements to provide valuable analysis information that aids understanding what the intentions of the requirement statements are. The automation of the generation of these test artifacts produces numerous benefits, including fewer errors, objectivity, and no dependency on the skills and experience of a creator. | 07-18-2013 |
20130245849 | CUSTOMER-CENTRIC DEMAND SIDE MANAGEMENT FOR UTLITIES - A method and system for reducing demand on a power grid through demand side management includes receiving assigned priorities from a customer for smart appliances and for appliances plugged into sockets of one or more smart plugs of the customer, the assigned priorities indicative of a customer-preferred sequence for disconnection of, or adjustment of power to, the appliances from the power grid. The system determines whether to disconnect or adjust power to at least one of the appliances of the customer; and selects at least one of the appliances according to the assigned priorities to reduce demand on the power grid. The system sends one or more commands, the one or more commands indicative to the one or more smart plugs to disconnect or adjust power to the selected at least one of the appliances based on selecting at least one of the appliances. | 09-19-2013 |
20150261743 | GENERATING A SEMANTIC NETWORK BASED ON SEMANTIC CONNECTIONS BETWEEN SUBJECT-VERB-OBJECT UNITS - A device may obtain text to be analyzed to determine semantic connections between sections of the text. The device may identify subject-verb-object (SVO) units included in the text, and may determine SVO unit information that describes the SVO units. The device may analyze the SVO unit information to determine semantic connection information that identifies one or more semantic connections between two or more of the SVO units. The one or more semantic connections may identify relationships between verbs associated with the two or more of the SVO units. The device may generate a semantic network based on the SVO unit information and the semantic connection information, and may provide information regarding the semantic network. | 09-17-2015 |
Patent application number | Description | Published |
20130173092 | SYSTEMS AND METHODS FOR ISSUING A HARD LANDING WARNING AND PROVIDING MAINTENANCE ADVISORIES FOR HARD LANDING INCIDENTS - An aircraft is provided. The aircraft may include, but is not limited to, an accelerometer configured to measure a deceleration experienced by the aircraft and a processor coupled to the accelerometer. The processor may be configured to determine if the aircraft experienced a hard landing if the deceleration experienced by the aircraft was greater than a predetermined threshold, and generate a maintenance advisory if the aircraft experienced a hard landing. | 07-04-2013 |
20140129058 | SYSTEM AND METHOD FOR ENHANCING PILOT DECISION MAKING DURING LANDING IN CHALLENGING WEATHER - A system and method are provided for advising a pilot if it is safe to continue an approach to landing in adverse weather conditions. The system considers flight parameters from the flight management system, stored runway situational parameters, and weather information. The weather information may include, for example, reports, forecasts, and data collected in real time. The advice may be display as one of a plurality of recommendations based on a comparison of the weather information to a threshold. | 05-08-2014 |
20140214286 | SYSTEM AND METHOD FOR TRANSMITTING HELICOPTER HEALTH AND LOCATION - A system and method combines integrated system health usage monitoring and flight tracking of a helicopter, and transmits the information to monitoring sites for managing flight operations in real time, thereby providing the functionality of both system health and flight tracking and reducing weight related constraints faced by helicopters. With enhanced availability of system health data, vital information for maintenance and flight position data-stream, operations, flight dispatch and maintenance can plan for required services more efficiently. | 07-31-2014 |
Patent application number | Description | Published |
20090037933 | METHOD AND APPARATUS FOR ACCESSING A COMPATIBLE LIBRARY FOR AN EXECUTABLE - The illustrative embodiments described herein provide a computer-implemented method, apparatus, and computer-usable program code for accessing a compatible library. The process receives a file name associated with a library reference. The library reference is included in an executable, and indicates a library used for executing the executable. The process receives environmental variable information in response to identifying an unavailable library in a secondary memory. The unavailable library is associated with the file name. The process accesses the compatible library from a shared library segment using the file name in response to receiving the environmental variable information. The compatible library is associated with the file name. The process utilizes the compatible library to execute the executable. | 02-05-2009 |
20110088033 | PROVIDING THREAD SPECIFIC PROTECTION LEVELS - A method, system and computer program product is disclosed for providing thread specific protection levels in a multithreaded processing environment. The method comprises generating a group of threads in a process, one of the group of threads opening a thread entity, and that one of the group of threads specifying one or more levels of access to the thread entity for the other threads. In one embodiment, when a first of the threads attempts to perform a specified operation on the thread entity, the method of this invention determines whether that first thread is the one of the group of threads that opened the thread entity. When the first thread is not that one of the group of threads, the first thread is allowed to perform the specified operation if and only if that operation is permitted by the specified one or more levels of access. | 04-14-2011 |
20120317443 | VIRTUAL DEBUGGING SESSIONS - An approach to providing multiple concurrently executing debugging sessions for a currently executing operating system. The approach involves providing one first debugging session for debugging the currently executing operating system. The first debugging session has read access and write access to the data of the currently executing operating system. The approach also involves providing one or more second debugging sessions for the currently executing operating system. Each of the second debugging sessions has read-only access to the data of the currently executing operating system. The second debugging sessions run simultaneously with the first debugging session if the second debugging sessions are started while the first debugging session is active. As a result, multiple users can simultaneously debug the currently executing operating system. A lock may be used to ensure that only the first debugging session has write access to the data. The lock may be shared between the various debugging sessions for the operating system. | 12-13-2012 |
20130152105 | LOCK FREE USE OF NON-PREEMPTIVE SYSTEM RESOURCE - A computer-implemented method for lock-free use of a non-preemptive system resource by a preemptive thread, which may be interrupted. The method comprises registering a non-preemptive system resource and a first level reclaim handler for the non-preemptive system resource with the kernel of an operating system, registering a second level reclaim handler with the kernel, wherein the second level reclaim handler is included in an application program, and running the application program as a preemptive thread using the non-preemptive system resource. The first level reclaim handler is code that is a part of the implementation of the non-preemptive system resource in the kernel. The second level reclaim handler is code that is part of the application and is registered with the kernel before the application uses the non-preemptive system resource. The method enables a preemptive thread using a non-preemptive system resource to be preempted without crashing. | 06-13-2013 |
20140032975 | DYNAMIC HARDWARE WATCHPOINT - A method and apparatus for monitoring changes to a block of data is disclosed. A computer sets a first hardware watchpoint to monitor changes to the block of data at a current location of the block of data in memory and a second hardware watchpoint to monitor changes at a selected location in the memory where a reference to the block of data is located. Responsive to the second hardware watchpoint being triggered by a change at the selected location where the reference to the block of data is located, the computer identifies a new location of the block of data in the memory based on the change that triggered the second hardware watchpoint. Subsequent to identifying the new location of the block of data, the computer then resets the first hardware watchpoint to monitor changes to the block of data at the new location of the block of data. | 01-30-2014 |
20140082428 | Dynamic Hardware Watchpoint - An apparatus for monitoring changes to a block of data is disclosed. A first hardware watchpoint is set to monitor changes to the block of data at a current location of the block of data in memory and a second hardware watchpoint is set to monitor changes at a selected location in the memory where a reference to the block of data is located. Responsive to the second hardware watchpoint being triggered by a change at the selected location where the reference to the block of data is located, a new location of the block of data in the memory is identified based on the change that triggered the second hardware watchpoint. Subsequent to identifying the new location of the block of data, the first hardware watchpoint is reset to monitor changes to the block of data at the new location of the block of data. | 03-20-2014 |
20150020074 | SPECIFYING LEVELS OF ACCESS TO A THREAD ENTITY IN A MULTITHREADED ENVIRONMENT - Techniques are disclosed for providing thread specific protection levels in a multithreaded processing environment. An associated method includes generating a group of threads in a process, one of the group of threads opening a thread entity, and that one of the group of threads specifying one or more levels of access to the thread entity for the other threads. In one embodiment, when a first of the threads attempts to perform a specified operation on the thread entity, the method includes determining whether that first thread is the one of the group of threads that opened the thread entity. When the first thread is not that one of the group of threads, the first thread is allowed to perform the specified operation if and only if such operation is permitted by the specified one or more levels of access. | 01-15-2015 |
Patent application number | Description | Published |
20140012906 | PEER-TO-PEER ARCHITECTURE FOR WEB TRAFFIC MANAGEMENT - Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter. | 01-09-2014 |
20150341433 | PEER-TO-PEER ARCHITECTURE FOR WEB TRAFFIC MANAGEMENT - Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter. | 11-26-2015 |