We construct non-extremal fractional D-brane solutions of type-II string theory at the Z 2 orbifold point of K3. These solutions generalize known extremal fractional-brane solutions and provide further insights into N = 2 supersymmetric gauge theories and dual descriptions thereof. In particular, we find that for these solutions the horizon radius cannot exceed the non-extremal enhançon radius....

we introduce the notions of t-dual rickart and strongly t-dual rickart modules. we provide several characterizations and investigate properties of each of these concepts. it is shown that every free (resp. finitely generated free) $r$-module is t-dual rickart if and only if $overline{z}^2(r)$ is a  direct summand of $r$ and end$(overline{z}^2(r))$ is a semisimple (resp. regular) ring. it is sho...

The dual-execution-environment approach (dual-EE) is a trusted model that was defined to allow mobile smart devices to guarantee tamper-resistant execution for highly sensitive applications. Although various solutions implementing dual-EE have been proposed in the literature, this model has not been formalized yet. In this paper, we revisit the dual-EE approach and propose a theoretical framewo...

In this paper, we deal with a column generation based algorithm for the classical cutting stock problem. This algorithm is known to have convergence issues, which are addressed in this paper. Our methods are based on the fact that there are interesting characterizations of the structure of the dual problem, and that a large number of dual solutions are known. First we describe methods based on ...

are based on the ansätze for the Yang–Mills field Aμ(x) suggested by Wu and Yang, Rosen, ’t Hooft, Corrigan and Fairlie, Wilczek, Witten (see [1] and references therein). There were further developments for the self-dual YMEs (which form the first-order system of nonlinear partial differential equations such that system (1) is its differential consequence). Let us mention the Atiyah–Hitchin–Dri...

We propose two new Lagrangian dual problems for chance-con-strained stochastic programs based on relaxing nonanticipativity constraints. We compare the strength of the proposed dual bounds and demonstrate that they are superior to the bound obtained from the continuous relaxation of a standard mixed-integer programming (MIP) formulation. For a given dual solution, the associated Lagrangian rela...