Calculation and prediction of divertor detachment via impurity seeding by using one-dimensional model

Achieving the detachment of divertor can help to alleviate excessive heat load and sputtering problems on the target plates,thereby extending the lifetime of divertor components for fusion devices.In order to provide a fast but relatively reliable prediction of plasma parameters along the flux tube for future device design,a one-dimensional(1D)modeling code for the operating point of impurity seeded detached divertor is developed based on Python language,which is a fluid model based on previous work(Plasma Phys.Control.Fusion 58045013(2016)).The experimental observation of the onset of divertor detachment by neon(Ne)and argon(Ar)seeding in EAST is well reproduced by using the 1D modeling code.The comparison between the 1D modeling and two-dimensional(2D)simulation by the SOLPS-ITER code for CFETR detachment operation with Ne and Ar seeding also shows that they are in good agreement.We also predict the radiative power loss and corresponding impurity concentration requirement for achieving divertor detachment via different impurity seeding under high heating power conditions in EAST and CFETR phase II by using the 1D model.Based on the predictions,the optimized parameter space for divertor detachment operation on EAST and CFETR is also determined.Such a simple but reliable 1D model can provide a reasonable parameter input for a detailed and accurate analysis by 2D or three-dimensional(3D)modeling tools through rapid parameter scanning.

Numerical Investigations on the Resonance Errors of Multiscale Discontinuous Galerkin Methods for One-Dimensional Stationary Schrödinger Equation

In this paper,numerical experiments are carried out to investigate the impact of penalty parameters in the numerical traces on the resonance errors of high-order multiscale discontinuous Galerkin(DG)methods(Dong et al.in J Sci Comput 66:321–345,2016;Dong and Wang in J Comput Appl Math 380:1–11,2020)for a one-dimensional stationary Schrödinger equation.Previous work showed that penalty parameters were required to be positive in error analysis,but the methods with zero penalty parameters worked fine in numerical simulations on coarse meshes.In this work,by performing extensive numerical experiments,we discover that zero penalty parameters lead to resonance errors in the multiscale DG methods,and taking positive penalty parameters can effectively reduce resonance errors and make the matrix in the global linear system have better condition numbers.

Prediction of one-dimensional CrN nanostructure as a promising ferromagnetic half-metal

Searching for one-dimensional(1D)nanostructure with ferromagnetic(FM)half-metallicity is of significance for the development of miniature spintronic devices.Here,based on the first-principles calculations,we propose that the 1D CrN nanostructure is a FM half-metal,which can generate the fully spin-polarized current.The ab initio molecular dynamic simulation and the phonon spectrum calculation demonstrate that the 1D CrN nanostructure is thermodynamically stable.The partially occupied Cr-d orbitals endow the nanostructure with FM half-metallicity,in which the half-metallic gap(?s)reaches up to 1.58 eV.The ferromagnetism in the nanostructure is attributed to the superexchange interaction between the magnetic Cr atoms,and a sizable magnetocrystalline anisotropy energy(MAE)is obtained.Moreover,the transverse stretching of nanostructure can effectively modulate?s and MAE,accompanied by the preservation of half-metallicity.A nanocable is designed by encapsulating the CrN nanostructure with a BN nanotube,and the intriguing magnetic and electronic properties of the nanostructure are retained.These novel characteristics render the 1D CrN nanostructure as a compelling candidate for exploiting high-performance spintronic devices.

Evolutionary Neural Architecture Search and Its Applications in Healthcare

