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.     

Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs

A two-dimensional framework (G,p) is a graph G = (V,E) together with a map p: V → ℝ². We view (G,p) as a straight line realization of G in ℝ². Two realizations of G are equivalent if the corresponding edges in the two frameworks have the same length. A pair of vertices {u,v} is globally linked in G if %and for all equivalent frameworks (G,q), the distance between the points corresponding to u and v is the same in all pairs of equivalent generic realizations of G. The graph G is globally rigid if all of its pairs of vertices are globally linked. We extend the characterization of globally rigid graphs given by the first two authors [13] by characterizing globally linked pairs in M-connected graphs, an important family of rigid graphs. As a byproduct we simplify the proof of a result of Connelly [6] which is a key step in the characterization of globally rigid graphs. We also determine the number of distinct realizations of an M-connected graph, each of which is equivalent to a given generic realization. Bounds on this number for minimally rigid graphs were obtained by Borcea and Streinu in [3].     

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.     

Directed and elliptic flow in 197Au+197Au at intermediate energies

Directed and elliptic flow for the ¹⁹⁷Au+¹⁹⁷Au system at incident energies between 40 and 150 MeV per nucleon has been measured using the INDRA 4π multi-detector. For semi-central collisions, the excitation function of elliptic flow shows a transition from in-plane to out-of-plane emission at around 100 MeV per nucleon. The directed flow changes sign at a bombarding energy between 50 and 60 MeV per nucleon and remains negative at lower energies. Molecular dynamics calculations (CHIMERA) indicate sensitivity of the global squeeze-out transition on the σ _NN and demonstrate the importance of angular momentum conservation in transport codes at low energies.     

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.     

Some results on quasipolyhedral convexity

The objective of this paper is to analyze under what well-known operations the class of quasipolyhedral convex functions, which can be regarded as an extension of that of polyhedral convex functions, is closed. The operations that will be considered are those that preserve polyhedral convexity, such that the image and the inverse image under linear transformations, right scalar multiplication (including the case where λ=0⁺) and pointwise addition.      

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.