A note on two classes of Boolean functions with optimal algebraic immunity

Tu and Deng proposed a class of bent functions which are of optimal algebraic immunity under the assumption of a combinatorial conjecture.In this paper,the authors compute the dual of the Tu-Deng functions and then show that they are still of optimal algebraic immunity under the assumption of the same conjecture.For another class of Boolean functions constructed by Tang,et al.which are of optimal algebraic immunity with similar forms to Tu-Deng functions,the authors show that they are not bent functions by using some basic properties of binary complete Kloosterman sums.     

MORSE THEORY UNDER GENERAL BOUNDARY CONDITIONS

Morse inequalities for Morse functions under general boundary conditions were initiallystudied by Morse and Van Schaa(?)k.It is our purpose to present a natural extension of the theorem dueto Morse and Van Schaack with a considerably slmplified proof.     

ROLE OF α-PSEUDO-UNIVEX FUNCTIONS IN VECTOR VARIATIONAL-LIKE INEQUALITY PROBLEMS

In this paper, we introduce a new class of generalized convex function, namely, a-pseudounivex function, by combining the concepts of pseudo-univex and α-invex functions. Further, we establish some relationships between vector variational-like inequality problems and vector optimization problems under the assumptions of α-pseudo-univex functions. Results obtained in this paper present a refinement and improvement of previously known results.     

BLOW-UP SOLUTIONS FOR A CLASS OF NONLINEAR PARABOLIC EQUATIONS WITH MIXED BOUNDARY CONDITIONS

The type of problem under consideration is where D is a smooth bounded domain of RN, q = |(?)u|2. By constructing an auxiliary function and using Hopf's maximum principles on it, existence theorems of blow-up solutions, upper bound of "blow-up time" and upper estimates of "blow-up rate" are given under suitable assumptions on a, b, f, g, σand initial date U0(X). The obtained results are applied to some examples in which a, b, f, g and σare power functions or exponential functions.     

A proximal point algorithm for a system of generalized mixed variational inequalities

This paper introduces and considers a new system of generalized mixed variational inequalities in a Hilbert space,which includes many new and known systems of variational inequalities and generalized variational inequalities as special cases.By using the two concepts of 77-subdifferential andη-proximal mappings of a proper function,the authors try to demonstrate that the system of generalized mixed variational inequalities is equivalence with a fixed point problem.By applying the equivalence, a new and innovativeη-proximal point algorithm for finding approximate solutions of the system of generalized mixed variational inequalities will be suggested and analyzed.The authors also study the convergence analysis of the new iterative method under much weaker conditions.The results can be viewed as a refinement and improvement of the previously known results for variational inequalities.     

Lyapunov Stability Analysis for Incommensurate Nabla Fractional Order Systems

This paper investigates the problem of stability analysis for a class of incommensurate nabla fractional order systems. In particular, both Caputo definition and Riemann-Liouville definition are under consideration. With the convex assumption, several elementary fractional difference inequalities on Lyapunov functions are developed. According to the essential features of nabla fractional calculus,the sufficient conditions are given first to guarantee the asymptotic stability for the incommensura...     

Multiobjective Program with Support Functions Under(G,C, ρ)-Convexity Assumptions

This paper deals with multiobjective programming problems with support functions under(G, C, ρ)-convexity assumptions. Not only sufficient but also necessary optimality conditions for this kind of multiobjective programming problems are established from a viewpoint of(G, C, ρ)-convexity.When the sufficient conditions are utilized, the corresponding duality theorems are derived for general Mond-Weir type dual program.     

A simple smooth exact penalty function for smooth optimization problem

For smooth optimization problem with equality constraints,new continuously differentiate penalty function is derived.It is proved exact in the sense that local optimizers of a nonlinear program are precisely the optimizers of the associated penalty function under some nondegeneracy assumption. It is simple in the sense that the penalty function only includes the objective function and constrained functions,and it doesn’t include their gradients.This is achieved by augmenting the dimension of the program by a variable that controls the weight of the penalty terms.     

Nonparametric approach to identifying NARX systems

<正> This paper considers identification of the nonlinear autoregression with exogenous inputs(NARX system).The growth rate of the nonlinear function is required be not faster than linear withslope less than one.The value of f(·) at any fixed point is recursively estimated by the stochasticapproximation (SA) algorithm with the help of kernel functions.Strong consistency of the estimatesis established under reasonable conditions,which,in particular,imply stability of the system.Thenumerical simulation is consistent with the theoretical analysis.     

The Interaction Programming Problem

1　 IntroductionMany economic systems involve two or multiple planners with differentdecision variablesand different objective functions.In some of these problems,any planners′choice of hisdecision variables may affect the other′s choice of their decision variables.Each planner,in an attempt to optimize his objective function,chooses values for the variables that hecontrols when the other planners′decision variables were given.There are no hierarchyamong all the planners.The values of any …     

MINIMAX PROGRAMMING UNDER GENERALIZED （p, r）-INVEXITY

Minimax programming problems involving generalized （p, r）-invex functions are consid- ered. Parametric sufficient optimality conditions and duality results are established under the aforesaid assumptions on the objective and constraint functions.     

Consensus problem of second-order multi-agent systems with time-varying communication delay and switching topology

