1461097553-bf6a76a5-7d70-4ef4-a27e-1faecd497541

1. A rebroadcasting system for retransmitting a television broadcast received from a satellite, in a segment broadcast such as one-segment broadcast and three-segment broadcast, comprising:
charging a solar battery during daytime, and recording the broadcast during a retransmission halt time;
retransmitting the television broadcast received from the satellite in real time by use of central (one or three) segments, with power charged in the solar battery during any time when an output of the solar battery is low;
reproducing the recorded broadcast; and
retransmitting the reproduced recorded program by use of any remaining segments such as segments adjacent to the central segments.
2. A rebroadcasting system for retransmitting a television broadcast received from a satellite, in a segment broadcasting such as one-segment broadcasting and three-segment broadcasting, comprising:
charging a solar battery during daytime, and recording the broadcast during plural time zones;
retransmitting the television broadcast received from the satellite in real time by use of central (one or three) segments, with power charged in the solar battery during any time when an output of the solar battery is low;
reproducing simultaneously programs recorded during plural time zones; and
retransmitting the plural simultaneously reproduced recorded programs by use of any remaining plural segments such as segments adjacent to the central segments.
3. A rebroadcasting system for retransmitting a television broadcast received from a satellite, in a segment broadcast such as one-segment broadcast and three-segment broadcast, comprising:
charging a solar battery during daytime, and recording broadcasts during a retransmission halt time; and
reproducing the recorded broadcast with power charged in the solar battery during any time when an output of the solar battery is low, and retransmitting the reproduced recorded program by use of any segment.

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 generating a route for a vessel to travel from a start point to and end point, the computer implemented method comprising:
identifying a start point and an end point for the vessel;
obtaining a forecast of wave conditions during a period of time;
obtaining a model of the vessel, wherein the model includes parameters used to calculate a response of the vessel to the wave conditions; and
generating a route from the start point to the endpoint for the vessel to travel on using the model of the vessel and the forecast of the wave conditions, using Dijkstra’s algorithm with minimum angular resolution, and wherein the route avoids a treacherous environment and meets a set of goals.
2. The computer implemented method of claim 1, wherein the generating step comprises:
generating the route from the start point to the end point for the vessel to traverse using the model of the vessel and the forecast of the wave conditions using Dijkstra’s algorithm with minimum angular resolution, wherein the route avoids treacherous conditions with a lowest cost to travel from the start point to the end point.
3. The computer implemented method of claim 2, wherein the set of goals is a lower cost to travel from the start point to the end point.
4. The computer implemented method of claim 1, wherein the start point is a grid point and is assigned a label value of zero and wherein the generating step comprises:
designating a non-permanent grid point with a smallest label value as a permanent grid point;
generating label values for a plurality of neighbor grid points that are non-permanent, wherein the each label value in the label values represents a cost to traverse from the permanent grid point to a neighbor grid point; and
repeating the designating and generating steps until the end point is reached.
5. The computer implemented method of claim 4, wherein the label value in the label values is generated as:
Label=L(P)+C(P, N, T(P))+E(P),

