Analytic doubly periodic wave patterns for the integrable discrete nonlinear Schrödinger (Ablowitz–Ladik) model

We derive two new solutions in terms of elliptic functions, one for the dark and one for the bright soliton regime, for the semi-discrete cubic nonlinear Schrödinger equation of Ablowitz and Ladik. When considered in the complex plane, these two solutions are identical. In the continuum limit, they reduce to known elliptic function solutions. In the long wave limit, the dark one reduces to the collision of two discrete dark solitons, and the bright one to a discrete breather.     

Several parameters of generalized Mycielskians

The generalized Mycielskians (also known as cones over graphs) are the natural generalization of the Mycielski graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer m?0, one can transform G into a new graph μ_m(G), the generalized Mycielskian of G. This paper investigates circular clique number, total domination number, open packing number, fractional open packing number, vertex cover number, determinant, spectrum, and biclique partition number of μ_m(G).     

Simulation of a turbulent premixed open V-shaped flame using contour advection with surgery

Despite its capability of high spatial resolution, simulation of turbulent flows with traditional Lagrangian (front tracking) scheme is often discouraged by numerical instability caused by clustering of marker nodes and topological changes of fronts. Contour advection surgery (CAS), being a robust front tracking scheme, can limit the growth of front complexity during simulation without jeopardizing accuracy or efficiency. This allows it to open up an advantage over traditional front-tracking schemes. It has already been demonstrated that CAS, with incorporation of the reaction sheet model, can accurately simulate the propagation and advection of a turbulent premixed V-shaped flame. In this study, it is further tested with 10 values of vortex circulation. A range of upstream turbulence levels of 1.8–19.8% was obtained. Results indicate that upstream turbulence increase the average flame length, flame zone area and the overall burning rate. Flame surface density Σ was also estimated. Maximum values of Σ obtained lie in the range 0.1–1.4 mm⁻¹. Skewness towards the burnt region was observed in all profiles of Σ. Similar to results from laboratory experiments, it was found that Σ values decreases with upstream turbulence. From this study, the ability of CAS to cope with intense turbulence is demonstrated and a better quantitative understanding on the scheme has also been acquired.     

Some new nonlinear inequalities and applications to boundary value problems

In this paper, we establish some new nonlinear integral inequalities of the Gronwall–Bellman–Ou-Iang-type in two variables. These on the one hand generalizes and on the other hand furnish a handy tool for the study of qualitative as well as quantitative properties of solutions of differential equations. We illustrate this by applying our new results to certain boundary value problem.     

A note on acyclic domination number in graphs of diameter two

A subset S of the vertex set of a graph G is called acyclic if the subgraph it induces in G contains no cycles. S is called an acyclic dominating set of G if it is both acyclic and dominating. The minimum cardinality of an acyclic dominating set, denoted by γ_a(G), is called the acyclic domination number of G. Hedetniemi et al. [Acyclic domination, Discrete Math. 222 (2000) 151-165] introduced the concept of acyclic domination and posed the following open problem: if δ(G) is the minimum degree of G, is γ_a(G)?δ(G) for any graph whose diameter is two? In this paper, we provide a negative answer to this question by showing that for any positive k, there is a graph G with diameter two such that γ_a(G)-δ(G)?k.     

A Successful Implementation of Locating Passive Cooling Facilities: The Case of Northern Thailand

This paper reports the actual implementation of a location-allocation study, which is one aspect of the overall Passive Cooling (Thailand) Project conducted in Northern Thailand since 1985. The goal has been to generate decision supports for ‘optimal’ placements of cooling facilities and the assignment of sites to these facilities as part of the post-harvest handling-chain operation of agricultural products. The basic questions addressed in this work are the issues of how many facilities to set up and where to locate them for maximum utility. Our selected approach is to use discrete location-allocation modelling, as, among other reasons, the problem at hand has a most natural network setting. Direct methods as well as efficient heuristics are examined, and sample numerical results are reported as illustrations of the continual implementation.     

Towards Strong Duality in Integer Programming

We consider in this paper the Lagrangian dual method for solving general integer programming. New properties of Lagrangian duality are derived by a means of perturbation analysis. In particular, a necessary and sufficient condition for a primal optimal solution to be generated by the Lagrangian relaxation is obtained. The solution properties of Lagrangian relaxation problem are studied systematically. To overcome the difficulties caused by duality gap between the primal problem and the dual problem, we introduce an equivalent reformulation for the primal problem via applying a pth power to the constraints. We prove that this reformulation possesses an asymptotic strong duality property. Primal feasibility and primal optimality of the Lagrangian relaxation problems can be achieved in this reformulation when the parameter p is larger than a threshold value, thus ensuring the existence of an optimal primal-dual pair. We further show that duality gap for this partial pth power reformulation is a strictly decreasing function of p in the case of a single constraint. Dedicated to Professor Alex Rubinov on the occasion of his 65th birthday. Research supported by the Research Grants Council of Hong Kong under Grant CUHK 4214/01E, and the National Natural Science Foundation of China under Grants 79970107 and 10571116.     

Profile empirical likelihood for parametric and semiparametric models

This paper introduces a profile empirical likelihood and a profile conditionally empirical likelihood to estimate the parameter of interest in the presence of nuisance parameters respectively for the parametric and semiparametric models. It is proven that these methods propose some efficient estimators of parameters of interest in the sense of least-favorable efficiency. Particularly, for the decomposable semiparametric models, an explicit representation for the estimator of parameter of interest is derived from the proposed nonparametric method. These new estimations are different from and more efficient than the existing estimations. Some examples and simulation studies are given to illustrate the theoretical results. The first author is supported by NNSF projects (10371059 and 10171051) of China. The second author is supported by a grant from The Research Grants Council of the Hong Kong Special Administrative Region, China (#HKU7060/04P). The third author is supported by the University Research Committee of the University of Hong Kong and a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. HKU7323/01M).     

Partially Strictly Monotone and Nonlinear Penalty Functions for Constrained Mathematical Programs

We introduce the concept of partially strictly monotone functions and apply it to construct a class of nonlinear penalty functions for a constrained optimization problem. This class of nonlinear penalty functions includes some (nonlinear) penalty functions currently used in the literature as special cases. Assuming that the perturbation function is lower semi-continuous, we prove that the sequence of optimal values of nonlinear penalty problems converges to that of the original constrained optimization problem. First-order and second-order necessary optimality conditions of nonlinear penalty problems are derived by converting the optimality of penalty problems into that of a smooth constrained vector optimization problem. This approach allows for a concise derivation of optimality conditions of nonlinear penalty problems. Finally, we prove that each limit point of the second-order stationary points of the nonlinear penalty problems is a second-order stationary point of the original constrained optimization problem.     

<Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript> linear interpolator for missing values in time series

We propose a minimum mean absolute error linear interpolator (MMAELI), based on theL ₁ approach. A linear functional of the observed time series due to non-normal innovations is derived. The solution equation for the coefficients of this linear functional is established in terms of the innovation series. It is found that information implied in the innovation series is useful for the interpolation of missing values. The MMAELIs of the AR(1) model with innovations following mixed normal andt distributions are studied in detail. The MMAELI also approximates the minimum mean squared error linear interpolator (MMSELI) well in mean squared error but outperforms the MMSELI in mean absolute error. An application to a real series is presented. Extensions to the general ARMA model and other time series models are discussed. This research was supported by a CityU Research Grant and Natural Science Foundation of China.