Results from higher order mean field calculations of light interacting with atom arrays are presented for one- and two-time expectation values. The atoms approximated as two-levels fixed in space. Calculations were performed approximations that include the value one operator (mean field), two operators field-2), three field-3). For one-time values, we examined different situations to understand...

Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive DLs whereas existing knowledge bases are written in very expressive DLs. In order to allow the user to re-use concepts defined in such terminologies and still support the definition of new concepts by computing the lcs, we extend the notion of the lcs of concept descriptions to the notion of the ...

the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...

This paper introduces a novel lowest-order discontinuous Petrov Galerkin (dPG) finite element method (FEM) for the Poisson model problem. The ultra-weak formulation allows for piecewise constant and affine ansatz functions and for piecewise affine and lowest-order Raviart-Thomas test functions. This lowest-order discretization for the Poisson model problem allows for a direct proof of the discr...

By a theorem of Dobrow and Smythe, the depth of the kth node in very simple families of increasing trees (which includes, among others, binary increasing trees, recursive trees and plane ordered recursive trees) follows the same distribution as the number of edges of the form j−(j+1) with j < k. In this short note, we present a simple bijective proof of this fact, which also shows that the resu...