1461096852-e37f8f39-f7b7-4b39-9b03-a274507c97a0

What is claimed is:

1. A compound represented by formula (1):

10
wherein R1 to R4 may be the same or different from one another and each represents a hydrogen atom, a halogen atom, a substituted or unsubstituted lower alkyl group, a substituted or unsubstituted lower alkenyl group or a substituted or unsubstituted amino group, in which the substituent for said lower alkyl or lower alkenyl group is selected from the group consisting of a halogen atom, a hydroxyl group, a carbamoyl group, an amino group and a cyano group, and the substituent for said amino group is selected from the group consisting of a straight or branched C1-C4 alkyl group, a straight or branched C1-C4 alkylcarbonyl group, a straight or branched C2-C4 alkenyl group and a benzylidene group which may have phenyl group, or optional two groups of R1 to R4 may be linked together to form a ring structure which is a 5- or 6-membered ring composed of carbon atoms alone or carbon atoms and 1 to 2 hetero atoms, selected from a cyclohexane ring, a benzene ring, a pyridine ring, a piperidine ring and a pyrrolidine ring; Y represents a saturated or unsaturated, substituted or unsubstituted 4- to 8-membered hetero ring containing 1 to 3 nitrogen atoms as the ring constituting atoms and carbon atoms as the remaining atoms, which is a ring selected from the group consisting of an azetidine ring, a pyrrolidine.ring, a piperidine ring, a pyridine ring, an imidazole ring, a pyrazinyl ring, a pyridazinyl ring, a triazole ring, a homopiperidine ring, a 1,4-diazacyclooctanyl ring and a 1,5-diazacyclooctanyl ring, in which the substituent for Y is a group which is linked to a nitrogen atom of Y and selected from the group consisting of a straight or branched C1-C4 alkyl group and a straight or branched C2-C4 alkenyl groups), said lower alkyl group means a straight or branched C1-C4 alkyl group, said lower alkenyl group means a straight or branched C2-C4 alkenyl group, and said halogen atom is selected from the group consisting of fluorine, chlorine, bromine and iodine atoms.
2. The compound according to claim 1, wherein said Y in the formula (1) is a 4-pyridinyl group, a 4-piperidinyl group, a 4-homopiperidinyl group, a 1-(1,4-diazacyclooctanyl) group, a 1-(1,5-diazacyclooctanyl) group or a 3-pyrrolidinyl group.
3. A compound represented by formula (2):

11
wherein R1 to R4 may be the same or different from one another and each represents a hydrogen atom, a halogen atom, a substituted or unsubstituted lower alkyl group, a substituted or unsubstituted lower alkenyl group or a substituted or unsubstituted amino group, or two groups of R1 and R2 may be linked together to form a benzene ring structure, with the proviso that compounds in-which all of R1 to R4 are hydrogen atoms are excluded; R5 represents a hydrogen atom, a substituted or unsubstituted lower alkyl group or a substituted or unsubstituted lower alkenyl group; and m is an integer of 1 to 4, in which said lower alkyl group means a straight or branched C1-C4 alkyl group, said lower alkenyl group means a straight or branched C2-C4 alkenyl group, the substituent for said lower alkyl or lower alkenyl group is selected from the group consisting of a halogen atom, a hydroxyl group, a carbamoyl group, an amino group and a cyano group, the substituent for said amino group is selected from the group consisting of a straight or branched C1-C4 alkyl group, a straight or branched C1-C4 alkylcarbonyl group, a straight or branched C2-C4 alkenyl group and a benzylidene group which may have a phenyl group, and said halogen atom is selected from the group consisting of fluorine, chlorine, bromine and iodine atoms.
4. The compound according to claim 3, wherein R1 to R4 in the formula (2) may be the same or different from one another and each represents a hydrogen atom, a halogen atom or a substituted or unsubstituted lower alkyl group, or two groups of R1 and R2 may be linked together to form a benzene ring; R5 is a substituted or unsubstituted lower alkyl group; and m is an integer of 2 or 3.
5. A compound represented by formula (3):

