Hyper/J supports a new approach to constructing, integrating and evolving software, called multi-dimensional separation of concerns. Developers can decompose and organize code and other artifacts according to multiple, arbitrary criteria (concerns) simultaneously—even after the software has been implemented—and synthesize or integrate the pieces into larger-scale components and systems. Hyper/J...

With the help of the Jordan–Wigner transformation the spin-12 XY chains can be reformulated in terms of noninteracting spinless fermions and, as a result, many statistical-mechanics calculations can be performed rigorously, i.e. without making any simplifying approximations. We are interested in dynamic properties of such chains (time-dependent spin correlation functions, dynamic structure fact...

let $mathcal {a} $ and $mathcal {b} $ be c$^*$-algebras. assume that $mathcal {a}$ is of real rank zero and unital with unit $i$ and $k>0$ is a real number. it is shown that if $phi:mathcal{a} tomathcal{b}$ is an additive map preserving $|cdot|^k$ for all normal elements; that is, $phi(|a|^k)=|phi(a)|^k $ for all normal elements $ainmathcal a$, $phi(i)$ is a projection, and there exists a posit...

conclusions as the prevalence of hypomagnesaemia among patients with type 2 diabetes treated at the ncdeg was found to be 19% (95% ci, 16.8%-21.4%), we recommend periodic determination of magnesium level and appropriate magnesium replacement therapy particularly among the above defined groups. results out of 1105 patients with type 2 diabetes, 210 patients (19%) (95% ci, 16.8%-21.4%) were hypom...

martindale proved that under some conditions every multiplicative isomorphism between two rings is additive. in this paper, we extend this theorem to a larger class of mappings and conclude that every multiplicative $(alpha, beta)-$derivation is additive.

The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with filtering techniques that aim at pruning branches that do not contain solutions. We introduce a new filtering algorithm based on local all different constraints. We show that this filtering is stronger than other exist...

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension dim(X) of a comparability graph X is the dimension of any transitive orientation of X, and by k-DIM we denote the class of comparability graphs X with dim(X) ≤ k. It is known that the complements of comparability gra...