Refine
Year of publication
- 1999 (425)
- 2021 (220)
- 2022 (167)
- 2020 (159)
- 2023 (142)
- 1998 (116)
- 2019 (103)
- 2000 (96)
- 2007 (92)
- 2018 (90)
- 1996 (88)
- 2015 (82)
- 1995 (81)
- 2016 (81)
- 2009 (78)
- 2014 (77)
- 1997 (76)
- 1994 (70)
- 2005 (68)
- 2006 (67)
- 2008 (66)
- 2001 (64)
- 2003 (63)
- 2013 (62)
- 2012 (61)
- 2004 (57)
- 2010 (56)
- 2002 (54)
- 2017 (52)
- 2011 (51)
- 1993 (42)
- 1992 (40)
- 2024 (35)
- 1991 (33)
- 1990 (11)
- 1989 (5)
- 1987 (4)
- 1988 (4)
- 1979 (3)
- 1984 (3)
- 1985 (3)
- 1980 (1)
- 1981 (1)
Document Type
- Preprint (1037)
- Doctoral Thesis (939)
- Article (609)
- Report (399)
- Master's Thesis (30)
- Conference Proceeding (28)
- Diploma Thesis (24)
- Periodical Part (21)
- Working Paper (15)
- Lecture (11)
Language
- English (3149) (remove)
Keywords
- AG-RESY (47)
- PARO (25)
- Visualisierung (16)
- SKALP (15)
- Wavelet (13)
- finite element method (12)
- Case-Based Reasoning (11)
- Inverses Problem (11)
- Optimization (11)
- RODEO (11)
Faculty / Organisational entity
- Kaiserslautern - Fachbereich Mathematik (1052)
- Kaiserslautern - Fachbereich Informatik (753)
- Kaiserslautern - Fachbereich Maschinenbau und Verfahrenstechnik (302)
- Kaiserslautern - Fachbereich Physik (293)
- Fraunhofer (ITWM) (205)
- Kaiserslautern - Fachbereich Chemie (116)
- Kaiserslautern - Fachbereich Elektrotechnik und Informationstechnik (115)
- Kaiserslautern - Fachbereich Biologie (98)
- Kaiserslautern - Fachbereich Sozialwissenschaften (76)
- Kaiserslautern - Fachbereich Wirtschaftswissenschaften (36)
Partitioned chain grammars
(1979)
This paper introduces a new class of grammars, the partitioned chain grammars, for which efficient parsers can be automatically generated. Besides being efficiently parsable these grammars possess a number of other properties, which make them very attractive for the use in parser-generators. They for instance form a large grammarclass and describe all deterministic context-free languages. Main advantage of the partitioned chain grammars however is, that given a language it is usually easier to describe it by a partitioned chain grammar than to construct a grammar of some other type commonly used in parser-generators for it.
Fast reconstruction formulae in x-ray computerized tomography demand the directions, in which the measurements are taken, to be equally distributed over the whole circle. In many applications data can only be provided in a restricted range. Here the intrinsic difficulties are studied by giving a singular value decomposition of the Radon transform in a restricted range. Practical limitations are deduced.
The Trippstadt Problem
(1984)
Close to Kaiserslautern is the town of Trippstadt, which, together with five other small towns forms a local administration unit (Verbandsgemeinde) called Kaiserslautern-Süd. Trippstadt has its own beautiful public swimming pool, which causes problems though; the cost for the upkeep of the pool is higher than the income and thus has to be divided among the towns belonging to the Verbandsgemeinde. Because of this problem the administration wanted to find out which fraction of the total number of pool visitors came from the different towns. They planned to ask each pool guest where he came from. They did this for only three days though because the waiting lines at the cashiers became unbearably long and they could see that because of this the total number of guests would decrease. Then they wondered how to find a better method to get the same data and that was when I was asked to help with the solution of the problem.
In these notes we will discuss some aspects of a problem arising in carindustry. For the sake of clarity we will set the problem into an extremely simplified scheme. Suppose that we have a body which is emitting sound, and that the sound is measured at a finite number of points around the body. We wish to determine the intensity of the sound at an observation point which is moving.