Academy of Sciences of the Czech Republic

About: Academy of Sciences of the Czech Republic is a government organization based out in Prague, Czechia. It is known for research contribution in the topics: Population & Catalysis. The organization has 27866 authors who have published 71021 publications receiving 1821686 citations.

Measurement of proton-proton elastic scattering and total cross-section at \chem{\sqrt {s} = 7\,TeV}

Abstract: At the LHC energy of , under various beam and background conditions, luminosities, and Roman Pot positions, TOTEM has measured the differential cross-section for proton-proton elastic scattering as a function of the four-momentum transfer squared t. The results of the different analyses are in excellent agreement demonstrating no sizeable dependence on the beam conditions. Due to the very close approach of the Roman Pot detectors to the beam center (?5?beam) in a dedicated run with ?*?=?90?m, |t|-values down to 5?10?3?GeV2 were reached. The exponential slope of the differential elastic cross-section in this newly explored |t|-region remained unchanged and thus an exponential fit with only one constant B?=?(19.9???0.3)?GeV?2 over the large |t|-range from 0.005 to 0.2?GeV2 describes the differential distribution well. The high precision of the measurement and the large fit range lead to an error on the slope parameter B which is remarkably small compared to previous experiments. It allows a precise extrapolation over the non-visible cross-section (only 9%) to t?=?0. With the luminosity from CMS, the elastic cross-section was determined to be (25.4???1.1)?mb, and using in addition the optical theorem, the total pp cross-section was derived to be (98.6???2.2)?mb. For model comparisons the t-distributions are tabulated including the large |t|-range of the previous measurement (TOTEM Collaboration (Antchev G. et al), EPL, 95 (2011) 41001).

Role of bacterial biofertilizers in agriculture and forestry

Abstract: Many rhizospheric bacterial strains possess plant growth-promoting mechanisms. These bacteria can be applied as biofertilizers in agriculture and forestry, enhancing crop yields. Bacterial biofertilizers can improve plant growth through several different mechanisms: (i) the synthesis of plant nutrients or phytohormones, which can be absorbed by plants, (ii) the mobilization of soil compounds, making them available for the plant to be used as nutrients, (iii) the protection of plants under stressful conditions, thereby counteracting the negative impacts of stress, or (iv) defense against plant pathogens, reducing plant diseases or death. Several plant growth-promoting rhizobacteria (PGPR) have been used worldwide for many years as biofertilizers, contributing to increasing crop yields and soil fertility and hence having the potential to contribute to more sustainable agriculture and forestry. The technologies for the production and application of bacterial inocula are under constant development and improvement and the bacterial-based biofertilizer market is growing steadily. Nevertheless, the production and application of these products is heterogeneous among the different countries in the world. This review summarizes the main bacterial mechanisms for improving crop yields, reviews the existing technologies for the manufacture and application of beneficial bacteria in the field, and recapitulates the status of the microbe-based inoculants in World Markets.

How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)

Abstract: Motivated by real world networks and use of algorithms based on random walks on these networks we study the simple random walks on dynamicundirected graphs with fixed underlying vertex set, i.e., graphs which are modified by inserting or deleting edges at every step of the walk. We are interested in the expected time needed to visit all the vertices of such a dynamic graph, the cover time, under the assumption that the graph is being modified by an oblivious adversary. It is well known that on connected staticundirected graphs the cover time is polynomial in the size of the graph. On the contrary and somewhat counter-intuitively, we show that there are adversary strategies which force the expected cover time of a simple random walk on connected dynamic graphs to be exponential. We relate this result to the cover time of static directed graphs. In addition we provide a simple strategy, the lazyrandom walk, that guarantees polynomial cover time regardless of the changes made by the adversary.