The certificateless signature (CLS) scheme is a special signature scheme that solves the key escrow problem in identity-based signature schemes. In CLS schemes, the private key is generated cooperatively by the key generator center (KGC) and signer, such that a malicious KGC cannot masquerade as the signer and sign a message. He et al. in 2011 proposed an efficient CLS scheme without using bili...

Vibrational sum-frequency spectroscopy (VSFS) is employed here to study the bonding and structure of water molecules at the mixed halocarbon–water interface. Mixtures of non-polar CCl4 with more polar solvents CHCl3, dichloromethane (DCM), and 1,2-dichloroethane (DCE) are used to vary the polarity of the organic phase. The OH stretching modes of interfacial water molecules are used to character...

Let γb(G) denote the broadcast domination number for a graph G. In [Discrete Applied Math. 154 (2006), 59–75], Dunbar et al. determined the value of γb(G), where G is the Cartesian product of two paths. In this paper, we evaluate the value of γb(G), whenever G is the strong product, the direct product and the lexicographic product of two paths.

‎In this study‎, ‎we investigate topological properties of fuzzy strong‎ b-metric spaces defined in [13]‎. ‎Firstly‎, ‎we prove Baire's theorem for‎ ‎these spaces‎. ‎Then we define the product of two fuzzy strong b-metric spaces‎ ‎defined with same continuous t-norms and show that $X_{1}times X_{2}$ is a‎ ‎complete fuzzy strong b-metric space if and only if $X_{1}$ and $X_{2}$ are‎ ‎complete fu...

British cultural studies, represented perhaps chiefly by the so-called Birmingham School, is much marked by its strong orientation towards the application of grounded theory in the analysis of concrete cases, rather than the development of abstract Theory with a Capital T (in Stuart Hall’s words). As a leading figure of the Birmingham School and a key representative of the active audience model...

The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, the exact formulae for the Harary indices of tensor product G × Km0,m1,...,mr−1 and the strong product G⊠Km0,m1,...,mr−1 , whereKm0,m1,...,mr−1 is the complete multipartite graph with partite sets of sizes m0,m1, . . . ,mr−1 are obtained. Also upper bounds for th...

It is known that every multigraph with an even number of edges has an even orientation (i.e., all indegrees are even). We study parity constrained graph orientations under additional constraints. We consider two types of constraints for a multigraph G = (V,E): (1) an exact conflict constraint is an edge set C ⊆ E and a vertex v ∈ V such that C should not equal the set of incoming edges at v; (2...

We study Lascar strong types and Galois types and especially their relation to notions of type which have finite character. We define a notion of a strong type with finite character, so called Lascar type. We show that this notion is stronger than Galois type over countable sets in simple and superstable finitary AECs. Furthermore we give and example where the Galois type itself does not have f...

We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Complex Multiplication. Furthermore, we demonstrate the efficiency of the algorithm in practice by giving practical running times. In addition, we present statistics on the number of cryptographically strong elliptic curves...

Recent theoretical a potential to signifi information-theoreti concerns, which we community that a s bits from a block o protected data. Even information bits can information-theoreti weak notion of secre ultimate secrecy ra namely one which b bridge the existing security, we present criterion. As in the formulation. The ex