We consider foliations of complex projective manifolds by analytic curves. In a generic case each leaf is hyperbolic and there exists unique Poincaré metric on the leaves. It is shown that in a generic case this metric smoothly depends on a leaf. The manifold of universal covering of the leaves passing through some transversal base has a natural complex structure. It is shown that this structur...

We define several generic cluster-computing algorithms, each of them encapsulating a general purpose control structure. By extending these generic algorithms with sequential code, we derive specific cluster-computing algorithms for diverse problems. We use a specification and prototyping language to test the validity of the derived parallel algorithms before finally converting them into efficie...

This communication describes the computation of slow modes in a generic shell model of passive turbulent advection. It is argued that the propagator for the correlation functions possesses a ladder of slow modes associated with each zero mode. These slow modes decay algebraically fast, as opposed to exponential. Using the explicit form of the propagator of the 2-point structure function, we sho...

The halide perovskites have truly emerged as efficient optoelectronic materials and show the promise of exhibiting nontrivial topological phases. Since bandgap is deterministic factor for these quantum phases, here we present a comprehensive electronic structure study using first-principle methods by considering nine inorganic CsBX$_3$ (B = Ge, Sn, Pb; X Cl, Br, I) in their three structural pol...

The present study aimed to investigate the rhetorical organization of acknowledgements accompanying Doctor Philosophy (PhD) dissertations written in English by native speakers and Turkish, gain insights into underlying socio-pragmatic proclivities. To this end, macro-textual analysis 136 PhD was conducted light Hyland Tse’s (2004) coding scheme. findings revealed that more than half dissertatio...

The structure of the semi lattice of enumeration degrees has been investigated from many aspects. One aspect is the bounding and nonbounding properties of generic degrees. Copestake proved that every 2-generic enumeration degree bounds a minimal pair and conjectured that there exists a 1-generic degree that does not bound a minimal pair. In this paper we verify this longstanding conjecture by c...