This paper studies the translation of style in the book Die Welt auf dem Teller by Doris Dörrie (2020) from German into Swedish. It is argued that the style is partly held in punctuation and sentence length and the focus of the study is how these can be translated from German into Swedish, considering their importance for the text style.  The analysis shows that the source text has a more differentiated use of punctuation whereas the target text is more restricted/neutral. Differences concerning how punctuation is translated are mainly due to grammatical differences but also a question of whether the punctuation can be experienced equally by the source and target text reader. Both circumstances have an influence on the translation.  It is argued that Swedish readers expect shorter sentences and texts accessible to the reader. A higher density and more complex constructions are accepted in German. On average, shorter sentences are found in this translation, and the deviance is lower. When the sentence length in the source text is seen as a significant stylistic feature, this structure is kept in the translation. Otherwise, sentences are often split to become more accessible. When the sentence construction is kept, it is however still often shorter than the source text. As this is expected from the target text reader, the stylistic effect can arguably still be considered preserved.  The translation can therefore be said to be more neutral on both sentence length and punctuation. The translation is giving the stylistic features space when this is considered a characteristic feature, otherwise, it is changed to fit the language norm.

This work focuses on the usage of dominators in circuit graphs in order to reduce the complexity of synthesis and verification tasks. One of the contributions of this thesis is a new algorithm for computing multiple-vertex dominators in circuit graphs. Previous algorithms, based on single-vertex dominators suffer from their rare appearance in many circuits. The presented approach searches efficiently for multiple-vertex dominators in circuit graphs. It finds dominator relations, where algorithms for computing single-vertex dominators fail. Another contribution of this thesis is the application of dominators for combinational equivalence checking based on the arithmetic transform. Previous algorithms rely on representations providing an explicit or implicit disjoint function cover, which is usually excessive in memory requirements. The new algorithm allows a partitioned evaluation of the arithmetic transform directly on the circuit graph using dominator relations. The results show that the algorithm brings significant improvements in memory consumption for many benchmarks. Proper cuts are used in many areas of VLSI. They provide cut points, where a given problem can be split into two disjoint sub-problems. The algorithm proposed in this thesis efficiently detects proper cuts in a circuit graph and is based on a novel concept of a reduced dominator tree. The runtime of the algorithm is less than 0.4 seconds for the largest benchmark circuit. The final contribution of this thesis is the application of the proper cut algorithm as a structural method to decompose a Boolean function, represented by a circuit graph. In combination with a functional approach, it outperforms previous methods, which rely on functional decomposition only.

This thesis describes an efficient method for speeding up functional verification of arithmetic circuits namely linear network such as wallace trees, counters using linear algebra techniques. The circuit is represented as a network of half adders, full adders and inverters, and modeled as a system of linear equations. The proof of functional correctness of the design is obtained by computing its algebraic signature using standard linear programming (LP) solver and comparing it with the reference signature provided by the designer. Initial experimental results and comparison with Satisfiability Modulo Theorem (SMT) solvers show that the method is efficient, scalable and applicable to complex arithmetic designs, including large multipliers. It is intended to provide a new front end theory/engine to enhance SMT solvers.

Participants demonstrate the Stroop effect when, in naming the color in which a word appears, reaction times are longer when the color and word are incongruent (e.g., "yellow" printed in blue) compared to when they are congruent (e.g., "yellow" printed in yellow). The literature commonly refers to the difference in reaction times as a measure of the interference of word stimuli upon color stimuli, and is taken as support for the theory of automaticity. This study asks whether the Stroop effect can be analyzed as interactions within and across stimulus classes. Adult participants learned three 3-member classes (color, word, and pattern) in a serialized order of training. In the testing phase, participants were presented with compound stimuli formed from combinations of members within and across classes (e.g., word and color), and reaction times were recorded in similar fashion to the Stroop task. Results show that averaged participants' reaction times are faster to compound stimuli comprised of members within the same class, compared to compound stimuli formed with members from different classes. These group-level data are consistent with the Stroop literature in that congruent compounds produce faster reaction times relative to incongruent compounds. However, individual participant data do not consistently reflect the Stroop effect. Further considerations for future research in this area are discussed.