wherein Label is the label value, L(P) is a label value for the permanent grid point, C(P, N, T(P)) is a cost of traveling from the permanent grid point to a selected neighbor grid point starting at a selected time, and E(P) is an estimated cost to traverse a great circle route between the permanent grid point and the end point.
6. The computer implemented method of claim 5, wherein the cost to move from the permanent grid point to the neighbor grid point is based on a time to move from the permanent grid point to the neighbor grid point in which the vessel moves at a speed that avoids a set of conditions that cause the treacherous environment.
7. The computer implemented method of claim 6, wherein the set of conditions causing the treacherous environment comprises at least one of synchronous rolling, parametric rolling, surf-riding and broaching-to, and successive high wave attack.
8. The computer implemented method of claim 1 further comprising:
responsive to an event, repeating the steps of obtaining the forecast of wave conditions during a period of time; obtaining a model of the vessel, wherein the model includes parameters used to calculate a response of the vessel to the wave conditions; and generating a route from a starting point to an end point for the vessel using the model of the vessel and the forecast of the wave conditions, wherein the route avoids the treacherous environment.
9. The computer implemented method of claim 8, wherein the event is a periodic event.
10. The computer implemented method of claim 8, wherein the event is receipt of an updated forecast of the wave conditions during the period of time.
11. A computer implemented method for generating a route for a vessel, the computer implemented method comprising:
obtaining a forecast of weather conditions;
obtaining a set of parameters for the vessel, wherein the set of parameters are used to calculate a response of the vessel to forecast of the weather conditions; and
generating a route from a starting point to an end point for the vessel using the set of parameters for the vessel and the forecast of the weather conditions, wherein the route avoids treacherous environment when traveling from the start point to the end point, and
wherein the generating step comprises selecting a next point to travel to in the route from a current point, wherein the next point is selected from a plurality of neighbor points and the next point is a neighbor point in the plurality of points that has a lower cost to travel to from the current point in which a set of conditions that cause the treacherous environment is avoided; and repeating the selecting step until the end point for the route is reached to form the route.
12. The computer implemented method of claim 11, wherein the route has a lowest cost in addition to avoiding the treacherous environment.
13. The computer implemented method of claim 11 further comprising:
repeating the generating step each time a new forecast of weather conditions is obtained to generate an updated route.
14. The computer implemented method of claim 11, wherein the forecast of weather conditions is at least one of wave conditions and wind conditions.
15. A computer program product comprising:
a computer usable medium
computer usable program code, stored on the computer usable medium, for obtaining a forecast of weather conditions;
computer usable program code, stored on the computer usable medium, for obtaining a set of parameters for the vessel, wherein the set of parameters are used to calculate a response of the vessel to forecast of the weather conditions; and
computer usable program code, stored on the computer usable medium, for generating a route from a starting point to an end point for the vessel using the set of parameters for the vessel and the forecast of the weather conditions, using Dijkstra’s algorithm with minimum angular resolution, and wherein the route avoids a treacherous environment when traveling from the start point to the end point.
16. The computer program product of claim 15, wherein the route has a lowest cost in addition to avoiding the treacherous environments.
17. The computer program product of claim 15, wherein the computer usable product code, stored on the computer usable medium, for generating a route from a starting point to an end point for the vessel using the set of parameters for the vessel and the forecast of the weather conditions, wherein the route avoids treacherous environment when traveling from the start point to the end point comprises:
computer usable program code, stored on the computer usable medium, for selecting a next point to travel to in the route from a current point, wherein the next point is selected from a plurality of neighbor points and the next point is a neighbor point in the plurality of points that has a lowest cost to travel to from the current point in which a set of treacherous conditions is avoided; and
computer usable program code, stored on the computer usable medium, for repeating execution of the computer usable program code for selecting until the end point for the route is reached to form the route.
18. The computer program product of claim 15 further comprising:
computer usable program code, stored on the computer usable medium, for repeating initiation of the computer usable program code for generating a route from a starting point to an end point for the vessel using the set of parameters for the vessel and the forecast of the weather conditions, wherein the route avoids the treacherous environment when traveling from the start point to the end point each time a new forecast of weather conditions is obtained to generate an updated route.
19. The computer program product of claim 15, wherein the forecast of weather conditions is at least one of wave conditions and wind conditions.

1461097542-d3e50519-570c-430d-847e-d3bec09aab3f

1. A fiber laser apparatus comprising:
a seed light source outputting seed light;
an amplifying section for amplifying the seed light by cladding-pumping, said amplifying section including:
an amplifying optical fiber having a core extending along a predetermined axis, an inner cladding provided on an outer periphery of said core and having a refractive index lower than that of said core, and an outer cladding provided on an outer periphery of said inner cladding and having a refractive index lower than that of said inner cladding;
an pumping light source outputting pumping light; and
an optical multiplexers for supplying the seed light from said seed light source to said core of said amplifying optical fiber and supplying the pumping light from said pumping light source to said inner cladding of said amplifying optical fiber, whereby said amplifying optical fiber outputs single-mode amplified seed light that is amplified by cladding-pumping together with multimode residual pumping light;

