Author: claimsbot

1. A method comprising:
receiving a query associated with a first member of a social network, the query comprising one or more keywords within a selected criteria, the first member being associated with a first profile information specifying one or more values for one or more criteria;
selecting, using one or more processors associated with one or more computer devices, one or more members of the social network based on matching the keywords of the query to values for the selected criteria, each selected member being associated with a second profile information specifying one or more values for one or more criteria;
computing, using the one or more processors associated with the one or more computer devices, compatibility scores for each of the selected members based on the values for each criteria associated with the first member and the selected member, each compatibility score being associated with the first member and one of the selected members; and
transmitting information associated with the selected members.
2. The method of claim 1, wherein at least one keyword is associated with a category.
3. The method of claim 2, wherein the category comprises one or more interests.
4. The method of claim 1, wherein the query comprises a degree of separation with respect to the first member.
5. The method of claim 1, wherein the query comprises one or more criteria, the one or more criteria comprising age, gender, location, search purpose, relationship status, hometown, one or more companies, one or more schools, one or more affiliation, one or more interests, one or more favorite movies, one or more favorite books, one or more favorite music selections, one or more favorite TV shows, one or more member attributes, or any combination thereof.
6. The method of claim 5, wherein one or more of the one or more keywords is associated with a criteria.
7. The method of claim 1, wherein selecting one or more members of the social network based on the query comprises processing the query, using a social graph server, the social graph server managing a social graph representing the social network for all members of the social network.
8. The method of claim 1, wherein the transmitted information comprises information representing a set of hyperlinks, each hyperlink being associated with one of the selected members.
9. The method of claim 1, wherein computing a compatibility score associated with the first member and the one of the selected one or more members comprises determining the number of common friends between the first member and the one of the selected one or more members.
10. The method of claim 9, wherein the compatibility score is based on weighted values associated with the common friends, the weighted values being associated with a degree of separation between the first member and the one of the selected one or more members.
11. The method of claim 1, wherein the information associated with the selected members is transmitted in accordance with the compatibility scores.
12. The method of claim 11, wherein transmitting the information associated with the selected members in accordance with the compatibility scores comprises sorting the information associated with the selected members according to the compatibility scores.
13. The method of claim 1, further comprising:
normalizing the one or more values of the first profile information of the first member to obtain a first set of normalized values for the first member; and
for each selected member, normalizing the one or more values of the second profile information of the selected member to obtain a second set of normalized values for the second member.
14. The method of claim 13, wherein computing compatibility scores for each of the selected members is based on the first set of normalized values for the first member and the second set of normalized values for the selected member.
15. The method of claim 1, wherein the compatibility scores for each of the selected members is a probability of compatibility of the first member with respect to the selected member, the probability of compatibility being based on each pair of values for each criteria of the first profile information of the first member and the second profile information of the second member.
16. The method of claim 1, further comprising receiving a selection of the selected criteria from the first member.
17. The method of claim 1, further comprising accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the one or more of the nodes being associated with a plurality of members of the social network, each connection between two nodes representing a relationship between the two nodes and establishing a single degree of separation between the two nodes.
18. The method of claim 17, wherein:
the first member is associated with a first node of the plurality of nodes; and
each selected member is associated with a second node of the plurality of nodes, each second node being within a threshold degree of separation of the first node.
19. A system, comprising: one or more non-transitory machine-readable storage media encoded with instructions; and one or more processors configured to execute the instructions to:
receive a query associated with a first member of a social network, the query comprising one or more keywords within a selected criteria, the first member being associated with a first profile information specifying one or more values for one or more criteria;
select one or more members of the social network based on matching the keywords of the query to values for the selected criteria, each selected member being associated with a second profile information specifying one or more values for one or more criteria;
compute compatibility scores for each of the selected members based on the values for each criteria associated with the first member and the selected member, each compatibility score being associated with the first member and one of the selected members; and
transmit information associated with the selected one or more members.
20. One or more computer-readable non-transitory storage media embodying software that is operable when executed by one or more processors associated with one or more servers to:
receive a query associated with a first member of a social network, the query comprising one or more keywords within a selected criteria, the first member being associated with a first profile information specifying one or more values for one or more criteria;
select, using one or more processors associated with one or more computer devices, one or more members of the social network based on matching the keywords of the query to values for the selected criteria, each selected member being associated with a second profile information specifying one or more values for one or more criteria;
compute, using the one or more processors associated with the one or more computer devices, compatibility scores for each of the selected members based on the values for each criteria associated with the first member and the selected member, each compatibility score being associated with the first member and one of the selected members; and
transmit information associated with the selected members.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A method of switching an application server, for controlling to take over a first task provided by a first application server to a second application server, the method being executed by a management computer coupled to the first application server for providing the first task and the second application server for providing the second task,
the method including:
a first step of referring, by the management computer, to switching level information including switching patterns to be used at a time of switching the first task to the second application server, and setting a level of a degree of safety for each of the switching patterns;
a second step of referring, by the management computer, to the switching level information, and setting a switching time for the each of the switching patterns, which is required for switching the first task to the second application server;
a third step of referring, by the management computer, to task requirement information including a stop time for each first task which is allowed at the time of switching the first task to the second application server;
a fourth step of comparing, by the management computer, the stop time included in the referred task requirement information which is set to the first task and the switching time which is set to the each of the switching patterns included in the referred switching level information, and selecting one of the switching patterns having a switching time that is shorter than the stop time of the task requirement information which is set to the first task and having the level of the degree of safety that is highest among the switching patterns of the switching level information; and
a fifth step of stopping, by the management computer, the second task of the second application server by the selected one of the switching patterns, and then controlling the second application server to provide the first task.
2. The method of switching an application server according to claim 1, wherein:
the first step includes the steps of referring, by the management computer, to switching characteristic information including a plurality of control items on the second application server which are set for the each of the switching patterns of the switching level information and numeric information on each of the plurality of control items, obtaining the numeric information for calculating the level of the degree of safety for the each of the plurality of control items, and setting the level of the degree of safety of the each of the switching patterns based on the numeric information on the plurality of control items which are included in the each of the switching patterns; and
the second step includes the steps of referring, by the management computer, to log information in which a past record of a period of time which was required for past switching is stored for the each of the switching patterns, and setting the switching time.
3. The method of switching an application server according to claim 1, further including a sixth step of detecting, by the management computer, a failure of the first application server,
wherein the third step, the fourth step and the fifth step are executed with the detection of the failure of the first application server as a trigger.
4. The method of switching an application server according to claim 3, wherein the fourth step includes the steps of determining, by the management computer, a cause of the failure of the first application server; referring to failure restriction information including a switching pattern to be restricted for each cause of the failure; obtaining the switching pattern to be restricted corresponding to the identified cause of the failure; and selecting one of the switching patterns having the switching time, which is set to the each of the switching patterns of the switching level information, that is shorter than the stop time of the task requirement information which is set to the first task, and having the level of the degree of safety of the switching level information that is highest among the switching patterns other than the switching pattern to be restricted.
5. The method of switching an application server according to claim 1, further including a seventh step of detecting, by the management computer, a sign of a failure of the first application server,
wherein the third step, the fourth step and the fifth step are executed with the detection of the sign of the failure of the first application server as a trigger.
6. A management computer, which is coupled to a first application server for providing a first task and a second application server for providing a second task, the management computer comprising:
a processor;
a memory; and
a failure recovery module for controlling the second application server to take over the first task provided by the first application server to the second application server,
wherein the failure recovery module includes:
a switching level information generation module for setting switching patterns to be used at a time of switching the first task to the second application server, a level of a degree of safety for each of the switching patterns, and a switching time which is required for switching the first task to the second application server for the each of the switching patterns;
task requirement information included in a stop time which is allowed at the time of switching the first task to the second application server in advance;
a switching pattern selection module for comparing the stop time included in the task requirement information which is set to the first task and the switching time which is set to the each of the switching patterns included in switching level information, and selecting one of the switching patterns having a switching time that is shorter than the stop time of the task requirement information which is set to the first task and having the level of the degree of safety that is highest among the switching patterns of the switching level information; and
a switching execution module for stopping the second task of the second application server by the selected one of the switching patterns, and then controlling the second application server to provide the first task.
7. The management computer according to claim 6, wherein the switching level information generation module is configured to:
refer to switching characteristic information including a plurality of control items on the second application server which are set for the each of the switching patterns of the switching level information and numeric information on each of the plurality of control items, and obtain the numeric information for calculating the level of the degree of safety for the each of the plurality of control items;
set the level of the degree of safety of the each of the switching patterns based on the numeric information on the plurality of control items which are included in the each of the switching patterns; and
refer to log information in which a past record of a period of time which was required for past switching is stored for the each of the switching patterns, and set the switching time.
8. The management computer according to claim 6, further comprising a failure management module for detecting a failure of the first application server,
wherein the switching pattern selection module selects the one of the switching patterns as a trigger that the failure management module detects the failure of the first application server.
9. The management computer according to claim 8, wherein the switching pattern selection module is configured to:
determine a cause of the failure of the first application server detected by the failure management module;
refer to failure restriction information including a switching pattern to be restricted for each cause of the failure, and obtain the switching pattern to be restricted corresponding to the identified cause of the failure; and
select one of the switching patterns having the switching time, which is set to the each of the switching patterns of the switching level information, that is shorter than the stop time of the task requirement information which is set to the first task and having the level of the degree of safety of the switching level information that is highest among the switching patterns other than the switching pattern to be restricted.
10. The management computer according to claim 6, further comprising a failure management module for detecting a sign of the failure of the first application server,
wherein the switching pattern selection module selects the one of the switching patterns as a trigger that the failure management module detects the sign of the failure of the first application server.
11. A non-transitory machine-readable storage medium, containing at least one sequence of instructions for controlling a management computer, the management computer being coupled to a first application server for providing a first task and a second application server for providing a second task, and including a processor and a memory,
the instructions that, when executed, causes a management computer to execute:
a first procedure of referring to switching level information including switching patterns to be used at a time of switching the first task to the second application server, and setting a level of a degree of safety for each of the switching patterns;
a second procedure of referring to the switching level information, and setting a switching time for the each of the switching patterns, which is required for switching the first task to the second application server;
a third procedure of referring to task requirement information including a stop time for each first task which is allowed at the time of switching the first task to the second application server;
a fourth procedure of comparing the stop time included in the referred task requirement information which is set to the first task and the switching time which is set to the each of the switching patterns included in the referred switching level information, which are referred to, with one another, and selecting one of the switching patterns having a switching time that is shorter than the stop time of the task requirement information which is set to the first task and having the level of the degree of safety of the switching level information that is highest; and
a fifth procedure of stopping the second task of the second application server by the selected one of the switching patterns, and then controlling the second application server to provide the first task.
12. The non-transitory machine-readable storage medium according to claim 11, wherein:
the first procedure includes the steps of referring to switching characteristic information including a plurality of control items on the second application server which are set for the each of the switching patterns of the switching level information and numeric information on each of the plurality of control items are set, obtaining the numeric information for calculating the level of the degree of safety for the each of the plurality of control items, and setting the level of the degree of safety of the each of the switching patterns based on the numeric information on the plurality of control items which are included in the each of the switching patterns; and
the second procedure includes the steps of referring to log information in which a past record of a period of time which was required for switching is stored for the each of the switching patterns, and setting the switching time.
13. The non-transitory machine-readable storage medium according to claim 11, wherein:
the instructions further causes a management computer program controlling the processor to execute a sixth procedure of detecting a failure of the first application server; and
the third procedure, the fourth procedure and the fifth procedure are executed with the detection of the failure of the first application server as a trigger.
14. The non-transitory machine-readable storage medium according to claim 13, wherein the fourth procedure includes the steps of determining a cause of the failure of the first application server; referring to failure restriction information including a switching pattern to be restricted for each cause of the failure; obtaining the switching pattern to be restricted corresponding to the identified cause of the failure; and selecting one of the switching patterns having the switching time, which is set to the each of the switching patterns of the switching level information, that is shorter than the stop time of the task requirement information which is set to the first task, and having the level of the degree of safety of the switching level information that is highest among the switching patterns other than the switching pattern to be restricted.
15. The non-transitory machine-readable storage medium according to claim 11, wherein:
the instructions further causes a management computer program controlling the processor to execute a seventh procedure of detecting a sign of a failure of the first application server; and
the third procedure, the fourth procedure and the fifth procedure are executed with the detection of the sign of a failure of the first application server as a trigger.

