A Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation

The genetic algorithm (GA) described in this paper breeds permutations of transmitters for minimum span frequency assignment. The approach hybridizes a GA with a greedy algorithm, and employs a technique called Generalized Saturation Degree to seed the initial population. Several permutation operators from the GA literature are compared, and results indicate that position based operators are more appropriate for this kind of problem than are order based operators. My offspring versus mid-parent correlation studies on crossovers show Pearson's correlation coefficient to be a reliable predictor of performance in most cases. Results presented herein represent improvements over previously published results.     

The n-order iterative schemes for a nonlinear Kirchhoff-Carrier wave equation associated with the mixed inhomogeneous conditions

In this paper, a high-order iterative scheme is established in order to get a convergent sequence at a rate of order N(N?1) to a local unique weak solution of a nonlinear Kirchhoff-Carrier wave equation associated with mixed nonhomogeneous conditions - the boundary conditions are Dirichlet in one part and Robin in other part of boundary. On the other hand, some numerical results were presented.     

一个推广的具最佳常数的多参数Hardy-Hilbert不等式

引入λ1,λ2,α等多个参数,利用权系数方法,给出了一个推广的具最佳常数的多参数Hardy-Hilbert重级数不等式,并给出其等价形式.     

Theory of superfluidity in a polariton system

We consider the superfluidity properties of a two-dimensional system of polaritons in an optical cavity. Deriving an expression for the effective low-energy action for thermodynamic phase fluctuations, we simultaneously obtain the expression for an analogue of superfluid density in the system in terms of the current-current correlation function and also find the expression for the current operator. We describe the Bogoliubov approximation for a polariton system and calculate the superfluid density. We discuss the Berezinskii-Kosterlitz-Thouless transition in the system under study. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 154, No. 2, pp. 372–384, February, 2008.     

Non-collision periodic solutions of second order singular dynamical systems

We study the existence of non-collision periodic solutions for second order singular dynamical systems. The repulsive case and the attractive case are dealt with using a unified topological approach. The proof is based on a well-known fixed point theorem for completely continuous operators, involving a new type of cone. We do not need to consider so-called strong force conditions. Moreover, for the repulsive case, the critical case can be covered. Recent results in the literature, even in the scalar case, are complemented, generalized and improved.     

Dirichlet级数与连带级数

本文研究了右半平面内解析的Dirichlet级数的增长性,利用凸函数和一致收敛数的性质和几个引理,证明了连带级数的奇异点与原级数的增长性有关,并得到该连带级数的一些性质.     

A molecular orbital explanation for the B?N bond shortening in H3BNH3 on going from the gaseous to the solid state

A simple molecular orbital model has been applied to explanation of the B? N bond shortening in H₃BNH₃ on going from the gaseous to the solid state. In this model, the shortening is attributed to the bond order increase that is caused by the fact that each atom in the crystal experiences different external electrostatic potential to each other and thus the orbital energy level of each atom is changed. To illustrate this model, Effective Fragment Potential (EFP) method has been applied to the system consisting of a H₃BNH₃ molecule and 30 dipole moments whose magnitudes are determined by Lorentz's local field theory. This EFP computation has brought significant B? N bond shortening (1.668 → 1.623 Å), which is about 50% of the actual shortening. The factor of the remaining discrepancy has been analyzed by Morokuma decomposition under EFP and localized orbital analysis. These analyses have revealed that the remaining discrepancy is almost compensated by incorporating the dihydrogen bonds (B? H···H? N) that are formed by the orbital interaction between the bonding orbital of the B? H and the antibonding orbital of the N? H. © 2007 Wiley Periodicals, Inc. Int J Quantum Chem, 2008     

Nonstandard perturbation approximation and travelling wave solutions of nonlinear reaction diffusion equations

This paper deals with the construction of a nonstandard numerical method to compute the travelling wave solutions of nonlinear reaction diffusion equations at high wave speeds. Related general properties are studied using the perturbation approximation. At high wave speed the perturbation parameter approaches to zero and the problem exhibits a multiscale character. That is, there are thin layers where the solution varies rapidly, while away from these layers the solution behaves regularly and varies slowly. Most of the conventional methods fail to capture this layer behavior. Thus, the quest for some new numerical techniques that may handle the travelling wave solutions at high wave speeds earns relevance. In this paper, one such parameter robust nonstandard numerical scheme is constructed, in the sense that its numerical solution converges in the maximum norm to the exact solution uniformly well for all finite wave speeds. To overcome the difficulty due to the nonlinearity, the problem is linearized using the quasilinearization process followed by nonstandard finite difference discretization. An extensive amount of analysis is carried out which uses a suitable decomposition of the error into smooth and singular component and a comparison principle combined with appropriate barrier functions. The error estimates are obtained, which ensures uniform convergence of the method. A set of numerical experiment is carried out in support of the predicted theory that validates computationally the theoretical results. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function

There are infinitely many ways of representing a d.c. function as a difference of convex functions. In this paper we analyze how the computational efficiency of a d.c.optimization algorithm depends on the representation we choose for the objective function, and we address the problem of characterizing and obtaining a computationally optimal representation. We introduce some theoretical concepts which are necessary for this analysis and report some numerical experiments.      

Polynomial function and derivative approximation of Sinc data

Sinc methods consist of a family of one dimensional approximation procedures for approximating nearly every operation of calculus. These approximation procedures are obtainable via operations on Sinc interpolation formulas. Nearly all of these approximations–except that of differentiation–yield exceptional accuracy. The exception: when differentiating a Sinc interpolation formula that gives an approximation over an interval with a finite end-point. In such cases, we obtain poor accuracy in the neighborhood of the finite end-point. In this paper we derive novel polynomial-like procedures for differentiating a function that is known at Sinc points, to obtain an approximation of the derivative of the function that is uniformly accurate on the whole interval, finite or infinite, in the case when the function itself has a derivative on the closed interval.