1,489 research outputs found
Results of the GPR research in the gardens of the Potocki Palace in Radzyn Podlaski and of the Zamoyski Palace in Klemensow (Poland).
No full textResults of the GPR (Ground-penetrating radar) research in the gardens of the Potocki Palace in Radzyń Podlaski and Zamoyski Palace in Klemensów (Poland). The geophysical research took place in the area of previous baroque formal garden (behind the palace) on an area of 4950 m2 (Radzyń Podlaski) and 2730 m2 (Klemensów). The research was carried out using a multi-channel 3D ground-penetrating radar - Stream C by IDS. This is a ground-penetrating radar with 34 measuring antennas (32 recording channels per 1 m width) with a maximum depth range of up to 3 m below ground level. The indicated area was scanned with unit scans every 4 cm, and thanks to the double polarization of the antennas, a longitudinal and transverse scanning effect with a resolution of 4 cm in two directions was achieved. The measurements were positioned using GNSS RTK (Global Navigation Satellite System, Real-Time Kinematic) technology with corrections from the reference network. Horizontal cross-sections, depth cross-sections from VV and HH antenna polarisation, cut every 5 cm.</p
Prospects for Observing an Invisibly Decaying Higgs Boson in Production at the LHC
No full textIn this thesis we study the prospects for observing the invisibly decaying Higgs boson in the associated production at the LHC. The results of the Monte Carlo simulations of signal and background processes show that there is a possibility of observing the statistically significant number of signal events required for the discovery. Moreover, the analysis can be further improved to reduce the number of false reconstructions of the boson. The analysis of the production is independent of the model in which the Higgs boson decays into the invisible channel. There are several possibilities for models where can be of interest. For this thesis, we have studied the simplest supersymmetric model, called mSUGRA. The results of the scans of the mSUGRA model parameter space show that the regions, where the branching ratio of the lightest neutral Higgs boson to the lightest neutralino pair is high, are excluded by current experimental constraints. The channel dominates, and the possibility for discovery in this c hannel will not be suppressed by the invisible decays. This result does not disqualify invisible channel as possible signature in other models. Chapter 4 of this thesis is based on the published paper: B.P. Kersevan, M. Malawski, E. Richter-Was: Prospects for observing an invisibly decaying Higgs boson in the production at the LHC, In: Eur. Phys. J. C, 29(2003) pp. 541-54
Never born proteins as a test case for ab initio protein structures prediction
No full textThe number of natural proteins although large is significantly smaller than the theoretical number of proteins that can be obtained combining the 20 natural amino acids, the so-called "never born proteins" (NBPs). The study of the structure and properties of these proteins allows to investigate the sources of the natural proteins being of unique characteristics or special properties. However the structural study of NPBs can also been intended as an ideal test for evaluating the efficiency of software packages for the ab initio protein structure prediction. In this research, 10.000 three-dimensional structures of proteins of completely random sequence generated according to ROSETTA and FOD model were compared. The results show the limits of these software packages, but at the same time indicate that in many cases there is a significant agreement between the prediction obtained
Collusion, symmetry, and the Banzhaf value
No full textWe resolve redundancies in the characterizations of the Banzhaf value suggested by Haller (1994, Int J Game Theory 23, 261-281) and Malawski (2002, Int J Game Theory 31:47-67). In particular, we show that the collusion properties employed by them are equivalent. Combined with the dummy player axiom, any of the collusion properties has strong symmetry implications whenever the cardinality of the player set exceeds two. Finally, we establish that the Banzhaf value is non-redundantly characterized by the dummy player axiom and any of the collusion properties, provided that the player set is as above. --Banzhaf value,symmetry,collusion,proxy,association,distrust
In silico structural study of random amino acid sequence proteins not present in nature
No full textThe three-dimensional structures of a set of 'never born proteins' (NBP, random amino acid sequence proteins with no significant homology with known proteins) were predicted using two methods: Rosetta and the one based on the 'fuzzy-oil-drop' (FOD) model. More than 3000 different random amino acid sequences have been generated, filtered against the non redundant protein sequence data base, to remove sequences with significant homology with known proteins, and subjected to three-dimensional structure prediction. Comparison between Rosetta and FOD predictions allowed to select the ten top (highest structural similarity) and the ten bottom (the lowest structural similarity) structures from the ranking list organized according to the RMS-D value. The selected structures were taken for detailed analysis to define the scale of structural accordance and discrepancy between the two methods. The structural similarity measurements revealed discrepancies between structures generated on the basis of the two methods. Their potential biological function appeared to be quite different as well. The ten bottom structures appeared to be 'unfoldable' for the FOD model. Some aspects of the general characteristics of the NBPs are also discussed. The calculations were performed on the EUChinaGRID grid platform to test the performance of this infrastructure for massive protein structure predictions. © 2009 Verlag Helvetica Chimica Acta AG
Managing failures in task-based parallel workflows in distributed computing environments
No full textCurrent scientific workflows are large and complex. They normally perform thousands of simulations whose results combined with searching and data analytics algorithms, in order to infer new knowledge, generate a very large amount of data. To this end, workflows comprise many tasks and some of them may fail. Most of the work done about failure management in workflow managers and runtimes focuses on recovering from failures caused by resources (retrying or resubmitting the failed computation in other resources, etc.) However, some of these failures can be caused by the application itself (corrupted data, algorithms which are not converging for certain conditions, etc.), and these fault tolerance mechanisms are not sufficient to perform a successful workflow execution. In these cases, developers have to add some code in their applications to prevent and manage the possible failures. In this paper, we propose a simple interface and a set of transparent runtime mechanisms to simplify how scientists deal with application-based failures in task-based parallel workflows. We have validated our proposal with use-cases from e-science and machine learning to show the benefits of the proposed interface and mechanisms in terms of programming productivity and performance.This work has been supported by the Spanish Government (contracts SEV2015-0493 and TIN2015-65316-P), by the Generalitat de Catalunya (contract 2014-SGR-1051), and by the European Commission’s Horizon 2020 Framework program through BioExcel Center of Excellence (contracts 823830, and 675728). The research leading to these results has received funding from the collaboration between Fujitsu and BSC (Script Language Platform).Peer ReviewedPostprint (author's final draft
Invocation of Grid operations in the ViroLab Virtual Laboratory
No full textThis paper presents invocation of grid operations within the ViroLab Virtual Laboratory. Virtual laboratory enables users to develop and execute experiments that access computational resources on the Grid exposed via various middleware technologies. An abstraction over the Grid environment is introduced which is based on the concept of grid objects accessible from the experiment script based on Ruby. We describe the Grid Operation Invoker library which is the core of virtual laboratory engine and provides access to heterogeneous computational resources in a uniform manner using pluggable adapters. Sample applications include a script, which implements a data mining scenario using the Weka library and combines Web services with MOCCA technologies
Towards a System-Level Science Support
No full textRecently, there is a growing need for an information technology solution to support a new methodology of scientific investigation, called system-level science. This paper presents a new approach to development and execution of collaborative applications. These applications are built as experiment plans with a notation based on the Ruby language. The virtual laboratory, which is an integrated system of dedicated tools and servers, provides a common space for planning, building, improving and performing in-silico experiments by a group of developers. The application is built with elements called gems which are available on the distributed Web- and Grid-based infrastructure. The process of application developments and the functionality of the virtual laboratory are demonstrated with a real-life example of the drug susceptibility ranking application from the HIV treatment domain
Convexity of production, common pool and oligopoly games: a survey
No full textThe paper surveys a uniform proof technique of the convexity property for three different cooperative TU games arising from three different economical settings. The production economy, common pool situation and oligopoly framework involve a cost function, but different production functions. Each of the three corresponding game theoretic models refers to some maximization problem described by optimizing a certain net profit function over all feasible production levels. The current mathematical proof of the convexity of any of three cooperative TU games is strongly based on the interchangeability of maximizers for the underlying maximization problems. This uniform proof technique is inspired by the interchangeability of two players concerning the convexity condition in terms of the marginal contributions of both players in the TU game
- …
