Author: claimsbot

1. A method for extracting geologic faults from a 3-D seismic attribute cube, the method comprising:
calculating a minimum path value for each voxel of the 3-D seismic attribute cube;
extracting a fault network skeleton from the 3-D seismic attribute cube by utilizing the minimum path values which correspond to voxels within the 3-D seismic attribute cube;
flood filling the fault network to identify a plurality of fault segments, labeling the fault segments, and creating a vector description of the fault network skeleton;
subdividing the fault segments into individual fault patches wherein the individual fault patches are the smallest, non-intersecting, non-bifurcating patches that lie on only one geologic fault; and
correlating the individual fault patches into a representation of geologic faults.
2. The method according to claim 1, wherein the step of calculating a minimum path value includes calculating a 3-D minimum path value.
3. The method according to claim 1, wherein the step of calculating a minimum path further includes calculating the minimum path value of each voxel considering all routes from a pixel \u201cP\u201d to one of a plurality of termination pixels \u201cT\u201d which is equal to or greater than 4, and summing the values of all voxels along this route.
4. The method according to claim 1, wherein the step of calculating a minimum path further includes calculating the minimum path value using a raster order for each of 16 predefined orientations.
5. The method according to claim 1, wherein the step of calculating a minimum path further includes calculating the minimum path value using a reverse-raster order for each of 16 predefined orientations.
6. The method according to claim 1, further comprising applying a directional filter to the minimum path values to improve the connections between adjacent minimum path values.
7. The method according to claim 1, further comprising performing a morphological top hat operation to create a top hat image.
8. The method according to claim 7, further comprising a binarization of the top hat image utilizing a simple threshold.
9. The method according to claim 8, further comprising extracting a plurality of extremities from the binarization of the top hat image.
10. The method according to claim 9, further comprising skeletonizing the binarization of the top hat image, such that the skeleton passes through the extremities and through a highest values of the top hat image.
11. The method according to claim 1, further comprising cleaning up the fault network skeleton using a pruning algorithm.
12. The method according to claim 1, wherein the voxels which are on the fault skeleton are assigned a finding of \u201cfault.\u201d
13. The method according to claim 12, further comprising finding discrete grouping of voxels which were assigned a finding of \u201cfault\u201d, that are mutually connected into fault segments.
14. The method according to claim 1, further comprising determining an angle of an eigenvector of a variance-covariance matrix associated with a segment, and if the angle is within a pre-determined range, then maintaining the segment as a single patch, and if the angle outside the pre-determined range then subdividing the segment into at least two fault patches.
15. The method according to claim 1, wherein the step of subdividing further comprises utilizing an adjacency list to merge a plurality of fault patches which have voxels in common.
16. The method according to claim 1, further comprising determining a vector description of the fault network by determining an angle of an eigenvector of a variance-covariance matrix associated with connected segments, and if an angular difference is within a pre-determined range, then maintaining the segments as a single patch, and if the angular difference is outside the pre-determined range then subdividing the segment into at least two fault patches with their associated eigenvectors.
17. The method according to claim 1, wherein the step of labeling further comprises constructing a best-fit plane from adjacent connected points within a 3-D lattice.
18. The method according to claim 1, wherein the step of subdividing further comprises calculating a normal to a best-fit plane for each voxel on a fault patch fragment in a 3-D lattice.
19. The method according to claim 1, wherein the step of subdividing further comprises constructing a best-fit plane from adjacent connected points within a 3-D lattice, and calculating a normal to a best-fit plane for each voxel on a fault patch fragment in a 3-D lattice.
20. The method according to claim 18, wherein the step of calculating includes comparing the normal best-fit plane between each adjacent voxel that lies on a fault patch fragment, and identifying the normal best-fit planes which are within the user-supplied limit, and merging similarly oriented fault fragments into a fault patch.
21. The method according to claim 19, wherein the step of constructing includes comparing the normal best-fit plane between each adjacent voxel that lies on a fault patch fragment, and identifying the normal best-fit planes which are within the user-supplied limit, and merging similarly oriented fault fragments into a fault patch.
22. The method according to claim 1, further comprising correlating the individual fault patches into realistic representations of geologic faults in a manual or semi-manual approach.
23. The method according to claim 22, wherein the step of correlating further includes manually rotating a view and selecting the individual fault patches to be assigned to a fault.
24. The method according to claim 22, wherein a user views the individual fault patches by manually rotating and interactively selecting correlated patches while iterating on an acceptable distance to an object.
25. The method according to claim 22, further comprising reorienting a view direction directly down the dip direction of the individual fault patches, digitizing a trace of the fault along a time slice, and dropping a fault surface in the direction of the view.
26. The method according to claim 1, further comprising correlating the individual fault patches into realistic representations of geologic faults in an automatic approach.
27. The method according to claim 26, further comprising automatically correlating associated adjacent individual fault patches that fit a geometric criteria of co-planarity based on the selected parameters of minimum distance and angles between the patches.
28. The method according to claim 26, further comprising a pre-processing step using a fast scan of all individual fault patches to determine whether or not two individual fault patches are close to each other for further consideration.
29. A method for extracting geologic faults from a 3-D seismic attribute cube, the method comprising:
calculating a minimum path value for each voxel of the 3-D seismic attribute cube;
extracting a fault network skeleton from the 3-D seismic attribute cube by utilizing the minimum path values which correspond to voxels within the 3-D seismic attribute cube;
flood filling the fault network to identify a plurality of fault segments, labeling the fault segments, and creating a vector description of the fault network skeleton;
subdividing the fault network skeleton into individual fault patches; and
correlating the individual fault patches into a representation of geologic faults.
30. A method for extracting faults from a 3-D seismic attribute cube, the method comprising:
reading a composite fault fragment into a 3-D lattice of finite size into a computer memory; and
constructing a best-fit plane from adjacent connected points within the 3-D lattice.
31. A method of correlating individual fault patches into realistic representations of geologic faults comprising:
scanning individual fault patches to determine whether two individual fault patches are close to each other for further evaluation; and
if the individual fault patches are determined to be close, then automatically correlating associated adjacent individual fault patches that fit a geometric criteria of co-planarity based on pre-determined parameters of minimum distance and angles between the patches.
32. The method according to claim 31, wherein the predetermined parameters are selected by visually evaluating the individual fault patches.
33. The method according to claim 31, wherein patches are visually displayed and are iteratively correlated to provide an improved geologic fault representation.
34. A method for extracting faults from a 3-D seismic attribute cube, the method comprising:
calculating a 3-D minimum path value for each voxel of the 3-D seismic attribute cube; and
combining the 3-D minimum path value at each voxel with the 3-D seismic attribute cube to extract a fault network skeleton.
35. A method of subdividing a fault segment comprising
flood filling a fault network to identify a plurality of fault segments, labeling the fault segments, and creating a vector description of the fault segments; and
subdividing the fault segments to create the smallest, non-intersecting, non-bifurcating patches that lie on only one geologic fault.
36. The method according to claim 35, wherein the step of labeling further comprises constructing a best-fit plane from adjacent connected points within a 3-D lattice.
37. The method according to claim 35, wherein the step of subdividing further comprises calculating a normal to a best-fit plane for each voxel on a fault patch fragment in a 3-D lattice.
38. The method according to claim 35, wherein the step of subdividing further comprises constructing a best-fit plane from adjacent connected points within a 3-D lattice, and calculating a normal to a best-fit plane for each voxel on a fault patch fragment in a 3-D lattice.
39. The method according to claim 37, wherein the step of calculating includes comparing the normal best-fit plane between each adjacent voxel that lies on a fault patch, and identifying the normal best-fit planes which are within the user-supplied limit, and merging similarly oriented fault patches.
40. The method according to claim 38, wherein the step of constructing includes comparing the normal best-fit plane between each adjacent voxel that lies on a fault patch fragment, and identifying the normal best-fit planes which are within the user-supplied limit, and merging similarly oriented fault fragments into a fault patch.
41. A method of identifying fault segments from a fault network comprising:
providing a fault network having a plurality of fault segments;
using an adjacency list to merging fault patch fragments which contain voxels in common;
labeling the fault segments; and
creating a vector description of the fault segments.
42. The method according to claim 41, further comprises finding discrete grouping of voxels which were assigned a finding of \u201cfault\u201d, that are mutually connected into fault segments.
43. The method according to claim 41, wherein the step of creating further includes determining an angle of an eigenvector of a variance-covariance matrix associated with a segment, and if the angle is within a pre-determined range, then maintaining the segment as a single patch, and if the angle outside the pre-determined range then subdividing the segment into at least two fault patches.
44. The method according to claim 41, wherein the step of labeling further comprises constructing a best-fit plane from adjacent connected points within a 3-D lattice.
45. A computer-readable medium containing executable code for extracting geologic faults from a 3-D seismic attribute cube, which when executed performs procedures of:
calculating a minimum path value for each voxel of the 3-D seismic attribute cube;
extracting a fault network skeleton from the 3-D seismic attribute cube by utilizing the minimum path values which correspond to voxels within the 3-D seismic attribute cube;
flood filling the fault network to identify a plurality of fault segments, labeling the fault segments, and creating a vector description of the fault network skeleton;
subdividing the fault segments into individual fault patches wherein the individual fault patches are the smallest, non-intersecting, non-bifurcating patches that lie on only one geologic fault; and
correlating the individual fault patches into a representation of geologic faults.
46. The computer-readable medium containing executable code according to claim 45, wherein the step of calculating a minimum path value includes calculating a 3-D minimum path value.
47. The computer-readable medium containing executable code according to claim 45, wherein the step of calculating a minimum path further includes calculating the minimum path value of each voxel considering all routes from a pixel \u201cP\u201d to one of a plurality of termination pixels \u201cT\u201d which is equal to or greater than 4, and summing the values of all voxels along this route.
48. The computer-readable medium containing executable code according to claim 45, wherein the step of calculating a minimum path further includes calculating the minimum path value using a raster order for each of 16 predefined orientations.
49. The computer-readable medium containing executable code according to claim 45, wherein the step of calculating a minimum path further includes calculating the minimum path value using a reverse-raster order for each of 16 predefined orientations.
50. The computer-readable medium containing executable code according to claim 45, further comprising applying a directional filter to the minimum path values to improve the connections between adjacent minimum path values.
51. The computer-readable medium containing executable code according to claim 45, further comprising performing a morphological top hat operation to create a top hat image.
52. The computer-readable medium containing executable code according to claim 51, further comprising a binarization of the top hat image utilizing a simple threshold.
53. The computer-readable medium containing executable code according to claim 52, further comprising extracting a plurality of extremities from the binarization of the top hat image.
54. The computer-readable medium containing executable code according to claim 53, further comprising skeletonizing the binarization of the top hat image, such that the skeleton passes through the extremities and through a highest values of the top hat image.
55. The computer-readable medium containing executable code according to claim 45, further comprising cleaning up the fault network skeleton using a pruning algorithm.
56. The computer-readable medium containing executable code according to claim 45, wherein the voxels which are on the fault skeleton are assigned a finding of \u201cfault.\u201d
57. The computer-readable medium containing executable code according to claim 56, further comprising finding discrete grouping of voxels which were assigned a finding of \u201cfault\u201d, that are mutually connected into fault segments.
58. The computer-readable medium containing executable code according to claim 45, further comprising determining an angle of an eigenvector of a variance-covariance matrix associated with a segment, and if the angle is within a pre-determined range, then maintaining the segment as a single patch, and if the angle outside the pre-determined range then subdividing the segment into at least two fault patches.
59. The computer-readable medium containing executable code according to claim 45, wherein the step of subdividing further comprises utilizing an adjacency list to merge a plurality of fault patches which have voxels in common.
60. The computer-readable medium containing executable code according to claim 45, further comprising determining a vector description of the fault network by determining an angle of an eigenvector of a variance-covariance matrix associated with connected segments, and if an angular difference is within a pre-determined range, then maintaining the segments as a single patch, and if the angular difference is outside the pre-determined range then subdividing the segment into at least two fault patches with their associated eigenvectors.
61. The computer-readable medium containing executable code according to claim 45, further comprising determining a vector description of the fault network by determining an angle of an eigenvector of a variance-covariance matrix associated with connected segments, and if the angular difference is within a pre-determined range, then maintaining the segments as a single patch, and if the angular difference is outside the pre-determined range then labeling the segment into at least two fault patches with their associated eigenvectors.
62. The computer-readable medium containing executable code according to claim 45, wherein the step of subdividing further comprises calculating a normal to a best-fit plane for each voxel on a fault patch fragment in a 3-D lattice.
63. The computer-readable medium containing executable code according to claim 45, wherein the step of subdividing further comprises constructing a best-fit plane from adjacent connected points within a 3-D lattice, and calculating a normal to a best-fit plane for each voxel on a fault patch fragment in a 3-D lattice.
64. The computer-readable medium containing executable code according to claim 62, wherein the step of calculating includes comparing the normal best-fit plane between each adjacent voxel that lies on a fault patch fragment, and identifying the normal best-fit planes which are within the user-supplied limit, and merging similarly oriented fault fragments into a fault patch.
65. The computer-readable medium containing executable code according to claim 63, wherein the step of constructing includes comparing the normal best-fit plane between each adjacent voxel that lies on a fault patch fragment, and identifying the normal best-fit planes which are within the user-supplied limit, and merging similarly oriented fault fragments into a fault patch.
66. The computer-readable medium containing executable code according to claim 45, further comprising correlating the individual fault patches into realistic representations of geologic faults in a manual or semi-manual approach.
67. The computer-readable medium containing executable code according to claim 66, wherein the step of correlating further includes manually rotating a view and selecting the individual fault patches to be assigned to a fault.
68. The computer-readable medium containing executable code according to claim 66, wherein a user views the individual fault patches by manually rotating and interactively selecting correlated patches while iterating on an acceptable distance to an object.
69. The computer-readable medium containing executable code according to claim 66, further comprising reorienting a view direction directly down the dip direction of the individual fault patches, digitizing a trace of the fault along a time slice, and dropping a fault surface in the direction of the view.
70. The computer-readable medium containing executable code according to claim 45, further comprising correlating the individual fault patches into realistic representations of geologic faults in an automatic approach.
71. The computer-readable medium containing executable code according to claim 70, further comprising automatically correlating associated adjacent individual fault patches that fit a geometric criteria of co-planarity based on the selected parameters of minimum distance and angles between the patches.
72. The computer-readable medium containing executable code according to claim 70, further comprising a pre-processing step using a fast scan of all individual fault patches to determine whether or not two individual fault patches are close to each other for further consideration.
73. A computer-readable medium containing executable code for extracting geologic faults from a 3-D seismic attribute cube, which when executed performs procedures of:
calculating a minimum path value for each voxel of the 3-D seismic attribute cube;
extracting a fault network skeleton from the 3-D seismic attribute cube by utilizing the minimum path values which correspond to voxels within the 3-D seismic attribute cube;
flood filling the fault network to identify a plurality of fault segments, labeling the fault segments, and creating a vector description of the fault network skeleton;
subdividing the fault network skeleton into individual fault patches; and
correlating the individual fault patches into a representation of geologic faults.
74. A computer-readable medium containing executable code for extracting faults from a 3-D seismic attribute cube, which when executed performs procedures of:
reading a composite fault fragment into a 3-D lattice of finite size into a computer memory; and
constructing a best-fit plane from adjacent connected points within the 3-D lattice.
75. A computer-readable medium containing executable code of correlating individual fault patches into realistic representations of geologic faults which when executed performs procedures of:
scanning individual fault patches to determine whether two individual fault patches are close to each other for further evaluation; and
if the individual fault patches are determined to be close, then automatically correlating associated adjacent individual fault patches that fit a geometric criteria of co-planarity based on pre-determined parameters of minimum distance and angles between the patches.
76. The computer-readable medium containing executable code according to claim 75, wherein the pre-determined parameters are selected by visually evaluating the individual fault patches.
77. The computer-readable medium containing executable code according to claim 75, wherein patches are visually displayed and are iteratively correlated to provide an improved geologic fault representation.
78. A computer-readable medium containing executable code for extracting faults from a 3-D seismic attribute cube, which when executed performs procedures of:
calculating a 3-D minimum path value for each voxel of the 3-D seismic attribute cube; and
combining the 3-D minimum path value at each voxel with the 3-D seismic attribute cube to extract a fault network skeleton.
79. A computer-readable medium containing executable code of subdividing a fault segment which when executed performs procedures of:
flood filling a fault network to identify a plurality of fault segments, labeling the fault segments, and creating a vector description of the fault segments; and
subdividing the fault segments to create the smallest, non-intersecting, non-bifurcating patches that lie on only one geologic fault.
80. The computer-readable medium containing executable code according to claim 79, wherein the step of labeling further comprises constructing a best-fit plane from adjacent connected points within a 3-D lattice.
81. The computer-readable medium containing executable code according to claim 79, wherein the step of subdividing further comprises calculating a normal to a best-fit plane for each voxel on a fault patch fragment in a 3-D lattice.
82. The computer-readable medium containing executable code according to claim 79, wherein the step of subdividing further comprises constructing a best-fit plane from adjacent connected points within a 3-D lattice, and calculating a normal to a best-fit plane for each voxel on a fault patch fragment in a 3-D lattice.
83. The computer-readable medium containing executable code according to claim 81, wherein the step of calculating includes comparing the normal best-fit plane between each adjacent voxel that lies on a fault patch, and identifying the normal best-fit planes which are within the user-supplied limit, and merging similarly oriented fault patches.
84. The computer-readable medium containing executable code according to claim 82, wherein the step of constructing includes comparing the normal best-fit plane between each adjacent voxel that lies on a fault patch fragment, and identifying the normal best-fit planes which are within the user-supplied limit, and merging similarly oriented fault fragments into a fault patch.
85. A computer-readable medium containing executable code of identifying fault segments from a fault network which when executed performs procedures of:
providing a fault network having a plurality of fault segments;
using an adjacency list to merging fault patch fragments which contain voxels in common;
labeling the fault segments; and
creating a vector description of the fault segments.
86. The computer-readable medium containing executable code according to claim 85, further comprises finding discrete grouping of voxels which were assigned a finding of \u201cfault\u201d, that are mutually connected into fault segments.
87. The computer-readable medium containing executable code according to claim 85, wherein the step of creating further includes determining an angle of an eigenvector of a variance-covariance matrix associated with a segment, and if the angle is within a pre-determined range, then maintaining the segment as a single patch, and if the angle outside the pre-determined range then subdividing the segment into at least two fault patches.
88. The computer-readable medium containing executable code according to claim 85, wherein the step of labeling further comprises constructing a best-fit plane from adjacent connected points within a 3-D lattice.

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 heat exchanger, with at least one two-part header box and with a heat exchanger network preferably consisting of flat tubes and of corrugated ribs, the at least one header box consisting of a bottom and of a cover, and the bottom having orifices for the reception of ends of the flat tubes, the bottom being connected to the cover in a fluid tight manner, the header box having at least one longitudinal partition for forming at least two longitudinal ducts, the cover being designed in such a way that the longitudinal partition is formed by two regions of the cover which are oriented essentially in parallel.
2. The heat exchanger as claimed in claim 1, characterized in that the two regions oriented essentially in parallel touch one another.
3. The heat exchanger as claimed in claim 1, characterized in that the two regions oriented essentially in parallel are connected, such as, for example, soldered, to one another.
4. The heat exchanger as claimed in claim 1, characterized in that a longitudinal partition is produced as a bent-round or folded sheet metal wall.
5. The heat exchanger as claimed in claim 1, characterized in that a longitudinal partition is produced as a fold.
6. The heat exchanger as claimed in claim 1, characterized in that the cover has one, two, three or more partitions.
7. The heat exchanger as claimed in claim 1, characterized in that the cover engages over the bottom at the edge.
8. The heat exchanger as claimed in claim 1, characterized in that the bottom engages over the cover at the edge.
9. The heat exchanger as claimed in claim 1, characterized in that the bottom is of concave design and has a curvature which points outward from inside the header box.
10. The heat exchanger as claimed in claim 1, characterized in that the bottom is of convex design and has a curvature which points inward from outside the header box.
11. The heat exchanger as claimed in claim 1, characterized in that the cover or the bottom engages behind the bottom or the cover at at least one edge, advantageously at two edges.
12. The heat exchanger as claimed in claim 1, characterized in that the bottom or the cover is designed with tabs which engage behind the cover or the bottom at the edge.
13. The heat exchanger as claimed in claim 12, characterized in that the tabs are arranged between the flat tubes.
14. The heat exchanger as claimed in claim 1, characterized in that the at least one longitudinal partition has recesses or indentations.
15. The heat exchanger as claimed in claim 14, characterized in that the partition has recesses or indentations into which flat tube ends at least partially engage or project.
16. The heat exchanger as claimed in claim 14, characterized in that the partition has recesses or indentations into which no flat tube ends project.
17. The heat exchanger as claimed in claim 15, characterized in that free regions, such as, for example, gaps, are left between the indentations and the flat tube ends.
18. The heat exchanger as claimed in claim 17, characterized in that the free regions are designed as U-shaped gaps.
19. The heat exchanger as claimed in claim 17, characterized in that the free regions are designed partially as stops for the tubes.
20. The heat exchanger as claimed in claim 1, characterized in that the edges of the cover or bottom have on the inside steps which run in the longitudinal direction and against which the bottom or cover bears.
21. The heat exchanger as claimed in claim 1, characterized in that the cover has further longitudinal partitions for forming further longitudinal ducts.
22. The heat exchanger as claimed in claim 1, characterized in that the further longitudinal partitions or individual longitudinal partitions have no recesses or indentations.
23. The heat exchanger as claimed in claim 1, characterized in that the further longitudinal partitions or individual longitudinal partitions have recesses or indentations which, however, do not serve for the overflow of a fluid.
24. The heat exchanger as claimed in claim 1, characterized in that the flat tubes (26) are arranged in two or more rows.

