Hysteresis and Eddy-current Relaxation in SiFe Materials

The rate-dependent effects in metallic ferromagnetic materials with magnetization processes attributed to domain-walls motion were studied. The experimental method for eddy-current relaxation time determination was proposed. Some discrepancies between the data and theoretical predictions were observed and discussed. The origin of these discrepancies is accounted for by the decrease of viscous-type relaxation process as the rate of change of averaged magnetization is approaching zero.     

On the vector field problem for O(n)/O(1)xO(1)xO(n-2)

We prove new results about the vector field problem on the real flag manifolds O(n)/O(1) x O(1) x O(n - 2). For some infinite families of these manifolds, we completely solve the vector field problem.     

Semi-implicit complementary volume scheme for solving level set like equations in image processing and curve evolution

Summary. We introduce linear semi-implicit complementary volume numerical scheme for solving level set like nonlinear degenerate diffusion equations arising in image processing and curve evolution problems. We study discretization of image selective smoothing equation of mean curvature flow type given by Alvarez, Lions and Morel ([3]). Solution of the level set equation of Osher and Sethian ([26], \[30]) is also included in the study. We prove and estimates for the proposed scheme and give existence of its (generalized) solution in every discrete time-scale step. Efficiency of the scheme is given by its linearity and stability. Preconditioned iterative solvers are used for computing arising linear systems. We present computational results related to image processing and plane curve evolution. Received April 25, 2000 / Revised version received June 11, 2001 / Published online November 15, 2001     

Confidence regions in a multivariate regression model with constraints II

The multivariate model, where not only parameters of the mean value of the observation matrix, but also some other parameters occur in constraints, is considered in the paper. Some basic inference is presented under the condition that the covariance matrix is either unknown, or partially unknown, or known. Supported by the grant of the Council of Czech Republic MSM 6 198 959 214.     

Compact coaxial driver for small-size Z-pinch

The presented one-capacitor pinch driver, designed as a compact coaxial structure (including spark-gap and discharge section) consistent with the capacitor output, generates a current of 200 kA with 700 ns quarter-period, suitable for studying the optimization of Z-pinch radiative characteristics. The driver is described, measurements of its parameters summarized, and relations to our previous and future activities briefly reviewed.This work was supported in part by the Grant Agency of the Czech Republic under contract No. 202/93/1023.     

1H and13C nuclear magnetic relaxation and local dynamics of lysozyme and synthetic polypeptides

The combined analysis of¹H and¹³C NMR relaxation data in solid lysozyme and some typical homopolypeptides was carried out by using “model-free” approach. Three types of relaxation transitions (γ’, γ and β) were revealed in the temperature range investigated. The microdynamical parameters of these motions were determined. From the comparison of these parameters with those of selected synthetic polymers it follows that the molecular motions in proteins and synthetic polymers are of the same nature. All these motions show pronounced anisotropic character. In the investigated temperature range no molecular motions corresponding to α-relaxation (liquid-like) transition were revealed. The hydration effects on parameters of the motions in proteins were considered. The most pronounced effect takes place for β-transition. The effect of Brownian rotation of protein molecule in solution on measured correlation function of local motions was also discussed.     

Projectivep-algebras

Presented by R. Freese.     

Algorithms for ham-sandwich cuts

Given disjoint setsP ₁,P ₂, ...,P _d inR ^d withn points in total, ahamsandwich cut is a hyperplane that simultaneously bisects theP _i . We present algorithms for finding ham-sandwich cuts in every dimensiond>1. Whend=2, the algorithm is optimal, having complexityO(n). For dimensiond>2, the bound on the running time is proportional to the worst-case time needed for constructing a level in an arrangement ofn hyperplanes in dimensiond−1. This, in turn, is related to the number ofk-sets inR ^d−1 . With the current estimates, we get complexity close toO(n ^3/2 ) ford=3, roughlyO(n ^8/3 ) ford=4, andO(n ^d−1−a(d) ) for somea(d)>0 (going to zero asd increases) for largerd. We also give a linear-time algorithm for ham-sandwich cuts inR ³ when the three sets are suitably separated. A preliminary version of the results of this paper appeared in [16] and [17]. Part of this research by J. Matoušek was done while he was visiting the School of Mathematics, Georgia Institute of Technology, Atlanta, and part of his work on this paper was supported by a Humboldt Research Fellowship. W. Steiger expresses gratitude to the NSF DIMACS Center at Rutgers, and his research was supported in part by NSF Grants CCR-8902522 and CCR-9111491.