首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 27 毫秒
1.
In the paper, we study the gracefulness of several unconnected graphs related to wheel. For natural number p ≥1,t ≥1, let n =2t +3, 2t +4, which proved W_n∪K_(p,t)~(1)∪K_(p,t)~(2) is graceful; for p ≥1, t ≥1,let n=2t+3,2t+4, then W_(n,2n+1)∪K_(p,t)~(1)∪K_(p,t)~(2) is graceful and for m≥1,r ≥1, let n =2m +5, W_(n,2n+1) ∪( C_3∨K m) U St( r)is graceful.  相似文献   

2.
It is well known that for almost all real number x, the geometric mean of the first n digits d_i(x) in the Lüroth expansion of x converges to a number K_0 as n→∞. On the other hand, for almost all x, the arithmetric mean of the first n Lüroth expansion digits d_i(x) approaches infinity as n→∞. There is a sequence of refinements of the AM-GM inequality, Maclaurin's inequalities, relating the 1/k-th powers of the k-th elementary symmetric means of n numbers for 1≤k≤n. In this paper, we investigate what happens to the means of Lüroth expansion digits in the limit as one moves f(n) steps away from either extreme. We prove sufficient conditions on f(n) to ensure divergence when one moves away from the arithmetic mean and convergence when one moves f(n) steps away from geometric mean.  相似文献   

3.
The electron states confined in wurtzite InxGa1-xN/GaN strained quantum dots (QDs) have been investigated in the effective -mass approximation by solving the Schrtdinger equation, in which parabolic confined potential and strong built-in electric field effect (due to the piezoelectricity and spontaneous polarization) have been taken into account. The real part Rex^(3)(0,0,ω) and the imaginary part Imx^(3)(0,0,ω) of the third-order susceptibil- ity describe quadratic electro-optic effects and electro-absorption process of the QDs respectively. And both of them have been calculated in directions parallel and vertical to z axis. Furthermore, the study shows Rex^(3)(0,0,ω) and Imx^(3)(0,0,ω) increase under resonant conditions with the QDs' radius and height increase, and the same results occur when the content increase. In addition, the resonant position shift to the lower energy region when the parabolic frequencies increase.  相似文献   

