Investigation multi-target synergistic mechanism of Choerospondias axillaris in the treat of cerebral ischemia based on systems pharmacology and experimental verification

Background:Choerospondias axillaris(CA)is a traditional Mongolian medicine that has been proven to have a good therapeutic effect on cerebrovascular disease.Cerebral Ischemia(CI)is a severe and life-threatening cerebrovascular disease.However,the specific mechanism of action of CA in the treatment of CI is still unclear.Methods:In this study,the related targets and pathways of CA in the treatment of CI were first predicted by system pharmacology and then verified by relevant experiments.Results:The results showed that 12 active ingredients and 208 targets were selected.Further validation through protein-protein interaction(PPI)network analysis and active ingredients-target-pathway(A-T-P)network analysis has confirmed the pivotal roles of the main bioactive constituents,including quercetin,kaempferol,naringin,β-sitosterol,and gallic acid.These components exert their anti-ischemic effects by modulating key targets such as IL6,TNF,MAPK3,and CASP3,thereby regulating the PI3K-Akt,HIF-1,and MAPK signaling pathways,which are integral to processes like inflammation,apoptosis,and oxidative stress.More importantly,through experimental verification,this study confirmed our prediction that CAE significantly reduced neurological function scores,infarct volume,and the percentage of apoptosis neurons.Conclusion:This indicates that CA acts on CI through multi-target synergistic mechanism,and this study provides theoretical basis for the clinical application of CA.

Research on Rotating Machinery Fault Diagnosis Based on Improved Multi-target Domain Adversarial Network

Aiming at the problems of low efficiency,poor anti-noise and robustness of transfer learning model in intelligent fault diagnosis of rotating machinery,a new method of intelligent fault diagnosis of rotating machinery based on single source and multi-target domain adversarial network model(WDMACN)and Gram Angle Product field(GAPF)was proposed.Firstly,the original one-dimensional vibration signal is preprocessed using GAPF to generate the image data including all time series.Secondly,the residual network is used to extract data features,and the features of the target domain without labels are pseudo-labeled,and the transferable features among the feature extractors are shared through the depth parameter,and the feature extractors of the multi-target domain are updated anatomically to generate the features that the discriminator cannot distinguish.The modelt through adversarial domain adaptation,thus achieving fault classification.Finally,a large number of validations were carried out on the bearing data set of Case Western Reserve University(CWRU)and the gear data.The results show that the proposed method can greatly improve the diagnostic efficiency of the model,and has good noise resistance and generalization.

Fecal microbial biomarkers combined with multi-target stool DNA test improve diagnostic accuracy for colorectal cancer

BACKGROUND Colorectal cancer(CRC)is a major global health burden.The current diagnostic tests have shortcomings of being invasive and low accuracy.AIM To explore the combination of intestinal microbiome composition and multi-target stool DNA(MT-sDNA)test in the diagnosis of CRC.METHODS We assessed the performance of the MT-sDNA test based on a hospital clinical trial.The intestinal microbiota was tested using 16S rRNA gene sequencing.This case-control study enrolled 54 CRC patients and 51 healthy controls.We identified biomarkers of bacterial structure,analyzed the relationship between different tumor markers and the relative abundance of related flora components,and distinguished CRC patients from healthy subjects by the linear discriminant analysis effect size,redundancy analysis,and random forest analysis.RESULTS MT-sDNA was associated with Bacteroides.MT-sDNA and carcinoembryonic antigen(CEA)were positively correlated with the existence of Parabacteroides,and alpha-fetoprotein(AFP)was positively associated with Faecalibacterium and Megamonas.In the random forest model,the existence of Streptococcus,Escherichia,Chitinophaga,Parasutterella,Lachnospira,and Romboutsia can distinguish CRC from health controls.The diagnostic accuracy of MT-sDNA combined with the six genera and CEA in the diagnosis of CRC was 97.1%,with a sensitivity and specificity of 98.1%and 92.3%,respectively.CONCLUSION There is a positive correlation of MT-sDNA,CEA,and AFP with intestinal microbiome.Eight biomarkers including six genera of gut microbiota,MT-sDNA,and CEA showed a prominent sensitivity and specificity for CRC prediction,which could be used as a non-invasive method for improving the diagnostic accuracy for this malignancy.

