The Homotopy Perturbation Method and the Adomian Decomposition Method for the Nonlinear Coupled Equations

In this paper, we have used the homotopy perturbation and the Adomian decomposition methods to study the nonlinear coupled Kortewge-de Vries and shallow water equations. The main objective of this paper is to propose alternative methods of solutions, which do not require small parameters and avoid linearization and physical unrealistic assumptions. The proposed methods give more general exact solutions without much extra effort and the results reveal that the homotopy perturbation and the Adomian decomposition methods are very effective, convenient and quite accurate to the systems of coupled nonlinear equations.     

非线性扩散耦合系统的广义解的最优判据

This paper studies coupled nonlinear diffusion equations with more general nonlinearities, subject to homogeneous Neumann boundary conditions. The necessary and sufficient conditions are obtained for the existence of generalized solutions of the system, which extend the known results for nonlinear diffusion systems with more special nonlinearities.     

Global Existence and Exponential Decay for a Nonlinear Viscoelastic Equation with Nonlinear Damping

In this paper we investigate a nonlinear viscoelastic equation with nonlinear damping. Global existence of weak solutions and uniform decay of the energy have been established. The Faedo-Galerkin method and the perturbed energy method are employed to obtain the results.     

EXPONENTIAL STABILITY FOR NONLINEAR HYBRID STOCHASTIC PANTOGRAPH EQUATIONS AND NUMERICAL APPROXIMATION

The paper develops exponential stability of the analytic solution and convergence in probability of the numerical method for highly nonlinear hybrid stochastic pantograph equation. The classical linear growth condition is replaced by polynomial growth conditions, under which there exists a unique global solution and the solution is almost surely exponentially stable. On the basis of a series of lemmas, the paper establishes a new criterion on convergence in probability of the Euler-Maruyama approximate solution. The criterion is very general so that many highly nonlinear stochastic pantograph equations can obey these conditions. A highly nonlinear example is provided to illustrate the main theory.     

TESTING OF CORRELATION AND HETEROSCEDASTICITY IN NONLINEAR REGRESSION MODELS WITH DBL（p,q, 1） RANDOM ERRORS

Chaos theory has taught us that a system which has both nonlinearity and random input will most likely produce irregular data. If random errors are irregular data, then random error process will raise nonlinearity （Kantz and Schreiber （1997））. Tsai （1986） introduced a composite test for autocorrelation and heteroscedasticity in linear models with AR（1） errors. Liu （2003） introduced a composite test for correlation and heteroscedasticity in nonlinear models with DBL（p, 0, 1） errors. Therefore, the important problems in regression model axe detections of bilinearity, correlation and heteroscedasticity. In this article, the authors discuss more general case of nonlinear models with DBL（p, q, 1） random errors by score test. Several statistics for the test of bilinearity, correlation, and heteroscedasticity are obtained, and expressed in simple matrix formulas. The results of regression models with linear errors are extended to those with bilinear errors. The simulation study is carried out to investigate the powers of the test statistics. All results of this article extend and develop results of Tsai （1986）, Wei, et al （1995）, and Liu, et al （2003）.     

MIXED INTERIOR PENALTY DISCONTINUOUS GALERKIN METHODS FOR ONE-DIMENSIONAL FULLY NONLINEAR SECOND ORDER ELLIPTIC AND PARABOLIC EQUATIONS

This paper is concerned with developing accurate and efficient numerical methods for one-dimensional fully nonlinear second order elliptic and parabolic partial differential equations （PDEs）. In the paper we present a general framework for constructing high order interior penalty discontinuous Galerkin （IP-DG） methods for approximating viscosity solutions of these fully nonlinear PDEs. In order to capture discontinuities of the second order derivative uxx of the solution u, three independent functions p1,p2 and p3 are introduced to represent numerical derivatives using various one-sided limits. The proposed DG frame- work, which is based on a nonstandard mixed formulation of the underlying PDE, embeds a nonlinear problem into a mostly linear system of equations where the nonlinearity has been modified to include multiple values of the second order derivative uxz. The proposed framework extends a companion finite difference framework developed by the authors in [9] and allows for the approximation of fully nonlinear PDEs using high order polynomials and non-uniform meshes. In addition to the nonstandard mixed formulation setting, another main idea is to replace the fully nonlinear differential operator by a numerical operator which is consistent with the differential operator and satisfies certain monotonicity （called g-monotonicity） properties. To ensure such a g-monotonicity, the crux of the construction is to introduce the numerical moment, which plays a critical role in the proposed DG frame- work. The g-monotonicity gives the DG methods the ability to select the mathematically ＂correct＂ solution （i.e., the viscosity solution） among all possible solutions. Moreover, the g-monotonicity allows for the possible development of more efficient nonlinear solvers as the special nonlinearity of the algebraic systems can be explored to decouple the equations. This paper also presents and analyzes numerical results for several numerical test problems which are used to guage the accuracy and efficiency of the proposed DG methods.     

