A Mobile Ambients-based Approach for Network Attack Modelling and Simulation

Attack Graphs are an important support for assessment and subsequent improvement of network security. They reveal possible paths an attacker can take to break through security perimeters and traverse a network to reach valuable assets deep inside the network. Although scalability is no longer the main issue, Attack Graphs still have some problems that make them less useful in practice. First, Attack Graphs remain difficult to relate to the network topology. Second, Attack Graphs traditionally only consider the exploitation of vulnerable hosts. Third, Attack Graphs do not rely on automatic identification of potential attack targets. We address these gaps in our MsAMS (Multi-step Attack Modelling and Simulation) tool, based on Mobile Ambients. The tool not only allows the modelling of more static aspects of the network, such as the network topology, but also the dynamics of network attacks. In addition to Mobile Ambients, we use the PageRank algorithm to determine targets and hub scores produced by the HITS (Hypertext Induced Topic Search) algorithm to guide the simulation of an attacker searching for targets

Integration and Evaluation of QUIC and TCP-BBR in longhaul Science Data Transfers

Two recent and promising additions to the internet protocols are TCP-BBR and QUIC. BBR defines a congestion policy that promises a better control in TCP bottlenecks on long haul transfers and can also be used in the QUIC protocol. TCP-BBR is implemented in the Linux kernels above 4.9. It has been shown, however, to demand careful fine tuning in the interaction, for example, with the Linux Fair Queue. QUIC, on the other hand, replaces HTTP and TLS with a protocol on the top of UDP and thin layer to serve HTTP. It has been reported to account today for 7% of Google’s traffic. It has not been used in server-to-server transfers even if its creators see that as a real possibility. Our work evaluates the applicability and tuning of TCP-BBR and QUIC for data science transfers. We describe the deployment and performance evaluation of TCP-BBR and comparison with CUBIC and H-TCP in transfers through the TEIN link to Singaren (Singapore). Also described is the deployment and initial evaluation of a QUIC server. We argue that QUIC might be a perfect match in security and connectivity to base services that are today performed by the Xroot redirectors

Climate impact and adaptation to heat and drought stress of regional and global wheat production

Wheat (Triticum aestivum) is the most widely grown food crop in the world threatened by future climate change. In this study, we simulated climate change impacts and adaptation strategies for wheat globally using new crop genetic traits (CGT), including increased heat tolerance, early vigor to increase early crop water use, late flowering to reverse an earlier anthesis in warmer conditions, and the combined traits with additional nitrogen (N) fertilizer applications, as an option to maximize genetic gains. These simulations were completed using three wheat crop models and five Global Climate Models (GCM) for RCP 8.5 at mid-century. Crop simulations were compared with country, US state, and US county grain yield and production. Wheat yield and production from high-yielding and low-yielding countries were mostly captured by the model ensemble mean. However, US state and county yields and production were often poorly reproduced, with large variability in the models, which is likely due to poor soil and crop management input data at this scale. Climate change is projected to decrease global wheat production by −1.9% by mid-century. However, the most negative impacts are projected to affect developing countries in tropical regions. The model ensemble mean suggests large negative yield impacts for African and Southern Asian countries where food security is already a problem. Yields are predicted to decline by −15% in African countries and −16% in Southern Asian countries by 2050. Introducing CGT as an adaptation to climate change improved wheat yield in many regions, but due to poor nutrient management, many developing countries only benefited from adaptation from CGT when combined with additional N fertilizer. As growing conditions and the impact from climate change on wheat vary across the globe, region-specific adaptation strategies need to be explored to increase the possible benefits of adaptations to climate change in the future.info:eu-repo/semantics/publishedVersio

Parallel Monte Carlo Search for Hough Transform

We investigate the problem of line detection in digital image processing and in special how state of the art algorithms behave in the presence of noise and whether CPU efficiency can be improved by the combination of a Monte Carlo Tree Search, hierarchical space decomposition, and parallel computing. The starting point of the investigation is the method introduced in 1962 by Paul Hough for detecting lines in binary images. Extended in the 1970s to the detection of space forms, what came to be known as Hough Transform (HT) has been proposed, for example, in the context of track fitting in the LHC ATLAS and CMS projects. The Hough Transform transfers the problem of line detection, for example, into one of optimization of the peak in a vote counting process for cells which contain the possible points of candidate lines. The detection algorithm can be computationally expensive both in the demands made upon the processor and on memory. Additionally, it can have a reduced effectiveness in detection in the presence of noise. Our first contribution consists in an evaluation of the use of a variation of the Radon Transform as a form of improving theeffectiveness of line detection in the presence of noise. Then, parallel algorithms for variations of the Hough Transform and the Radon Transform for line detection are introduced. An algorithm for Parallel Monte Carlo Search applied to line detection is also introduced. Their algorithmic complexities are discussed. Finally, implementations on multi-GPU and multicore architectures are discussed

Cataclysmic Variables from Sloan Digital Sky Survey – V the search for period bouncers continues

SDSS-V is carrying out a dedicated survey for white dwarfs, single, and in binaries, and we report the analysis of the spectroscopy of 118 cataclysmic variables (CVs) and CV candidates obtained during the final plug plate observations of SDSS. We identify eight new CVs, spectroscopically confirm 53 and refute 11 published CV candidates, and we report 21 new or improved orbital periods. The orbital period distribution of the SDSS-V CVs does not clearly exhibit a period gap. In common with previous studies, the distribution shows that spectroscopically identified CVs have a larger proportion of short-period systems compared to samples identified from photometric variability. Remarkably, despite a systematic search, we find very few period bouncers. We estimate the space density of period bouncers to be $\simeq 0.2\times 10^{-6}\, \mathrm{pc}^{-3}$, i.e. they represent only a few per cent of the total CV population. This suggests that during their final phase of evolution, CVs either destroy the donor, e.g. via a merger, or that they become detached and cease mass transfer.https://arxiv.org/abs/2305.13371First author draf