Search results for "grammar"

Increasing sample efficiency in deep reinforcement learning using generative environment modelling

2020

A. Socins Arabische Grammatik: Paradigmen, Literatur, Übungsstücke und Glossar

1909

Teksts vācu un arābu valodā, titullapa vācu valodā.

Using hypothetical knowledge for driving inductive synthesis

1998

Role for NK1 and NK2 receptors in the motor activity in mouse colon

2007

The present study examined the effects induced by endogenous and exogenous activation of NK(1) and NK(2) receptors on the mechanical activity of mouse proximal colon. Experiments were performed in vitro recording the changes in intraluminal pressure from isolated colonic segments. Electrical field stimulation in the presence of atropine and guanethidine produced a small relaxation, followed by nonadrenergic noncholinergic (NANC) contraction. SR140333, NK(1) receptor antagonist, or SR48968, NK(2) receptor antagonist, significantly reduced the contraction, although SR48968 appeared more efficacious. The co-administration of SR140333 and SR48968 virtually abolished the NANC contraction. [Sar(9…

Autoinhibition of nicotinic release of noradrenaline from postganglionic sympathetic nerves

1970

1. The effects of nicotine, DMPP (1,1-dimethylphenylpiperazine) and acetylcholine (plus atropine) on the isolated rabbit heart were investigated. Heart rate, amplitude of contraction, coronary flow and output of noradrenaline into the perfusate were recorded. Noradrenaline was estimated fluorimetrically. 2. All nicotinic drugs evoked a dose-dependent output of noradrenaline and increased the rate and the amplitude of contraction. Increases of heart rate in response to nicotine and DMPP and increases of amplitude of contraction in response to all nicotinic drugs were clearly related to the output of noradrenaline. 3. The dose-response curves of the noradrenaline output evoked by nicotine, DM…

CUSHAW2-GPU: Empowering Faster Gapped Short-Read Alignment Using GPU Computing

2014

We present CUSHAW2-GPU to accelerate the CUSHAW2 algorithm using compute unified device architecture (CUDA)-enabled GPUs. Two critical GPU computing techniques, namely intertask hybrid CPU-GPU parallelism and tile-based Smith-Waterman map backtracking using CUDA, are investigated to facilitate fast alignments. By aligning both simulated and real reads to the human genome, our aligner yields comparable or better performance compared to BWA-SW, Bowtie2, and GEM. Furthermore, CUSHAW2-GPU with a Tesla K20c GPU achieves significant speedups over the multithreaded CUSHAW2, BWA-SW, Bowtie2, and GEM on the 12 cores of a high-end CPU for both single-end and paired-end alignment.

“Questa donna dal viso netto e gioioso”: Simone de Beauvoir e la stampa italiana

2018

Proseguiamo la riscoperta di Simone de Beauvoir iniziata nel numero precedente: questa volta ripresentiamo due sue interviste dimenticate uscite nel 1959 e nel 1961 sul “Giorno” e su “Paese Sera”. 

Structural difficulty in grammatical evolution versus genetic programming

2013

Genetic programming (GP) has problems with structural difficulty as it is unable to search effectively for solutions requiring very full or very narrow trees. As a result of structural difficulty, GP has a bias towards narrow trees which means it searches effectively for solutions requiring narrow trees. This paper focuses on the structural difficulty of grammatical evolution (GE). In contrast to GP, GE works on variable-length binary strings and uses a grammar in Backus-Naur Form (BNF) to map linear genotypes to phenotype trees. The paper studies whether and how GE is affected by structural difficulty. For the analysis, we perform random walks through the search space and compare the struc…

Lettura critica "I confini di Babele". Il linguaggio e il mistero delle lingue impossibili

2017

On the decomposition of prefix codes

2017

Abstract In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its decompositions. We also give partial results on the problem of deciding whether a rational maximal prefix code decomposes over a finite prefix code.