Refine
Year of publication
Document Type
- Other (983) (remove)
Language
- English (682)
- German (283)
- Spanish (5)
- Italian (4)
- Multiple languages (4)
- Polish (2)
- French (1)
- Portuguese (1)
- Russian (1)
Keywords
- Arrayseismologie (5)
- E-Learning (5)
- array seismology (5)
- Digitalisierung (4)
- Dysphagie (4)
- Erdbeben (4)
- Judaism (4)
- Judentum (4)
- MOOC (4)
- Patholinguistik (4)
Institute
- Institut für Biochemie und Biologie (98)
- Institut für Physik und Astronomie (86)
- Hasso-Plattner-Institut für Digital Engineering GmbH (84)
- Institut für Geowissenschaften (76)
- Department Psychologie (46)
- Department Sport- und Gesundheitswissenschaften (46)
- Institut für Mathematik (46)
- Institut für Ernährungswissenschaft (32)
- Hasso-Plattner-Institut für Digital Engineering gGmbH (30)
- Institut für Chemie (30)
The plant pathogen Pseudomonas syringae is a gram-negative bacterium which infects a wide range of plant species including important crops plants. To suppress plant immunity and cause disease P.syringae injects type-III effector proteins (T3Es) into the plant cell cytosol. In this study, we identified a novel target of the well characterized bacterial T3E HopZ1a. HopZ1a is an acetyltransferase that was shown to disrupt vesicle transport during innate immunity by acetylating tubulin. Using a yeast-two-hybrid screen approach, we identified a REMORIN (REM) protein from tobacco as a novel HopZ1a target. HopZ1a interacts with REM at the plasma membrane (PM) as shown by split-YFP experiments. Interestingly, we found that PBS1, a well-known kinase involved in plant immunity also interacts with REM in pull-down assays, and at the PM as shown by BiFC. Furthermore, we confirmed that REM is phosphorylated by PBS1 in vitro. Overexpression of REM provokes the upregulation of defense genes and leads to disease-like phenotypes pointing to a role of REM in plant immune signaling. Further protein-protein interaction studies reveal novel REM binding partners with a possible role in plant immune signaling. Thus, REM might act as an assembly hub for an immune signaling complex targeted by HopZ1a. Taken together, this is the first report describing that a REM protein is targeted by a bacterial effector. How HopZ1a might mechanistically manipulate the plant immune system through interfering with REM function will be discussed.
Editorial
(2020)
Der Potsdam Grievance Statistics File (PGSF) ist eine historische Datensammlung von Beschwerden, sog. Eingaben, die in der DDR von deren Bürgern eingereicht wurden. Die Eingaben wurden schriftlich oder mündlich gestellt und waren an staatliche Institutionen gerichtet. Der Staat zählte diese Eingaben und kategorisierte sie in Eingabenstatistiken.
Der PGSF enthält Eingabenstatistiken des Zeitraums 1970–1989 einer Wahrscheinlichkeitsstichprobe von im Jahr 1990 existierenden Kreisen. Zusätzlich finden sich Eingabenstatistiken eines Convenience-Samples von Kreisen aus dem Zeitraum 1970–1989.
Leben in der ehemaligen DDR
(2020)
Detect me if you can
(2019)
Spam Bots have become a threat to online social networks with their malicious behavior, posting misinformation messages and influencing online platforms to fulfill their motives. As spam bots have become more advanced over time, creating algorithms to identify bots remains an open challenge. Learning low-dimensional embeddings for nodes in graph structured data has proven to be useful in various domains. In this paper, we propose a model based on graph convolutional neural networks (GCNN) for spam bot detection. Our hypothesis is that to better detect spam bots, in addition to defining a features set, the social graph must also be taken into consideration. GCNNs are able to leverage both the features of a node and aggregate the features of a node’s neighborhood. We compare our approach, with two methods that work solely on a features set and on the structure of the graph. To our knowledge, this work is the first attempt of using graph convolutional neural networks in spam bot detection.
Selection of initial points, the number of clusters and finding proper clusters centers are still the main challenge in clustering processes. In this paper, we suggest genetic algorithm based method which searches several solution spaces simultaneously. The solution spaces are population groups consisting of elements with similar structure. Elements in a group have the same size, while elements in different groups are of different sizes. The proposed algorithm processes the population in groups of chromosomes with one gene, two genes to k genes. These genes hold corresponding information about the cluster centers. In the proposed method, the crossover and mutation operators can accept parents with different sizes; this can lead to versatility in population and information transfer among sub-populations. We implemented the proposed method and evaluated its performance against some random datasets and the Ruspini dataset as well. The experimental results show that the proposed method could effectively determine the appropriate number of clusters and recognize their centers. Overall this research implies that using heterogeneous population in the genetic algorithm can lead to better results.
Declarative languages for knowledge representation and reasoning provide constructs to define preference relations over the set of possible interpretations, so that preferred models represent optimal solutions of the encoded problem. We introduce the notion of approximation for replacing preference relations with stronger preference relations, that is, relations comparing more pairs of interpretations. Our aim is to accelerate the computation of a non-empty subset of the optimal solutions by means of highly specialized algorithms. We implement our approach in Answer Set Programming (ASP), where problems involving quantitative and qualitative preference relations can be addressed by ASPRIN, implementing a generic optimization algorithm. Unlike this, chains of approximations allow us to reduce several preference relations to the preference relations associated with ASP’s native weak constraints and heuristic directives. In this way, ASPRIN can now take advantage of several highly optimized algorithms implemented by ASP solvers for computing optimal solutions
Without fear or favour
(2024)