β-delayed proton decays of 81Zr and 85Mo

β-delayed proton decays of Tz=1/2 series nuclei 81Zr and 85Mo have been studied in detail by using p-γ coincidence measurement. The β-delayed proton spectra populating the first excited states of the daughter nuclei have been obtained. Half-life of 81Zr has been measured to be 5.3 s±0.5 s and that of 85Mo 3.2 s±0.2 s. By using statistical model calculations and systematic analyses, spins and parities for the ground states of 81Zr and 85Mo have been tentatively assigned to be 3/2- and 1/2-, respectively. Mass excess of 81Zr is -58.3 MeV±0.2 MeV and that of 85Mo -59.1 MeV±0.4 MeV. Combining the measured half-lives with the calculated partial ones yields the branches of β-delayed proton decay for 81Zr and 85Mo of (1.2±0.2)×10-3 and (1.4±0.2)×10-3, respectively.     

Determination for β-delayed fission probability of 230Ac

The 230Ra has been produced via 232Th-2p reaction induced by 60 MeV/u 18O ion irradia-tion of natural thorium. The radium was radiochemically separated from the mixture of thorium andreaction products. Thin Ra sources in which 230Ac was got through 230Ra β- → 230Ac were pre-pared for observing fission fragments from β-delayed fission of 230Ac. The sources were exposedto the mica fission track detectors and measured by the HPGe γ detector. The precursor 230Ac wasidentified by means of observed two fission events as well as γ spectra, and the β-delayed fissionprobability of 230Ac was obtained to be (1.19±0.85) × 10-8.     

稀土区质子滴线附近新的β缓发质子衰变

用重离子束³⁵Ar轰击缺中子同位素靶⁹²Mo,⁹⁶Ru和¹⁰⁶Cd产生了质子滴线附近的β缓发质子先驱核¹²⁵Nd,¹²⁸Pm,¹²⁹Sm,¹³⁷Gd和¹³⁹Dy.配合氦喷嘴带传输系统用“p-γ”符合方法对它们进行了肯定的鉴别.它们的半衰期分别为：0.60(15)s,1.0(3)s,0.55(10)s,2.2(2)s和0.6(2)s.用统计模型理论计算对实验测定的¹²⁵Nd, ¹²⁹Sm,¹³⁷Gd和¹³⁹Dy的,和从前报道的¹²¹Ce,¹³⁵Gd的β缓发质子衰变的能谱和分支比进行了拟合.提取出¹²¹Ce, ¹²⁵Nd, ¹²⁹Sm,¹³⁵Gd, ¹³⁷Gd和¹³⁹Dy的基态自旋-宇称分别为5/2^±,5/2^±,1/2⁺(或3/2⁺),5/2⁺,7/2^±和7/2⁺.实验初步指认的基态自旋 宇称值与Nilsson能级图的预言值相符间接表明这6种核素的基态具有大形变,形变参数β₂在0.3左右.     

Synthesis and characterization of C3N4 hard films

C3N4 films have been synthesized on both Si and Pt substrates by microwave plasma chemical vapor deposition (MPCVD) method. X-ray spectra were calculated for single phase α-C3N4 and β-C3N4 respectively. The experimental X-ray spectra of films deposited on both Si and Pt substrates showed all the strong peaks of α-C3N4 and β-C3N4, so the films are mixtures of α-C3N4 and β-C3N4. The N/C atomic ratio is in the range of 1.0-2.0. X-ray photoelectron spectroscopy (XPS) analysis indicated that the binding energy of C 1s and N 1s are 286.2 eV and 399.5 eV respectively, corresponding to polarized C-N bond. Fourier transform infrared absorption (FT-IR) and Raman spectra support the existence of C-N covalent bond in the films. Nano-indentation hardness tests showed that the bulk modulus of a film deposited on Pt is up to 349 GPa.     

Rates of uniform convergence for empirical processes of strictly stationary β-mixing sequences indexed by an unbounded class of functions

Assume that {Xn} is a strictly stationary β-mixing random sequence with the β-mixing coefficient βk = O(k-r), 0 < r ≤1. Yu (1994) obtained convergence rates of empirical processes of strictly stationary β-mixing random sequence indexed by bounded classes of functions. Here, a new truncation method is proposed and used to study the convergence for empirical processes of strictly stationary β-mixing sequences indexed by an unbounded class of functions. The research results show that if the envelope of the index class of functions is in Lp, p > 2 or p > 4, uniform convergence rates of empirical processes of strictly stationary β-mixing random sequence over the index classes can reach O((nr/(l+r)/logn)-1/2) or O((nr/(1+r)/ log n)-3/4) and that the Central Limit Theorem does not always hold for the empirical processes.``     

