Viscous Dark Energy Models with Variable G and Lambda

We consider a cosmological model with bulk viscosity ($\eta$) and variable cosmological $(\Lambda\propto \rho^{-\alpha}, \alpha=\rm const.$) and gravitational ($G$) constants. The model exhibits many interesting cosmological features. Inflation proceeds du to the presence of bulk viscosity and dark energy without requiring the equation of state $p=-\rho$. During the inflationary era the energy density ($\rho$) does not remain constant, as in the de-Sitter type. Moreover, the cosmological and gravitational constants increase exponentially with time, whereas the energy density and viscosity decrease exponentially with time. The rate of mass creation during inflation is found to be very huge suggesting that all matter in the universe was created during inflation.Comment: 6 Latex page

The Universe With Bulk Viscosity

Exact solutions for a model with variable $G$, $\Lambda$ and bulk viscosity are obtained. Inflationary solutions with constant (de Sitter-type) and variable energy density are found. An expanding anisotropic universe is found to isotropize during its course of expansion but a static universe is not. The gravitational constant is found to increase with time and the cosmological constant decreases with time as $\Lambda \propto t^{-2}$.Comment: 7 LateX pages, no figure

Cosmological Models with Variable Gravitational and Cosmological constants in R2R^{2} Gravity

We consider the evolution of a flat Friedmann-Roberstson-Walker Universe in a higher derivative theories, including $\alpha R^{2}$ terms to the Einstein-Hilbert action in the presence of a variable gravitational and cosmological constants. We study here the evolution of the gravitational and cosmological constants in the presence of radiation and matter domination era of the universe. We present here new cosmological solutions which are physically interesting for model building.Comment: 14 pages, no figure. to be published in Int. J. Mod. Phys.

FIRST STEPS OF EXPERIMENTAL VALIDATION OF A NUMERICAL MODEL ABOUT MECHANICAL BEHAVIOR OF NITI ENDODONTIC INSTRUMENTS

Oral Communication presented at the ";Forum des Jeunes Chercheurs";, Brest (France) 2011

Cosmic Acceleration With A Positive Cosmological Constant

We have considered a cosmological model with a phenomenological model for the cosmological constant of the form \Lambda=\bt\fr{\ddot R}{R}, \bt is a constant. For age parameter consistent with observational data the Universe must be accelerating in the presence of a positive cosmological constant. The minimum age of the Universe is $H_0^{-1}$, where $H_0$ is the present Hubble constant. The cosmological constant is found to decrease as $t^{-2}$. Allowing the gravitational constant to change with time leads to an ever increasing gravitational constant at the present epoch. In the presence of a viscous fluid this decay law for $\Lambda$ is equivalent to the one with $\Lambda=3\alpha H^2$ ($\alpha=\rm const.$) provided \alpha=\fr{\bt}{3(\bt-2)}. The inflationary solution obtained from this model is that of the de-Sitter type.Comment: a more revised versio

PrDK: Protocol programming with automata

We present PrDK: a development kit for programming protocols. PrDK is based on syntactic separation of process code, presumably written in an existing general-purpose language, and protocol code, written in a domain-specific language with explicit, high-level elements of syntax for programming protocols. PrDK supports two complementary syntaxes (one graphical, one textual) with a common automata-theoretic semantics. As a tool for construction of systems, PrDK consists of syntax editors, a translator, a parser, an interpreter, and a compiler into Java. Performance in the NAS Parallel Benchmarks is promising

Global Consensus through Local Synchronization (Technical Report)

Coordination languages have emerged for the specification and implementation of interaction protocols among concurrent entities. Currently, we are developing a code generator for one such a language, based on the formalism of constraint automata (CA). As part of the compilation process, our tool computes the CA-specific synchronous product of a number of CA, each of which models a constituent of the protocol to generate code for. This ensures that implementations of those CA at run-time reach a consensus about their global behavior in every step. However, using the existing product operator on CA can be practically problematic. In this paper, we provide a solution by defining a new, local product operator on CA that avoids those problems. We then identify a sufficiently large class of CA for which using our new product instead of the existing one is semantics-preserving. Finally, we describe how to apply this result to code generation and also sketch how to use the same theory for projecting choreographies

Can High Throughput Atone for High Latency in Compiler-Generated Protocol Code? (Technical Report)

High-level concurrency constructs and abstractions have several well-known software engineering advantages when it comes to programming concurrency protocols among threads in multicore applications. To also explore their complementary performance advantages, in ongoing work, we are developing compilation technology for a high-level coordination language, Reo, based on this language's formal automaton semantics. By now, as shown in our previous work, our tools are capable of generating code that can compete with carefully hand-crafted code, at least for some protocols. An important prerequisite to further advance this promising technology, now, is to gain a better understanding of how the significantly different compilation approaches that we developed so far, which vary in the amount of parallelism in their generated code, compare against each other. For instance, to better and more reliably tune our compilers, we must learn under which circumstances parallel protocol code, with high throughput but also high latency, outperforms sequential protocol code, with low latency but also low throughput. In this paper, we report on an extensive performance comparison between these approaches for a substantial number of protocols, expressed in Reo. Because we have always formulated our compilation technology in terms of a general kind of communicating automaton (i.e., constraint automata), our findings apply not only to Reo but, in principle, to any language whose semantics can be defined in terms of such automata