نتایج جستجو برای: shallow and deep latero

تعداد نتایج: 16873878  

2014
Carol Forsyth Arthur Philip Pavlik Keith Millis Borhan Samei

We investigated predictors of shallow and deep learning for 192 college students with high vs. low prior knowledge in a game-like intelligent tutoring system, OperationARA that has an eText, multiple-choice tests, case-based reasoning, and adaptive tutorial conversations. Students are expected to learn about 11 topics of research methodology across three modules that target factual information,...

Journal: :Journal of evolutionary biology 2005
K Østbye T F Naesje L Bernatchez O T Sandlund K Hindar

Combining morphological and genetic analysis, we compared patterns of diversification within and between morphs among sympatric European whitefish (Coregonus lavaretus L.) populations in Lake Femund, Norway. Seven external populations, from potential colonization routes into Lake Femund were included. We found that deep-, shallow-, river- and bay spawning populations are distinct morphs in Lake...

2003
J. H. Ding H. S. Tzou

Distributed sensing of structural states is essential to vibration control, health monitoring and shape control of precision structronic systems. Paraboloidal shells of revolution are widely used in aerospace, telecommunication, etc. structures. However, distributed sensing of paraboloidal shell structures is rarely investigated over the years. Micro-sensing characteristics, sensor segmentation...

2007
David Doty Philippe Moser

This paper introduces two complexity-theoretic formulations of Bennett’s logical depth: finite-state depth and polynomial-time depth. It is shown that for both formulations, trivial and random infinite sequences are shallow, and a slow growth law holds, implying that deep sequences cannot be created easily from shallow sequences. Furthermore, the E analogue of the halting language is shown to b...

2007
David Doty Philippe Moser

This paper introduces two complexity-theoretic formulations of Bennett’s logical depth: finite-state depth and polynomial-time depth. It is shown that for both formulations, trivial and random infinite sequences are shallow, and a slow growth law holds, implying that deep sequences cannot be created easily from shallow sequences. Furthermore, the E analogue of the halting language is shown to b...

2006
S. D. Howison J. R. Ockendon

This paper describes how tangential impact velocities can be incorporated into wellknown impact theories in deep and shallow water. Taking the deep and shallow flows in turn, it is shown how to link the normal impact Wagner and Korobkin theories to the tangential impact theories of planing and skimming respectively. An instability is revealed that limits the configurations that can be analysed ...

2007
David Doty Philippe Moser

This paper introduces two complexity-theoretic formulations of Bennett’s logical depth: finite-state depth and polynomial-time depth. It is shown that for both formulations, trivial and random infinite sequences are shallow, and a slow growth law holds, implying that deep sequences cannot be created easily from shallow sequences. Furthermore, the E analogue of the halting language is shown to b...

2009
Jürg Hunziker Evert Slob Kees Wapenaar

We review electromagnetic interferometry by multidimensional deconvolution (MDD) and investigate its sensitivity to spatial sampling. Two Sea Bed Logging datasets were modeled numerically. One represents a shallow sea situation with a small vertical source-receiver distance and the other a deep sea situation with a large vertical source-receiver distance. The reflection response from below the ...

2003
Ulrich Schäfer

The idea of the Whiteboard project is to integrate deep and shallow natural language processing components in order to benefit from their synergy. The project came up with the first fully integrated hybrid system consisting of a fast HPSG parser that utilizes tokenization, PoS, morphology, lexical, named entity, phrase chunk and (for German) topological sentence field analyses from shallow comp...

Journal: :Computer Languages, Systems & Structures 2015
Josef Svenningsson Emil Axelsson

When compiling embedded languages it is natural to use an abstract syntax tree to represent programs. This is known as a deep embedding and it is a rather cumbersome technique compared to other forms of embedding, typically leading to more code and being harder to extend. In shallow embeddings, language constructs are mapped directly to their semantics which yields more flexible and succinct im...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید