Letter processing and font information during reading: beyond distinctiveness, where vision meets design

Letter identification is a critical front end of the reading process. In general, conceptualizations of the identification process have emphasized arbitrary sets of distinctive features. However, a richer view of letter processing incorporates principles from the field of type design, including an emphasis on uniformities across letters within a font. The importance of uniformities is supported by a small body of research indicating that consistency of font increases letter identification efficiency. We review design concepts and the relevant literature, with the goal of stimulating further thinking about letter processing during reading

HDG-NEFEM with Degree Adaptivity for Stokes Flows

This paper presents the first degree adaptive procedure able to directly use the geometry given by a CAD model. The technique uses a hybridisable discontinuous Galerkin discretisation combined with a NURBS-enhanced rationale, completely removing the uncertainty induced by a polynomial approximation of curved boundaries that is common within an isoparametric approach. The technique is compared against two strategies to perform degree adaptivity currently in use. This paper demonstrates, for the first time, that the most extended technique for degree adaptivity can easily lead to a non-reliable error estimator if no communication with CAD software is introduced whereas if the communication with the CAD is done, it results in a substantial computing time. The proposed technique encapsulates the CAD model in the simulation and is able to produce reliable error estimators irrespectively of the initial mesh used to start the adaptive process. Several numerical examples confirm the findings and demonstrate the superiority of the proposed technique. The paper also proposes a novel idea to test the implementation of high-order solvers where different degrees of approximation are used in different elements

New Results about Properties and Semantics of Fuzzy Set-Theoretic Operators

International audienceThis communication is a first step towards a general approach to fuzzy set-theoretic operators, i.e. algebraic operators which coincide with set-operators when membership values are crisp. Some properties of subclasses of such fuzzy set-theoretic operators are investigated. Specific examples are given. An attempt to discuss a possible interpretation of these operators is proposed. The choice of a good operator in a given practical situation can be crucial in decision analysis, information retrieval, pattern recognition for the purpose of aggregating several pieces of information