297 research outputs found
Niedermeier (Birth, 1874-07-12)
No full text315/Pg. 9/1874/F W/H. Niedermeier, MDOriginal record filed in drawer labeled 'NIA-NIEMILLER'
Eliza Calvert Hall: Kentucky Author and Suffragist
No full textIn 1907, the author, poet, essayist, and folk art historian Eliza Calvert Hall (1856–1935) published Aunt Jane of Kentucky, a collection of stories about rural life infused with the spirit and gentle good humor of its elderly narrator, Aunt Jane. The book and several sequels achieved wide popularity and placed Hall in the front ranks of “local color” fiction writers of her time. As Hall struggled to balance her writing career with the duties of a nineteenth-century wife and mother, suffragist Laura Clay was lobbying for every woman’s right to vote. Hall joined the battle, writing fearlessly in support of suffrage and equality. While her passionate essays served as a direct appeal for this cause, her creative writing also carried a feminist spirit, celebrating the strength, humor, love, and art of the common woman. In Eliza Calvert Hall, Lynn E. Niedermeier tells the story of this remarkable Kentucky woman for the first time.
Supplies a valuable history of the women\u27s rights movement in Kentucky, and also introduces the reader to an overlooked author of compassionate and witty fiction. -- Bonnie Jean Cox, former director of the University of Kentucky\u27s Women and Gender Studies programhttps://digitalcommons.wku.edu/dlsc_books/1000/thumbnail.jp
Something Solid
No full textThis thesis project examines the genre of creative non-fiction. It argues for consideration of a new classification for this form of essay writing, beyond any “black and white” category which limits and cannot fully capture the idiosyncratic nature of true creative non-fiction. The author states, “there needs to be . . . a third category, one beyond nonfiction and fiction; to account for the blending of the two” (Niedermeier 8). The opening section explores the writing of Kurt Vonnegut, Jr., Tracy Kidder, and Frank McCourt with regard to its creative non-fiction aspects and also discusses Guskind’s concept of “three dimensional truth.” The concluding sections are original, creative non-fiction pieces
Something Solid
No full textAbstract created by repository to aid in discovery.This thesis project examines the genre of creative non-fiction. It argues for consideration of a new classification for this form of essay writing, beyond any “black and white” category which limits and cannot fully capture the idiosyncratic nature of true creative non-fiction. The author states, “there needs to be . . . a third category, one beyond nonfiction and fiction; to account for the blending of the two” (Niedermeier 8). The opening section explores the writing of Kurt Vonnegut, Jr., Tracy Kidder, and Frank McCourt with regard to its creative non-fiction aspects and also discusses Guskind’s concept of “three dimensional truth.” The concluding sections are original, creative non-fiction pieces.SUNY BrockportEnglishMaster of Arts (MA)English Master’s These
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
No full textWhen computing stable matchings, it is usually assumed that the preferences of the agents in the matching market are fixed. However, in many realistic scenarios, preferences change over time. Consequently, an initially stable matching may become unstable. Then, a natural goal is to find a matching which is stable with respect to the modified preferences and as close as possible to the initial one. For Stable Marriage/Roommates, this problem was formally defined as Incremental Stable Marriage/Roommates by Bredereck et al. [AAAI '20]. As they showed that Incremental Stable Roommates and Incremental Stable Marriage with Ties are NP-hard, we focus on the parameterized complexity of these problems. We answer two open questions of Bredereck et al. [AAAI '20]: We show that Incremental Stable Roommates is W[1]-hard parameterized by the number of changes in the preferences, yet admits an intricate XP-algorithm, and we show that Incremental Stable Marriage with Ties is W[1]-hard parameterized by the number of ties. Furthermore, we analyze the influence of the degree of "similarity" between the agents' preference lists, identifying several polynomial-time solvable and fixed-parameter tractable cases, but also proving that Incremental Stable Roommates and Incremental Stable Marriage with Ties parameterized by the number of different preference lists are W[1]-hard
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions
No full textIn the NP-hard Longest Common Subsequence problem (LCS), given a set of strings, the task is to find a string that can be obtained from every input string using as few deletions as possible. LCS is one of the most fundamental string problems with numerous applications in various areas, having gained a lot of attention in the algorithms and complexity research community. Significantly improving on an algorithm by Irving and Fraser [CPM'92], featured as a research challenge in a 2014 survey paper, we show that LCS is fixed-parameter tractable (FPT) when parameterized by the maximum number of deletions per input string. Given the relatively moderate running time of our algorithm (linear time when the parameter is a constant) and small parameter values to be expected in several applications, we believe that our purely theoretical analysis could finally pave the way to a new, exact and practically useful algorithm for this notoriously hard string problem.Discrete Mathematics and Optimizatio
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
No full textAddressing a quest by Gupta et al. [ICALP'14], we provide a first, comprehensive study of finding a short s-t path in the multistage graph model, referred to as the Multistage s-t Path problem. Herein, given a sequence of graphs over the same vertex set but changing edge sets, the task is to find short s-t paths in each graph ("snapshot") such that in the found path sequence the consecutive s-t paths are "similar". We measure similarity by the size of the symmetric difference of either the vertex set (vertex-similarity) or the edge set (edge-similarity) of any two consecutive paths. We prove that these two variants of Multistage s-t Path are already NP-hard for an input sequence of only two graphs and maximum vertex degree four. Motivated by this fact and natural applications of this scenario e.g. in traffic route planning, we perform a parameterized complexity analysis. Among other results, for both variants, vertex- and edge-similarity, we prove parameterized hardness (W[1]-hardness) regarding the parameter path length (solution size) for both variants, vertex- and edge-similarity. As a further conceptual study, we then modify the multistage model by asking for dissimilar consecutive paths. One of our main technical results (employing so-called representative sets known from non-temporal settings) is that dissimilarity allows for fixed-parameter tractability for the parameter solution size, contrasting the W[1]-hardness of the corresponding similarity case. We also provide partially positive results concerning efficient and effective data reduction (kernelization)
Zarwein (Birth, 1874-07-12)
No full textAddress: Lickrun316/Pg.9/1874/F W/H. Niedermeier, M DOriginal record filed in drawer labeled 'ZABAN-ZIMMENS'
The Parameterized Complexity of the Minimum Shared Edges Problem
No full textWe study the NP-complete Minimum Shared Edges (MSE) problem. Given an undirected graph, a source and a sink vertex, and two integers p and k, the question is whether there are p paths in the graph connecting the source with the sink and sharing at most k edges. Herein, an edge is shared if it appears in at least two paths. We show that MSE is W[1]-hard when parameterized by the treewidth of the input graph and the number k of shared edges combined. We show that MSE is fixed-parameter tractable with respect to p, but does not admit a polynomial-size kernel (unless NP is a subset of coNP/poly). In the proof of the fixed-parameter tractability of MSE parameterized by p, we employ the treewidth reduction technique due to Marx, O'Sullivan, and Razgon [ACM TALG 2013]
Albert, Thomas Henry (Birth, 1874-06-20)
No full textAddress: West End314/Pg.9/1874/M W/Cinti, O/Cinti, O/H. Niedermeier, MDOriginal record filed in drawer labeled'AHREN-ALEXANDER'
- …
