From the UV to the static-field limit: rates and scaling laws of intense-field ionization of helium

We present high-accuracy calculations of ionization rates of helium at UV (195 nm) wavelengths. The data are obtained from full-dimensionality integrations of the helium-laser time-dependent Schrödinger equation. Comparison is made with our previously obtained data at 390 nm and 780 nm. We show that scaling laws introduced by Parker et al extend unmodified from the near-infrared limit into the UV limit. Static-field ionization rates of helium are also obtained, again from time-dependent full-dimensionality integrations of the helium Schrödinger equation. We compare the static-field ionization results with those of Scrinzi et al and Themelis et al, who also treat the full-dimensional helium atom, but with time-independent methods. Good agreement is obtained.

A similarity measure for graphs with low computational complexity

We present and analyze an algorithm to measure the structural similarity of generalized trees, a new graph class which includes rooted trees. For this, we represent structural properties of graphs as strings and define the similarity of two Graphs as optimal alignments of the corresponding property stings. We prove that the obtained graph similarity measures are so called Backward similarity measures. From this we find that the time complexity of our algorithm is polynomial and, hence, significantly better than the time complexity of classical graph similarity methods based on isomorphic relations. (c) 2006 Elsevier Inc. All rights reserved.

Structural similarity of directed universal hierarchical graphs: A low computational complexity approach

In the present paper we mainly introduce an efficient approach to measure the structural similarity of so called directed universal hierarchical graphs. We want to underline that directed universal hierarchical graphs can be obtained from generalized trees which are already introduced. In order to classify these graphs, we state our novel graph similarity method. As a main result we notice that our novel algorithm has low computational complexity. (c) 2007 Elsevier Inc. All rights reserved.

Universality and self-similarity of an energy-constrained sandpile model with random neighbors

We study an energy-constrained sandpile model with random neighbors. The critical behavior of the model is in the same universality class as the mean-field self-organized criticality sandpile. The critical energy E-c depends on the number of neighbors n for each site, but the various exponents are independent of n. A self-similar structure with n-1 major peaks is developed for the energy distribution p(E) when the system approaches its stationary state. The avalanche dynamics contributes to the major peaks appearing at E-Pk = 2k/(2n - 1) with k = 1,2,...,n-1, while the fine self-similar structure is a natural result of the way the system is disturbed. [S1063-651X(99)10307-6].

Extracting Query Interfaces Based on Form Structures and Semantic Similarity

Web databases are now pervasive. Such a database can be accessed via its query interface (usually HTML query form) only. Extracting Web query interfaces is a critical step in data integration across multiple Web databases, which creates a formal representation of a query form by extracting a set of query conditions in it. This paper presents a novel approach to extracting Web query interfaces. In this approach, a generic set of query condition rules are created to define query conditions that are semantically equivalent to SQL search conditions. Query condition rules represent the semantic roles that labels and form elements play in query conditions, and how they are hierarchically grouped into constructs of query conditions. To group labels and form elements in a query form, we explore both their structural proximity in the hierarchy of structures in the query form, which is captured by a tree of nested tags in the HTML codes of the form, and their semantic similarity, which is captured by various short texts used in labels, form elements and their properties. We have implemented the proposed approach and our experimental results show that the approach is highly effective.