Joint target assignment and power allocation in the netted C-MIMO radar when tracking multi-targets in the presence of self-defense blanket jamming

The netted radar system(NRS)has been proved to possess unique advantages in anti-jamming and improving target tracking performance.Effective resource management can greatly ensure the combat capability of the NRS.In this paper,based on the netted collocated multiple input multiple output(CMIMO)radar,an effective joint target assignment and power allocation(JTAPA)strategy for tracking multi-targets under self-defense blanket jamming is proposed.An architecture based on the distributed fusion is used in the radar network to estimate target state parameters.By deriving the predicted conditional Cramer-Rao lower bound(PC-CRLB)based on the obtained state estimation information,the objective function is formulated.To maximize the worst case tracking accuracy,the proposed JTAPA strategy implements an online target assignment and power allocation of all active nodes,subject to some resource constraints.Since the formulated JTAPA is non-convex,we propose an efficient two-step solution strategy.In terms of the simulation results,the proposed algorithm can effectively improve tracking performance in the worst case.

Multi-Target Tracking of Person Based on Deep Learning

To improve the tracking accuracy of persons in the surveillance video,we proposed an algorithm for multi-target tracking persons based on deep learning.In this paper,we used You Only Look Once v5(YOLOv5)to obtain person targets of each frame in the video and used Simple Online and Realtime Tracking with a Deep Association Metric(DeepSORT)to do cascade matching and Intersection Over Union(IOU)matching of person targets between different frames.To solve the IDSwitch problem caused by the low feature extraction ability of the Re-Identification(ReID)network in the process of cascade matching,we introduced Spatial Relation-aware Global Attention(RGA-S)and Channel Relation-aware Global Attention(RGA-C)attention mechanisms into the network structure.The pre-training weights are loaded for Transfer Learning training on the dataset CUHK03.To enhance the discrimination performance of the network,we proposed a new loss function design method,which introduces the Hard-Negative-Mining way into the benchmark triplet loss.To improve the classification accuracy of the network,we introduced a Label-Smoothing regularization method to the cross-entropy loss.To facilitate the model’s convergence stability and convergence speed at the early training stage and to prevent the model from oscillating around the global optimum due to excessive learning rate at the later stage of training,this paper proposed a learning rate regulation method combining Linear-Warmup and exponential decay.The experimental results on CUHK03 show that the mean Average Precision(mAP)of the improved ReID network is 76.5%.The Top 1 is 42.5%,the Top 5 is 65.4%,and the Top 10 is 74.3%in Cumulative Matching Characteristics(CMC);Compared with the original algorithm,the tracking accuracy of the optimized DeepSORT tracking algorithm is improved by 2.5%,the tracking precision is improved by 3.8%.The number of identity switching is reduced by 25%.The algorithm effectively alleviates the IDSwitch problem,improves the tracking accuracy of persons,and has a high practical value.

MULTI-FIGHTER COORDINATED MULTI-TARGET ATTACK SYSTEM

A definition of self-determined priority is used in airfight decision firstly. A scheme of grouping the whole fighters is introduced, and the principle of target assignment and fire control is designed. Based on the neutral network, the decision algorithm is derived and the whole coordinated decision system is simulated. Secondly an algorithm for missile-attacking area is described and its calculational result is obtained under initial conditions. Then the attacking of missile is realized by the proportion guidance. Finally, a multi-target attack system. The system includes airfight decision, estimation of missile attack area and calculation of missile attack procedure. A digital simulation demonstrates that the airfight decision algorithm is correct. The methods have important reference values for the study of fire control system of the fourth generation fighter.

An Empirical Comparison on Multi-Target Regression Learning

