53 research outputs found

    Anticancer activity of an extract from needles and twigs of Taxus cuspidata and its synergistic effect as a cocktail with 5-fluorouracil

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Botanical medicines are increasingly combined with chemotherapeutics as anticancer drug cocktails. This study aimed to assess the chemotherapeutic potential of an extract of <it>Taxus cuspidata </it>(<it>TC</it>) needles and twigs produced by artificial cuttage and its co-effects as a cocktail with 5-fluorouracil (5-FU).</p> <p>Methods</p> <p>Components of <it>TC </it>extract were identified by HPLC fingerprinting. Cytotoxicity analysis was performed by MTT assay or ATP assay. Apoptosis studies were analyzed by H & E, PI, TUNEL staining, as well as Annexin V/PI assay. Cell cycle analysis was performed by flow cytometry. 5-FU concentrations in rat plasma were determined by HPLC and the pharmacokinetic parameters were estimated using 3p87 software. Synergistic efficacy was subjected to median effect analysis with the mutually nonexclusive model using Calcusyn1 software. The significance of differences between values was estimated by using a one-way ANOVA.</p> <p>Results</p> <p><it>TC </it>extract reached inhibition rates of 70-90% in different human cancer cell lines (HL-60, BGC-823, KB, Bel-7402, and HeLa) but only 5-7% in normal mouse T/B lymphocytes, demonstrating the broad-spectrum anticancer activity and low toxicity to normal cells of <it>TC </it>extract <it>in vitro</it>. <it>TC </it>extract inhibited cancer cell growth by inducing apoptosis and G<sub>2</sub>/M cell cycle arrest. Most interestingly, <it>TC </it>extract and 5-FU, combined as a cocktail, synergistically inhibited the growth of cancer cells <it>in vitro</it>, with Combination Index values (CI) ranging from 0.90 to 0.26 at different effect levels from IC50 to IC90 in MCF-7 cells, CI ranging from 0.93 to 0.13 for IC40 to IC90 in PC-3M-1E8 cells, and CI < 1 in A549 cells. In addition, the cocktail had lower cytotoxicity in normal human cell (HEL) than 5-FU used alone. Furthermore, <it>TC </it>extract did not affect the pharmacokinetics of 5-FU in rats.</p> <p>Conclusions</p> <p>The combinational use of the <it>TC </it>extract with 5-FU displays strong cytotoxic synergy in cancer cells and low cytotoxicity in normal cells. These findings suggest that this cocktail may have a potential role in cancer treatment.</p

    Research on the application of 5G characteristics in intelligent mine

    No full text
    At present, the 5G construction in intelligent mine mainly focuses on the macro technology development direction, test methods and specific application scenarios of mine 5G. There is a lack of comprehensive analysis of the characteristics of various 5G application scenarios of intelligent mine. In order to solve this problem, the types of 5G application scenarios of intelligent mines are summarized. The communication requirements of the main application scenarios are sorted out. It is pointed out that sensor information backhaul applications have wide coverage requirements. The video information collection and backhaul applications have uplink large bandwidth transmission requirements. The real-time control information interaction applications have downlink low-delay transmission requirements. The automatic driving information collection and backhaul applications need to meet the differentiated transmission requirements of uplink large bandwidth and downlink low delay. According to the environmental characteristics and technical requirements of 5G application in intelligent mines, the overall architecture of mine 5G network with core network + bearer network + access network is proposed. ① The core network makes user plane function (UPF) and multi-access edge computing (MEC) sinking into the mine area to realize independent networking and independent operation of mine 5G. ② The information security module in the smart transport network is used for data security audit monitoring and transmission control to achieve safe isolation of surface and underground data. The network slicing and quality of service (QoS) management module is used to divide and isolate channels for different services, as to realize channel isolation for the coexistence of multiple services and transmission performance guarantee. ③ The access network adopts the mode of base station controller + base station collector + base station + terminal to realize 5G signal partition and on-demand coverage. According to the above architecture, the key technical scheme of 5G for diversified application requirements of intelligent mine is proposed. ① The network slicing technology is used to divide the mine 5G network into sensor slices, video return slices, real-time control slices and remote control slices. Combined with QoS indexes of transmission services, the service data is mapped to different slice resources for transmission,so as to realize the on-demand distribution of 5G network transmission. ② The flexible air interface scheduling mechanism is used to meet the on-demand scheduling of wireless resources. The air interface resource scheduling mode of 'resource request-service buffer report resource allocation-service buffer-data transmission resource allocation' is adopted for large-bandwidth services. The mode is used to ensure the uplink transmission bandwidth. The reserved dedicated air interface resources are adopted for low-delay services to ensure the low delay of downlink transmission. ③ When a single frequency band cannot meet the uplink transmission requirement, multiple continuous or discontinuous carriers are aggregated into a larger bandwidth through carrier aggregation technology, effectively supporting the large bandwidth transmission requirement of mine 5G

    A Moving Target Online Location Algorithm Based on Factor Graph

    No full text
    The superior performance of factor graphs compared to Kalman filtering in various fields and the use of factor graph algorithms instead of Kalman filtering algorithms in moving target localization tasks can reduce target localization error by more than 50%. However, the global factor graph algorithm may cause computational delays due to excessive computational effort. A moving target localization algorithm based on a combination of global and incremental optimization with improved factor graphs is proposed to improve localization accuracy and ensure that the computation time can be adapted to the requirements of online location. A reference point is introduced into the incremental calculation process, and it is first determined whether global or incremental calculation is used for this calculation by comparing the distance between the incremental localization results of the calculated reference point. The position of the UAV itself is then corrected by determining the position of the reference point, and this is used to finally locate the target. Simulation results show that the algorithm has good real-time performance compared to the time-consuming global algorithm. The online localization error of moving targets can be reduced by 17% compared to the incremental calculation results of the classical factor graph algorithm

    A Moving Target Online Location Algorithm Based on Factor Graph

    No full text
    The superior performance of factor graphs compared to Kalman filtering in various fields and the use of factor graph algorithms instead of Kalman filtering algorithms in moving target localization tasks can reduce target localization error by more than 50%. However, the global factor graph algorithm may cause computational delays due to excessive computational effort. A moving target localization algorithm based on a combination of global and incremental optimization with improved factor graphs is proposed to improve localization accuracy and ensure that the computation time can be adapted to the requirements of online location. A reference point is introduced into the incremental calculation process, and it is first determined whether global or incremental calculation is used for this calculation by comparing the distance between the incremental localization results of the calculated reference point. The position of the UAV itself is then corrected by determining the position of the reference point, and this is used to finally locate the target. Simulation results show that the algorithm has good real-time performance compared to the time-consuming global algorithm. The online localization error of moving targets can be reduced by 17% compared to the incremental calculation results of the classical factor graph algorithm.</jats:p

    Sedum alfredii H: A new Zn hyperaccumulating plant first found in China

    Full text link

    An AOA Optimal Positioning Method Incorporating Station Error and Sensor Deployment

    No full text
    In order to improve the computational accuracy of the AOA (angle of arrival) location, an AOA location method based on CTLS (constrained total least squares) and incorporating the effect of station errors is investigated. Its approximate closed-form solution is derived by first calculating the least squares solution, then substituting the least squares solution into the approximate closed-form solution and iterating to calculate the final result. Subsequently, since the result of the Fisher information matrix is minimized when the stations are uniformly distributed, the final accuracy of the AOA target location is improved by finding the optimal relative position deployment strategy for the sensor-carrying station in 3D space, under the assumption that the sensor carriers are uniformly distributed. Simulations show that, in the presence of station errors, the accuracy of AOA location is improved by approximately 10% using this paper’s calculation method, compared to the common least squares location method. In the process of target location, the Fisher information matrix is used to calculate the lower bound of the location result for the CRLB (Cramer–Rao lower bound), which is optimal when the azimuth is uniformly distributed and all on the same horizontal plane, if its pitch angle is 35.56°

    Clean Heating Scheduling Optimization with Wind Power in Northern China

    Full text link

    Sentiment Lossless Summarization

    Full text link

    A Practical Interlacing-Based Coverage Path Planning Method for Fixed-Wing UAV Photogrammetry in Convex Polygon Regions

    No full text
    This paper investigates the coverage path planning problem for a fixed-wing UAV in convex polygon regions with several practical task requirements in photogrammetry considered. A typical camera model pointing forward-down for photogrammetric application is developed. In addition, the coordinates of the region vertices are converted from the WGS-84 coordinate system to the local ENU coordinate system for path planning convenience. The relationship between the minimum turning radius and the camera footprint is fully studied and the span coefficient of the fixed-wing UAV is first proposed. A novel flight pattern, named as the interlaced back-and-forth pattern in this paper, is presented accordingly. The proposed algorithm is compared with a traditional back-and-forth pattern in mathematics and several important results are given. Then, a practical low-computation algorithm for waypoints generation is developed. Finally, simulation results validate the effectiveness of the proposed method
    corecore