Abstract: Provided are a preparation method for a CTL cell and an application thereof. The preparation method comprises the following steps of: inducing a CTL cell by using a tumor antigen PAP-GM-CSF sensitized DC cell; and knocking out a PD-1 gene of the CTL cell to obtain a PD-1 knock-out CTL cell. The CTL cell obtained by the preparation method can be used for preparing drugs for treatment of prostate cancer, especially for treating PAP-positive prostate cancer. The CTL cell does not cause CTL cell failure and anergy due to the tumor-expressed PD-L1 after being transfused into the body, thereby producing efficient specific cytotoxic effect on a tumor cell and improving the curative effect and reducing the side effect.

Abstract: Some embodiments of the present disclosure provide an air conditioner and a control method thereof. The air conditioner includes an outdoor unit, an indoor unit, a temperature sensor, a humidity sensor, and a controller. The temperature sensor is configured to detect a first indoor temperature and a second indoor temperature. The humidity sensor is configured to detect a first indoor humidity and a second indoor humidity. The controller is configured to control the air conditioner to operate in a reheat dehumidification mode if it is determined that a first preset condition is satisfied, control the air conditioner to operate in a cooling mode if it is determined that the first preset condition is not satisfied, and control the air conditioner to enter a shutdown state if it is determined that one of a second preset condition and a third preset condition is satisfied.

Abstract: An air conditioner includes a controlled device, a frequency converter, and a controller. The controller is configured to: determine a present operating frequency of the controlled device, and a present output current and a present input power of the frequency converter; determine a present efficiency of the frequency converter according to the present operating frequency of the controlled device and the present output current of the frequency converter; and determine a present input power of the frequency converter according to the present efficiency of the frequency converter and the present output power of the frequency converter.

Abstract: An example battery-based energy storage device that comprises: a battery chamber configured to host a plurality of rechargeable battery packs; an operation chamber separated from the battery chamber by at least an insulation board; an energy storage inverter mounted on the operation chamber; a battery control box mounted on the operation chamber and configured to control one or more operations of the plurality of rechargeable battery packs; a first door rotatably mounted on the battery chamber; a second door rotatably mounted on the battery chamber. The first door and the second door open outward and are on opposite sides of the battery chamber; and a third door rotatably mounted on the operation chamber. The energy storage inverter is configured to convert AC to DC when charging a rechargeable battery pack and to convert DC to AC when providing power to an external device from a rechargeable battery pack.

Abstract: The present invention discloses a direct-current power transmission protection device, including a resistor unit and a bidirectional circulation current switch unit, and the resistor unit and the bidirectional circulation current switch unit being connected in parallel to form the protection device, where at least one resistor is cascaded to form the resistor unit, and at least one bidirectional circulation current switch is cascaded to form the bidirectional circulation current switch unit. In addition, the present invention also provides a converter including the protection device, and at least one protection device is connected in series in each phase unit.

Abstract: The subject invention provides a data structure and method for IP lookups, insertions, and deletions using a dynamic tree bitmap structure (DTBM) that utilizes an array of child pointers for each node instead of the typical TBM approach using one pointer to an array of children.

Abstract: The subject invention provides a data structure and method for IP lookups, insertions, and deletions using a dynamic tree bitmap structure (DTBM) that utilizes an array of child pointers for each node instead of the typical TBM approach using one pointer to an array of children.

Abstract: A system for classifying data packets transmitted over a data communications network based upon a set of predetermined prefixes associated with destination addresses of the data packets is provided. The includes a data structure stored in an electronic memory. The data structure is a prefix-in-B-tree (PIBT) data structure and/or a range-in-B-tree (RIBT) data structure, the at least one data structure comprising a plurality of nodes based upon the set of predetermined prefixes. The system also includes a determination module for determining a match between one or more of the plurality of nodes and a destination address of a particular data packet.

Abstract: An improved system and method is provided for packet routing in dynamic router tables. Specifically, the invention provides a method, computer system, and computer readable media for using Priority Search Trees (PSTs) to match, insert, and delete rules in dynamic routing tables in O(log n) time. In a first embodiment, for a dynamic router table consisting of n pairs of tuples, each tuple comprising an address prefix and next-hop information, the invention provides a system and method, using a PST, for inserting a new tuple, deleting an existing tuple, and searching for the tuple with the longest matching prefix for destination address, wherein each operation is performed in O(log n) time.

