Five-phase Synchronous Reluctance Machines Equipped with a Novel Type of Fractional Slot Winding

Multi-phase machines are so attractive for electrical machine designers because of their valuable advantages such as high reliability and fault tolerant ability.Meanwhile,fractional slot concentrated windings(FSCW)are well known because of short end winding length,simple structure,field weakening sufficiency,fault tolerant capability and higher slot fill factor.The five-phase machines equipped with FSCW,are very good candidates for the purpose of designing motors for high reliable applications,like electric cars,major transporting buses,high speed trains and massive trucks.But,in comparison to the general distributed windings,the FSCWs contain high magnetomotive force(MMF)space harmonic contents,which cause unwanted effects on the machine ability,such as localized iron saturation and core losses.This manuscript introduces several new five-phase fractional slot winding layouts,by the means of slot shifting concept in order to design the new types of synchronous reluctance motors(SynRels).In order to examine the proposed winding’s performances,three sample machines are designed as case studies,and analytical study and finite element analysis(FEA)is used for validation.

Multi-Scale-Matching neural networks for thin plate bending problem

Physics-informed neural networks are a useful machine learning method for solving differential equations,but encounter challenges in effectively learning thin boundary layers within singular perturbation problems.To resolve this issue,multi-scale-matching neural networks are proposed to solve the singular perturbation problems.Inspired by matched asymptotic expansions,the solution is decomposed into inner solutions for small scales and outer solutions for large scales,corresponding to boundary layers and outer regions,respectively.Moreover,to conform neural networks,we introduce exponential stretched variables in the boundary layers to avoid semiinfinite region problems.Numerical results for the thin plate problem validate the proposed method.

Label Recovery and Trajectory Designable Network for Transfer Fault Diagnosis of Machines With Incorrect Annotation

The success of deep transfer learning in fault diagnosis is attributed to the collection of high-quality labeled data from the source domain.However,in engineering scenarios,achieving such high-quality label annotation is difficult and expensive.The incorrect label annotation produces two negative effects:1)the complex decision boundary of diagnosis models lowers the generalization performance on the target domain,and2)the distribution of target domain samples becomes misaligned with the false-labeled samples.To overcome these negative effects,this article proposes a solution called the label recovery and trajectory designable network(LRTDN).LRTDN consists of three parts.First,a residual network with dual classifiers is to learn features from cross-domain samples.Second,an annotation check module is constructed to generate a label anomaly indicator that could modify the abnormal labels of false-labeled samples in the source domain.With the training of relabeled samples,the complexity of diagnosis model is reduced via semi-supervised learning.Third,the adaptation trajectories are designed for sample distributions across domains.This ensures that the target domain samples are only adapted with the pure-labeled samples.The LRTDN is verified by two case studies,in which the diagnosis knowledge of bearings is transferred across different working conditions as well as different yet related machines.The results show that LRTDN offers a high diagnosis accuracy even in the presence of incorrect annotation.

Road Traffic Monitoring from Aerial Images Using Template Matching and Invariant Features

Road traffic monitoring is an imperative topic widely discussed among researchers.Systems used to monitor traffic frequently rely on cameras mounted on bridges or roadsides.However,aerial images provide the flexibility to use mobile platforms to detect the location and motion of the vehicle over a larger area.To this end,different models have shown the ability to recognize and track vehicles.However,these methods are not mature enough to produce accurate results in complex road scenes.Therefore,this paper presents an algorithm that combines state-of-the-art techniques for identifying and tracking vehicles in conjunction with image bursts.The extracted frames were converted to grayscale,followed by the application of a georeferencing algorithm to embed coordinate information into the images.The masking technique eliminated irrelevant data and reduced the computational cost of the overall monitoring system.Next,Sobel edge detection combined with Canny edge detection and Hough line transform has been applied for noise reduction.After preprocessing,the blob detection algorithm helped detect the vehicles.Vehicles of varying sizes have been detected by implementing a dynamic thresholding scheme.Detection was done on the first image of every burst.Then,to track vehicles,the model of each vehicle was made to find its matches in the succeeding images using the template matching algorithm.To further improve the tracking accuracy by incorporating motion information,Scale Invariant Feature Transform(SIFT)features have been used to find the best possible match among multiple matches.An accuracy rate of 87%for detection and 80%accuracy for tracking in the A1 Motorway Netherland dataset has been achieved.For the Vehicle Aerial Imaging from Drone(VAID)dataset,an accuracy rate of 86%for detection and 78%accuracy for tracking has been achieved.