4.
The intersection graph of bases of a matroid M=(E, B) is a graph G=G~I(M) with vertex set V(G) and edge set E(G) such that V(G)=B(M) and E(G)={BB′:|B∩B′|≠0, B, B′∈B(M), where the same notation is used for the vertices of G and the bases of M. Suppose that|V(G~I(M))| =n and k_1+k_2+…+k_p=n, where k_i is an integer, i=1, 2,…, p. In this paper, we prove that there is a partition of V(G~I(M)) into p parts V_1 , V_2,…, V_p such that |V_i| =k_i and the subgraph H_i induced by V_i contains a k_i-cycle when k_i ≥3, H_i is isomorphic to K_2 when k_i =2 and H_i is a single point when k_i =1.  相似文献   

5.
By the discussion of division in \(F_{^{^{^{_2 m} } } } \left[ u \right]/\left\langle {u^4 } \right\rangle \), the minimal spanning set and the rank of a (1 + u + u 2) - constacyclic code with an arbitrary length N = 2 e n over \(\Phi \) are determined based on the factorization of (x n - 1) over \({F_{{2^m}}}\).  相似文献   

6.
If L is a star body in R~n whose central(n-i)-slices have the same(n-i)-dimensional measure μ_(n-i)(with appropriate density)as the central(n-i)-slices of an origin-symmetric star body K,then the corresponding n-dimensional measures μ_n of K and L satisfy μ_n(K)≤μ_n(L).This extends a generalized Funk’s section theorem for volumes to that for measures.  相似文献   

7.
Multi-pattern matching with wildcards is a problem of finding the occurrence of all patterns in a pattern set{p~1,---,p~k}in a given text t. If the percentage of wildcards in pattern set is not high,this problem can be solved using finite automata. We introduce a multi-pattern matching algorithm with a fixed number of wildcards to overcome the high percentage of the occurrence of wildcards in patterns. In our proposed method,patterns are matched as bit patterns using a sliding window approach. The window is a bit window that slides along the given text,matching against stored bit patterns. Matching process is executed using bit wise operations. The experimental results demonstrate that the percentage of wildcard occurrence does not affect the proposed algorithm's performance and the proposed algorithm is more efficient than the algorithms based on the fast Fourier transform. The proposed algorithm is simple to implement and runs efficiently in O(n+d(n/σ)(m/w))time,where n is text length,d is symbol distribution over k patterns,m is pattern length,and σ is alphabet size.  相似文献   

8.
In this paper, we propose an arc-search interior-point algorithm for convex quadratic programming with a wide neighborhood of the central path, which searches the optimizers along the ellipses that approximate the entire central path. The favorable polynomial complexity bound of the algorithm is obtained, namely O(nlog(( x~0)~TS~0/ε)) which is as good as the linear programming analogue. Finally, the numerical experiments show that the proposed algorithm is efficient.  相似文献   

9.
Let G =(V_1,V_2,E) be a balanced bipartite graph with2 n vertices.The bipartite binding number of G,denoted by B(G),is defined to be n if G =K_n and min i∈{1,2}|N(S)|n min |N(S)|/|S|otherwise.We call G bipancyclic if it contains a cycle of every even length m for 4 ≤ m ≤ 2n.A theorem showed that if G is a balanced bipartite graph with 2n vertices,B(G) 3 / 2 and n 139,then G is bipancyclic.This paper generalizes the conclusion as follows:Let 0 c 3 / 2 and G be a 2-colmected balanced bipartite graph with 2n(n is large enough) vertices such that B(G) c and δ(G)(2-c)n/(3-c)+2/3.Then G is bipancyclic.  相似文献   

10.
In Zhang's recent works,a second-order Mehrotra-type predictor-corrector algorithm for linear optimization was extended to semidefinite optimization and derived that the algorithm for semidefinite optimization had O(n~(3/2)log(X~0)~T·S~0/ε) iteration complexity based on the NT direction as Newton search direction. In this paper, we extend the second-order Mehrotra-type predictor-corrector algorithm for linear optimization to semidefinite optimization and discuss the polynomial convergence of the algorithm by modifying the corrector direction and new iterates. It is proved that the iteration complexity is reduced to O(n~(3/2)log(X~0)~T·S~0/ε), which coincides with the currently best iteration bound of Mehrotra-type predictor-corrector algorithm for semidefinite optimization.  相似文献   

11.
The effects of sericite particle size, rotation speed, and leaching temperature on sericite dissolution and copper extraction in a chalcopyrite bioleaching system were examined. Finer particles, appropriate temperature and rotation speed for Acidithiobacillus ferrooxidans resulted in a higher Al3+ dissolution concentration. The Al3+ dissolution concentration reached its highest concentration of 38.66 mg/L after 48-d leaching when the sericite particle size, temperature, and rotation speed were -43 μm, 30℃, and 160 r/min, respectively. Meanwhile, the sericite particle size, rotation speed, and temperature can affect copper extraction. The copper extraction rate is higher when the sericite particle size is finer. An appropriately high temperature is favorable for copper leaching. The dissolution of sericite fitted the shrinking core model, 1-(2/3)α-(1-α)2/3=k1t, which indicates that internal diffusion is the decision step controlling the overall reaction rate in the leaching process. Scanning electron microscopy analysis showed small precipitates covered on the surface of sericite after leaching, which increased the diffusion resistance of the leaching solution and dissolved ions.  相似文献   

12.
Metal Sm has been widely used in making Al-Sm magnet alloy materials. Conventional distillation technology to produce Sm has the disadvantages of low productivity, high costs, and pollution generation. The objective of this study was to develop a molten salt electrolyte system to produce Al-Sm alloy directly, with focus on the electrical conductivity and optimal operating conditions to minimize the energy consumption. The continuously varying cell constant (CVCC) technique was used to measure the conductivity for the Na3AlF6-AlF3-LiF-MgF2-Al2O3-Sm2O3 electrolysis medium in the temperature range from 905 to 1055℃. The temperature (t) and the addition of Al2O3 (W(Al2O3)), Sm2O3 (W(Sm2O3)), and a combination of Al2O3 and Sm2O3 into the basic fluoride system were examined with respect to their effects on the conductivity (κ) and activation energy. The experimental results showed that the molten electrolyte conductivity increases with increasing temperature (t) and decreases with the addition of Al2O3 or Sm2O3 or both. We concluded that the optimal operation conditions for Al-Sm intermediate alloy production in the Na3AlF6-AlF3-LiF-MgF2-Al2O3-Sm2O3 system are W(Al2O3) + W(Sm2O3)=3wt%, W(Al2O3):W(Sm2O3)=7:3, and a temperature of 965 to 995℃, which results in satisfactory conductivity, low fluoride evaporation losses, and low energy consumption.  相似文献   

13.
Let F_q stand for the finite field of odd characteristic p with q elements(q=p~n,n∈N)and F_q~* denote the set of all the nonzero elements of F_q.In this paper,by using the augmented degree matrix and the result given by Cao,we obtain a formula for the number of rational points of the following equation over F_q:f(x _1,x _2,...,x _n)=(a_1 x_1 x_2~d+a_2 x_2 x_3~d...+a_(n-1)x_(n-1)x_n~d+a_n x_n x_1~d)~λ-bx_1~(d1)x_2~d2...x_n~(dn),with a_i,b∈F_q~*,n≥2,λ0 being positive integers,and d,d_i being nonnegative integers for 1≤i n.This technique can be applied to the polynomials of the form h_1~λ=h_2 with λ being positive integer and h_1,h_2∈F_q[x _1,x _2,...,x _n].It extends the results of the Markoff-Hurwitz-type equations.  相似文献   

14.
To resist the fast algebraic attack and fast selective discrete Fourier transform attacks, spectral immunity of a sequence or a Boolean function was proposed. At the same time, an algorithm to compute the spectral immunity of the binary sequence with odd period N was presented, here N is a factor of 2 n ? 1, where n is an integer. The case is more complicated when the period is even. In this paper, we compute linear complexity of every orthogonal sequence of a given sequence using Chan-Games algorithm and k - error linear complexity algorithm. Then, an algorithm for spectral immunity of binary sequence with period N = 2 n is obtained. Furthermore, the time complexity of this algorithm is proved to be O(n).  相似文献   

15.
In this paper, we obtain the factorization of direct production and order of group GL(n, Z m ) in a simple method. Then we generalize some properties of GL(2, Z p ) proposed by Huppert, and prove that the group \(GL\left( {2,{Z_{{z^\lambda }}}} \right)\) is solvable. We also prove that group GL(n, Z p ) is solvable if and only if GL(n, Z p ) is solvable, and list the generators of groups GL(n, Z p ) and SL(n, Z p ). At last, we prove that PSL(2, Z p )(p > 3) and PSL(n, Z p )(n > 3) are simple.  相似文献   

16.
In this paper, we consider the three dimensional compressible viscous magnetohydrodynamic equations(MHD) with the external potential force. We first derive the corresponding non-constant stationary solutions. Next, we show global wellposedness of the initial value problem for the three dimensional compressible viscous magnetohydrodynamic equations, provided that the initial data is close to the stationary solution. Finally, based on the elaborate energy estimates for the nonlinear system and L~p-L~q decay estimates of the linearized equation, we show the optimal convergence rates of the solution in L~q-norm with 2≤q≤6 and its first derivative in L~2-norm when the initial perturbation is bounded in L~p-norm with 1≤p6/5.  相似文献   

17.
Let S={x_1,x_2,...,x_n } be a set of n distinct positive integers and f be an arithmetic function.By(f[S])(resp.( f[S])),we denote the n*n matrix whose i,j entry is Σ[x_i,x_j]|l l∈S f(l) (resp.Σx∈Sf(x)-Σ x_i,|l l∈S f(l)-Σ x_j,|l l∈S f(l)+Σ[x_i,x_j]|l l∈S f(l)).In this paper,we first investigate the structures of the matrices ( f[S]) and( f[S]),then we give the formulae for the determinants of these matrices.These extend the results obtained by Bege in 2011.Finally,we give two examples to demonstrate the validity of our main results.  相似文献   

18.
The influence of Nd addition on the glass-forming ability (GFA), microhardness, and corrosion resistance of Mg60-xCu40Ndx (x=5, 10, 15, 20, and 25, at%) alloys were investigated by differential scanning calorimetry, Vickers-type hardness tests, and electrochemical methods. The results suggest that the GFA and microhardness of the amorphous alloys increase until the Nd content reaches 20at%. The corrosion potential and corrosion current density obtained from the Tafel curves indicate that the Mg35Cu40Nd25 ternary alloy exhibits the best corrosion resistance among the investigated alloys. Notably, nanoporous copper (NPC) was synthesized through a single-step dealloying of Mg60-xCu40Ndx (x=5, 10, 15, 20, and 25) ternary alloys in 0.04 mol·L-1 H2SO4 solution under free corrosion conditions. The influence of dealloying process parameters, such as dealloying time and temperature, on the microstructure of the ribbons was also studied using the surface diffusivity theory. The formation mechanism of dealloyed samples with a multilayered structure was also discussed.  相似文献   

19.
The generalized conditional fault-tolerant embedding is investigated, in which the n-dimensional folded hypercube networks(denoted by FQ_n) acts as the host graph, and the longest fault-free cycle represents the guest graph. Under the conditions looser than that of previous works, it is shown that FQ_n has a cycle with length at least 2~n-2︱F_v︱ when the number of faulty vertices and non-critical edges is at most 2n-4; where ︱F_v︱ is the number of faulty vertices. It provides further theoretical evidence for the fact that FQ_n has excellent node-fault-tolerance and edge-fault-tolerance when used as a topology of large scale computer networks.  相似文献   

20.
In this paper, we show that when Minkowski measure of asymmetry of convex body K of constant width is bigger than α (n-1), K has at least n+1 critical chords, where \(\alpha (n) = \frac{{n + \sqrt {2n(n + 1)} }}{{n + 2}}\).  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号