Manuscript No. 1 Translocations of greater sage-grouse (Centrocercus urophasianus) have been attempted in 7 states and one Canadian province with very little success. To recover a small remnant population and test the efficacy of sage-grouse translocations, we captured and transported 137 adult female sage-grouse from 2 source populations to a release site in Strawberry Valley, Utah during March-April 2003-2005. The resident population of sage-grouse in Strawberry Valley was approximately 150 breeding birds prior to the release. We radiomarked each female and documented survival, movements, reproductive effort, flocking with resident grouse, and lek attendance. We used Program MARK to calculate annual survival of translocated females in the first year after release, which averaged 0.60 (95% CI = 0.515-0.681). Movements of translocated females were within current and historic sage-grouse habitat in Strawberry Valley, and we detected no grouse outside of the study area. Nesting propensity for first (newly translocated) and second (surviving) year females was 39% and 73%, respectively. Observed nest success of all translocated females during the study was 67%. By the end of their first year in Strawberry Valley, 100% of the living translocated sage-grouse were in flocks with resident sage-grouse. The translocated grouse attended the same lek as the birds with which they were grouped. In 2006, the peak male count for the only remaining active lek in Strawberry Valley was almost 4 times (135 M) the 6-year pretranslocation (1998 − 2003) average peak attendance of 36 males (range 24 – 50 M). Translocations can be an effective management tool to increase small populations of greater sage-grouse when conducted during the breeding season and before target populations have been extirpated. Manuscript No. 2 Nesting habitat of resident greater sage-grouse in extant populations across the species range has been thoroughly described in the literature, yet very little is known about the use of nesting habitat by translocated sage-grouse. In order to better understand nesting habitat selection by translocated sage-grouse in a new environment, we trapped grouse during the spring on and near leks of source populations. We placed each female in a cardboard box and translocated them overnight to the Strawberry Valley. Each female was fitted with a radio-transmitter and released near the lek where males were actively strutting. We monitored grouse for nesting activity. We documented nesting attempts, nest success, clutch size and embryo viability. We recorded data on habitat variables associated with nest sites and paired-random sites. We used logistic regression and an a priori information theoretic approach for modeling nest versus paired-random sites and successful versus unsuccessful nest sites. Our data suggested that crown area of the nest shrub and percent grass cover were the two variables that discriminated between nest and paired-random sites. Females that nested successfully selected sites with more total shrub canopy cover, intermediate size shrub crown area, a normal distribution of aspects, and with steeper slopes than unsuccessful nests. Translocated females selected suitable nesting habitat after being moved from source populations with differing habitats. Manuscript No. 3 Equivalence testing in the field of wildlife ecology has been underutilized. Mistakenly, many researchers have concluded that two groups are the same based on failure to reject a null hypothesis of no difference. We used equivalence testing to provide preliminary evidence that resident and translocated bird movements were similar. Translocations are becoming more prominent in the field of conservation biology as a wildlife management tool. We translocated greater sage grouse into a fragmented habitat in order to conserve the metapopulation. We placed radio-transmitters on resident and translocated female greater sage grouse and used the distance moved from the release site or lek as a measure of translocation success and/or site fidelity. If translocated birds did not show site fidelity, the translocations would be judged a failure. The distributions of resident and translocated sage grouse movements for both summer and winter seasons were significantly different, primarily due to differences in the proportions of specific habitat fragments used. Equivalence tests showed that site fidelity was statistically equivalent for translocated and resident grouse,when defined as a difference of ≤3 km, both in summer and winter. In particular, translocated females traveled no farther from the release site than resident females. Equivalence testing was the statistical tool used to determine equivalence of resident and translocated sage grouse movements and thus judge preliminary translocation success.

Impaired reproduction studies with Poisson responses are among a growing class of toxicity studies in the biological and medical realm. In recent years, little effort has been focused on the development of efficient experimental designs for impaired reproduction studies. This research concentrates on two areas: 1) the use of Bayesian techniques to make single regressor designs robust to parameter misspecification and 2) the extension of design optimality methods to the k-regressor model. The standard Poisson model with log link is used. Bayesian designs with priors on the parameters are explored using both the D and F-optimality criteria for the single regressor Poisson exponential model. Since these designs are found via numeric optimization techniques, Bayesian equivalence theory functions are derived to verify the optimality of these designs. Efficient Bayesian designs which provide for lack-of-fit testing are discussed. Characterizations of D, D_s, and interaction optimal designs which are factorial in nature are demonstrated for models involving interaction through k factors. The optimality of these designs is verified using equivalence theory. In addition, augmentations of these designs that result in desirable lack of fit properties are discussed. Also, a structure for fractional factorials is given in which specific points are added one at a time to the main effect design in order to gain estimability of the desired interactions. Robustness properties are addressed as well. Finally, this entire line of research is extended to industrial exponential models where different regressors work to increase and/or decrease a count data response produced by a process. / Ph. D.