Multi-target regression is concerned with the simultaneous prediction of multiple continuous target variables based on the same set of input variables.It has received relatively small attention from the Machine Learning community.However,multi-target regression exists in many real-world applications.In this paper we conduct extensive experiments to investigate the performance of three representative multi-target regression learning algorithms(i.e.Multi-Target Stacking(MTS),Random Linear Target Combination(RLTC),and Multi-Objective Random Forest(MORF)),comparing the baseline single-target learning.Our experimental results show that all three multi-target regression learning algorithms do improve the performance of the single-target learning.Among them,MTS performs the best,followed by RLTC,followed by MORF.However,the single-target learning sometimes still performs very well,even the best.This analysis sheds the light on multi-target regression learning and indicates that the single-target learning is a competitive baseline for multi-target regression learning on multi-target domains.

FGAs-Based Data Association Algorithm for Multi-sensor Multi-target Tracking

A novel data association algorithm is developed based on fuzzy geneticalgorithms (FGAs). The static part of data association uses one FGA to determine both the lists ofcomposite measurements and the solutions of m-best S-D assignment. In the dynamic part of dataassociation, the results of the m-best S-D assignment are then used in turn, with a Kalman filterstate estimator, in a multi-population FGA-based dynamic 2D assignment algorithm to estimate thestates of the moving targets over time. Such an assignment-based data association algorithm isdemonstrated on a simulated passive sensor track formation and maintenance problem. The simulationresults show its feasibility in multi-sensor multi-target tracking. Moreover, algorithm developmentand real-time problems are briefly discussed.

Dynamic cluster member selection method for multi-target tracking in wireless sensor network

Multi-target tracking(MTT) is a research hotspot of wireless sensor networks at present.A self-organized dynamic cluster task allocation scheme is used to implement collaborative task allocation for MTT in WSN and a special cluster member(CM) node selection method is put forward in the scheme.An energy efficiency model was proposed under consideration of both energy consumption and remaining energy balance in the network.A tracking accuracy model based on area-sum principle was also presented through analyzing the localization accuracy of triangulation.Then,the two models mentioned above were combined to establish dynamic cluster member selection model for MTT where a comprehensive performance index function was designed to guide the CM node selection.This selection was fulfilled using genetic algorithm.Simulation results show that this method keeps both energy efficiency and tracking quality in optimal state,and also indicate the validity of genetic algorithm in implementing CM node selection.

Hybrid hierarchical trajectory planning for a fixed-wing UCAV performing air-to-surface multi-target attack

This paper considers the problem of generating a flight trajectory for a single fixed-wing unmanned combat aerial vehicle （UCAV） performing an air-to-surface multi-target attack （A/SMTA） mission using satellite-guided bombs. First, this problem is formulated as a variant of the traveling salesman problem （TSP）, called the dynamic-constrained TSP with neighborhoods （DCT- SPN）. Then, a hierarchical hybrid approach, which partitions the planning algorithm into a roadmap planning layer and an optimal control layer, is proposed to solve the DCTSPN. In the roadmap planning layer, a novel algorithm based on an updatable proba- bilistic roadmap （PRM） is presented, which operates by randomly sampling a finite set of vehicle states from continuous state space in order to reduce the complicated trajectory planning problem to planning on a finite directed graph. In the optimal control layer, a collision-free state-to-state trajectory planner based on the Gauss pseudospectral method is developed, which can generate both dynamically feasible and optimal flight trajectories. The entire process of solving a DCTSPN consists of two phases. First, in the offline preprocessing phase, the algorithm constructs a PRM, and then converts the original problem into a standard asymmet- ric TSP （ATSP）. Second, in the online querying phase, the costs of directed edges in PRM are updated first, and a fast heuristic searching algorithm is then used to solve the ATSP. Numerical experiments indicate that the algorithm proposed in this paper can generate both feasible and near-optimal solutions quickly for online purposes.

Multi-target tracking algorithm based on PHD filter against multi-range-false-target jamming

