Broader Societal Issues of Nanotechnology

Nanoscale science and engineering are providing unprecedented understanding and control over the basic building blocks of matter, leading to increased coherence in knowledge, technology, and education. The main reason for developing nanotechnology is to advance broad societal goals such as improved comprehension of nature, increased productivity, better healthcare, and extending the limits of sustainable development and of human potential. This paper outlines societal implication activities in nanotechnology R&D programs. The US National Nanotechnology Initiative annual investment in research with educational and societal implications is estimated at about $30 million (of which National Science Foundation (NSF) awards about $23 million including contributions to student fellowships), and in nanoscale research with relevance to environment at about $50 million (of which NSF awards about $30 million and EPA about $6 million). An appeal is made to researchers and funding organizations worldwide to take timely and responsible advantage of the new technology for economic and sustainable development, to initiate societal implications studies from the beginning of the nanotechnology programs, and to communicate effectively the goals and potential risks with research users and the public.     

Numerical determination of the density profile of an inhomogeneous membrane: solution of the inverse vibration problem

Given one or more vibrational modes of a membrane, the free vibration equation can be applied to infer the mass surface density. This paper considers determining the surface density of an inhomogeneous membrane from digitized holographic projections (interferograms) of the modeshapes. Spatially discrete numerical models of the membrane surface are presented, which can be used to solve both forward and inverse vibration problems. The accuracy of the discrete models is examined for exactly solvable free vibration problems involving inhomogeneous membranes. For the solution of the inverse problem, error estimates are given for the mass surface density deduced from modeshape interferograms. The practicability of the method is investigated using simulated experimental data for membranes with composite and continuously inhomogeneous density profiles. Strategies are discussed for reducing errors in the reconstructed densities.     

Crack path instabilities in DCDC experiments in the low speed regime

We studied the low speed fracture regime (10⁻⁴-10⁻⁹ m s⁻¹) in different glassy materials (soda-lime glass, glass ceramics) with variable but controlled length scale of heterogeneity. The chosen mechanical system enabled us to work in pure mode I (tensile) and at a fixed load on double cleavage drilled compression specimen. The internal residual stresses of studied samples were carefully relaxed by appropriate thermal treatment. By means of optical and atomic force microscopy techniques fracture surfaces have been examined. We have shown for the first time that the crack front line underwent an out-of-plane oscillating behavior as a result of a reproducible sequence of instabilities. The wavelength of such a phenomenon is in the micrometer range and its amplitude in the nanometer range. These features were observed for different glassy materials providing that a typical length scale characterizing internal heterogeneities was lower than a threshold limit estimated to few nanometers. This effect is the first clear experimental evidence of crack path instabilities in the low speed regime in a uniaxial loading experiment. This phenomenon has been interpreted by referring to the stability criterion for a straight crack propagation as presented by Adda-Bedia et al. [Phys. Rev. Lett. 76 (1996) 1497].     

Minimal, rigid foliations by curves on ℂℙ n

We prove the existence of minimal and rigid singular holomorphic foliations by curves on the projective space ℂℙ ⁿ for every dimension n≥2 and every degree d≥2. Precisely, we construct a foliation ℱ which is induced by a homogeneous vector field of degree d, has a finite singular set and all the regular leaves are dense in the whole of ℂℙ ⁿ . Moreover, ℱ satisfies many additional properties expected from chaotic dynamics and is rigid in the following sense: if ℱ is conjugate to another holomorphic foliation by a homeomorphism sufficiently close to the identity, then these foliations are also conjugate by a projective transformation. Finally, all these properties are persistent for small perturbations of ℱ.?This is done by considering pseudo-groups generated on the unit ball 𝔹 ⁿ ⊆ℂ ⁿ by small perturbations of elements in Diff(ℂ ⁿ ,0). Under open conditions on the generators, we prove the existence of many pseudo-flows in their closure (for the C ⁰-topology) acting transitively on the ball. Dynamical features as minimality, ergodicity, positive entropy and rigidity may easily be derived from this approach. Finally, some of these pseudo-groups are realized in the transverse dynamics of polynomial vector fields in ℂℙ ⁿ . Received March 7, 2002 / final version received November 26, 2002?Published online February 7, 2003 Most of this work has been carried out during a visit of the first author to IMPA/RJ and a visit of the second author to the University of Lille 1. We would like to thank these institutes for hospitality and express our gratitude to CNPq-Brazil and CNRS-France for the financial support which made these visits possible. We are also indebted to Paulo Sad, Marcel Nicolau and the referee whose comments helped us to improve on the preliminary version. Finally, the second author has partially conducted this research for the Clay Mathematics Institute.     