Leader-following stationary consensus problem is investigated for the second-order multi-agent systems with timevarying communication delay and switching topology.Based on Lyapunov-Krasovskii functional and Lyapunov-Razumikhin functions respectively,consensus criterions in the form of linear matrix inequality (LMI) are obtained for the system with time-varying communication delays under static interconnection topology converging to the leader’s states.Moreover,the delay-dependent consensus criterion in the form of LMI is also obtained for the system with time-invariant communication delay and switching topologies by constructing Lyapunov-Krasovskii functional.Numerical simulations present the correctness of the results.     

EXISTENCE OF 0-1 UNIVERSAL MINIMAL TOTAL DOMINATING FUNCTIONS

In this paper, we study the existence of 0-1 universal minimal total dominating functions in a graph. We establish a formulation of linear inequalities to characterize universal minimal total dominating functions and show that for a kind of graphs whose adjacent matrices are balanced, the existence of universal minimal total dominating functions coincides with that of 0-1 ones. It is also proved that for general graphs, the problem of testing the existence of 0-1 universal minimal total dominating functions is NP-hard.     

Fault Detection for Uncertain Delta Operator Systems with Two-Channel Packet Dropouts via a Switched Systems Approach

This paper utilizes a switched systems approach to deal with the problem of fault detection(FD) for uncertain delta operator networked control systems(NCSs) with packet dropouts and timevarying delays. Uncertainties exist in the matrices of the systems and are norm-bounded time-varying.Two parts of packet dropouts are considered in this paper: From sensors to controllers, and from controllers to actuators. Two independent Bernoulli distributed white sequences are introduced to account for packet dropouts. Then an FD filter is designed under an arbitrary switching law. Furthermore, the sufficient conditions for the NCSs under consideration that are exponentially stable in the mean-square sense and satisfy H∞ performance are obtained in terms of linear matrix inequalities(LMIs), multiple Lyapunov functions(MLF) and average dwell-time(ADT) approach. The explicit expression of the desired filter parameters is given. Finally, a numerical example verifies the effectiveness of the proposed method.     

A Class of Plurisubharmonic Functions of Positively Homogeneous of Order ρ

1　 IntroductionThe surjectivity of convolution operator and in particular of linear partial differrentialoperators with constant coefficients is often equivalent to a problem of division in anappropriate space of entire functions.Those problems often have a tight connection withthe study of plurisubharmonic functions and weight system.In this paper we construct aclass of plusisubharmonic functions of positively homogeneous oforderρ and some weightsystem,and discuss their properties.These res…     

ORGANIZATIONAL LEARNING AND VENDOR SUPPORT QUALITY BY THE USAGE OF APPLICATION SOFTWARE PACKAGES： A STUDY OF ASIAN ENTREPRENEURS

In this paper we study how organizational learning impacts organizational behavior, and howvendor support quality enhances product adoption and usage behavior.These constructs were verifiedusing Application Software Packages(ASP)-a prewritten, precoded, commercially available set ofprograms that eliminates the need for individuals or organizations to write their own softwareprograms for certain functions. The relationship between ASP usage, usage outcomes and useprocesses were also investigated. Two hundred and ninety-five Chinese, Indian, and Malayentrepreneurships were studied. It was found that usage outcome strongly determines usage, while useprocess has only an indirect relationship (via outcome) on usage. The impact of organizational learningand vendor service quality on usage, usage outcome, and use process were robust. Theoretical andpractical implications of the research are discussed.     

A Combinatorial Condition and Boolean Functions with Optimal Algebraic Immunity

This paper first proposes an infinite class of 2k-variable Boolean functions with high nonlinearity and high algebraic degree. Then an infinite class of balanced Boolean functions are proposed by modifying the above Boolean functions. This class of balanced Boolean functions have optimal algebraic degree and high nonlinearity. Both classes have optimal algebraic immunity based on a general combinatorial conjecture.     

Fractal Solitons,Arbitrary Function Solutions,Exact Periodic Wave and Breathers for a Nonlinear Partial Differential Equation by Using Bilinear Neural Network Method

This paper extends a method, called bilinear neural network method(BNNM), to solve exact solutions to nonlinear partial differential equation. New, test functions are constructed by using this method. These test functions are composed of specific activation functions of single-layer model,specific activation functions of "2-2" model and arbitrary functions of "2-2-3" model. By means of the BNNM, nineteen sets of exact analytical solutions and twenty-four arbitrary function solutions of the dimensionally reduced p-gB KP equation are obtained via symbolic computation with the help of Maple. The fractal solitons waves are obtained by choosing appropriate values and the self-similar characteristics of these waves are observed by reducing the observation range and amplifying the partial picture. By giving a specific activation function in the single layer neural network model, exact periodic waves and breathers are obtained. Via various three-dimensional plots, contour plots and density plots,the evolution characteristic of these waves are exhibited.     

Enhanced self-adaptive evolutionary algorithm for numerical optimization

There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm (ESEA) to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.     

Boolean Functions with Four-Valued Walsh Spectra

Three classes of Boolean functions with four-valued Walsh spectra are presented and their Walsh spectrum distributions are determined. They are derived from Bent functions of the MaioranaMc Farland and Dillon PS ap types and of the monomial form Tr2m1(λxr(2m-1)) by complementing the values of the Bent functions at two points.