RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.     

Lower bounds for weak Byzantine agreement

Lower bounds for Byzantine agreement obtained by Dolev and Strong are shown, by a simpler method, also to be true for weak Byzantine agreement.This work was done while the author was studying at University of California, Santa Barbara, in 1984.     

The Matsumoto-Yor property and the structure of the Wishart distribution

This paper establishes a link between a generalized matrix Matsumoto-Yor (MY) property and the Wishart distribution. This link highlights certain conditional independence properties within blocks of the Wishart and leads to a new characterization of the Wishart distribution similar to the one recently obtained by Geiger and Heckerman but involving independences for only three pairs of block partitionings of the random matrix.In the process, we obtain two other main results. The first one is an extension of the MY independence property to random matrices of different dimensions. The second result is its converse. It extends previous characterizations of the matrix generalized inverse Gaussian and Wishart seen as a couple of distributions.We present two proofs for the generalized MY property. The first proof relies on a new version of Herz's identity for Bessel functions of matrix arguments. The second proof uses a representation of the MY property through the structure of the Wishart.     

Periodic solutions of second-order differential inclusions systems with p-Laplacian

Some existence results are obtained for periodic solutions of nonautonomous second-order differential inclusions systems with p-Laplacian.     

Experimental identification of physical parameters of fluid-filled pipes using acoustical signal processing

A method is formulated for the identification of an unknown physical parameter of a fluid-filled pipe using the measurement of sound speed in the pipe. The method uses a simple formula which provides the relationship between the sound speed and a few physical parameters of the pipe: thickness, diameter, wall material constants and fluid constants. Once the sound speed in the pipe is measured, the simple formula can be used to extract one of the unknown parameters providing the remaining ones are known.The sound speed in the pipe is measured using a 3-transducer array. In order to demonstrate the potential of the technique the results of several measurements obtained in a water-filled steel pipe are presented.The required accuracy of the measurement of sound speed and of the specification of known parameters is analysed. The accuracy depends on the unknown parameter which is to be identified. For example, if the pipe thickness is the unknown parameter, the other parameters have to be known within a very narrow margin of error. On the contrary, if the fluid properties have to be identified the needed accuracy of known parameters gets much lower.     

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.     

Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks

The connected dominating set plays an important role in ad hoc wireless networking. Many constructions for approximating the minimum connected dominating set have been proposed in the literature. In this paper, we propose a new one with Steiner tree, which produces approximation solution within a factor of 6.8 from optimal. This approximation algorithm can also be implemented distributedly.     

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.