Abstract: The invention discloses a chip carrier for single sperm or extremely small amount of sperms, comprising a chip carrier, an X indicator axis, a Y indicator axis, and microarrays; the chip carrier is composed of a coating layer, a polymeric material layer and specific antibodies adsorbed on the coating layer; the polymeric material layer is located at the bottom of the chip carrier; the upper surface of the polymeric material layer is attached to the lower surface of the coating layer; the coating layer is provided with several microarrays. Single sperm or extremely small amount of sperms can be stored which realizes the effective storage of single sperm or extremely small amount of sperms, to avoid cross-contamination; in addition, precise access to sperm can be realized, and the maneuverability is very strong, which can solve the requirement of cryopreservation of sperm in patients with very few sperms.

Abstract: The disclosure relates to a traffic scheduling device for scheduling a transmission sequence of data packets, stored in a plurality of traffic flow queues, an eligibility state of each of the traffic flow queues for the scheduling is being maintained in a hierarchical scheduling database describing a relationship among the plurality of traffic flow queues. The traffic scheduling device includes: a plurality of interconnected memory cluster units. Each memory cluster unit is associated to a single or more levels of the hierarchical scheduling database and each memory cluster unit is coupled to at least one co-processors. At least one co-processor is software-programmable to implement a scheduling algorithm. The traffic scheduling device also includes an interface to the plurality of traffic flow queues.

Abstract: The disclosure relates to a traffic scheduling device for scheduling a transmission sequence of data packets, stored in a plurality of traffic flow queues, an eligibility state of each of the traffic flow queues for the scheduling is being maintained in a hierarchical scheduling database describing a relationship among the plurality of traffic flow queues. The traffic scheduling device includes: a plurality of interconnected memory cluster units. Each memory cluster unit is associated to a single or more levels of the hierarchical scheduling database and each memory cluster unit is coupled to at least one co-processors. At least one co-processor is software-programmable to implement a scheduling algorithm. The traffic scheduling device also includes an interface to the plurality of traffic flow queues.

Abstract: The disclosure relates to a traffic scheduling device for scheduling a transmission sequence of data packets, stored in a plurality of traffic flow queues, an eligibility state of each of the traffic flow queues for the scheduling is being maintained in a hierarchical scheduling database describing a relationship among the plurality of traffic flow queues. The traffic scheduling device includes: a plurality of interconnected memory cluster units. Each memory cluster unit is associated to a single or more levels of the hierarchical scheduling database and each memory cluster unit is coupled to at least one co-processors. At least one co-processor is software-programmable to implement a scheduling algorithm. The traffic scheduling device also includes an interface to the plurality of traffic flow queues.

Abstract: A method of accessing base station (BS) by subscriber station (SS) includes: after scanning signals of certain BS, SS starts ranging procedure and sends ranging request to the BS; the BS checks whether the SS belongs to the BS, if not belonging to the BS, then sends terminating ranging response to the SS; the SS interrupts the ranging procedure with the BS after receiving the terminating ranging response, and re-selects a new channel for ranging until accessing a proper BS. The above method overcomes the fault that SS may be not access a network and also may be not exit from other network under the condition of requiring SS to access fixed BS in the prior art, and solves access problem when SS is located in the area overlapping among more than two base stations.

Abstract: A method of accessing base station (BS) by subscriber station (SS) includes: after scanning signals of certain BS, SS starts ranging procedure and sends ranging request to the BS; the BS checks whether the SS belongs to the BS, if not belonging to the BS, then sends terminating ranging response to the SS; the SS interrupts the ranging procedure with the BS after receiving the terminating ranging response, and re-selects a new channel for ranging until accessing a proper BS. The above method overcomes the fault that SS may be not access a network and also may be not exit from other network under the condition of requiring SS to access fixed BS in the prior art, and solves access problem when SS is located in the area overlapping among more than two base stations.