an output optical system irradiating an object with the single-mode amplified seed light and multimode residual pumping light that are outputted from said amplifying optical fiber, said output optical system converging the single-mode amplified seed light on the object; and
a guiding optical fiber, for guiding the single-mode amplified seed light and multimode residual pumping light that are outputted from said amplifying optical fiber to said output optical system, provided between said amplifying optical fiber and said output optical system, said guiding optical fiber having a core extending along a predetermined axis, an inner cladding provided on an outer periphery of said core and having a refractive index lower than that of said core, and an outer cladding provided on an outer periphery of said inner cladding and having a refractive index lower than that of said inner cladding, whereby the single-mode amplified seed light outputted from said amplifying optical fiber propagates mainly in said core of said guiding optical fiber, and the multimode residual pumping light outputted from said amplifying optical fiber propagates mainly in said core and inner cladding of said guiding optical fiber.
2. A fiber laser apparatus according to claim 1, further comprising a heating light source outputting multimode light with a wavelength different from that of the pumping light, as heating light for heating the object,
wherein the heating light from said heating light source is supplied, from a light incidence end of said amplifying optical fiber, into said amplifying optical fiber through said optical multiplexer.
3. A fiber laser apparatus according to claim 2, wherein said heating light source outputs continuous light as multimode heating light.
4. A fiber laser apparatus according to claim 1, further comprising:
a heating light source outputting multimode light with a wavelength different from that of the pumping light, as heating light for heating the object; and
a different optical multiplexer provided between said amplifying optical fiber and said guiding optical fiber,
wherein the heating light from said heating light source is supplied, from a light incidence end of said guiding optical fiber, into said guiding optical fiber through said different optical multiplexer.
5. A fiber laser apparatus according to claim 2, wherein said heating light source outputs continuous light as multimode heating light.
6. A fiber laser apparatus according to claim 1, wherein said core of said amplifying optical fiber is doped with ytterbium of a concentration-length product such that unsaturated absorption of said amplifying optical fiber becomes 3 dB or more but 13 dB or less at a wavelength of the pumping light.

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 policy and charging control, PCC, architecture for handling Access Point Name-Aggregate Maximum Bit Rate, APN-AMBR, subscription data associated with a subscriber regardless if the subscriber’s user equipment is in an AMBR capable access or in an AMBR non-capable access, the PCC architecture comprising:
an Internet Protocol, IP, level convergence point that installs the APN-AMBR subscription data during an IP session establishment for the subscriber, where the IP level convergence point enforces the APN-AMBR subscription data for a lifetime of an IP session associated with the IP session establishment; and
a policy server, coupled to the IP level convergence point, where during the IP session establishment the policy server subscribes to be notified when there is an event trigger that indicates a change in the APN-AMBR subscription data associated with the subscriber.
2. The PCC architecture of claim 1, wherein the event trigger is initiated when a subscriber database initiates an APN-AMBR change.
3. The PCC architecture of claim 1, wherein the policy server retrieves APN-AMBR subscription from a subscriber data base when the subscriber’s user equipment moves to the non-AMBR capable access.
4. The PCC architecture of claim 1, wherein the IP level convergence point detects the event trigger and initiates an IP session modification during which the policy server is notified about the change in the APN-AMBR subscription data and the policy server then utilizes policy and charging control, PCC, signaling to send modified APN-AMBR subscription data to the IP level convergence point which stores and enforces the modified APN-AMBR subscription data.
5. The PCC architecture of claim 1, wherein a bearer binding and event reporting function, BBERF, detects the event trigger and initiates an IP session modification during which the policy server is notified about the change in the APN-AMBR subscription data and the policy server then uses policy and charging control, PCC, signaling to send modified APN-AMBR subscription data to the IP level convergence point which stores and enforces the modified APN-AMBR subscription data.
6. The PCC architecture of claim 1, wherein the policy server detects the event trigger and initiates an IP session modification during which the policy server uses policy and charging control, PCC, signaling to send modified APN-AMBR subscription data to the IP level convergence point which then stores and enforces the modified APN-AMBR subscription data.
7. The PCC architecture of claim 1, wherein the policy server detects that a volume or a time limit according to the APN-AMBR subscription data has been reached then initiates an IP session modification during which the policy server uses policy and charging control, PCC, signaling to send modified APN-AMBR subscription data to the IP level convergence point which then stores and enforces the modified APN-AMBR subscription data.
8. The PCC architecture of claim 1, wherein the IP level convergence point detects the event trigger and initiates an IP session modification during which the policy server is notified about the change causing the event trigger and then the policy server makes a policy decision and sends policy and charging control, PCC, rules to the IP level convergence point.
9. The PCC architecture of claim 1, wherein:
the IP level convergence point is a policy and charging enforcement function; and
the policy server is a policy and charging rules function.
10. A method for handling Access Point Name-Aggregate Maximum Bit Rate, APN-AMBR, subscription data associated with a subscriber regardless if the subscriber’s user equipment is located in an AMBR capable access or in an AMBR non-capable access, the method comprising:
installing the APN-AMBR subscription data in an Internet Protocol, IP, level convergence point during an IP session establishment for the subscriber;
enforcing the APN-AMBR subscription from the IP level convergence point for a lifetime of an IP session associated with the IP session establishment; and
subscribing by a policy server to be notified when there is an event trigger that indicates a change in the APN-AMBR subscription data associated with the subscriber.
11. The method of claim 10, wherein the event trigger is initiated when a subscriber database initiates an APN-AMBR change.
12. The method of claim 10, further comprising the steps of:
detecting the event trigger at the IP level convergence point;
initiating an IP session modification from the IP level convergence point to notify the policy server about the change in the APN-AMBR subscription data;
utilizing policy and charging control, PCC, signaling to send modified APN-AMBR subscription data from the policy server to the IP level convergence point;
storing the modified APN-AMBR subscription data at the IP level convergence point; and
enforcing the modified APN-AMBR subscription data at the IP level convergence point.
13. The method of claim 10, further comprising the steps of:
detecting the event trigger at a bearer binding and event reporting function, BBERF;
initiating an IP session modification from the BBERF to notify the policy server about the change in the APN-AMBR subscription data;
utilizing policy and charging control, PCC, signaling to send modified APN-AMBR subscription data from the policy server to the IP level convergence point;
storing the modified APN-AMBR subscription data at the IP level convergence point; and
enforcing the modified APN-AMBR subscription data at the IP level convergence point.
14. The method of claim 10, further comprising the steps of:
detecting the event trigger at the policy server;
initiating an IP session modification from the policy server;
utilizing policy and charging control, PCC, signaling to send modified APN-AMBR subscription data from the policy server to the IP level convergence point;
storing the modified APN-AMBR subscription data at the IP level convergence point; and
enforcing the modified APN-AMBR subscription data at the IP level convergence point.
15. The method of claim 10, further comprising the steps of:
detecting the event trigger at the IP level convergence point;
initiating an IP session modification from the IP level convergence point to notify the policy server about a change causing the event trigger;
making a policy decision at the policy server; and
sending policy and charging control, PCC, rules from the policy server to the IP level convergence point.
16. The method of claim 10, wherein:
the IP level convergence point is a policy and charging enforcement function; and
the policy server is a policy and charging rules function.
17. A telecommunications network for handling Access Point Name-Aggregate Maximum Bit Rate, APN-AMBR, subscription data associated with a subscriber regardless if the subscriber’s user equipment is located in an AMBR capable access or in an AMBR non-capable access, the telecommunications network comprising:
a bearer binding and event reporting function, BBERF;
an Internet Protocol, IP, level convergence point that installs the APN-AMBR subscription data during an IP session establishment for the subscriber, where the IP level convergence point enforces the APN-AMBR subscription data for a lifetime of an IP session associated with the IP session establishment; and
a policy server, coupled to the IP level convergence point, where during the IP session establishment the policy server subscribes to be notified by at least the BBERF and the IP level convergence point when there is an event trigger that indicates a change in the APN-AMBR subscription data associated with the subscriber, and when notified about the event trigger utilizes policy and charging control, PCC, signaling to send modified APN-AMBR subscription data to the IP level convergence point.
18. The telecommunications network of claim 17, wherein the policy server detects that the subscriber’s user equipment attaches or moves to an access that does not supporting AMBR and then retrieves the AMBR from a database and then installs the retired AMBR in the IP level convergence point.
19. An Internet Protocol, IP, level convergence point that interacts with at least a policy server to handle Access Point Name-Aggregate Maximum Bit Rate, APN-AMBR, subscription data associated with a subscriber regardless if the subscriber’s user equipment is located in an AMBR capable access or in an AMBR non-capable access, the IP level convergence point comprising:
a processor; and
a memory that stores processor-executable instructions where the processor interfaces with the memory and executes the processor-executable instructions to: (1) install the APN-AMBR subscription data during an IP session establishment for the subscriber; and (2) enforce the APN-AMBR subscription data for a lifetime of an IP session associated with the IP session establishment.
20. A policy server that interacts with at least an IP level convergence point and a Subscriber Profile Repository, SPR, to handle Access Point Name-Aggregate Maximum Bit Rate, APN-AMBR, subscription data associated with a subscriber regardless if the subscriber’s user equipment is located in an APN-AMBR capable access or in an APN-AMBR non-capable access, the policy server comprising:
a processor; and
a memory that stores processor-executable instructions where the processor interfaces with the memory and executes the processor-executable instructions to: (1) subscribe to be notified when there is an event trigger that indicates a change in the APN-AMBR subscription data associated with the subscriber; and (2) when notified about the change in the APN-AMBR subscription data utilize policy and charging control, PCC, signaling to send modified APN-AMBR subscription data to the IP level convergence point.