Portrait du développement de la compétence orthographique d'élèves créolophones scolarisés au Québec de la maternelle à la troisième année

Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal

Approximate algorithms for credal networks with binary variables

This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can represent incomplete or vague beliefs, lack of data, and disagreements among experts; they can also encode models based on belief functions and possibilistic measures. All algorithms for approximate inference in this paper rely on exact inferences in credal networks based on polytrees with binary variables, as these inferences have polynomial complexity. We are inspired by approximate algorithms for Bayesian networks; thus the Loopy 2U algorithm resembles Loopy Belief Propagation, while the Iterated Partial Evaluation and Structured Variational 2U algorithms are, respectively, based on Localized Partial Evaluation and variational techniques. (C) 2007 Elsevier Inc. All rights reserved.

Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have to be scheduled without knowledge of what jobs will come afterwards. The processing times and the due dates become known when the order is placed. The order release date occurs only at the beginning of periodic intervals. A customized approximate dynamic programming method is introduced for this problem. The authors also present numerical experiments that assess the reliability of the new approach and show that it performs better than a myopic policy.

Approximate analytical solutions for porous catalysts with nonuniform activity

Using a novel finite integral transform technique, the problem of diffusion and chemical reaction in a porous catalyst with general activity profile is investigated theoretically. Analytical expressions for the effectiveness factor are obtained for pth order and Michaelis-Menten kinetics. Perturbation methods are employed to provide useful asymptotic solutions for large or small values of Thiele modulus and Biot number.

Pinch my wig or winch my pig: Spelling, spoonerisms and other language skills

Phonological processing skills have often been assumed to play a minimal role in skilled adult spelling despite evidence showing their importance in the development of spelling skills. The present study investigated the relationship between phonological awareness and spelling in adults. It was hypothesised that subjects demonstrating higher levels of spelling proficiency would also show superior phonological processing skills. This relationship was expected to be mediated by sound-spelling mapping knowledge. Given the irregularities of sound-spelling correspondences in English, it was also predicted that knowledge of orthographic conventions would be related to spelling competency. Two measures of each component skill were used on seventy three university students. As predicted, the importance of spelling-sound mapping skills in spelling were demonstrated, as was a relationship between phonological awareness and spelling-sound correspondences. In addition a moderate correlation was found between orthographic tasks and spelling performance. It was concluded that, among university students at least, phonological ability makes an important contribution to skilled adult spelling.

Spelling in adults: The role of reading skills and experience

One hundred university students completed tests of spelling production, vocabulary, reading comprehension, reading experience, and reading accuracy (ability to distinguish a previously read word from a similar distractor). Reading experience, as measured by an adaptation of the Author Recognition Test, and reading accuracy contributed to the prediction of spelling beyond the joint contribution of reading comprehension and vocabulary. The results are more consistent with a uni-process model of spelling based on the quality of word-specific orthographic learning, rather than with a dual-process account relying on both word-specific knowledge and rules.

Approximate controllability of second-order distributed implicit functional systems

In this paper we study the approximate controllability of control systems with states and controls in Hilbert spaces, and described by a second-order semilinear abstract functional differential equation with infinite delay. Initially we establish a characterization for the approximate controllability of a second-order abstract linear system and, in the last section, we compare the approximate controllability of a semilinear abstract functional system with the approximate controllability of the associated linear system. (C) 2008 Elsevier Ltd. All rights reserved.

Does a reading lexicon provide orthographic representations for spelling?

University students spelled low-frequency words to dictation and subsequently made lexical decisions to them. In Experiment I, lexical decisions were slower on words students had spelled incorrectly relative to words they had spelled correctly, and there A as a larger repetition benefit 101 incorrectly spelled words. In experiment 2, the latency advantage for items spelled correctly was replicated when words were presented for only 200 ms and also in a spelling recognition task, In Experiment 3. masked identity and form priming effects were similar for words that had been spelled correctly and incorrectly, Item spelling accuracy tracked word frequency effects in the way chat it combined with repetition and priming effects. we inter that an individuals learning with a word's orthography underlies word frequency and item spelling accuracy effects and that a single orthographic lexicon serves visual word recognition and spelling. (C) 2000 Elsevier Science (USA).

