979 research outputs found

    Undergraduate Catalog of Studies, 2023-2024

    Get PDF

    Graduate Catalog of Studies, 2023-2024

    Get PDF

    Undergraduate Catalog of Studies, 2023-2024

    Get PDF

    Graduate Catalog of Studies, 2023-2024

    Get PDF

    La traduzione specializzata all’opera per una piccola impresa in espansione: la mia esperienza di internazionalizzazione in cinese di Bioretics© S.r.l.

    Get PDF
    Global markets are currently immersed in two all-encompassing and unstoppable processes: internationalization and globalization. While the former pushes companies to look beyond the borders of their country of origin to forge relationships with foreign trading partners, the latter fosters the standardization in all countries, by reducing spatiotemporal distances and breaking down geographical, political, economic and socio-cultural barriers. In recent decades, another domain has appeared to propel these unifying drives: Artificial Intelligence, together with its high technologies aiming to implement human cognitive abilities in machinery. The “Language Toolkit – Le lingue straniere al servizio dell’internazionalizzazione dell’impresa” project, promoted by the Department of Interpreting and Translation (ForlĂŹ Campus) in collaboration with the Romagna Chamber of Commerce (ForlĂŹ-Cesena and Rimini), seeks to help Italian SMEs make their way into the global market. It is precisely within this project that this dissertation has been conceived. Indeed, its purpose is to present the translation and localization project from English into Chinese of a series of texts produced by Bioretics© S.r.l.: an investor deck, the company website and part of the installation and use manual of the Aliquis© framework software, its flagship product. This dissertation is structured as follows: Chapter 1 presents the project and the company in detail; Chapter 2 outlines the internationalization and globalization processes and the Artificial Intelligence market both in Italy and in China; Chapter 3 provides the theoretical foundations for every aspect related to Specialized Translation, including website localization; Chapter 4 describes the resources and tools used to perform the translations; Chapter 5 proposes an analysis of the source texts; Chapter 6 is a commentary on translation strategies and choices

    Undergraduate Catalog of Studies, 2022-2023

    Get PDF

    Higher-Order MSL Horn Constraints

    Get PDF

    Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs

    Full text link
    Polyregular functions are the class of string-to-string functions definable by pebble transducers (an extension of finite automata) or equivalently by MSO interpretations (a logical formalism). Their output length is bounded by a polynomial in the input length: a function computed by a kk-pebble transducer or by a kk-dimensional MSO interpretation has growth rate O(nk)O(n^k). Boja\'nczyk has recently shown that the converse holds for MSO interpretations, but not for pebble transducers. We give significantly simplified proofs of those two results, extending the former to first-order interpretations by reduction to an elementary property of N\mathbb{N}-weighted automata. For any kk, we also prove the stronger statement that there is some quadratic polyregular function whose output language differs from that of any kk-fold composition of macro tree transducers (and which therefore cannot be computed by any kk-pebble transducer). In the special case of unary input alphabets, we show that kk pebbles suffice to compute polyregular functions of growth O(nk)O(n^k). This is obtained as a corollary of a basis of simple word sequences whose ultimately periodic combinations generate all polyregular functions with unary input. Finally, we study polyregular and polyblind functions between unary alphabets (i.e. integer sequences), as well as their first-order subclasses.Comment: 27 pages, not submitted ye

    Fast Algorithms for Separable Linear Programs

    Full text link
    In numerical linear algebra, considerable effort has been devoted to obtaining faster algorithms for linear systems whose underlying matrices exhibit structural properties. A prominent success story is the method of generalized nested dissection~[Lipton-Rose-Tarjan'79] for separable matrices. On the other hand, the majority of recent developments in the design of efficient linear program (LP) solves do not leverage the ideas underlying these faster linear system solvers nor consider the separable structure of the constraint matrix. We give a faster algorithm for separable linear programs. Specifically, we consider LPs of the form min⁥Ax=b,l≀x≀uc⊀x\min_{\mathbf{A}\mathbf{x}=\mathbf{b}, \mathbf{l}\leq\mathbf{x}\leq\mathbf{u}} \mathbf{c}^\top\mathbf{x}, where the graphical support of the constraint matrix A∈Rn×m\mathbf{A} \in \mathbb{R}^{n\times m} is O(nα)O(n^\alpha)-separable. These include flow problems on planar graphs and low treewidth matrices among others. We present an O~((m+m1/2+2α)log⁥(1/Ï”))\tilde{O}((m+m^{1/2 + 2\alpha}) \log(1/\epsilon)) time algorithm for these LPs, where Ï”\epsilon is the relative accuracy of the solution. Our new solver has two important implications: for the kk-multicommodity flow problem on planar graphs, we obtain an algorithm running in O~(k5/2m3/2)\tilde{O}(k^{5/2} m^{3/2}) time in the high accuracy regime; and when the support of A\mathbf{A} is O(nα)O(n^\alpha)-separable with α≀1/4\alpha \leq 1/4, our algorithm runs in O~(m)\tilde{O}(m) time, which is nearly optimal. The latter significantly improves upon the natural approach of combining interior point methods and nested dissection, whose time complexity is lower bounded by Ω(m(m+mαω))=Ω(m3/2)\Omega(\sqrt{m}(m+m^{\alpha\omega}))=\Omega(m^{3/2}), where ω\omega is the matrix multiplication constant. Lastly, in the setting of low-treewidth LPs, we recover the results of [DLY,STOC21] and [GS,22] with significantly simpler data structure machinery.Comment: 55 pages. To appear at SODA 202

    On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free Languages

    Get PDF
    • 

    corecore