On-line arbitrarily vertex decomposable trees

A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here.     

THE DESIGNS OF HIGH EFFICIENCY LAUNCHER OF QUASI-OPTICAL MODE CONVERTER FOR HIGH POWER GYROTRONS

A high efficiency launcher of quasi-optical (QO) mode converters for high power gyrotrons have been designed and tested. A helical cut launcher radiates the RF power via its straight cut onto the first phase correcting mirror. The launchers have been optimized for the TE_31.8 mode at 170 GHz and TE_22.6 mode at 110 GHz by numerically optimizing a launcher surface. The helical cut of the launcher has been optimized by taking the taper angle into account. Further more, the amplitude of the surface perturbation have been optimized for improved focusing in order to reduce the diffraction losses at the helical cut. Low power measurement shows a good agreement with the design. High efficiency characteristics of the design have also been calculated on the assumption of frequency downshift due to the thermal expansion of the cavity and stepwise frequency tuning by changing the operating mode. Besides, the possibility of high efficiency launcher for higher mode is discussed, and these results give the prospect to high efficiency long pulse gyrotrons.     

Reconstruction of the Point-Spread Function of the Human Eye Using a New Phase-Retrieval Algorithm

The double-pass method is thought to obtain the point spread function (PSF) in human eyes based on two techniques: the symmetric double-pass method using the same pupil size and the asymmetric double-pass method using a different pupil size. The symmetric double-pass method provides autocorrelation of the retinal PSF and, thus, the modulation transfer function. The asymmetric double-pass method provides low-frequency partial-phase information and the partial phase-retrieval algorithm is applied to obtain the complete-phase information, and to estimate the PSF. The partial phase-retrieval algorithm is based on the iteration method proposed by Fineup and Kowalczyk and requires a lengthy computation. In this study, we propose a new high-speed phase-retrieval algorithm based on the property that the real and imaginary parts of optical transfer functions (OTFs) continuously change in value.     

Formation of functional groups on graphite during oxygen plasma treatment

Improved sample wettability was obtained by oxygen plasma functionalization of pyrolytic graphite. The samples were exposed to highly dissociated oxygen plasma with the density of 1 × 10¹⁶ m⁻³, the electron temperature of about 5.5 eV and the density of neutral oxygen atoms of 8 × 10²¹ m⁻³ for 20 s. The surface wettability was measured by a contact angle of water drop. The contact angle dropped from original 112° down to about 1°. The functional groups were detected by XPS analyses. The survey spectrum showed a substantial increase of oxygen concentration on the surface, while high-resolution analyses showed additional oxygen was bonded onto the graphite surface in the form of C-O polar functional group responsible for the increase of the surface energy.     

Students’ Reasoning About One-Object Stochastic Phenomena in an ICT-Environment

This paper focuses on the different ways in which students in lower secondary school (14–16 year olds) experience compound random events, presented to them in the form of combined junctions. A carefully designed ICT environment was developed enabling the students to interact with different representations of such structures. Data for the analysis was gathered from two interview sessions. The analysis of the interaction is based on constructivist principles on learning; i.e. we adopted a student-oriented perspective, taking into consideration the different ways students try to make sense of chance encounters. Our results show how some students give priority to geometrical and physical concerns, and we discuss how seeking causal explanations of random phenomena may have encouraged this. With respect to numerically oriented models a division strategy appears to stand out as the preferred one.     

The monomial ideal of a finite meet-semilattice

Squarefree monomial ideals arising from finite meet-semilattices and their free resolutions are studied. For the squarefree monomial ideals corresponding to poset ideals in a distributive lattice, the Alexander dual is computed.

     

On the genericity of chaos

Let M be a compact manifold with dimM?2. We prove that some iteration of the generic homeomorphism on M is semiconjugated to the shift map and has infinite topological entropy (Theorem 1.1).     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.     

Nonvanishing cohomology and classes of Gorenstein rings

We give counterexamples to the following conjecture of Auslander: given a finitely generated module M over an Artin algebra Λ, there exists a positive integer n_M such that for all finitely generated Λ-modules N, if Ext_Λⁱ(M,N)=0 for all i?0, then Ext_Λⁱ(M,N)=0 for all i?n_M. Some of our examples moreover yield homologically defined classes of commutative local rings strictly between the class of local complete intersections and the class of local Gorenstein rings.