2,332 research outputs found
Recommended from our members
Benno von Wiese
No full textThe author have researched the history of science, scholarship and German studies, with particular focus on the career of the influential German literary scholar Benno von Wiese (1903-1987). The book on von Wiese deals with his supportive yet ambivalent role during National Socialism from 1933-1945 and how he dealt with this (personal and collective German) period in post-war Germany
Beers, kaffi, and Schnaps : different grammatical options for 'restaurant talk' coercions in three Germanic languages
No full textThis paper discusses constructions like “We’ll have two beers and a coffee.” that are typically used for beverage orders in restaurant contexts. We compare the behaviour of nouns in these constructions in three Germanic languages, English, Icelandic, and German, and take a closer look at the correlation of the morpho-syntactic and semantic-conceptual changes involved here. We show that even within such a closely related linguistic sample, one finds three different grammatical options for the expression of the same conceptual transition. Our findings suggest an analysis of coercion as a genuinely semantic phenomenon, a phenomenon that is located on a level of semantic representations that serves as an interface between the conceptual and the grammatical system and takes into account inter- and intralinguistic variations
0
No full textThis volume seems to replicate "Happy Hours in Storyland" from 1963/68 and from 1970/81. The verso of the title-page acknowledges the second but not the first. As I mention of the former, sixteen fables of Aesop and a few other fables start off this volume. The editor of these versions is not acknowledged. The illustrations are a third set for Aesop by Kurt Wiese (Favorite Stories, 1942; Jacobs' The Fables of Aesop, 1950/62).This is a hardbound book (hard cover)Fourth printingNo Autho
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
No full textThe area of parameterized approximation seeks to combine approximation and parameterized algorithms to obtain, e.g., (1+epsilon)-approximations in f(k,epsilon)n^O(1) time where k is some parameter of the input. The goal is to overcome lower bounds from either of the areas. We obtain the following results on parameterized approximability:
- In the maximum independent set of rectangles problem (MISR) we are given a collection of n axis parallel rectangles in the plane. Our goal is to select a maximum-cardinality subset of pairwise non-overlapping rectangles. This problem is NP-hard and also W[1]-hard [Marx, ESA'05]. The best-known polynomial-time approximation factor is O(log log n) [Chalermsook and Chuzhoy, SODA'09] and it admits a QPTAS [Adamaszek and Wiese, FOCS'13; Chuzhoy and Ene, FOCS'16]. Here we present a parameterized approximation scheme (PAS) for MISR, i.e. an algorithm that, for any given constant epsilon>0 and integer k>0, in time f(k,epsilon)n^g(epsilon), either outputs a solution of size at least k/(1+epsilon), or declares that the optimum solution has size less than k.
- In the (2-dimensional) geometric knapsack problem (2DK) we are given an axis-aligned square knapsack and a collection of axis-aligned rectangles in the plane (items). Our goal is to translate a maximum cardinality subset of items into the knapsack so that the selected items do not overlap. In the version of 2DK with rotations (2DKR), we are allowed to rotate items by 90 degrees. Both variants are NP-hard, and the best-known polynomial-time approximation factor is 2+epsilon [Jansen and Zhang, SODA'04]. These problems admit a QPTAS for polynomially bounded item sizes [Adamaszek and Wiese, SODA'15]. We show that both variants are W[1]-hard. Furthermore, we present a PAS for 2DKR.
For all considered problems, getting time f(k,epsilon)n^O(1), rather than f(k,epsilon)n^g(epsilon), would give FPT time f'(k)n^O(1) exact algorithms by setting epsilon=1/(k+1), contradicting W[1]-hardness. Instead, for each fixed epsilon>0, our PASs give (1+epsilon)-approximate solutions in FPT time.
For both MISR and 2DKR our techniques also give rise to preprocessing algorithms that take n^g(epsilon) time and return a subset of at most k^g(epsilon) rectangles/items that contains a solution of size at least k/(1+epsilon) if a solution of size k exists. This is a special case of the recently introduced notion of a polynomial-size approximate kernelization scheme [Lokshtanov et al., STOC'17]
Atomic Quantum Simulation of U(N) and SU(N) Abelian Lattice Gauge Theories
No full textUsing ultracold alkaline-earth atoms in optical lattices, we construct a quantum simulator for U(N) and SU(N) lattice gauge theories with fermionic matter based on quantum link models. These systems share qualitative features with QCD, including chiral symmetry breaking and restoration at nonzero temperature or baryon density. Unlike classical simulations, a quantum simulator does not suffer from sign problems and can address the corresponding chiral dynamics in real time
The Bookshelf for Boys and Girls, Volume 2
No full textSixteen fables of Aesop and a few other fables start off this volume. The editor of these versions is not acknowledged. The illustrations are a third set for Aesop by Kurt Wiese (Favorite Stories, 1942; Jacobs' The Fables of Aesop, 1950/62). The frontispiece is a strong full-page colored depiction of FC by Bess B. Cleveland. I believe that I have seen it somewhere else as frontispiece, but I cannot place it. Compare the smaller version of the same illustration in The Home University Bookshelf, Volume III, 380 (1945). See the identical new edition of 1970/81.This is a hardbound book (hard cover)Editorial Board of the University Societ
Categories and paradigms : on underspecification in Russian declension
No full textIn morphological systems of the agglutinative type we sometimes encounter a nearly perfect one-to-one relation between form and function. Turkish inflectional morphology is, of course, the standard textbook example. Things seem to be quite different in systems of the flexive type. Declension in Contemporary Standard Russian (henceforth Russian, for short) may be cited as a typical example: We find, among other things, cumulative markers, “synonymous” endings (e.g., dative singular noun forms in -i, -e, or -u), and “homonymous” endings (e.g., -i, genitive, dative, and prepositional singular). True, some endings are more of an agglutinative nature, being bound to a specific case-number combination and applying across declensions, e.g., -am (dative plural, all nouns); and some cross the boundaries of word classes, e.g., -o, which serves as the nominative/accusative singular ending of neuter forms of pronouns (and adjectives) and as the nominative/accusative singular ending of (most) neuter nouns as well. Still, many observers have been struck by the impression that what we face here are rather uneconomic or even, so to speak, unnatural structures. But perhaps flexive systems are not as complicated as they seem. What seems to be uneconomic complexity may be, at least partially, an artifact of uneconomic descriptions
Intrinsic processes control late Turonian calcareous dinoflagellate cyst assemblages – A case study from the Sussex chalk (England)
No full textDesign for happiness-enhancing activities: Development of design strategies for the activities of learning to forgive and avoiding overthinking
No full textThis research-by-design project provides designers with new strategies to design for sustained well-being.Positive activities have been proposed as the most promising starting point to improve well-being (Wiese et al., 2020). Currently, 14 activities have been identified (Lyubomirsky, 2007; Wiese et al., 2019). Avoiding overthinking and learning to forgive were chosen to design for in this project, as few existing products meaningfully support people in engaging in these activities. The Vision in Design approach (Hekkert & van Dijk, 2011) was applied to construct future world views of both activities, in order to create meaningful design goals. Two design strategies were developed for both activities and evaluated by PhD candidates and a design practitioner. This concluded that the strategies meet most of the requirements of a strategy (Wiese et. al., 2020), and could support designers. Recommendations to improve the strategies were composed and presented in the report. The conducted research and developed strategies contributed to existing knowledge by showing how designers can promote sustained well-being on an activity level. Further research should be conducted with more designers to evaluate the strategies’ usefulness in practice more extensively. Design for Interactio
Fixed-Parameter Approximation Schemes for Weighted Flowtime
No full textGiven a set of n jobs with integral release dates, processing times and weights, it is a natural and important scheduling problem to compute a schedule that minimizes the sum of the weighted flow times of the jobs. There are strong lower bounds for the possible approximation ratios. In the non-preemptive case, even on a single machine the best known result is a O(sqrt{n})-approximation which is best possible. In the preemptive case on m identical machines there is a O(log min{n/m,P})-approximation (where P denotes the maximum job size) which is also best possible.
We study the problem in the parametrized setting where our parameter k is an upper bound on the maximum (integral) processing time and weight of a job, a standard parameter for scheduling problems. We present a (1+epsilon)-approximation algorithm for the preemptive and the non-preemptive case of minimizing weighted flow time on m machines with a running time of f(k,epsilon,m)* n^{O(1)}, i.e., our combined parameters are k,epsilon, and m. Key to our results is to distinguish time intervals according to whether in the optimal solution the pending jobs have large or small total weight. Depending on this we employ dynamic programming, linear programming, greedy routines, or combinations of the latter to compute the schedule for each respective interval
- …
