Asymptotic formulations of the eigenvalues and eigenfunctions for a boundary value problem

In this work, a discontinuous boundary‐value problem with retarded argument that contains a spectral parameter in the transmission conditions at the point of discontinuity is investigated. We obtained asymptotic formulas for the eigenvalues and eigenfunctions. Copyright © 2012 John Wiley & Sons, Ltd.     

Strategies on the evaluation of binomial coefficients for all integers

Binomial coefficients are used in many fields such as computational and applied mathematics, statistics and probability, theoretical physics and chemistry. For accurate numerical results, the correct calculation of these coefficients is very important. We present some new recurrence relationships and numerical methods for the evaluation of binomial coefficients for negative integers. For this purpose, we give some comparisons of the outputs for different computer programming languages in case of negative integers, and also we wrote two new algorithms for computations.     

A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

A G‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The existence spectrum problem of G‐designs for five‐vertex graphs is a long standing problem posed by Bermond, Huang, Rosa and Sotteau in 1980, which is closely related to traffic groomings in optical networks. Although considerable progress has been made over the past 30 years, the existence problems for such G‐designs and their related traffic groomings in optical networks are far from complete. In this paper, we first give a complete solution to this spectrum problem for five‐vertex graphs by eliminating all the undetermined possible exceptions. Then, we determine almost completely the minimum drop cost of 8‐groomings for all orders n by reducing the 37 possible exceptions to 8. Finally, we show the minimum possible drop cost of 9‐groomings for all orders n is realizable with 14 exceptions and 12 possible exceptions.     

Extending modules relative to a torsion theory

An R-module M is said to be an extending module if every closed submodule of M is a direct summand. In this paper we introduce and investigate the concept of a type 2 τ-extending module, where τ is a hereditary torsion theory on Mod-R. An R-module M is called type 2 τ-extending if every type 2 τ-closed submodule of M is a direct summand of M. If τ _I is the torsion theory on Mod-R corresponding to an idempotent ideal I of R and M is a type 2 τ _I -extending R-module, then the question of whether or not M/MI is an extending R/I-module is investigated. In particular, for the Goldie torsion theory τ _G we give an example of a module that is type 2 τ _G -extending but not extending.     

Densely continuous forms, pointwise topology and cardinal functions

We consider the space D(X, Y) of densely continuous forms introduced by Hammer and McCoy [5] and investigated also by Holá [6]. We show some additional properties of D(X, Y) and investigate the subspace D*(X) of locally bounded real-valued densely continuous forms equipped with the topology of pointwise convergence τ- _p . The largest part of the paper is devoted to the study of various cardinal functions for (D*(X), τ _p ), in particular: character, pseudocharacter, weight, density, cellularity, diagonal degree, π-weight, π-character, netweight etc. This work was supported by Science and Technology Assistance Agency under the contract No. APVT-51-006904. The authors would like to thank Ľubica Holá for suggestions and comments.     

Optimal Groomings with Grooming Ratios Six and Seven

Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.     

Clifford Product and Lorentzian Plane Displacements In 3-Dimensional Lorentzian Space

In this paper, by defining Clifford algebra product in 3-dimensional Lorentz space, L ³, it is shown that even Clifford algebra of L ³ corresponds to split quaternion algebra. Then, by using Lorentzian matrix multiplication, pole point of planar displacement in Lorentz plane L ² is obtained. In addition, by defining degenerate Lorentz scalar product for L ³ and by using the components of pole points of Lorentz plane displacement in particular split hypercomplex numbers, it is shown that the Lorentzian planar displacements can be represented as a special split quaternion which we call it Lorentzian planar split quaternion.      

Hybrid Flow-Shop: a Memetic Algorithm Using Constraint-Based Scheduling for Efficient Search

The paper considers the hybrid flow-shop scheduling problem with multiprocessor tasks. Motivated by the computational complexity of the problem, we propose a memetic algorithm for this problem in the paper. We first describe the implementation details of a genetic algorithm, which is used in the memetic algorithm. We then propose a constraint programming based branch-and-bound algorithm to be employed as the local search engine of the memetic algorithm. Next, we present the new memetic algorithm. We lastly explain the computational experiments carried out to evaluate the performance of three algorithms (genetic algorithm, constraint programming based branch-and-bound algorithm, and memetic algorithm) in terms of both the quality of the solutions produced and the efficiency. These results demonstrate that the memetic algorithm produces better quality solutions and that it is very efficient.     

Superintegrable cases of four-dimensional dynamical systems

Degenerate tri-Hamiltonian structures of the Shivamoggi and generalized Raychaudhuri equations are exhibited. For certain specific values of the parameters, it is shown that hyperchaotic Lü and Qi systems are superintegrable and admit tri-Hamiltonian structures.