EOIVC 2017

EOIVC 2017 | January 22 - February 5, 2017 Judges Daniel Heifetz (Chariman of the Jury) Andrés Cárdenes Charles Castleman Alexander Gilman Gudny Gudmundsdottir Ilya Kaler Vera Tsu Wei-Ling Accompanists Jun Cho Robert Koenig Sheng-Yuan Kuan Laura Garritson Parker Dan Sato Composer-in-Residence Dr. Thomas L. McKinley Commissioned Work: Dialogues Winner Sirena Huanghttps://spiral.lynn.edu/conservatory_eoivc/1000/thumbnail.jp

Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern Matching

Let S and S\u27 be two strings of the same length.We consider the following two variants of string matching. * Parameterized Matching: The characters of S and S\u27 are partitioned into static characters and parameterized characters. The strings are parameterized match iff the static characters match exactly and there exists a one-to-one function which renames the parameterized characters in S to those in S\u27. * Order-Preserving Matching: The strings are order-preserving match iff for any two integers i,j in [1,|S|], S[i] <= S[j] iff S\u27[i] <= S\u27[j]. Let P be a collection of d patterns {P_1, P_2, ..., P_d} of total length n characters, which are chosen from an alphabet Sigma. Given a text T, also over Sigma, we consider the dictionary indexing problem under the above definitions of string matching. Specifically, the task is to index P, such that we can report all positions j where at least one of the patterns P_i in P is a parameterized-match (resp. order-preserving match) with the same-length substring of $T$ starting at j. Previous best-known indexes occupy O(n * log(n)) bits and can report all occ positions in O(|T| * log(|Sigma|) + occ) time. We present space-efficient indexes that occupy O(n * log(|Sigma|+d) * log(n)) bits and reports all occ positions in O(|T| * (log(|Sigma|) + log_{|Sigma|}(n)) + occ) time for parameterized matching and in O(|T| * log(n) + occ) time for order-preserving matching

Global estimates on the number of people blind or visually impaired by cataract:a meta-analysis from 2000 to 2020

BACKGROUND: To estimate global and regional trends from 2000 to 2020 of the number of persons visually impaired by cataract and their proportion of the total number of vision-impaired individuals.METHODS: A systematic review and meta-analysis of published population studies and gray literature from 2000 to 2020 was carried out to estimate global and regional trends. We developed prevalence estimates based on modeled distance visual impairment and blindness due to cataract, producing location-, year-, age-, and sex-specific estimates of moderate to severe vision impairment (MSVI presenting visual acuity &lt;6/18, ≥3/60) and blindness (presenting visual acuity &lt;3/60). Estimates are age-standardized using the GBD standard population.RESULTS: In 2020, among overall (all ages) 43.3 million blind and 295 million with MSVI, 17.0 million (39.6%) people were blind and 83.5 million (28.3%) had MSVI due to cataract blind 60% female, MSVI 59% female. From 1990 to 2020, the count of persons blind (MSVI) due to cataract increased by 29.7%(93.1%) whereas the age-standardized global prevalence of cataract-related blindness improved by -27.5% and MSVI increased by 7.2%. The contribution of cataract to the age-standardized prevalence of blindness exceeded the global figure only in South Asia (62.9%) and Southeast Asia and Oceania (47.9%).CONCLUSIONS: The number of people blind and with MSVI due to cataract has risen over the past 30 years, despite a decrease in the age-standardized prevalence of cataract. This indicates that cataract treatment programs have been beneficial, but population growth and aging have outpaced their impact. Growing numbers of cataract blind indicate that more, better-directed, resources are needed to increase global capacity for cataract surgery.</p

Global estimates on the number of people blind or visually impaired by cataract:a meta-analysis from 2000 to 2020