Multi-range-false-target(MRFT) jamming is particularly challenging for tracking radar due to the dense clutter and the repeated multiple false targets. The conventional association-based multi-target tracking(MTT) methods suffer from high computational complexity and limited usage in the presence of MRFT jamming.In order to solve the above problems, an efficient and adaptable probability hypothesis density(PHD) filter is proposed. Based on the gating strategy, the obtained measurements are firstly classified into the generalized newborn target and the existing target measurements. The two categories of measurements are independently used in the decomposed form of the PHD filter. Meanwhile,an amplitude feature is used to suppress the dense clutter. In addition, an MRFT jamming suppression algorithm is introduced to the filter. Target amplitude information and phase quantization information are jointly used to deal with MRFT jamming and the clutter by modifying the particle weights of the generalized newborn targets. Simulations demonstrate the proposed algorithm can obtain superior correct discrimination rate of MRFT, and high-accuracy tracking performance with high computational efficiency in the presence of MRFT jamming in the dense clutter.

Multi-target Collaborative Combat Decision-Making by Improved Particle Swarm Optimizer

A decision-making problem of missile-target assignment with a novel particle swarm optimization algorithm is proposed when it comes to a multiple target collaborative combat situation.The threat function is established to describe air combat situation.Optimization function is used to find an optimal missile-target assignment.An improved particle swarm optimization algorithm is utilized to figure out the optimization function with less parameters,which is based on the adaptive random learning approach.According to the coordinated attack tactics,there are some adjustments to the assignment.Simulation example results show that it is an effective algorithm to handle with the decision-making problem of the missile-target assignment(MTA)in air combat.

An Iterative Pose Estimation Algorithm Based on Epipolar Geometry With Application to Multi-Target Tracking

This paper introduces a new algorithm for estimating the relative pose of a moving camera using consecutive frames of a video sequence. State-of-the-art algorithms for calculating the relative pose between two images use matching features to estimate the essential matrix. The essential matrix is then decomposed into the relative rotation and normalized translation between frames. To be robust to noise and feature match outliers, these methods generate a large number of essential matrix hypotheses from randomly selected minimal subsets of feature pairs, and then score these hypotheses on all feature pairs. Alternatively, the algorithm introduced in this paper calculates relative pose hypotheses by directly optimizing the rotation and normalized translation between frames, rather than calculating the essential matrix and then performing the decomposition. The resulting algorithm improves computation time by an order of magnitude. If an inertial measurement unit(IMU) is available, it is used to seed the optimizer, and in addition, we reuse the best hypothesis at each iteration to seed the optimizer thereby reducing the number of relative pose hypotheses that must be generated and scored. These advantages greatly speed up performance and enable the algorithm to run in real-time on low cost embedded hardware. We show application of our algorithm to visual multi-target tracking(MTT) in the presence of parallax and demonstrate its real-time performance on a 640 × 480 video sequence captured on a UAV. Video results are available at https://youtu.be/Hh K-p2 h XNn U.

A new algorithm of bearings-only multi-target tracking of bistatic system

Much research mainly focuses on the batch processing method （e.g. maximum likelihood method） when bearings-only multiple targets tracking of bistatic sonar system is considered. In this paper, the idea of recursive processing method is presented and employed, and corresponding data association algorithms, i.e. a multi-objective ant-colony-based optimization algorithm and an easy fast assignment algorithm are developed to solve the measurements-to-measurements and measurements-to-tracks data association problems of bistatic sonar system, respectively. Monte-Carlo simulations are induced to evaluate the effectiveness of the proposed methods.

METHOD OF MULTI-TARGET TRACKING IN WIDE AREA SURVEILLANCE AIRBORNE RADAR SYSTEM BASING ON CLUSTERING ANALYSIS

This paper proposed a robust method based on the definition of Mahalanobis distance to track ground moving target. The feature and the geometry of airborne ground moving target tracking systems are studied at first. Based on this feature, the assignment relation of time-nearby target is calculated via Mahalanobis distance, and then the corresponding transformation formula is deduced. The simulation results show the correctness and effectiveness of the proposed method.

