Relation between wiener numbers of quasi-hexagonal chains and quasi-polyomino chains

<正> Let Q_n and B_n denote a quasi-polyomino chain with n squares and a quasi-hexagonalchain with n hexagons,respectively.In this paper,the authors establish a relation between the Wienernumbers of Q_n and B_n:W(Q_n)=1/4[W(B_n)-8/3n~3+(14)/3n+3].And the extremal quasi-polyominochains with respect to the Wiener number are determined.Furthermore,several classes of polyominochains with large Wiener numbers are ordered.     

A general iterative method of fixed points for equilibrium problems and optimization problems

The purpose of this paper is to present a general iterative scheme as below:

On LCD Negacyclic Codes over Finite Fields

This paper deduces the structure of LCD negacyclic codes over the finite field Fq, where q is an odd prime power. Based on the study of q-cyclotomic cosets modulo 2 n, the authors obtain the parameters of LCD negacyclic codes of lengths n =(q+1)/2,(q~m-1)/2(q-1)and q~(t·2~τ)-1/2(q~t +1), respectively. And many optimal codes are given. Moreover, the authors research two special classes of MDS LCD negacyclic codes of length n |(q-1)/2 and n |(q+1)2, respectively.     

Asymptotic Normality of Maximum Quasi-Likelihood Estimators in Generalized Linear Models with Fixed Design*

In generalized linear models with fixed design, under the assumption λ↑_n→∞ and other regularity conditions, the asymptotic normality of maximum quasi-likelihood estimator ^↑βn, which is the root of the quasi-likelihood equation with natural link function ∑i=1^n Xi（yi -μ（Xi′β）） = 0, is obtained, where λ↑_n denotes the minimum eigenvalue of ∑i=1^nXiXi′, Xi are bounded p × q regressors, and yi are q × 1 responses.     

Variational discretization for parabolic optimal control problems with control constraints

This paper studies variational discretization for the optimal control problem governed by parabolic equations with control constraints.First of all,the authors derive a priori error estimates where |||u-U₍h|||_L∞（J;L²（Ω））=O（h²+k）.It is much better than a priori error estimates of standard finite element and backward Euler method where |||μ-U_h|||₍L∞（J;L²（Ω））=O（h+ k）.Secondly,the authors obtain a posteriori error estimates of residual type.Finally,the authors present some numerical algorithms for the optimal control problem and do some numerical experiments to illustrate their theoretical results.     

Removable ears of 1-extendable graphs

<正> Carvalho,Lucchesi and Murty proved that any 1-extendable graph G different from K_2and C_(2n)has at least Δ(G)edge-disjoint removable ears,and any brick G distinct from K_4 and■hasat least Δ(G)-2 removable edges,where Δ(G)denotes the maximum degree of G.In this paper,weimprove the lower bounds for numbers of removable ears and removable edges of 1-extendable graphs.It is proved that any 1-extendable graph G different from K_2 and C_(2n)has at least χ′(G)edge-disjointremovable ears,and any brick G distinct from K_4 and■has at least χ′(G)-2 removable edges,whereχ′(G)denotes the edge-chromatic number of G.     

The limit theorem for dependent random variables with applications to autoregression models

This paper studies the autoregression models of order one, in a general time series setting that allows for weakly dependent innovations. Let {X _t } be a linear process defined by X _t = Σ _k=0^∞ψ _k ɛ _t−k , where {ψ _k , k ≥ 0} is a sequence of real numbers and {ɛ _k , k = 0, ±1, ±2, …} is a sequence of random variables. Two results are proved in this paper. In the first result, assuming that {ɛ _k , k ≥ 1} is a sequence of asymptotically linear negative quadrant dependent (ALNQD) random variables, the authors find the limiting distributions of the least squares estimator and the associated regression t statistic. It is interesting that the limiting distributions are similar to the one found in earlier work under the assumption of i.i.d. innovations. In the second result the authors prove that the least squares estimator is not a strong consistency estimator of the autoregressive parameter α when {ɛ _k , k ≥ 1} is a sequence of negatively associated (NA) random variables, and ψ ₀ = 1, ψ _k = 0, k ≥ 1.     

On the single server retrial queue with priority subscribers and server breakdowns

The author concerned the reliability evaluation as well as queueing analysis of M1, M2/G1, G2/1 retrial queues with two different types of primary customers arriving according to independent Poisson flows. In the case of blocking, the first type of customers can be queued whereas the second type of customers must leave the service area but return after some random period of time to try their luck again. The author assumes that the server is unreliable and it has a service-type dependent, exponentially distributed life time as well as a service-type dependent, generally distributed repair time. The necessary and sufficient condition for the system to be stable is investigated. Using a supplementary variable method, the author obtains a steady-state solution for queueing measures, and the transient as well as the steady-state solutions for reliability measures of interest.     

