All The Claims

1. A semiconductor device comprising:
a semiconductor chip;
a circuit element for operation as a passive element or an active element;
a first pad electrically connected to the semiconductor chip;
a second pad electrically connected to the circuit element;
a land on which the semiconductor chip is mounted;
a wiring line integrally extended from the land and having a width smaller than a width of the semiconductor chip; and
an insulating resin for sealing the semiconductor chip, the circuit element, the first pad, the second pad and the land,
wherein each of the first pad, the second pad and the land comprises crystals oriented more transversally than vertically relative to a plane of each of the first pad, the second pad and the land.
2. The semiconductor device according to claim 1, further comprising a plating film disposed on at least one of the first pad, the second pad and the land, wherein a part of grain boundaries of the plating film is covered with the transversally oriented crystals to prevent the intrusion of impurities into the first pad, the second pad and the land.
3. The semiconductor device according to claim 2, wherein the plating film is disposed within a surface of at least one of the first pad, the second pad and the land.
4. The semiconductor device according to claim 1, wherein each of the first pad, the second pad, the land and the wiring line is derived from a rolled foil mainly made of copper.
5. The semiconductor device according to claim 1, wherein the insulating resin comprises a thermosetting resin by transfer molding and have a thickness equal to or less than 400 micrometers.

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 washing a filter for removing impurities trapped in a filter bed during a service run of the filter, said method comprising the steps of:
(a) providing an underdrain lateral having at least a first chamber and a second chamber, the first chamber having at least one opening for permitting a liquid and a gas to pass from said first chamber into the filter bed and the second chamber having at least one opening for permitting a fluid to pass from said second chamber into the filter bed;
(b) directing a washing liquid and a washing gas from the first chamber into the filter bed; and,
(c) directing only a washing gas from the second chamber into the filter bed while a washing gas and a washing liquid are directed from the first chamber into the filter bed.
2. A method of washing a filter bed for filtering water or wastewater, said method including the steps of:
(a) providing an underdrain lateral having at least a first chamber, a second chamber and a third chamber, said first chamber being a washing gas chamber as said first chamber receives a washing gas from a washing fluid supply source during washing of a filter bed, said second chamber being in fluid communication with said first chamber such that a washing gas introduced into said first chamber passes into said second chamber, said third chamber being in fluid communication with said second chamber; and
(b) directing a gas in a pulsating manner into the filter bed from said third chamber while simultaneously directing gas in a steady stream manner into the filter bed from said second chamber.

