BIG HANKEL OPERATORS ON HARDY SPACES OF STRONGLY PSEUDOCONVEX DOMAINS

In this article,we investigate the(big) Hankel operator H_(f) on the Hardy spaces of bounded strongly pseudoconvex domains Ω in C^(n).We observe that H_(f ) is bounded on H~p(Ω)(1 <p <∞) if f belongs to BMO and we obtain some characterizations for Hf on H^(2)(Ω) of other pseudoconvex domains.In these arguments,Amar's L^(p)-estimations and Berndtsson's L^(2)-estimations for solutions of the ■_(b)-equation play a crucial role.In addition,we solve Gleason's problem for Hardy spaces H^(p)(Ω)(1 ≤p≤∞) of bounded strongly pseudoconvex domains.

Estimation-free spatial-domain image reconstruction of structured illumination microscopy

Structured illumination microscopy(SIM)achieves super-resolution(SR)by modulating the high-frequency information of the sample into the passband of the optical system and subsequent image reconstruction.The traditional Wiener-filtering-based reconstruction algorithm operates in the Fourier domain,it requires prior knowledge of the sinusoidal illumination patterns which makes the time-consuming procedure of parameter estimation to raw datasets necessary,besides,the parameter estimation is sensitive to noise or aberration-induced pattern distortion which leads to reconstruction artifacts.Here,we propose a spatial-domain image reconstruction method that does not require parameter estimation but calculates patterns from raw datasets,and a reconstructed image can be obtained just by calculating the spatial covariance of differential calculated patterns and differential filtered datasets(the notch filtering operation is performed to the raw datasets for attenuating and compensating the optical transfer function(OTF)).Experiments on reconstructing raw datasets including nonbiological,biological,and simulated samples demonstrate that our method has SR capability,high reconstruction speed,and high robustness to aberration and noise.

CONVEXITY OF THE FREE BOUNDARY FOR AN AXISYMMETRIC INCOMPRESSIBLE IMPINGING JET

This paper is devoted to the study of the shape of the free boundary for a threedimensional axisymmetric incompressible impinging jet.To be more precise,we will show that the free boundary is convex to the fluid,provided that the uneven ground is concave to the fluid.

On the Application of Mixed Models of Probability and Convex Set for Time-Variant Reliability Analysis

In time-variant reliability problems,there are a lot of uncertain variables from different sources.Therefore,it is important to consider these uncertainties in engineering.In addition,time-variant reliability problems typically involve a complexmultilevel nested optimization problem,which can result in an enormous amount of computation.To this end,this paper studies the time-variant reliability evaluation of structures with stochastic and bounded uncertainties using a mixed probability and convex set model.In this method,the stochastic process of a limit-state function with mixed uncertain parameters is first discretized and then converted into a timeindependent reliability problem.Further,to solve the double nested optimization problem in hybrid reliability calculation,an efficient iterative scheme is designed in standard uncertainty space to determine the most probable point(MPP).The limit state function is linearized at these points,and an innovative random variable is defined to solve the equivalent static reliability analysis model.The effectiveness of the proposed method is verified by two benchmark numerical examples and a practical engineering problem.

Consistency between domain wall oscillation modes and spin wave modes in nanostrips

Investigations on domain wall(DW) and spin wave(SW) modes in a series of nanostrips with different widths and thicknesses have been carried out using micromagnetic simulation. The simulation results show that the frequencies of SW modes and the corresponding DW modes are consistent with each other if they have the same node number along the width direction. This consistency is more pronounced in wide and thin nanostrips, favoring the DW motion driven by SWs.Further analysis of the moving behavior of a DW driven by SWs is also carried out. The average DW speed can reach a larger value of ~ 140 m/s under two different SW sources. We argue that this study is very meaningful for the potential application of DW motion driven by SWs.

Low-Rank Optimal Transport for Robust Domain Adaptation

