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.     

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.     

An on-line scheduling problem of parallel machines with common maintenance time

In this paper, the authors consider an on-line scheduling problem of m (m ≥ 3) identical machines with common maintenance time interval and nonresumable availability. For the case that the length of maintenance time interval is larger than the largest processing time of jobs, the authors prove that any on-line algorithm has not a constant competitive ratio. For the case that the length of maintenance time interval is less than or equal to the largest processing time of jobs, the authors prove a lower bound of 3 on the competitive ratio. The authors give an on-line algorithm with competitive ratio $4 - \tfrac{1} {m} $ . In particular, for the case of m = 3, the authors prove the competitive ratio of the on-line algorithm is $\tfrac{{10}} {3} $ .     

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.     

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.     

Further study strong consistency of M estimator in linear model for \tilde \rho-mixing random samples

The strong consistency of M estimators of the regression parameters in linear models for $\tilde \rho$ -mixing random errors under some mild conditions is established, which is an essential improvement over the relevant results in the literature on the moment conditions and mixing errors. Especially, Theorem of Wu (2005) is improved essentially on the moment conditions.     

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 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:

NNMDS codes

C is an[n,k,d]_q linear code over F₉.And s（C）=n+1-k-d is the Singleton defect of C.An MDS code C with s（C）=0 has been studied extensively.Recently,a near-MDS code C with s（C）=s（C^⊥）=1 is studied by many scholars,where C^⊥denotes the dual code of C.This paper concentrates on the linear code C with s（C）=s（C^⊥）=2,and the author calls it an NNMDS code.A series of iff conditions of NNMDS codes are presented.And the author gives an upper bound on length of NNMDS codes.In the last,some examples of NNMDS are given.     

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

Dembowski-Ostrom polynomials from reversed Dickson polynomials

This paper gives a full classification of Dembowski-Ostrom polynomials derived from the compositions of reversed Dickson polynomials and monomials over finite fields of characteristic 2.The authors also classify almost perfect nonlinear functions among all such Dembowski-Ostrom polynomials based on a general result describing when the composition of an arbitrary linearized polynomial and a monomial of the form x~(2+2~α) is almost perfect nonlinear.It turns out that almost perfect nonlinear functions derived from reversed Dickson polynomials are all extended affine equivalent to the well-known Gold functions.     

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.     

Systems Thinking and Higher Education: The Vanguard Method

Reforms to the higher education sector in the UK are only increasing competitive pressures between institutions. Universities are therefore looking to gain competitive advantage over their rivals both in terms of student experience and through administrative efficiency. This paper will present an alternative view of how to transform the way that the higher education system delivers service to students in an environment where ‘student choice’ will be viewed as of paramount importance. The paper will argue that the prevailing ‘command and control’ (Seddon 2003) management logic, which can be found at work throughout both the public and private sectors, is the primary cause of inferior, expensive service. As an alternative, this paper will explore the benefits of working in a systems thinking way, whilst comparing and contrasting this with the flawed thinking which currently prevails. The Vanguard Method (Seddon 2008) is one particular form of systems thinking which has been developed for use in service organisations (Jackson et al. 2008) and which has been applied to many public sector organisations (ODPM 2005; Middleton 2010; Zokaei et al. 2010). Using a case study methodology (Yin 2009), this paper will address what has been learnt by applying the Vanguard Method in an HEI environment for the first time.     

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.     

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.     

The Contribution of Innovation Strategy Development and Implementation in Active Facilitation of Pharmaceutical Front End Innovation

Front end innovation (FEI) represents the first building blocks of product development, but is often regarded as a weak link in innovation literature. Various theorists emphasize that a firm??s innovation can benefit substantially by improving the front end of innovation process (Reinertsen, Res Technol Manag 42:23?C31, 1999; Stevens and Burly, Res Technol Manag 46(2):16?C25, 2003; Verworn et al., R&D Manag 38(1):1?C19, 2008) and that innovation strategies play a central role in optimization of innovation (Clark and Wheelwright, Leading product development, Free Press, New York, 1995; Cottam et al., Eur J Innov Manag 4:88?C94, 2001; Morgan and Berthon, J Manag Stud 45(8):1329?C1353, 2008). Innovation strategies are suggested in literature (e.g. Page, J Prod Innov Manag 10:273?C287, 1993; Oke, J Change Manag 2(3):272?C281, 2002; Adams et al., Int J Manag Rev 8(1):21?C47, 2006; Igartua et al., Res Technol Manag May?CJune:41?C52, 2010) as a facilitator of innovation and may therefore also be targeted at FEI support. The pharmaceutical industry has experienced a worldwide decline in the number of applications for new molecular entities to regulatory agencies since 1997. Therefore high pressures are put on pharmaceutical research and FEI to produce more valid candidates and faster for drug development. This paper explores how pharmaceutical FEI can be actively supported through the development and implementation of an innovation strategy. The empirical field and applied methodology is an action oriented longitudinal case study of a Danish pharmaceutical company. The findings and key learnings from the study are presented as propositions of how innovation strategies can be applied to actively facilitate FEI and with measurable results.     

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.     

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-Line Scheduling on Parallel Machines to Minimize the Makespan

This paper considers two parallel machine scheduling problems,where the objectives of both problems are to minimize the makespan,and the jobs arrive over time,on two uniform machines with speeds 1 and s(s≥1),and on m identical machines,respectively.For the first problem,the authors show that the on-line LPT algorithm has a competitive ratio of(1 +5~(1/2))/2≈1.6180 and the bound is tight.Furthermore,the authors prove that the on-line LPT algorithm has the best possible competitive ratio if s≥1.8020.For the second problem,the authors present a lower bound of(15-(17)~(1/2))/8≈1.3596 on the competitive ratio of any deterministic on-line algorithm.This improves a previous result of 1.3473.     

Pragmatic pluralism—An explication

The focus with which the paper is concerned is the process or task of intervention and, more specifically, the exploration of three (overlapping and interacting) questions pertinent to those who would intervene:

What is to be done?

How shall we decide what to do?

What can guide our actions?

In terms of what we will describe as pragmatic pluralism (our response to these questions), we intend this to be read in several different ways and on several different levels. Illustrating the discussion with examples from a number of different case studies, we will talk about pluralism in each of the following features:

in the use of specific methods/techniques

in the role(s) of the interventionists

in the modes of representation employed

in the use of different rationalities

in the ‘nature’ of the client