Solutions for singular p-Laplacian equation in R n

In this paper, the authors study the existence and non-existence of positive solutions for singular p-Laplacian equation −∆ _p u = f(x)u ^−α + λg(x)u ^β in R ^N ; where N ≥ 3, 1 < p < N, λ > 0, 0 < α < 1, max(p, 2) < β + 1 < p* = \fracN_pN - p \frac{{{N_p}}}{{N - p}} . We prove that there exists a critical value ¤ such that the problem has at least two solutions if 0 < λ < Λ; at least one solution if λ = Λ; and no solutions if λ > Λ.     

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:

Asymptotic normality of wavelet estimator in heteroscedastic model with <Emphasis Type="Italic">α</Emphasis>-mixing errors

Consider heteroscedastic regression model Y _ni = g(x _ni ) + σ _ni ɛ _ni (1 ≤ i ≤ n), where σ _ni ² = f(u _ni ), the design points (x _ni , u _ni ) are known and nonrandom, g(·) and f(·) are unknown functions defined on closed interval [0, 1], and the random errors {ɛ _ni , 1 ≤ i ≤ n} are assumed to have the same distribution as {ξ _i , 1 ≤ i ≤ n}, which is a stationary and α-mixing time series with Eξ _i = 0. Under appropriate conditions, we study asymptotic normality of wavelet estimators of g(·) and f(·). Finite sample behavior of the estimators is investigated via simulations, too.     

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.     

A NEW FAMILY OF TRIVALENT CAYLEY NETWORKS ON WREATH PRODUCT Zm ～ Sn

We propose a new family of interconnection networks （WGn^m） with regular degree three. When the generator set is chosen properly, they are isomorphic to Cayley graphs on the wreath product Zm ～ Sn. In the case of m ≥ 3 and n ≥3, we investigate their different algebraic properties and give a routing algorithm with the diameter upper bounded by [m/2]（3n^2- 8n ＋ 4） - 2n ＋ 1. The connectivity and the optimal fault tolerance of the proposed networks are also derived. In conclusion, we present comparisons of some familiar networks with constant degree 3.     

Weighted <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>-estimates of solutions for damped wave equations with variable coefficients

The authors establish weighted L²-estimates of solutions for the damped wave equations with variable coefficients u _tt ? divA(x)?u+au _t = 0 in ? ⁿ under the assumption a(x) ≥ a₀[1+ρ(x)]^?l, where a₀ > 0, l < 1, ρ(x) is the distance function of the metric g = A^?1(x) on ? ⁿ . The authors show that these weighted L²-estimates are closely related to the geometrical properties of the metric g = A^?1(x).     

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.     

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.     

Semi On-Line Scheduling Problem for Maximizing the Minimum Machine Completion Time on Two Uniform Machines

Ia this paper, we consider a semi on-line version on two uniform machines Mi, i = 1, 2, where the processing time of the largest job is known in advance. A speed si（s1 = 1, 1 ≤s2 = s） is associated with machine Mi. Our goal is to maximize the Cmin. We give a Cmin 2 algorithm and prove its competitive ratio is at most 2s＋1/s＋1 We also claim the Cmin 2 algorithm is tight and the gap between the competitive ratio of Cmin2 algorithm and the optimal value is not greater than 0.555. It is obvious that our result coincides with that given by He for s =1.     

Inverse Center Location Problem on a Tree

This paper discusses the inverse center location problem restricted on a tree with different costs and bound constraints. The authors first show that the problem can be formulated as a series of combinatorial linear programs, then an O（｜V｜^2 log ｜V｜） time algorithm to solve the problem is presented. For the equal cost case, the authors further give an O（｜V｜） time algorithm.     

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.     

ON （∈, ∈ ∨q）-FUZZY FILTERS OF BL-ALGEBRAS

The authors introduce the notions of （∈, ∈ ∨q）-fuzzy Boolean （implicative, positive implicative, and fantastic） filters in BL-algebras, present some characterizations on these generalized fuzzy filters, and describe the relations among these generalized fuzzy filters. It is proved that an （∈, ∈ ∨q）fuzzy filter in a BL-algebra is Boolean （implicative） if and only if it is both positive implicative and fantastic.     