Asymptotic properties of computationally efficient alternative estimators for a class of multivariate normal models

Parameters of Gaussian multivariate models are often estimated using the maximum likelihood approach. In spite of its merits, this methodology is not practical when the sample size is very large, as, for example, in the case of massive georeferenced data sets. In this paper, we study the asymptotic properties of the estimators that minimize three alternatives to the likelihood function, designed to increase the computational efficiency. This is achieved by applying the information sandwich technique to expansions of the pseudo-likelihood functions as quadratic forms of independent normal random variables. Theoretical calculations are given for a first-order autoregressive time series and then extended to a two-dimensional autoregressive process on a lattice. We compare the efficiency of the three estimators to that of the maximum likelihood estimator as well as among themselves, using numerical calculations of the theoretical results and simulations.     

Stress monitoring in a Guinness 10-day scuba dive

Nowadays, there is high demand for sensitive gas sensors both for human and environmental monitoring. This paper deals with a high-resolution (0.2 ppb) laser-based photoacoustic spectroscopic system realized at ENEA Frascati, Italy, applied for monitoring stress in scuba divers during sustained immersion by analyzing breath samples. Blood tests and psychometric tests for scuba divers were performed at Catholic University in Rome. Results will be reported and discussed.     

Asymptotic conditions for the electromagnetic form factors of hadrons represented by the VMD model

A system of linear homogeneous algebraic equations for the coupling constant ratios of vector mesons to hadrons is derived by imposing the assumed asymptotic behavior upon the VMD pole parameterization of an hadron electromagnetic form factor. A similar system of equations with a simpler structure of the coefficients, taken as even powers of the vector-meson masses, is derived by means of integral superconvergent sum rules for the imaginary part of the considered form factor using its appropriate -function approximation. Although both systems have been derived starting from different properties of the electromagnetic form factor and they each have their own appearances, it is shown explicitly that they are fully equivalent. Received: 20 March 2002 / Revised version: 3 December 2002 / Published online: 7 March 2003     

A column generation approach for the timetabling problem of Greek high schools

A column generation (CG) approach for the solution of timetabling problems is presented. This methodology could be used for various instances of the timetabling problem, although in this paper the solution of the high-school situation in Greece is presented. The results obtained show clearly that the CG approach that has been extremely successful in recent years in the solution of airline crew scheduling problems could also be very efficient and robust for the solution of timetabling problems. Several large timetabling problems corresponding to real problems have been successfully solved, with the solutions obtained feasible and of very high quality in accordance with the problem definition. In addition, none of the solutions contained any idle hour for any of the teachers, which was one of the main goals of this optimization effort.     

20-relative neighborhood graphs are hamiltonian

For any two points p and q in the Euclidean plane, define LUN_pq = { v | v ∈ R², d_pv < d_pq and d_qv < d_pq}, where d_uv is the Euclidean distance between two points u and v . Given a set of points V in the plane, let LUN_pq(V) = V ∩ LUN_pq. Toussaint defined the relative neighborhood graph of V, denoted by RNG(V) or simply RNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of RNG(V) if and only if LUN_pq (V) = ?. The relative neighborhood graph has several applications in pattern recognition that have been studied by Toussaint. We shall generalize the idea of RNG to define the k-relative neighborhood graph of V, denoted by kRNG(V) or simply kRNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of kRNG(V) if and only if | LUN_pq(V) | < k, for some fixed positive number k. It can be shown that the number of edges of a kRNG is less than O(kn). Also, a kRNG can be constructed in O(kn₂) time. Let E_c = {e_pq| p ∈ V and q ∈ V}. Then G_c = (V,E_c) is a complete graph. For any subset F of E_c, define the maximum distance of F as max_epq∈Fd_pq. A Euclidean bottleneck Hamiltonian cycle is a Hamiltonian cycle in graph G_c whose maximum distance is the minimum among all Hamiltonian cycles in graph G_c. We shall prove that there exists a Euclidean bottleneck Hamiltonian cycle which is a subgraph of 20RNG(V). Hence, 20RNGs are Hamiltonian.