Most of the neural network architectures are based on human experience,which requires a long and tedious trial-and-error process.Neural architecture search(NAS)attempts to detect effective architectures without human intervention.Evolutionary algorithms(EAs)for NAS can find better solutions than human-designed architectures by exploring a large search space for possible architectures.Using multiobjective EAs for NAS,optimal neural architectures that meet various performance criteria can be explored and discovered efficiently.Furthermore,hardware-accelerated NAS methods can improve the efficiency of the NAS.While existing reviews have mainly focused on different strategies to complete NAS,a few studies have explored the use of EAs for NAS.In this paper,we summarize and explore the use of EAs for NAS,as well as large-scale multiobjective optimization strategies and hardware-accelerated NAS methods.NAS performs well in healthcare applications,such as medical image analysis,classification of disease diagnosis,and health monitoring.EAs for NAS can automate the search process and optimize multiple objectives simultaneously in a given healthcare task.Deep neural network has been successfully used in healthcare,but it lacks interpretability.Medical data is highly sensitive,and privacy leaks are frequently reported in the healthcare industry.To solve these problems,in healthcare,we propose an interpretable neuroevolution framework based on federated learning to address search efficiency and privacy protection.Moreover,we also point out future research directions for evolutionary NAS.Overall,for researchers who want to use EAs to optimize NNs in healthcare,we analyze the advantages and disadvantages of doing so to provide detailed guidance,and propose an interpretable privacy-preserving framework for healthcare applications.

Cooperative UAV search strategy based on DMPC-AACO algorithm in restricted communication scenarios

Improvement of integrated battlefield situational awareness in complex environments involving dynamic factors such as restricted communications and electromagnetic interference(EMI)has become a contentious research problem.In certain mission environments,due to the impact of many interference sources on real-time communication or mission requirements such as the need to implement communication regulations,the mission stages are represented as a dynamic combination of several communication-available and communication-unavailable stages.Furthermore,the data interaction between unmanned aerial vehicles(UAVs)can only be performed in specific communication-available stages.Traditional cooperative search algorithms cannot handle such situations well.To solve this problem,this study constructed a distributed model predictive control(DMPC)architecture for a collaborative control of UAVs and used the Voronoi diagram generation method to re-plan the search areas of all UAVs in real time to avoid repetition of search areas and UAV collisions while improving the search efficiency and safety factor.An attention mechanism ant-colony optimization(AACO)algorithm is proposed for UAV search-control decision planning.The search strategy is adaptively updated by introducing an attention mechanism for regular instruction information,a priori information,and emergent information of the mission to satisfy different search expectations to the maximum extent.Simulation results show that the proposed algorithm achieves better search performance than traditional algorithms in restricted communication constraint scenarios.

Size effect on light propagation modulation near band edges in one-dimensional periodic structures

Periodic photonic structures can provide rich modulation in propagation of light due to well-defined band structures.Especially near band edges,light localization and the effect of near-zero refractive index have attracted wide attention.However,the practically fabricated structures can only have finite size,i.e.,limited numbers of periods,leading to changes of the light propagation modulation compared with infinite structures.Here,we study the size effect on light localization and near-zero refractive-index propagation near band edges in one-dimensional periodic structures.Near edges of the band gap,as the structure's size shrinks,the broadening of the band gap and the weakening of the light localization are discovered.When the size is small,an added layer on the surface will perform large modulation in the group velocity.Near the degenerate point with Dirac-like dispersion,the zero-refractive-index effects like the zero-phase difference and near-unity transmittance retain as the size changes,while absolute group velocity fluctuates when the size shrinks.

A Dugdale-Barenblatt model for elliptical orifice problem with asymmetric cracks in one-dimensional orthorhombic quasicrystals

By means of Muskhelishvili’s method and the technique of generalized conformal mapping,the physical plane problems are transformed into regular mathematical problems in quasicrystals(QCs).The analytical solution to an elliptical orifice problem with asymmetric cracks in one-dimensional(1D)orthorhombic QCs is obtained.By using the Dugdale-Barenblatt model,the plastic simulation at the crack tip of the elliptical orifice with asymmetric cracks in 1D orthorhombic QCs is performed.Finally,the size of the atomic cohesive force zone is determined precisely,and the size of the atomic cohesive force zone around the crack tip of an elliptical orifice with a single crack or two symmetric cracks is obtained.

Robust Damage Detection and Localization Under Complex Environmental Conditions Using Singular Value Decomposition-based Feature Extraction and One-dimensional Convolutional Neural Network

