Probabilistic Approach to the Neumann Problem for a Symmetric Operator

2000 Mathematics Subject Classification: Primary 60J45, 60J50, 35Cxx; Secondary 31Cxx.

Semi-Symmetric Algebras: General Constructions. Part II

2000 Mathematics Subject Classification: 15A69, 15A78.

New Coefficient Conditions for Functions Starlike with Respect to Symmetric Points

2000 Mathematics Subject Classification: Primary 30C45, secondary 30C80.

A method of fundamental solutions for radially symmetric and axisymmetric backward heat conduction problems

We propose and investigate an application of the method of fundamental solutions (MFS) to the radially symmetric and axisymmetric backward heat conduction problem (BHCP) in a solid or hollow cylinder. In the BHCP, the initial temperature is to be determined from the temperature measurements at a later time. This is an inverse and ill-posed problem, and we employ and generalize the MFS regularization approach [B.T. Johansson and D. Lesnic, A method of fundamental solutions for transient heat conduction, Eng. Anal. Boundary Elements 32 (2008), pp. 697–703] for the time-dependent heat equation to obtain a stable and accurate numerical approximation with small computational cost.

The 128-bit block cipher MARS

The purpose of the research is to investigate the emerging data security methodologies that will work with most suitable applications in the academic, industrial and commercial environments. Of several methodologies considered for Advanced Encryption Standard (AES), MARS (block cipher) developed by IBM, has been selected. Its design takes advantage of the powerful capabilities of modern computers to allow a much higher level of performance than can be obtained from less optimized algorithms such as Data Encryption Standards (DES). MARS is unique in combining virtually every design technique known to cryptographers in one algorithm. The thesis presents the performance of 128-bit cipher flexibility, which is a scaled down version of the algorithm MARS. The cryptosystem used showed equally comparable performance in speed, flexibility and security, with that of the original algorithm. The algorithm is considered to be very secure and robust and is expected to be implemented for most of the applications.

Quadratic and Symmetric Bilinear Forms on Modules with Unique Base Over a Semiring

27 pages

Quadratic and symmetric bilinear forms on modules with unique base over a semiring

Peer reviewed

US Asset Backed Securities – Risk Symmetric Disclosures

This chapter examines disclosures of US asset-backed securities in terms of information asymmetry theory and risk symmetry.

Symmetric Interior Penalty DG Methods for the Compressible Navier-Stokes Equations I: Method Formulation

In this article we consider the development of discontinuous Galerkin finite element methods for the numerical approximation of the compressible Navier-Stokes equations. For the discretization of the leading order terms, we propose employing the generalization of the symmetric version of the interior penalty method, originally developed for the numerical approximation of linear self-adjoint second-order elliptic partial differential equations. In order to solve the resulting system of nonlinear equations, we exploit a (damped) Newton-GMRES algorithm. Numerical experiments demonstrating the practical performance of the proposed discontinuous Galerkin method with higher-order polynomials are presented.

Symmetric Interior Penalty DG Methods for the Compressible Navier-Stokes Equations II: Goal--Oriented A Posteriori Error Estimation

In this article we consider the application of the generalization of the symmetric version of the interior penalty discontinuous Galerkin finite element method to the numerical approximation of the compressible Navier--Stokes equations. In particular, we consider the a posteriori error analysis and adaptive mesh design for the underlying discretization method. Indeed, by employing a duality argument (weighted) Type I a posteriori bounds are derived for the estimation of the error measured in terms of general target functionals of the solution; these error estimates involve the product of the finite element residuals with local weighting terms involving the solution of a certain dual problem that must be numerically approximated. This general approach leads to the design of economical finite element meshes specifically tailored to the computation of the target functional of interest, as well as providing efficient error estimation. Numerical experiments demonstrating the performance of the proposed approach will be presented.

The symmetric syntax of Japanese complex verbs and Slavic prefixes

We report on a robust symmetry between the Polish and the Japanese sequence of syntactic projections in what superficially looks like different domains, namely verbal prefixes (Polish) and multiple verbs (Japanese). This paralellism strongly supports the thesis about the finegrained sequence of positions in syntax, namely that there exists the functional sequence of syntactic heads (fseq) which is invariantly ordered by UG (see e.g. Cinque (1999)) and the surface differences among particular langauges in the order of elements that instantiate this fseq result solely from movement (not from the variation in fseq itself).

A lower bound for the energy of symmetric matrices and graphs

The energy of a symmetric matrix is the sum of the absolute values of its eigenvalues. We introduce a lower bound for the energy of a symmetric partitioned matrix into blocks. This bound is related to the spectrum of its quotient matrix. Furthermore, we study necessary conditions for the equality. Applications to the energy of the generalized composition of a family of arbitrary graphs are obtained. A lower bound for the energy of a graph with a bridge is given. Some computational experiments are presented in order to show that, in some cases, the obtained lower bound is incomparable with the well known lower bound $2\sqrt{m}$, where $m$ is the number of edges of the graph.

DnaG interacts with a linker region that joins the N- and C-domains of DnaB and induces the formation of 3-fold symmetric rings

Loading of the replicative ring helicase onto the origin of replication (oriC) is the final outcome of a well coordinated series of events that collectively constitute a primosomal cascade. Once the ring helicase is loaded, it recruits the primase and signals the switch to the polymerization mode. The transient nature of the helicase-primase (DnaB-DnaG) interaction in the Escherichia coli system has hindered our efforts to elucidate its structure and function. Taking advantage of the stable DnaB-DnaG complex in Bacillus stearothermophilus, we have reviewed conflicting mutagenic data from other bacterial systems and shown that DnaG interacts with the flexible linker that connects the N- and C-terminal domains of DnaB. Furthermore, atomic force microscopy (AFM) imaging experiments show that binding of the primase to the helicase induces predominantly a 3-fold symmetric morphology to the hexameric ring. Overall, three DnaG molecules appear to interact with the hexameric ring helicase but a small number of complexes with two and even one DnaG molecule bound to DnaB were also detected. The structural/functional significance of these data is discussed and a speculative structural model for this complex is suggested.

Convolution of Orbital Measures on Symmetric Spaces of type Cp and Dp

International audience