A Nonlinear Diffusion System with Coupled Nonlinear Boundary Flux

This paper studies a nonlinear diffusion system with coupled nonlinear boundary flux and two kinds of inner sources （positive for the first and negative for the second）, where the four nonlinear mechanisms are described by eight nonlinear parameters. The critical exponent of the system is determined by a complete classification of the eight nonlinear parameters, which is represented via the characteristic algebraic system introduced to the problem.     

New Monotonicity Formulae for Semi-linear Elliptic and Parabolic Systems

The authors establish a general monotonicity formula for the following elliptic system
△ui＋fi（x,ui,…,um）=0 in Ω,
where Ω belong to belong to R^n is a regular domain, （fi（x, u1,... ,um）） = △↓F（x,→↑u）, F（x,→↑u ） is a given smooth function of x ∈ R^n and →↑u = （u1,…,um） ∈ R^m. The system comes from understanding the stationary case of Ginzburg-Landau model. A new monotonicity formula is also set up for the following parabolic system
δtui-△ui-fi（x,ui,…,um）=0 in（ti,t2）×R^n,
where t1 〈 t2 are two constants, （fi（x,→↑u ） is given as above. The new monotonicity formulae are focused more attention on the monotonicity of nonlinear terms. The new point of the results is that an index β is introduced to measure the monotonicity of the nonlinear terms in the problems. The index β in the study of monotonieity formulae is useful in understanding the behavior of blow-up sequences of solutions. Another new feature is that the previous monotonicity formulae are extended to nonhomogeneous nonlinearities. As applications, the Ginzburg-Landau model and some different generalizations to the free boundary problems are studied.     

Confidence Intervals of Variance Functions in Generalized Linear Model

In this paper we introduce an appealing nonparametric method for estimating variance and conditional variance functions in generalized linear models （GLMs）, when designs are fixed points and random variables respectively, Bias-corrected confidence bands are proposed for the （conditional） variance by local linear smoothers. Nonparametric techniques are developed in deriving the bias-corrected confidence intervals of the （conditional） variance. The asymptotic distribution of the proposed estimator is established and show that the bias-corrected confidence bands asymptotically have the correct coverage properties. A small simulation is performed when unknown regression parameter is estimated by nonparametric quasi-likelihood. The results are also applicable to nonparamctric autoregressive times series model with heteroscedastic conditional variance.     

A NEW SELF-ADAPTIVE ITERATIVE METHOD FOR GENERAL MIXED QUASI VARIATIONAL INEQUALITIES

The general mixed quasi variational inequality containing a nonlinear term φ is a useful and an important generalization of variational inequalities. The projection method can not be applied to solve this problem due to the presence of nonlinear term. It is well known that the variational inequalities involving the nonlinear term φ are equivalent to the fixed point problems and resolvent equations. In this article, the authors use these alternative equivalent formulations to suggest and analyze a new self-adaptive iterative method for solving general mixed quasi variational inequalities. Global convergence of the new method is proved. An example is given to illustrate the efficiency of the proposed method.     

共同基金和无风险资产投资的最优策略

利用均值-方差模型,分析了非线性交易成本下的共同基金与无风险资产投资组合的有效边界和在一般的效用函数下讨论了投资者的最优投资策略.     

A heuristic to generate rank-1 GMI cuts

Gomory mixed-integer (GMI) cuts are among the most effective cutting planes for general mixed-integer programs (MIP). They are traditionally generated from an optimal basis of a linear programming (LP) relaxation of a MIP. In this paper we propose a heuristic to generate useful GMI cuts from additional bases of the initial LP relaxation. The cuts we generate have rank one, i.e., they do not use previously generated GMI cuts. We demonstrate that for problems in MIPLIB 3.0 and MIPLIB 2003, the cuts we generate form an important subclass of all rank-1 mixed-integer rounding cuts. Further, we use our heuristic to generate globally valid rank-1 GMI cuts at nodes of a branch-and-cut tree and use these cuts to solve a difficult problem from MIPLIB 2003, namely timtab2, without using problem-specific cuts.     