Abstract: An improved system and method is provided for packet routing in dynamic router tables. Specifically, the invention relates to a method and system for using tree data structures to select the highest priority rule that matches a destination address in dynamic Internet packet routing tables. In an embodiment, a data structure called BOB (binary tree on binary tree) for dynamic router tables in which the rule filters are nonintersecting ranges and in which ties are broken by selecting the highest-priority rule that matches a destination address is disclosed. Prefix filters are a special case of nonintersecting ranges and the commonly used longest-prefix tie breaker is a special case of the highest-priority tie breaker. When an n-rule router table is represented using BOB, the highest-priority rule that matches a destination address may be found in O(log2n) time; a new rule maybe inserted and an old one deleted in O(log n) time.

Abstract: Systems and methods for improving the performance of dynamic router table data structures are provided. The invention relates to methods and systems for partitioning prefixes or prefix-based intervals. In one embodiment, priority search tree router data structures are applied to prefix partitions of the present invention. In another embodiment, basic-interval tree and prefix tree data structures are applied to interval partitions of the present invention.

Abstract: A method is provided to improve the performance of dynamic router-table designs. Specifically, the invention relates to a method and system for partitioning prefixes at each node of a partitioning tree into 2s+1 partitions using the next s bits of the prefixes. Prefixes that have a length less than s are placed into partition ?1, with the remaining prefixes falling into the remaining partitions that correspond to the value of their first s bits. Prefix partitioning may be controlled using either static rule tables or by dynamic rule tables. In one embodiment, binary tree on binary tree (BOB) data structures are applied to a partition of the present invention. In another embodiment, prefix binary tree on binary tree (PBOB) data structures are applied to a partition of the present invention. In a further embodiment, a dynamic longest-matching prefix binary tree on binary tree-table (LMPBOB) is applied to a partition of the present invention.

Abstract: A system for classifying data packets transmitted over a data communications network based upon a set of predetermined prefixes associated with destination addresses of the data packets is provided. The includes a data structure stored in an electronic memory. The data structure is a prefix-in-B-tree (PIBT) data structure and/or a range-in-B-tree (RIBT) data structure, the at least one data structure comprising a plurality of nodes based upon the set of predetermined prefixes. The system also includes a determination module for determining a match between one or more of the plurality of nodes and a destination address of a particular data packet.

Abstract: A method is provided to improve the performance of dynamic router-table designs. Specifically, the invention relates to a method and system for partitioning prefixes at each node of a partitioning tree into 2s+1 partitions using the next s bits of the prefixes. Prefixes that have a length less than s are placed into partition −1, with the remaining prefixes falling into the remaining partitions that correspond to the value of their first s bits. Prefix partitioning may be controlled using either static rule tables or by dynamic rule tables. In one embodiment, binary tree on binary tree (BOB) data structures are applied to a partition of the present invention. In another embodiment, prefix binary tree on binary tree (PBOB) data structures are applied to a partition of the present invention. In a further embodiment, a dynamic longest-matching prefix binary tree on binary tree-table (LMPBOB) is applied to a partition of the present invention.

Abstract: Systems and methods for improving the performance of dynamic router table data structures are provided. The invention relates to methods and systems for partitioning prefixes or prefix-based intervals. In one embodiment, priority search tree router data structures are applied to prefix partitions of the present invention. In another embodiment, basic-interval tree and prefix tree data structures are applied to interval partitions of the present invention.

Abstract: An improved system and method is provided for packet routing in dynamic router tables. Specifically, the invention relates to a method and system for using tree data structures to select the highest priority rule that matches a destination address in dynamic Internet packet routing tables. In an embodiment, a data structure called BOB (binary tree on binary tree) for dynamic router tables in which the rule filters are nonintersecting ranges and in which ties are broken by selecting the highest-priority rule that matches a destination address is disclosed. Prefix filters are a special case of nonintersecting ranges and the commonly used longest-prefix tie breaker is a special case of the highest-priority tie breaker. When an n-rule router table is represented using BOB, the highest-priority rule that matches a destination address may be found in O(log2n) time; a new rule maybe inserted and an old one deleted in O(log n) time.