Author: claimsbot

1. A decoding method comprising:
decoding first coded data included in a coded data into first partial data, the coded data being encoded from first data with a first character code, by a processor;
detecting character boundary in the first partial data based on character code information that the coded data is encoded from the first data with the first character code, by the processor; and
converting at least a part of the first partial data into second data with a second character code utilizing the detected character boundary, based on information associating the first character code with the second character code, by the processor.
2. The decoding method according to claim 1, wherein
the decoding includes decoding the first coded data into partial data representing a byte string of a particular group that becomes a longest match by using a slide window and accumulating the decoded partial data in a storage area, by the processor,
the detecting includes determining, at a timing of the decoding of the first coded data, whether or not the character boundary is detected in the partial data accumulated in the storage area, by the processor, and
the converting includes converting, when the character boundary is determined to be detected in the partial data accumulated in the storage area, data of the unit delimited by the detected character boundary into data of the second character code, by the processor.
3. The decoding method according to claim 2, wherein
the detecting includes obtaining, based on correspondence between a character code of a head byte of a character and a character length indicating a length of a character code of a character, a character length corresponding to a character code of a head byte of the partial data accumulated in the storage area, and determining whether or not a length of the partial data accumulated in the storage area is equal to or greater than the obtained character length, by the processor, and
the converting includes converting, when the length of the partial data accumulated in the storage area is determined to be equal to or greater than the obtained character length at the detecting, data corresponding to the character length from a head of the partial data accumulated in the storage area into data of the second character code, by the processor.
4. The decoding method according to claim 3, wherein the converting includes converting, the data corresponding to the character length from the head of the partial data accumulated in the storage area into the data of the second character code, and shifting the data corresponding to the character length in a direction to delete the data, by the processor.
5. The decoding method according to claim 3, wherein the converting includes selecting, from a plurality of pieces of conversion information, which are pieces of conversion information associating, per character, data of character codes of a conversion source and data of character codes of a conversion destination and which are in pairs of the character codes of the conversion source and the character codes of the conversion destination, conversion information according to a character code of the conversion source and a character code of the conversion destination, and converting, by using the selected conversion information, the data corresponding to the character length from the head of the partial data accumulated in the storage area into the data of the character code of the conversion destination, by the processor.
6. A decoding apparatus comprising:
a processor configured to execute a process including:
decoding first coded data included in a coded data into first partial data, the coded data being encoded from first data with a first character code, by a processor;
detecting character boundary in the first partial data based on character code information that the coded data is encoded from the first data with the first character code, by the processor; and
converting at least a part of the first partial data into second data with a second character code utilizing the detected character boundary, based on information associating the first character code with the second character code, by the processor.
7. A non-transitory computer-readable recording medium storing therein a decoding program that causes a computer to execute a process comprising:
decoding first coded data included in a coded data into first partial data, the coded data being encoded from first data with a first character code;
detecting character boundary in the first partial data based on character code information that the coded data is encoded from the first data with the first character code; and
converting at least a part of the first partial data into second data with a second character code utilizing the detected character boundary, based on information associating the first character code with the second character code.

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 for guiding radiation therapy of a patient comprising:
locating a patient on a treatment support, the patient having a lesion requiring radiation therapy;
preparing the patient for radiation therapy on the treatment support;
moving a magnet of an MRI system into a position at the treatment support for imaging the patient while on the treatment support;
while the patient is on the treatment support using the MRI system to obtain a series of images of a location of the lesion within the patient;
while the patient is on the treatment support, during the obtaining of the images, obtaining data relating to respiration andor heartbeat of the patient;
using the series of images to generate lesion movement data relating to a correlation between movement of the location of the lesion and the data relating to the respiration andor heartbeat;
moving the magnet of the MRI system away from the treatment support so as to allow the radiation therapy;
and during the radiation therapy, using real time data relating to respiration andor heartbeat of the patient and guiding the radiation therapy using the lesion movement data correlated to the real time data of the respiration andor heartbeat.
2. The method according to claim 1 wherein the images from the MR system in an MR coordinate system are correlated relative to a coordinate system of the radiation therapy by using the treatment support as a common baseline.
3. The method according to claim 1 wherein the magnet is an annular magnet surrounding a longitudinal axis and is moved longitudinally of its axis.
4. The method according to claim 1 wherein the radiation therapy is generated by a collimated radiation source which is rotated round the lesion in a manner which controls the application of a required dose of radiation to the lesion while accommodating the shape of the lesion and the movement of the lesion,
5. The method according to claim 1 wherein radiation therapy is provided by a radiation source where the radiation source and the treatment support are located in a room shielded to prevent release of the radiation and wherein the room includes a door through which the magnet moves to remove the magnet from the room during the therapy.
6. The method according to claim 1 wherein the lesion movement data relating to a correlation between movement of the location of the lesion and the data relating to the respiration is obtained during a plurality of respiration cycles and cardiac cycles.
7. The method according to claim 1 wherein the system acts to generate the series of images at a selected respiration rate and during the radiation therapy to monitor the respiratory rate to ensure that the rate has not changed outside of the bounds set for the needed accuracy of the movement of the beam and in the event that the rate deviates by a predetermined degree, the radiation therapy beam is stopped, until the rate returns to the selected rate.
8. The method according to claim 1 wherein the data relating to respiration of the patient is obtained by a sensor independent of the MRI system.
9. The method according to claim 1 wherein the data relating to respiration of the patient is obtained by a sensor responsive to movement of the chest of the patient.