Ultrasonic guided wave is an attractive monitoring technique for large-scale structures but is vulnerable to changes in environmental and operational conditions(EOC),which are inevitable in the normal inspection of civil and mechanical structures.This paper thus presents a robust guided wave-based method for damage detection and localization under complex environmental conditions by singular value decomposition-based feature extraction and one-dimensional convolutional neural network(1D-CNN).After singular value decomposition-based feature extraction processing,a temporal robust damage index(TRDI)is extracted,and the effect of EOCs is well removed.Hence,even for the signals with a very large temperature-varying range and low signal-to-noise ratios(SNRs),the final damage detection and localization accuracy retain perfect 100%.Verifications are conducted on two different experimental datasets.The first dataset consists of guided wave signals collected from a thin aluminum plate with artificial noises,and the second is a publicly available experimental dataset of guided wave signals acquired on a composite plate with a temperature ranging from 20℃to 60℃.It is demonstrated that the proposed method can detect and localize the damage accurately and rapidly,showing great potential for application in complex and unknown EOC.

Analysis of Dynamical Behavior of One-Dimensional Real Maps: An Executable Dynamical Programming Software Approach

The dynamical behavior of real-world phenomena is implausible graphically due to the complexity of mathematical coding. The present article has mainly focused on some one-dimensional real maps’ dynamical behavior irrespective of using coding. In continuation, linear, quadratic, cubic, higher-order, exponential, logarithmic, and absolute value maps have been used to scrutinize their dynamical behavior, including the characteristics of the orbit of points. Dynamical programming software (DPS.exe) will be proposed as a new technique to ascertain the dynamical behavior of said maps. Thus, a mathematician can automatically determine one-dimensional real maps’ dynamical behavior apart from complicated programming code and analytical solutions.

Thermal-induced interfacial behavior of a thin one-dimensional hexagonal quasicrystal film

In this paper,we investigate the interfacial behavior of a thin one-dimensional(1D)hexagonal quasicrystal(QC)film bonded on an elastic substrate subjected to a mismatch strain due to thermal variation.The contact interface is assumed to be nonslipping,with both perfectly bonded and debonded boundary conditions.The Fourier transform technique is adopted to establish the integral equations in terms of interfacial shear stress,which are solved as a linear algebraic system by approximating the unknown phonon interfacial shear stress via the series expansion of the Chebyshev polynomials.The expressions are explicitly obtained for the phonon interfacial shear stress,internal normal stress,and stress intensity factors(SIFs).Finally,based on numerical calculations,we briefly discuss the effects of the material mismatch,the geometry of the QC film,and the debonded length and location on stresses and SIFs.

Optimal search path planning of UUV in battlefeld ambush scene

Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical models of ocean current environment,target movement,and sonar detection,the probability calculation methods of single UUV searching target and multiple UUV cooperatively searching target are given respectively.Then,based on the Hybrid Quantum-behaved Particle Swarm Optimization(HQPSO)algorithm,the path with the highest target search probability is found.Finally,through simulation calculations,the influence of different UUV parameters and target parameters on the target search probability is analyzed,and the minimum number of UUVs that need to be deployed to complete the ambush task is demonstrated,and the optimal search path scheme is obtained.The method proposed in this paper provides a theoretical basis for the practical application of UUV in the future combat.

Enhanced Differentiable Architecture Search Based on Asymptotic Regularization

In differentiable search architecture search methods,a more efficient search space design can significantly improve the performance of the searched architecture,thus requiring people to carefully define the search space with different complexity according to various operations.Meanwhile rationalizing the search strategies to explore the well-defined search space will further improve the speed and efficiency of architecture search.With this in mind,we propose a faster and more efficient differentiable architecture search method,AllegroNAS.Firstly,we introduce a more efficient search space enriched by the introduction of two redefined convolution modules.Secondly,we utilize a more efficient architectural parameter regularization method,mitigating the overfitting problem during the search process and reducing the error brought about by gradient approximation.Meanwhile,we introduce a natural exponential cosine annealing method to make the learning rate of the neural network training process more suitable for the search procedure.Moreover,group convolution and data augmentation are employed to reduce the computational cost.Finally,through extensive experiments on several public datasets,we demonstrate that our method can more swiftly search for better-performing neural network architectures in a more efficient search space,thus validating the effectiveness of our approach.

Bridge Bidding via Deep Reinforcement Learning and Belief Monte Carlo Search