Automatic depth matching method of well log based on deep reinforcement learning

In the traditional well log depth matching tasks,manual adjustments are required,which means significantly labor-intensive for multiple wells,leading to low work efficiency.This paper introduces a multi-agent deep reinforcement learning(MARL)method to automate the depth matching of multi-well logs.This method defines multiple top-down dual sliding windows based on the convolutional neural network(CNN)to extract and capture similar feature sequences on well logs,and it establishes an interaction mechanism between agents and the environment to control the depth matching process.Specifically,the agent selects an action to translate or scale the feature sequence based on the double deep Q-network(DDQN).Through the feedback of the reward signal,it evaluates the effectiveness of each action,aiming to obtain the optimal strategy and improve the accuracy of the matching task.Our experiments show that MARL can automatically perform depth matches for well-logs in multiple wells,and reduce manual intervention.In the application to the oil field,a comparative analysis of dynamic time warping(DTW),deep Q-learning network(DQN),and DDQN methods revealed that the DDQN algorithm,with its dual-network evaluation mechanism,significantly improves performance by identifying and aligning more details in the well log feature sequences,thus achieving higher depth matching accuracy.

A Portfolio Selection Method Based on Pattern Matching with Dual Information of Direction and Distance

Pattern matching method is one of the classic classifications of existing online portfolio selection strategies. This article aims to study the key aspects of this method—measurement of similarity and selection of similarity sets, and proposes a Portfolio Selection Method based on Pattern Matching with Dual Information of Direction and Distance (PMDI). By studying different combination methods of indicators such as Euclidean distance, Chebyshev distance, and correlation coefficient, important information such as direction and distance in stock historical price information is extracted, thereby filtering out the similarity set required for pattern matching based investment portfolio selection algorithms. A large number of experiments conducted on two datasets of real stock markets have shown that PMDI outperforms other algorithms in balancing income and risk. Therefore, it is suitable for the financial environment in the real world.

Feature Matching via Topology-Aware Graph Interaction Model

Feature matching plays a key role in computer vision. However, due to the limitations of the descriptors, the putative matches are inevitably contaminated by massive outliers.This paper attempts to tackle the outlier filtering problem from two aspects. First, a robust and efficient graph interaction model,is proposed, with the assumption that matches are correlated with each other rather than independently distributed. To this end, we construct a graph based on the local relationships of matches and formulate the outlier filtering task as a binary labeling energy minimization problem, where the pairwise term encodes the interaction between matches. We further show that this formulation can be solved globally by graph cut algorithm. Our new formulation always improves the performance of previous localitybased method without noticeable deterioration in processing time,adding a few milliseconds. Second, to construct a better graph structure, a robust and geometrically meaningful topology-aware relationship is developed to capture the topology relationship between matches. The two components in sum lead to topology interaction matching(TIM), an effective and efficient method for outlier filtering. Extensive experiments on several large and diverse datasets for multiple vision tasks including general feature matching, as well as relative pose estimation, homography and fundamental matrix estimation, loop-closure detection, and multi-modal image matching, demonstrate that our TIM is more competitive than current state-of-the-art methods, in terms of generality, efficiency, and effectiveness. The source code is publicly available at http://github.com/YifanLu2000/TIM.

Multiple Matching Attenuation Based on Curvelet Domain Extended Filtering

The paper develops a multiple matching attenuation method based on extended filtering in the curvelet domain,which combines the traditional Wiener filtering method with the matching attenuation method in curvelet domain.Firstly,the method uses the predicted multiple data to generate the Hilbert transform records,time derivative records and time derivative records of Hilbert transform.Then,the above records are transformed into the curvelet domain and multiple matching attenuation based on least squares extended filtering is performed.Finally,the attenuation results are transformed back into the time-space domain.Tests on the model data and field data show that the method proposed in the paper effectively suppress the multiples while preserving the primaries well.Furthermore,it has higher accuracy in eliminating multiple reflections,which is more suitable for the multiple attenuation tasks in the areas with complex structures compared to the time-space domain extended filtering method and the conventional curvelet transform method.

