1,722,052 research outputs found
Code repository: Turnover of strain-level diversity modulates functional traits in the honeybee gut microbiome between nurses and foragers
No full text<p>The code was prepared for the publication "Turnover of strain-level diversity modulates functional traits in the honeybee gut microbiome between nurses and foragers" and is referenced as a link to the connected GitHub repository in the associated preprint. Further information can be found in the README.md file in the associated GitHub<a href="https://github.com/Aiswarya-prasad/Publication_Baud_metaG_NvsF_2023"> repository</a>, which is also the source of the most up-to-date documentation.</p>
Code repository: Turnover of strain-level diversity modulates functional traits in the honeybee gut microbiome between nurses and foragers
No full text<p>The code was prepared for the publication "Turnover of strain-level diversity modulates functional traits in the honeybee gut microbiome between nurses and foragers" and is referenced as a link to the connected GitHub repository in the associated preprint. Further information can be found in the README.md file in the associated GitHub<a href="https://github.com/Aiswarya-prasad/Publication_Baud_metaG_NvsF_2023"> repository</a>, which is also the source of the most up-to-date documentation.</p>
Menghayati Asta Aiswarya Sebagai Kemahakuasaan Sang Hyang Widhi
Get PDFAiswarya is the form and nature of Ida Sang Hyang Widhi Wasa's omnipotence, both temporal and noetic, consisting of eight kinds of power, so that Aiswarya is also called Asta Aiswarya. Etymologically, asta aiswarya comes from the word "asta" which means eight and "aiswarya" which means omnipotence. So asta aiswarya are eight attributes of the omnipotence of Ida Sang Hyang Widhi Wasa (God Almighty). In the book Wrhaspatittatwa sloka 66 there is information about the attributes of God's omnipotence, including Anima, which means God is the smallest, Laghima which means the greatest, Prapti which means reaching all places, Isitwa which means beyond everything, Prakamya which means absolute will, Wasitwa which means powerful, and Yatrakamawasaitwa which means natural or unchangeable. Apart from the Wrhaspatittatwa teachings of Asta Aiswarya, they are also found in Bhagavadgita X.20, Rg. Weda X.90.1, Lontar Bhuana Kosa II.17, and Atharva Weda IV.16.2. This article will discuss the efforts to live up to the omnipotence of Ida Sang Hyang Widhi (God) as Asta Aiswary
Reasoning About Distributed Systems: WYSIWYG (Invited Talk)
No full textThere are two schools of thought on reasoning about distributed systems: one following interleaving based semantics, and one following partial-order/graph based semantics. This paper compares these two approaches and argues in favour of the latter. An introductory treatment of the split-width technique is also provided
Data Multi-Pushdown Automata
Get PDFWe extend the classical model of multi-pushdown systems by considering systems that operate on a finite set of variables ranging over natural numbers. The conditions on variables are defined via gap-order constraints that allow to compare variables for equality, or to check that the gap between the values of two variables exceeds a given natural number. Furthermore, each message inside a stack is equipped with a data item representing its value. When a message is pushed to the stack, its value may be defined by a variable. When a message is popped, its value may be copied to a variable. Thus, we obtain a system that is infinite in multiple dimensions, namely we have a number of stacks that may contain an unbounded number of messages each of which is equipped with a natural number.
It is well-known that the verification of any non-trivial property of multi-pushdown systems is undecidable, even for two stacks and for a finite data-domain. In this paper, we show the decidability of the reachability problem for the classes of data multi-pushdown system that admit a bounded split-width (or equivalently a bounded tree-width). As an immediate consequence, we obtain decidability for several subclasses of data multi-pushdown systems. These include systems with single stacks, restricted ordering policies on stack operations, bounded scope, bounded phase, and bounded context switches
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers
Get PDFWe study the satisfiability of string constraints where context-free membership constraints may be imposed on variables. Additionally a variable may be constrained to be a subword of a word obtained by shuffling variables and their transductions. The satisfiability problem is known to be undecidable even without rational transductions. It is known to be NExptime-complete without transductions, if the subword relations between variables do not have a cyclic dependency between them. We show that the satisfiability problem stays decidable in this fragment even when rational transductions are added. It is 2NExptime-complete with context-free membership, and NExptime-complete with only regular membership. For the lower bound we prove a technical lemma that is of independent interest: The length of the shortest word in the intersection of a pushdown automaton (of size (n)) and n finite-state automata (each of size (n)) can be double exponential in n
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Edit Distance of Finite State Transducers
Get PDFWe lift metrics over words to metrics over word-to-word transductions, by defining the distance between two transductions as the supremum of the distances of their respective outputs over all inputs. This allows to compare transducers beyond equivalence.
Two transducers are close (resp. k-close) with respect to a metric if their distance is finite (resp. at most k). Over integer-valued metrics computing the distance between transducers is equivalent to deciding the closeness and k-closeness problems. For common integer-valued edit distances such as, Hamming, transposition, conjugacy and Levenshtein family of distances, we show that the closeness and the k-closeness problems are decidable for functional transducers. Hence, the distance with respect to these metrics is also computable.
Finally, we relate the notion of distance between functions to the notions of diameter of a relation and index of a relation in another. We show that computing edit distance between functional transducers is equivalent to computing diameter of a rational relation and both are a specific instance of the index problem of rational relations
- …