BACKGROUND: To estimate global and regional trends from 2000 to 2020 of the number of persons visually impaired by cataract and their proportion of the total number of vision-impaired individuals.METHODS: A systematic review and meta-analysis of published population studies and gray literature from 2000 to 2020 was carried out to estimate global and regional trends. We developed prevalence estimates based on modeled distance visual impairment and blindness due to cataract, producing location-, year-, age-, and sex-specific estimates of moderate to severe vision impairment (MSVI presenting visual acuity &lt;6/18, ≥3/60) and blindness (presenting visual acuity &lt;3/60). Estimates are age-standardized using the GBD standard population.RESULTS: In 2020, among overall (all ages) 43.3 million blind and 295 million with MSVI, 17.0 million (39.6%) people were blind and 83.5 million (28.3%) had MSVI due to cataract blind 60% female, MSVI 59% female. From 1990 to 2020, the count of persons blind (MSVI) due to cataract increased by 29.7%(93.1%) whereas the age-standardized global prevalence of cataract-related blindness improved by -27.5% and MSVI increased by 7.2%. The contribution of cataract to the age-standardized prevalence of blindness exceeded the global figure only in South Asia (62.9%) and Southeast Asia and Oceania (47.9%).CONCLUSIONS: The number of people blind and with MSVI due to cataract has risen over the past 30 years, despite a decrease in the age-standardized prevalence of cataract. This indicates that cataract treatment programs have been beneficial, but population growth and aging have outpaced their impact. Growing numbers of cataract blind indicate that more, better-directed, resources are needed to increase global capacity for cataract surgery.</p

Global estimates on the number of people blind or visually impaired by Uncorrected Refractive Error: A meta-analysis from 2000 to 2020

BackgroundUncorrected refractive error (URE) is a readily treatable cause of visual impairment (VI). This study provides updated estimates of global and regional vision loss due to URE, presenting temporal change for VISION 2020MethodsData from population-based eye disease surveys from 1980–2018 were collected. Hierarchical models estimated prevalence (95% uncertainty intervals [UI]) of blindness (presenting visual acuity (VA) &lt; 3/60) and moderate-to-severe vision impairment (MSVI; 3/60 ≤ presenting VA &lt; 6/18) caused by URE, stratified by age, sex, region, and year. Near VI prevalence from uncorrected presbyopia was defined as presenting near VA &lt; N6/N8 at 40 cm when best-corrected distance (VA ≥ 6/12).ResultsIn 2020, 3.7 million people (95%UI 3.10–4.29) were blind and 157 million (140–176) had MSVI due to URE, a 21.8% increase in blindness and 72.0% increase in MSVI since 2000. Age-standardised prevalence of URE blindness and MSVI decreased by 30.5% (30.7–30.3) and 2.4% (2.6–2.2) respectively during this time. In 2020, South Asia GBD super-region had the highest 50+ years age-standardised URE blindness (0.33% (0.26–0.40%)) and MSVI (10.3% (8.82–12.10%)) rates. The age-standardized ratio of women to men for URE blindness was 1.05:1.00 in 2020 and 1.03:1.00 in 2000. An estimated 419 million (295–562) people 50+ had near VI from uncorrected presbyopia, a +75.3% (74.6–76.0) increase from 2000ConclusionsThe number of cases of VI from URE substantively grew, even as age-standardised prevalence fell, since 2000, with a continued disproportionate burden by region and sex. Global population ageing will increase this burden, highlighting urgent need for novel approaches to refractive service delivery

Deterministic broadcasting time with partial knowledge of the network

We consider the time of deterministic broadcasting in networks whose nodes have limited knowledge of network topology. Each node u knows only the part of the network within knowledge radius r from it, i.e., it knows the graph induced by all nodes at distance at most r from u. Apart from that, each node knows the maximum degree Delta of the network. One node of the network, called the source, has a message which has to reach all other nodes. We adopt the widely studied communication model called the one-way model in which, in every round, each node can communicate with at most one neighbor, and in each pair of nodes communicating in a given round, one can only send a message while the other can only receive it. This is the weakest of all store-and-forward models for point-to-point networks, and hence our algorithms work for other models as well, in at most the same time.We show trade-offs between knowledge radius and time of deterministic broadcasting, when the knowledge radius is small, i.e., when nodes are only aware of their close vicinity. While for knowledge radius 0, minimum broadcasting time is theta(e), where e is the number of edges in the network, broadcasting can be usually completed faster for positive knowledge radius. Our main results concern knowledge radius 1. We develop fast broadcasting algorithms and analyze their execution time. We also prove lower bounds on broadcasting time, showing that our algorithms are close to optimal