When encountering the distribution shift between the source(training) and target(test) domains, domain adaptation attempts to adjust the classifiers to be capable of dealing with different domains. Previous domain adaptation research has achieved a lot of success both in theory and practice under the assumption that all the examples in the source domain are welllabeled and of high quality. However, the methods consistently lose robustness in noisy settings where data from the source domain have corrupted labels or features which is common in reality. Therefore, robust domain adaptation has been introduced to deal with such problems. In this paper, we attempt to solve two interrelated problems with robust domain adaptation:distribution shift across domains and sample noises of the source domain. To disentangle these challenges, an optimal transport approach with low-rank constraints is applied to guide the domain adaptation model training process to avoid noisy information influence. For the domain shift problem, the optimal transport mechanism can learn the joint data representations between the source and target domains using a measurement of discrepancy and preserve the discriminative information. The rank constraint on the transport matrix can help recover the corrupted subspace structures and eliminate the noise to some extent when dealing with corrupted source data. The solution to this relaxed and regularized optimal transport framework is a convex optimization problem that can be solved using the Augmented Lagrange Multiplier method, whose convergence can be mathematically proved. The effectiveness of the proposed method is evaluated through extensive experiments on both synthetic and real-world datasets.

Complementary-Label Adversarial Domain Adaptation Fault Diagnosis Network under Time-Varying Rotational Speed and Weakly-Supervised Conditions

Recent research in cross-domain intelligence fault diagnosis of machinery still has some problems,such as relatively ideal speed conditions and sample conditions.In engineering practice,the rotational speed of the machine is often transient and time-varying,which makes the sample annotation increasingly expensive.Meanwhile,the number of samples collected from different health states is often unbalanced.To deal with the above challenges,a complementary-label(CL)adversarial domain adaptation fault diagnosis network(CLADAN)is proposed under time-varying rotational speed and weakly-supervised conditions.In the weakly supervised learning condition,machine prior information is used for sample annotation via cost-friendly complementary label learning.A diagnosticmodel learning strategywith discretized category probabilities is designed to avoidmulti-peak distribution of prediction results.In adversarial training process,we developed virtual adversarial regularization(VAR)strategy,which further enhances the robustness of the model by adding adversarial perturbations in the target domain.Comparative experiments on two case studies validated the superior performance of the proposed method.

Diabetic retinopathy identification based on multi-sourcefree domain adaptation

AIM:To address the challenges of data labeling difficulties,data privacy,and necessary large amount of labeled data for deep learning methods in diabetic retinopathy(DR)identification,the aim of this study is to develop a source-free domain adaptation(SFDA)method for efficient and effective DR identification from unlabeled data.METHODS:A multi-SFDA method was proposed for DR identification.This method integrates multiple source models,which are trained from the same source domain,to generate synthetic pseudo labels for the unlabeled target domain.Besides,a softmax-consistence minimization term is utilized to minimize the intra-class distances between the source and target domains and maximize the inter-class distances.Validation is performed using three color fundus photograph datasets(APTOS2019,DDR,and EyePACS).RESULTS:The proposed model was evaluated and provided promising results with respectively 0.8917 and 0.9795 F1-scores on referable and normal/abnormal DR identification tasks.It demonstrated effective DR identification through minimizing intra-class distances and maximizing inter-class distances between source and target domains.CONCLUSION:The multi-SFDA method provides an effective approach to overcome the challenges in DR identification.The method not only addresses difficulties in data labeling and privacy issues,but also reduces the need for large amounts of labeled data required by deep learning methods,making it a practical tool for early detection and preservation of vision in diabetic patients.

Distributed Stochastic Optimization with Compression for Non-Strongly Convex Objectives

We are investigating the distributed optimization problem,where a network of nodes works together to minimize a global objective that is a finite sum of their stored local functions.Since nodes exchange optimization parameters through the wireless network,large-scale training models can create communication bottlenecks,resulting in slower training times.To address this issue,CHOCO-SGD was proposed,which allows compressing information with arbitrary precision without reducing the convergence rate for strongly convex objective functions.Nevertheless,most convex functions are not strongly convex(such as logistic regression or Lasso),which raises the question of whether this algorithm can be applied to non-strongly convex functions.In this paper,we provide the first theoretical analysis of the convergence rate of CHOCO-SGD on non-strongly convex objectives.We derive a sufficient condition,which limits the fidelity of compression,to guarantee convergence.Moreover,our analysis demonstrates that within the fidelity threshold,this algorithm can significantly reduce transmission burden while maintaining the same convergence rate order as its no-compression equivalent.Numerical experiments further validate the theoretical findings by demonstrating that CHOCO-SGD improves communication efficiency and keeps the same convergence rate order simultaneously.And experiments also show that the algorithm fails to converge with low compression fidelity and in time-varying topologies.Overall,our study offers valuable insights into the potential applicability of CHOCO-SGD for non-strongly convex objectives.Additionally,we provide practical guidelines for researchers seeking to utilize this algorithm in real-world scenarios.

