1 Grundlagen.- 1.1 Allgemeine Grundlagen.- 1.1.1 Ziele und Aufgaben.- 1.1.2 Methoden.- 1.1.3 Geschichte und Einordnung.- 1.1.3.1 Geschichte der Bauwerksvermessung.- 1.1.3.2 Geschichte des Vermessungswesens.- 1.1.3.3 Geschichte der Architekturphotogrammetrie.- 1.1.4 Rechtliche Grundlagen und Rahmenbedingungen.- 1.1.4.1 Internationale Vereinbarungen und Organisationen.- 1.1.4.2 Baugesetzbuch, Denkmalpflegegesetze, Vermessungsgesetze.- 1.2 Messgroessen und Masseinheiten.- 1.2.1 Strecken.- 1.2.2 Winkel.- 1.3 Bezugssysteme und Koordinaten.- 1.3.1 Bezugsflachen.- 1.3.2 Koordinaten.- 1.3.3 Koordinatensysteme.- 1.3.3.1 Polarkoordinaten.- 1.3.3.2 Lokale Koordinatensysteme.- 1.3.3.3 Regionale Koordinatensysteme.- 1.3.3.4 Globale Koordinatensysteme.- 1.3.3.5 Geographische Koordinaten.- 1.3.3.6 Geozentrische Koordinaten.- 1.3.4 Koordinatentransformationen.- 1.3.4.1 Translation (2D).- 1.3.4.2 Massstabslose Transformation (2D).- 1.3.4.3 AEhnlichkeitstransformation (2D).- 1.3.4.4 Vereinfachte AEhnlichkeitstransformation mit 2 Passpunkten (2D).- 1.3.4.5 Affintransformation (2D).- 1.3.4.6 Weitere ebene Koordinatentransformationen.- 1.3.4.7 Raumliche Koordinatentransformation (3D).- 1.3.5 Festpunktfelder.- 1.3.5.1 Netz trigonometrischer Punkte zur Lagedefinition.- 1.3.5.2 Hoehennetz.- 1.3.6 Vermessungsnetze fur die Bauwerksvermessung.- 1.3.6.1 Netzdesign.- 1.3.6.2 Vermarkung.- 1.3.6.3 Design und Fertigung von Punktsignalisierungen.- 1.3.6.4 Auswahl naturlicher Passpunkte.- 1.3.6.5 Schnurnetz zur temporaren Vermarkung.- 1.3.6.6 Punktubersichten und Einmessskizzen.- 1.4 Fehlerlehre und Statistik.- 1.4.1 Fehlerarten und ihre Wirkung.- 1.4.1.1 Zufallige Fehler.- 1.4.1.2 Systematische Fehler.- 1.4.1.3 Grobe Fehler.- 1.4.2 Fehlerfortpflanzung und Ausgleichsrechnung.- 1.4.3 Rechenscharfe und Rundung.- 1.4.4 Toleranzen im Bauwesen.- 2 Dokumentation von Gebauden und Ensembles.- 2.1 Amtliche Dokumentation.- 2.1.1 Katasterunterlagen.- 2.1.2 Amtliche Karten.- 2.1.3 Lageplan.- 2.1.4 Geoinformationssysteme (GIS).- 2.2 Plane.- 2.2.1 Grundriss.- 2.2.2 Schnitt.- 2.2.3 Ansicht.- 2.2.4 Detaildarstellungen.- 2.2.5 Massstabe und Detaillierungsgrad.- 2.2.6 Materialien und Aufbewahrung.- 2.3 3D-Beschreibungen.- 2.3.1 CAD-Modell.- 2.3.2 Animation.- 2.3.3 Virtual Reality.- 2.3.4 Augmented Reality.- 2.4 Fotografie.- 2.4.1 Analoge Fotografie.- 2.4.1.1 Fotografisches Material.- 2.4.1.2 Kameras.- 2.4.1.3 Objektive.- 2.4.1.4 Licht.- 2.4.1.5 Belichtung.- 2.4.1.6 Archivierungen von Fotomaterialien.- 2.4.2 Digitale Bilder.- 2.4.2.1 Flachensensoren.- 2.4.2.2 Zeilenkameras.- 2.4.2.3 Spezialkameras.- 2.4.3 Scannen analoger Fotovorlagen.- 2.4.4 Digitale Bildverarbeitung.- 2.5 Textliche und hybride Beschreibungen.- 2.5.1 Raumbuch.- 2.5.2 Hypertext Dokumente.- 2.5.3 Informationssystem.- 2.6 Archivierung digitaler Daten.- 2.6.1 Datentrager.- 2.6.2 Datenformate.- 2.6.2.1 Texte.- 2.6.2.2 Datenbanken.- 2.6.2.3 Vektordaten.- 2.6.2.4 Rasterdaten.- 2.6.2.5 Hypermedia.- 3 Erfassung von Messelementen.- 3.1 Messprinzipien.- 3.1.1 Vom-Grossen-ins-Kleine.- 3.1.2 UEberbestimmungen.- 3.1.3 Vermeidung von systematischen Fehlern.- 3.2 Gerate und Instrumente.- 3.2.1 Bauteile, Kleingerate und Zubehoer.- 3.2.1.1 Lote und Libellen.- 3.2.1.2 Fernrohr.- 3.2.1.3 Stative.- 3.2.1.4 Fluchtstab.- 3.2.1.5 Nivellierlatten und Kleingerat.- 3.2.1.6 Aufstellen eines Instruments.- 3.2.2 Winkelmessung.- 3.2.2.1 Bestimmung rechter Winkel.- 3.2.2.2 Theodolit.- 3.2.2.3 Satzmessung.- 3.2.2.4 Berechnung von Richtungswinkeln aus Koordinaten.- 3.2.3 Streckenmessung.- 3.2.3.1 Streckenmessung mit dem Messband.- 3.2.3.2 Optische Streckenmessung.- 3.2.3.3 Elektro-optische Entfernungsmessung (EDM).- 3.2.4 Hoehenmessung.- 3.2.4.1 Einfache Werkzeuge.- 3.2.4.2 Nivellement.- 3.2.4.3 Rotationslaser.- 3.3 Beschaffung einer Vermessungsausrustung.- 4 Messverfahren.- 4.1 Schrittskizze.- 4.2 Handaufmass.- 4.3 Punktbestimmung ohne Theodolit.- 4.3.1 Bogenschlag.- 4.3.2 Einbindeverfahren.- 4.3.3 Orthogonalverfahren.- 4.3.4