A two-competitive approximate schedulability analysis of CAN

Consider the problem of deciding whether a set of n sporadic message streams meet deadlines on a Controller Area Network (CAN) bus for a specified priority assignment. It is assumed that message streams have implicit deadlines and no release jitter. An algorithm to solve this problem is well known but unfortunately it time complexity is non-polynomial. We present an algorithm with polynomial time-complexity for computing an upper bound on the response times. Clearly, if the upper bound on the response time does not exceed the deadline then all deadlines are met. The pessimism of our approach is proven: if the upper bound of the response time exceeds the deadline then the response time exceeds the deadline as well for a CAN network with half the speed.

Approximate entropy normalized measures for analyzing social neurobiological systems

When considering time series data of variables describing agent interactions in social neurobiological systems, measures of regularity can provide a global understanding of such system behaviors. Approximate entropy (ApEn) was introduced as a nonlinear measure to assess the complexity of a system behavior by quantifying the regularity of the generated time series. However, ApEn is not reliable when assessing and comparing the regularity of data series with short or inconsistent lengths, which often occur in studies of social neurobiological systems, particularly in dyadic human movement systems. Here, the authors present two normalized, nonmodified measures of regularity derived from the original ApEn, which are less dependent on time series length. The validity of the suggested measures was tested in well-established series (random and sine) prior to their empirical application, describing the dyadic behavior of athletes in team games. The authors consider one of the ApEn normalized measures to generate the 95th percentile envelopes that can be used to test whether a particular social neurobiological system is highly complex (i.e., generates highly unpredictable time series). Results demonstrated that suggested measures may be considered as valid instruments for measuring and comparing complexity in systems that produce time series with inconsistent lengths.

Stability and error analysis for a numerical scheme to approximate elastic flow

Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik, Univ., Dissertation, 2015

Chebyshev polynomial approximation to approximate partial differential equations

This paper suggests a simple method based on Chebyshev approximation at Chebyshev nodes to approximate partial differential equations. The methodology simply consists in determining the value function by using a set of nodes and basis functions. We provide two examples. Pricing an European option and determining the best policy for chatting down a machinery. The suggested method is flexible, easy to program and efficient. It is also applicable in other fields, providing efficient solutions to complex systems of partial differential equations.

The analysis of approximate quickselect and related problems

Approximate Quickselect, a simple modification of the well known Quickselect algorithm for selection, can be used to efficiently find an element with rank k in a given range [i..j], out of n given elements. We study basic cost measures of Approximate Quickselect by computing exact and asymptotic results for the expected number of passes, comparisons and data moves during the execution of this algorithm. The key element appearing in the analysis of Approximate Quickselect is a trivariate recurrence that we solve in full generality. The general solution of the recurrence proves to be very useful, as it allows us to tackle several related problems, besides the analysis that originally motivated us. In particular, we have been able to carry out a precise analysis of the expected number of moves of the ith element when selecting the jth smallest element with standard Quickselect, where we are able to give both exact and asymptotic results. Moreover, we can apply our general results to obtain exact and asymptotic results for several parameters in binary search trees, namely the expected number of common ancestors of the nodes with rank i and j, the expected size of the subtree rooted at the least common ancestor of the nodes with rank i and j, and the expected distance between the nodes of ranks i and j.

An approximate mathematical model for solidification of a flowing liquid in a microchannel

A mathematical model is developed to analyse the combined flow and solidification of a liquid in a small pipe or two-dimensional channel. In either case the problem reduces to solving a single equation for the position of the solidification front. Results show that for a large range of flow rates the closure time is approximately constant, and the value depends primarily on the wall temperature and channel width. However, the ice shape at closure will be very different for low and high fluxes. As the flow rate increases the closure time starts to depend on the flow rate until the closure time increases dramatically, subsequently the pipe will never close.