Sensing Matrix Optimization for Multi-Target Localization Using Compressed Sensing in Wireless Sensor Network

In the multi-target localization based on Compressed Sensing(CS),the sensing matrix's characteristic is significant to the localization accuracy.To improve the CS-based localization approach's performance,we propose a sensing matrix optimization method in this paper,which considers the optimization under the guidance of the t%-averaged mutual coherence.First,we study sensing matrix optimization and model it as a constrained combinatorial optimization problem.Second,the t%-averaged mutual coherence is adopted as the optimality index to evaluate the quality of different sensing matrixes,where the threshold t is derived through the K-means clustering.With the settled optimality index,a hybrid metaheuristic algorithm named Genetic Algorithm-Tabu Local Search(GA-TLS)is proposed to address the combinatorial optimization problem to obtain the final optimized sensing matrix.Extensive simulation results reveal that the CS localization approaches using different recovery algorithms benefit from the proposed sensing matrix optimization method,with much less localization error compared to the traditional sensing matrix optimization methods.

Modified OMP method for multi-target parameter estimation in frequency-agile distributed MIMO radar

Introducing frequency agility into a distributed multipleinput multiple-output(MIMO)radar can significantly enhance its anti-jamming ability.However,it would cause the sidelobe pedestal problem in multi-target parameter estimation.Sparse recovery is an effective way to address this problem,but it cannot be directly utilized for multi-target parameter estimation in frequency-agile distributed MIMO radars due to spatial diversity.In this paper,we propose an algorithm for multi-target parameter estimation according to the signal model of frequency-agile distributed MIMO radars,by modifying the orthogonal matching pursuit(OMP)algorithm.The effectiveness of the proposed method is then verified by simulation results.

A novel maneuvering multi-target tracking algorithm based on multiple model particle filter in clutters

To solve the problem of strong nonlinear and motion model switching of maneuvering target tracking system in clutter environment, a novel maneuvering multi-target tracking algorithm based on multiple model particle filter is presented in this paper. The algorithm realizes dynamic combination of multiple model particle filter and joint probabilistic data association algorithm. The rapid expan- sion of computational complexity, caused by the simple combination of the interacting multiple model algorithm and particle filter is solved by introducing model information into the sampling process of particle state, and the effective validation and utilization of echo is accomplished by the joint proba- bilistic data association algorithm. The concrete steps of the algorithm are given, and the theory analysis and simulation results show the validity of the method.

SMC-PHD based multi-target track-before-detect with nonstandard point observations model

Detection and tracking of multi-target with unknown and varying number is a challenging issue, especially under the condition of low signal-to-noise ratio(SNR). A modified multi-target track-before-detect(TBD) method was proposed to tackle this issue using a nonstandard point observation model. The method was developed from sequential Monte Carlo(SMC)-based probability hypothesis density(PHD) filter, and it was implemented by modifying the original calculation in update weights of the particles and by adopting an adaptive particle sampling strategy. To efficiently execute the SMC-PHD based TBD method, a fast implementation approach was also presented by partitioning the particles into multiple subsets according to their position coordinates in 2D resolution cells of the sensor. Simulation results show the effectiveness of the proposed method for time-varying multi-target tracking using raw observation data.

MULTI-TARGET VISUAL TRACKING AND OCCLUSION DETECTION BY COMBINING BHATTACHARYYA COEFFICIENT AND KALMAN FILTER INNOVATION

This paper introduces an approach for visual tracking of multi-target with occlusion occurrence. Based on the author's previous work in which the Overlap Coefficient (OC) is used to detect the occlusion, in this paper a method of combining Bhattacharyya Coefficient (BC) and Kalman filter innovation term is proposed as the criteria for jointly detecting the occlusion occurrence. Fragmentation of target is introduced in order to closely monitor the occlusion development. In the course of occlusion, the Kalman predictor is applied to determine the location of the occluded target, and the criterion for checking the re-appearance of the occluded target is also presented. The proposed approach is put to test on a standard video sequence, suggesting the satisfactory performance in multi-target tracking.