Experimental Study on the Flexural Ductility of BFRP Bar Concrete Beams With Bamboo Fiber and Steel Wire Mesh北大核心CSCD

To study the effects of bamboo fiber and steel wire mesh on the flexural ductility of basalt fiber reinforced polymer（BFRP）bar concrete beams, 7 BFRP bar concrete beams with bamboo fiber and steel wire mesh were tested with different bamboo fiber lengths (0 mm, 30 mm and 45 mm) and different steel wire mesh layout ranges (0, 1/2 maximum bending moment point layout and full beam length layout). The flexural failure tests of the 7 beams were carried out, and the initial crack loads, the crack developments, the ultimate loads and the deformations were detected. The effects of the fiber length and the wire mesh layout range on the crack resistance and the deformation resistance of the specimens were analyzed based on the test data. With the function model, the equivalent yield points of the 7 test beams were obtained, and their ductility coefficients were calculated. The results show that, the addition of bamboo fiber and steel wire mesh increases the cracking loads of BFRP bar concrete beams by 12%~68%, decreases the crack spacings and the crack length development speed, reduces the test beam deformation under the same load, and increases the ductility coefficient by 1.58%~31.75%. © 2023 Editorial Office of Applied Mathematics and Mechanics. All rights reserved.     

A ■_n-Related Family of Homotopy Elements in the Stable Homotopy of Spheres

To determine the stable homotopy groups of spheres π_*(S) is one of the central problems in homotopy theory. Let p be a prime greater than 5. The authors make use of the May spectral sequence and the Adams spectral sequence to prove the existence of a ■_n-related family of homotopy elements, β1ω_nγ_s, in the stable homotopy groups of spheres, where ■_n 3, 3≤s p-2 and the ■_n-element was detected by X. Liu.     

A note on the illposedness for anisotropic nonlinear Schrödinger equation

In this short note, we show the illposedness of anisotropic Schroedinger equation in L^2 if the growth of nonlinearity is larger than a threshold power pc which is also the critical power for blowup, as Fibich, Ilan and Schochet have pointed out recently. The illposedness in anisotropic Sobolev space Hk,d-d^2s,s where 0 〈 s 〈 sc, sc =d/2-k/4-2/p-1, and the illposedness in Sobolev space of negative order H^s, s 〈 0 are also proved.     

New existence of multi-spike solutions for the fractional Schr?dinger equations

We consider the following fractional Schr¨odinger equation:(-?)^su + V(y)u = u^p, u > 0 in R^N,(0.1) where s ∈(0, 1), 1 < p 相似文献   

On the polynomiality and asymptotics of moments of sizes for random(n,dn ± 1)-core partitions with distinct parts

Amdeberhan’s conjectures on the enumeration,the average size,and the largest size of(n,n+1)-core partitions with distinct parts have motivated many research on this topic.Recently,Straub(2016)and Nath and Sellers(2017)obtained formulas for the numbers of(n,dn-1)-and(n,dn+1)-core partitions with distinct parts,respectively.Let X_s,t be the size of a uniform random(s,t)-core partition with distinct parts when s and t are coprime to each other.Some explicit formulas for the k-th moments E[X_n,n+1^k]and E[X_(2 n+1,2 n+3)^k]were given by Zaleski and Zeilberger(2017)when k is small.Zaleski(2017)also studied the expectation and higher moments of X_n,dn-1 and conjectured some polynomiality properties concerning them in ar Xiv:1702.05634.Motivated by the above works,we derive several polynomiality results and asymptotic formulas for the k-th moments of X_n,dn+1 and X_n,dn-1 in this paper,by studying theβ-sets of core partitions.In particular,we show that these k-th moments are asymptotically some polynomials of n with degrees at most 2 k,when d is given and n tends to infinity.Moreover,when d=1,we derive that the k-th moment E[X_n,n+1^k]of X_n,n+1 is asymptotically equal to(n²/10)^kwhen n tends to infinity.The explicit formulas for the expectations E[X_n,dn+1]and E[X_n,dn-1]are also given.The(n,dn-1)-core case in our results proves several conjectures of Zaleski(2017)on the polynomiality of the expectation and higher moments of X_n,dn-1.     

Structural Crack Identification Based on the Variational Mode Decomposition北大核心CSCD