CLT of wavelet estimator in semiparametric model with correlated errors

This paper considers the semiparametric regression model j/j= Xif3+g（U）+Vi（1 < i < n）, where（x_i,t_i） are known design points,/3 is an unknown slope parameter,g（·） is an unknown function, the correlated errors Vi=∑_j=-∞^∞c_je_i-jwith∑_j=-∞^∞|c_j|<∞,and e_i negatively associated random variables.Under appropriate conditions,the authors study the asymptotic normality for wavelet estimators ofβand g（·）.A simulation study is undertaken to investigate finite sample behavior of the estimators.     

Confidence intervals for nonparametric regression functions with missing data: Multiple design case

This paper considers two estimators of θ = g (x) in a nonparametric regression model Y = g (x) + ɛ (x ∈ (0, 1) ^p ) with missing responses: Imputation and inverse probability weighted estimators. Asymptotic normality of the two estimators is established, which is used to construct normal approximation based confidence intervals on θ.     

Testing <Emphasis Type="Italic">k</Emphasis>-edge-connectivity of digraphs

This paper presents an algorithm that tests whether a given degree-bounded digraph is k-edge-connected or ɛ-far from k-edge-connectivity. This is the first testing algorithm for k-edgeconnectivity of digraphs whose running time is independent of the number of vertices and edges. A digraph of n vertices with degree bound d is ɛ-far from k-edge-connectivity if at least ɛdn edges have to be added or deleted to make the digraph k-edge-connected, preserving the degree bound. Given a constant error parameter ɛ and a degree bound d, our algorithm always accepts all k-edge-connected digraphs and rejects all digraphs that is ɛ-far from k-edge-connectivity with probability at least 2/3. It runs in $ O\left( {d\left( {\frac{c} {{\varepsilon d}}} \right)^k log\frac{1} {{\varepsilon d}}O} \right) $ O\left( {d\left( {\frac{c} {{\varepsilon d}}} \right)^k log\frac{1} {{\varepsilon d}}O} \right) (c > 1 is a constant) time when input digraphs are restricted to be (k-1)-edge connected and runs in $ O\left( {d\left( {\frac{{ck}} {{\varepsilon d}}} \right)^k log\frac{k} {{\varepsilon d}}O} \right) $ O\left( {d\left( {\frac{{ck}} {{\varepsilon d}}} \right)^k log\frac{k} {{\varepsilon d}}O} \right) (c > 1 is a constant) time for general digraphs.     

Control and Stabilization of the Rosenau Equation Posed on a Periodic Domain

This paper considers the Rosenau equation with a moving control?t u + ?_t?_x~4 u + ?_xu + u?x u = a(x + ct)h(x, t), c = 0, x ∈ T = R/(2πZ), t 0.The authors prove that the Rosenau equation with a moving control is locally exact controllable in Hs(T) with s ≥ 0 and globally exponential stable in H~s(T) with s ≥ 2. The two results nontrivially extend the work of(Rosier L and Zhang B Y, 2013) from the BBM equation to the Rosenau equation.     

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.     

PHASE TRANSITION IN SEQUENCE UNIQUE RECONSTRUCTION

In this paper, sequence unique reconstruction refers to the property that a sequence is uniquely reconstructable from all its K-tuples. We propose and study the phase transition behavior of the probability P（K） of unique reconstruction with regard to tuple size K in random sequences （iid model）. Based on Monte Carlo experiments, artificial proteins generated from lid model exhibit a phase transition when P（K） abruptly jumps from a low value phase （e.g. 〈 0.1） to a high value phase （e.g. 〉 0.9）. With a generalization to any alphabet, we prove that for a random sequence of length L, as L is large enough, P（K） undergoes a sharp phase transition when p ≤ 0.1015 where p = P （two random letters match）. Besides, formulas are derived to estimate the transition points, which may be of practical use in sequencing DNA by hybridization. Concluded from our study, most proteins do not deviate greatly from random sequences in the sense of sequence unique reconstruction, while there are some ＂stubborn＂ proteins which only become uniquely reconstructable at a very large K and probably have biological implications.     

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）.     

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.