Area-preserving C-oriented schematization

We define an edge-move operation for polygons and prove that every simple non-convex polygon P has a non-conflicting pair of complementary edge-moves that reduces the number of edges of P while preserving its area. We use this result to generate area-preserving C-oriented schematizations of polygons

A framework for algorithm stability

We say that an algorithm is stable if small changes in the input result in small changes in the output. Algorithm stability plays an important role when analyzing and visualizing time-varying data. However, so far, there are only few theoretical results on the stability of algorithms, possibly due to a lack of theoretical analysis tools. In this paper we present a framework for analyzing the stability of algorithms. We focus in particular on the tradeoff between the stability of an algorithm and the quality of the solution it computes. Our framework allows for three types of stability analysis with increasing degrees of complexity: event stability, topological stability, and Lipschitz stability. We demonstrate the use of our stability framework by applying it to kinetic Euclidean minimum spanning trees

Exploring curved schematization

Hand-drawn schematized maps traditionally make extensive use of curves. However, there are few automated approaches for curved schematization most previous work focuses on straight lines. We present a new algorithm for area-preserving curved schematization of geographic outlines. Our algorithm converts a simple polygon into a schematic crossing-free representation using circular arcs. We use two basic operations to iteratively replace consecutive arcs until the desired complexity is reached. Our results are not restricted to arcs ending at input vertices. The method can be steered towards different degrees of 'curviness': we can encourage or discourage the use of arcs with a large central angle via a single parameter. Our method creates visually pleasing results even for very low output complexities. We conducted an online user study investigating the effectiveness of the curved schematizations compared to straight-line schematizations of equivalent complexity. While the visual complexity of the curved shapes was judged higher than those using straight lines, users generally preferred curved schematizations. We observed that curves significantly improved the ability of users to match schematized shapes of moderate complexity to their unschematized equivalents

Topologically safe curved schematization

Traditionally schematized maps make extensive use of curves. However, automated methods for schematization are mostly restricted to straight lines. We present a generic framework for topology-preserving curved schematization that allows a choice of quality measures and curve types. Our fully-automated approach does not need critical points or salient features. We illustrate our framework with Bézier curves and circular arcs

Map schematization with circular arcs

We present an algorithm to compute schematic maps with circular arcs. Our algorithm iteratively replaces two consecutive arcs with a single arc to reduce the complexity of the output map and thus to increase its level of abstraction. Our main contribution is a method for replacing arcs that meet at high-degree vertices. This allows us to greatly reduce the output complexity, even for dense networks. We experimentally evaluate the effectiveness of our algorithm in three scenarios: territorial outlines, road networks, and metro maps. For the latter, we combine our approach with an algorithm to more evenly distribute stations. Our experiments show that our algorithm produces high-quality results for territorial outlines and metro maps. However, the lack of caricature (exaggeration of typical features) makes it less useful for road networks

Understanding the Neural Bases of Implicit and Statistical Learning

© 2019 Cognitive Science Society, Inc. Both implicit learning and statistical learning focus on the ability of learners to pick up on patterns in the environment. It has been suggested that these two lines of research may be combined into a single construct of “implicit statistical learning.” However, by comparing the neural processes that give rise to implicit versus statistical learning, we may determine the extent to which these two learning paradigms do indeed describe the same core mechanisms. In this review, we describe current knowledge about neural mechanisms underlying both implicit learning and statistical learning, highlighting converging findings between these two literatures. A common thread across all paradigms is that learning is supported by interactions between the declarative and nondeclarative memory systems of the brain. We conclude by discussing several outstanding research questions and future directions for each of these two research fields. Moving forward, we suggest that the two literatures may interface by defining learning according to experimental paradigm, with “implicit learning” reserved as a specific term to denote learning without awareness, which may potentially occur across all paradigms. By continuing to align these two strands of research, we will be in a better position to characterize the neural bases of both implicit and statistical learning, ultimately improving our understanding of core mechanisms that underlie a wide variety of human cognitive abilities

On Embeddability of Buses in Point Sets

Set membership of points in the plane can be visualized by connecting corresponding points via graphical features, like paths, trees, polygons, ellipses. In this paper we study the \emph{bus embeddability problem} (BEP): given a set of colored points we ask whether there exists a planar realization with one horizontal straight-line segment per color, called bus, such that all points with the same color are connected with vertical line segments to their bus. We present an ILP and an FPT algorithm for the general problem. For restricted versions of this problem, such as when the relative order of buses is predefined, or when a bus must be placed above all its points, we provide efficient algorithms. We show that another restricted version of the problem can be solved using 2-stack pushall sorting. On the negative side we prove the NP-completeness of a special case of BEP.Comment: 19 pages, 9 figures, conference version at GD 201

Evaluation, contrôle et prévention du risque de transmission du virus influenza aviaire à l'homme

Since mid-december 2003, an epizootic of highly pathogenic avian influenza (type A, sub-type H5N1) occurs in eastern and south-eastern Asia. This epizootic is historically unprecedented in its virulence, geographical spread, and economic consequences for the agricultural sector. Implications for human health were registered in Vietnam and in Thailand. This paper summarizes the current knowledge about the risk evaluation of the transmission of avian influenza virus to humans. The current asian epizootic has highlighted the key role of global health information systems and also the need for exhaustive notification of human and animal cases. It reinforces the concept of veterinary public health

A031 Développement d’un peptido-mimétique de la glycorpotein VI plaquettaire comme outil d’imagerie de la fibrose

ObjectifLa glycoprotéine VI est le récepteur d’activation des plaquettes par les collagènes de type I et de type III. Nous avons émis l’hypothèse que nous pourrions développer une sonde spécifique du collagène basée sur la spécificité de GPVI et que cette sonde permettrait de visualiser la fibrose in vivo par une méthode non invasive.MéthodesUn anticorps bloquant la liaison de GPVI au collagène a été utilisé pour cribler une banque peptidique permettant d’identifier un motif peptidique cyclique. La capacité du peptide à mimer la GPVI a été analysée par des études de liaison et de compétition en phase solide. La liaison au collagène tissulaire a été analysée par histochimie. L’imagerie in vivo a été réalisée par injection du peptide-marqué au Tc-99m dans un modèle de fibrose cicatricielle sur infarctus du myocarde chez le rat, scintigraphie et autoradiographieRésultatsLe peptide, nommé collagelin, se lie de manière spécifique à l’anticorps anti GPVI 9O12.2 et aux collagènes I et III in vitro et la liaison est inhibée par GPVI indiquant que le peptide mime GPVI. Cependant le collagelin n’inhibe pas l’agrégation des plaquettes induite par le collagène. Les études d’histochimie montrent que le collagelin se lie au collagène tissulaire sur coupe d’aorte et de queue de rat indiquant que le collagelin se comporte comme un traceur du collagène. Dans le modèle d’infarctus cicatriciel, une accumulation du collagelin radiomarqué est observée dans la zone cardiaque par scintigraphie planaire et tomographie chez les animaux avec MI mais pas chez les animaux contrôles ni avec un peptide contrôle. L’accumulation du traceur dans les zones de fibrose a été mise en évidence ex vivo par superposition des images d’autoradiographies et d’histologie sur coupes congelées.ConclusionNous avons produit un peptide qui mime en partie le site de liaison de GPVI au collagène. Ce peptide se comporte comme un traceur spécifique du collagène in vitro et in vivo. Nous proposons que ce traceur pourrait être utile pour le diagnostic et le suivi évolutif de la fibrose dans un grand nombre de pathologies