Outliers play an important, though underestimated, role in control engineering. Traditionally they are unseen and neglected. In opposition, industrial practice gives frequent examples of their existence and their mostly negative impacts on the control quality. The origin of outliers is never fully known. Some of them are generated externally to the process (exogenous), like for instance erroneous observations, data corrupted by control systems or the effect of human intervention. Such outliers appear occasionally with some unknow probability shifting real value often to some strange and nonsense value. They are frequently called deviants, anomalies or contaminants. In most cases we are interested in their detection and removal. However, there exists the second kind of outliers. Quite often strange looking data observations are not artificial data occurrences. They may be just representatives of the underlying generation mechanism being inseparable internal part of the process (endogenous outliers). In such a case they are not wrong and should be treated with cautiousness, as they may include important information about the dynamic nature of the process. As such they cannot be neglected nor simply removed. The Outlier should be detected, labelled and suitably treated. These activities cannot be performed without proper analytical tools and modeling approaches. There are dozens of methods proposed by scientists, starting from Gaussian-based statistical scoring up to data mining artificial intelligence tools. The research presented in this book presents novel approach incorporating non-Gaussian statistical tools and fractional calculus approach revealing new data analytics applied to this important and challenging task. The proposed book includes a collection of contributions addressing different yet cohesive subjects, like dynamic modelling, classical control, advanced control, fractional calculus, statistical analytics focused on an ultimate goal: robust and outlier-proof analysis. All studied problems show that outliers play an important role and classical methods, in which outlier are not taken into account, do not give good results. Applications from different engineering areas are considered such as semiconductor process control and monitoring, MIMO peltier temperature control and health monitoring, networked control systems, and etc.