1. A shuffling device for randomizing playing cards, the device comprising:
components for contacting at least one playing card within the shuffling device to initiate or suspend movement of the at least one playing card;
a processor in informational connection with the shuffling device;
at least one sensor configured and positioned to detect, without reference to playing card movement or position, values of an operational parameter of one or more of the components consisting of at least one of speed of movement of, distance of movement of, time of movement of, power supplied for movement of, force applied to, and torque applied to the one or more components and to provide a signal to the processor representative of one or more values of at least one of speed of movement of, distance of movement of, time of movement of, power supplied for movement of, force applied to and torque applied to the one or more components;
the processor programmed to interpret the signal to recognize a departure in the operational parameter of the one or more components from one of an acceptable value and range of acceptable values.
2. The shuffling device of claim 1, wherein the processor is programmed to interpret a recognized departure in the operational parameter of the one or more components from one of an acceptable value and range of acceptable values as an indication that a defect in operation of the shuffling device has occurred.
3. The shuffling device of claim 1, wherein the processor is programmed to interpret a recognized departure in the operational parameter of the one or more components from one of an acceptable value and range of acceptable values as an indication of a playing card jam within the shuffling device.
4. The shuffling device of claim 3, wherein the processor is programmed to automatically reverse a direction of movement of at least one card in response to the indication of a jam.
5. The shuffling device of claim 1, wherein the one or more components comprise at least one of a shaft, a roller, a pusher, a grip, and an elevator.
6. The shuffling device of claim 2, wherein the one or more components comprise at least one of a shaft, a roller, a pusher, a grip, and an elevator.
7. The shuffling device of claim 3, wherein the one or more components comprise at least one of a shaft, a roller, a pusher, a grip, and an elevator.
8. The shuffling device of claim 2, wherein the shuffling device further comprises a carousel or fan having multiple compartments into which at least one card is randomly placed.
9. The shuffling device of claim 1, wherein the at least one sensor is selected from the group consisting of electronic sensors, electromechanical sensors, magnetic sensors, mechanical sensors and optical sensors
10. The shuffling device of claim 3, wherein the shuffling device further comprises a carousel or fan having multiple compartments into which at least one card is randomly placed from the first group of cards.
11. The shuffling device of claim 2, wherein the shuffling device further comprises a carousel or fan having multiple compartments into which at least two cards are randomly placed, one at a time, from the first group of cards.
12. The shuffling device of claim 3, wherein the shuffling device further comprises a carousel or fan having multiple compartments into which at least two cards are randomly placed, one at a time, from the first group of cards.
13. The shuffling device of claim 2, wherein the shuffling device further comprises an elevator comprising a single card-mixing compartment into which one card at a time is randomly placed from the first group of cards into an increasing collection of cards in the mixing compartment.
14. The shuffling device of claim 3, wherein the shuffling device further comprises an elevator comprising a single card-mixing compartment into which one card at a time is randomly placed from the first group of cards into an increasing collection of cards in the mixing compartment.
15. The shuffling device of claim 2, wherein the shuffling device further comprises a stack of multiple compartments into which at least two cards are randomly placed, one at a time, from the first group of cards.
16. The shuffling device of claim 3, wherein the shuffling device further comprises a stack of multiple compartments into which at least two cards are randomly placed, one at a time, from the first group of cards.
17. The shuffling device of claim 1, wherein the shuffling device is configured to randomly eject playing cards out of a first set of cards, transport the randomly ejected cards to a card-receiving area, and collect the cards on the card-receiving area as a randomized set of cards.
18. The shuffling device of claim 1, wherein the shuffling device is configured to randomly insert cards from a first group of cards into an accumulating randomized set of cards by randomly separating the randomized set of cards into at least two segments and inserting one card at a time into a space between the two segments.
19. A method of detecting deficiencies in the operation of a playing card-shuffling device, the method comprising:
moving one or more components for contacting at least one playing card within the shuffling device to initiate or suspend movement of the at least one playing card;
detecting with at least one sensor, without reference to playing card movement or position, values of an operational parameter of the one or more of the components consisting of at least one of speed of movement of, distance of movement of, time of movement of, power supplied for movement of, force applied to, and torque applied to the one or more components and providing a signal to a processor representative of one or more values of at least one of speed of movement of, distance of movement of, time of movement of, force applied to and torque applied to the one or more components;
the processor interpreting the signal to recognize a departure in the operational parameter of the one or more components from one of an acceptable value and range of acceptable values.
20. The method of claim 19, wherein the processor interprets a recognized departure in the operational parameter of the one or more components from one of an acceptable value and range of acceptable values as an indication of a defect in operation of the shuffling device has occurred.
21. The method of claim 19, wherein the processor interprets a recognized departure in the operational parameter of the one or more components from one of an acceptable value and range of acceptable values as an indication of a playing card jam within the shuffling device.
22. The method of claim 19, wherein moving one or more components comprises moving at least one of a shaft, a roller, a pusher, a grip and an elevator.
23. The method of claim 20, wherein moving one or more components comprises moving at least one of a shaft, a roller, a pusher, a grip and an elevator.
24. The method of claim 21, wherein moving one or more components comprises moving at least one of a shaft, a roller, a pusher, a grip and an elevator.
25. The method of claim 19, further comprising detecting values of the operational parameter with the at least one sensor selected from the group consisting of electronic sensors, electromechanical sensors, magnetic sensors, mechanical sensors and optical sensors.
26. The method of claim 20, further comprising detecting values of the operational parameter with the at least one sensor selected from the group consisting of electronic sensors, electromechanical sensors, magnetic sensors, mechanical sensors and optical sensors.
27. The method of claim 21, further comprising detecting values of the operational parameter with the at least one sensor selected from the group consisting of electronic sensors, electromechanical sensors, magnetic sensors, mechanical sensors and optical sensors.
28. A playing card-shuffling device, comprising:
a card input portion for receiving cards to be shuffled;
a card-shuffling portion for receiving cards from the card input portion and outputting shuffled cards to a card outlet portion with at least one moving part of the shuffling device;
the card outlet portion being adapted for coupling to a first output card receiver when it is desired to remove shuffled cards one at a time from the shuffling device, and the card outlet portion being adapted for coupling to a second output card receiver when it is desired to remove a group of shuffled cards at a time from the shuffling device;
a processor in informational connection with the shuffling device;
at least one sensor configured and positioned to detect, without reference to playing card movement or position, values of an operational parameter of one or more of the components consisting of at least one of speed of movement of, distance of movement of, time of movement of, power supplied for movement of, force applied to, and torque applied to, the one or more components and to provide a signal to the processor representative of one or more values of at least one of speed of movement of, distance of movement of, time of movement of, power supplied for movement of, force applied to and torque applied to the one or more components;
the processor programmed to interpret the signal to recognize a departure in the operational parameter of the one or more components from one of an acceptable value and range of acceptable values.
29. The device of claim 28, wherein the card outlet portion comprises first alignment features for aligning with corresponding second alignment features on the first output card receiver and the second output card receiver.
30. The shuffling device of claim 28, wherein the processor is programmed to interpret a recognized departure in the operational parameter of the one or more components from one of an acceptable value and range of acceptable values as an indication of a defect in operation of the shuffling device has occurred.
31. The shuffling device of claim 28, wherein the processor is programmed to interpret a recognized departure in the operational parameter of the one or more components from one of an acceptable value and range of values as an indication that a playing card jam has occurred within the shuffling device.
32. The shuffling device of claim 28, wherein the one or more components comprise at least one of a shaft, a roller, a pusher, a grip, and an elevator.
33. The shuffling device of claim 30, wherein the one or more components comprise at least one of a shaft, a roller, a pusher, a grip, and an elevator.
34. The shuffling device of claim 31, wherein the one or more components comprise at least one of a shaft, a roller, a pusher, a grip, and an elevator.
35. The shuffling device of claim 28, wherein the shuffler further comprises a carousel or fan having multiple compartments into which at least one card is randomly placed from the first group of cards.
36. The shuffling device of claim 28, wherein the shuffler further comprises a carousel or fan having multiple compartments into which at least two cards are randomly placed, one at a time, from the first group of cards.
37. The shuffling device of claim 30, wherein the at least one sensor is selected from the group consisting of electronic sensors, electromechanical sensors, magnetic sensors, mechanical sensors and optical sensors.
38. The shuffling device of claim 31, wherein the at least one sensor is selected from the group consisting of electronic sensors, electromechanical sensors, magnetic sensors, mechanical sensors and optical sensors.

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 wireless communication system in which a wireless network formed of a plurality of wireless communication apparatuses is constructed with one wireless communication apparatus operating as a control station, wherein each wireless communication apparatus comprises a mode setting section for switching an operation mode of the apparatus between a first operation mode in which the apparatus operates as a control station with priority, a second operation mode in which the apparatus operates as a control station, and a third operation mode in which the apparatus cannot operate as a control station, wherein a wireless communication apparatus in the first operation mode may operate as a control station if it is determined by the network to be most suitable to operate as a control station or if the network determines that no control station exists.
2. The wireless communication system according to claim 1, wherein, when one wireless communication apparatus within the wireless network is switched to the second operation mode in which the apparatus operates as a control station, when a control station already exists in the wireless network, the wireless communication apparatus joins the wireless network as a terminal station.
3. The wireless communication system according to claim 1, wherein, when one wireless communication apparatus within the wireless network is switched to the second operation mode in which the apparatus operates as a control station, when a control station does not exist in the wireless network, a control station is determined by a predetermined control-station selection process.
4. The wireless communication system according to claim 3, wherein, in said control-station selection process, a control station is determined based on the number of other wireless communication apparatuses with which each wireless communication apparatus set to the second operation mode can communicate.
5. A wireless communication system in which a wireless network comprising a plurality of wireless communication apparatuses is constructed with one wireless communication apparatus operating as a control station, wherein each wireless communication apparatus comprises a mode setting section for switching an operation mode of the apparatus between a first operation mode in which the apparatus operates as a control station with priority and a second operation mode in which the apparatus does not operate as a control station, wherein a wireless communication apparatus in the first operation mode may operate as a control station if it is determined by the network to be most suitable to operate as a control station or if the network determines that no control station exists.
6. The wireless communication system according to one of claims 1 and 5, wherein, in response to the switching to the first operation mode in which one wireless communication apparatus within the wireless network operates as a control station with priority, the wireless communication apparatus is activated as a control station.
7. The wireless communication system according to claim 6, wherein, when another wireless communication apparatus that operates as a control station exists in the wireless network, and an operation for changing the control station is performed, a wireless communication apparatus that is newly changed to the first operation mode in which the apparatus operates as a control station with priority is set as a control station.
8. The wireless communication system according to claim 5, wherein, in response to switching to the second operation mode in which one wireless communication apparatus within the wireless network does not operate as a control station, that wireless communication apparatus joins the wireless network as a terminal station.
9. A wireless communication control method in which a wireless network comprising a plurality of wireless communication apparatuses is constructed with one wireless communication apparatus operating as a control station, said wireless communication control method comprising a mode setting step of switching an operation mode of each wireless communication apparatus between a first operation mode in which the apparatus operates as a control station with priority, a second operation mode in which the apparatus operates as a control station, and a third operation mode in which the apparatus cannot operate as a control station, wherein a wireless communication apparatus in the first operation mode may operate as a control station if it is determined by the network to be most suitable to operate as a control station or if the network determines that no control station exists.
10. The wireless communication control method according to claim 9, wherein, when one wireless communication apparatus within the wireless network is switched to the second operation mode in which the apparatus may operate as a control station, if a control station already exists in the wireless network, the wireless communication apparatus is allowed to join the wireless network as a terminal station.
11. The wireless communication control method according to claim 9, wherein, when one wireless communication apparatus within the wireless network is switched to the second operation mode in which the apparatus operates as a control station, when a control station does not exist in the wireless network, a control station is determined by a predetermined control-station selection process.
12. The wireless communication control method according to claim 11, wherein, in said control-station selection process, a control station is determined based on the number of other wireless communication apparatuses with which each wireless communication apparatus set to the second operation mode can communicate.
13. A wireless communication control method in which a wireless network comprising a plurality of wireless communication apparatuses is constructed with one wireless communication apparatus operating as a control station, said wireless communication control method comprising a mode setting step of switching an operation mode of each wireless communication apparatus between a first operation mode in which the apparatus operates as a control station with priority and a second operation mode in which the apparatus cannot operate as a control station, wherein a wireless communication apparatus in the first operation mode may operate as a control station if it is determined by the network to be most suitable to operate as a control station or if the network determines that no control station exists.
14. The wireless communication control method according to one of claims 9 and 13, wherein, in response to switching to the first operation mode in which one wireless communication apparatus within the wireless network operates as a control station with priority, the wireless communication apparatus is activated as a control station.
15. The wireless communication control method according to claim 14, wherein, when another wireless communication apparatus that operates as a control station exists in the wireless network and an operation for changing the control station is performed, the wireless communication apparatus which is newly changed to the first operation mode in which the apparatus operates as a control station with priority is set as a control station.
16. The wireless communication control method according to claim 13, wherein, in response to switching to the second operation mode in which one wireless communication apparatus within the wireless network cannot operate as a control station, that wireless communication apparatus joins the wireless network as a terminal station.
17. A wireless communication apparatus that operates on a wireless network constructed such that one wireless communication apparatus is selected as a control station, said wireless communication apparatus comprising:
a mode setting section for switching an operation mode of the apparatus between a first operation mode in which the apparatus operates as a control station with priority, a second operation mode in which the apparatus operates as a control station, and a third operation mode in which the apparatus cannot operate as a control station, wherein a wireless communication apparatus in the first operation mode may operate as a control station if it is determined by the network to be most suitable to operate as a control station or if the network determines that no control station exists; and
a control section for controlling an operation of said wireless network in accordance with the operation mode set by said mode setting section.
18. The wireless communication apparatus according to claim 17, wherein, in response to the switching by said mode setting section to the third operation mode in which the wireless communication apparatus cannot operate as a control station, that wireless communication apparatus joins the wireless network as a terminal station.
19. The wireless communication apparatus according to claim 17, wherein, when the wireless communication apparatus is switched by said mode setting section to the second operation mode in which the apparatus operates as a control station, when a control station already exists in the wireless network, said control section causes that wireless communication apparatus to join the wireless network as a terminal station.
20. The wireless communication apparatus according to claim 17, wherein, when the wireless communication apparatus is switched by said mode setting section to the second operation mode in which the apparatus operates as a control station, when a control station does not exist in the wireless network, a control station is determined by a predetermined control-station selection process.
21. The wireless communication apparatus according to claim 20, wherein, in said predetermined control-station selection process, communication is performed among wireless communication apparatuses that are set to the second operation mode, and a control section is determined based on the number of other wireless communication apparatuses with which each wireless communication apparatus can communicate.
22. A wireless communication apparatus that operates on a wireless network constructed such that one wireless communication apparatus is selected as a control station, said wireless communication apparatus comprising:
a mode setting section for switching an operation mode of the apparatus between a first operation mode in which the apparatus operates as a control station with priority and a second operation mode in which the apparatus cannot operate as a control station, wherein a wireless communication apparatus in the first operation mode may operate as a control station if it is determined by the network to be most suitable to operate as a control station or if the network determines that no control station exists; and
a control section for controlling an operation of said wireless network in accordance with the operation mode set by said mode setting section.
23. The wireless communication apparatus according to one of claims 17 and 22, wherein, in response to switching by said mode setting section to the first operation mode in which the wireless communication apparatus operates as a control station with priority, the corresponding wireless communication apparatus is made to operate as a control station with priority.
24. The wireless communication apparatus according to claim 23, wherein, when another wireless communication apparatus that operates as a control station exists in the wireless network, said control section performs communication with the other wireless communication apparatus and performs a control-station changing operation, causing that wireless communication apparatus to operate as a control station.
25. A method of controlling a wireless communication apparatus that operates on a wireless network constructed such that one wireless communication apparatus is selected as a control station, said wireless communication apparatus control method comprising:
a mode setting step of switching an operation mode of the apparatus between a first operation mode in which the apparatus operates as a control station with priority, a second operation mode in which the apparatus operates as a control station, and a third operation mode in which the apparatus cannot operate as a control station, wherein a wireless communication apparatus in the first operation mode may operate as a control station if it is determined by the network to be most suitable to operate as a control station or if the network determines that no control station exists; and
a control step of controlling an operation of said wireless network in accordance with the operation mode set in said mode setting step.
26. The method of controlling a wireless communication apparatus according to claim 25, wherein in said mode setting step, when the wireless communication apparatus is switched in said mode setting step to the second operation mode in which the apparatus operates as a control station, when a control station already exists in the wireless network, the wireless communication apparatus joins the wireless network as a terminal station.
27. The method of controlling a wireless communication apparatus according to claim 25, wherein, in said control step, when the wireless communication apparatus is switched in said mode setting step to the second operation mode in which the apparatus operates as a control station, a control station does not exist in the wireless network, a control station is determined by a predetermined control-station selection process.
28. The method of controlling a wireless communication apparatus according to claim 27, wherein, in said control step, in said control-station selection process, communication is performed among wireless communication apparatuses that are set to the second operation mode, and a control station is determined based on the number of other wireless communication apparatuses with which each wireless communication apparatus can communicate.
29. A method of controlling a wireless communication apparatus that operates on a wireless network constructed such that one wireless communication apparatus is selected as a control station, said wireless communication apparatus control method comprising:
a mode setting step of switching an operation mode of the apparatus between a first operation mode in which the apparatus operates as a control station with priority and a second operation mode in which the apparatus cannot operate as a control station, wherein a wireless communication apparatus in the first operation mode may operate as a control station if it is determined by the network to be most suitable to operate as a control station or if the network determines that no control station exists; and
a control step of controlling an operation of said wireless network in accordance with the operation mode set in said mode setting step.
30. The method of controlling a wireless communication apparatus according to one of claims 25 and 29, wherein, in said control step, in response to the switching in said mode setting step to the first operation mode in which the wireless communication apparatus operates as a control station with priority, the wireless communication apparatus is made to operate as a control station.
31. The method of controlling a wireless communication apparatus according to claim 30, wherein, in said control step, when another wireless communication apparatus that operates as a control station exists in the wireless network, communication is performed with the other wireless communication apparatus, and a control-station changing operation is performed, thereby causing the wireless communication apparatus to operate as a control station.
32. The method of controlling a wireless communication apparatus according to one of claims 29, wherein, in said control step, in response to the switching in said mode setting step to the second operation mode in which the wireless communication apparatus cannot operate as a control station, that wireless communication apparatus joins the wireless network as a terminal station.