Models of Vortices and Spirals in White Dwarf's Accretion Binaries

The main aim in the current survey is to suggest models of the development of structures, such as vortices and spirals, in accretion white dwarf's binaries. Numerical methods and simulations are applied on the bases of hydrodynamic analytical considerations. It is suggested in the theoretical model the perturbation's parameters of the accretion flow, which are caused by the influences of the tidal wave over the flux of accretion matter around the secondary star. The results of numerical code application on the disturbed flow reveal an appearing of structure with spiral shape due to the tidal interaction in the close binaries. Our further simulations give the solution, which expresses the formation of vortical configurations in the accretion disc's zone. The evolution of vortices in areas of the flow's interaction is explored using single vortex and composite vortex models. Gas in the disc matter is considered to be compressible and non-ideal. The longevity of all these structures is different and each depends on the time period of the rotation, density and velocity of the accretion matter.Comment: 4 page

Graph Abstraction and Abstract Graph Transformation

Many important systems like concurrent heap-manipulating programs, communication networks, or distributed algorithms are hard to verify due to their inherent dynamics and unboundedness. Graphs are an intuitive representation of states of these systems, where transitions can be conveniently described by graph transformation rules. We present a framework for the abstraction of graphs supporting abstract graph transformation. The abstraction method naturally generalises previous approaches to abstract graph transformation. The set of possible abstract graphs is finite. This has the pleasant consequence of generating a finite transition system for any start graph and any finite set of transformation rules. Moreover, abstraction preserves a simple logic for expressing properties on graph nodes. The precision of the abstraction can be adjusted according to properties expressed in this logic to be verified

Simulating Multigraph Transformations Using Simple Graphs

Application of graph transformations for software verification and model transformation is an emergent field of research. In particular, graph transformation approaches provide a natural way of modelling object oriented systems and semantics of object-oriented languages.\ud \ud There exist a number of tools for graph transformations that are often specialised in a particular kind of graphs and/or graph transformation approaches, depending on the desired application domain. The main drawback of this diversity is the lack of interoperability.\ud \ud In this paper we show how (typed) multigraph production systems can be translated into (typed) simple-graph production systems. The presented construction enables the use of multigraphs with DPO transformation approach in tools that only support simple graphs with SPO transformation approach, e.g. the GROOVE tool

Large enhancement of radiative strength for soft transisitons in the quasicontinuum

Radiative strength functions (RSFs) for the 56,57-Fe nuclei below the separation energy are obtained from the 57-Fe(3-He,alpha gamma)56-Fe and 57-Fe(3-He,3-He' gamma)57-Fe reactions, respectively. An enhancement of more than a factor of ten over common theoretical models of the soft (E_gamma ~< 2 MeV) RSF for transitions in the quasicontinuum (several MeV above the yrast line) is observed. Two-step cascade intensities with soft primary transitions from the 56-Fe(n,2gamma)57-Fe reaction confirm the enhancement.Comment: 4 pages including 3 figure

CYTOGENETICAL AND IMMUNOMORPH OLOGICAL STUDY OF CHLORPROMAZINE EFFECT ON HUMAN LYMPHOCYTE CULTURES IN VITRO

No abstrac

Neighbourhood Effects in Consumption: Evidence from Disaggregated Consumption Data

This paper identifies neighbourhood effects in consumption using the randomized nature of the Progresa programme. Recent studies establish that the programme affects the consumption of both eligible and neighbouring ineligible households but the underlying mechanism of the spillovers is not fully understood. I use disaggregated consumption data to distinguish between changes in consumption which result from changes in neighbourhood consumption and changes in consumption which are a result of income transfers between households. Using a flexible demand model that accounts for total expenditure, prices and household characteristics, I find that neighbourhood consumption has a substantial effect on household consumption choice

Semantics and Validation of Shapes Schemas for RDF

We present a formal semantics and proof of soundness for shapes schemas, an expressive schema language for RDF graphs that is the foundation of Shape Expressions Language 2.0. It can be used to describe the vocabulary and the structure of an RDF graph, and to constrain the admissible properties and values for nodes in that graph. The language defines a typing mechanism called shapes against which nodes of the graph can be checked. It includes an algebraic grouping operator, a choice operator and cardinality constraints for the number of allowed occurrences of a property. Shapes can be combined using Boolean operators, and can use possibly recursive references to other shapes. We describe the syntax of the language and define its semantics. The semantics is proven to be well-defined for schemas that satisfy a reasonable syntactic restriction, namely stratified use of negation and recursion. We present two algorithms for the validation of an RDF graph against a shapes schema. The first algorithm is a direct implementation of the semantics, whereas the second is a non-trivial improvement. We also briefly give implementation guidelines

3D Reconstruction and Digital Visualization of the South of the Royal Palace in Great Preslav

The report presents the film 10th century. The South of the Royal Palace in Great Preslav. It consists of two parts – 10th century. The Royal Palace in Great Prelsav. The Square with the Pinnacle and The Ruler’s Lodgings. 3D and virtual reconstructions of an architectural ensemble – part of the Preslav Royal Court unearthed during archaeological researches are used in the film. 3D documentaries have already gained popularity around the world and are well received by both scholars and the public at large. One of the distinguished tourist destinations in Bulgaria is Great Preslav – capital of the mediaeval Bulgarian state and a significant cultural center of the European Southeast in 9th–10th centuries, too. The first part of the film is created with the financial support of America for Bulgaria Foundation and the second – with the funding of Bulgarian National Science Fund at the Ministry of Education, Youth and Science. A team of almost 20 members worked on the film, including computer specialists, professional actors, and translators in the four main European languages – English, German, French and Russian, Trima Sound Recording Studio. In the first part of the 3D film are shown a segment of the Royal Palace, the square with the water pinnacle and the adjacent buildings – an important structural element of the town-planning of the Preslav Court center in the 10th century. In the second part the accent is the southern part of the Royal Palace in Great Preslav, where the personal residence of the Preslav ruler’s dynasty is situated. The work on the virtual reconstruction was done by Virtual Archaeology club at the Mathematical School, Shumen. Due to the efforts of its members it is now clear how the square in front of the southern gate looked like

Shape Expressions Schemas

We present Shape Expressions (ShEx), an expressive schema language for RDF designed to provide a high-level, user friendly syntax with intuitive semantics. ShEx allows to describe the vocabulary and the structure of an RDF graph, and to constrain the allowed values for the properties of a node. It includes an algebraic grouping operator, a choice operator, cardinalitiy constraints for the number of allowed occurrences of a property, and negation. We define the semantics of the language and illustrate it with examples. We then present a validation algorithm that, given a node in an RDF graph and a constraint defined by the ShEx schema, allows to check whether the node satisfies that constraint. The algorithm outputs a proof that contains trivially verifiable associations of nodes and the constraints that they satisfy. The structure can be used for complex post-processing tasks, such as transforming the RDF graph to other graph or tree structures, verifying more complex constraints, or debugging (w.r.t. the schema). We also show the inherent difficulty of error identification of ShEx