Method for comparing two trinary logic representations in the process of customizing radio broadcasting

• US 7,058,694 B1
• Filed: 09/07/2000
• Issued: 06/06/2006
• Est. Priority Date: 09/07/2000
• Status: Expired due to Fees

• Current Assignee: Dedicated Licensing LLC (IP Edge LLC)
• Original Assignee: Clix Network, Inc.
• Inventors: De Bonet, Jeremy S., Viola, Paul A.
• Primary Examiner(s): LIN, WEN TAI
• Application Number:
  US09/656,950
• Time in Patent Office: 2,098 Days
• Field of Search: 709217-219, 704/500, 707/3, 707/6
• US Class Current: 709/217
• CPC Class Codes: H04L 65/1101 Session protocols
• CPC Class Codes: H04L 65/613 for the control of the source by the destination control signals issued by the client directed to the server or network components specially adapted for selective content distribution H04N21/637
• CPC Class Codes: H04L 65/762 at the source reformatting of additional data in video distribution servers H04N21/2355
• CPC Class Codes: H04L 67/30 Profiles
• CPC Class Codes: H04L 67/306 User profiles
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

Abstract

A method for efficiently comparing two trinary logic representations, including the steps of creating a first data structure (a VALUE data structure) representative of a first set of properties; creating a second data structure (a KNOWN data structure) representative of whether the first set of properties is known; creating a third data structure (a TARGET data structure) representative of a target set of properties; creating a fourth data structure (a WANT data structure) representative of whether the target set of properties is wanted; and comparing the first, second, third, and fourth data structures using bit-wise binary operations to determine whether the first set of known properties are wanted as a target set of properties. In exemplary embodiments, the bit-wise binary operations are performed according to the Boolean equation: (not WANT) or (KNOWN and ((TARGET xor VALUE))). Alternatively, the bit-wise binary operation are performed according to the Boolean equation: (not WANT) or (KNOWN and ((TARGET and VALUE) or ((not TARGET) and (not (VALUE))). These data structures may be any size computer word, including 16 and 32-bit words.

Claims

1. A method for customizing radio broadcasting for individual end users, comprising:

creating a first data structure (referred herein as a VALUE data structure) representative of a first set of properties related to a user;

creating a second data structure (referred herein as a KNOWN data structure) representative of whether said first set of properties is known;

creating a third data structure (referred herein as a TARGET data structure) representative of a target set of properties related to an audio element;

creating a fourth data structure (referred herein as a WANT data structure) representative of whether said target set of properties is wanted; and

comparing said first, second, third, and fourth data structures using bit-wise binary operations to determine whether said first set of known properties are wanted as a target set of properties;

storing the audio element into a cache memory upon determining that the first set of known properties are wanted as the target set of properties;

selecting an audio element from the cache memory;

comparing an identifier of the selected audio element to an identifier of a most recently played audio element; and

rejecting the selected audio element if it is substantially similar to the most recently played audio element.

2. The method of claim 1 wherein said bit-wise binary operation are performed according to the Boolean equation:

(not WANT) or (KNOWN and ((TARGET xor VALUE))).

3. The method of claim 1 wherein said bit-wise binary operation are performed according to the Boolean equation:

(not WANT) or (KNOWN and ((TARGET and VALUE) or ((not TARGET) and (not (VALUE))).

4. The method of claim 1 wherein said first, second, third, and fourth data structures are 16-bit computer words.

5. The method of claim 1 wherein said first, second, third, and fourth data structures are 32-bit computer words.

6. The method of claim 1 wherein said first, second, third, and fourth data structures comprise multiple computer words.

7. The method of claim 1 wherein at least one of said first set of properties and at least one of said target set of properties are represented as a single bit.

8. The method of claim 1 wherein at least one of said first set of properties and at least one of said target set of properties are represented as multiple bits.

9. A method in a computer system for selecting an audio element to transmit to a remote listener, comprising:

creating a first data structure (referred herein as a VALUE data structure) representative of a first set of demographic properties related to a remote listener;

creating a second data structure (referred herein as a KNOWN data structure) representative of whether said first set of demographic properties related to the remote listener is known;

creating a third data structure (referred herein as a TARGET data structure) representative of a target set of demographic properties relating to an audio element;

creating a fourth data structure (referred herein as a WANT data structure) representative of whether said target set of demographic properties is wanted to be targeted; and

comparing said first, second, third, and fourth data structures using bit-wise binary operations to determine whether the audio element should be transmitted to the remote listener;

storing the audio element into a cache memory upon determining that the first set of known properties are wanted as the target set of properties;

selecting an audio element from the cache memory;

comparing an identifier of the selected audio element to an identifier of a most recently played audio element; and

rejecting the selected audio element if it is substantially similar to the most recently played audio element.

10. The method of claim 9 wherein said bit-wise binary operation are performed according to the Boolean equation:

(not WANT) or (KNOWN and ((TARGET xor VALUE))).

11. The method of claim 9 wherein said bit-wise binary operation are performed according to the Boolean equation:

(not WANT) or (KNOWN and ((TARGET and VALUE) or ((not TARGET) and (not (VALUE))).

12. The method of claim 9 wherein said first, second, third, and fourth data structures are computer words.

13. The method of claim 9 wherein said first, second, third, and fourth data structures are 32-bit computer words.

14. The method of claim 9 wherein said first, second, third, and fourth data structures comprise multiple computer words.

15. The method of claim 9 wherein at least one of said first set of properties and at least one of said target set of properties are represented as a single bit.

16. The method of claim 9 wherein at least one of said first set of properties and at least one of said target set of properties are represented as multiple bits.

17. The method of claim 9 wherein said first set of demographic properties includes the age of the remote listener.

18. The method of claim 9 wherein said first set of demographic properties includes the gender of the remote listener.

19. The method of claim 9 wherein said first set of demographic properties includes the marital status of the remote listener.

20. The method of claim 9 wherein said first set of demographic properties includes the city where the remote listener lives.

21. The method of claim 9 wherein said audio element is an advertisement.

22. A customized personal radio broadcast system operable to select an audio element to transmit to a remote listener, comprising:

means for creating a first data structure (referred herein as a VALUE data structure) representative of a first set of demographic properties related to a remote listener;

means for creating a second data structure (referred herein as a KNOWN data structure) representative of whether said first set of demographic properties related to the remote listener is known;

means for creating a third data structure (referred herein as a TARGET data structure) representative of a target set of demographic properties relating to an audio element;

means for creating a fourth data structure (referred herein as a WANT data structure) representative of whether said target set of demographic properties is wanted to be targeted; and

means for comparing said first, second, third, and fourth data structures using bit-wise binary operations to determine whether the audio element should be transmitted to the remote listener

means for storing the audio element upon determining that the first set of known properties are wanted as the target set of properties;

means from selecting at least one stored audio element;

means for comparing an identifier of the selected audio element to an identifier of a most recently played audio element; and

means for rejecting the selected audio element if it is substantially similar to the most recently played audio element.