TY - BOOK A1 - Pihlaja, Kalevi A1 - Kleinpeter, Erich T1 - 13C NMR chemical shifts in structural and stereochemical analysis T3 - Methods in stereochemical analysis Y1 - 1994 PB - VCH CY - New York ER - TY - BOOK A1 - Gonzáles-Diaz, P. F. A1 - Kasper, Uwe A1 - Rainer, Martin T1 - 2-Dimensional dilatonic gravity from multidimensional Einstein gravity T3 - Preprint / Universität Potsdam, Institut für Mathematik Y1 - 1997 VL - 1997, 22 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Schwarz, Wolfgang T1 - 40 puzzles and problems in probability and mathematical statistics Y1 - 2008 SN - 978-0-387-73511-5 U6 - https://doi.org/10.1007/978-0-387-73512-2 PB - Springer Science+Business Media LLC CY - New York, NY ER - TY - BOOK A1 - Aizenberg, Lev A. A1 - Tarchanov, Nikolaj N. T1 - A Bohr phenomenon for elliptic equations T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 1999 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Witt, Ingo T1 - A calculus for a class of finitely degenerate pseudodifferential operators T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2002 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Rabinovich, Vladimir A1 - Schulze, Bert-Wolfgang A1 - Tarchanov, Nikolaj N. T1 - A calculus of boundary value problems in domains with Non-Lipschitz singular points T3 - Preprint / Universität Potsdam, Institut für Mathematik Y1 - 1997 VL - 1997, 09 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Dahlke, Stephan A1 - Maaß, Peter T1 - A continuous wavelet transform on tangent bundles of spheres T3 - Preprint / Universität Potsdam, Institut für Mathematik Y1 - 1994 VL - 1994, 16 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Gauthier, P. M. A1 - Tarkhanov, Nikolai Nikolaevich T1 - A covering proberty of the Riemann zeta-funktion T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2004 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Korey, Michael Brian T1 - A Decomposition of functions with vanishing mean oscillation T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgrupe Partielle Differentialgleichun Y1 - 2001 SN - 1437-339X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Korrami, M. A1 - Mansouri, R. A1 - Mohazzab, Masoud T1 - A decrumpling model of the universe T3 - Preprint / Universität Potsdam, Institut für Mathematik Y1 - 1996 VL - 1996, 09 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Wolf, Hans-Georg A1 - Cummings, Patrick T1 - A dictionary of Hong Kong English : words from the fragrant harbor Y1 - 2011 SN - 988-808330-9 PB - Univ. of Hong Kong CY - Hong Kong ER - TY - BOOK A1 - Lledó, Fernando T1 - A family of examples with quantum constraints T3 - Preprint / Universität Potsdam, Institut für Mathematik Y1 - 1996 VL - 1996, 01 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Tarkhanov, Nikolai Nikolaevich T1 - A fixed point formula in one complex variable T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2003 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Schneider, Sven A1 - Lambers, Leen A1 - Orejas, Fernando T1 - A logic-based incremental approach to graph repair T1 - Ein logikbasierter inkrementeller Ansatz für Graphreparatur N2 - Graph repair, restoring consistency of a graph, plays a prominent role in several areas of computer science and beyond: For example, in model-driven engineering, the abstract syntax of models is usually encoded using graphs. Flexible edit operations temporarily create inconsistent graphs not representing a valid model, thus requiring graph repair. Similarly, in graph databases—managing the storage and manipulation of graph data—updates may cause that a given database does not satisfy some integrity constraints, requiring also graph repair. We present a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing repairs. In our context, we formalize consistency by so-called graph conditions being equivalent to first-order logic on graphs. We present two kind of repair algorithms: State-based repair restores consistency independent of the graph update history, whereas deltabased (or incremental) repair takes this history explicitly into account. Technically, our algorithms rely on an existing model generation algorithm for graph conditions implemented in AutoGraph. Moreover, the delta-based approach uses the new concept of satisfaction (ST) trees for encoding if and how a graph satisfies a graph condition. We then demonstrate how to manipulate these STs incrementally with respect to a graph update. N2 - Die Reparatur von Graphen, die Wiederherstellung der Konsistenz eines Graphen, spielt in mehreren Bereichen der Informatik und darüber hinaus eine herausragende Rolle: Beispielsweise wird in der modellgetriebenen Konstruktion die abstrakte Syntax von Modellen in der Regel mithilfe von Graphen kodiert. Flexible Bearbeitungsvorgänge erstellen vorübergehend inkonsistente Diagramme, die kein gültiges Modell darstellen, und erfordern daher eine Reparatur des Diagramms. Auf ähnliche Weise können Aktualisierungen in Graphendatenbanken - die das Speichern und Bearbeiten von Graphendaten verwalten - dazu führen, dass eine bestimmte Datenbank einige Integritätsbeschränkungen nicht erfüllt und auch eine Graphreparatur erforderlich macht. Wir präsentieren einen logikbasierten inkrementellen Ansatz für die Graphreparatur, der eine solide und vollständige (nach Beendigung) Übersicht über die am wenigsten verändernden Reparaturen erstellt. In unserem Kontext formalisieren wir die Konsistenz mittels sogenannten Graphbedingungen die der Logik erster Ordnung in Graphen entsprechen. Wir stellen zwei Arten von Reparaturalgorithmen vor: Die zustandsbasierte Reparatur stellt die Konsistenz unabhängig vom Verlauf der Graphänderung wieder her, während die deltabasierte (oder inkrementelle) Reparatur diesen Verlauf explizit berücksichtigt. Technisch stützen sich unsere Algorithmen auf einen vorhandenen Modellgenerierungsalgorithmus für in AutoGraph implementierte Graphbedingungen. Darüber hinaus verwendet der deltabasierte Ansatz das neue Konzept der Erfüllungsbäume (STs) zum Kodieren, ob und wie ein Graph eine Graphbedingung erfüllt. Wir zeigen dann, wie diese STs in Bezug auf eine Graphaktualisierung inkrementell manipuliert werden. T3 - Technische Berichte des Hasso-Plattner-Instituts für Digital Engineering an der Universität Potsdam - 126 KW - nested graph conditions KW - graph repair KW - model repair KW - consistency restoration KW - verschachtelte Graphbedingungen KW - Graphreparatur KW - Modellreparatur KW - Konsistenzrestauration Y1 - 2019 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-427517 SN - 978-3-86956-462-3 SN - 1613-5652 SN - 2191-1665 IS - 126 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - BOOK A1 - Rosenblum, Michael A1 - Kurths, Jürgen T1 - A model of neural control of heart rate T3 - Preprint NLD Y1 - 1995 VL - 12 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Böckmann, Christine T1 - A modification of the Trust-Region Gauss-Newton method to solve separable nonlinear least squares problems T3 - Preprint / Universität Potsdam, Fachbereich Mathematik Y1 - 1992 VL - 1992, 17 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Baumgärtel, Hellmut T1 - A modified approach to the Doplicher-Roberts theorem on the construction of field algebra and the symmetry group in superselection theory T3 - Preprint / SFB 288, Differentialgeometrie und Quantenphysik Y1 - 1994 VL - 134 CY - Berlin ER - TY - BOOK A1 - Ramlau, Ronny T1 - A modified Landweber-method for inverse problems T3 - Preprint / Universität Potsdam, Institut für Mathematik Y1 - 1997 VL - 1997, 03 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Böckmann, Christine A1 - Niebsch, Jenny T1 - A mollifier method for aerosol size T3 - Preprint / Universität Potsdam, Institut für Mathematik Y1 - 1996 VL - 1996, 07 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Schmidt, Marco A1 - Badtke, Gernot A1 - Bittmann, Frank A1 - Steuer, M. T1 - A new approach for objektive determination of the external spine profile in the sagittal plane Y1 - 1998 ER - TY - BOOK A1 - Kamani, D. A1 - Mansouri, R. T1 - A new class of inhomogeneous cosmological solutions T3 - Preprint / Universität Potsdam, Institut für Mathematik Y1 - 1995 VL - 1995, 07 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Sogomonyan, Egor S. A1 - Marienfeld, Daniel A1 - Ocheretnij, V. A1 - Gössel, Michael T1 - A new self-checking sum-bit duplicated carry-select adder T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2003 SN - 0946-7580 VL - 2003, 5 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Braunß, Hans-Andreas T1 - A note about ranks of m-homogeneous polynomials on Banach spaces T3 - Preprint / Universität Potsdam, Institut für Mathematik Y1 - 1998 VL - 1998, 18a PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Pincus, Richard T1 - A note on symmetric unimodal distributions ordered by peakedness T3 - Preprint / Universität Potsdam, Institut für Mathematik Y1 - 1997 VL - 1997, 27 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Jansen, Wolfgang T1 - A note on the determination of the type of communication areas T3 - Preprint NLD Y1 - 1996 VL - 33 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Camalès, Renaud T1 - A Note on the Ramified Cauchy Problem T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2003 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Addison, John T. A1 - Blackburn, McKinley L. T1 - A puzzling aspect of the effect of advance notice on unemployment T3 - Diskussionsbeitrag / Europäisches Institut für Internationale Wirtschaftsbeziehungen, Potsdam Y1 - 1995 VL - 5 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Polyvyanyy, Artem A1 - Kuropka, Dominik T1 - A quantitative evaluation of the enhanced topic-based vector space model N2 - This contribution presents a quantitative evaluation procedure for Information Retrieval models and the results of this procedure applied on the enhanced Topic-based Vector Space Model (eTVSM). Since the eTVSM is an ontology-based model, its effectiveness heavily depends on the quality of the underlaying ontology. Therefore the model has been tested with different ontologies to evaluate the impact of those ontologies on the effectiveness of the eTVSM. On the highest level of abstraction, the following results have been observed during our evaluation: First, the theoretically deduced statement that the eTVSM has a similar effecitivity like the classic Vector Space Model if a trivial ontology (every term is a concept and it is independet of any other concepts) is used has been approved. Second, we were able to show that the effectiveness of the eTVSM raises if an ontology is used which is only able to resolve synonyms. We were able to derive such kind of ontology automatically from the WordNet ontology. Third, we observed that more powerful ontologies automatically derived from the WordNet, dramatically dropped the effectiveness of the eTVSM model even clearly below the effectiveness level of the Vector Space Model. Fourth, we were able to show that a manually created and optimized ontology is able to raise the effectiveness of the eTVSM to a level which is clearly above the best effectiveness levels we have found in the literature for the Latent Semantic Index model with compareable document sets. T3 - Technische Berichte des Hasso-Plattner-Instituts für Digital Engineering an der Universität Potsdam - 19 Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-33816 SN - 978-3-939469-95-7 ER - TY - BOOK A1 - Polyvyanyy, Artem A1 - Kuropka, Dominik T1 - A Quantitative Evalution of the Enhanced Topic-based Vector Space Model T3 - Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsda Y1 - 2007 SN - 978-3-939469-95-7 SN - 1613-5652 VL - 19 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - BOOK A1 - Baumgärtel, Hellmut A1 - Jurke, Matthias A1 - Lledó, Fernando T1 - A remark on covariant and causal nets of CAR-resp.CCR-type local algebras assigned to the irreducible unitary representation of the poincare group labeled by (m>0, s, +) T3 - Preprint / SFB 288, Differentialgeometrie und Quantenphysik Y1 - 1994 VL - 120 CY - Berlin ER - TY - BOOK A1 - Fedosov, Boris V. A1 - Schulze, Bert-Wolfgang A1 - Tarchanov, Nikolaj N. T1 - A remark on the index of symmetric operators T3 - Preprint / Universität Potsdam, Institut für Mathematik Y1 - 1998 VL - 1998, 04 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Nazajkinskij, Vladimir E. A1 - Schulze, Bert-Wolfgang A1 - Sternin, Boris Ju. T1 - A semiclassical quantization on manifolds with singularities and the Lefschetz formula for elliptic operators T3 - Preprint / Universität Potsdam, Institut für Mathematik Y1 - 1998 VL - 1998, 19 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Schrohe, Elmar T1 - A short introduction to Boutet de Monvel`s calculus T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2000 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Fanselow, Gisbert A1 - Féry, Caroline T1 - A short treatise of optimality theory T3 - Linguistics in Potsdam - 18 Y1 - 2002 SN - 978-3-935024-54-9 SN - 1616-7392 PB - Univ.-Bibliothek Publ.-Stelle CY - Potsdam ER - TY - BOOK A1 - Seuring, Markus A1 - Gössel, Michael A1 - Sogomonyan, Egor S. T1 - A structural approach for space compaction for concurrent checking and BIST T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 1997 SN - 0946-7580 VL - 1997, 01 PB - Univ. Potsdam CY - Potsdam [u.a.] ER - TY - BOOK A1 - Seuring, Markus A1 - Gössel, Michael T1 - A structural approach for space compaction for sequential circuits T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 1998 SN - 0946-7580 VL - 1998, 05 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Nastansky, Andreas A1 - Mehnert, Alexander A1 - Strohe, Hans Gerhard T1 - A vector error correction model for the relationship between public debt and inflation in Germany N2 - In the paper, the interaction between public debt and inflation including mutual impulse response will be analysed. The European sovereign debt crisis brought once again the focus on the consequences of public debt in combination with an expansive monetary policy for the development of consumer prices. Public deficits can lead to inflation if the money supply is expansive. The high level of national debt, not only in the Euro-crisis countries, and the strong increase in total assets of the European Central Bank, as a result of the unconventional monetary policy, caused fears on inflating national debt. The transmission from public debt to inflation through money supply and long-term interest rate will be shown in the paper. Based on these theoretical thoughts, the variables public debt, consumer price index, money supply m3 and long-term interest rate will be analysed within a vector error correction model estimated by Johansen approach. In the empirical part of the article, quarterly data for Germany from 1991 by 2010 are to be examined. T3 - Statistische Diskussionsbeiträge - 51 KW - Beveridge-Nelson Decomposition KW - Public Debt KW - Inflation KW - Money Supply KW - Vector Error Correction Model Y1 - 2014 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-50246 ER - TY - BOOK A1 - Hu, Ji A1 - Cordel, Dirk A1 - Meinel, Christoph T1 - A virtual machine architecture for creating IT-security laboratories N2 - E-learning is a flexible and personalized alternative to traditional education. Nonetheless, existing e-learning systems for IT security education have difficulties in delivering hands-on experience because of the lack of proximity. Laboratory environments and practical exercises are indispensable instruction tools to IT security education, but security education in con-ventional computer laboratories poses the problem of immobility as well as high creation and maintenance costs. Hence, there is a need to effectively transform security laboratories and practical exercises into e-learning forms. This report introduces the Tele-Lab IT-Security architecture that allows students not only to learn IT security principles, but also to gain hands-on security experience by exercises in an online laboratory environment. In this architecture, virtual machines are used to provide safe user work environments instead of real computers. Thus, traditional laboratory environments can be cloned onto the Internet by software, which increases accessibilities to laboratory resources and greatly reduces investment and maintenance costs. Under the Tele-Lab IT-Security framework, a set of technical solutions is also proposed to provide effective functionalities, reliability, security, and performance. The virtual machines with appropriate resource allocation, software installation, and system configurations are used to build lightweight security laboratories on a hosting computer. Reliability and availability of laboratory platforms are covered by the virtual machine management framework. This management framework provides necessary monitoring and administration services to detect and recover critical failures of virtual machines at run time. Considering the risk that virtual machines can be misused for compromising production networks, we present security management solutions to prevent misuse of laboratory resources by security isolation at the system and network levels. This work is an attempt to bridge the gap between e-learning/tele-teaching and practical IT security education. It is not to substitute conventional teaching in laboratories but to add practical features to e-learning. This report demonstrates the possibility to implement hands-on security laboratories on the Internet reliably, securely, and economically. T3 - Technische Berichte des Hasso-Plattner-Instituts für Digital Engineering an der Universität Potsdam - 13 Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-33077 SN - 978-3-939469-13-1 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - BOOK A1 - Seehafer, Norbert A1 - Zienicke, Egbert A1 - Feudel, Fred T1 - Absence of magnetohydrodynamic activity in the voltage-driven sheet T3 - Preprint NLD Y1 - 1996 VL - 32 PB - Univ. CY - Potsdam ER - TY - BOOK ED - Jürgensen, Helmut T1 - Accessible Media : Pre-Proceedings of a Workshop Potsdam 8-9 May, 2006 T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2006 SN - 0946-7580 VL - 2006, 7 PB - Univ. CY - Potsdam ER - TY - BOOK A1 - Welfens, Paul J. J. T1 - Achieving competition in Europe's telecommunications sector T3 - Diskussionsbeitrag / Europäisches Institut für Internationale Wirtschaftsbeziehungen, Potsdam Y1 - 1995 VL - 3 PB - Univ. CY - Potsdam ER - TY - BOOK ED - Sternagel, Jörg ED - Levitt, Deborah ED - Mersch, Dieter T1 - Acting and performance in moving image culture : bodies, screens, renderings T3 - Metabasis Y1 - 2012 SN - 978-3-8376-1648-4 U6 - https://doi.org/10.14361/transcript.9783839416488 VL - 7 PB - transcript; de Gruyter CY - Bielefeld; Berlin ER - TY - BOOK A1 - Smirnov, Sergey A1 - Weidlich, Matthias A1 - Mendling, Jan A1 - Weske, Mathias T1 - Action patterns in business process models N2 - Business process management experiences a large uptake by the industry, and process models play an important role in the analysis and improvement of processes. While an increasing number of staff becomes involved in actual modeling practice, it is crucial to assure model quality and homogeneity along with providing suitable aids for creating models. In this paper we consider the problem of offering recommendations to the user during the act of modeling. Our key contribution is a concept for defining and identifying so-called action patterns - chunks of actions often appearing together in business processes. In particular, we specify action patterns and demonstrate how they can be identified from existing process model repositories using association rule mining techniques. Action patterns can then be used to suggest additional actions for a process model. Our approach is challenged by applying it to the collection of process models from the SAP Reference Model. N2 - Die zunehmende Bedeutung des Geschäftsprozessmanagements führt dazu, dass eine steigende Anzahl von Mitarbeitern eines Unternehmens mit der Erstellung von Prozessmodellen betraut ist. Um trotz dieser Tendenz die Qualität der Prozessmodelle, sowie ihre Homogenität sicherzustellen, sind entsprechende Modellierungshilfen unabdingbar. In diesem Bericht stellen wir einen Ansatz vor, welcher die Prozessmodellierung durch Empfehlungen unterstützt. Jene basieren auf sogenannten Aktionsmustern, welche typische Arbeitsblöcke darstellen. Neben der Definition dieser Aktionsmuster zeigen wir eine Methode zur Identifikation dieser Muster auf. Mittels Techniken der Assoziationsanalyse können die Muster automatisch aus einer Sammlung von Prozessmodellen extrahiert werden. Die Anwendbarkeit unseres Ansatzes wird durch eine Fallstudie auf Basis des SAP Referenzmodells illustriert. T3 - Technische Berichte des Hasso-Plattner-Instituts für Digital Engineering an der Universität Potsdam - 30 Y1 - 2009 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-33586 SN - 978-3-86956-009-0 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - BOOK A1 - Baumgärtel, Hellmut T1 - Actions of finite abelian groups on abelian C*-algebras Z: Second cohomology and description by C*-extensions F ) Z T3 - Preprint / SFB 288, Differentialgeometrie und Quantenphysik Y1 - 1999 VL - 383 CY - Berlin ER - TY - BOOK A1 - Draisbach, Uwe A1 - Naumann, Felix A1 - Szott, Sascha A1 - Wonneberg, Oliver T1 - Adaptive windows for duplicate detection N2 - Duplicate detection is the task of identifying all groups of records within a data set that represent the same real-world entity, respectively. This task is difficult, because (i) representations might differ slightly, so some similarity measure must be defined to compare pairs of records and (ii) data sets might have a high volume making a pair-wise comparison of all records infeasible. To tackle the second problem, many algorithms have been suggested that partition the data set and compare all record pairs only within each partition. One well-known such approach is the Sorted Neighborhood Method (SNM), which sorts the data according to some key and then advances a window over the data comparing only records that appear within the same window. We propose several variations of SNM that have in common a varying window size and advancement. The general intuition of such adaptive windows is that there might be regions of high similarity suggesting a larger window size and regions of lower similarity suggesting a smaller window size. We propose and thoroughly evaluate several adaption strategies, some of which are provably better than the original SNM in terms of efficiency (same results with fewer comparisons). N2 - Duplikaterkennung beschreibt das Auffinden von mehreren Datensätzen, die das gleiche Realwelt-Objekt repräsentieren. Diese Aufgabe ist nicht trivial, da sich (i) die Datensätze geringfügig unterscheiden können, so dass Ähnlichkeitsmaße für einen paarweisen Vergleich benötigt werden, und (ii) aufgrund der Datenmenge ein vollständiger, paarweiser Vergleich nicht möglich ist. Zur Lösung des zweiten Problems existieren verschiedene Algorithmen, die die Datenmenge partitionieren und nur noch innerhalb der Partitionen Vergleiche durchführen. Einer dieser Algorithmen ist die Sorted-Neighborhood-Methode (SNM), welche Daten anhand eines Schlüssels sortiert und dann ein Fenster über die sortierten Daten schiebt. Vergleiche werden nur innerhalb dieses Fensters durchgeführt. Wir beschreiben verschiedene Variationen der Sorted-Neighborhood-Methode, die auf variierenden Fenstergrößen basieren. Diese Ansätze basieren auf der Intuition, dass Bereiche mit größerer und geringerer Ähnlichkeiten innerhalb der sortierten Datensätze existieren, für die entsprechend größere bzw. kleinere Fenstergrößen sinnvoll sind. Wir beschreiben und evaluieren verschiedene Adaptierungs-Strategien, von denen nachweislich einige bezüglich Effizienz besser sind als die originale Sorted-Neighborhood-Methode (gleiches Ergebnis bei weniger Vergleichen). T3 - Technische Berichte des Hasso-Plattner-Instituts für Digital Engineering an der Universität Potsdam - 49 KW - Informationssysteme KW - Datenqualität KW - Datenintegration KW - Duplikaterkennung KW - Duplicate Detection KW - Data Quality KW - Data Integration KW - Information Systems Y1 - 2012 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-53007 SN - 978-3-86956-143-1 SN - 1613-5652 SN - 2191-1665 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - BOOK A1 - Junker, W. A1 - Schrohe, Elmar T1 - Adiabatic vacuum states on general spacetime manifolds : definition, construction and physical properties T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2001 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - BOOK ED - Kun-Buczoko, Magdalena T1 - Adult education on quality management and other cross-selectional aspects of public administration Y1 - 2003 SN - 83-88463-25-X PB - Wy?sza Szko?a Administracji Publ CY - Bia?ystok ER - TY - BOOK ED - Struszczyk, Henryk ED - Peter, Martin G. ED - Domard, Alain ED - Pospieszny, Henryk T1 - Advances in chitin science Y1 - 1996 ER - TY - BOOK ED - Solla, Sara A. ED - Müller, Klaus-Robert T1 - Advances in neural information processing systems 12 : proceedings of the 1999 conference Y1 - 2000 SN - 0-262-19450-3 PB - MIT Press CY - Cambridge, Mass. ER - TY - BOOK A1 - Schulze, Bert-Wolfgang A1 - Demuth, Michael A1 - Albeverio, Sergio A1 - Schrohe, Elmar T1 - Advances in Partial differential equations Y1 - 2001 PB - Birkhäuser CY - Basel ER -