500 research outputs found
George B. Inge papers, MSS.0728
No full textAbstract: Research material for the book, The Herndon and Inge Families: Genealogical, Historical, Biographical.Scope and Content Note: This collection contains research material for the book, The Herndon and Inge Families: Genealogical, Historical, Biographical, written by Inge and published by the Gregath Company of Cullman, Alabama, in 1977. The papers include correspondence regarding the book, correspondence from Inge family members, note cards, handwritten notes, newspaper clippings, excerpts from books containing genealogical information, and drafts of the manuscripts.Biographical/Historical Note: Colonel George B. Inge was born and raised in Mobile, Alabama. Inge served in the U. S. Army Corps of Engineers Reserve during World War II and worked for many years in the United States Civil Service prior to his retirement in 1962. He has been honored with numerous military medals and ribbons and has been a member and leader in many civic organizations in Mobile. In addition to The Herndon and Inge Families: Genealogical, Historical, Biographical, Inge is also the author of Our Book of State, a history of the Order of Myths, Mobile's oldest parading Mardi Gras society. He is married to Marie Bishop Inge. Information obtained from The Herndon and Inge Families: Genealogical, Historical, Biographical
Gapped Indexing for Consecutive Occurrences
Get PDFThe classic string indexing problem is to preprocess a string S into a compact data structure that supports efficient pattern matching queries. Typical queries include existential queries (decide if the pattern occurs in S), reporting queries (return all positions where the pattern occurs), and counting queries (return the number of occurrences of the pattern). In this paper we consider a variant of string indexing, where the goal is to compactly represent the string such that given two patterns P₁ and P₂ and a gap range [α, β] we can quickly find the consecutive occurrences of P₁ and P₂ with distance in [α, β], i.e., pairs of subsequent occurrences with distance within the range. We present data structures that use Õ(n) space and query time Õ(|P₁|+|P₂|+n^{2/3}) for existence and counting and Õ(|P₁|+|P₂|+n^{2/3}occ^{1/3}) for reporting. We complement this with a conditional lower bound based on the set intersection problem showing that any solution using Õ(n) space must use Ω̃(|P₁| + |P₂| + √n) query time. To obtain our results we develop new techniques and ideas of independent interest including a new suffix tree decomposition and hardness of a variant of the set intersection problem
Sliding Window String Indexing in Streams
Get PDFGiven a string over an alphabet , the 'string indexing problem'
is to preprocess to subsequently support efficient pattern matching
queries, i.e., given a pattern string report all the occurrences of in
. In this paper we study the 'streaming sliding window string indexing
problem'. Here the string arrives as a stream, one character at a time, and
the goal is to maintain an index of the last characters, called the
'window', for a specified parameter . At any point in time a pattern
matching query for a pattern may arrive, also streamed one character at a
time, and all occurrences of within the current window must be returned.
The streaming sliding window string indexing problem naturally captures
scenarios where we want to index the most recent data (i.e. the window) of a
stream while supporting efficient pattern matching.
Our main result is a simple space data structure that uses
time with high probability to process each character from both the input string
and the pattern string . Reporting each occurrence from uses
additional constant time per reported occurrence. Compared to previous work in
similar scenarios this result is the first to achieve an efficient worst-case
time per character from the input stream. We also consider a delayed variant of
the problem, where a query may be answered at any point within the next
characters that arrive from either stream. We present an space data structure for this problem that improves the above time
bounds to . In particular, for a delay of we obtain an space data structure with constant time processing per
character. The key idea to achieve our result is a novel and simple
hierarchical structure of suffix trees of independent interest, inspired by the
classic log-structured merge trees
Theory Building in Music Therapy - an international Archive.:An introduction to Rosemarie Tüpker's Article: Morphological Music Therapy
No full textI introduktionen præsenterer jeg under hvilke rammer forfatteren har udviklet den morfologiske teori. Jeg præsenterer kort teoriens oprindelse i Goethe's perspektiv på 'artistic aspects to scientific questions' som jeg vil oversætte med 'kunstneriske aspekter i videnskabelige spørgsmål. Jeg præsenterer ligeledes kort de fire udviklingstrin i måden at forstå musikterapiprocesserne som RMT uddyber og eksemplificerer i artiklen. Udgivelsesdato: juniIn this introduction I present the frames in where the author developed the morphological theory. I shortly presents the origins of the theory as coming from Goethe's perspective of 'artistic aspects to scientific questions'. I also presents four developmental steps in the way of understanding the processes in music therapy. These steps are deepened, excemplifyed and theoretically grounded in RMT's article
Opportunities for the development of geometrical reasoning in current textbooks in the UK and Japan
No full textDeveloping a good model of the school geometry curriculum continues to be one of the most important tasks in curricular design in mathematics. This paper reports on an initial analysis of current best-selling textbooks used in lower secondary schools in Japan and the UK (specifically England and Scotland). The analysis indicates that, following the specification of the mathematics curriculum in these countries, Japanese textbooks set out to develop students’ deductive reasoning skills through the explicit teaching of proof in geometry, whereas comparative UK textbooks tend, at this level, to concentrate on finding angles, measurement, drawing, and so on, coupled with a modicum of opportunities for conjecturing and inductive reasoning. The available research suggests that each approach has its own strengths and weaknesses. Finding ways of capitalising on the strengths and mitigating the weaknesses could prove helpful in formulating new curricular models and designing new student textbooks
String Indexing for Top-k Close Consecutive Occurrences
Get PDFThe classic string indexing problem is to preprocess a string S into a compact data structure that supports efficient subsequent pattern matching queries, that is, given a pattern string P, report all occurrences of P within S. In this paper, we study a basic and natural extension of string indexing called the string indexing for top-k close consecutive occurrences problem (Sitcco). Here, a consecutive occurrence is a pair (i,j), i < j, such that P occurs at positions i and j in S and there is no occurrence of P between i and j, and their distance is defined as j-i. Given a pattern P and a parameter k, the goal is to report the top-k consecutive occurrences of P in S of minimal distance. The challenge is to compactly represent S while supporting queries in time close to the length of P and k. We give two time-space trade-offs for the problem. Let n be the length of S, m the length of P, and ε ∈ (0,1]. Our first result achieves O(nlog n) space and optimal query time of O(m+k), and our second result achieves linear space and query time O(m+k^{1+ε}). Along the way, we develop several techniques of independent interest, including a new translation of the problem into a line segment intersection problem and a new recursive clustering technique for trees
On the Anniversary of the Honorary President of the Vavilov Society of Geneticists and Breeders, Academician Sergei Georgievich Inge-Vechtomov
Get PDFOn April 4, 2024, the outstanding geneticist and teacher, Honorary President of the Vavilov Society of Geneticists and Breeders, Honorary Professor of St. Petersburg State University, Member of the Academic Council of VIR, Academician of the Russian Academy of Sciences Sergei Georgievich Inge-Vechtomov turned 85 years old. S.G. Inge-Vechtomov is known as an eminent scientist in the field of Saccharomyces yeast genetics; he has made a significant contribution to the study of the regulation of translation termination in eukaryotes and the phenomenon of protein inheritance. Sergei Georgievich is the author of a number of textbooks on genetics that have received significant recognition. For more than forty years he was the Head of the oldest department of genetics in our country – the Department of Genetics and Biotechnology of St. Petersburg State University, established a leading scientific and pedagogical school, trained a number of disciples who now lead scientific teams not only in Russia, but also abroad. S.G. Inge-Vechtomov does a lot of organizational work, he made a significant contribution to the creation of the Vavilov Society of Geneticists and Breeders, to the organization and holding of a number of Vavilov Society congresses, and is currently its Honorary President. S.G. Inge-Vechtomov is a member of editorial boards of a number of journals, but the most important result of his editorial activities was the creation of the journal “Ecological Genetics”, which is currently actively developing. Colleagues and friends, members of the genetic scientific community, researchers, students and professors wish Sergei Georgievich inexhaustible energy, health, good mood and new achievements in science and educational activities
Beyond the Bosphorus? Comparing German, French and British Discourses on Turkey’s Application to Join the European Union
Get PDFThis article examines the impact of national borders on public discourses, based on a case study of the struggle surrounding Turkey’s application to join the European Union (EU). Comparing opinions, reasons and interpretation patterns in press commentaries about enlarging the EU beyond the Bosphorus, the findings confirm the paramount importance and robustness of national cleavages between the German and the French public sphere on the one hand, and the British on the other. Whereas Turkish membership was predominantly re-jected on the continent, the British commentators strongly and almost unanimously sup-ported Ankara’s request to open doors. These similarities and divergences, I argue, are first and foremost the result of, and linked with, competing visions of Europe’s finality, especially regarding various constitutional ideas and cultural principles. Against this background, the Turkey question was partly exploited as an instrument supporting or repressing different conceptions of the European Union’s future
Faster Sliding Window String Indexing in Streams
Get PDFThe classical string indexing problem asks to preprocess the input string S for efficient pattern matching queries. Bille, Fischer, Gørtz, Pedersen, and Stordalen [CPM 2023] generalized this to the streaming sliding window string indexing problem, where the input string S arrives as a stream, and we are asked to maintain an index of the last w characters, called the window. Further, at any point in time, a pattern P might appear, again given as a stream, and all occurrences of P in the current window must be output. We require that the time to process each character of the text or the pattern is worst-case. It appears that standard string indexing structures, such as suffix trees, do not provide an efficient solution in such a setting, as to obtain a good worst-case bound, they necessarily need to work right-to-left, and we cannot reverse the pattern while keeping a worst-case guarantee on the time to process each of its characters. Nevertheless, it is possible to obtain a bound of O(log w) (with high probability) by maintaining a hierarchical structure of multiple suffix trees. We significantly improve this upper bound by designing a black-box reduction to maintain a suffix tree under prepending characters to the current text. By plugging in the known results, this allows us to obtain a bound of O(log log w + log log σ) (with high probability), where σ is the size of the alphabet. Further, we introduce an even more general problem, called the streaming dynamic window string indexing, where the goal is to maintain the current text under adding and deleting characters at either end and design a similar black-box reduction
- …