12
wherein R1 to R4 may be the same or different from one another and each represents a hydrogen atom, a halogen atom, a substituted or unsubstituted lower alkyl group, a substituted or unsubstituted lower alkenyl group or a substituted or unsubstituted amino group, or two groups of R1 and R2 may be linked together to form a benzene ring structure, with the proviso that compounds in which all of R1 to R4 are hydrogen atoms are excluded; R5 and R6 may be the same or different from each other and each represents a substituted or unsubstituted lower alkyl group or a substituted or unsubstituted lower alkenyl group; m is an integer of 1 to 4, in which sid lower alkyl group means a straight or branched C1-C4 alkyl group, said lower alkenyl group means a straight or branched C2-C4 alkenyl group, the substituent for said lower alkyl or lower alkenyl group is selected from the group consisting of a halogen atom, a hydroxyl group, a carbamoyl group, an amino group and a cyano group, the substituent for said amino group is selected from the group consisting of a straight or branched C1-C4 alkyl group, a straight or branched C1-C4 alkylcarbonyl group, a straight or branched C2-C4 alkenyl group and a benzylidene group which may have phenyl group, and said halogen atom is selected from the group consisting of fluorine, chlorine, bromine and iodine atoms), and X- represents a halogen ion.
6. A pharmaceutical composition which comprises, as its active ingredient, the compound of any one of claims 1 to 5 or a compound represented by formula (4);

