258 research outputs found
Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications
Petri nets are a formalism for modelling and reasoning about the behaviour of
distributed systems. Recently, a reversible approach to Petri nets, Reversing
Petri Nets (RPN), has been proposed, allowing transitions to be reversed
spontaneously in or out of causal order. In this work we propose an approach
for controlling the reversal of actions of an RPN, by associating transitions
with conditions whose satisfaction/violation allows the execution of
transitions in the forward/reversed direction, respectively. We illustrate the
framework with a model of a novel, distributed algorithm for antenna selection
in distributed antenna arrays.Comment: RC 201
Generalized Heisenberg algebras and k-generalized Fibonacci numbers
It is shown how some of the recent results of de Souza et al. [1] can be
generalized to describe Hamiltonians whose eigenvalues are given as
k-generalized Fibonacci numbers. Here k is an arbitrary integer and the cases
considered by de Souza et al. corespond to k=2.Comment: 8 page
Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
Context-bounded analysis has been shown to be both efficient and effective at
finding bugs in concurrent programs. According to its original definition,
context-bounded analysis explores all behaviors of a concurrent program up to
some fixed number of context switches between threads. This definition is
inadequate for programs that create threads dynamically because bounding the
number of context switches in a computation also bounds the number of threads
involved in the computation. In this paper, we propose a more general
definition of context-bounded analysis useful for programs with dynamic thread
creation. The idea is to bound the number of context switches for each thread
instead of bounding the number of switches of all threads. We consider several
variants based on this new definition, and we establish decidability and
complexity results for the analysis induced by them
Aerodynamic instabilities in high-speed air intakes and their role in propulsion system integration
High-speed air intakes often exhibit intricate flow patterns, with a specific type of flow instability known as ‘buzz’, characterized by unsteady shock oscillations at the inlet. This paper presents a comprehensive review of prior research, focused on unraveling the mechanisms that trigger buzz and its implications for engine stability and performance. The literature survey delves into studies concerning complex-shaped diffusers and isolators, offering a thorough examination of flow aerodynamics in unstable environments. Furthermore, this paper provides an overview of contemporary techniques for mitigating flow instability through both active and passive flow control methods. These techniques encompass boundary layer bleeding, the application of vortex generators, and strategies involving mass injection and energy deposition. The study concludes by discussing future prospects in the domain of engine-intake aerodynamic compatibility. This work serves as a valuable resource for researchers and engineers striving to address and understand the complexities of high-speed air induction systems.EU Erasmus+ Progra
ARIADNE - A novel optical LArTPC: technical design report and initial characterisation using a secondary beam from the CERN PS and cosmic muons
ARIADNE is a 1-ton (330 kg fiducial mass) dual-phase liquid argon (LAr) time
projection chamber (TPC) featuring a novel optical readout. Four
electron-multiplying charge-coupled device (EMCCD) cameras are mounted
externally, and these capture the secondary scintillation light produced in the
holes of a thick electron gas multiplier (THGEM). Track reconstruction using
this novel readout approach is demonstrated. Optical readout has the potential
to be a cost effective alternative to charge readout in future LArTPCs. In this
paper, the technical design of the detector is detailed. Results of mixed
particle detection using a secondary beam from the CERN PS (representing the
first ever optical images of argon interactions in a dual-phase LArTPC at a
beamline) and cosmic muon detection at the University of Liverpool are also
presented.Comment: 58 pages, 40 figures. Changes from previous version based on
pre-publication review: improved quality of various figures, improved clarity
of some definitions and reduced longer sentences for better readability,
fixed typos and formatting error
Breakfast glycaemic index and exercise: combined effects on adolescents' cognition
The aim of the present study was to examine the combined effects of breakfast glycaemic index (GI) and a mid-morning bout of exercise on adolescents’ cognitive function. Participants were randomly allocated to a high or low GI breakfast group in a mixed research design, where each participant completed two experimental trials (exercise and resting). Forty-two adolescents (12.4±0.5 years old), undertook a bout of exercise (ten repeats of level one of the multi-stage fitness test; exercise trial) or continued to rest (resting trial) following consumption of either a high or low GI breakfast. A battery of cognitive function tests (visual search test, Stroop test and Sternberg paradigm) was completed 30 min before and 45 min following the exercise. Average heart rate during exercise was 170±15 beats.min-1. On the complex level of the Stroop test, response times improved across the morning following the low GI breakfast on both the exercise and resting trials, though the improvement was greatest on the exercise trial. However, response times only improved on the resting trial following the high GI breakfast (p = 0.012). On the 5 letter level of the Sternberg paradigm, response times improved across the morning following the low GI breakfast (regardless of exercise) and only on the exercise trial following the high GI breakfast (p = 0.019). The findings of the present study suggest that the combined effects of breakfast GI and exercise in adolescents depend upon the component of cognitive function examined. A low GI breakfast and mid-morning bout of exercise were individually beneficial for response times on the Sternberg paradigm, whereas they conferred additional benefits for response times on the Stroop test
Molecular analysis of archival diagnostic prostate cancer biopsies identifies genomic similarities in cases with progression post-radiotherapy, and those with de novo metastatic disease
Purpose It is important to identify molecular features that improve prostate cancer (PCa) risk stratification before radical treatment with curative intent. Molecular analysis of historical diagnostic formalin-fixed paraffin-embedded (FFPE) prostate biopsies from cohorts with post-radiotherapy (RT) long-term clinical follow-up has been limited. Utilizing parallel sequencing modalities, we performed a proof-of-principle sequencing analysis of historical diagnostic FFPE prostate biopsies. We compared patients with i) stable PCa post-primary or salvage RT (sPCa), ii) progressing PCa post-RT (pPCa), and iii) de novo metastatic PCa (mPCa).
Experimental Design A cohort of 19 patients with diagnostic prostate biopsies (n=6 sPCa, n=5 pPCa, n=8 mPCa) and mean 4 years 10 months follow-up (diagnosed 2009-2016) underwent nucleic acid extraction from demarcated malignancy. Samples underwent 3’RNA sequencing (3’RNAseq) (n=19), nanoString analysis (n=12) and Illumina 850k methylation (n=8) sequencing. Bioinformatic analysis was performed to coherently identify differentially expressed genes (DEGs) and methylated genomic regions (MGRs).
Results 18 of 19 samples provided useable 3’RNAseq data. Principal Component Analysis (PCA) demonstrated similar expression profiles between pPCa and mPCa cases, versus sPCa. Coherently differentially methylated probes between these groups identified ∼600 differentially MGRs. The top 50 genes with increased expression in pPCa patients were associated with reduced progression-free survival post-RT (p<0.0001) in an external cohort.
Conclusions 3’RNAseq, nanoString and 850K-methylation analyses are each achievable from historical FFPE diagnostic pre-treatment prostate biopsies, unlocking the potential to utilize large cohorts of historic clinical samples. Profiling similarities between individuals with pPCa and mPCa suggests biological similarities and historical radiological staging limitations, which warrant further investigation
The Price of Defense
We consider a game on a graph G= ⟨ V, E⟩ with two confronting classes of randomized players: νattackers, who choose vertices and seek to minimize the probability of getting caught, and a single defender, who chooses edges and seeks to maximize the expected number of attackers it catches. In a Nash equilibrium, no player has an incentive to unilaterally deviate from her randomized strategy. The Price of Defense is the worst-case ratio, over all Nash equilibria, of ν over the expected utility of the defender at a Nash equilibrium. We orchestrate a strong interplay of arguments from Game Theory and Graph Theory to obtain both general and specific results in the considered setting: (1) Via a reduction to a Two-Players, Constant-Sum game, we observe that an arbitrary Nash equilibrium is computable in polynomial time. Further, we prove a general lower bound of |V|2 on the Price of Defense. We derive a characterization of graphs with a Nash equilibrium attaining this lower bound, which reveals a promising connection to Fractional Graph Theory; thereby, it implies an efficient recognition algorithm for such Defense-Optimal graphs. (2) We study some specific classes of Nash equilibria, both for their computational complexity and for their incurred Price of Defense. The classes are defined by imposing structure on the players’ randomized strategies: either graph-theoretic structure on the supports, or symmetry and uniformity structure on the probabilities. We develop novel graph-theoretic techniques to derive trade-offs between computational complexity and the Price of Defense for these classes. Some of the techniques touch upon classical milestones of Graph Theory; for example, we derive the first game-theoretic characterization of König-Egerváry graphs as graphs admitting a Matching Nash equilibrium
Fermat-linked relations for the Boubaker polynomial sequences via Riordan matrices analysis
The Boubaker polynomials are investigated in this paper. Using Riordan
matrices analysis, a sequence of relations outlining the relations with
Chebyshev and Fermat polynomials have been obtained. The obtained expressions
are a meaningful supply to recent applied physics studies using the Boubaker
polynomials expansion scheme (BPES).Comment: 12 pages, LaTe
- …