1. A method of paging data comprising the steps of:
storing a plurality of pages of data in a main memory;
determining that paging must occur; and
paging out a page of data from the main memory based on the memory pressure of the page of data, which is based on a probability of use of each of the plurality of pages of data in the main memory, wherein the probability of use of each of the plurality of pages of data in the main memory is determined by:
determining whether a page is associated with a transaction for which all data has been generated;
if the page is associated with a transaction for which all data has been generated, assigning a higher probability of use; and
if the page is associated with a transaction for which not all data has been generated, then:
determining whether any pages in a group of pages associated with a transaction have been used,
if at least one of page in the group of pages associated with a transaction have been used, assigning a higher probability of use, and
if no page in the group of pages associated with a transaction have been used, assigning a lower probability of use.
2. The method of claim 1, wherein the paging out step comprises the steps of:
determining an amount of time a page is or will be in memory for each of the plurality of pages of data in the main memory; and
determining a memory pressure for each of the plurality of pages of data in the main memory.
3. The method of claim 1, wherein the step of determining a memory pressure for each of the plurality of pages of data in the main memory comprises the steps of:
determining the memory pressure based on a product of the amount of time a page is or will be in memory without being used and a size of the page.
4. The method of claim 1, wherein the step of assigning a lower probability of use if no page in the group of pages associated with a transaction have been used comprises the step of:
assigning a probability of use to a page based on how recently the page was stored in main memory.
5. The method of claim 4, wherein the step of assigning a probability of use to a page based on how recently the page was stored in main memory comprises the steps of:
assigning a higher probability of use to a page that was stored in main memory relatively less recently; and
assigning a lower higher probability of use to a page that was stored in main memory relatively more recently.
6. A system for paging data comprising:
a processor operable to execute computer program instructions;
a memory operable to store computer program instructions executable by the processor;
a main memory operable to store a plurality of pages of data; and
computer program instructions stored in the memory and executable to perform the steps of:
storing a plurality of pages of data in the main memory;
determining that paging must occur; and
paging out a page of data from the main memory based on the memory pressure of the page of data, which is based on a probability of use of each of the plurality of pages of data in the main memory, wherein the probability of use of each of the plurality of pages of data in the main memory is determined by;
determining whether a page is associated with a transaction for which all data has been generated;
if the page is associated with a transaction for which all data has been generated, assigning a higher probability of use; and
if the page is associated with a transaction for which not all data has been generated, then:
determining whether any pages in a group of pages associated with a transaction have been used,
if at least one of page in the group of pages associated with a transaction have been used, assigning a higher probability of use, and
if no page in the group of pages associated with a transaction have been used, assigning a lower probability of use.
7. The system of claim 6, wherein the paging out step comprises the steps of:
determining an amount of time a page is or will be in memory for each of the plurality of pages of data in the main memory; and
determining a memory pressure for each of the plurality of pages of data in the main memory.
8. The system of claim 6, wherein the step of determining a memory pressure for each of the plurality of pages of data in the main memory comprises the steps of:
determining the memory pressure based on a product of the amount of time a page is or will be in memory without being used and a size of the page.
9. The system of claim 6, wherein the step of assigning a lower probability of use if no page in the group of pages associated with a transaction have been used comprises the step of:
assigning a probability of use to a page based on how recently the page was stored in main memory.
10. The system of claim 9, wherein the step of assigning a probability of use to a page based on how recently the page was stored in main memory comprises the steps of:
assigning a higher probability of use to a page that was stored in main memory relatively less recently; and
assigning a lower higher probability of use to a page that was stored in main memory relatively more recently.
11. The system of claim 6, wherein the memory and the main memory are the same memory.
12. The system of claim 6, wherein the memory and the main memory are different memories.
13. A computer program product for paging data, comprising:
a computer readable medium;
computer program instructions, recorded on the computer readable medium, executable by a processor, for performing the steps of
storing a plurality of pages of data in a main memory;
determining that paging must occur; and
paging out a page of data from the main memory based on the memory pressure of the page of data, which is based on a probability of use of each of the plurality of pages of data in the main memory, wherein the probability of use of each of the plurality of pages of data in the main memory is determined by:
determining whether a page is associated with a transaction for which all data has been generated;
if the page is associated with a transaction for which all data has been generated, assigning a higher probability of use; and
if the page is associated with a transaction for which not all data has been generated, then:
determining whether any pages in a group of pages associated with a transaction have been used,
if at least one of page in the group of pages associated with a transaction have been used, assigning a higher probability of use, and
if no page in the group of pages associated with a transaction have been used, assigning a lower probability of use.
14. The computer program product of claim 13, wherein the paging out step comprises the steps of:
determining an amount of time a page is or will be in memory for each of the plurality of pages of data in the main memory; and
determining a memory pressure for each of the plurality of pages of data in the main memory.
15. The computer program product of claim 13, wherein the step of determining a memory pressure for each of the plurality of pages of data in the main memory comprises the steps of:
determining the memory pressure based on a product of the amount of time a page is or will be in memory without being used and a size of the page.
16. The computer program product of claim 13, wherein the step of assigning a lower probability of use if no page in the group of pages associated with a transaction have been used comprises the step of:
assigning a probability of use to a page based on how recently the page was stored in main memory.
17. The computer program product of claim 16, wherein the step of assigning a probability of use to a page based on how recently the page was stored in main memory comprises the steps of:
assigning a higher probability of use to a page that was stored in main memory relatively less recently; and
assigning a lower higher probability of use to a page that was stored in main memory relatively more recently.
18. A method of paging data comprising the steps of:
storing a plurality of pages of data in a main memory;
determining that paging must occur; and
paging out a page of data from the main memory based on the memory pressure of the page of data;
wherein the paging out step comprises the steps of determining an amount of time a page is or will be in memory for each of the plurality of pages of data in the main memory, and determining a memory pressure for each of the plurality of pages of data in the main memory;
wherein the step of determining a memory pressure for each of the plurality of pages of data in the main memory comprises the step of determining the memory pressure based on a product of the amount of time a page is or will be in memory without being used and a size of the page;
wherein the step of determining an amount of time a page is or will be in memory for each of the plurality of pages of data in the main memory comprises the step of determining a probability of use of each of the plurality of pages of data in the main memory; and
wherein the step of determining a probability of use of each of the plurality of pages of data in the main memory comprises the steps of determining whether a page is associated with a transaction for which all data has been generated, if the page is associated with a transaction for which all data has been generated, assigning a higher probability of use, and if the page is associated with a transaction for which not all data has been generated, then determining whether any pages in a group of pages associated with a transaction have been used, if at least one of page in the group of pages associated with a transaction have been used, assigning a higher probability of use, and if at no page in the group of pages associated with a transaction have been used, assigning a lower probability of use.
19. The method of claim 18, wherein the step of assigning a lower probability of use if at no page in the group of pages associated with a transaction have been used comprises the step of:
assigning a probability of use to a page based on how recently the page was stored in main memory.
20. The method of claim 19, wherein the step of assigning a probability of use to a page based on how recently the page was stored in main memory comprises the steps of:
assigning a higher probability of use to a page that was stored in main memory relatively less recently; and
assigning a lower higher probability of use to a page that was stored in main memory relatively more recently.
21. A system for paging data comprising:
a processor operable to execute computer program instructions;
a memory operable to store computer program instructions executable by the processor;
a main memory operable to store a plurality of pages of data; and
computer program instructions stored in the memory and executable to perform the steps of:
storing a plurality of pages of data in the main memory;
determining that paging must occur; and
paging out a page of data from the main memory based on the memory pressure of the page of data;
wherein the paging out step comprises the steps of determining an amount of time a page is or will be in memory for each of the plurality of pages of data in the main memory, and determining a memory pressure for each of the plurality of pages of data in the main memory;
wherein the step of determining a memory pressure for each of the plurality of pages of data in the main memory comprises the step of determining the memory pressure based on a product of the amount of time a page is or will be in memory without being used and a size of the page;
wherein the step of determining an amount of time a page is or will be in memory for each of the plurality of pages of data in the main memory comprises the step of determining a probability of use of each of the plurality of pages of data in the main memory; and
wherein the step of determining a probability of use of each of the plurality of pages of data in the main memory comprises the steps of determining whether a page is associated with a transaction for which all data has been generated, if the page is associated with a transaction for which all data has been generated, assigning a higher probability of use, and if the page is associated with a transaction for which not all data has been generated, then determining whether any pages in a group of pages associated with a transaction have been used, if at least one of page in the group of pages associated with a transaction have been used, assigning a higher probability of use, and if at no page in the group of pages associated with a transaction have been used, assigning a lower probability of use.
22. The system of claim 21, wherein the step of assigning a lower probability of use if at no page in the group of pages associated with a transaction have been used comprises the step of:
assigning a probability of use to a page based on how recently the page was stored in main memory.
23. The system of claim 22, wherein the step of assigning a probability of use to a page based on how recently the page was stored in main memory comprises the steps of:
assigning a higher probability of use to a page that was stored in main memory relatively less recently; and
assigning a lower higher probability of use to a page that was stored in main memory relatively more recently.
24. A computer program product for paging data, comprising:
a computer readable medium;
computer program instructions, recorded on the computer readable medium, executable by a processor, for performing the steps of
storing a plurality of pages of data in a main memory;
determining that paging must occur; and
paging out a page of data from the main memory based on the memory pressure of the page of data;
wherein the paging out step comprises the steps of determining an amount of time a page is or will be in memory for each of the plurality of pages of data in the main memory, and determining a memory pressure for each of the plurality of pages of data in the main memory;
wherein the step of determining a memory pressure for each of the plurality of pages of data in the main memory comprises the step of determining the memory pressure based on a product of the amount of time a page is or will be in memory without being used and a size of the page;

