### Refine

#### Year of publication

- 1991 (33) (remove)

#### Document Type

- Preprint (18)
- Report (14)
- Working Paper (1)

#### Language

- English (33) (remove)

#### Keywords

- Carbon atomic ion (1)
- Case-Based Reasoning (1)
- Energietransfer (1)
- Fallbasiertes Schliessen (1)
- Ion source (1)
- Ionenquelle (1)
- Kohlenstoffion (1)
- Lasererzeugtes Plasma (1)
- Tantalion (1)
- Tantalum atomic ion (1)
- energie efficiency (1)
- laser-produced plasma (1)

#### Faculty / Organisational entity

In this paper the existence of translation transversal designs which is equivalent to the existence of certain particular partitions in finite groups is studied. All considerations are based on the fact that the particular component of such a partition (the component representing the point classes of the corresponding design) is a normal subgroup of the translation group. With regard to groups admitting an (s,k,\(\lambda\))-partiton, on one hand the already known families of such groups are determined without using R. BAER's, 0.H.KEGEL's and M. SUZUKI' s classification of finite groups with partition and on the other hand some new results on the special structure of p - groups are proved. Furthermore, the existence of a series of nonabelian p - groups of odd order which can be represented as translation groups of certain (s,k,1) - translation transversal designs is shown; moreover, the translation groups are normal subgroups of collineation groups acting regularly on the set of flags of the same designs.

In this paper we continue the study of p - groups G of square order \(p^{2n}\) and investigate the existence of partial congruence partitions (sets of mutually disjoint subgroups of order \(p^n\)) in G. Partial congruence partitions are used to construct translation nets and partial difference sets, two objects studied extensively in finite geometries and combinatorics. We prove that the maximal number of mutually disjoint subgroups of order \(p^n\) in a group G of order \(p^{2n}\) cannot be more than \((p^{n-1}-1)(p-1)^{-1}\) provided that \(n\ge4\)and that G is not elementary abelian. This improves a result in [6] and as we do not distinguish the cases p=2 and p odd in the present paper, we also have a generalization of D. FROHARDT' s theorem on 2 - groups in [4]. Furthermore we study groups of order \(p^6\). We can show that for each odd prime number, there exist exactly four nonisomorphic groups which contain at least p+2 mutually disjoint subgroups of order \(p^3\). Again, as we do not distinguish between the even and the odd case in advance, we in particular obtain
D. GLUCK' s and A. P. SPRAGUE' s classification of groups of order 64 which contain at least 4 mutually disjoint subgroups of order 8 in [5] and [13] respectively.

The use of non-volatile semiconductor memory within an extended storage hierarchy promises significant performance improvements for transaction processing. Although page-addressable semiconductor memories like extended memory, solid-state disks and disk caches are commercially available since several years, no detailed investigation of their use for transaction processing has been performed so far. We present a comprehensive simulation study that compares the performance of these storage types and of different usage forms. The following usage forms are considered: allocation of entire log and database files in non-volatile semiconductor memory, using a so-called write buffer to perform disk writes asynchronously, and caching of database pages at intermediate storage levels (in addition to main memory caching). Our simulations are conducted with both synthetically generated workloads and traces from real-life database applications. In particular, simulation results will be presented for the debit-credit workload frequently used in transaction processing benchmarks. As expected, the greatest performance improvements (but at the highest cost) can be achieved by storing log and database files completely in non-volatile semiconductor memory. For update-intensive
workloads, a limited amount of non-volatile memory used as a write buffer also proved to be very effective. To reduce the number of disk reads; caching of database pages in addition to main memory is best supported by an extended memory buffer. In this respect, disk caches are found to be less effective as they are designed for one-level caching. Different storage costs suggest that it may be cost-effective to use two or even three of the intermediate storage types together. The performance improvements obtainable by the use of non-volatile semiconductor memory is also found to reduce the need for sophisticated DBMS buffer management in order to achieve high transaction processing performance.

Trimming of surfaces and volumes, curve and surface modeling via Bézier's idea of destortion, segmentation, reparametrization, geometric continuity are examples of applications of functional composition. This paper shows how to
compose polynomial and rational tensor product Bézier representations. The problem of composing Bezier splines and B-spline representations will also be addressed in this paper.

Limits of instantons
(1991)

The notion of Q-Gorenstein smoothings has been introduced by Kollar. ([KoJ], 6.2.3). This notion is essential for formulating Kollar's conjectures on smoothing components for rational surface singularities. He conjectures, loosely speaking, that every smoothing of a rational surface singularity can be obtained by blowing down a deformation of a partial resolution, this partial resolution having the property (among others) that the singularities occuring on it all have qG-smoothings. (For more details and precise statements see [Ko], ch. 6.). It is therefore of interest to construct singularities having qG-smoothings.

Moduli for singularities
(1991)

The aim of this article is to give a survey on recent results about moduli spaces for curve singularities and for modules over the local ring of a fixed curve singularity. We emphasize especially the general concept which lies behind these constructions.
Therefore, the article might be useful to the reader who wishes to have the leading ideas and the main steps of the proofs explained without going into all the details. We also calculate explicit examples (for singularities and for modules) which illustrate
the general theorems.

The conversion efficiency of laser energy into kinetic ion energy in a laser-produced plasma has been investigated for two quite different targets: graphite and tantalum. The laser energy (intensity) varied from several mJ to 200 mJ (1O^9 to 7 x 10^10 W cm-2) which is appropriate to many applications of a laser produced ion source. The conversion efficiency as a function of the laser energy was directly determined by differential measurements of the charge, kinetic energy and angular emission distribution of the plasma ions in absolute units. Whilst for the Ta target a nearly constant efficiency of about 30% was observed, the graphite result shows an unexpectedly strong enhancement of the transfer efficiency of up to 80% in the laser intensity range around 1.5 x l0^10 W cm-2. It is assumed that the results are related to the difference in the surface roughness of the targets.

The efficient numerical treatment of the Boltzmann equation is a very important task in many fields of application. Most of the practically relevant numerical schemes are based on the simulation of large particle systems that approximate the evolution of the distribution function described by the Boltzmann equation. In particular, stochastic particle systems play an important role in the construction of various numerical algorithms.

The paper presents a parallelization technique for the finite pointset method, a numerical method for rarefied gas flows.; First we give a short introduction to the Boltzmann equation, which describes the behaviour of rarefied gas flows. The basic ideas of the finite pointset method are presented and a strategy to parallelize the algorithm will be explained. It is shown that a static processor partition leads to an insufficient load-balance of the processors. Therefore an optimized parallelization technique based on an adaptive processor partition will be introduced, which improves the efficiency of the simulation code over the whole region of interesting flow situation. Finally we present a comparison of the CPU-times between a parallel computer and a vector computer.

Using particle methods to solve the Boltzmann equation for rarefied gases numerically, in realistic streaming problems, huge differences in the total number of particles per cell arise. In order to overcome the resulting numerical difficulties the application of a weighted particle concept is well-suited. The underlying idea is to use different particle masses in different cells depending on the macroscopic density of the gas. Discrepance estimates and numerical results are given.

The wave equation with a Preisach hysteresis operator can be considered as a one-dimensional projection of Maxwell" s equations in a ferromagnetic medium. An initial-boundary value problem for this equation is solved here with emphasizing the fact that under a bounded forcing term the solutions remain bounded. This is due to the strong dissipation of hysteresis energies. New proofs of hysteresis energy inequalities are given without referring to the structure of hysteresis memory.