Quantum and random walks as universal generators of probability distributions

Quantum walks and random walks bear similarities and divergences. One of the most remarkable disparities affects the probability of finding the particle at a given location: typically, almost a flat function in the first case and a bell-shaped one in the second case. Here I show how one can impose any desired stochastic behavior (compatible with the continuity equation for the probability function) on both systems by the appropriate choice of time- and site-dependent coins. This implies, in particular, that one can devise quantum walks that show diffusive spreading without loosing coherence, as well as random walks that exhibit the characteristic fast propagation of a quantum particle driven by a Hadamard coin.Comment: 8 pages, 2 figures; revised and enlarged versio

A Simulator for LLVM Bitcode

In this paper, we introduce an interactive simulator for programs in the form of LLVM bitcode. The main features of the simulator include precise control over thread scheduling, automatic checkpoints and reverse stepping, support for source-level information about functions and variables in C and C++ programs and structured heap visualisation. Additionally, the simulator is compatible with DiVM (DIVINE VM) hypercalls, which makes it possible to load, simulate and analyse counterexamples from an existing model checker

LTL Parameter Synthesis of Parametric Timed Automata

The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The investigated bounded integer parameter synthesis problem could be solved using an explicit enumeration of all possible parameter valuations. We propose an alternative symbolic zone-based method for this problem which results in a faster computation. Our technique extends the ideas of the automata-based approach to LTL model checking of timed automata. To justify the usefulness of our approach, we provide experimental evaluation and compare our method with explicit enumeration technique.Comment: 23 pages, extended versio

How do the blind ‘see’? The role of spontaneous brain activity in self-generated perception

Spontaneous activity of the human brain has been well documented, but little is known about the functional role of this ubiquitous neural phenomenon. It has previously been hypothesized that spontaneous brain activity underlies unprompted (internally generated) behaviour. We tested whether spontaneous brain activity might underlie internally-generated vision by studying the cortical visual system of five blind/visually-impaired individuals who experience vivid visual hallucinations (Charles Bonnet syndrome). Neural populations in the visual system of these individuals are deprived of external input, which may lead to their hyper-sensitization to spontaneous activity fluctuations. To test whether these spontaneous fluctuations can subserve visual hallucinations, the functional MRI brain activity of participants with Charles Bonnet syndrome obtained while they reported their hallucinations (spontaneous internally-generated vision) was compared to the: (i) brain activity evoked by veridical vision (externally-triggered vision) in sighted controls who were presented with a visual simulation of the hallucinatory streams; and (ii) brain activity of non-hallucinating blind controls during visual imagery (cued internally-generated vision). All conditions showed activity spanning large portions of the visual system. However, only the hallucination condition in the Charles Bonnet syndrome participants demonstrated unique temporal dynamics, characterized by a slow build-up of neural activity prior to the reported onset of hallucinations. This build-up was most pronounced in early visual cortex and then decayed along the visual hierarchy. These results suggest that, in the absence of external visual input, a build-up of spontaneous fluctuations in early visual cortex may activate the visual hierarchy, thereby triggering the experience of vision

Efficient Online Timed Pattern Matching by Automata-Based Skipping

The timed pattern matching problem is an actively studied topic because of its relevance in monitoring of real-time systems. There one is given a log $w$ and a specification $\mathcal{A}$ (given by a timed word and a timed automaton in this paper), and one wishes to return the set of intervals for which the log $w$, when restricted to the interval, satisfies the specification $\mathcal{A}$. In our previous work we presented an efficient timed pattern matching algorithm: it adopts a skipping mechanism inspired by the classic Boyer--Moore (BM) string matching algorithm. In this work we tackle the problem of online timed pattern matching, towards embedded applications where it is vital to process a vast amount of incoming data in a timely manner. Specifically, we start with the Franek-Jennings-Smyth (FJS) string matching algorithm---a recent variant of the BM algorithm---and extend it to timed pattern matching. Our experiments indicate the efficiency of our FJS-type algorithm in online and offline timed pattern matching

Optimal infinite scheduling for multi-priced timed automata

This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes both costs and rewards as separate modelling features. A precise definition is then given of what constitutes optimal infinite behaviours for this class of models. We subsequently show that the derivation of optimal non-terminating schedules for such double-priced timed automata is computable. This is done by a reduction of the problem to the determination of optimal mean-cycles in finite graphs with weighted edges. This reduction is obtained by introducing the so-called corner-point abstraction, a powerful abstraction technique of which we show that it preserves optimal schedules

Удалители для асфальтосмолопарафиновых отложений месторождений Западного Казахстана

Signal transducers and activators of transcriptions (STAT) are key mediators of cytokine signaling. Moreover, these transcription factors play a crucial role in oncogenic signaling where inappropriate and sustained activation of STATs, especially STAT3, is a trait of many different cancers and their derived cell lines. Constitutively active STAT3 has been reported to prevent programmed cell death and enhance cell proliferation, whereas the disruption of STAT3 signaling can inhibit tumor growth. The physiologic activation of STAT3 by cytokines has been well established; however, little is known about altered, stimulation-independent STAT3 activation. Here, we show that, in most but not all melanoma cell lines, STAT3 phosphorylation increased substantially with cell density and that this STAT3 was able to bind to DNA and to activate transcription. Inhibitor studies showed that the cell density-dependent STAT3 activation relies on Janus kinases (JAK) rather than Src kinases. Using a specific JAK inhibitor, sustained STAT3 activation was completely abrogated in all tested melanoma lines, whereas inhibition of Src or mitogen-activated protein kinase/extracellular signal-regulated kinase kinase 1/2 had no effect on constitutively tyrosine-phosphorylated STAT3 levels. Although STAT3 activation was completely blocked with JAK inhibitor I and to a lesser extent with the common JAK inhibitor AG490, only the latter compound markedly decreased proliferation and induced apoptosis. Taken together, variations in cell density can profoundly modify the extent of JAK-mediated persistent STAT3 phosphorylation; however, STAT3 activation was not sufficient to provide critical growth and survival signals in melanoma cell lines

A Systematic Approach to Justifying Sufficient Confidence in Software Safety Arguments

Safety arguments typically have some weaknesses. To show that the overall confidence in the safety argument is considered acceptable, it is necessary to identify the weaknesses associated with the aspects of a safety argument and supporting evidence, and manage them. Confidence arguments are built to show the existence of sufficient confidence in the developed safety arguments. In this paper, we propose an approach to systematically constructing confidence arguments and identifying the weaknesses of the software safety arguments. The proposed approach is described and illustrated with a running example