In this work, we consider the Hořava–Lifshitz scaling to rewrite higher-order derivatives in Lorentz-violating CPT-even electrodynamics. The possibility of Lorentz invariance violation being originally suppressed by quantum gravity energy scale $$M_\mathrm{QG}$$ may be indeed circumvented a scenario with anisotropy between space and time above certain intermediate $$\Lambda _\mathrm{HL} \ll M_\...

Every so often, signifi cant global trends can be traced back to a source. The 1993 World Development Report (WDR) was such a catalyst in global health and development policy, demonstrating to fi nance ministers, economists, and philanthropists that health is an investment with positive economic returns—and not simply a drain on scarce resources. The report helped set the stage for a major scal...

Based on the charge independence hypothesis the properties of V particles are theoretically investigated. It is found that the curious behaviours of these unstable particles are most simply interpreted in terms of the 1}-charge conservation law which directly results from the C. I. hypothesis and suitable isotopic spin assignments to these particles. The topics which are discussed in this paper...

There is a large gap between Zhang’s theoretical bound for the length n of a binary extremal self-dual doublyeven code and what we can construct. The largest n is 136. In order to find examples for larger n a non-trivial automorphism group might be helpful. In the list of known examples extended quadratic residue codes and quadratic double circulant codes have large automorphism groups. But in ...

Dynamic optimization of computer programs can dramatically improve their performance on a variety of applications. This paper presents an efficient infrastructure for dynamic recompilation that can support a wide range of dynamic optimizations including profile-driven optimizations. The infrastructure allows any section of code to be optimized and regenerated on-the-fly, even code for currently...

Even-cycle matroids are elementary lifts of graphic and even-cut cographic matroids. We present a polynomial algorithm to check if binary matroid is an even-cycle we matroid. These two algorithms rely on (to be described in pair follow-up papers) pinch-graphic.