FORCED OSCILLATIONS OF A CLASS OF NONLINEAR DISPERSIVE WAVE EQUATIONS AND THEIR STABILITY

It has been observed in laboratory experiments that when nonlinear dispersive waves are forced periodically from one end of undisturbed stretch of the medium of propagation, the signal eventually becomes temporally periodic at each spatial point. The observation has been confirmed mathematically in the context of the damped Korteweg-de Vries （KdV） equation and the damped Benjamin-Bona-Mahony （BBM） equation. In this paper we intend to show the same results hold for the pure KdV equation （without the damping terms） posed on a finite domain. Consideration is given to the initial-boundary-value problem {ut＋ux＋uux＋uxxx=0, u（x,0）=φ（x）, 0〈x〈1, t〉0,u（0,t）=h（t）, u（1,t） = 0, ux（1,t） = 0, t〉0.It is shown that if the boundary forcing h is periodic with small ampitude, then the small amplitude solution u of （＊） becomes eventually time-periodic. Viewing （＊） （without the initial condition） as an infinite-dimensional dynamical system in the Hilbert space L^2（0, 1）, we also demonstrate that for a given periodic boundary forcing with small amplitude, the system （＊） admits a （locally） unique limit cycle, or forced oscillation, which is locally exponentially stable. A list of open problems are included for the interested readers to conduct further investigations.     

Good p-ary quasic-cyclic codes from cyclic codes over $$\mathbb{F}_ p + v\mathbb{F}_ p$$

This paper introduces a Gray map from（F_p + uF_p）ⁿ to F_p²ⁿ,and describes the relationship between codes over F_p + vF_p and their Gray images.The authors prove that every cyclic code of arbitrary length n over F_p + vF_p is principal,and determine its generator polynomial as well as the number of cyclic codes.Moreover,the authors obtain many best-known p-ary quasic-cyclic codes in terms of their parameters via the Gray map.     

DETERMINING WHETHER A MULTIVARIATE HYPEREXPONENTIAL FUNCTION IS ALGEBRAIC

Let F=C（x1,x2,…,xe,xe＋1,…,xm）, where x1, x2,… , xe are differential variables, and xe＋1,…,xm are shift variables. We show that a hyperexponential function, which is algebraic over F,is of form g（x1, x2, …,xm）q（x1,x2,…,xe）^1/lwe＋1^xe＋1…wm^xm, where g∈ F, q ∈ C（x1,x2,…,xe）,t∈Z^＋ and we＋1,…,wm are roots of unity. Furthermore,we present an algorithm for determining whether a hyperexponential function is algebraic over F.     

Improved Algorithm for Minimum Data Aggregation Time Problem in Wireless Sensor Networks

Wireless sensor networks promise a new paradigm for gathering data via collaboration among sensors spreading over a large geometrical region. Many applications impose delay requirements for data gathering and ask for time-efficient schedules for aggregating sensed data and sending to the data sink. In this paper, the authors study the minimum data aggregation time problem under collision-free transmission model. In each time round, data sent by a sensor reaches all sensors within its transmission range, but a sensor can receive data only when it is the only data that reaches the sensor. The goal is to find the method that schedules data transmission and aggregation at sensors so that the time for all requested data to be sent to the data sink is minimal. The authors propose a 7△/log2｜s｜＋c, new approximation algorithm for this NP-hard problem with guaranteed performance ratio which significantly reduces the current best ratio of △- 1, where S is the set of sensors containing source data, A is the maximal number of sensors within the transmission range of any sensor, and e is a constant. The authors also conduct extensive simulation, the obtained results justify the improvement of proposed algorithm over the existing one.     

On the Laplacian spectral radii of trees with nearly perfect matchings

Let be the set of trees on 2k+1 vertices with nearly perfect matchings, and let be the set of trees on 2k + 2 vertices with perfect matchings. The largest Laplacian spectral radii of trees in and and the corresponding trees were given by Guo (2003). In this paper, the authors determine the second to the sixth largest Laplacian spectral radii among all trees in and give the corresponding trees. This research is supported by the National Natural Science Foundation of China under Grant No. 10331020.     

On algebraic immunity of trace inverse functions on finite fields of characteristic two

The trace inverse functions Tr(λx~(-1)) over the finite field F_(2~n) are a class of very important Boolean functions and are used in many stream ciphers such as SFINKS,RAKAPOSHI,the simple counter stream cipher(SCSC) presented by Si W and Ding C(2012),etc.In order to evaluate the security of those ciphers in resistance to(fast) algebraic attacks,the authors need to characterize algebraic properties of Tr(λx~(-1)).However,currently only some bounds on algebraic immunity of Tr(λx~(-1)) are given in the public literature,for example,the NGG upper bound and the Bayev lower bound,etc.This paper gives the exact value of the algebraic immunity of Tr(λx~(-1)) over F_(2~n),that is,AI(Tr(λx~(-1))) =[2n~(1/2)]- 2,where n ≥ 2,A ∈ F_(2~n) and λ≠ 0,which shows that Dalai's conjecture on the algebraic immunity of Tr(λx~(-1)) is correct.What is more,the authors demonstrate some weak properties of Tr(λx~(-1)) against fast algebraic attacks.     

Large sample and robust properties of $$ \tilde L^2 $$-median

As a competitive depth, $ \tilde L^2 $ \tilde L^2 -depth is modified from L ²-depth. Its induced median is called $ \tilde L^2 $ \tilde L^2 -median. Basic properties of the median and its sample version are provided. Especially, the strong consistency of sample median is gained under weaker condition. Robustness of the median and its sample version is discussed. Besides ease of computation, it is shown that $ \tilde L^2 $ \tilde L^2 -median has both good large-sample and robust properties. Simulation studies are also given to compare the breakdown point of $ \tilde L^2 $ \tilde L^2 -median with that of other depth-induced medians.     

A MacWilliams type identity on Lee weight for linear codes over \mathbb{F}_2 + u\mathbb{F}_2^*

In this paper,the MacWilliams type identity for the m-ply Lee weight enumerator for linear codes over F₂ + uF₂ is determined.As an application of this identity,the authors obtain a MacWilliams type identity on Lee weight for linear codes over F_2^m+ uF_2^m.Furthermore,the authors prove a duality for the m-ply Lee weight distributions by taking advantage of the Krawtchouk polynomials.     

ON THE MEROMORPHIC SOLUTIONS OF LINEAR DIFFERENTIAL EQUATIONS

In this paper, we investigate the growth of meromorphic solutions of higher order linear differential equation f^（k） ＋Ak-1 （z）e^Pk-1^（z） f^（k-1） ＋…＋A1 （z）e^P1（z） f′ ＋Ao（z）e^Po（z） f = 0 （k ≤ 2）, where Pj（z） （j = 0, 1,..., k - 1） are nonconstant polynomials such that deg Pj = n （j = 0, 1,..., k - 1） and Aj（z）（≠ 0） （j = 0, 1,..., k - 1） are meromorphic functions with order p（Aj） 〈 n （j = 0, 1,..., k - 1）.     

ON-LINE SCHEDULING WITH REJECTION ON IDENTICAL PARALLEL MACHINES

In this paper, we consider the on-line scheduling of unit time jobs with rejection on rn identical parallel machines. The objective is to minimize the total completion time of the accepted jobs plus the total penalty of the rejected jobs. We give an on-line algorithm for the problem with competitive ratio 1/2 （2 ＋√3） ≈ 1.86602.     

Some semi-bent functions with polynomial trace form

This paper is devoted to the study of semi-bent functions with several parameters flexible on the finite field F2n.Boolean functions defined on F2n of the form f（r）ab（x） =Trn1（axr（2m-1））＋Tr41（bx（2n-1）/5） and the form g（rs）abcd（x）=Trn1（axr（2m-1））＋Tr41（bx（2n-1）/5）＋Trn1（cx（2m-1）1/2＋1）＋Trn1（dx（2m-1）s＋1） where n = 2m,m = 2（mod 4）,a,c ∈ F2n,and b ∈ F（16）,d ∈ F2,are investigated in constructing new classes of semi-bent functions.Some characteristic sums such as Kloosterman sums and Weil sums are employed to determine whether the above functions are semi-bent or not.     

ON THE ALMOST SURELY ASYMPTOTIC BOUNDS OF A CLASS OF ORNSTEIN-UHLENBECK PROCESSES IN INFINITE DIMENSIONS*

Given a real-valued separable M-type 2 Banach space X with the p-th power of the norm of C2-class, the almost sure asymptotic upper bounds of the solutions of the Ornstein-Uhlenbeck Processes described by the following equations {dz（t）=A（t,z（t））dt＋σ（t,z（t））dW（t）,z（0）=z0∈X,are investigated. This study generalizes the corresponding well-known finite dimensional results of Lapeyre （1989） and Mao （1992）.