We establish a formula for computing the unramified Brauer group of tame conic bundle threefolds in characteristic $2$. The depends on arrangement and residue double covers discriminant components, latter being governed by Artin-Schreier theory (instead Kummer not $2$). use this to give new examples threefold bundles defined over $\Bbb{Z}$ that are stably rational $\Bbb{C}$.

A double loop network G(n; $1, ~2) is a digraph with n nodes (0, 1, . , n 1) and 2n links of the form i + i + x1 (mod n) and i + i + s2 (mod n). A double loop network G(n; ~1, $2) is LFT if there is a Hamiltonian cycle in every G(n; ~1, ~2) e where e is any link in the network. Similarly, a double loop network G(n; ~1, ~2) is NE;T if there is a Hamiltonian cycle in every G(n; ~1, ~2) u where u ...

Abstract The purpose of feature learning is to obtain effective representation the raw data and then improve performance machine algorithms such as clustering or classification. Some existing use discriminant information in features, but discrimination not enough. In order further enhance discrimination, based on t-distribution stochastic neighbor embedding guided by pairwise constraints (pcDTS...

The double branched cover is a construction which provides a link between problems in knot theory and other questions in low-dimensional topology. Given a knot in a 3-manifold, the double branched cover gives a natural way of associating a 3-manifold to the knot. Similarly, the double branched cover of a properly embedded surface in a 4-manifold is a 4-manifold whose boundary is the double bran...

We give a construction of singular K3 surfaces with discriminant 3 and 4 as double coverings over the projective plane. Focusing on similarities in their branching loci, we can generalize this construction, obtain three dimensional moduli space certain which admit infinite automorphism groups. Moreover, show that these are characterized terms configuration fibres jacobian elliptic fibration als...

In this paper, a faster method for embedding cryptographic information in the image ispresented by expressing the concept of latent prints (Steganography). Data is encrypted bytwo methods before embedding to increase reliability. Then they are embedded into the imageby a button, a method has been expressed to reduce potential noise impact on the wayinformation is encoded.

In this paper, we propose a speed-up approach for subclass discriminant analysis and formulate novel efficient multi-view solution to it. The is developed based on graph embedding spectral regression approaches that involve eigendecomposition of the corresponding Laplacian matrix its eigenvectors. We show by exploiting structure between-class matrix, step can be substituted with much faster pro...

In the simulation study the method for inverse identification of two distinct simultaneous lesions with changed repolarization in the ventricular myocardium is described. The inverse localization of two lesions was obtained from the difference STT integral body surface potential maps (DIMs). The DIMs corresponding to 48 single lesions and 96 double lesions were simulated on the surface of an in...

Recent studies in cross-domain classification have shown that discriminant information of both source and target domains is very important. In this article, we propose a new domain adaptation (DA) method for hyperspectral image (HSI) classification, called graph embedding distribution alignment (GEDA). GEDA uses the pseudo-label learning to learn interclass intraclass divergence matrices domain...

In this paper a reversible data hiding method which uses a novel algorithm based on histogram sifting is proposed. The distortion that occurs due to embedding can be completely removed during the data extraction. The proposed method uses double embedding to increase the reversibility. Location map information is embedded into the image itself, so that the reversibility can be easily achieved. T...