Perfect 1-k Matchings of Bipartite Graphs

Let k be a positive integer and G a bipartite graph with bipartition (X,Y). A perfect 1-k matching is an edge subset M of G such that each vertex in Y is incident with exactly one edge in M and each vertex in X is incident with exactly k edges in M. A perfect 1-k matching is an optimal semi-matching related to the load-balancing problem, where a semi-matching is an edge subset M such that each vertex in Y is incident with exactly one edge in M, and a vertex in X can be incident with an arbitrary number of edges in M. In this paper, we give three sufficient and necessary conditions for the existence of perfect 1-k matchings and for the existence of 1-k matchings covering | X |−dvertices in X, respectively, and characterize k-elementary bipartite graph which is a graph such that the subgraph induced by all k-allowed edges is connected, where an edge is k-allowed if it is contained in a perfect 1-k matching.

A Non-Parametric Scheme for Identifying Data Characteristic Based on Curve Similarity Matching

For accurately identifying the distribution charac-teristic of Gaussian-like noises in unmanned aerial vehicle(UAV)state estimation,this paper proposes a non-parametric scheme based on curve similarity matching.In the framework of the pro-posed scheme,a Parzen window(kernel density estimation,KDE)method on sliding window technology is applied for roughly esti-mating the sample probability density,a precise data probability density function(PDF)model is constructed with the least square method on K-fold cross validation,and the testing result based on evaluation method is obtained based on some data characteristic analyses of curve shape,abruptness and symmetry.Some com-parison simulations with classical methods and UAV flight exper-iment shows that the proposed scheme has higher recognition accuracy than classical methods for some kinds of Gaussian-like data,which provides better reference for the design of Kalman filter(KF)in complex water environment.

Distributed Matching Theory-Based Task Re-Allocating for Heterogeneous Multi-UAV Edge Computing

Many efforts have been devoted to efficient task scheduling in Multi-Unmanned Aerial Vehicle(UAV)edge computing.However,the heterogeneity of UAV computation resource,and the task re-allocating between UAVs have not been fully considered yet.Moreover,most existing works neglect the fact that a task can only be executed on the UAV equipped with its desired service function(SF).In this backdrop,this paper formulates the task scheduling problem as a multi-objective task scheduling problem,which aims at maximizing the task execution success ratio while minimizing the average weighted sum of all tasks’completion time and energy consumption.Optimizing three coupled goals in a realtime manner with the dynamic arrival of tasks hinders us from adopting existing methods,like machine learning-based solutions that require a long training time and tremendous pre-knowledge about the task arrival process,or heuristic-based ones that usually incur a long decision-making time.To tackle this problem in a distributed manner,we establish a matching theory framework,in which three conflicting goals are treated as the preferences of tasks,SFs and UAVs.Then,a Distributed Matching Theory-based Re-allocating(DiMaToRe)algorithm is put forward.We formally proved that a stable matching can be achieved by our proposal.Extensive simulation results show that Di Ma To Re algorithm outperforms benchmark algorithms under diverse parameter settings and has good robustness.

A Time Series Short-Term Prediction Method Based on Multi-Granularity Event Matching and Alignment