������Ϣ���Ŀ�ѹ����

??hen the distribution of random variable V_1,V_2 and V_3 composes an I\times J\times K contingency table, this paper research the collapsibility of entropy, and present necessary and sufficient conditions for simple collapsibility and strong collapsibility of mutual information by the research on collapsibility of entropy, which are considered under the condition of sub-independence.     

Collapsibility of Mutual Information

hen the distribution of random variable V_1,V_2 and V_3 composes an I\times J\times K contingency table, this paper research the collapsibility of entropy, and present necessary and sufficient conditions for simple collapsibility and strong collapsibility of mutual information by the research on collapsibility of entropy, which are considered under the condition of sub-independence.     

基金契约中代理问题存在性研究

基金投资与基金经理之间的关系是一种委托一代理关系，这种委托一代理关系集中体现在基金契约中。为了激励基金经理能按照最大化基金投资的效用行动，减少代理问题，人们设计了各种类型的基金契约。本以一个最常用的线性基金契约为例，讨论分析了其中代理问题的存在性。     

Entanglement measures based on observable correlations

By regarding quantum states as communication channels and using observable correlations quantitatively expressed by mutual information, we introduce a hierarchy of entanglement measures that includes the entanglement of formation as a particular instance. We compare the maximal and minimal measures and indicate the conceptual advantages of the minimal measure over the entanglement of formation. We reveal a curious feature of the entanglement of formation by showing that it can exceed the quantum mutual information, which is usually regarded as a theoretical measure of total correlations. This places the entanglement of formation in a broader scenario, highlights its peculiarity in relation to pure-state ensembles, and introduces a competing definition with intrinsic informational significance. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 155, No. 3, pp. 453–462, June, 2008.     

Volterra泛函微分方程一般线性方法的稳定性

本文研究Volterra泛函微分方程(k,p,q)-代数稳定的一般线性方法的稳定性,获得了该类方法的一系列新的稳定性结果.     

Complexity of networks II: The set complexity of edge‐colored graphs

We previously introduced the concept of “set‐complexity,” based on a context‐dependent measure of information, and used this concept to describe the complexity of gene interaction networks. In a previous paper of this series we analyzed the set‐complexity of binary graphs. Here, we extend this analysis to graphs with multicolored edges that more closely match biological structures like the gene interaction networks. All highly complex graphs by this measure exhibit a modular structure. A principal result of this work is that for the most complex graphs of a given size the number of edge colors is equal to the number of “modules” of the graph. Complete multipartite graphs (CMGs) are defined and analyzed. The relation between complexity and structure of these graphs is examined in detail. We establish that the mutual information between any two nodes in a CMG can be fully expressed in terms of entropy, and present an explicit expression for the set complexity of CMGs (Theorem 3). An algorithm for generating highly complex graphs from CMGs is described. We establish several theorems relating these concepts and connecting complex graphs with a variety of practical network properties. In exploring the relation between symmetry and complexity we use the idea of a similarity matrix and its spectrum for highly complex graphs. © 2012 Wiley Periodicals, Inc. Complexity, 2012     

A Practical Protocol for Advantage Distillation and Information Reconciliation

Information-theoretic secret key agreement generally consists of three phases, namely, advantage distillation information reconciliation and privacy amplification. Advantage distillation is needed in the case when two legitimate users, Alice and Bob, start in a situation which is inferior to that of the adversary Eve. The aim for them is to gain advantage over Eve in terms of mutual information between each other. Information reconciliation enables Alice and Bob to arrive at a common string by error correction techniques. Finally they distill a highly secret string from the common string in the privacy amplification phase. For the scenario where Alice and Bob as well as Eve have access to the output of a binary symmetric source by means of (three) binary symmetric channels, there are several advantage distillation and information reconciliation protocols proposed.In this paper, we present a general protocol to implement both advantage distillation and information reconciliation. Simulation results are compared with known protocols. A connection between our protocol and the known protocols is given.     

群决策中语言信息与其他4种偏好信息的一致化方法

研究语言信息与其他4种偏好信息(偏好次序,效用值,互反判断矩阵,互补判断矩阵)之间的相互转换问题.首先,根据各种偏好信息的实际意义,给出语言信息与他们之间的转换公式,并从理论上证明转换公式的合理性;其次,证明了若语言判断矩阵具有完全一致性,转换后的互反判断矩阵和互补判断矩阵也具有完全一致性;最后用实例验证了转换公式的有效性.