Patent application number | Description | Published |
20130083902 | Unique Global Identifier Header for Minimizing Prank Emergency 911 Calls - A prank call server that performs 911 prank call filtering over a 911 emergency call system, prior to routing a 911 call to a PSAP. The inventive prank call server identifies prank calling devices, regardless of current service subscription, by retrieving and analyzing emergency call data pertaining to detected prank 911 calls. The prank call server assigns a unique global identifier to each 911 call detected on the 911 emergency call system. Unique global identifiers enable a PSAP to uniquely identify prank 911 calls that are identified thereon. A PSAP transmits a prank call signal and a relevant unique global identifier to the prank call server, for each prank 911 call that is detected. A prank call signal/unique global identifier combination triggers the prank call server to store all available call data for a referenced prank 911 call in to a prank call database, for subsequent prank call filtering analysis. | 04-04-2013 |
20130086274 | Timing Management for Implementing Smarter Decisions in Time-Constrained Complex Distribution Systems - A timing management node that assigns and adjusts timeout values for a time-constrained complex distributed system based on the nature of a system request, preferences of a customer furnishing a system request, and/or a current state of a complex distributed system. A timing management node evaluates information regarding a system request and information regarding a current state of a complex distributed system to generate timing requirements for the system request. Timing requirements are compiled in a timing policy messager and passed amongst nodes of a complex distributed system with process flow. Timing requirements may be revised during request processing to reflect events that have occurred within the distributed system. A timing policy message contains a timeout value and a total time elapsed parameter for a system request, to permit a complex distributed system to make smarter processing decisions based on a known time remaining to process the given system request. | 04-04-2013 |
20140341358 | Unique Global Identifier Header for Minimizing Prank 911 Calls - A prank call server that performs 911 prank call filtering over a 911 emergency call system, prior to routing a 911 call to a PSAP. The inventive prank call server identifies prank calling devices, regardless of current service subscription, by retrieving and analyzing emergency call data pertaining to detected prank 911 calls. The prank call server assigns a unique global identifier to each 911 call detected on the 911 emergency call system. Unique global identifiers enable a PSAP to uniquely identify prank 911 calls that are identified thereon. A PSAP transmits a prank call signal and a relevant unique global identifier to the prank call server, for each prank 911 call that is detected. A prank call signal/unique global identifier combination triggers the prank call server to store all available call data for a referenced prank 911 call in to a prank call database, for subsequent prank call filtering analysis. | 11-20-2014 |
20160006869 | Unique Global Identifier Header for Minimizing Prank Emergency 911 Calls - A prank call server that performs 911 prank call filtering over a 911 emergency call system, prior to routing a 911 call to a PSAP. The inventive prank call server identifies prank calling devices, regardless of current service subscription, by retrieving and analyzing emergency call data pertaining to detected prank 911 calls. The prank call server assigns a unique global identifier to each 911 call detected on the 911 emergency call system. Unique global identifiers enable a PSAP to uniquely identify prank 911 calls that are identified thereon. A PSAP transmits a prank call signal and a relevant unique global identifier to the prank call server, for each prank 911 call that is detected. A prank call signal/unique global identifier combination triggers the prank call server to store all available call data for a referenced prank 911 call in to a prank call database, for subsequent prank call filtering analysis. | 01-07-2016 |
Patent application number | Description | Published |
20090177704 | RETENTION POLICY TAGS FOR DATA ITEM EXPIRATION - Architecture for retention policy tagging of data items such as messages for expiring data items without data reorganization. Retention policy tags can be applied to items, conversations, folders, and/or distribution lists, for example. Retention policy tags provide a way to manage (e.g., expire) data items such as email, for example, and reduce the corporate burden for compliance in documents of all types. Tags can be applied to data items individually and in-place, and do not impose changes to the natural workflow of the user. The use of expiry policy tags provides a solution by removing the pain point around physically moving messages to an unfamiliar folder hierarchy. | 07-09-2009 |
20090319456 | MACHINE-BASED LEARNING FOR AUTOMATICALLY CATEGORIZING DATA ON PER-USER BASIS - Architecture that employs machine-based learning to automatically categorize data on a per-user basis. Auto-tagging reduces the burden on infoworkers by creating a machine learning model to learn from user tagging behavior or preferences. Once this information is obtained, a trained model for this specific user is used to assign tags to incoming data, such as emails. The architecture finds particular applicability to compliance and message retention policies that otherwise would mandate extra work for the infoworker. The architecture learns the tagging behavior of a user and uses this learned behavior to automatically tag data based on the user's prior tagging habits. A regression algorithm is employed to process the training data according to an n-dimensional framework for prediction and application of the tag(s) to the incoming messages. | 12-24-2009 |
20100138500 | Online Archiving of Message Objects - This disclosure is directed to automatically moving message objects, such as email message objects, from online source mailbox databases to online archive mailbox databases. As described herein, each email message in a source mailbox database is directly or indirectly associated with a retention policy tag. The retention policy tag associated with a message object in a source mailbox database specifies a retention period. The message object remains in source mailbox database until the retention period expires for the message object. When the retention period for the message object expires, the message object is automatically moved to an archive mailbox database. | 06-03-2010 |
20100306147 | Boosting to Determine Indicative Features from a Training Set - Determining indicative features may be provided. First, a first set of features may be determined using a document frequency process. Then a second set of features may be determined using a boosting process. Using the boosting process may comprise using an approximation for a one-dimensional optimization. The approximation may include an upper bound. Next, the first set of features and the second set of features may be combined into a combined set of features. The combined set of features may comprise a union of the first set of features and the second set of features. At least one document may then be classified based on the combined set of features. | 12-02-2010 |
Patent application number | Description | Published |
20090320044 | Peek and Lock Using Queue Partitioning - A queue management system may store a queue of messages in a main queue. When a message is processed by an application, the message may be moved to a subqueue. In the subqueue, the message may be locked from other applications. After processing the message, the application may delete the message from the subqueue and complete the action required. If the application fails to respond in a timely manner, the message may be moved from the subqueue to the main queue and released for another application to service the message. If the application responds after the time out period, a fault may occur when the application attempts to delete the message from the subqueue. Such an arrangement allows a “peek and lock” functionality to be implemented using a subqueue. | 12-24-2009 |
20100309928 | ASYNCHRONOUS COMMUNICATION IN AN UNSTABLE NETWORK - Embodiments are directed to promptly reestablishing communication between nodes in a dynamic computer network and dynamically maintaining an address list in an unstable network. A computer system sends a message to other message queuing nodes in a network, where each node in the message queuing network includes a corresponding persistent unique global identifier. The computer system maintains a list of unique global identifiers and the current network addresses of those network nodes from which the message queuing node has received a message or to which the message queuing node has sent a message. The computer system goes offline for a period of time and upon coming back online, sends an announcement message to each node maintained in the list indicating that the message queuing node is ready for communication in the message queuing network, where each message includes the destination node's globally unique identifier and the node's current network address. | 12-09-2010 |
20120134370 | ASYNCHRONOUS COMMUNICATION IN AN UNSTABLE NETWORK - Embodiments are directed to promptly reestablishing communication between nodes in a dynamic computer network and dynamically maintaining an address list in an unstable network. A computer system sends a message to other message queuing nodes in a network, where each node in the message queuing network includes a corresponding persistent unique global identifier. The computer system maintains a list of unique global identifiers and the current network addresses of those network nodes from which the message queuing node has received a message or to which the message queuing node has sent a message. The computer system goes offline for a period of time and upon coming back online, sends an announcement message to each node maintained in the list indicating that the message queuing node is ready for communication in the message queuing network, where each message includes the destination node's globally unique identifier and the node's current network address. | 05-31-2012 |
20130244686 | EFFICIENT POWER USAGE IN POSITION TRACKING OPERATIONS - Techniques and tools for reducing power consumption of computing devices (e.g., mobile devices such as mobile phones and tablet computers) that perform position tracking operations are described. In described examples, a low-power processor calculates (e.g., in real time) position information (e.g., GPS position fixes) based on information received from a positioning system (e.g., GPS) and stores the position information for later use in a buffer associated with the low-power processor (e.g., in storage on the low-power processor). Described examples allow position information to be calculated in real time and stored while the device is in a low-power state, and can be used with location-based applications that do not require position information to be delivered to the application in real time. | 09-19-2013 |
20140114564 | MOBILE NAVIGATION TO A MOVING DESTINATION - A source device can navigate towards a moving destination target device, such as when two mobile phones are moving towards each other. The source device can receive an initial position of the target and a route to the target. As the source device and target device simultaneously move, the route can be updated. For example, if a distance of movement exceeds a threshold (e.g., 1 mile) the route can be updated. In another embodiment, a target device can switch between position tracking devices so as to provide less accurate position information, but save power, or provide high accuracy position information at the cost of higher power consumption. Generally, the switching between position tracking devices and the frequency at which the route to the destination point can be based on the distance apart between the source device and target device. | 04-24-2014 |
20140370909 | REDUCED POWER LOCATION DETERMINATIONS FOR DETECTING GEO-FENCES - Various different areas of interest are identified, these areas being geographic areas that are also referred to as geo-fences. Whether a computing device is in a geo-fence can be determined based on the location of the geo-fence and the location of the computing device. The location of a computing device can be determined using various different location determination techniques, such as wireless networking triangulation, cellular positioning, Global Navigation Satellite System positioning, network address positioning, and so forth. Various power saving techniques are implemented to determine which techniques are used and when such techniques are used to reduce power consumption in the computing device. | 12-18-2014 |
20140370910 | DETECTING GEO-FENCE EVENTS USING VARYING CONFIDENCE LEVELS - The location of a computing device is determined, and the location of an area of interest that is a geographic area referred to as a geo-fence is identified. The accuracy of the determined location of the computing device has an associated uncertainty, so the exact position of the computing device cannot typically be pinpointed. In light of this, the uncertainty associated with the determined location is evaluated relative to the size of the geo-fence in order to determine whether the computing device is inside the geo-fence or outside the geo-fence. Based on this determination, various actions can be taken if the user is entering the geo-fence, exiting the geo-fence, remaining in the geo-fence for at least a threshold amount of time, and so forth. | 12-18-2014 |
20140370911 | COALESCING GEO-FENCE EVENTS - A device location is determined, and the location of an area of interest that is a geographic area referred to as a geo-fence is identified. Multiple geo-fences can be identified by the device, and different geo-fences can be associated with different programs on the device. An operating system of the device implements multiple different periods of operation for the device, including a conservation period during which certain programs are not typically scheduled to run, and an execution period during which such programs are typically scheduled to run. A system identifies geo-fence events, which occur when the device enters or exits the geo-fence. The system maintains a record of the geo-fence events for each of multiple geo-fences, and provides to a program selected ones of those geo-fence events at a time when the program is scheduled to run on the device during an execution period of the operating system. | 12-18-2014 |
20150141037 | IMPROVING SCALABILITY AND RELIABILITY OF HARDWARE GEO-FENCING WITH FAILOVER SUPPORT - Systems and methods disclosed herein may include tracking one or more geo-fences using a GNSS hardware processor within a computing device. The tracking may use at least one GNSS signal. State changes of the one or more geo-fences during the tracking may be saved in a shared state database. The shared state database may be shared between the GNSS hardware processor and an application processor within the computing device. Upon detecting a deterioration of the at least one GNSS signal, tracking the one or more geo-fences may be switched from using the GNSS hardware processor to using the application processor. After the switching, an initial state of each of the one or more geo-fences may be set by using states currently stored in the shared state database prior to the switching. | 05-21-2015 |