Accurate forecasting of time series is crucial across various domains.Many prediction tasks rely on effectively segmenting,matching,and time series data alignment.For instance,regardless of time series with the same granularity,segmenting them into different granularity events can effectively mitigate the impact of varying time scales on prediction accuracy.However,these events of varying granularity frequently intersect with each other,which may possess unequal durations.Even minor differences can result in significant errors when matching time series with future trends.Besides,directly using matched events but unaligned events as state vectors in machine learning-based prediction models can lead to insufficient prediction accuracy.Therefore,this paper proposes a short-term forecasting method for time series based on a multi-granularity event,MGE-SP(multi-granularity event-based short-termprediction).First,amethodological framework for MGE-SP established guides the implementation steps.The framework consists of three key steps,including multi-granularity event matching based on the LTF(latest time first)strategy,multi-granularity event alignment using a piecewise aggregate approximation based on the compression ratio,and a short-term prediction model based on XGBoost.The data from a nationwide online car-hailing service in China ensures the method’s reliability.The average RMSE(root mean square error)and MAE(mean absolute error)of the proposed method are 3.204 and 2.360,lower than the respective values of 4.056 and 3.101 obtained using theARIMA(autoregressive integratedmoving average)method,as well as the values of 4.278 and 2.994 obtained using k-means-SVR(support vector regression)method.The other experiment is conducted on stock data froma public data set.The proposed method achieved an average RMSE and MAE of 0.836 and 0.696,lower than the respective values of 1.019 and 0.844 obtained using the ARIMA method,as well as the values of 1.350 and 1.172 obtained using the k-means-SVR method.

CMMCAN:Lightweight Feature Extraction and Matching Network for Endoscopic Images Based on Adaptive Attention

In minimally invasive surgery,endoscopes or laparoscopes equipped with miniature cameras and tools are used to enter the human body for therapeutic purposes through small incisions or natural cavities.However,in clinical operating environments,endoscopic images often suffer from challenges such as low texture,uneven illumination,and non-rigid structures,which affect feature observation and extraction.This can severely impact surgical navigation or clinical diagnosis due to missing feature points in endoscopic images,leading to treatment and postoperative recovery issues for patients.To address these challenges,this paper introduces,for the first time,a Cross-Channel Multi-Modal Adaptive Spatial Feature Fusion(ASFF)module based on the lightweight architecture of EfficientViT.Additionally,a novel lightweight feature extraction and matching network based on attention mechanism is proposed.This network dynamically adjusts attention weights for cross-modal information from grayscale images and optical flow images through a dual-branch Siamese network.It extracts static and dynamic information features ranging from low-level to high-level,and from local to global,ensuring robust feature extraction across different widths,noise levels,and blur scenarios.Global and local matching are performed through a multi-level cascaded attention mechanism,with cross-channel attention introduced to simultaneously extract low-level and high-level features.Extensive ablation experiments and comparative studies are conducted on the HyperKvasir,EAD,M2caiSeg,CVC-ClinicDB,and UCL synthetic datasets.Experimental results demonstrate that the proposed network improves upon the baseline EfficientViT-B3 model by 75.4%in accuracy(Acc),while also enhancing runtime performance and storage efficiency.When compared with the complex DenseDescriptor feature extraction network,the difference in Acc is less than 7.22%,and IoU calculation results on specific datasets outperform complex dense models.Furthermore,this method increases the F1 score by 33.2%and accelerates runtime by 70.2%.It is noteworthy that the speed of CMMCAN surpasses that of comparative lightweight models,with feature extraction and matching performance comparable to existing complex models but with faster speed and higher cost-effectiveness.

3D electromagnetic simulation of the coupling characteristics and double-stub Ferrite tuners impedance matching for EAST ICRH four-strap antenna

A program developed with COMSOL software integrates EAST four-strap antenna coupling with the double-stub Ferrite tuners(FT)impedance matching,obtaining physical quantities crucial for predicting the overall performance of the ion cyclotron resonance heating(ICRH)antenna and matching system.These quantities encompass S-matrix,port complex impedance,reflection coefficients,electric field and voltage distribution,and optimal matching settings.In this study,we explore the relationship between S-matrix,reflection coefficients,port complex impedance,and frequency.Then,we analyze the impact of Faraday screens placement position and transparency,the distance from the Faraday screen(FS)to the current straps(CS),the relative distance between ports,and the characteristic impedance of the transmission line on the coupling characteristic impedance of the EAST ICRH system.Finally,we simulate the electric field distribution and voltage distribution of the EAST ICRH system for plasma heating with double-stub FT impedance matching.Using optimized parameters,the coupling power of the ICRH system can be approximately doubled.The results present herein may offer guidance for the design of high-power,long-pulse operation ICRH antenna systems.

