Some properties of Hermite-based Sheffer polynomials

In this paper, the concepts and the formalism associated with monomiality principle and Sheffer sequences are used to introduce family of Hermite-based Sheffer polynomials. Some properties of Hermite-Sheffer polynomials are considered. Further, an operational formalism providing a correspondence between Sheffer and Hermite-Sheffer polynomials is developed. Furthermore, this correspondence is used to derive several new identities and results for members of Hermite-Sheffer family.     

A new Taylor collocation method for nonlinear Fredholm‐Volterra integro‐differential equations

The aim of this article is to present an efficient numerical procedure for solving nonlinear integro‐differential equations. Our method depends mainly on a Taylor expansion approach. This method transforms the integro‐differential equation and the given conditions into the matrix equation which corresponds to a system of nonlinear algebraic equations with unkown Taylor coefficients. The reliability and efficiency of the proposed scheme are demonstrated by some numerical experiments and performed on the computer program written in Maple10. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

A boundary only procedure for time-dependent diffusion equations

In the recent literature, the boundary element method (BEM) is extensively used to solve time-dependent partial differential equations. However, most of these formulations yield algorithms where one has to include all interior points in the computation process if finite difference procedures are used to approximate the temporal derivative. This obviously restricts the advantages of the BEM, which is mainly considered to be a boundary only algorithm for time-independent problems. A new algorithm is demonstrated here, which extends the boundary only nature of the method to time-dependent partial differential equations. Using this procedure, one can reduce the finite difference time integration algorithm, generated in a standard manner, to a boundary only process. The proposed method is demonstrated with considerable success for diffusion problems. Results obtained in these applications are presented comparatively with analytical and other boundary element time integration procedures. The algorithm proposed may utilize several coordinate functions in the secondary reduction phase of the formulation. A summary of such functions is described here and performances of these functions are tested and compared in three applications. It is shown that some coordinate functions perform better than others under certain conditions. Using these results, we propose a general coordinate function, which may be used with satisfactory results in all parabolic partial differential equation applications.     

An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints

We provide an efficient computational approach to solve the mixed integer programming (MIP) model developed by Tarim and Kingsman [8] for solving a stochastic lot-sizing problem with service level constraints under the static-dynamic uncertainty strategy. The effectiveness of the proposed method hinges on three novelties: (i) the proposed relaxation is computationally efficient and provides an optimal solution most of the time, (ii) if the relaxation produces an infeasible solution, then this solution yields a tight lower bound for the optimal cost, and (iii) it can be modified easily to obtain a feasible solution, which yields an upper bound. In case of infeasibility, the relaxation approach is implemented at each node of the search tree in a branch-and-bound procedure to efficiently search for an optimal solution. Extensive numerical tests show that our method dominates the MIP solution approach and can handle real-life size problems in trivial time.     

A study on monotone self-dual Boolean functions

This paper shows that monotone self-dual Boolean functions in irredundant disjuntive normal form (IDNF) do not have more variables than disjuncts. Monotone self-dual Boolean functions in IDNF with the same number of variables and disjuncts are examined. An algorithm is proposed to test whether a monotone Boolean function in IDNF with n variables and n disjuncts is self-dual. The runtime of the algorithm is O(n³).     

An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver

Solving mixed-integer nonlinear programming (MINLP) problems to optimality is a NP-hard problem, for which many deterministic global optimization algorithms and solvers have been recently developed. MINLPs can be relaxed in various ways, including via mixed-integer linear programming (MIP), nonlinear programming, and linear programming. There is a tradeoff between the quality of the bounds and CPU time requirements of these relaxations. Unfortunately, these tradeoffs are problem-dependent and cannot be predicted beforehand. This paper proposes a new dynamic strategy for activating and deactivating MIP relaxations in various stages of a branch-and-bound algorithm. The primary contribution of the proposed strategy is that it does not use meta-parameters, thus avoiding parameter tuning. Additionally, this paper proposes a strategy that capitalizes on the availability of parallel MIP solver technology to exploit multicore computing hardware while solving MINLPs. Computational tests for various benchmark libraries reveal that our MIP activation strategy works efficiently in single-core and multicore environments.     

Some electrical and structural properties of Cd/CdS/n–Si/Au–Sb sandwich structure

