Cornelis Zwaan, 1928-1999

Cornelis (\Kees") Zwaan was a well-known solar physicist at Utrecht University in The Netherlands. To- gether with his graduate students he also ventured out to other cool stars, concentrating on their magnetic activity. He has been a member of the AAS and the Solar Physics Division and had close ties with many American astro- physicists. He died from cancer in his house at Doorn, The Netherlands on June 16, 1999. He had had major surgery in 1998, but recovered so fast that we and his other friends expected to have him with us much longer. The end came far too soon

Min-Max Theorems for Packing and Covering Odd (u,v)(u,v)-trails

We investigate the problem of packing and covering odd $(u,v)$-trails in a graph. A $(u,v)$-trail is a $(u,v)$-walk that is allowed to have repeated vertices but no repeated edges. We call a trail odd if the number of edges in the trail is odd. Let $\nu(u,v)$ denote the maximum number of edge-disjoint odd $(u,v)$-trails, and $\tau(u,v)$ denote the minimum size of an edge-set that intersects every odd $(u,v)$-trail. We prove that $\tau(u,v)\leq 2\nu(u,v)+1$. Our result is tight---there are examples showing that $\tau(u,v)=2\nu(u,v)+1$---and substantially improves upon the bound of $8$ obtained in [Churchley et al 2016] for $\tau(u,v)/\nu(u,v)$. Our proof also yields a polynomial-time algorithm for finding a cover and a collection of trails satisfying the above bounds. Our proof is simple and has two main ingredients. We show that (loosely speaking) the problem can be reduced to the problem of packing and covering odd $(uv,uv)$-trails losing a factor of 2 (either in the number of trails found, or the size of the cover). Complementing this, we show that the odd-$(uv,uv)$-trail packing and covering problems can be tackled by exploiting a powerful min-max result of [Chudnovsky et al 2006] for packing vertex-disjoint nonzero $A$-paths in group-labeled graphs

Basal Chromospheric Flux and Maunder Minimum-type Stars: The quiet-Sun Chromosphere as a Universal Phenomenon

Aims: We demonstrate the universal character of the quiet-Sun chromosphere among inactive stars (solar-type and giants). By assessing the main physical processes, we shed new light on some common observational phenomena. Methods: We discuss measurements of the solar Mt. Wilson S-index, obtained by the Hamburg Robotic Telescope around the extreme minimum year 2009, and compare the established chromospheric basal Ca II K line flux to the Mt. Wilson S-index data of inactive ("flat activity") stars, including giants. Results: During the unusually deep and extended activity minimum of 2009, the Sun reached S-index values considerably lower than in any of its previously observed minima. In several brief periods, the Sun coincided exactly with the S-indices of inactive ("flat", presumed Maunder Minimum-type) solar analogues of the Mt. Wilson sample; at the same time, the solar visible surface was also free of any plages or remaining weak activity regions. The corresponding minimum Ca II K flux of the quiet Sun and of the presumed Maunder Minimum-type stars in the Mt. Wilson sample are found to be identical to the corresponding Ca II K chromospheric basal flux limit. Conclusions: We conclude that the quiet-Sun chromosphere is a universal phenomenon among inactive stars. Its mixed-polarity magnetic field, generated by a local, "fast" turbulent dynamo finally provides a natural explanation for the minimal soft X-ray emission observed for inactive stars. Given such a local dynamo also works for giant chromospheres, albeit on larger length scales, i.e., l ~ R/g, with R and g as stellar radius and surface gravity, respectively, the existence of giant spicular phenomena and the guidance of mechanical energy toward the acceleration zone of cool stellar winds along flux-tubes have now become traceable.Comment: 6 pages, 4 figures; Astronomy & Astrophysics (Research Note), in pres

Surveillance and outbreak reports Outbreak of Shigella sonnei infections in the Orthodox Jewish community of Antwerp, Belgium, April to

aspx?ArticleId=1983

Parameters of the Magnetic Flux inside Coronal Holes

Parameters of magnetic flux distribution inside low-latitude coronal holes (CHs) were analyzed. A statistical study of 44 CHs based on Solar and Heliospheric Observatory (SOHO)/MDI full disk magnetograms and SOHO/EIT 284\AA images showed that the density of the net magnetic flux, $B_{{\rm net}}$, does not correlate with the associated solar wind speeds, $V_x$. Both the area and net flux of CHs correlate with the solar wind speed and the corresponding spatial Pearson correlation coefficients are 0.75 and 0.71, respectively. A possible explanation for the low correlation between $B_{{\rm net}}$ and $V_x$ is proposed. The observed non-correlation might be rooted in the structural complexity of the magnetic field. As a measure of complexity of the magnetic field, the filling factor, $f(r)$, was calculated as a function of spatial scales. In CHs, $f(r)$ was found to be nearly constant at scales above 2 Mm, which indicates a monofractal structural organization and smooth temporal evolution. The magnitude of the filling factor is 0.04 from the Hinode SOT/SP data and 0.07 from the MDI/HR data. The Hinode data show that at scales smaller than 2 Mm, the filling factor decreases rapidly, which means a mutlifractal structure and highly intermittent, burst-like energy release regime. The absence of necessary complexity in CH magnetic fields at scales above 2 Mm seems to be the most plausible reason why the net magnetic flux density does not seem to be related to the solar wind speed: the energy release dynamics, needed for solar wind acceleration, appears to occur at small scales below 1 Mm.Comment: 6 figures, approximately 23 pages. Accepted in Solar Physic

Automobile Insurance Fraud Detection Using Data Mining: A Systematic Literature Review

Insurance is a pivotal element in modern society, but insurers face a persistent challenge from fraudulent behaviour performed by policyholders. This behaviour could be detrimental to both insurance companies and their honest customers, but the intricate nature of insurance fraud severely complicates its efficient, automated detection. This study surveys fifty recent publications on automobile insurance fraud detection, published between January 2019 and March 2023, and presents both the most commonly used data sets and methods for resampling and detection, as well as interesting, novel approaches. The study adopts the highly-cited Systematic Literature Review (SLR) methodology for software engineering research proposed by Kitchenham and Charters and collected studies from four online databases. The findings indicate limited public availability of automobile insurance fraud data sets. In terms of detection methods, the prevailing approach involves supervised machine learning methods that utilise structured, intrinsic features of claims or policies and that lack consideration of an example-dependent cost of misclassification. However, alternative techniques are also explored, including the use of graph-based methods, unstructured textual data, and cost-sensitive classifiers. The most common resampling approach was found to be oversampling. This SLR has identified commonly used methods in recent automobile insurance fraud detection research, and interesting directions for future research. It adds value over a related review by also including studies published from 2021 onward, and by detailing the used methodology. Limitations of this SLR include its restriction to a small number of considered publication years and limited validation of choices made during the process

Nonlinear force-free modelling: influence of inaccuracies in the measured magnetic vector

Context: Solar magnetic fields are regularly extrapolated into the corona starting from photospheric magnetic measurements that can suffer from significant uncertainties. Aims: Here we study how inaccuracies introduced into the maps of the photospheric magnetic vector from the inversion of ideal and noisy Stokes parameters influence the extrapolation of nonlinear force-free magnetic fields. Methods: We compute nonlinear force-free magnetic fields based on simulated vector magnetograms, which have been produced by the inversion of Stokes profiles, computed froma 3-D radiation MHD simulation snapshot. These extrapolations are compared with extrapolations starting directly from the field in the MHD simulations, which is our reference. We investigate how line formation and instrumental effects such as noise, limited spatial resolution and the effect of employing a filter instrument influence the resulting magnetic field structure. The comparison is done qualitatively by visual inspection of the magnetic field distribution and quantitatively by different metrics. Results: The reconstructed field is most accurate if ideal Stokes data are inverted and becomes less accurate if instrumental effects and noise are included. The results demonstrate that the non-linear force-free field extrapolation method tested here is relatively insensitive to the effects of noise in measured polarization spectra at levels consistent with present-day instruments. Conclusions heading: Our results show that we can reconstruct the coronal magnetic field as a nonlinear force-free field from realistic photospheric measurements with an accuracy of a few percent, at least in the absence of sunspots.Comment: A&A, accepted, 9 Pages, 4 Figure

Locating Depots for Capacitated Vehicle Routing

We study a location-routing problem in the context of capacitated vehicle routing. The input is a set of demand locations in a metric space and a fleet of k vehicles each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for this problem. To achieve this result, we reduce to the k-median-forest problem, which generalizes both k-median and minimum spanning tree, and which might be of independent interest. We give a (3+c)-approximation algorithm for k-median-forest, which leads to a (12+c)-approximation algorithm for the above location-routing problem, for any constant c>0. The algorithm for k-median-forest is just t-swap local search, and we prove that it has locality gap 3+2/t; this generalizes the corresponding result known for k-median. Finally we consider the "non-uniform" k-median-forest problem which has different cost functions for the MST and k-median parts. We show that the locality gap for this problem is unbounded even under multi-swaps, which contrasts with the uniform case. Nevertheless, we obtain a constant-factor approximation algorithm, using an LP based approach.Comment: 12 pages, 1 figur