Household food budgets offer a window on consumers' demand for convenience. During the 1980s and 1990s, three shifts likely promoted an increase in the share of the food budget devoted to convenient meal options, namely meals out and prepared foods: the growing number of hours that women spent in paid work, the growing opportunity cost of women's time spent doing housework, and the drop in the price of food relative to all other goods. I test whether the impact of these economic trends (on food budget allocation) was mediated by a change in the impact of children on household meal allocation. I find support for this hypothesis in a model of food away expenditures, which likely reflects two unmeasured shifts. First, (own) child care and household production of meals apparently became substitutes rather than complements. Second, a range of both prepared foods and family-friendly restaurants became available. The growing demand for time-saving meal options, including frozen food and meals out, has important implications for a core determinant of living standards: the ability to harness scale economies from home production of meals. I test whether greater reliance on convenient meals reduced household-level economies of scale. Other factors could mediate against, or even offset such a loss, including technological advances in the production and distribution of food. Using Engel curve analyses, I find that scale economies fell from 1980 to 2000, thereby reducing living standards; my lower- and upper-bound estimates of the drop are 44 percent and 110 percent respectively. Economies of scale are not simply a function of household size and composition, as standard equivalence scaling techniques suggest; they are affected by the ways that households trade non-market work and market substitutes. This dissertation contributes to the small literature that challenges the validity of fixed-parameter equivalence scales, such as the per capita scale, which ignore household production. I first attach plausible values to scale parameters and then compare equivalent-income trajectories of parents and non-parents across (standard) fixed parameter and (non-standard) time-varying equivalence scales. I present plausible lower- and upper-bound estimates of the rise in income inequality between parents and non-parents.

<p>Causality is central to scientific inquiry across many disciplines including epidemiology, medicine, and economics, to name a few. Researchers are usually interested not only in knowing how two events are correlated, but also in whether one causes the other and, if so, how. In general, the scientific practice seeks not just a surface description of the observed data, but rather deeper explanations, such as predicting the effects of interventions. The answer to such questions does not lie in the data alone and requires a qualitative understanding of the underlying data-generating process; a knowledge that is articulated in a causal diagram.</p> <p>And yet, delineating the true, underlying causal diagram requires knowledge and assumptions that are usually not available in many non-trivial and large-scale situations. Hence, this dissertation develops necessary theory and algorithms towards realizing a data-driven framework for causal inference. More specifically, this work provides fundamental treatments of the following research questions:</p> <p><br></p> <p><strong>Effect Identification under Markov Equivalence.</strong> One common task in many data sciences applications is to answer questions about the effect of new interventions, like: 'what would happen to <em>Y</em> while observing <em>Z=z</em> if we force <em>X</em> to take the value <em>x</em>?'. Formally, this is known as <em>causal effect identification</em>, where the goal is to determine whether a post-interventional distribution is computable from the combination of an observational distribution and assumptions about the underlying domain represented by a causal diagram. In this dissertation, we assume as the input of the task a less informative structure known as a partial ancestral graph (PAG), which represents a Markov equivalence class of causal diagrams, learnable from observational data. We develop tools and algorithms for this relaxed setting and characterize identifiable effects under necessary and sufficient conditions.</p> <p><br></p> <p><strong>Causal Discovery from Interventions.</strong> A causal diagram imposes constraints on the corresponding generated data; conditional independences are one such example. Given a mixture of observational and experimental data, the goal is to leverage the constraints imprinted in the data to infer the set of causal diagrams that are compatible with such constraints. In this work, we consider soft interventions, such that the mechanism of an intervened variable is modified without fully eliminating the effect of its direct causes, and investigate two settings where the targets of the interventions could be known or unknown to the data scientist. Accordingly, we introduce the first general graphical characterizations to test whether two causal diagrams are indistinguishable given the constraints in the available data. We also develop algorithms that, given a mixture of observational and interventional data, learn a representation of the equivalence class.</p>

Instruction that purposefully develops emergent learning is inherently efficient and is well-supported in behavior science research. This type of instruction is underpinned by two contemporary theories of human language and learning - Relational Frame Theory (RFT) and Stimulus Equivalence. Unfortunately, RFT is not widely taught in higher education in research and practice. Consequently, the adoption of these teaching methodologies at a meaningful scale is out of proportion with their potential benefits for learners across many populations (Dixon, et al., 2018). Most research that does make use of these theories in computer-based instruction involves proprietary or costly software and is therefore unlikely to be replicable. Few low-cost solutions have been proposed to date to address barriers to adoption and application, and the solutions that have been proposed are missing critical features (e.g., Blair & Shawler, 2020). This project 1) determined specific barriers to implementing computer-based derived stimulus relations research and practice, 2) attempted to fill this gap, by developing instruction and training for researchers and practitioners to code their own web-based RFT/equivalence-based instruction tasks, and 3) demonstrated the effectiveness of the above web-based solution via training on derived stimulus relations key concepts and terms. This project supports the methods of behavior science researchers to align with open science standards and provide a tool for researchers and instructors to efficaciously deliver instruction to meet the needs of their learners.

