Some functions with low differential uniformity

We study the functions with low differential uniformity, and concentrates mainly on the properties of perfect nonlinear (PN) functions, including the properties of the derivative of the components of those functions. Some sufficient and necessary conditions have been explored to judge when a function is a PN function. These conditions may be useful in constructing new PN functions. We also construct some functions with differential 4-uniformity that have rarely been studied in the literature. Some of the constructed functions with differential 4-uniformity have high nonlinearity as well. Finally, a class of functions with differential 4-uniformity which are not extended affine equivalent to any power functions are constructed.     

Generalized ridge estimation of a semiparametric regression model

We considered the following semiparametric regres-sion model yi = X iT β+ s ( t i ) + ei (i =1,2,,n). First,the general-ized ridge estimators of both parameters and non-parameters are given without a restrained design matrix. Second,the generalized ridge estimator will be compared with the penalized least squares estimator under a mean squares error,and some conditions in which the former excels the latter are given. Finally,the validity and feasibility of the method is illustrated by a simulation example.     

Congruence permutable Kleene-Stone algebras

A Kleene-Stone algebra is a bounded distributive lattice with two unary operations that make it a Kleene and a Stone algebra. In this paper, we study the properties of the prime ideals in a Kleene-Stone algebra and characterize the class of Kleene-Stone algebras that are congruence permutable by means of the dual space of a Kleene-Stone algebra and then show that a finite Kleene-Stone algebra is congruence permutable if and only if it is isomorphic to a direct product of finitely many simple algebras.     

A dynamic ID-based authenticated group key exchange protocol without pairings

So far, most of the proposed group key exchange (GKE) protocols do not consider the attack when the adversary reveals the parties’ephemeral private keys without their long-term private keys, so these GKE protocols are insecure on this attack. In this paper, for resisting above attack, we propose a dynamic authenticated group key exchange (AGKE) protocol in the ID-based setting. Different from previous ID-based protocols, our protocol does not utilize bilinear pairings, which makes it more efficient. At last, we analyze the security of the protocol in the eCK (enhanced Canetti-Krawczyk) security model.     

A line search filter secant method for nonlinear equality constrained optimization

<正> This paper formulates and analyzes a line search method for general nonlinear equalityconstrained optimization based on filter methods for step acceptance and secant methods for searchdirection.The feature of the new algorithm is that the secant algorithm is used to produce a searchdirection,a backtracking line search procedure is used to generate step size,some filtered rules areused to determine step acceptance,second order correction technique is used to reduce infeasibility andovercome the Maratos effect.Global convergence properties of this method are analyzed:under mildassumptions it is showed that every limit point of the sequence of iterates generated by the algorithmis feasible,and that there exists at least one limit point that is a stationary point for the problem.Moreover,it is also established that the Maratos effect can be overcome in our new approach by addingsecond order correction steps so that fast local superlinear convergence to a second order sufficient localsolution is achieved.Finally,the results of numerical experiments are reported to show the effectivenessof the line search filter secant method.     

Convergence rates of Markov chain approximation methods for controlled diffusions with stopping

<正> This work is concerned with rates of convergence of numerical methods using Markov chainapproximation for controlled diffusions with stopping (the first exit time from a bounded region).In lieuof considering the associated finite difference schemes for Hamilton-Jacobi-Bellman (HJB) equations,a purely probabilistic approach is used.There is an added difficulty due to the boundary condition,which requires the continuity of the first exit time with respect to the discrete parameter.To prove theconvergence of the algorithm by Markov chain approximation method,a tangency problem might arise.A common approach uses certain conditions to avoid the tangency problem.Here,by modifying thevalue function,it is demonstrated that the tangency problem will not arise in the sense of convergencein probability and in L~1.In addition,controlled diffusions with a discount factor is also treated.     

DISTRIBUTED FINITE-TIME χ-CONSENSUS ALGORITHMS FOR MULTI-AGENT SYSTEMS WITH VARIABLE COUPLING TOPOLOGY

<正> This paper considers finite-time χ-consensus problem for a multi-agent system with firstorderindividual dynamics and switching interaction topologies.Several distributed finite-time consensusrules are constructed for multi-agent dynamics in a unified way with the help of Lyapunovfunction and graph theory as well as homogeneity.Time-invariant non-smooth forms of finite-timeneighbor-based controllers are proposed and a numerical example is shown for illustration.     

Systematic design of single carrier overlap frequency domain equalization

<正> This paper proposes a systematic design method of overlap frequency domain equalization(FDE) for single carrier (SC) transmission without a guard interval (GI).Based on the analysis of signal-to-interference-plus-noise ratio (SINR) of the equalizer output for each symbol,the authors adaptivelydetermine the block of the overlap FDE,where the block is defined as a set of symbols at the equalizeroutput with sufficiently low error rate,for a certain fixed sliding window size,which corresponds toa fast Fourier transform (FFT) window size.The proposed method takes advantage of the fact thatthe utility part of the equalized signal is localized around the center of the FFT window.In addition,the authors also propose to adjust the block size in order to control the computational complexity ofthe equalization per processed sample associating with the average bit error rate (BER) of the system.Simulation results show that the proposed scheme can achieve comparable BER performance to theconventional SC-FDE scheme with sufficient GI insertion for both the coded and uncoded cases withvarious modulation levels,while requiring lower computational complexity compared to the SC overlapFDE transmission with the fixed block.     

Coordinating pricing and inventory decisions in a bounded production system with uncertain yield

Most inventory researches assume that production level can fluctuate arbitrarily. However, large fluctuation of the production level in many firms may be much costly. This paper addresses the coordinating pricing and inventory control problem in a bounded production system with uncertain yield, in which the production level is constrained between a maximum and minimum level in each period and the price can be adjusted dynamically. We show that the optimal policy is the interval base-stock-list-price policy. Also, we study the impact of the production bounds and uncertainty of the yield on the production system. Numerical experiments are also performed to study the impact of parameters on the system.     

The M/PH/1 queue with working vacations and vacation interruption

We study an M/PH/1 queue with phase type working vacation and vacation interruption where the vacation time follows a phase type distribution. The server serves the customers at a lower rate in a vacation period. The server comes back to the regular busy period at a service completion without completing the vacation. Such policy is called vacation interruption. In terms of quasi birth and death process and matrix-geometric solution method, we obtain the stationary queue length distribution. Moreover we obtain the conditional stochastic decomposition structures of queue length and waiting time when the service time distribution in the regular busy period is exponential.