1. A method of allocating uplink (UL) resources in a wireless network, said method comprising:
transmitting a Map message as part of a first group downlink (DL) region, the Map message allocating, to a mobile station (MS), a first resource in a first group UL region and a second resource in a second group UL region; and
transmitting a dummy information element (IE), as part of a second group DL region, the dummy information element (IE) reflecting at least the allocating to the MS of the second resource in the second group UL region to indicate to the MS the second resource in the second group UL region that was allocated to the MS, wherein the second group DL region occurs subsequently to the first group DL region,
wherein the dummy information element comprises a value indicating a starting point or ending point from which a location of one or more resource allocations within the second group UL region may be determined for one or more mobile stations.
2. The method of claim 1 wherein the MS is a full-duplex (FD) MS.
3. The method of claim 1 wherein the dummy IE reflects the allocating of the first resource in the first group UL region and the second resource in the second group UL region.
4. The method of claim 1 wherein the transmitting a dummy IE comprises transmitting a first dummy IE in the first group DL region and a second dummy IE in a second group DL region.
5. The method of claim 1 wherein the first group UL region and the second group UL region are adjacent.
6. The method of claim 1 wherein the first group UL region and the second group UL region are non-adjacent.
7. The method of claim 1 wherein the transmitting the Map message comprises transmitting an UL Map IE as part of the first group DL region, the UL Map IE allocating to the MS both the first resource of the first group UL region and the second resource of the second group UL region, the first group UL region being provided in a first frame, and the second group UL region being provided in a second frame.
8. The method of claim 7 wherein the MS to which the resource is allocated is a full-duplex MS.
9. The method of claim 1 wherein the transmitting the Map message comprises transmitting a full-duplex (FD) UL Map IE as part of the first group DL region, the FD UL Map IE allocating to the FD MS both the first resource of the first group UL region and the second resource of the second group UL region, the first group UL region and the second group UL region being provided in a same frame.
10. The method of claim 1 wherein the transmitting the Map message comprises transmitting a full-duplex (FD) UL map IE as part of the first group DL region, the FD UL Map IE including at least an identifier associated with the MS, and information identifying the location and length of the first resource and the second resource.
11. The method of claim 1 wherein the transmitting the Map message comprises transmitting an UL map IE as part of the first group DL region, the UL Map IE including at least an identifier associated with the MS, and for each of the first and second resources: a region ID to identify the group UL region in which the allocation applies, a symbol offset to identify a starting location of the resource, and a number of symbols to identify a length of the resource.
12. The method of claim 11 wherein the UL MAP IE is an FD UL (full-duplex Uplink) map IE.
13. The method of claim 1 wherein the transmitting a dummy information element (IE) comprises transmitting a dummy UL allocation that indicates an allocation of the second resource in the second group UL region.
14. The method of claim 1 wherein the transmitting a dummy information element (IE) comprises transmitting a dummy UL allocation that indicates an allocation of the first resource and the second resource.
15. The method of claim 1 wherein the transmitting a dummy information element (IE) comprises transmitting a dummy UL allocation that indicates an allocation of the second resource in the second group UL region, so as to allow one or more mobile stations to identify a location of their resource allocation within a second group UL region, based at least in part on the dummy allocation.
16. The method of claim 1 wherein the dummy information element comprises a UL Allocation start information element identifying a start symbol offset or starting reference for any subsequent resource allocations within the second group UL region for one or more mobile stations.
17. An apparatus comprising:
a controller; and
a wireless transmitter coupled to the controller, the wireless transmitter configured to:
transmit a Map message as part of a first group downlink (DL) region, the Map message allocating, to a full-duplex (FD) mobile station (MS), a first resource in a first group UL region and a second resource in a second group UL region; and
transmit a dummy information element (IE), as part of a second group DL region, the dummy information element (IE) reflecting at least the allocating to the FD MS of the second resource in the second group UL region to indicate to the MS the second group UL region that was allocated to the MS, wherein the second group DL region occurs subsequently to the first group DL region,
wherein the dummy information element comprises a value indicating a starting point or ending point from which a location of one or more resource allocations within the second group UL region may be determined for one or more mobile stations.
18. A method of allocating uplink (UL) resources in a wireless network, said method comprising:
transmitting a Map message as part of a first group downlink (DL) region of a first frame, the Map message allocating, to a full-duplex (FD) mobile station (MS), a first resource in a first group UL region and a second resource in a second group UL region; and
transmitting a dummy information element (IE), as part of a second group DL region of the first frame, the dummy information element (IE) reflecting at least the allocating to the FD MS of the second resource in the second group UL region to indicate to the MS the second group UL region that was allocated to the MS, wherein the second group DL region occurs subsequently to the first group DL region,
wherein the dummy information element comprises a value indicating a starting point or ending point from which a location of one or more resource allocations within the second group UL region may be determined for one or more half-duplex mobile stations.
19. The method of claim 18 wherein the first resource of the first group UL region and the second resource of the second group UL region are provided in one or more subsequent frames.
20. The method of claim 18 wherein the first resource of the first group UL region and the second resource of the second group UL region are provided in a subsequent frame.
21. The method of claim 18 wherein the first group UL region and the second group UL regions are adjacent.
22. The method of claim 18 wherein the first group UL region and the second group UL region are non-adjacent.
23. The method of claim 18 wherein the first group comprises a group 1 and the second group comprises a group 2 for a frequency division duplex network, wherein HD mobile stations in the wireless network are assigned to either the group 1 or the group 2, wherein group 1 and group 2 mobile stations transmit and receive in an alternate fashion, and FD mobile stations may transmit and receive during regions associated with one or both of group 1 and group 2.
24. The method of claim 18 wherein the first group comprises a group 2 and the second group comprises a group 1 for a frequency division duplex network, wherein HD mobile stations in the wireless network are assigned to either the group 1 or the group 2, wherein group 1 and group 2 mobile stations transmit and receive in an alternate fashion, and FD mobile stations may transmit and receive during regions associated with one or both of group 1 and group 2.
25. The method of claim 18 wherein the dummy information element comprises a dummy UL allocation provided that indicates an allocation of the second resource in the second group UL region of the subsequent frame, so as to allow one or more half-duplex (or other) mobile stations to identify a location of a second group UL allocation, based at least in part on the dummy allocation.
26. The method of claim 18 wherein the transmitting a dummy information element (IE) comprises transmitting a dummy UL allocation that indicates an allocation of the second resource in the second group UL region of the subsequent frame, so as to allow one or more half-duplex (or other) mobile stations to identify a location of a second group UL allocation of the subsequent frame, based at least in part on the dummy allocation.
27. The method of claim 18 wherein the transmitting a dummy information element (IE) comprises transmitting a dummy IE that reflects an area of an UL region to be skipped by an HD MS, or which allows one or more half-duplex mobile stations to identify a location of a second group UL allocation of the subsequent frame, based at least in part on the dummy IE.
28. A method comprising:
transmitting, to one or more wireless stations in a wireless network:
a first Map for a first group of the wireless stations, the first Map allocating a resource, and
a second Map for a second group of the wireless stations, the second Map including a dummy IE that reflects the allocation of the resource by the first Map to indicate to the second group of the wireless stations of the allocated resource, wherein the second Map is sent subsequently to the first Map,
wherein the dummy information element comprises a value indicating a starting point or ending point from which a location of one or more resource allocations within the second group of the wireless stations may be determined for one or more half-duplex mobile stations.
29. The method of claim 28 wherein one or more of the wireless stations use frequency division duplexing for uplink and downlink transmissions.
30. The method of claim 28 wherein the first Map for a first group allocates a resource to a FD wireless station.
31. The method of claim 28 wherein the first Map is provided in a first frame and the second Map is provided in a second frame.
32. The method of claim 28 wherein the first Map and the second Map are provided in a same frame.
33. An apparatus comprising:
a controller; and
a wireless transmitter coupled to the controller, the wireless transmitter configured to:
transmitting, to one or more wireless stations in a wireless network:
a first Map for a first group of the wireless stations, the first Map allocating a resource to a full-duplex wireless station or wireless station capable of operating in full-duplex, and
a second Map for a second group of the wireless stations, the second Map including a dummy IE that reflects the allocation of the resource by the first Map and allows a location of a subsequent resource allocation to be determined based on the dummy IE, the dummy IE to indicate to the second group of the wireless stations of the allocated resource, wherein the second Map is sent subsequently to the first Map,
wherein the dummy IE comprises either a dummy IE that indicates an end (or ending location) of the resource allocated to the full-duplex wireless station, andor a dummy IE that indicates a start (or starting location) andor size of a subsequent resource allocation.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