wherein the step of determining an amount of time a page is or will be in memory for each of the plurality of pages of data in the main memory comprises the step of determining a probability of use of each of the plurality of pages of data in the main memory; and
wherein the step of determining a probability of use of each of the plurality of pages of data in the main memory comprises the steps of determining whether a page is associated with a transaction for which all data has been generated, if the page is associated with a transaction for which all data has been generated, assigning a higher probability of use, and if the page is associated with a transaction for which not all data has been generated, then determining whether least one of page in the group of pages associated with a transaction have been used, assigning a higher probability of use, and if at no page in the group of pages associated with a transaction have been used, assigning a lower probability of use.
25. The computer program product of claim 24, wherein the step of assigning a lower probability of use if at no page in the group of pages associated with a transaction have been used comprises the step of:
assigning a probability of use to a page based on how recently the page was stored in main memory.
26. The computer program product of claim 25, wherein the step of assigning a probability of use to a page based on how recently the page was stored in main memory comprises the steps of:
assigning a higher probability of use to a page that was stored in main memory relatively less recently; and
assigning a lower higher probability of use to a page that was stored in main memory relatively more recently.

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 plant, a plant part, or a seed of soybean variety XB05Y12, representative seed of said soybean variety XB05Y12 having been deposited under ATCC Accession Number PTA-12424.
2. A soybean seed obtained by introducing a transgene into soybean variety XB05Y12, representative seed of said so bean variety XB05Y12 having been deposited under ATCC Accession Number PTA-12424.
3. The seed of claim 2, wherein the transgene confers a trait selected from the group consisting of male sterility, site-specific recombination, abiotic stress tolerance, altered phosphorus, altered antioxidants, altered fatty acids, altered essential amino acids, altered carbohydrates, herbicide resistance, insect resistance, and disease resistance.
4. A soybean plant, or a part thereof, produced by growing the seed of claim 1.
5. A soybean plant, or a part thereof, produced by growing the seed of claim 2.
6. A method for developing a second soybean plant comprising applying plant breeding techniques to a first soybean plant, or parts thereof, wherein said first soybean plant is the soybean plant of claim 1, and wherein application of said techniques results in development of said second soybean plant.
7. A method for producing soybean seed comprising crossing two soybean plants and harvesting the resultant soybean seed, wherein at least one soybean plant is the soybean plant of claim 1.
8. The soybean seed produced by the method of claim 7.
9. A soybean plant, or a part thereof, produced by growing said seed of claim 8.
10. A method for developing a second soybean plant in a soybean plant breeding program comprising applying plant breeding techniques to a first soybean plant, or parts thereof, wherein said first soybean plant is the soybean plant of claim 9, and wherein application of said techniques results in development of said second soybean plant.
11. A method of producing a soybean plant comprising a locus conversion, the method comprising introducing a locus conversion into the plant of claim 1, wherein said locus conversion provides a trait selected from the group consisting of male sterility, site-specific recombination, abiotic stress tolerance, altered phosphorus, altered antioxidants, altered fatty acids, altered essential amino acids, altered carbohydrates, herbicide resistance, insect resistance, and disease resistance.
12. A herbicide resistant soybean plant produced by the method of claim 11.
13. A disease resistant soybean plant produced by the method of claim 11.
14. An insect resistant soybean plant produced by the method of claim 11.
15. The soybean plant of claim 14, wherein the locus conversion comprises a transgene encoding a Bacillus thuringiensis (Bt) endotoxin.
16. A soybean plant, or a part thereof, expressing all the physiological and morphological characteristics of soybean variety XB05Y12, representative seed of said soybean variety XB05Y12 having been deposited under ATCC Accession Number PTA-12424.
17. A method comprising isolating nucleic acids from a plant, a plant part, or a seed of soybean variety XB05Y12, analyzing said nucleic acids to produce data, and recording the data for XB05Y12, representative seed of said soybean variety XB05Y12 having been deposited under ATCC Accession Number PTA-12424.
18. The method of claim 17, wherein the data is recorded on a computer readable medium.
19. The method of claim 17, further comprising using the data for crossing, selection, or advancement decisions in a breeding program.
20. The method of claim 17, wherein the data is a nucleic acid sequence, a marker profile, a haplotype, or any combination thereof.