9,304 Hits in 2.1 sec

Daniel Appel / Christian Huberts / Tim Raupach / Sebastian Standke (Hrsg.) (2012): Welt | Kriegs | Shooter. Boizenburg: Hülsbusch

Lutz Schröder
2013 Medien & Kommunikationswissenschaft  
doi:10.5771/1615-634x-2013-1-91 fatcat:5rsu4waol5go5kpapoutzrfesm

PSI controls tim splicing and circadian period in Drosophila [article]

Lauren Foley, Jinli Ling, Radhika Joshi, Naveh Evantal, Sebastian Kadener, Patrick Emery
2018 bioRxiv   pre-print
Therefore, we conclude that PSI regulates the period of Drosophila circadian rhythms through its modulation of the tim splicing pattern.  ...  Interestingly, we found that PSI regulates the thermosensitive alternative splicing of timeless (tim), promoting splicing events favored at warm temperature over those increased at cold temperature.  ...  Downregulation of PRP4 caused excessive retention of tim-M (called tim-tiny in that study).  ... 
doi:10.1101/504282 fatcat:infowazm4fbhljkflmcoathn6u

Generating Natural Language Inference Chains [article]

Vladyslav Kolesnyk, Tim Rocktäschel, Sebastian Riedel
2016 arXiv   pre-print
The ability to reason with natural language is a fundamental prerequisite for many NLP tasks such as information extraction, machine translation and question answering. To quantify this ability, systems are commonly tested whether they can recognize textual entailment, i.e., whether one sentence can be inferred from another one. However, in most NLP applications only single source sentences instead of sentence pairs are available. Hence, we propose a new task that measures how well a model can
more » ... enerate an entailed sentence from a source sentence. We take entailment-pairs of the Stanford Natural Language Inference corpus and train an LSTM with attention. On a manually annotated test set we found that 82% of generated sentences are correct, an improvement of 10.3% over an LSTM baseline. A qualitative analysis shows that this model is not only capable of shortening input sentences, but also inferring new statements via paraphrasing and phrase entailment. We then apply this model recursively to input-output pairs, thereby generating natural language inference chains that can be used to automatically construct an entailment graph from source sentences. Finally, by swapping source and target sentences we can also train a model that given an input sentence invents additional information to generate a new sentence.
arXiv:1606.01404v1 fatcat:fjkasyyhl5hptknar2hqrlz3ba

Verification of indefinite-horizon POMDPs [article]

Alexander Bork, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann
2020 arXiv   pre-print
The verification problem in MDPs asks whether, for any policy resolving the nondeterminism, the probability that something bad happens is bounded by some given threshold. This verification problem is often overly pessimistic, as the policies it considers may depend on the complete system state. This paper considers the verification problem for partially observable MDPs, in which the policies make their decisions based on (the history of) the observations emitted by the system. We present an
more » ... raction-refinement framework extending previous instantiations of the Lovejoy-approach. Our experiments show that this framework significantly improves the scalability of the approach.
arXiv:2007.00102v1 fatcat:b67bczofojfxnade4qjmstpgky

Einstieg in die Zukunft

Tim Weinert, Sebastian Brumm
2021 Sozialwirtschaft  
Die Gemeinwohl-Ökonomie-Bilanz ermöglicht sozialwirtschaftlichen Organisationen einen einfachen Einstieg in die Verbesserung der eigenen Zukunftsfähigkeit.
doi:10.5771/1613-0707-2021-6-28 fatcat:e2b2m6l7v5g7fcbk4wmbviemqi

Jack the Reader - A Machine Reading Framework [article]

Dirk Weissenborn, Pasquale Minervini, Tim Dettmers, Isabelle Augenstein, Johannes Welbl, Tim Rocktäschel, Matko Bošnjak, Jeff Mitchell, Thomas Demeester, Pontus Stenetorp, Sebastian Riedel
2018 arXiv   pre-print
Many Machine Reading and Natural Language Understanding tasks require reading supporting text in order to answer questions. For example, in Question Answering, the supporting text can be newswire or Wikipedia articles; in Natural Language Inference, premises can be seen as the supporting text and hypotheses as questions. Providing a set of useful primitives operating in a single framework of related tasks would allow for expressive modelling, and easier model comparison and replication. To that
more » ... end, we present Jack the Reader (Jack), a framework for Machine Reading that allows for quick model prototyping by component reuse, evaluation of new models on existing datasets as well as integrating new datasets and applying them on a growing set of implemented baseline models. Jack is currently supporting (but not limited to) three tasks: Question Answering, Natural Language Inference, and Link Prediction. It is developed with the aim of increasing research efficiency and code reuse.
arXiv:1806.08727v1 fatcat:p4r52au3zzewvaop66sy4lbyxu

Convolutional 2D Knowledge Graph Embeddings