13
wherein m is an integer of 1 to 4.
7. The pharmaceutical composition according to claim 6, wherein it is a serotonin 5-HT3 receptor antagonist or a serotonin 5-HT3 receptor partial activator.
8. The pharmaceutical composition according to claim 6, wherein it is a drug for use in the treatment and prevention of functional disorders of digestive organs.
9. The pharmaceutical composition according to claim 6, wherein it is a drug for use in the treatment and prevention of diarrhea.
10. A method for treating or preventing functional disorders of digestive organs, which comprises the step of administering the pharmaceutical composition of claim 6 as a serotonin 5-HT3 receptor antagonist or a serotonin 5-HT3 receptor partial activator to mammals including human.
11. A method for preventing diarrhea, which comprises the step of administering the pharmaceutical composition of claim 6 to mammals including human.

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 computer-implemented method for forwarding packets, the method comprising:
receiving, by a content producing device, a packet that corresponds to a first Interest message from a content requesting device, wherein the first Interest includes a name;
responsive to determining that additional time is required to generate a matching Content Object for the first Interest, generating a notification message which indicates a time period after which a second Interest is to be sent out by the content requesting device; and
transmitting the notification message to the content requesting device,
thereby facilitating the content requesting device to handle a potential timeout event.
2. The method of claim 1, further comprising:
receiving a packet that corresponds to the second Interest;
responsive to determining that a matching Content Object for the second Interest is available, generating a matching Content Object in response to the second Interest, wherein the matching Content Object contains as payload the content corresponding to the first Interest; and
responsive to determining that the matching Content Object for the second Interest is not available, generating an additional notification message which indicates a time period after which a third Interest is to be sent out by the content requesting device.
3. The method of claim 1, wherein the notification message further indicates a name for the second Interest to be sent out, wherein the name for the second Interest is identical to or different from the name for the first Interest.
4. The method of claim 1, wherein the notification message is a Content Object, thereby facilitating an intermediate router to remove an entry in its Pending Interest Table (PIT) corresponding to the first Interest.
5. The method of claim 1, wherein the notification message further indicates that the content producing device is generating the content in response to the first Interest.
6. A computer-implemented method for forwarding packets, the method comprising:
generating, by a content requesting device, a packet that corresponds to a first Interest message, wherein the first Interest includes a name;
transmitting the first Interest to a content producing device;
receiving a notification message which indicates a time period after which a second Interest is to be sent out;
responsive to reaching an expiration of the time period indicated in the notification message, generating a packet that corresponds to the second Interest message; and
receiving a matching Content Object in response to the second Interest,
thereby facilitating the content requesting device to handle a potential timeout event.
7. The method of claim 6, further comprising:
responsive to transmitting the second Interest, receiving an additional notification message which indicates a time period after which a third Interest is to be sent out.
8. The method of claim 6, wherein the notification message further indicates a name for the second Interest to be sent out, wherein the name for the second Interest is identical to or different from the name for the first Interest.
9. The method of claim 8, further comprising:
transmitting the second Interest, wherein the second Interest includes the name indicated in the notification message.
10. The method of claim 6, wherein the notification message is a Content Object.
11. The method of claim 6, further comprising:
removing an entry from a Pending Interest Table (PIT), wherein the entry corresponds to the first Interest.
12. The method of claim 6, further comprising:
creating an entry in a Pending Interest Table (PIT), wherein the entry corresponds to the second Interest.
13. A computer system for facilitating forwarding of packets, the system comprising:
a processor; and
a storage device storing instructions that when executed by the processor cause the processor to perform a method, the method comprising:
receiving, by a content producing device, a packet that corresponds to a first Interest message from a content requesting device, wherein the first Interest includes a name;
responsive to determining that additional time is required to generate a matching Content Object for the first Interest, generating a notification message which indicates a time period after which a second Interest is to be sent out by the content requesting device; and
transmitting the notification message to the content requesting device,
thereby facilitating the content requesting device to handle a potential timeout event.
14. The computer system of claim 13, wherein the method further comprises:
receiving a packet that corresponds to the second Interest;
responsive to determining that a matching Content Object for the second Interest is available, generating a matching Content Object in response to the second Interest, wherein the matching Content Object contains as payload the content corresponding to the first Interest; and
responsive to determining that the matching Content Object for the second Interest is not available, generating an additional notification message which indicates a time period after which a third Interest is to be sent out by the content requesting device.
15. The computer system of claim 13, wherein the notification message further indicates a name for the second Interest to be sent out, wherein the name for the second Interest is identical to or different from the name for the first Interest.
16. The computer system of claim 13, wherein the notification message is a Content Object, thereby facilitating an intermediate router to remove an entry in its Pending Interest Table (PIT) corresponding to the first Interest.
17. The computer system of claim 13, wherein the notification message further indicates that the content producing device is generating the content in response to the first Interest.
18. A computer system for facilitating forwarding of packets, the system comprising:
a processor; and
a storage device storing instructions that when executed by the processor cause the processor to perform a method, the method comprising:
generating, by a content requesting device, a packet that corresponds to a first Interest message, wherein the first Interest includes a name;
transmitting the first Interest to a content producing device;
receiving a notification message which indicates a time period after which a second Interest is to be sent out;
responsive to reaching an expiration of the time period indicated in the notification message, generating a packet that corresponds to the second Interest message; and
receiving a matching Content Object in response to the second Interest,
thereby facilitating the content requesting device to handle a potential timeout event.
19. The computer system of claim 18, wherein the method further comprises:
responsive to transmitting the second Interest, receiving an additional notification message which indicates a time period after which a third Interest is to be sent out.
20. The computer system of claim 18, wherein the notification message further indicates a name for the second Interest to be sent out, wherein the name for the second Interest is identical to or different from the name for the first Interest.
21. The computer system of claim 20, wherein the method further comprises:
transmitting the second Interest, wherein the second Interest includes the name indicated in the notification message.
22. The computer system of claim 18, wherein the notification message is a Content Object.
23. The computer system of claim 18, wherein the method further comprises:
removing an entry from a Pending Interest Table (PIT), wherein the entry corresponds to the first Interest.
24. The computer system of claim 18, wherein the method further comprises:
creating an entry in a Pending Interest Table (PIT), wherein the entry corresponds to the second Interest.