Contract Bridge,a four-player imperfect information game,comprises two phases:bidding and playing.While computer programs excel at playing,bidding presents a challenging aspect due to the need for information exchange with partners and interference with communication of opponents.In this work,we introduce a Bridge bidding agent that combines supervised learning,deep reinforcement learning via self-play,and a test-time search approach.Our experiments demonstrate that our agent outperforms WBridge5,a highly regarded computer Bridge software that has won multiple world championships,by a performance of 0.98 IMPs(international match points)per deal over 10000 deals,with a much cost-effective approach.The performance significantly surpasses previous state-of-the-art(0.85 IMPs per deal).Note 0.1 IMPs per deal is a significant improvement in Bridge bidding.

A Lightweight, Searchable, and Controllable EMR Sharing Scheme

Electronic medical records (EMR) facilitate the sharing of medical data, but existing sharing schemes suffer fromprivacy leakage and inefficiency. This article proposes a lightweight, searchable, and controllable EMR sharingscheme, which employs a large attribute domain and a linear secret sharing structure (LSSS), the computationaloverhead of encryption and decryption reaches a lightweight constant level, and supports keyword search andpolicy hiding, which improves the high efficiency of medical data sharing. The dynamic accumulator technologyis utilized to enable data owners to flexibly authorize or revoke the access rights of data visitors to the datato achieve controllability of the data. Meanwhile, the data is re-encrypted by Intel Software Guard Extensions(SGX) technology to realize resistance to offline dictionary guessing attacks. In addition, blockchain technology isutilized to achieve credible accountability for abnormal behaviors in the sharing process. The experiments reflectthe obvious advantages of the scheme in terms of encryption and decryption computation overhead and storageoverhead, and theoretically prove the security and controllability in the sharing process, providing a feasible solutionfor the safe and efficient sharing of EMR.

Privacy-Preserving Multi-Keyword Fuzzy Adjacency Search Strategy for Encrypted Graph in Cloud Environment

In a cloud environment,outsourced graph data is widely used in companies,enterprises,medical institutions,and so on.Data owners and users can save costs and improve efficiency by storing large amounts of graph data on cloud servers.Servers on cloud platforms usually have some subjective or objective attacks,which make the outsourced graph data in an insecure state.The issue of privacy data protection has become an important obstacle to data sharing and usage.How to query outsourcing graph data safely and effectively has become the focus of research.Adjacency query is a basic and frequently used operation in graph,and it will effectively promote the query range and query ability if multi-keyword fuzzy search can be supported at the same time.This work proposes to protect the privacy information of outsourcing graph data by encryption,mainly studies the problem of multi-keyword fuzzy adjacency query,and puts forward a solution.In our scheme,we use the Bloom filter and encryption mechanism to build a secure index and query token,and adjacency queries are implemented through indexes and query tokens on the cloud server.Our proposed scheme is proved by formal analysis,and the performance and effectiveness of the scheme are illustrated by experimental analysis.The research results of this work will provide solid theoretical and technical support for the further popularization and application of encrypted graph data processing technology.

Spatial search weighting information contained in cell velocity distribution

Cell migration plays a significant role in physiological and pathological processes.Understanding the characteristics of cell movement is crucial for comprehending biological processes such as cell functionality,cell migration,and cell–cell interactions.One of the fundamental characteristics of cell movement is the specific distribution of cell speed,containing valuable information that still requires comprehensive understanding.This article investigates the distribution of mean velocities along cell trajectories,with a focus on optimizing the efficiency of cell food search in the context of the entire colony.We confirm that the specific velocity distribution in the experiments corresponds to an optimal search efficiency when spatial weighting is considered.The simulation results indicate that the distribution of average velocity does not align with the optimal search efficiency when employing average spatial weighting.However,when considering the distribution of central spatial weighting,the specific velocity distribution in the experiment is shown to correspond to the optimal search efficiency.Our simulations reveal that for any given distribution of average velocity,a specific central spatial weighting can be identified among the possible central spatial weighting that aligns with the optimal search strategy.Additionally,our work presents a method for determining the spatial weights embedded in the velocity distribution of cell movement.Our results have provided new avenues for further investigation of significant topics,such as relationship between cell behavior and environmental conditions throughout their evolutionary history,and how cells achieve collective cooperation through cell-cell communication.