Tim Dettmers, Pasquale Minervini, Pontus Stenetorp, Sebastian Riedel
2017 Zenodo  
In this work, we introduce a convolutional neural network model, ConvE, for the task of link prediction. ConvE applies 2D convolution directly on embeddings, thus inducing spatial structure in embedding space. To scale to large knowledge graphs and prevent overfitting due to over-parametrization, previous work seeks to reduce parameters by performing simple transformations in embedding space. We take inspiration from computer vision, where convolution is able to learn multiple layers of
more » ... ar features while reducing the number of parameters through weight sharing. Applied naively, convolutional models for link prediction are computationally costly. However, by predicting all links simultaneously we improve test time performance by more than 300x on FB15k. We report state-of-the-art results for numerous previously introduced link prediction benchmarks, including the well-established FB15k and WN18 datasets. Previous work noted that these two datasets contain many reversible triples, but the severity of this issue was not quantified. To investigate this, we design a simple model that uses a single rule which reverses relations and achieves state-of-the-art results. We introduce WN18RR, a subset of WN18 which was constructed the same way as the previously proposed FB15k-237, to alleviate this problem and report results for our own and previously proposed models for all datasets. Analysis of our convolutional model suggests that it is particularly good at modelling nodes with high indegree and nodes with high PageRank and that 2D convolution applied on embeddings seems to induce contrasting pixel-level structures.
doi:10.5281/zenodo.833288 fatcat:lctoheg4zra4pmfiixkuzrvxpa

Towards Neural Theorem Proving at Scale [article]

Pasquale Minervini, Matko Bosnjak, Tim Rocktäschel, Sebastian Riedel
2018 arXiv   pre-print
Neural models combining representation learning and reasoning in an end-to-end trainable manner are receiving increasing interest. However, their use is severely limited by their computational complexity, which renders them unusable on real world datasets. We focus on the Neural Theorem Prover (NTP) model proposed by Rocktäschel and Riedel (2017), a continuous relaxation of the Prolog backward chaining algorithm where unification between terms is replaced by the similarity between their
more » ... g representations. For answering a given query, this model needs to consider all possible proof paths, and then aggregate results - this quickly becomes infeasible even for small Knowledge Bases (KBs). We observe that we can accurately approximate the inference process in this model by considering only proof paths associated with the highest proof scores. This enables inference and learning on previously impracticable KBs.
arXiv:1807.08204v1 fatcat:wh3gxfqnhvegbe5il4u4h6ldvm

Kurz kommentiert

Sebastian Dullien, Dirk Niepelt, Markus Groth, Tim Clamor, Michael Voigtländer
2012 Wirtschaftsdienst  
Tim Clamor, Michael Voigtländer Institut der deutschen Wirtschaft Köln  ...  Sebastian Dullien HTW Berlin und European Council on Foreign Relations Finanzmarkt "Mehr Europa" greift zu kurz Die Staaten der Europäischen Union suchen nach Wegen,  ... 
doi:10.1007/s10273-012-1446-4 fatcat:y7wpbgq5nvgmxpvrlolxe2jpwa

Industrie 4.0 – MaRCo Intelligente Instandhaltung

Ullrich Trommler, Sebastian Horbach, Tim Möckel
2017 Mensch & Computer  
MaRCo (Maintenance & Resource Cockpit) ist ein Softwaresystem zur ganzheitlichen Unterstützung des Instandhaltungsprozesses. Über integrierte Plug-In Schnittstellen können die Anlagen direkt an MaRCo angebunden werden. Die Schnittstelle ermöglicht, neben dem Empfangen von Stör- und Wartungsmeldungen, das Abrufen von Betriebsdaten. Des Weiteren können darüber auch betriebliche Informationssysteme z.B. ERP – Systeme angebunden werden. Im Katalogmodul von MaRCo werden die Stör- bzw. Wartungscodes
more » ... ngelegt und können mit den gewünschten Daten z.B. Dokumenten, Handlungsleitfäden, benötigten Instandsetzungsmaterialien bzw. – unter Verwendung des Skillsystems – vom Benutzer benötigten Qualifikationen / Zertifikaten, erweitert werden. Diese Informationen werden dem Benutzer bei der Auftragsbearbeitung zur Verfügung gestellt. Des Weiteren hat der Benutzer die Möglichkeit, im Auftragssystem mit anderen Benutzern über das Mitteilungssystem zu kommunizieren, seine Erfahrungen während des Instandhaltungsprozesses zu dokumentieren oder auftragsspezifische Dokumente hinzuzufügen. Dadurch können Instandsetzungsprozesse weiter optimiert und Erfahrungen weitergereicht werden. Die Betriebsdatenerfassung ermöglicht es dem Benutzer die aktuelle Betriebstüchtigkeit auszuwerten und eventuelle Fehlerquellen ausfindig zu machen. Für die Anzeige der Daten ist ein benutzerspezifisch anpassbares Tabellenkonstrukt implementiert. Jeder Benutzer kann sich die Anzeige nach seinen Präferenzen anpassen.
doi:10.18420/muc2017-ws04-0400 dblp:conf/mc/TrommlerHM17 fatcat:5rgskhlbhnahvncpuypemrbktq