In order to enrich the bridge damage detection method and further improve the accuracy of bridge damage identification, a detection method for simply supported beams with cracks under dynamic loads was proposed not based on the complete finite element model. Under the premise of not blocking traffic, the method only needs to analyze and deal with the acceleration responses of the simply supported beam span, which reduces the mounting, dismounting and maintenance of sensors in practical engineering. At the same time, based on the model, an analytical formula of the acceleration at the midspan of the simply supported cracked beam was derived. Based on the theoretical derivation, the instantaneous energy and the mean energy difference were constructed through the variational mode decomposition and the Hilbert transform, and these 2 crack identification indexes were used to effectively identify small cracks with a crack depth ratio of only 5%. Then the influences of different wheel loads, environmental noises and damage degrees on detection results were studied. The results show that: ① the instantaneous frequency has a better recognition effect for crack positions; ② the mean energy difference is sensitive to crack depth ratio δ and the wheel load magnitude; ③ this method has strong noise robustness. © 2022 Editorial Office of Applied Mathematics and Mechanics. All rights reserved.     

The Cauchy Problem for the Generalized Korteweg-de Vries-Benjamin-Ono Equation with Low Regularity Data

The Cauchy problem of the generalized Korteweg-de Vries-Benjamin-Ono equation is considered, and low regularity and limit behavior of the solutions are obtained. For k = 1, local well- posedness is obtained for data in H^s（R）（s 〉 -3/4）. For k = 2, local result for data in H^S（R）（s 〉1/4） is obtained. For k = 3, local result for data in H^S（R）（s 〉 -1/6） is obtained. Moreover, the solutions of generalized Korteweg-de Vries-Benjamin-Ono equation converge to the solutions of KdV equation if the term of Benjamin-Ono equation tends to zero.     

Bipartite Version of the Erd?s-Sós Conjecture

The Erd?s-Sós Conjecture states that every graph on n vertices and more than n(k-2)/2 edges contains every tree of order k as a subgraph. In this note, we study a weak(bipartite)version of Erd?s-Sós Conjecture. Based on a basic lemma, we show that every bipartite graph on n vertices and more than n(k-2)/2 edges contains the following families of trees of order k:(1) trees of diameter at most five;(2) trees with maximum degree at least [k-1/2];(3) almost balanced trees, these results are better than the corresponding known results for the general version of the Erd?s-Sós Conjecture.     

On the Serrin's Regularity Criterion for the β-Generalized Dissipative Surface Quasi-geostrophic Equation

The authors establish a Serrin's regularity criterion for the β-generalized dissipative surface quasi-geostrophic equation.More precisely,it is shown that if the smooth solution θ satisfies ▽θ∈L~q(0,T;L~P(R~2)) with α/q+2/p≤α+β-1,then the solution θcan be smoothly extended after time T.In particular,when α+β≥2,it is shown that if α_yθ∈L~q(0,T;L~P(R~2)) with α/q+2/p≤α+β-1,then the solution θ can also be smoothly extended after time T.This result extends the regularity result of Yamazaki in 2012.     

On the diophantine equation x 2 − Dy 2 = n

We propose a method to determine the solvability of the diophantine equation x2-Dy2=n for the following two cases:(1) D = pq,where p,q ≡ 1 mod 4 are distinct primes with(q/p)=1 and(p/q)4(q/p)4=-1.(2) D=2p1p2 ··· pm,where pi ≡ 1 mod 8,1≤i≤m are distinct primes and D=r2+s2 with r,s ≡±3 mod 8.     

GPU Parallelization Computation of High-Dimensional Multi-Phase Separation in Complex Domains Based on the Corrected FPM北大核心CSCD

Based on the corrected finite pointset method (CFPM) with CPU-GPU heteroid parallelization (CFPM-GPU), a high-efficiency, accurate and fast parallel algorithm was developed for the high-dimensional phase separation phenomena governed by the multi-component Cahn-Hilliard (C-H) equation in complex domains. The proposed parallel algorithm with the CFPM-GPU was built in a process like: ① introduce the Wendland weight function into the discretization of the finite pointset method (FPM) scheme for the 1st/2nd spatial derivatives, based on the Taylor series and the weighted least square concept; ② use the above FPM scheme twice to approximate the 4th spatial derivative in the C-H equation, which is called the CFPM method; ③ for the first time establish an accelerating parallel algorithm for the CFPM with local matrices by means of a single GPU card based on the CUDA programming. Two benchmark problems of 2D radially and 3D spherically symmetric C-H equations were first solved to test the accuracy and high-efficiency of the proposed CFPM-GPU, and the acceleration ratio of the GPU parallelization to the single CPU computation is about 160. Subsequently, the proposed CFPM-GPU was used to predict the 2D/3D multi-phase separation phenomena in complex domains, and the prediction was compared with other numerical results. The numerical results show that, the proposed CFPM-GPU is valid and high-efficiency to simulate the 2D/3D multi-phase separation cases in complex domains. © 2023 Editorial Office of Applied Mathematics and Mechanics. All rights reserved.     

