Narrow Results

In this work we obtain topological and equivalent theories on brane-worlds in several dimensions. Our brane is a solitonic-like hypersurface embedded in a spacetime with a specific dimensionality and it appears due to the breaking of a Peccei–Quinn-like symmetry. In the first part of this work, the obtained topological theories are related to a generalization of the axion–photon anomalous interaction in D = 4 (in the Abelian case) and to the Wess–Zumino term (in the non-Abelian case). In the second part, we construct equivalent models on the brane through a mechanism of explicit Lorentz symmetry breaking. The gauge symmetries of such models are discussed within the Stuckelberg formalism.

In the celebrated Plebanski formalism of topological gravity, the constraints connecting topological field theories and gravity are imposed in spacetimes with trivial topology. In the braneworld context there are two distinct regions of the spacetime, namely, the bulk and the braneworld volume. In this work we show how to construct topological classical gravity in a scenario containing one extra dimension and a δ-function like three-brane which naturally emerges from a spontaneously broken discrete symmetry. Starting from a D = 5 theory we obtain the action for General Relativity in the Palatini form in the bulk as well as in the braneworld volume. This result is important for future insights about quantum gravity on brane scenarios.

We propose a framework to construct “Domain-Wall Standard Model” in a non-compact 5-dimensional spacetime, where all the Standard Model (SM) fields are localized in certain domains of the 5th dimension and the SM is realized as a 4-dimensional effective theory without any compactification for the 5th dimension. In this context, we investigate the collider phenomenology of the Kaluza–Klein (KK) modes of the SM gauge bosons and the current constraints from the search for a new gauge boson resonance at the Large Hadron Collider Run-2. The couplings of the SM fermions with the KK-mode gauge bosons depend on the configuration of the SM fermions in the 5-dimensional bulk. This “geometry” of the model can be tested at the future Large Hadron Collider experiment, once a KK-mode of the SM gauge boson is discovered.

We study the localization properties of fundamental fields which are coupled to one another through the gauge mechanism both in the original Randall–Sundrum (RS) and in the modified Randall–Sundrum (MRS) braneworld models: scalar–vector, vector–vector, and spinor–vector configuration systems. For this purpose, we derive conditions of localization, namely, the finiteness of integrals over the extra coordinate in the action of the system considered. We also derive field equations for each of the systems and then obtain their solutions corresponding to the extra dimension by a separation of variable method for every field involved in each system. We then insert the obtained solutions into the conditions of localization to seek whether or not the solutions are in accordance with the conditions of localization. We obtain that not all of the configuration systems considered are localizable on the brane of the original RS model while, on the contrary, they are localizable on the MRS braneworld model with some restrictions. In terms of field localizability on the brane, this result shows that the MRS model is much better than the original RS model.

Check amount recognition is one of the most promising commercial applications of handwriting recognition. This paper is devoted to the description of the check reading system developed to recognize amounts on American personal checks. Special attention is paid to a reliable procedure developed to reject doubtful answers. For this purpose the legal (worded) amount on a personal check is recognized along with the courtesy (digit) amount. For both courtesy and legal amount fields, a brief description of all recognition stages beginning with field extraction and ending with the recognition itself are presented. We also present the explanation of problems existing at each stage and their possible solutions. The numeral recognizer used to read the amounts written in figures is described. This recognizer is based on the procedure of matching input subgraphs to graphs of symbol prototypes. Main principles of the handwriting recognizer used to read amounts written in words are explained. The recognizer is based on the idea of describing the handwriting with the most stable handwriting elements. The concept of the optimal confidence level of the recognition answer is introduced. It is shown that the conditional probability of the answer correctness is an optimal confidence level function. The algorithms of the optimal confidence level estimation for some special cases are described. The sophisticated algorithm of cross validation between legal and courtesy amount recognition results based on the optimal confidence level approach is proposed. Experimental results on real checks are presented. The recognition rate at 1% error rate is 67%. The recognition rate without reject is 85%. Significant improvement is achieved due to legal amount processing in spite of a relatively low recognition rate for this field.

Check amount recognition is one of the most promising commercial applications of handwriting recognition. This paper is devoted to the description of the check reading system developed to recognize amounts on American personal checks. Special attention is paid to a reliable procedure developed to reject doubtful answers. For this purpose the legal (worded) amount on a personal check is recognized along with the courtesy (digit) amount. For both courtesy and legal amount fields, a brief description of all recognition stages beginning with field extraction and ending with the recognition itself are presented. We also present the explanation of problems existing at each stage and their possible solutions. The numeral recognizer used to read the amounts written in figures is described. This recognizer is based on the procedure of matching input subgraphs to graphs of symbol prototypes. Main principles of the handwriting recognizer used to read amounts written in words are explained. The recognizer is based on the idea of describing the handwriting with the most stable handwriting elements. The concept of the optimal confidence level of the recognition answer is introduced. It is shown that the conditional probability of the answer correctness is an optimal confidence level function. The algorithms of the optimal confidence level estimation for some special cases are described. The sophisticated algorithm of cross validation between legal and courtesy amount recognition results based on the optimal confidence level approach is proposed. Experimental results on real checks are presented. The recognition rate at 1% error rate is 67%. The recognition rate without reject is 85%. Significant improvement is achieved due to legal amount processing in spite of a relatively low recognition rate for this field.