1. A license plate for a vehicle, comprising:
a generally planar base having a front surface and a rear surface;
a cavity disposed in at least one of the front surface and the rear surface;
an RFID tag situated in the cavity; and
a closure coupled to the license plate to close off the cavity.
2. The license plate of claim 1 wherein the closure is a cover joined to the rear surface.
3. The license plate of claim 2 wherein the cover is joined to the base with at least one of adhesive, ultrasonic welding, molding and fasteners.
4. The license plate of claim 1 wherein the closure is a sealing material disposed in the cavity.
5. The license plate of claim 4 wherein the sealing material is at least one of adhesive, hot-melt and epoxy.
6. The license plate of claim 1 wherein the base is made from at least one of plastic, metal and composite material.
7. The license plate of claim 1 wherein the RFID tag is a passive type.
8. The license plate of claim 1 wherein the RFID tag is an active type;
9. The license plate of claim 8, further comprising at least one solar cell proximate the front surface and electrically connected to a power supply of the RFID tag to supply electrical power to the RFID tag.
10. The license plate of claim 8, further comprising electrical wiring configured to be connected to an electrical system of a vehicle, the wiring being further connected to a power supply of the RFID tag to supply electrical power to the RFID tag.
11. The license plate of claim 8 wherein the RFID tag further comprises a battery.
12. A license plate for a vehicle, comprising:
a generally planar base having a front surface and a rear surface;
a generally planar cover having a front surface and a rear surface, the rear surface of the cover being joined to the front surface of the base;
a cavity formed in at least one of the front surface of the base and the rear surface of the cover; and
an RFID tag situated in the cavity.
13. The license plate of claim 12 wherein the cover is joined to the base with at least one of adhesive, ultrasonic welding, molding and fasteners.
14. The license plate of claim 12 wherein the cavity comprises facially adjacent cavities formed in the base and the cover.
15. The license plate of claim 12 wherein the base is made from at least one of plastic, metal and composite material.
16. The license plate of claim 12 wherein the RFID tag is a passive type.
17. The license plate of claim 12 wherein the RFID tag is an active type;
18. The license plate of claim 17, further comprising at least one solar cell proximate the front surface and electrically connected to a power supply of the RFID tag to supply electrical power to the RFID tag.
19. The license plate of claim 17, further comprising electrical wiring configured to be connected to an electrical system of a vehicle, the wiring being further connected to a power supply of the RFID tag to supply electrical power to the RFID tag.
20. A license plate for a vehicle, comprising:
a generally planar base having a front surface and a rear surface;
a cavity disposed in at least one of the front surface and the rear surface;
an active-type RFID tag situated in the cavity;
at least one solar cell proximate the front surface and electrically connected to a power supply of the RFID tag to supply electrical power to the RFID tag;
electrical wiring configured to be connected to an electrical system of a vehicle, the wiring being further connected to a power supply of the RFID tag to supply electrical power to the RFID tag; and
a closure coupled to the license plate to close off the cavity.

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 method of playing a game comprising the steps of:
(a) providing a first matrix having an array consisting of at least two columns of elements and at least two rows of elements, said columns and rows being arranged such that each of said elements is simultaneously included in one of said columns and one of said rows and is positioned adjacent to at least one of said elements so as to form primary predesignated sets of elements each of the elements in said primary predesignated sets being adjacent to at least one other of said elements in its said set and at least one of the columns has a designation selected form a first class of designation selected from a combination of said first class of designations and a second class of designations wherein the designation from the first class of designations is based on a spatial relationship of the elements and one of the designations used for the columns and rows;
(b) causing a first player to be associated by a physical means with said first matrix by having said first player assigned to a first position adjacent said first matrix; and
(c) generating a random set of elements by identifying a plurality of combinations of the first and second classes of designations and declaring a winning combination if said random set of elements matches any one of the primary predesignated sets of elements and wherein if the random set of elements generated in this step does not match either any one of the primary predesignated sets of elements, further random sets of elements are successively randomly generated until one of said further random sets of elements matches any one of the primary predesignated sets of elements and the first player wins when one of said random sets of elements matches any one of the primary predesignated sets of elements.
2. The method of claim 1 wherein there are three columns and three rows.
3. The method of claim 2 wherein the first class of designations comprises letters.
4. The method of claim 3 wherein the letter are B, I, N, G and O.
5. The method of claim 4 wherein the letters B, I and N are used to designate the columns.
6. The method of claim 5 wherein G and O are used to designate two of the rows.
7. The method of claim 6 wherein one of the elements is designated as FREE.
8. The method of claim 3 wherein the second class of designations comprises numeral.
9. The method of claim 7 wherein the second class of designations comprises numerals.
10. The method of claim 9 wherein all of the elements except the FREE element is designated with at least one letter and a numeral.