1460777186-b40d35d7-b1cb-4337-8d27-34f7b3c2c164

1. A slot-in optical disk drive, comprising:
a holding mechanism including a disk slotting opening defined in a front end thereof, two sliding rails at two inner sidewalls on two sides thereof correspondingly, and two slope rails sloped up from ends of the sliding rails correspondingly;
a main body held by the holding mechanism, the main body including a shelf, a disk reading unit and a main spindle motor, the disk reading unit and the main spindle motor disposed on the shelf, and
a sliding module held by the holding mechanism, the sliding module including a sliding base, two clamp sheets and a driving unit for moving the sliding base, each clamp sheet having a pivot end, a free end opposite to the pivot end and a sliding block, the pivot end configured on the sliding base rotatably, the free end facing the disk slotting opening, the sliding block disposed on the free end, the sliding block being movable along the sliding rails and the slope rails;
if the sliding block is at the sliding rail, the free end of the clamp sheet and the sliding base are closed up; and if the sliding block is at the slope rail, the free end of the clamp sheet and the sliding base are opened up.
2. The slot-in optical disk drive as claimed in claim 1, wherein the sliding rails are depressed in the inner sidewalls on the two sides of the holding mechanism correspondingly.
3. The slot-in optical disk drive as claimed in claim 1, wherein the sliding rails are protruded out from the inner sidewalls on the two sides of the holding mechanism correspondingly.
4. The slot-in optical disk drive as claimed in claim 1, wherein the disk reading unit of the main body comprises a reading head, a motor and a transmission gear, and the motor and the transmission gear are used to drive the reading head.
5. The slot-in optical disk drive as claimed in claim 1, wherein the driving unit comprises a motor, a gear set, a belt pulley and a gear rack, the gear rack disposed on the sliding base.
6. The slot-in optical disk drive as claimed in claim 1, wherein the holding mechanism comprises an upper cover and a bottom cover.

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 visualizing data comprising:
identifying a plurality of data objects and a plurality of relationships between respective pairs of the plurality of data objects;
embedding the plurality of data objects in a plane based on the plurality of relationships; and
generating a Voronoi diagram for at least the plurality of data objects within a set of bounding-points.
2. The method of claim 1, wherein the plurality of data objects comprise relational data, each data object corresponds to a vertex and each relationship corresponding to an edge between respective vertices, and embedding the plurality of data objects comprises embedding the plurality of vertices and the plurality of edges as a graph in a plane.
3. The method of claim 1, wherein the set of bounding-points are located at least a first distance away from each of the plurality of data objects.
4. The method of claim 1, further comprising
associating a bounding-box with each of the plurality of data objects;
generating a plurality of points along each bounding-box, each of the plurality of points being associated with the respective data object of each bounding-box, and the Voronoi diagram being generated for the plurality of data objects and the plurality of points along each bounding-box; and
merging each Voronoi cell of the Voronoi diagram associated with a common data object to form a plurality of common cells.
5. The method of claim 4, wherein the size of each bounding-box correlates to an importance of the data object.
6. The method of claim 4, wherein at least one of the plurality of points along each bounding-box is randomly perturbed.
7. The method of claim 1, further comprising performing a cluster analysis to group data objects into at least one cluster.
8. The method of claim 7, further comprising merging the Voronoi cells of the data objects grouped into a respective one of the at least one cluster.
9. The method of claim 7, further comprising coloring each of the at least one clusters such that no two neighboring clusters have a common color.
10. The method of claim 2, wherein at least one of the plurality of edges is weighted, the edge weight corresponding to a distance between an associated pair of objects.
11. A system for visualizing data comprising:
means for identifying a plurality of data objects and a plurality of relationships between respective pairs of the plurality of data objects;
means for embedding the plurality of data objects in a plane based on the plurality of relationships; and
means for generating a Voronoi diagram for at least the plurality of data objects within a set of bounding-points.
12. The system of claim 11, wherein relational data comprises the plurality of data objects and the plurality of relationships, each data object corresponding to a vertex and each relationship corresponding to an edge between respective vertices, and the means for embedding the plurality of data objects comprises means for embedding the plurality of vertices and the plurality of edges as a graph in a plane.
13. The system of claim 11, wherein the set of bounding-points are located at least a first distance away from each of the plurality of data objects.
14. The system of claim 11, further comprising
means for associating a bounding-box with each of the plurality of data objects;
means for generating a plurality of points along each bounding-box, each of the plurality of points being associated with the respective data object of each bounding-box, and the Voronoi diagram being generated for the plurality of data objects and the plurality of points along each bounding-box; and
means for merging each Voronoi cell of the Voronoi diagram associated with a common data object to form a plurality of common cells.
15. The system of claim 14, wherein the size of each bounding-box correlates to an importance of the data object.
16. The system of claim 14, further comprising means for randomly perturbing at least one of the plurality of points along at least one bounding-box.
17. The system of claim 11, further comprising means for performing a cluster analysis to group data objects into at least one cluster.
18. The system of claim 17, further comprising means for merging the Voronoi cells of the data objects grouped into a respective one of the at least one cluster.
19. The system of claim 17, further comprising means for coloring each of the at least one clusters such that no two neighboring clusters have a common color.
20. The system of claim 12, further comprising means for weighting at least one of the plurality of edges, wherein the means for embedding represents the edge weight as a distance between an associated pair of vertices.