Search results for "CALL"
showing 10 items of 2320 documents
Levels of comprehension of scientific prose: the role of text variables
1998
Abstract This research investigates the role played on shallow and deep levels of comprehension by textual changes that are aimed at: (a) improving the relationships within text ideas, and (b) producing better links between text ideas and the reader's knowledge. Four versions of a long physics passage were elaborated combining both kinds of textual changes. Four groups of tenth graders were each given one of the four versions. Different measures representative of these levels of comprehension were taken: getting main ideas, recall, and problem solving. The results indicated that: (a) main idea performance was affected by improving the relationships within text ideas, (b) both textual change…
Efficient formulation of a two-noded geometrically exact curved beam element
2021
The article extends the formulation of a 2D geometrically exact beam element proposed by Jirasek et al. (2021) to curved elastic beams. This formulation is based on equilibrium equations in their integrated form, combined with the kinematic relations and sectional equations that link the internal forces to sectional deformation variables. The resulting first-order differential equations are approximated by the finite difference scheme and the boundary value problem is converted to an initial value problem using the shooting method. The article develops the theoretical framework based on the Navier-Bernoulli hypothesis, with a possible extension to shear-flexible beams. Numerical procedures …
Descriptive Complexity, Lower Bounds and Linear Time
1999
This paper surveys two related lines of research: Logical characterizations of (non-deterministic) linear time complexity classes, and non-expressibility results concerning sublogics of existential second-order logic. Starting from Fagin’s fundamental work there has been steady progress in both fields with the effect that the weakest logics that are used in characterizations of linear time complexity classes are closely related to the strongest logics for which inexpressibility proofs for concrete problems have been obtained. The paper sketches these developments and highlights their connections as well as the obstacles that prevent us from closing the remaining gap between both kinds of lo…
Equivalence closure in the two-variable guarded fragment
2015
We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.
Modular Strategies for Recursive Game Graphs
2006
AbstractMany problems in formal verification and program analysis can be formalized as computing winning strategies for two-player games on graphs. In this paper, we focus on solving games in recursive game graphs which can model the control flow in sequential programs with recursive procedure calls. While such games can be viewed as the pushdown games studied in the literature, the natural notion of winning in our framework requires the strategies to be modular with only local memory; that is, resolution of choices within a module does not depend on the context in which the module is invoked, but only on the history within the current invocation of the module. While reachability in (global…
Detection of developmental dyslexia with machine learning using eye movement data
2021
Dyslexia is a common neurocognitive learning disorder that can seriously hinder individuals’ aspirations if not detected and treated early. Instead of costly diagnostic assessment made by experts, in the near future dyslexia might be identified with ease by automated analysis of eye movements during reading provided by embedded eye tracking technology. However, the diagnostic machine learning methods need to be optimized first. Previous studies with machine learning have been quite successful in identifying dyslexic readers, however, using contrasting groups with large performance differences between diagnosed and good readers. A practical challenge is to identify also individuals with bord…
A modeling study suggesting how a reduction in the context-dependent input on CA1 pyramidal neurons could generate schizophrenic behavior.
2011
The neural mechanisms underlying schizophrenic behavior are unknown and very difficult to investigate experimentally, although a few experimental and modeling studies suggested possible causes for some of the typical psychotic symptoms related to this disease. The brain region most involved in these processes seems to be the hippocampus, because of its critical role in establishing memories for objects or events in the context in which they occur. In particular, a hypofunction of the N-methyl-D-aspartate (NMDA) component of the synaptic input on the distal dendrites of CA1 pyramidal neurons has been suggested to play an important role for the emergence of schizophrenic behavior. Modeling st…
Automatic Calibration of an Industrial RGB-D Camera Network Using Retroreflective Fiducial Markers
2019
This paper describes a non-invasive, automatic, and robust method for calibrating a scalable RGB-D sensor network based on retroreflective ArUco markers and the iterative closest point (ICP) scheme. We demonstrate the system by calibrating a sensor network comprised of six sensor nodes positioned in a relatively large industrial robot cell with an approximate size of 10 m × 10 m × 4 m . Here, the automatic calibration achieved an average Euclidean error of 3 c m at distances up to 9.45 m . To achieve robustness, we apply several innovative techniques: Firstly, we mitigate the ambiguity problem that occurs when detecting a marker at long range or low resolution by comparing the…
Improved Statistically Based Retrievals via Spatial-Spectral Data Compression for IASI Data
2019
In this paper, we analyze the effect of spatial and spectral compression on the performance of statistically based retrieval. Although the quality of the information is not com- pletely preserved during the coding process, experiments reveal that a certain amount of compression may yield a positive impact on the accuracy of retrievals. We unveil two strategies, both with interesting benefits: either to apply a very high compression, which still maintains the same retrieval performance as that obtained for uncompressed data; or to apply a moderate to high compression, which improves the performance. As a second contribution of this paper, we focus on the origins of these benefits. On the one…
Transformations that preserve learnability
1996
We consider transformations (performed by general recursive operators) mapping recursive functions into recursive functions. These transformations can be considered as mapping sets of recursive functions into sets of recursive functions. A transformation is said to be preserving the identification type I, if the transformation always maps I-identifiable sets into I-identifiable sets.