Background. Open source dependencies have become ubiquitous in software development and the risk of regressions during an update are a key concern facing developers. Change impact analysis (CIA) can be used to assess the effects of a dependency update and aid in addressing this challenge. The manual effort required for CIA has created a need to reduce the amount of data that is considered during a compatibility assessment. Formal (mathematical) methods for equivalence analysis have been prolific in previous attempts at minimizing the amount of data that needs to be analyzed. C bounded model checker (CBMC) is an established tool that can perform equivalence verification and a gap in knowledge exists regarding its usefulness for assessing update compatibility. Objectives. The objective of the study was to evaluate how well CBMC could filter out equivalent changes from impact assessments and the relevance of this for dependency updates. A tool named Equivalent update filter (EUF) was developed in the study to tackle this problem. Effectiveness of the tool was assessed based on, (1) the size of reductions that were made possible through filtering, (2) the relevance of the auto-generated verification resources created to perform analysis and (3) the correctness of the results during equivalence analysis. Methods. To assess the reduction capabilities of EUF a controlled experiment regarding the effect of CBMC based equivalence analysis upon impact assessment sizes was conducted. Updates for the experiment were derived from random commit pairs among three C dependencies with established industry use. The relevance of EUF's auto-generated verification resources were measured through an ordinal scale that highlighted the prevalence of different properties in a dependency that would prevent sound equivalence analysis. Soundness of the reductions suggested by EUF was investigated through a comparison with a manually labeled set of updates. Results. The developed filtering approach was able decrease impact assessment sizes by 1 % on average. Considerable differences were observed between the dependencies in the study in regards to analysis time. For each update, 11 % of the auto-generated verification resources were found to be useful for equivalence analysis on average.EUF's classification of equivalent changes was measured to have an accuracy of 67 % in relation to the base truth of manually labeled updates. Conclusions. The study showed that EUF and by extension, CBMC based equivalence analysis, has potential to be useful in dependency compatibility assessments. Follow up studies on different verification engines and with improved methodologies would be necessary to motivate practical use. / Bakgrund. Att använda externa bibliotek med öppen källkod är praxis inom mjukvaruutveckling och risken för uppdateringar att introducera problem är ett betydande orosmoment för utvecklare. Konsekvensanalys, "Change impact analysis" (CIA), kan användas för att utvärdera effekten av en uppdatering och bemöta denna utmaning. Den manuella interaktion som krävs för CIA har medfört att mängden data som analyseras behöver begränsas. Formella (matematiska) metoder för ekvivalensanalys har varit centrala i tidigare försök att minimera analysbehov. "C bounded model checker" (CBMC) är ett etablerat verktyg för C som kan utföra ekvivalensanalys och tidigare forskning har inte studerat dess relevans för kompatibilitetsbedömning vid beroende uppdateringar. Syfte. Denna studies syfte var att utvärdera CBMC's förmåga att filtrera bort ekvivalenta ändringar från uppdateringar av externa beroenden. Verktyget "Equivalent update filter" (EUF) utvecklades under projektet för att uppnå syftet. Effektiviteten av EUF bedömdes med hjälp av tre kriterier, (1) storleken på de reduktioner som möjliggjordes av filtrering, (2) relevansen av de autogenererade resurser som skapades för att utföra ekvivalensanalys och (3) korrektheten av de resultat som erhölls från ekvivalensanalys. Metod. EUF's reduktionsförmåga undersöktes genom ett kontrollerat experiment där inverkan av CBMC baserad ekvivalensanalys på analysbehovet för olika uppdateringar analyserades. Uppdateringarna som användes för experimentet hämtades från tre olika C bibliotek med bred användning i industrin. Värdet av EUF's autogenererade resurser studerades i relation till hur ofta de medförde negativa konsekvenser på korrektheten av ekvivalensanalysen. Korrektheten hos de reduktioner som EUF utförde under experimenten mättes genom en jämförelse med ett antal manuellt klassificerade uppdateringar. Resultat. Den utvecklade filtreringsmetoden hade en förmåga att minska mängden data som behöver analyseras med 1 % i genomsnitt. Exekveringstiden varierade kraftigt mellan de olika bibliotek som testades. För varje uppdatering så bedömdes i genomsnitt 11 % av de autogenererade verifieringsresurserna vara användbara för ekvivalensanalys. EUF's detektion av ekvivalenta och icke-ekvivalenta förändringar visades ha en träffsäkerhet på 67 % i relation till manuella klassificeringar. Slutsatser. Studien fann att EUF och i förlängningen, CBMC baserad ekvivalensanalys, har potential att vara en användbar del av kompatibilitetsbedömningar för beroende uppdateringar. En uppföljningsstudie med andra verifikationsverktyg och förbättrade metoder hade varit nödvändiga för att motivera praktisk användning.