ERC FUNDED PROJECTS

When triggered by nutrient limitation, the Gram-positive bacterium Bacillus subtilis and its relatives enter a pathway of cellular differentiation culminating in the formation of a dormant cell type called a spore, the most resilient cell type known. Bacterial spores can survive for long periods of time and are able to endure extremes of heat, radiation and chemical assault. Remarkably, dormant spores can rapidly convert back to actively growing cells by a process called germination. Consequently, spore forming bacteria, including dangerous pathogens, (such as C. botulinum and B. anthracis) are highly resistant to antibacterial treatments and difficult to eradicate. Despite significant advances in our understanding of the process of spore formation, little is known about the nature of the mature spore. It is unrevealed how dormancy is maintained within the spore and how it is ceased, as the organization and the dynamics of the spore macromolecules remain obscure. The unusual biochemical and biophysical characteristics of the dormant spore make it a challenging biological system to investigate using conventional methods, and thus set the need to develop innovative approaches to study spore biology. We propose to explore the nature of spores by using B. subtilis as a primary experimental system. We intend to: (1) define the architecture of the spore chromosome, (2) track the complexity and fate of mRNA and protein molecules during sporulation, dormancy and germination, (3) revisit the basic notion of the spore dormancy (is it metabolically inert?), (4) compare the characteristics of bacilli spores from diverse ecophysiological groups, (5) investigate the features of spores belonging to distant bacterial genera, (6) generate an integrative database that categorizes the molecular features of spores. Our study will provide original insights and introduce novel concepts to the field of spore biology and may help devise innovative ways to combat spore forming pathogens.

1 630 000 €

Start date: 2008-10-01, End date: 2013-09-30

The two fundamental challenges of this project are the integration of medieval Jewries and their histories within the framework of European history without undermining their distinct communal status and the creation of a history of everyday medieval Jewish life that includes those who were not part of the learned elite. The study will focus on the Jewish communities of northern Europe (roughly modern Germany, northern France and England) from 1100-1350. From the mid-thirteenth century these medieval Jewish communities were subject to growing persecution. The approaches proposed to access daily praxis seek to highlight tangible dimensions of religious life rather than the more common study of ideologies to date. This task is complex because the extant sources in Hebrew as well as those in Latin and vernacular were written by the learned elite and will require a broad survey of multiple textual and material sources. Four main strands will be examined and combined: 1. An outline of the strata of Jewish society, better defining the elites and other groups. 2. A study of select communal and familial spaces such as the house, the synagogue, the market place have yet to be examined as social spaces. 3. Ritual and urban rhythms especially the annual cycle, connecting between Jewish and Christian environments. 4. Material culture, as objects were used by Jews and Christians alike. Aspects of material culture, the physical environment and urban rhythms are often described as “neutral” yet will be mined to demonstrate how they exemplified difference while being simultaneously ubiquitous in local cultures. The deterioration of relations between Jews and Christians will provide a gauge for examining change during this period. The final stage of the project will include comparative case studies of other Jewish communities. I expect my findings will inform scholars of medieval culture at large and promote comparative methodologies for studying other minority ethnic groups

1 941 688 €

Start date: 2016-11-01, End date: 2021-10-31

An important form of negotiation is argumentation. This is the ability to argue and to persuade the other party to accept a desired agreement, to acquire or give information, to coordinate goals and actions, and to find and verify evidence. This is a key capability in negotiating with humans. While automated negotiations between software agents can often exchange offers and counteroffers, humans require persuasion. This challenges the design of agents arguing with people, with the objective that the outcome of the negotiation will meet the preferences of the arguer agent. CAP’s objective is to enable automated agents to argue and persuade humans. To achieve this, we intend to develop the following key components: 1) The extension of current game theory models of persuasion and bargaining to more realistic settings, 2) Algorithms and heuristics for generation and evaluation of arguments during negotiation with people, 3) Algorithms and heuristics for managing inconsistent views of the negotiation environment, and decision procedures for revelation, signalling, and requesting information, 4) The revision and update of the agent’s mental state and incorporation of social context, 5) Identifying strategies for expressing emotions in negotiations, 6) Technology for general opponent modelling from sparse and noisy data. To demonstrate the developed methods, we will implement two training systems for people to improve their interviewing capabilities, and for training negotiators in inter-culture negotiations. CAP will revolutionise the state of the art of automated systems negotiating with people. It will also create breakthroughs in the research of multi-agent systems in general, and will change paradigms by providing new directions for the way computers interact with people.

2 334 057 €

Start date: 2011-07-01, End date: 2016-06-30

The efficiency of cryptographic constructions is a fundamental question. Theoretically, it is important to understand how much computational resources are needed to guarantee strong notions of security. Practically, highly efficient schemes are always desirable for real-world applications. More generally, the possibility of cryptography with low complexity has wide applications for problems in computational complexity, combinatorial optimization, and computational learning theory. In this proposal we aim to understand what are the minimal computational resources needed to perform basic cryptographic tasks. In a nutshell, we suggest to focus on three main objectives. First, we would like to get better understanding of the cryptographic hardness of random local functions. Such functions can be computed by highly-efficient circuits and their cryptographic hardness provides a strong and clean formulation for the conjectured average-case hardness of constraint satisfaction problems - a fundamental subject which lies at the core of the theory of computer science. Our second objective is to harness our insights into the hardness of local functions to improve the efficiency of basic cryptographic building blocks such as pseudorandom functions. Finally, our third objective is to expand our theoretical understanding of garbled circuits, study their limitations, and improve their efficiency. The suggested project can bridge across different regions of computer science such as random combinatorial structures, cryptography, and circuit complexity. It is expected to impact central problems in cryptography, while enriching the general landscape of theoretical computer science.

1 265 750 €

Start date: 2015-05-01, End date: 2021-04-30