Study on Joint Method of 3D Acoustic Emission Source Localization Simplex and Grid Search Scanning

Acoustic emission(AE)source localization is a fundamental element of rock fracture damage imaging.To improve the efficiency and accuracy of AE source localization,this paper proposes a joint method comprising a three-dimensional(3D)AE source localization simplex method and grid search scanning.Using the concept of the geometry of simplexes,tetrahedral iterations were first conducted to narrow down the suspected source region.This is followed by a process of meshing the region and node searching to scan for optimal solutions,until the source location is determined.The resulting algorithm was tested using the artificial excitation source localization and uniaxial compression tests,after which the localization results were compared with the simplex and exhaustive methods.The results revealed that the localization obtained using the proposed method is more stable and can be effectively avoided compared with the simplex localization method.Furthermore,compared with the global scanning method,the proposed method is more efficient,with an average time of 10%–20%of the global scanning localization algorithm.Thus,the proposed algorithm is of great significance for laboratory research focused on locating rupture damages sustained by large-sized rock masses or test blocks.

Even Search in a Promising Region for Constrained Multi-Objective Optimization

In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However, an overly finetuned strategy or technique might overfit some problem types,resulting in a lack of versatility. In this article, we propose a generic search strategy that performs an even search in a promising region. The promising region, determined by obtained feasible non-dominated solutions, possesses two general properties.First, the constrained Pareto front(CPF) is included in the promising region. Second, as the number of feasible solutions increases or the convergence performance(i.e., approximation to the CPF) of these solutions improves, the promising region shrinks. Then we develop a new strategy named even search,which utilizes the non-dominated solutions to accelerate convergence and escape from local optima, and the feasible solutions under a constraint relaxation condition to exploit and detect feasible regions. Finally, a diversity measure is adopted to make sure that the individuals in the population evenly cover the valuable areas in the promising region. Experimental results on 45 instances from four benchmark test suites and 14 real-world CMOPs have demonstrated that searching evenly in the promising region can achieve competitive performance and excellent versatility compared to 11 most state-of-the-art methods tailored for CMOPs.

Database Search Behaviors: Insight from a Survey of Information Retrieval Practices

This study examines the database search behaviors of individuals, focusing on gender differences and the impact of planning habits on information retrieval. Data were collected from a survey of 198 respondents, categorized by their discipline, schooling background, internet usage, and information retrieval preferences. Key findings indicate that females are more likely to plan their searches in advance and prefer structured methods of information retrieval, such as using library portals and leading university websites. Males, however, tend to use web search engines and self-archiving methods more frequently. This analysis provides valuable insights for educational institutions and libraries to optimize their resources and services based on user behavior patterns.

Research on Evacuation Path Planning Based on Improved Sparrow Search Algorithm

Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Firstly,the Golden Sine algorithm and a nonlinear weight factor optimization strategy were added in the discoverer position update stage of the SSA algorithm.Secondly,the Cauchy-Gaussian perturbation was applied to the optimal position of the SSA algorithm to improve its ability to jump out of local optima.Finally,the local search mechanism based on the mountain climbing method was incorporated into the local search stage of the SSA algorithm,improving its local search ability.To evaluate the effectiveness of the proposed algorithm,the Whale Algorithm,Gray Wolf Algorithm,Improved Gray Wolf Algorithm,Sparrow Search Algorithm,and MSSA Algorithm were employed to solve various test functions.The accuracy and convergence speed of each algorithm were then compared and analyzed.The results indicate that the MSSA algorithm has superior solving ability and stability compared to other algorithms.To further validate the enhanced algorithm’s capabilities for path planning,evacuation experiments were conducted using different maps featuring various obstacle types.Additionally,a multi-exit evacuation scenario was constructed according to the actual building environment of a teaching building.Both the sparrow search algorithm and MSSA algorithm were employed in the simulation experiment for multiexit evacuation path planning.The findings demonstrate that the MSSA algorithm outperforms the comparison algorithm,showcasing its greater advantages and higher application potential.