586 research outputs found

    Privaatsust sĂ€ilitavad paralleelarvutused graafiĂŒlesannete jaoks

    Get PDF
    Turvalisel mitmeosalisel arvutusel pĂ”hinevate reaalsete privaatsusrakenduste loomine on SMC-protokolli arvutusosaliste ĂŒmmarguse keerukuse tĂ”ttu keeruline. Privaatsust sĂ€ilitavate tehnoloogiate uudsuse ja nende probleemidega kaasnevate suurte arvutuskulude tĂ”ttu ei ole paralleelseid privaatsust sĂ€ilitavaid graafikualgoritme veel uuritud. Graafikalgoritmid on paljude arvutiteaduse rakenduste selgroog, nagu navigatsioonisĂŒsteemid, kogukonna tuvastamine, tarneahela vĂ”rk, hĂŒperspektraalne kujutis ja hĂ”redad lineaarsed lahendajad. Graafikalgoritmide suurte privaatsete andmekogumite töötlemise kiirendamiseks ja kĂ”rgetasemeliste arvutusnĂ”uete tĂ€itmiseks on vaja privaatsust sĂ€ilitavaid paralleelseid algoritme. SeetĂ”ttu esitleb kĂ€esolev lĂ”putöö tipptasemel protokolle privaatsuse sĂ€ilitamise paralleelarvutustes erinevate graafikuprobleemide jaoks, ĂŒhe allika lĂŒhima tee, kĂ”igi paaride lĂŒhima tee, minimaalse ulatuva puu ja metsa ning algebralise tee arvutamise. Need uued protokollid on ĂŒles ehitatud kombinatoorsete ja algebraliste graafikualgoritmide pĂ”hjal lisaks SMC protokollidele. Nende protokollide koostamiseks kasutatakse ka ĂŒhe kĂ€suga mitut andmeoperatsiooni, et vooru keerukust tĂ”husalt vĂ€hendada. Oleme vĂ€ljapakutud protokollid juurutanud Sharemind SMC platvormil, kasutades erinevaid graafikuid ja vĂ”rgukeskkondi. Selles lĂ”putöös kirjeldatakse uudseid paralleelprotokolle koos nendega seotud algoritmide, tulemuste, kiirendamise, hindamiste ja ulatusliku vĂ”rdlusuuringuga. Privaatsust sĂ€ilitavate ĂŒhe allika lĂŒhimate teede ja minimaalse ulatusega puuprotokollide tegelike juurutuste tulemused nĂ€itavad tĂ”husat meetodit, mis vĂ€hendas tööaega vĂ”rreldes varasemate töödega sadu kordi. Lisaks ei ole privaatsust sĂ€ilitavate kĂ”igi paaride lĂŒhima tee protokollide hindamine ja ulatuslik vĂ”rdlusuuringud sarnased ĂŒhegi varasema tööga. Lisaks pole kunagi varem kĂ€sitletud privaatsust sĂ€ilitavaid metsa ja algebralise tee arvutamise protokolle.Constructing real-world privacy applications based on secure multiparty computation is challenging due to the round complexity of the computation parties of SMC protocol. Due to the novelty of privacy-preserving technologies and the high computational costs associated with these problems, parallel privacy-preserving graph algorithms have not yet been studied. Graph algorithms are the backbone of many applications in computer science, such as navigation systems, community detection, supply chain network, hyperspectral image, and sparse linear solvers. In order to expedite the processing of large private data sets for graphs algorithms and meet high-end computational demands, privacy-preserving parallel algorithms are needed. Therefore, this Thesis presents the state-of-the-art protocols in privacy-preserving parallel computations for different graphs problems, single-source shortest path (SSSP), All-pairs shortest path (APSP), minimum spanning tree (MST) and forest (MSF), and algebraic path computation. These new protocols have been constructed based on combinatorial and algebraic graph algorithms on top of the SMC protocols. Single-instruction-multiple-data (SIMD) operations are also used to build those protocols to reduce the round complexities efficiently. We have implemented the proposed protocols on the Sharemind SMC platform using various graphs and network environments. This Thesis outlines novel parallel protocols with their related algorithms, the results, speed-up, evaluations, and extensive benchmarking. The results of the real implementations of the privacy-preserving single-source shortest paths and minimum spanning tree protocols show an efficient method that reduced the running time hundreds of times compared with previous works. Furthermore, the evaluation and extensive benchmarking of privacy-preserving All-pairs shortest path protocols are not similar to any previous work. Moreover, the privacy-preserving minimum spanning forest and algebraic path computation protocols have never been addressed before.https://www.ester.ee/record=b555865

    Decolonial Foodurisms: From Plantations to Agricultural Spaces of Intersectional Healing

    Get PDF
    Considering the complex colonial histories and relationalities associated with agricultural food production, a reimagined future beyond the violent legacy of plantations is presented. Exploring land as the site for intersectional healing to take place, the symbiotic relationship between humans and food production is increasingly becoming a reality—a theoretical framework I propose called decolonial foodurisms (pronounced food-yoor-isms). Combining “food” and “futurism” to emphasize that our collective futures are predicated on food security and food justice for all and especially for marginalized and racialized communities with ancestral ties to agricultural violence, decolonial foodurisms aims to capture how intersectional healing can come into fruition through inclusive and intentional agriculture. Post-settlement agriculture through plantations and the current agricultural system is inextricably bound in colonialism and enslavement, the legacies of which continue to exclude and exploit the knowledge systems of racialized peoples. By archiving my ancestors’ labor records as Sakadas (contract laborers) during Hawaii’s plantation era and incorporating film analysis and photographs, I also attempt to unsettle colonial relationalities and forge decolonial pathways of healing for myself, my community, the land, and all peoples with ancestral connections to colonial and capitalist agricultural violence. Decolonial foodurisms is how we heal the climate, our bodies, our communities, and ultimately ourselves

    Zero-Knowledge Reductions and Confidential Arithmetic

    Get PDF
    The changes in computing paradigms to shift computations to third parties have resulted in the necessity of these computations to be provable. Zero-knowledge arguments are probabilistic arguments that are used to to verify computations without secret data being leaked to the verifying party. In this dissertation, we study zero-knowledge arguments with specific focus on reductions. Our main contributions are: Provide a thorough survey in a variety of zero-knowledge techniques and protocols. Prove various results of reductions that can be used to study interactive protocols in terms of subroutines. Additionally, we identify an issue in the analogous definition of zero-knowledge for reductions. We propose a potential solution to this issue. Design a novel matrix multiplication protocol based on reductions. Design protocols for arithmetic of fixed-point values of fixed-length

    Phase 1 LymfactinⓇ Study: Short-term Safety of Combined Adenoviral VEGF-C and Lymph Node Transfer Treatment for Upper Extremity Lymphedema

    Get PDF
    Objective: To study the safety and tolerability of LymfactinⓇ treatment combined with microvascular lymph node transfer surgery in patients with upper limb lymphedema.Background: Upper limb lymphedema is a common clinical challenge after breast cancer surgery and/or radiotherapy. LymfactinⓇ is an adenovirus type 5–based gene therapy involving expression of human vascular endothelial growth factor C (VEGF-C) in the damaged tissue. It aims to correct deficient lymphatic flow by promoting the growth and repair of lymphatic vessels.Methods: In Phase I, LymfactinⓇ was combined with microvascular lymph node transfer surgery to study the safety and tolerability of LymfactinⓇ and the biodistribution of the viral vector in patients with upper limb lymphedema.Results: Fifteen patients with breast cancer–associated secondary lymphedema of the upper arm were recruited between December 2016 and February 2018. Three patients received a lower dose (1 × 1010) and 12 a higher dose (1 × 1011) of viral particles, respectively. No dose-limiting toxicities were observed, and the study was completed with the pre-determined maximum dose. Commonly reported adverse events during the 12-month follow-up were common cold, fever, gastroenteritis, pain in the operation area, headache, muscle ache and elevated liver enzymes. Serious adverse events consisted of two erysipelas infections in the lymphedema arm (requiring hospitalization) and one hematoma of the flap donor site.Conclusions: After 12 months’ follow-up, results indicate that LymfactinⓇ is well tolerated. The study continues with a 36-months efficacy and 5 years safety follow-up of the patients. The oncological safety aspects of LymfactinⓇ will require a longer follow-up period.</p

    Universal Treatment of Reduction for One-Loop Integrals in Projective Space

    Full text link
    Recently a nice work about the understanding of one-loop integrals has been done in [1] using the tricks of the projective space language associated to their Feynman parametrization. We find this language is also very suitable to deal with the reduction problem of one-loop integrals with general tensor structures as well as propagators with arbitrary higher powers. In this paper, we show that how to combine Feynman parametrization and embedding formalism to give a universal treatment of reductions for general one-loop integrals, even including the degenerated cases, such as the vanishing Gram determinant. Results from this method can be written in a compact and symmetric form.Comment: 32 pages, 1 figur

    Human Orientation in Libraries A Study of University Libraries in Mumbai

    Get PDF
    The study assesses the navigational aspects from the University Library's first-time users’ point of view and evaluates the available guidance tools to facilitate ease of wayfinding and overall usability. It focuses on Human Orientation practices followed by university libraries in Mumbai. The physical settings of libraries, locations for departments and guidelines through appropriate signage, hoardings, displays, day to day library operations, and processes were taken into consideration to foresee the inconvenience, confusion, uncertainty, and irritation faced by users. The study used survey method is used for data collection. Findings and observations were analysed and recommendations were generated based on the facets of PMEST

    Vallejo: Cultura Infantil, parte del archivo andino rescatado en Trujillo

    Get PDF
    CĂ©sar Vallejo is the most important poet that Peru has produced and his work is acclaimed worldwide. This paper will be divided into two sections: a) discovery, foundation and finding of the magazine Cultura Infantil, whose complete collection is at Brigham Young University since 2019 and is valuable because Vallejo wrote ten of his initial poems in this magazine, which are going to be the sediment of themes and symbols that he will maintain in his later poetry; and b) a look at the didactic poem "Fosforescencia" (Phosphorescence). We will analyze the poem with the purpose of showing that this is an antecedent of the fantastic didactic poetry where Vallejo left themes such as the Andean world, its superstitions and the teacher-pupil relationship that will also be developed in his later poetry.CĂ©sar Vallejo es el poeta mĂĄs importante que ha producido el PerĂș y su obra es aclamada mundialmente. Este trabajo se dividirĂĄ en dos apartados: a) descubrimiento, fundaciĂłn y hallazgo de la revista Cultura Infantil, cuya colecciĂłn completa se encuentra en la Universidad de Brigham Young desde el 2019 y es valiosa porque Vallejo escribiĂł diez de sus poemas iniciales en esta revista, que van a ser el sedimento de temas y sĂ­mbolos que mantendrĂĄ en su poesĂ­a ulterior; y b) una mirada al poema didĂĄctico «Fosforescencia». Haremos un anĂĄlisis del poema con el propĂłsito de mostrar que este es un antecedente de la poesĂ­a didĂĄctica fantĂĄstica en donde Vallejo dejĂł plasmados temas como el mundo andino, sus supersticiones y la relaciĂłn de maestro-alumno que tambiĂ©n se desarrollarĂĄn en su poesĂ­a posterior

    Ritterspiel und Ringreiten im europĂ€ischen SĂŒdosten

    Get PDF

    The captive in Patagonia or, life among the giants : A personal narrative

    Get PDF

    Pressemitteilung: Schmelzende Arktis im Schnellvorlauf

    Get PDF