Abstract: A combined fixture for automatic production of a micro coaxial cable harness is provided, including a fixing mold arranged on a workbench, a fixing assembly positioned and arranged on the fixing mold and a positioning and cutting assembly. The fixing assembly includes a first fixing piece and a second fixing piece arranged in up-and-down correspondence, and the first fixing piece is provided with multiple first cable harness grooves arranged side by side for fixing a coaxial cable harness. The positioning and cutting assembly includes two copper sheet welding pads symmetrically arranged on the fixing mold, the two copper sheet welding pads are respectively arranged on two sides of the fixing assembly, and each of the copper sheet welding pads is provided with second cable harness grooves corresponding to the first cable harness grooves.

Abstract: Each node of the binary tree contains an integer key value. When a new node is inserted into the binary tree, if the new node has a key value not equal to the key value of a node in the binary tree, there are necessarily a smaller key value A and a greater key value B, a binary boundary value C is calculated using the key values A and B; the relation between the new node and the node in the binary tree and the route for the new node to be inserted are determined based on the binary boundary value C. If A?0, there must be an odd integer N and an integer power F of 2 for the key values A and B to satisfy (N?1)×F<A?N×F and N×F?B<(N+1)×F, then the binary boundary value C=N×F; and if A=0, then the binary boundary value C is equal to 0.

Abstract: Each node of the binary tree contains an integer key value. When a new node is inserted into the binary tree, if the new node has a key value not equal to the key value of a node in the binary tree, there are necessarily a smaller key value A and a greater key value B, a binary boundary value C is calculated using the key values A and B; the relation between the new node and the node in the binary tree and the route for the new node to be inserted are determined based on the binary boundary value C. If A?0, there must be an odd integer N and an integer power F of 2 for the key values A and B to satisfy (N?1)×F<A?N×F and N×F?B<(N+1)×F, then the binary boundary value C=N×F; and if A=0, then the binary boundary value C is equal to 0.

Abstract: Disclosed are a video conference implementation method and server, and a computer readable storage medium. The method includes: a video conference server receiving from a terminal a virtual conference number of a conference to be convened; detecting whether the virtual conference number and a corresponding conference state are contained in a stored virtual conference draft; if the virtual conference number is contained and the state is “not convened”, sending to a multipoint control unit conference parameters corresponding to the virtual conference number, and receiving a conference state returned by the multipoint control unit.

Abstract: A bitmap-based storage space management system and methods thereof are provided, which realize divisible storage blocks that a small block is distributed when storing a small data object and a large block is distributed when storing a large data object. Through a two layer structure of index bitmaps and state bitmaps, a management of a storage space is realized. The index bitmaps comprise a main resource index bitmap (11), a large block index bitmap (12), a sub-resource index bitmap (13) and a small block index bitmap (14). The state bitmaps comprise a resource state bitmap (21) and a distribution state bitmap (22). Through the resource and distribution state bitmaps, the storage space is described respectively as an unoccupied divisible state, an occupied divisible state and an occupied indivisible state. In an above storage space structure, large block distribution, small block distribution, large block release and small block release are realized.

Abstract: Disclosed are a video conference implementation method and server, and a computer readable storage medium. The method includes: a video conference server receiving from a terminal a virtual conference number of a conference to be convened; detecting whether the virtual conference number and a corresponding conference state are contained in a stored virtual conference draft; if the virtual conference number is contained and the state is “not convened”, sending to a multipoint control unit conference parameters corresponding to the virtual conference number, and receiving a conference state returned by the multipoint control unit.

Abstract: A bitmap-based storage space management system and methods thereof are provided, which realize divisible storage blocks that a small block is distributed when storing a small data object and a large block is distributed when storing a large data object. Technical solutions are described as follows. Through a two layer structure of index bitmaps and state bitmaps, a management of a storage space is realized. The index bitmaps comprise a main resource index bitmap (11), a large block index bitmap (12), a sub-resource index bitmap (13) and a small block index bitmap (14). The state bitmaps comprise a resource state bitmap (21) and a distribution state bitmap (22). Through the resource state bitmap and the distribution state bitmap, the storage space is described as three states, respectively an unoccupied divisible state, an occupied divisible state and an occupied indivisible state.