The multiplicities a λ,µ of simple modules L µ in the composition series of Kac modules V λ for the Lie superalgebra gl(m/n) were described by Serganova, leading to her solution of the character problem for gl(m/n). In Serganova's algorithm all µ with nonzero a λ,µ are determined for a given λ; this algorithm turns out to be rather complicated. In this Letter a simple rule is conjectured to fin...

In this paper, the decoding of lowdensity parity-check (LDPC) codes is considered. A new algorithm, named λ−Min algorithm, for updating extrinsic information is proposed. The λ−Min algorithm offers different trade-off performance versus complexity between the belief propagation (BP) algorithm (optimal but complex) and the universal most powerful (UMP) BP-based algorithm (simple but leading to s...

We study an extension of Ehrhard–Regnier’s differential linear logic along the lines of Laurent’s polarization. We show that a particular object of the well-known relational model of linear logic provides a denotational semantics for this new system, which canonically extends the semantics of both differential and polarized linear logics: this justifies our choice of cut elimination rules. Then...

Intuitionistic logic is an important subsystem of the classical one. In intuitionistic logic the effective interpretation and mechanical extraction of programs from proofs are allowed. The programming interpretation of intuitionistic propositional logic by simply typed lambda-calculus is a significant part of interest of computer scientists. The intuitionistic natural deductions are actually th...

Evolvable hardware (EHW) refers to a selfreconfiguration hardware design, where the configuration is under the control of an evolutionary algorithm (EA). A lot of research has been done in this area several different EA have been introduced. Every time a specific EA is chosen for solving a particular problem, all its components, such as population size, initialization, selection mechanism, muta...

We consider policy evaluation algorithms within the context of infinite-horizon dynamic programming problems with discounted cost. We focus on discrete-time dynamic systems with a large number of states, and we discuss two methods, which use simulation, temporal differences, and linear cost function approximation. The first method is a new gradient-like algorithm involving least-squares subprob...

One of the main concerns of the mining industry is to determine ultimate pit limits. Final pit is a collection of blocks, which can be removed with maximum profit while following restrictions on the slope of the mine’s walls. The size, location and final shape of an open-pit are very important in designing the location of waste dumps, stockpiles, processing plants, access roads and other surfac...