1,049 research outputs found
Armand Robin: a pulsão politradutória
No full textThis study approaches the polytranslation impulse by analyzing its manifestation in the writings of the Breton poet translator Armand Robin (1912 - 1961). This impulse, bound to an intended metaphysics in Berman\u27s writings (1984) - defined as the romantic quest for the "pure language" —, is reevaluated in this essay focusing on the aspects concerning Robin mentioned previously. Although he forsakes being an Author and claims the denial of himself (rejection), underlying this exalted chronicle of non-translation there is an attempt to subvert an ethnocentric French tradition and an inner desire of authorship (reassurance and acceptance).Em sua obra L\u27épreuve de l\u27étranger (1984), Berman propõe uma teoria sobre o sujeito politradutor que vincula a pulsion du traduire do poète breton Armand Robin a uma visada metafísica — definida por este autor como a busca romântica da "pura língua". No presente ensaio, essas conclusões são reavaliadas a partir de referências inéditas sobre o poeta abordadas antecipadamente. Embora ele tenha renunciado a ser Autor e tenha proclamado a negação de si mesmo (rejeição), subjazem a essa crônica exaltada denominada non-traduction tanto a tentativa de subverter uma tradição francesa etnocêntrica quanto o desejo íntimo de se ver autor (afirmação e aceitação)
Phylogenetic relationships, song and distribution of the endangered Rufous-headed Robin Larvivora ruficeps
No full textThe Rufous-headed Robin Larvivora ruficeps is one of the world's rarest and least known birds. We summarize the known records since it was first described in 1905 from Shaanxi Province, central China. All subsequent Chinese records are from seven adjacent localities in nearby Sichuan Province. We studied its phylogenetic position for the first time using mitochondrial and nuclear markers for all species of Larvivora and a broad selection of other species in the family Muscicapidae. Our results confirmed that L. ruficeps is appropriately placed in the genus Larvivora, and suggested that it is sister to the Rufous-tailed Robin Larvivora sibilans, with these two forming a sister clade to a clade comprising both the Japanese Robin Larvivora akahige and Ryukyu Robin Larvivora komadori. Siberian Blue Robin Larvivora cyane and Indian Blue Robin Larvivora brunnea form the sister clade to the other Larvivora species. In contrast, song analyses indicated that the song of L. ruficeps is most similar to that of L. komadori, whereas the song of L. sibilans is relatively more similar to that of L. akahige, and songs of L. cyane and L. brunnea closely resemble each other. We used ecological niche modelling to estimate the suitable habitats of L. ruficeps based on the records from breeding grounds, suggesting that north and central Sichuan, south Gansu, south Shaanxi and south-east Tibet are likely to contain the most suitable habitats for this species.Jornvall Foundation; Sound Approach; National Science Foundation of China [31471990]; Ministry of Science and Technology of the People's Republic of China (MOST) [2011FY120200-3]; NSFC programme [J1210002]SCI(E)ARTICLE1204-21615
The Robin problem for the Helmholtz equation in a starlike planar domain
No full textThe interior and exterior Robin problems for the Helmholtz equation in starlike planar domains are addressed by using a suitable Fourier-like technique. Attention is in particular focused on normal-polar domains whose boundaries are defined by the so-called “superformula” introduced by J. Gielis. A dedicated numerical procedure based on the computer algebra system Mathematica© is developed in order to validate the proposed approach. In this way, highly accurate approximations of the solution, featuring properties similar to the classical ones, are obtained. The computed results are found to be in good agreement with the theoretical findings on Fourier series expansion presented by L. Carleson.TelecommunicationsElectrical Engineering, Mathematics and Computer Scienc
Cervico-thoracic kyphosis in a girl with Pierre Robin sequence
No full textCongenital cervico-thoracic kyphosis has been encountered in a girl with Pierre Robin sequence. The constellation of the spine malformation complex such as incomplete development of the vertebral bodies associated with defective ossification of the cervico-thoracic pedicles causing effectively the development of complete spinal cord injury at the kyphotic level of C7/T1 were present. Congenital kyphosis secondary to vertebral body hypoplasia has not been reported in connection with Pierre Robin sequence
A comparison of fair sharing algorithms for regulating search as a service API
No full textProviders of a Search as a Service (SaaS) environment must ensure that their users will not monopolize the service or use more than their fair share of resources. Fair sharing algorithms have long been used in computer networking to balance access to a router or switch, and some of these algorithms have also been applied to the control of queries submitted to search engine APIs. If a search query’s execution cost can be reliably estimated, fair sharing algorithms can be applied to the input of a SaaS API to ensure everyone has equitable access to the search engine.
The novelty of this paper lies in presenting a Single-Server Max-Min Fair Deficit Round Robin algorithm, a modified version of the Multi-Server Max-Min Fair Deficit Round Robin algorithm. The Single-Server Max-Min Fair Deficit Round Robin algorithm is compared to three other fair sharing algorithms, token-bucket, Deficit Round Robin (DRR), and Peng and Plale’s [1] Modified Deficit Round Robin (MDRR) in terms of three different usage scenarios, balanced usage, unbalanced usage as well as an idle client usage, to determine which is the most suitable fair sharing algorithm for use in regulating traffic to a SaaS API. This research demonstrated that the Single-Server Max-Min Fair DRR algorithm provided the highest throughput of traffic to the search engine while also maintaining a fair balance of resources among clients by re-allocating unused throughput to clients with saturated queues so a max-min allocation was achieved.Journal ArticleFinal article publishe
convex segmentation and mixed-integer footstep planning for a walking robot
No full textThesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (pages 77-82).This work presents a novel formulation of the footstep planning problem as a mixed-integer convex optimization. The footstep planning problem involves choosing a set of footstep locations which a walking robot can follow to safely reach a goal through an environment with obstacles. Rather than attempting to avoid the obstacles, which would require nonconvex constraints, we use integer variables to assign each footstep to a convex region of obstacle-free terrain, while simultaneously optimizing its pose within that safe region. Since existing methods for generating convex obstacle-free regions were ill-suited to this task, we also present IRIS (Iterative Regional In Inflation by Semidefinite programming), a new method to generate such regions through a series of convex optimizations. Combining IRIS with the mixed-integer optimization gives a complete footstep planning architecture, which can produce complex footstep plans on height map data constructed from onboard sensors. We demonstrate the footstep planner in simulated environments and with real data sensed by the Atlas humanoid, and we discuss future applications to running robots, aerial vehicles, and robots with more than two legs.by Robin L. H. Deits.S.M
Theology in suspense : how the detective fiction of P.D. James provokes theological thought
No full textElectronic redacted version excludes material for which permission has not been granted by the rights holderThe following dissertation argues that the detective fiction of P.D. James
provokes her readers to think theologically. I present evidence from the body of
James’s work, including her detective fiction that features the Detective Adam
Dalgliesh, as well as her other novels, autobiography, and non-fiction work. I also
present a brief history of detective fiction. This history provides the reader with a
better understanding of how P.D James is influenced by the detective genre as well as
how she stands apart from the genre’s traditions.
This dissertation relies on an interview that I conducted with P.D. James in
November, 2008. During the interview, I asked James how Christianity has
influenced her detective fiction and her responses greatly contribute to this
dissertation. However, James’s novels should be interpreted and explored in the
manner that they are received by the reader. How the reader receives and responds to
the novels, not only how James writes the novels, is what causes her stories to
provoke theological thinking.
By examining Christian symbolism that is present in setting, character, the
Detective Adam Dalgliesh, and plot, this dissertation seeks to assert that James
contributes to a theological conversation through her popular detective fiction
Memory-Disaggregated In-Memory Object Store Framework for Big Data Applications
No full textThe concept of memory disaggregation has recently been gaining traction in research. With memory disaggregation, data center compute nodes can directly access memory on adjacent nodes and are therefore able to overcome local memory restrictions, introducing a new data management paradigm for distributed computing. This paper proposes and demonstrates a memory disaggregated in-memory object store framework for big data applications by leveraging the newly introduced Thymes-isFlow memory disaggregation system. The framework extends the functionality of the pre-existing Apache Arrow Plasma object store framework to distributed systems by enabling clients to easily and efficiently produce and consume data objects across multiple compute nodes. This allows big data applications to increasingly leverage parallel processing at reduced development costs. In addition, the paper includes latency and throughput measurements that indicate only a modest performance penalty is incurred for remote disaggregated memory access as opposed to local (~6.5 vs ~5.75 GiB/s). The results can be used to guide the design of future systems that leverage memory disaggregation as well as the newly presented framework. This work is open-source and publicly accessible at https://doi.org/10.5281/zenodo.6368998.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Computer Engineerin
Learning contact-aware robot controllers from mixed integer optimization
No full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (pages 117-128).The problem of handling contact is central to the task of controlling a walking robot. Robots can only move through the world by exerting forces on their environment, and choosing where, when, and how to touch the world is the fundamental challenge of locomotion. Because the space of possible contacts is a high-dimensional mix of discrete and continuous decisions, it has historically been difficult or impossible to make complex contact decisions online at control rates. This work first presents an approach to contact planning which is able to make some guarantees of global optimality through mixed-integer programming. That method is applied successfully to a humanoid robot in laboratory conditions, but proves difficult to rely on when the robot is experiences unmodeled disturbances. To overcome those limitations, this thesis also introduces LVIS (Learning from Value Interval Sampling) a new approach to the control of walking robots which allows complex contact decisions to be made online using a cost function trained from offline trajectory optimizations. The LVIS algorithm is demonstrated on a simple cart-pole system with walls as well as a simplified bipedal robot model, and its success at allowing both models to use contact decisions to recover from external disturbances is demonstrated in simulation.by Robin L. H. Deits.Ph. D.Ph.D. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Scienc
- …