Field Arithmetic explores Diophantine fields through their absolute Galois groups. This largely self-contained treatment starts with techniques from algebraic geometry, number theory, and profinite groups. Graduate students can effectively learn generalizations of finite field ideas. We use Haar measure on the absolute Galois group to replace counting arguments. New Chebotarev density variants interpret diophantine properties. Here we have the only complete treatment of Galois stratifications, used by Denef and Loeser, et al, to study Chow motives of Diophantine statements.

Progress from the first edition starts by characterizing the finite-field like P(seudo)A(lgebraically)C(losed) fields. We once believed PAC fields were rare. Now we know they include valuable Galois extensions of the rationals that present its absolute Galois group through known groups. PAC fields have projective absolute Galois group. Those that are Hilbertian are characterized by this group being pro-free. These last decade results are tools for studying fields by their relation to those with projective absolute group. There are still mysterious problems to guide a new generation: Is the solvable closure of the rationals PAC; and do projective Hilbertian fields have pro-free absolute Galois group (includes Shafarevich's conjecture)?

The third edition improves the second edition in two ways: First it removes many typos and mathematical inaccuracies that occur in the second edition (in particular in the references). Secondly, the third edition reports on five open problems (out of thirtyfour open problems of the second edition) that have been partially or fully solved since that edition appeared in 2005.

Metagraphs and Their Applications is a presentation of metagraph theory and its applications that begins by defining a metagraph and its uses. They are more complex than a simple graph structure, but they allow for representation and analysis of more complex systems. The material contained in this book is presented in two parts. The first develops the theoretical results with the emphasis on the development of a metagraph algebra. In the second part of the book, four promising applications of metagraphs are examined: modeling of data relations; the modeling of decision models; the modeling of decision rules; and the modeling of workflow tasks. Hence, the theoretical results in the initial chapters lay the foundation for the application areas in the second part of the book. The book concludes by examining several possible extensions of this work.

The aim of this book is to present a substantial part of matrix analysis that is functional analytic in spirit. Much of this will be of interest to graduate students and research workers in operator theory, operator algebras, mathematical physics and numerical analysis. The book can be used as a basic text for graduate courses on advanced linear algebra and matrix analysis. It can also be used as supplementary text for courses in operator theory and numerical analysis. Among topics covered are the theory of majorization, variational principles for eigenvalues, operator monotone and convex functions, perturbation of matrix functions and matrix inequalities. Much of this is presented for the first time in a unified way in a textbook. The reader will learn several powerful methods and techniques of wide applicability, and see connections with other areas of mathematics. A large selection of matrix inequalities will make this book a valuable reference for students and researchers who are working in numerical analysis, mathematical physics and operator theory.

A look at solving problems in three areas of classical elementary mathematics: equations and systems of equations of various kinds, algebraic inequalities, and elementary number theory, in particular divisibility and diophantine equations. In each topic, brief theoretical discussions are followed by carefully worked out examples of increasing difficulty, and by exercises which range from routine to rather more challenging problems. While it emphasizes some methods that are not usually covered in beginning university courses, the book nevertheless teaches techniques and skills which are useful beyond the specific topics covered here. With approximately 330 examples and 760 exercises.

The theme of this book is operator theory on C*-algebras. The main novel tool employed is the concept of local multipliers. Originally devised by Elliott and Pedersen in the 1970's in order to study derivations and automorphisms, local multipliers of C*-algebras were developed into a powerful device by the present authors in the 1990's. The book serves two purposes. The first part provides the reader - specialist and advanced graduate student alike - with a thorough introduction to the theory of local multipliers. Only a minimal knowledge of algebra and analysis is required, as the prerequisites in both non-commutative ring theory and basic C*-algebra theory are presented in the first chapter. In the second part, local multipliers are used to obtain a wealth of information on various classes of operators on C*-algebras, including (groups of) automorphisms, derivations, elementary operators, Lie isomorphisms and Lie derivations, as well as others. Many of the results appear in print for the first time. The authors have made an effort to avoid intricate technicalities thus some of the results are not pushed to their utmost generality. Several open problems are discussed, and hints for further developments are given.

A consistent and near complete survey of the important progress made in the field over the last few years, with the main emphasis on the rigidity method and its applications. Among others, this monograph presents the most successful existence theorems known and construction methods for Galois extensions as well as solutions for embedding problems combined with a collection of the existing Galois realizations.

The mathematical theory of wavelets is less than 15 years old, yet already wavelets have become a fundamental tool in many areas of applied mathematics and engineering. This introduction to wavelets assumes a basic background in linear algebra (reviewed in Chapter 1) and real analysis at the undergraduate level. Fourier and wavelet analyses are first presented in the finite-dimensional context, using only linear algebra. Then Fourier series are introduced in order to develop wavelets in the infinite-dimensional, but discrete context. Finally, the text discusses Fourier transform and wavelet theory on the real line. The computation of the wavelet transform via filter banks is emphasized, and applications to signal compression and numerical differential equations are given. This text is ideal for a topics course for mathematics majors, because it exhibits and emerging mathematical theory with many applications. It also allows engineering students without graduate mathematics prerequisites to gain a practical knowledge of wavelets.

Vertex algebra was introduced by Boreherds, and the slightly revised notion "vertex oper- ator algebra" was formulated by Frenkel, Lepowsky and Meurman, in order to solve the problem of the moonshine representation of the Monster group - the largest sporadie group. On the one hand, vertex operator algebras ean be viewed as extensions of eertain infinite-dimensional Lie algebras such as affine Lie algebras and the Virasoro algebra. On the other hand, they are natural one-variable generalizations of commutative associative algebras with an identity element. In a certain sense, Lie algebras and commutative asso- ciative algebras are reconciled in vertex operator algebras. Moreover, some other algebraie structures, such as integral linear lattiees, Jordan algebras and noncommutative associa- tive algebras, also appear as subalgebraic structures of vertex operator algebras. The axioms of vertex operator algebra have geometrie interpretations in terms of Riemman spheres with punctures. The trace functions of a certain component of vertex operators enjoy the modular invariant properties. Vertex operator algebras appeared in physies as the fundamental algebraic structures of eonformal field theory, whieh plays an important role in string theory and statistieal meehanies. Moreover,eonformalfieldtheoryreveals animportantmathematiealproperty,the so called "mirror symmetry" among Calabi-Yau manifolds. The general correspondence between vertex operator algebras and Calabi-Yau manifolds still remains mysterious. Ever since the first book on vertex operator algebras by Frenkel, Lepowsky and Meur- man was published in 1988, there has been a rapid development in vertex operator su- peralgebras, which are slight generalizations of vertex operator algebras.

The topic of this book is finite group actions and their use in order to approach finite unlabeled structures by defining them as orbits of finite groups of sets. Well-known examples are graph, linear codes, chemical isomers, spin configurations, isomorphism classes of combinatorial designs etc.The second edition is an extended version and puts more emphasis on applications to the constructive theory of finite structures. Recent progress in this field, in particular in design and coding theory, is described.This book will be of great use to researchers and graduate students.

This book presents the state-of-the-art research on the teaching and learning of linear algebra in the first year of university, in an international perspective. It provides university teachers in charge of linear algebra courses with a wide range of information from works including theoretical and experimental issues.

Accurate and efficient computer algorithms for factoring matrices, solving linear systems of equations, and extracting eigenvalues and eigenvectors. Regardless of the software system used, the book describes and gives examples of the use of modern computer software for numerical linear algebra. It begins with a discussion of the basics of numerical computations, and then describes the relevant properties of matrix inverses, factorisations, matrix and vector norms, and other topics in linear algebra. The book is essentially self- contained, with the topics addressed constituting the essential material for an introductory course in statistical computing. Numerous exercises allow the text to be used for a first course in statistical computing or as supplementary text for various courses that emphasise computations.

ClDo _ IIIIIIIoaIIIics bu _ die 'EI JDDi, sij'_ . . . . -. . . _. je _ . . . . . lIbupalaJllllllllll __ D'y_poa: wbae it beIoap. . . . die . . ." . ., . . _ DOD to dlecluly __ __ . 1110 _ is dioapaI; -. . e _ may be EricT. BeD IbIetodo--'_iL O. 1feaoriIide Mathematics is a tool for dloogIrt. A bighly necessary tool in a world where both feedback and noolineari ties abound. Similarly, all kinds of parts of IIIIIIhcmatiI: s serve as tools for odIcr parts and for ocher sci eoccs. Applying a simple rewriting rule to the quote on the right above one finds suc: h stalements as: 'One ser vice topology has rcncIerM mathematical physics . . . '; 'One service logic has rendered computer science . . '; 'One service category theory has rmdcn: d mathematics . . . '. All arguably true. And all statements obrainable this way form part of the raison d'etm of this series. This series, Mathmlatics tDIII Its Applications, saaned in 1977. Now that over one hundred volumcs have appeared it seems opportune to reexamine its scope. AI. the time I wrote "Growing spccialization and divenification have brought a host of monographs and textbooks on incJeasingly specialized topics. However, the 'tree' of knowledge of JJJatbcmatics and reIatcd ficIds docs not grow only by putting forth new bnDdIcs. It also happens, quite often in fact, that brancbes which were thought to be comp1etcly disparate am suddenly seen to be rdatcd."

to Group Rings by Cesar Polcino Milies Instituto de Matematica e Estatistica, Universidade de sao Paulo, sao Paulo, Brasil and Sudarshan K. Sehgal Department of Mathematical and Statistical Sciences, University of Alberta, Edmonton. Canada SPRINGER-SCIENCE+BUSINESS MEDIA, B.V. A c.I.P. Catalogue record for this book is available from the Library of Congress. ISBN 978-1-4020-0239-7 ISBN 978-94-010-0405-3 (eBook) DOI 10.1007/978-94-010-0405-3 Printed an acid-free paper AII Rights Reserved (c) 2002 Springer Science+Business Media Dordrecht Originally published by Kluwer Academic Publishers in 2002 Softcover reprint ofthe hardcover Ist edition 2002 No part of the material protected by this copyright notice may be reproduced or utilized in any form or by any means, electronic or mechanical, inc1uding photocopying, recording Of by any information storage and retrieval system, without written permis sion from the copyright owner. Contents Preface ix 1 Groups 1 1.1 Basic Concepts . . . . . . . . . . . . 1 1.2 Homomorphisms and Factor Groups 10 1.3 Abelian Groups . 18 1.4 Group Actions, p-groups and Sylow Subgroups 21 1.5 Solvable and Nilpotent Groups 27 1.6 FC Groups .

The theory of operators stands at the intersection of the frontiers of modern analysis and its classical counterparts; of algebra and quantum mechanics; of spectral theory and partial differential equations; of the modern global approach to topology and geometry; of representation theory and harmonic analysis; and of dynamical systems and mathematical physics. The present collection of papers represents contributions to a conference, and they have been carefully selected with a view to bridging different but related areas of mathematics which have only recently displayed an unexpected network of interconnections, as well as new and exciting cross-fertilizations. Our unify ing theme is the algebraic view and approach to the study of operators and their applications. The complementarity between the diversity of topics on the one hand and the unity of ideas on the other has been stressed. Some of the longer contributions represent material from lectures (in expanded form and with proofs for the most part). However, the shorter papers, as well as the longer ones, are an integral part of the picture; they have all been carefully refereed and revised with a view to a unity of purpose, timeliness, readability, and broad appeal. Raul Curto and Paile E. T."

This two-volume work introduces the theory and applications of Schur-convex functions. The first volume introduces concepts and properties of Schur-convex functions, including Schur-geometrically convex functions, Schur-harmonically convex functions, Schur-power convex functions, etc. and also discusses applications of Schur-convex functions in symmetric function inequalities.

A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.

This book features selected papers from The Seventh International Conference on Research and Education in Mathematics that was held in Kuala Lumpur, Malaysia from 25 - 27th August 2015. With chapters devoted to the most recent discoveries in mathematics and statistics and serve as a platform for knowledge and information exchange between experts from academic and industrial sectors, it covers a wide range of topics, including numerical analysis, fluid mechanics, operation research, optimization, statistics and game theory. It is a valuable resource for pure and applied mathematicians, statisticians, engineers and scientists, and provides an excellent overview of the latest research in mathematical sciences.

The method of exponential sums is a general method enabling the solution of a wide range of problems in the theory of numbers and its applications. This volume presents an exposition of the fundamentals of the theory with the help of examples which show how exponential sums arise and how they are applied in problems of number theory and its applications. The material is divided into three chapters which embrace the classical results of Gauss, and the methods of Weyl, Mordell and Vinogradov; the traditional applications of exponential sums to the distribution of fractional parts, the estimation of the Riemann zeta function; and the theory of congruences and Diophantine equations. Some new applications of exponential sums are also included. It is assumed that the reader has a knowledge of the fundamentals of mathematical analysis and of elementary number theory.

The problem of classifying the finite dimensional simple Lie algebras over fields of characteristic p > 0 is a long-standing one. Work on this question has been directed by the Kostrikin-Shafarevich Conjecture of 1966, which states that over an algebraically closed field of characteristic p > 5 a finite dimensional restricted simple Lie algebra is classical or of Cartan type. This conjecture was proved for p > 7 by Block and Wilson in 1988. The generalization of the Kostrikin-Shafarevich Conjecture for the general case of not necessarily restricted Lie algebras and p > 7 was announced in 1991 by Strade and Wilson and eventually proved by Strade in 1998. The final Block-Wilson-Strade-Premet Classification Theorem is a landmark result of modern mathematics and can be formulated as follows: Every simple finite dimensional simple Lie algebra over an algebraically closed field of characteristic p > 3 is of classical, Cartan, or Melikian type. In the three-volume book, the author is assembling the proof of the Classification Theorem with explanations and references. The goal is a state-of-the-art account on the structure and classification theory of Lie algebras over fields of positive characteristic. This first volume is devoted to preparing the ground for the classification work to be performed in the second and third volumes. The concise presentation of the general theory underlying the subject matter and the presentation of classification results on a subclass of the simple Lie algebras for all odd primes will make this volume an invaluable source and reference for all research mathematicians and advanced graduate students in algebra. The second edition is corrected. Contents Toral subalgebras in p-envelopes Lie algebras of special derivations Derivation simple algebras and modules Simple Lie algebras Recognition theorems The isomorphism problem Structure of simple Lie algebras Pairings of induced modules Toral rank 1 Lie algebras

With this translation, the classic monograph UEber die Klassenzahl abelscher Zahlkoerper by Helmut Hasse is now available in English for the first time. The book addresses three main topics: class number formulas for abelian number fields; expressions of the class number of real abelian number fields by the index of the subgroup generated by cyclotomic units; and the Hasse unit index of imaginary abelian number fields, the integrality of the relative class number formula, and the class number parity. Additionally, the book includes reprints of works by Ken-ichi Yoshino and Mikihito Hirabayashi, which extend the tables of Hasse unit indices and the relative class numbers to imaginary abelian number fields with conductor up to 100. The text provides systematic and practical methods for deriving class number formulas, determining the unit index and calculating the class number of abelian number fields. A wealth of illustrative examples, together with corrections and remarks on the original work, make this translation a valuable resource for today's students of and researchers in number theory.

During the last fifty years, Gopinath Kallianpur has made extensive and significant contributions to diverse areas of probability and statistics, including stochastic finance, Fisher consistent estimation, non-linear prediction and filtering problems, zero-one laws for Gaussian processes and reproducing kernel Hilbert space theory, and stochastic differential equations in infinite dimensions. To honor Kallianpur's pioneering work and scholarly achievements, a number of leading experts have written research articles highlighting progress and new directions of research in these and related areas. This commemorative volume, dedicated to Kallianpur on the occasion of his seventy-fifth birthday, will pay tribute to his multi-faceted achievements and to the deep insight and inspiration he has so graciously offered his students and colleagues throughout his career. Contributors to the volume: S. Aida, N. Asai, K. B. Athreya, R. N. Bhattacharya, A. Budhiraja, P. S. Chakraborty, P. Del Moral, R. Elliott, L. Gawarecki, D. Goswami, Y. Hu, J. Jacod, G. W. Johnson, L. Johnson, T. Koski, N. V. Krylov, I. Kubo, H.-H. Kuo, T. G. Kurtz, H. J. Kushner, V. Mandrekar, B. Margolius, R. Mikulevicius, I. Mitoma, H. Nagai, Y. Ogura, K. R. Parthasarathy, V. Perez-Abreu, E. Platen, B. V. Rao, B. Rozovskii, I. Shigekawa, K. B. Sinha, P. Sundar, M. Tomisaki, M. Tsuchiya, C. Tudor, W. A. Woycynski, J. Xiong