What is claimed is:

1. A stabilized rubber composition comprising a rubbery elastomer and a sufficient amount of carnosic acid to stabilize the rubber composition, wherein said stabilized rubber composition is void of a water soluble portion.
2. A stabilized rubber composition as specified in claim 1 wherein said stabilized rubber composition is void of sweeteners.
3. A stabilized rubber composition as specified in claim 1 wherein said stabilized rubber composition is void of flavoring agents.
4. A stabilized rubber composition as specified in claim 1 wherein said stabilized rubber composition is void of colorants.
5. A stabilized rubber composition as specified in claim 1 wherein the carnosic acid is present at a level which is within the range of about 0.0001 phr to about 1 phr.
6. A stabilized rubber composition as specified in claim 1 wherein the carnosic acid is present at a level which is within the range of about 0.0005 phr to about 0. 1 phr.
8. A stabilized rubber composition as specified in claim 1 wherein the carnosic acid is present at a level which is within the range of about 0.001 phr to about 0.05 phr.
9. A stabilized rubber composition as specified in claim 1 wherein the carnosic acid is present at a level which is within the range of about 0.01 phr to about 0.03 phr.
10. A stabilized rubber composition as specified in claim 5 wherein said stabilized rubber composition is further comprised of an additional antioxidant selected from the group consisting of carnosol, rosmanol and rosmaridiphenol.
11. A stabilized rubber composition as specified in claim 1 wherein said gum base is void of humectants.
12. A stabilized rubber composition comprising: (1) a rubbery elastomer, (2) carbon black, and (3) a sufficient amount of carnosic acid to stabilize the rubber composition.
13. A stabilized rubber composition as specified in claim 12 wherein the carnosic acid is present at a level which is within the range of about 0.0001 phr to about 1 phr.
14. A stabilized rubber composition as specified in claim 12 wherein the carnosic acid is present at a level which is within the range of about 0.0005 phr to about 0.1 phr.
15. A stabilized rubber composition as specified in claim 12 wherein the carnosic acid is present at a level which is within the range of about 0.001 phr to about 0.05 phr.
16. A stabilized rubber composition as specified in claim 12 wherein the carnosic acid is present at a level which is within the range of about 0.01 phr to about 0.03 phr.
17. A stabilized rubber composition as specified in claim 12 wherein the carbon black is present at a level which is within the range of about 5 phr to about 150 phr.
18. A stabilized rubber composition as specified in claim 13 wherein the carbon black is present at a level which is within the range of about 10 phr to about 100 phr.
19. A stabilized rubber composition as specified in claim 13 wherein the carbon black is present at a level which is within the range of about 20 phr to about 80 phr.
20. A stabilized rubber composition comprising: (1) a rubbery elastomer, (2) silica, and (3) a sufficient amount of carnosic acid to stabilize the rubber composition.