End-to-End Differentiable Proving [article]

Tim Rocktäschel, Sebastian Riedel
2017 arXiv   pre-print
Acknowledgements We thank Pasquale Minervini, Tim Dettmers, Matko Bosnjak, Johannes Welbl, Naoya Inoue, Kai Arulkumaran, and the anonymous reviewers for very helpful comments on drafts of this paper.  ... 
arXiv:1705.11040v2 fatcat:tqpufnbsnfbjxhiax4uhb3jria


Marcel Sonneck, Anke Spannenberg, Sebastian Wohlrab, Tim Peppel
2017 IUCrData  
The title compound, C11H12O, has been prepared as a side product in the attempted room-temperature synthesis of (E)-1-phenylpent-2-en-1-one. The molecular structure consists of an approximately planar indanone core (r.m.s. deviation = 0.042 Å) with the ethyl group protruding from this plane. In the crystal, centrosymmetrically related molecules are linked into dimers by pairs of C—H...O hydrogen bonds, forming rings of R 2 2(10) graph-set motif. The dimers are further connected by C—H...π interactions into chains running parallel to [-101].
doi:10.1107/s2414314617016856 fatcat:p4ekxkcrnrbb5kgy2yl6gw2ala

Concept for a Service-oriented Architecture in Building Automation Systems

Tobias Teich, Sebastian Wolf, Tim Neumann, Sebastian Junghans, Susan Franke
2014 Procedia Engineering  
On the consumer side exists great potential to use energy more efficiently. To exploit this potential, an intelligent control of building automation is required. The building automation market offers a variety of technologies, which do not rely on uniform standards. The programming effort for the appropriate implementation of identical functions in different locations is enormous and can be significantly reduced through a virtualization approach. In this way, real devices are represented by
more » ... ual devices that interact with stakeholders through business processes. To describe the business processes, workflows are used which consist of individual reusable and combinable services. These services were grouped into three categories. In addition to the room-/building-control-category, services are divided into metering/analysis/reporting-category and monitoring/configuration/user interface-category. The flexible combination and coordination of services must be supported. This is done by the use of a serviceoriented architecture (SOA).
doi:10.1016/j.proeng.2014.03.031 fatcat:zal4gl27wbcqpoqy2zr7lbgrbq

Adversarial Sets for Regularising Neural Link Predictors [article]

Pasquale Minervini, Thomas Demeester, Tim Rocktäschel, Sebastian Riedel
2017 arXiv   pre-print
In adversarial training, a set of models learn together by pursuing competing goals, usually defined on single data instances. However, in relational learning and other non-i.i.d domains, goals can also be defined over sets of instances. For example, a link predictor for the is-a relation needs to be consistent with the transitivity property: if is-a(x_1, x_2) and is-a(x_2, x_3) hold, is-a(x_1, x_3) needs to hold as well. Here we use such assumptions for deriving an inconsistency loss,
more » ... the degree to which the model violates the assumptions on an adversarially-generated set of examples. The training objective is defined as a minimax problem, where an adversary finds the most offending adversarial examples by maximising the inconsistency loss, and the model is trained by jointly minimising a supervised loss and the inconsistency loss on the adversarial examples. This yields the first method that can use function-free Horn clauses (as in Datalog) to regularise any neural link predictor, with complexity independent of the domain size. We show that for several link prediction models, the optimisation problem faced by the adversary has efficient closed-form solutions. Experiments on link prediction benchmarks indicate that given suitable prior knowledge, our method can significantly improve neural link predictors on all relevant metrics.
arXiv:1707.07596v1 fatcat:5noybifxnjdq3civ6i44ulwoze

Deep-learning Autoencoder for Coherent and Nonlinear Optical Communication [article]

Tim Uhlemann, Sebastian Cammerer, Alexander Span, Sebastian Dörner, Stephan ten Brink
2020 arXiv   pre-print
Motivated by the recent success of end-to-end training of communications in the wireless domain, we strive to adapt the end-to-end-learning idea from the wireless case (i.e., linear) to coherent optical fiber links (i.e., nonlinear). Although, at first glance, it sounds like a straightforward extension, it turns out that several pitfalls exist - in terms of theory but also in terms of practical implementation. This paper analyzes the potential of an autoencoder and limitations for the optical
more » ... ber under the influence of Kerr-nonlinearity and chromatic dispersion. As there is no exact capacity limit known and, hence, no analytical perfect system solution available, we set great value to the interpretability on the learnings of the autoencoder. Therefore, we design its architecture to be as close as possible to the structure of a classic communication system, knowing that this may limit its degree of freedom and, thus, its performance. Nevertheless, we were able to achieve an unexpected high gain in terms of spectral efficiency compared to a conventional reference system.
arXiv:2006.15027v2 fatcat:wzdou3l3mfevpjdgb2ust54dym
« Previous Showing results 1 — 15 out of 9,304 results