Artificial Immune Detection for Network Intrusion Data Based on Quantitative Matching Method

Artificial immune detection can be used to detect network intrusions in an adaptive approach and proper matching methods can improve the accuracy of immune detection methods.This paper proposes an artificial immune detection model for network intrusion data based on a quantitative matching method.The proposed model defines the detection process by using network data and decimal values to express features and artificial immune mechanisms are simulated to define immune elements.Then,to improve the accuracy of similarity calculation,a quantitative matching method is proposed.The model uses mathematical methods to train and evolve immune elements,increasing the diversity of immune recognition and allowing for the successful detection of unknown intrusions.The proposed model’s objective is to accurately identify known intrusions and expand the identification of unknown intrusions through signature detection and immune detection,overcoming the disadvantages of traditional methods.The experiment results show that the proposed model can detect intrusions effectively.It has a detection rate of more than 99.6%on average and a false alarm rate of 0.0264%.It outperforms existing immune intrusion detection methods in terms of comprehensive detection performance.

Collective Molecular Machines: Multidimensionality and Reconfigurability

Molecular machines are key to cellular activity where they are involved in converting chemical and light energy into efficient mechanical work.During the last 60 years,designing molecular structures capable of generating unidirectional mechanical motion at the nanoscale has been the topic of intense research.Effective progress has been made,attributed to advances in various fields such as supramolecular chemistry,biology and nanotechnology,and informatics.However,individual molecular machines are only capable of producing nanometer work and generally have only a single functionality.In order to address these problems,collective behaviors realized by integrating several or more of these individual mechanical units in space and time have become a new paradigm.In this review,we comprehensively discuss recent developments in the collective behaviors of molecular machines.In particular,collective behavior is divided into two paradigms.One is the appropriate integration of molecular machines to efficiently amplify molecular motions and deformations to construct novel functional materials.The other is the construction of swarming modes at the supramolecular level to perform nanoscale or microscale operations.We discuss design strategies for both modes and focus on the modulation of features and properties.Subsequently,in order to address existing challenges,the idea of transferring experience gained in the field of micro/nano robotics is presented,offering prospects for future developments in the collective behavior of molecular machines.

Reshaping Li–Mg hybrid batteries:Epitaxial electrodeposition and spatial confinement on MgMOF substrates via the lattice‐matching strategy

The emergence of Li–Mg hybrid batteries has been receiving attention,owing to their enhanced electrochemical kinetics and reduced overpotential.Nevertheless,the persistent challenge of uneven Mg electrodeposition remains a significant impediment to their practical integration.Herein,we developed an ingenious approach that centered around epitaxial electrocrystallization and meticulously controlled growth of magnesium crystals on a specialized MgMOF substrate.The chosen MgMOF substrate demonstrated a robust affinity for magnesium and showed minimal lattice misfit with Mg,establishing the crucial prerequisites for successful heteroepitaxial electrocrystallization.Moreover,the incorporation of periodic electric fields and successive nanochannels within the MgMOF structure created a spatially confined environment that considerably promoted uniform magnesium nucleation at the molecular scale.Taking inspiration from the“blockchain”concept prevalent in the realm of big data,we seamlessly integrated a conductive polypyrrole framework,acting as a connecting“chain,”to interlink the“blocks”comprising the MgMOF cavities.This innovative design significantly amplified charge‐transfer efficiency,thereby increasing overall electrochemical kinetics.The resulting architecture(MgMOF@PPy@CC)served as an exceptional host for heteroepitaxial Mg electrodeposition,showcasing remarkable electrostripping/plating kinetics and excellent cycling performance.Surprisingly,a symmetrical cell incorporating the MgMOF@PPy@CC electrode demonstrated impressive stability even under ultrahigh current density conditions(10mAcm^(–2)),maintaining operation for an extended 1200 h,surpassing previously reported benchmarks.Significantly,on coupling the MgMOF@PPy@CC anode with a Mo_(6)S_(8) cathode,the assembled battery showed an extended lifespan of 10,000 cycles at 70 C,with an outstanding capacity retention of 96.23%.This study provides a fresh perspective on the rational design of epitaxial electrocrystallization driven by metal–organic framework(MOF)substrates,paving the way toward the advancement of cuttingedge batteries.