ON THE SOBOLEV DOLBEAULT COHOMOLOGY OF A DOMAIN WITH PSEUDOCONCAVE BOUNDARIES

In this note,we mainly make use of a method devised by Shaw[15]for studying Sobolev Dolbeault cohomologies of a pseudoconcave domain of the type Ω=Ω\∪_(j=1^(m))Ω_(j),where Ω and {Ω_(j)}_(j=1^(m)■Ω are bounded pseudoconvex domains in ℂ^(n) with smooth boundaries,and Ω_(1),…,Ω_(m) are mutually disjoint.The main results can also be quickly obtained by virtue of[5].

Relaxed Stability Criteria for Time-Delay Systems:A Novel Quadratic Function Convex Approximation Approach

This paper develops a quadratic function convex approximation approach to deal with the negative definite problem of the quadratic function induced by stability analysis of linear systems with time-varying delays.By introducing two adjustable parameters and two free variables,a novel convex function greater than or equal to the quadratic function is constructed,regardless of the sign of the coefficient in the quadratic term.The developed lemma can also be degenerated into the existing quadratic function negative-determination(QFND)lemma and relaxed QFND lemma respectively,by setting two adjustable parameters and two free variables as some particular values.Moreover,for a linear system with time-varying delays,a relaxed stability criterion is established via our developed lemma,together with the quivalent reciprocal combination technique and the Bessel-Legendre inequality.As a result,the conservatism can be reduced via the proposed approach in the context of constructing Lyapunov-Krasovskii functionals for the stability analysis of linear time-varying delay systems.Finally,the superiority of our results is illustrated through three numerical examples.

MINIMIZERS OF L^(2)-SUBCRITICAL VARIATIONAL PROBLEMS WITH SPATIALLY DECAYING NONLINEARITIES IN BOUNDED DOMAINS

This paper is concerned with the minimizers of L^(2)-subcritical constraint variar tional problems with spatially decaying nonlinearities in a bounded domain Ω of R~N(N≥1).We prove that the problem admits minimizers for any M> 0.Moreover,the limiting behavior of minimizers as M→∞ is also analyzed rigorously.

A Time-Domain Numerical Simulation for Free Motion Responses of Two Ships Advancing in Head Waves

The constant panel method within the framework of potential flow theory in the time domain is developed for solving the hydrodynamic interactions between two parallel ships with forward speed.When solving problems within a time domain framework,the free water surface needs to simultaneously satisfy both the kinematic and dynamic boundary conditions of the free water surface.This provides conditions for adding artificial damping layers.Using the Runge−Kutta method to solve equations related to time.An upwind differential scheme is used in the present method to deal with the convection terms on the free surface to prevent waves upstream.Through the comparison with the available experimental data and other numerical methods,the present method is proved to have good mesh convergence,and satisfactory results can be obtained.The constant panel method is applied to calculate the hydrodynamic interaction responses of two parallel ships advancing in head waves.Numerical simulations are conducted on the effects of forward speed,different longitudinal and lateral distances on the motion response of two modified Wigley ships in head waves.Then further investigations are conducted on the effects of different ship types on the motion response.

Bearing Fault Diagnosis Based on Deep Discriminative Adversarial Domain Adaptation Neural Networks

Intelligent diagnosis driven by big data for mechanical fault is an important means to ensure the safe operation ofequipment. In these methods, deep learning-based machinery fault diagnosis approaches have received increasingattention and achieved some results. It might lead to insufficient performance for using transfer learning alone andcause misclassification of target samples for domain bias when building deep models to learn domain-invariantfeatures. To address the above problems, a deep discriminative adversarial domain adaptation neural networkfor the bearing fault diagnosis model is proposed (DDADAN). In this method, the raw vibration data are firstlyconverted into frequency domain data by Fast Fourier Transform, and an improved deep convolutional neuralnetwork with wide first-layer kernels is used as a feature extractor to extract deep fault features. Then, domaininvariant features are learned from the fault data with correlation alignment-based domain adversarial training.Furthermore, to enhance the discriminative property of features, discriminative feature learning is embeddedinto this network to make the features compact, as well as separable between classes within the class. Finally, theperformance and anti-noise capability of the proposedmethod are evaluated using two sets of bearing fault datasets.The results demonstrate that the proposed method is capable of handling domain offset caused by differentworkingconditions and maintaining more than 97.53% accuracy on various transfer tasks. Furthermore, the proposedmethod can achieve high diagnostic accuracy under varying noise levels.

Enhancing Relational Triple Extraction in Specific Domains:Semantic Enhancement and Synergy of Large Language Models and Small Pre-Trained Language Models

In the process of constructing domain-specific knowledge graphs,the task of relational triple extraction plays a critical role in transforming unstructured text into structured information.Existing relational triple extraction models facemultiple challenges when processing domain-specific data,including insufficient utilization of semantic interaction information between entities and relations,difficulties in handling challenging samples,and the scarcity of domain-specific datasets.To address these issues,our study introduces three innovative components:Relation semantic enhancement,data augmentation,and a voting strategy,all designed to significantly improve the model’s performance in tackling domain-specific relational triple extraction tasks.We first propose an innovative attention interaction module.This method significantly enhances the semantic interaction capabilities between entities and relations by integrating semantic information fromrelation labels.Second,we propose a voting strategy that effectively combines the strengths of large languagemodels(LLMs)and fine-tuned small pre-trained language models(SLMs)to reevaluate challenging samples,thereby improving the model’s adaptability in specific domains.Additionally,we explore the use of LLMs for data augmentation,aiming to generate domain-specific datasets to alleviate the scarcity of domain data.Experiments conducted on three domain-specific datasets demonstrate that our model outperforms existing comparative models in several aspects,with F1 scores exceeding the State of the Art models by 2%,1.6%,and 0.6%,respectively,validating the effectiveness and generalizability of our approach.

Rapid health estimation of in-service battery packs based on limited labels and domain adaptation

For large-scale in-service electric vehicles(EVs)that undergo potential maintenance,second-hand transactions,and retirement,it is crucial to rapidly evaluate the health status of their battery packs.However,existing methods often rely on lengthy battery charging/discharging data or extensive training samples,which hinders their implementation in practical scenarios.To address this issue,a rapid health estimation method based on short-time charging data and limited labels for in-service battery packs is proposed in this paper.First,a digital twin of battery pack is established to emulate its dynamic behavior across various aging levels and inconsistency degrees.Then,increment capacity sequences(△Q)within a short voltage span are extracted from charging process to indicate battery health.Furthermore,data-driven models based on deep convolutional neural network(DCNN)are constructed to estimate battery state of health(SOH),where the synthetic data is employed to pre-train the models,and transfer learning strategies by using fine-tuning and domain adaptation are utilized to enhance the model adaptability.Finally,field data of 10 EVs exhibiting different SOHs are used to verify the proposed methods.By using the△Q with 100 m V voltage change,the SOH of battery packs can be accurately estimated with an error around 3.2%.

Accelerated Primal-Dual Projection Neurodynamic Approach With Time Scaling for Linear and Set Constrained Convex Optimization Problems

The Nesterov accelerated dynamical approach serves as an essential tool for addressing convex optimization problems with accelerated convergence rates.Most previous studies in this field have primarily concentrated on unconstrained smooth con-vex optimization problems.In this paper,on the basis of primal-dual dynamical approach,Nesterov accelerated dynamical approach,projection operator and directional gradient,we present two accelerated primal-dual projection neurodynamic approaches with time scaling to address convex optimization problems with smooth and nonsmooth objective functions subject to linear and set constraints,which consist of a second-order ODE(ordinary differential equation)or differential conclusion system for the primal variables and a first-order ODE for the dual vari-ables.By satisfying specific conditions for time scaling,we demonstrate that the proposed approaches have a faster conver-gence rate.This only requires assuming convexity of the objective function.We validate the effectiveness of our proposed two accel-erated primal-dual projection neurodynamic approaches through numerical experiments.

Research fronts and researchers of World Journal of Psychiatry in 2023: A visualization and analysis of mapping knowledge domains

BACKGROUND In the rapidly evolving landscape of psychiatric research,2023 marked another year of significant progress globally,with the World Journal of Psychiatry(WJP)experiencing notable expansion and influence.AIM To conduct a comprehensive visualization and analysis of the articles published in the WJP throughout 2023.By delving into these publications,the aim is to deter-mine the valuable insights that can illuminate pathways for future research endeavors in the field of psychiatry.METHODS A selection process led to the inclusion of 107 papers from the WJP published in 2023,forming the dataset for the analysis.Employing advanced visualization techniques,this study mapped the knowledge domains represented in these papers.RESULTS The findings revealed a prevalent focus on key topics such as depression,mental health,anxiety,schizophrenia,and the impact of coronavirus disease 2019.Additionally,through keyword clustering,it became evident that these papers were predominantly focused on exploring mental health disorders,depression,anxiety,schizophrenia,and related factors.Noteworthy contributions hailed authors in regions such as China,the United Kingdom,United States,and Turkey.Particularly,the paper garnered the highest number of citations,while the American Psychiatric Association was the most cited reference.CONCLUSION It is recommended that the WJP continue in its efforts to enhance the quality of papers published in the field of psychiatry.Additionally,there is a pressing need to delve into the potential applications of digital interventions and artificial intelligence within the discipline.

High patatin like phospholipase domain containing 8 expression as a biomarker for poor prognosis of colorectal cancer

BACKGROUND Patatin like phospholipase domain containing 8(PNPLA8)has been shown to play a significant role in various cancer entities.Previous studies have focused on its roles as an antioxidant and in lipid peroxidation.However,the role of PNPLA8 in colorectal cancer(CRC)progression is unclear.AIM To explore the prognostic effects of PNPLA8 expression in CRC.METHODS A retrospective cohort containing 751 consecutive CRC patients was enrolled.PNPLA8 expression in tumor samples was evaluated by immunohistochemistry staining and semi-quantitated with immunoreactive scores.CRC patients were divided into high and low PNPLA8 expression groups based on the cut-off va-lues,which were calculated by X-tile software.The prognostic value of PNPLA8 was identified using univariate and multivariate Cox regression analysis.The over-all survival(OS)rates of CRC patients in the study cohort were compared with Kaplan-Meier analysis and Log-rank test.RESULTS PNPLA8 expression was significantly associated with distant metastases in our cohort(P=0.048).CRC patients with high PNPLA8 expression indicated poor OS(median OS=35.3,P=0.005).CRC patients with a higher PNPLA8 expression at either stage I and II or stage III and IV had statistically significant shorter OS.For patients with left-sided colon and rectal cancer,the survival curves of two PN-PLA8-expression groups showed statistically significant differences.Multivariate analysis also confirmed that high PNPLA8 expression was an independent prog-nostic factor for overall survival(hazard ratio HR=1.328,95%CI:1.016-1.734,P=0.038).

Fast solution to the free return orbit's reachable domain of the manned lunar mission by deep neural network

It is important to calculate the reachable domain(RD)of the manned lunar mission to evaluate whether a lunar landing site could be reached by the spacecraft. In this paper, the RD of free return orbits is quickly evaluated and calculated via the classification and regression neural networks. An efficient databasegeneration method is developed for obtaining eight types of free return orbits and then the RD is defined by the orbit’s inclination and right ascension of ascending node(RAAN) at the perilune. A classify neural network and a regression network are trained respectively. The former is built for classifying the type of the RD, and the latter is built for calculating the inclination and RAAN of the RD. The simulation results show that two neural networks are well trained. The classification model has an accuracy of more than 99% and the mean square error of the regression model is less than 0.01°on the test set. Moreover, a serial strategy is proposed to combine the two surrogate models and a recognition tool is built to evaluate whether a lunar site could be reached. The proposed deep learning method shows the superiority in computation efficiency compared with the traditional double two-body model.