1461096842-dd9a25f7-dced-424c-b0d2-7cf77c4be986

1. A method for scheduling resources in an Orthogonal Frequency Division Multiplexing Access (OFDMA) network including a set of base stations (BS) in corresponding cells, each BS serving a set of mobile stations (MS) in each cell, wherein each cell includes a center regions and an edge region, and wherein the MS communicate packets including voice data, comprising a scheduler including a processor for performing steps of the method, comprising the steps of:
partitioning, during each scheduling period, available into a set of resource block {S};
assigning a set of {I} resource blocks to the MS in the center region;
assigning a set {IZ} of the resource blocks to the MS in the edge region;
maintaining a set {P} of unassigned resources;
receiving measurements reports from the MS indicating a level of inter-cell-interference (ICI);
assigning the resource blocks from the set {P} to the MS reporting ICI if the set {P} is not empty.
2. The method of claim 1, wherein a length of the scheduling period varies dynamically according to the measurement reports.
3. The method of claim 1, wherein the maintaining and assigning for the set {P} is independent for the MS in the center region and the edge region.
4. The method of claim 1, wherein the maintaining and assigning for the set {P} is joint for the MS in the center region and the edge region.
5. The method of claim 1, wherein the period includes a subperiod for the receiving and a subperiod for the assigning.
6. The method of claim 1, wherein the RB are added to the set {P}, when the MS leave the network.
7. The method of claim 1, wherein the scheduler is part of the BS.
8. The method of claim 1, wherein each RB includes a set of subcarriers in a frequency domain, and a set of symbols in a time domain.
9. The method of claim 8, wherein the subcarriers are contiguous.
10. The method of claim 8, wherein the subcarriers are disjoint.
11. The method of claim 1, wherein the scheduling is centralized.
12. The method of claim 1, wherein the scheduling is disjoint.
13. The method of claim 1, wherein the network has a frequency re-use factor of one.
14. The method of claim 1, wherein the scheduling is persistent.

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 sending an information package from a first data network to at least one second data network through a communications network, selected from a group consisting of a SDH and a SONET network, said communications network comprising a first plurality of access points and a second plurality of MPLS switches, a third plurality of paths defined from each of said access points to an Ethernet switch including MPLS switching capabilities via at least one of the first plurality of MPLS switches, a fourth plurality of paths defined from said Ethernet switch including MPLS switching capabilities to each of said access points via at least one of the second plurality of MPLS switches, said method comprising:
sending said information package from said first network to a specific access point of said first plurality, wherein said communications network comprises a SDH and a SONET network,
receiving said information package at said specific access point and adding a header to said information package, said header including an MPLS label,
sending said information package including said header from said specific access point to said Ethernet switch including MPLS switching capabilities via a path of said third plurality,
said Ethernet switch including MPLS switching capabilities switching said information package including said header to at least one of said paths of said fourth plurality,
receiving said information package including said header at at least one further specific access point corresponding to said at least one second data network,
removing said header from said information package, and
sending said information package from said at least one further specific access point to said at least one second data network.
2. The method according to claim 1, wherein said information package is an Ethernet package.
3. The method according to claim 1, wherein at least one of said first data network and said second data network is an Ethernet network.
4. The method according to claim 1, wherein said information package includes an Ethernet VLAN field, said Ethernet switch including MPLS switching capabilities reading said VLAN field.
5. The method according to claim 1, wherein said Ethernet switch including MPLS switching capabilities further includes software or hardware implementations of policing according to IETF specifications.
6. The method according to claim 1, wherein said Ethernet switch including MPLS switching capabilities further includes software or hardware implementations of shaping according to IETF specifications.
7. The method according to claim 1, wherein said Ethernet switch including MPLS switching capabilities further includes software or hardware implementations of red according to IETF specifications.