This work investigates the spatial knowledge of a domain composed of non-trivial objects such as strings and holed objects. To this aim, we consider the formalisation of puzzlelike examples as the starting point for the development of Knowledge Representation systems. The present paper concentrates on the representation of “loops” (or loop-like regions) that can be formed by a flexible string, ...

Requiring that supersymmetric SU(5) and SU(6) grand unifications in the heterotic string theory must have 3 chiral families, adjoint (or higher representation) Higgs fields in the grand unified gauge group, and a non-abelian hidden sector, we construct such string models within the framework of free conformal field theory and asymmetric orbifolds. Within this framework, we construct all such st...

A detailed study is made of four dimensional SU(2) gauge theory with static adjoint “quarks” in the context of string breaking. A tadpole-improved action is used to do simulations on lattices with coarse spatial spacings as, allowing the static potential to be probed at large separations at a dramatically reduced computational cost. Highly anisotropic lattices are used, with fine temporal spaci...

Extracting bio-entity relations has emerged as an important task due to the ever-growing number of bio-medical documents. In this paper, we present a simple and novel representation for extracting bio-entity relationships. The state-of-theart systems for such tasks rely on word based representations and variations of linguistic driven features. In contrast, we model bio-text by the most basic c...

Requiring that supersymmetric SU(5) and SU(6) grand unifications in the heterotic string theory must have 3 chiral families, adjoint (or higher representation) Higgs fields in the grand unified gauge group, and a non-abelian hidden sector, we construct such string models within the framework of conformal field theory and asymmetric orbifolds. Within this framework, we construct all such string ...

For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, we define a generalisation, called “the all semi-local LCS problem”, where each string is compared against all substrings of the other string, and all prefixes of each string are compared against all suffixes of the ot...

The purpose of this paper is to help linguists contruct a consistent, sufficient and less redundant syntax of language. An acceptable string corresponds to an expression or an utterance: it may be a natural text, a string of morphemes, a tree structure or any kind of representation. A sharp distinction is made between the syntactic function which is an attrib trin s and the distribution class w...

We study the open-string moduli of supersymmetric D6-branes, addressing both the string and field theory aspects of D6-brane splitting on Type IIA orientifolds induced by open-string moduli Higgsing (i.e., their obtaining VEVs). Specifically, we focus on the Z 2 × Z 2 ori-entifolds and address the symmetry breaking pattern for D6-branes parallel with the orientifold 6-planes as well as those po...

For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, we define a generalisation, called “the all semi-local LCS problem”, where each string is compared against all substrings of the other string, and all prefixes of each string are compared against all suffixes of the ot...

Abstract In an asymmetric-key cryptosystem, the secure storage of private keys is a challenging task. This paper proposes novel approach for generating same public and key pair on need basis. Hence, done away with. The proposed based two factors: fingerprint biometrics password. A stable binary string generated from distances among pairs minutiae points in using gray code-based method. Experime...