Thin points for Brownian motion

Let Θ(x,r) denote the occupation measure of the ball of radius r centered at x for Brownian motion {W_t}_0≤t≤1 in . We prove that for any analytic set E in [0,1], we have

Full-size image

, where dim_P(E) is the packing dimension of E. We deduce that for any a≥1, the Hausdorff dimension of the set of “thin points” x for which

Full-size image

, is almost surely 2−2/a; this is the correct scaling to obtain a nondegenerate “multifractal spectrum” for the “thin” part of Brownian occupation measure. The methods of this paper differ considerably from those of our work on Brownian thick points, due to the high degree of correlation in the present case. To prove our results, we establish general criteria for determining which deterministic sets are hit by random fractals of ‘limsup type' in the presence of long-range correlations. The hitting criteria then yield lower bounds on Hausdorff dimension. This refines previous work of Khoshnevisan, Xiao and the second author, that required decay of correlations.     

Work allocation to stations with varying learning slopes and without buffers

In this paper, we address the problem of allocating the work elements, belonging to the products of a lot, to the stations of an assembly line so as to minimize the makespan. The lots that are processed on the assembly line are characterized by a low overall demand for each product. There is no buffer permitted in between the stations, and the line operates under learning. In particular, the stations’ learning slopes are assumed to be different. We present a procedure to determine the optimal assignments of the workload to the stations under learning variability and show that it considerably affects these assignments.     

On minimum power connectivity problems

Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its nodes. Motivated by applications for wireless networks, we present polynomial and improved approximation algorithms, as well as inapproximability results, for some classic network design problems under the power minimization criteria. Our main result is for the problem of finding a min-power subgraph that contains k internally-disjoint vs-paths from every node v to a given node s: we give a polynomial algorithm for directed graphs and a logarithmic approximation algorithm for undirected graphs. In contrast, we will show that the corresponding edge-connectivity problems are unlikely to admit even a polylogarithmic approximation.     

Excited-state intermolecular proton transfer of firefly luciferin III. Proton transfer to a mild base

Steady-state and time-resolved techniques were employed to study the excited-state proton transfer (ESPT) from d-luciferin, the natural substrate of the firefly luciferase, to the mild acetate base in aqueous solutions. We found that in 1 M aqueous solutions of acetate or higher, a proton transfer (PT) process to the acetate takes place within 30 ps in both H(2)O and D(2)O solutions. The time-resolved emission signal is composed of three components. We found that the short-time component decay time is 300 and 600 fs in H(2)O and D(2)O, respectively. This component is attributed either to a PT process via the shortest water bridged complex available, ROH··H(2)O··Ac(-), or to PT taking place within a contact ion pair. The second time component of 2000 and 3000 fs for H(2)O and D(2)O, respectively, is attributed to ROH* acetate complex, whose proton wire is longer by one water molecule. The decay rate of the third, long-time component is proportional to the acetate concentration. We attribute it to the diffusion-assisted reaction as well as to PT process to the solvent.     

Practical anodes for Li-ion batteries comprising metallurgical silicon particles and multiwall carbon nanotubes

Journal of Solid State Electrochemistry - Silicon is considered to be a very attractive anode material for next-generation lithium-ion batteries due to its high theoretical capacity...     

Alternating subgroups of Coxeter groups

We study combinatorial properties of the alternating subgroup of a Coxeter group, using a presentation of it due to Bourbaki.     

Random Cayley graphs and expanders

For every 1 > δ > 0 there exists a c = c(δ) > 0 such that for every group G of order n, and for a set S of c(δ) log n random elements in the group, the expected value of the second largest eigenvalue of the normalized adjacency matrix of the Cayley graph X(G, S) is at most (1 - δ). This implies that almost every such a graph is an ?(δ)-expander. For Abelian groups this is essentially tight, and explicit constructions can be given in some cases. © 1994 John Wiley & Sons, Inc.     

Crack growth resistance of shape memory alloys by means of a cohesive zone model

Crack growth resistance of shape memory alloys (SMAs) is dominated by the transformation zone in the vicinity of the crack tip. In this study, the transformation toughening behavior of a slowly propagating crack in an SMA under plane strain conditions and mode I deformation is numerically investigated. A small-scale transformation zone is assumed. A cohesive zone model is implemented to simulate crack growth within a finite element scheme. Resistance curves are obtained for a range of parameters that specify the cohesive traction-separation constitutive law. It is found that the choice of the cohesive strength t₀ has a great influence on the toughening behavior of the material. Moreover, the reversibility of the transformation can significantly reduce the toughening of the alloy. The shape of the initial transformation zone, as well as that of a growing crack is determined. The effect of the Young's moduli ratio of the martensite and austenite phases is examined.