Resting-state functional magnetic resonance imaging and support vector machines for the diagnosis of major depressive disorder in adolescents

BACKGROUND Research has found that the amygdala plays a significant role in underlying pathology of major depressive disorder(MDD).However,few studies have explored machine learning-assisted diagnostic biomarkers based on amygdala functional connectivity(FC).AIM To investigate the analysis of neuroimaging biomarkers as a streamlined approach for the diagnosis of MDD in adolescents.METHODS Forty-four adolescents diagnosed with MDD and 43 healthy controls were enrolled in the study.Using resting-state functional magnetic resonance imaging,the FC was compared between the adolescents with MDD and the healthy controls,with the bilateral amygdala serving as the seed point,followed by statistical analysis of the results.The support vector machine(SVM)method was then applied to classify functional connections in various brain regions and to evaluate the neurophysiological characteristics associated with MDD.RESULTS Compared to the controls and using the bilateral amygdala as the region of interest,patients with MDD showed significantly lower FC values in the left inferior temporal gyrus,bilateral calcarine,right lingual gyrus,and left superior occipital gyrus.However,there was an increase in the FC value in Vermis-10.The SVM analysis revealed that the reduction in the FC value in the right lingual gyrus could effectively differentiate patients with MDD from healthy controls,achieving a diagnostic accuracy of 83.91%,sensitivity of 79.55%,specificity of 88.37%,and an area under the curve of 67.65%.CONCLUSION The results showed that an abnormal FC value in the right lingual gyrus was effective as a neuroimaging biomarker to distinguish patients with MDD from healthy controls.

Differentially Private Support Vector Machines with Knowledge Aggregation

With the widespread data collection and processing,privacy-preserving machine learning has become increasingly important in addressing privacy risks related to individuals.Support vector machine(SVM)is one of the most elementary learning models of machine learning.Privacy issues surrounding SVM classifier training have attracted increasing attention.In this paper,we investigate Differential Privacy-compliant Federated Machine Learning with Dimensionality Reduction,called FedDPDR-DPML,which greatly improves data utility while providing strong privacy guarantees.Considering in distributed learning scenarios,multiple participants usually hold unbalanced or small amounts of data.Therefore,FedDPDR-DPML enables multiple participants to collaboratively learn a global model based on weighted model averaging and knowledge aggregation and then the server distributes the global model to each participant to improve local data utility.Aiming at high-dimensional data,we adopt differential privacy in both the principal component analysis(PCA)-based dimensionality reduction phase and SVM classifiers training phase,which improves model accuracy while achieving strict differential privacy protection.Besides,we train Differential privacy(DP)-compliant SVM classifiers by adding noise to the objective function itself,thus leading to better data utility.Extensive experiments on three high-dimensional datasets demonstrate that FedDPDR-DPML can achieve high accuracy while ensuring strong privacy protection.

Matching Dyeing and Properties of Silk Fabrics with Natural Edible Pigments

The silk fabrics were matching dyed with three natural edible pigments(red rice red,ginger yellow and gardenia blue).By investigating the dyeing rates and lifting properties of these pigments,it was observed that their compatibilities were excellent in the dyeing process:dye dosage 2.5%(omf),mordant alum dosage 2.0%(omf),dyeing temperature 80℃and dyeing time 40 min.The silk fabrics dyed with secondary colors exhibited vibrant and vivid color owing to the remarkable lightness and chroma of ginger yellow.However,gardenia blue exhibited multiple absorption peaks in the visible light range,resulting in significantly lower lightness and chroma for the silk fabrics dyed with tertiary colors,thus making it suitable only for matte-colored fabrics with low chroma levels.In addition,the silk fabrics dyed with these three pigments had a color fastness that exceeded grade 3 in resistance to perspiration,soap washing and light exposure,indicating acceptable wearing properties.The dyeing process described in this research exhibited a wide range of potential applications in matching dyeing of protein-based textiles with natural colorants.