1,729,886 research outputs found

    Second language phonology at the interface between acoustic and orthographic input

    Get PDF
    Recently researchers have become increasingly interested in the influence of orthographic forms on second language (L2) phonology. Orthographic forms (or spellings) represent the sounds and words of a language in writing. L2 learners, in particular those in instructed settings, are simultaneously exposed to the orthographic forms and the phonological forms of the target language. Recent investigations have indicated that orthographic input can affect learners’ phonological development and word learning in their second language in various ways. The availability of L2 orthographic forms in the input to L2 learners can facilitate speech production, perception, and/or word form learning (Escudero, Hayes-Harb, & Mitterer, 2008; Showalter & Hayes-Harb, 2013). It can hinder targetlike acquisition (Bassetti, 2007; Hayes-Harb, Nicol, & Barker, 2010), or it can have mixed effects or no effect at all (Escudero & Wanrooij, 2010; Simon, Chamblessb, & Alvesc, 2010)

    In the memory of Talaat Harb Pacha

    No full text
    Reviving the memory of Talaat Harb Pacha, Mahmoud Nabil Ibrahim, great-grandson of Talaat Harb, and Abdelaziz Ezz El Arab, professor at AUC, talk about how Talaat Harb dressed. Additionally, they highlight the occasion in which Talaat Harb attained the title Pacha, his achievements, and finally his career and personal challenges. This is a story about Talaat Harb Pacha the founder of Banque Misr and famous Egyptian economist, but what’s also interesting is that he’s a very distant relative from my mother\u27s side

    Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing

    Get PDF
    Boob et al. [Boob et al., 2020] described an iterative peeling algorithm called Greedy++ for the Densest Subgraph Problem (DSG) and conjectured that it converges to an optimum solution. Chekuri, Qaunrud and Torres [Chandra Chekuri et al., 2022] extended the algorithm to supermodular density problems (of which DSG is a special case) and proved that the resulting algorithm Super-Greedy++ (and hence also Greedy++) converges. In this paper we revisit the convergence proof and provide a different perspective. This is done via a connection to Fujishige’s quadratic program for finding a lexicographically optimal base in a (contra) polymatroid [Satoru Fujishige, 1980], and a noisy version of the Frank-Wolfe method from convex optimization [Frank and Wolfe, 1956; Jaggi, 2013]. This yields a simpler convergence proof, and also shows a stronger property that Super-Greedy++ converges to the optimal dense decomposition vector, answering a question raised in Harb et al. [Harb et al., 2022]. A second contribution of the paper is to understand Thorup’s work on ideal tree packing and greedy tree packing [Thorup, 2007; Thorup, 2008] via the Frank-Wolfe algorithm applied to find a lexicographically optimum base in the graphic matroid. This yields a simpler and transparent proof. The two results appear disparate but are unified via Fujishige’s result and convex optimization

    PC001-0097 (= PC001 No.103) Cairo - Soliman Pacha Square, 233 (現在のTalaat Harb Square、現在ある像はTalaat Harbのもの)

    No full text
    1952年の7月革命以降、改名された。現在立っている像はTalaat Harbのもので、西北西を向いている。また、フランス生まれであるSoliman Pasha像(アンリ・アルフレッド・ジャックマール作、1874年鋳造)は第二次中東戦争(スエズ動乱)を受けて1956年に外され、カイロのNational Military Museumに移設された。PNG形式, 幅2189 X 高さ1402pixel, 解像度:400dpi, 画像ピクセル形式:Format24bppRgb, 横長, 白黒写真boo
    corecore