On the α-spectra of Uniform Hypergraphs and Its Associated Graphs

For 0 ≤α 1 and a k-uniform hypergraph H, the tensor A_α(H) associated with H is defined as A_α(H) = αD(H) +(1-α)A(H), where D(H) and A(H) are the diagonal tensor of degrees and the adjacency tensor of H, respectively. The α-spectra of H is the set of all eigenvalues of A_α(H) and the α-spectral radius ρ_α(H) is the largest modulus of the elements in the spectrum of A_α(H). In this paper we define the line graph L(H) of a uniform hypergraph H and prove that ρ_α(H) ≤■ρ_α(L(H)) + 1 + α(Δ-1-δ~*/k), where Δ and δ~* are the maximum degree of H and the minimum degree of L(H), respectively. We also generalize some results on α-spectra of G~(k,s), which is obtained from G by blowing up each vertex into an s-set and each edge into a k-set where 1 ≤ s ≤ k/2.     

Low Regularity Solution of the Initial-Boundary-Value Problem for the ＂Good＂ Boussinesq Equation on the Half Line

we study an initial-boundary-value problem for the ＂good＂ Boussinesq equation on the half line
{δt^2u-δx^2u＋δx^4u＋δx^2u^2=0,t〉0,x〉0.
u（0,t）=h1（t）,δx^2u（0,t） =δth2（t）,
u（x,0）=f（x）,δtu（x,0）=δxh（x）.
The existence and uniqueness of low reguality solution to the initial-boundary-value problem is proved when the initial-boundary data （f, h, h1, h2） belong to the product space
H^5（R^＋）×H^s-1（R^＋）×H^s/2＋1/4（R^＋）×H^s/2＋1/4（R^＋）
1 The analyticity of the solution mapping between the initial-boundary-data and the with 0 ≤ s 〈 1/2. solution space is also considered.     

Bounds for Average toward the Resonance Barrier for GL(3) × GL(2) Automorphic Forms

Let f be a fixed Maass form for SL₃(Z) with Fourier coefficients A_f(m,n).Let g be a Maass cusp form for SL₂(G) with Laplace eigenvalue (1/4)+k² and Fourier coefficient λ_g(n),or a holomorphic cusp form of even weight k.Denote by S_X(f×g,α,β) a smoothly weighted sum of A_f(1,n)λ_g(n)e(αn^β)for X 0 are fixed real numbers.The subject matter of the present paper is to prove ...     

Resolvability in circulant graphs

A set W of the vertices of a connected graph G is called a resolving set for G if for every two distinct vertices u, v ∈ V (G) there is a vertex w ∈ W such that d(u, w) ≠ d(v, w). A resolving set of minimum cardinality is called a metric basis for G and the number of vertices in a metric basis is called the metric dimension of G, denoted by dim(G). For a vertex u of G and a subset S of V (G), the distance between u and S is the number min s∈S d(u, s). A k-partition Π = {S 1 , S 2 , . . . , S k } of V (G) is called a resolving partition if for every two distinct vertices u, v ∈ V (G) there is a set S i in Π such that d(u, Si )≠ d(v, Si ). The minimum k for which there is a resolving k-partition of V (G) is called the partition dimension of G, denoted by pd(G). The circulant graph is a graph with vertex set Zn , an additive group of integers modulo n, and two vertices labeled i and j adjacent if and only if i-j (mod n) ∈ C , where CZn has the property that C =-C and 0 ■ C. The circulant graph is denoted by Xn, Δ where Δ = |C|. In this paper, we study the metric dimension of a family of circulant graphs Xn, 3 with connection set C = {1, n/2 , n-1} and prove that dim(Xn, 3 ) is independent of choice of n by showing that dim(Xn, 3 ) ={3 for all n ≡ 0 (mod 4), 4 for all n ≡ 2 (mod 4). We also study the partition dimension of a family of circulant graphs Xn,4 with connection set C = {±1, ±2} and prove that pd(Xn, 4 ) is independent of choice of n and show that pd(X5,4 ) = 5 and pd(Xn,4 ) ={3 for all odd n ≥ 9, 4 for all even n ≥ 6 and n = 7.