Patent application number | Description | Published |
20080306681 | SYSTEM SERVING A REMOTELY ACCESSIBLE PAGE AND METHOD FOR REQUESTING NAVIGATION RELATED INFORMATION - A system serving a remotely accessible page includes a server and the remotely accessible page operatively connected to the server. The remotely accessible page includes a first activation option for initiating a navigation function utilizing no starting point or a starting point entered by a user, and a second activation option for initiating a navigation function utilizing a starting point obtained by the system from a vehicle. | 12-11-2008 |
20080306682 | SYSTEM SERVING A REMOTELY ACCESSIBLE PAGE AND METHOD FOR REQUESTING NAVIGATION RELATED INFORMATION - A system for sharing destinations includes a communications device for transmitting a destination location and a designated recipient of the destination location. The system further includes a call center including an advisor configured to receive the destination location and the designated recipient of the destination location, a communications system operable by the advisor for pushing a message to an electronic device of the designated recipient regarding the destination location, and a central computer system operable by the advisor for identifying in a profile of the designated recipient that the destination location has been shared. | 12-11-2008 |
20100202616 | METHOD OF SECURING AND AUTHENTICATING DATA USING MICRO-CERTIFICATES - A method of securing wireless communications includes storing a recipient's micro-certificate at a vehicle, a call center, or a certificate authority, transmitting the micro-certificate from its place of storage, extracting the public key from the micro-certificate, encrypting the vehicle communication using the public key, transmitting the encrypted vehicle communication to the recipient, and decrypting the vehicle communication using a private key after receiving the vehicle communication. The micro-certificate can include identifying data for the recipient and can have a length that is less than twice the length of the public key contained in the micro-certificate. | 08-12-2010 |
20130288659 | AVOIDING BATTERY DEPLETION OF A MOBILE DEVICE - A method of regulating the battery usage of a wireless device includes receiving information indicating the battery charge level of a wireless device over a first wireless communication channel using a short-range wireless communication protocol; choosing a wireless communication protocol for use by the wireless device with a second wireless communication channel based on the received battery charge level information; constructing a message instructing the wireless device to use the chosen wireless communication protocol for communications via the second wireless communication channel; and sending the message from a vehicle telematics unit to the wireless device. | 10-31-2013 |
20140128072 | MULTIMODE ACQUISITION FOR A WIRELESS DEVICE - A method of re-attempting to wirelessly connect a vehicle telematics unit with a wireless carrier system includes detecting that a primary retry method has failed; and carrying out a secondary retry method that: determines whether the vehicle telematics unit will communicate using a first radio access technology (RAT) or a second RAT; re-attempts a cellular connection with one or more base stations using a first RAT attachment procedure when it is determined that the vehicle telematics unit will communicate using the first RAT; and re-attempts a cellular connection with one or more base stations using a second RAT attachment procedure when it is determined that the vehicle telematics unit will communicate using the second RAT. | 05-08-2014 |
Patent application number | Description | Published |
20090293128 | GENERATING A MULTIPLE-PREREQUISITE ATTACK GRAPH - In one aspect, a method to generate an attack graph includes determining if a potential node provides a first precondition equivalent to one of preconditions provided by a group of preexisting nodes on the attack graph. The group of preexisting nodes includes a first state node, a first vulnerability instance node, a first prerequisite node, and a second state node. The method also includes, if the first precondition is equivalent to one of the preconditions provided by the group of preexisting nodes, coupling a current node to a preexisting node providing the precondition equivalent to the first precondition using a first edge and if the first precondition is not equivalent to one of the preconditions provided by the group of preexisting nodes, generating the potential node as a new node on the attack graph and coupling the new node to the current node using a second edge. | 11-26-2009 |
20110231937 | GENERATING A MULTIPLE-PREREQUISITE ATTACK GRAPH - In one aspect, a method to generate an attack graph includes determining if a potential node provides a first precondition equivalent to one of preconditions provided by a group of preexisting nodes on the attack graph. The group of preexisting nodes includes a first state node, a first vulnerability instance node, a first prerequisite node, and a second state node. The method also includes, if the first precondition is equivalent to one of the preconditions provided by the group of preexisting nodes, coupling a current node to a preexisting node providing the precondition equivalent to the first precondition using a first edge and if the first precondition is not equivalent to one of the preconditions provided by the group of preexisting nodes, generating the potential node as a new node on the attack graph and coupling the new node to the current node using a second edge. | 09-22-2011 |
Patent application number | Description | Published |
20080254436 | Selection Of A Consensus From A Plurality Of Ideas - A method of forming a consensus from a collection of ideas is disclosed. The ideas may be generated by a collection of participants, or may be provided to the collection of participants. The ideas are divided into non-exclusive groups for evaluation, with each group being provided to a participant for voting. Each participant chooses a favorite idea from the group, or selects a first and second choice, or a first, second and third choice. The votes are tallied, and for each idea a “win percentage” is calculated, which is defined as the ratio of the number of groups in which a particular idea wins the voting, divided by the number of groups in which a particular idea appears. Each idea that has a “win percentage” that exceeds a particular threshold is passed on to one or more subsequent rounds of voting. If desired, the voting may continue until a single idea is chosen as the consensus. In some rounds of voting, the groups are configured so that a participant does not vote on his/her own idea. In the first round of voting, the groups are configured so that no two ideas compete against each other more than once. A formulaic template is provided for generation of the groups, based on the number of ideas, the number of participants, and the number of ideas per group. In some embodiments, the template and number of ideas per group may be formulated using the sequence of integers known as the Mian-Chowla sequence. | 10-16-2008 |
20090239205 | System And Method For Algorithmic Selection Of A Consensus From A Plurality Of Ideas - A system and method for algorithmic selection of a consensus from a collection of ideas is disclosed. A group of ideas is provided to a group of participants for voting. Voting may occur in a single round or in several successive rounds, optionally until a consensus idea is chosen. Typically, the votes that are cast use discrete levels, such as “approve”, “disapprove”, “positive”, “neutral” or “negative”. For ideas that receive the same votes, a differentiator may be the time spent casting the vote. A relatively long evaluation time may signal some internal conflict in the mind of the participant, when compared with a relatively short evaluation time, which may signal no such conflict. The evaluation time may be combined with the rating of the participant to form a weighted rating. Consequently, a short evaluation time of a positive rating may yield a more positive weighted rating, while a short evaluation time of a negative rating may yield a more negative weighted rating. | 09-24-2009 |
20130060605 | Selection Of A Consensus From A Plurality Of Ideas - A method of forming a consensus from a collection of ideas is disclosed. The ideas are divided into non-exclusive groups for evaluation, with each group being provided to a participant for voting. The votes are tallied, and for each idea a “win percentage” is calculated, which is defined as the ratio of the number of groups in which a particular idea wins the voting, divided by the number of groups in which a particular idea appears. Each idea that has a “win percentage” that exceeds a particular threshold is passed on to one or more subsequent rounds of voting. In the first round of voting, the groups are configured so that no two ideas compete against each other more than once. | 03-07-2013 |
20130302778 | System And Method For Algorithmic Selection Of A Consensus From A Plurality Of Ideas - A system and method for algorithmic selection of a consensus from a collection of ideas is disclosed. A group of ideas is provided to a group of participants for voting. Voting may occur in a single round or in several successive rounds, optionally until a consensus idea is chosen. Typically, the votes that are cast use discrete levels, such as “approve”, “disapprove”, “positive”, “neutral” or “negative”. For ideas that receive the same votes, a differentiator may be the time spent casting the vote. A relatively long evaluation time may signal some internal conflict in the mind of the participant, when compared with a relatively short evaluation time, which may signal no such conflict. The evaluation time may be combined with the rating of the participant to form a weighted rating. Consequently, a short evaluation time of a positive rating may yield a more positive weighted rating, while a short evaluation time of a negative rating may yield a more negative weighted rating. | 11-14-2013 |