We introduce landmark grammars , a new family of context-free aimed at describing the HTML source code pages published by large and templated websites therefore effectively tackling Web data extraction problems. Indeed, they address inherent ambiguity HTML, one main challenges extraction, which, despite over twenty years research, has been largely neglected approaches presented in literature. t...

Let be a connected graph with vertex set and edge . The bijective function is said to labeling of where the associated weight for If every has different weight, called an antimagic labeling. A path in vertex-labeled , two edges satisfies rainbow path. if vertices there exists Graph admits coloring, we assign each color smallest number colors induced from all weights connection denoted by In thi...

The smallest known three-dimensional closed orientable hyperbolic manifoldM 1 , which volume is equal to 0:94 : : :, was obtained independently by A. Fomenko and S. Matveev and by J. Weeks. It is known, that the isometry group of the manifold M 1 is isomorphic to the dihedral group ID 6 of order 12. We study the lattice of the action of the isometry group on the manifoldM 1 and obtain all orbif...

We carry out molecular Monte Carlo simulations of clusters in an imperfect vapor. We show that down to very small cluster sizes, classical nucleation theory built on the liquid drop model can be used very accurately to describe the work required to add a monomer to the cluster. However, the error made in modeling the smallest of clusters as liquid drops results in an erroneous absolute value fo...

We point out that local minimizing curves, or troughs, of the smallest finite-time Lyapunov exponent (FTLE) field computed over a time interval [t(0), t] and graphed over trajectory positions at time t mark attracting Lagrangian coherent structures (LCSs) at t. For two-dimensional area-preserving flows, we conclude that computing the largest forward-time FTLE field by itself is sufficient for l...