In view of CdS growth is very impotent for technological importance especially solar applications; synthesis of this material remains a topic of great interest for researchers by means of an economically and technically viable method. In the present paper, Cd/CdS/n–Si/Au–Sb sandwich structure has been grown by Successive Ionic Layer Adsorption and Reaction (SILAR) technique. For investigating the structural properties, X-ray diffraction (XRD), scanning electron microscopy (SEM) and energy dispersive X-ray analysis (EDAX) measurements have been performed and it has been seen that films exhibit polycrystalline behavior. The capacitance–voltage (C–V) and conductance/w-voltage (G/w–V) characteristics of Cd/CdS/n–Si/Au–Sb structure have been investigated by considering series resistance and interface states effects. These measurements have been done in the −4 V, 4 V voltage range and in the frequency range of 10 kHz–3 MHz at room temperature. It is seen that, the series resistance (R_s) and interface state density have been strongly depend on frequency. The barrier height, donor concentration, diffusion potential parameters have been determined from the linear C⁻²–V plot. The barrier height values are obtained between 0.495 and 0.796 eV and doping density values have been ranged from 1.455 × 10¹⁴ to 1.999 × 10¹⁴ cm⁻³respectively. The capacitance–frequency (C–f) and conductance/w-frequency (G/w–f) characteristics of Cd/CdS/n–Si/Au–Sb structures have been measured at the various biases 0.00–0.14 V at room temperature. The energy distribution of the interface states (N_ss) and their relaxation time (τ) have been determined from the forward bias capacitance–frequency characteristics. The N_ss and τ values have ranged from 2.01 × 10¹² cm⁻² eV⁻¹and 9.68 × 10⁻⁴ s in (Ec-0.45) eV–2.86 × 10¹³ cm⁻² eV⁻¹ and 3.81 × 10⁻⁴ s in (Ec-0.75) eV, respectively.     

{\boldsymbol(}\boldsymbol{\mathcal{Z}}_{\bf 1}, \boldsymbol{\mathcal{Z}}_{\bf 2}{\boldsymbol)}-Complete Partially Ordered Sets and Their Representations by \boldsymbol{\mathcal{Q}}-Spaces

The present paper proposes a general theory for $\left( \mathcal{Z}_{1}, \mathcal{Z}_{2}\right) $ -complete partially ordered sets (alias $\mathcal{Z} _{1}$ -join complete and $\mathcal{Z}_{2}$ -meet complete partially ordered sets) and their Stone-like representations. It is shown that for suitably chosen subset selections $\mathcal{Z}_{i}$ (i?=?1,...,4) and $\mathcal{Q} =\left( \mathcal{Z}_{1},\mathcal{Z}_{2},\mathcal{Z}_{3},\mathcal{Z} _{4}\right) $ , the category $\mathcal{Q}$ P of $\left( \mathcal{Z}_{1},\mathcal{Z}_{2}\right) $ -complete partially ordered sets and $\left( \mathcal{Z}_{3},\mathcal{Z}_{4}\right) $ -continuous (alias $\mathcal{ Z}_{3}$ -join preserving and $\mathcal{Z}_{4}$ -meet preserving) functions forms a useful categorical framework for various order-theoretical constructs, and has a close connection with the category $\mathcal{Q}$ S of $\mathcal{Q}$ -spaces which are generalizations of topological spaces involving subset selections. In particular, this connection turns into a dual equivalence between the full subcategory $ \mathcal{Q}$ P _s of $\mathcal{Q}$ P of all $\mathcal{Q}$ -spatial objects and the full subcategory $\mathcal{Q}$ S _s of $\mathcal{Q}$ S of all $\mathcal{Q}$ -sober objects. Here $\mathcal{Q}$ -spatiality and $\mathcal{Q}$ -sobriety extend usual notions of spatiality of locales and sobriety of topological spaces to the present approach, and their relations to $\mathcal{Z}$ -compact generation and $\mathcal{Z}$ -sobriety have also been pointed out in this paper.     

Optimization of Neutrino Oscillation Parameters Using Differential Evolution

We show how the traditional grid based method for finding neutrino oscillation parameters m2 and tan 2θ can be combined with an optimization technique,Differential Evolution(DE),to get a significant decrease in computer processing time required to obtain minimal chi-square(χ2) in four different regions of the parameter space.We demonstrate efficiency for the two-neutrinos case.For this,the χ2 function for neutrino oscillations is evaluated for grids with different density of points in standard allowed regions of the parameter space of m2 and tan 2θ using experimental and theoretical total event rates of chlorine(Homestake),Gallex+GNO,SAGE,Superkamiokande,and SNO detectors.We find that using DE in combination with the grid based method with small density of points can produce the results comparable with the one obtained using high density grid,in much lesser computation time.