A beam emission spectroscopy (BES) system for density fluctuation measurements having the sight lines passing through the plasma in the toroidal direction was developed in the Large Helical Device (LHD). The coverage of the area sampled by 15 × 100 optical fibers is nearly from the core to the edge on the horizontally elongated poloidal cross section with the spatial pitch of around 1.0 cm, and...

2014 The stability of a screw dislocation in a SmA phase submitted to a dilative or compressive strain normal to the layers is investigated. It is shown that the screw line transforms to a helical line, whose handedness depends on the signs of the Burgers’ vector and of the strain. For small strains the process necessitates some activation energy; there is a critical strain above which it is sp...

This paper describes an algorithm for the detection of ellipses and lines in image edge data. Connected edge pixels are transformed into polygonal approximations by a two stage algorithm. Then a second two stage algorithm replaces combinations of lines by ellipses if the ellipse fit is better. For each algorithm a combination of splitting and merging of the data is used to enable global and loc...

Address correspondence to Lijie Ci, [email protected]; Pulickel M. Ajayan, [email protected] ABSTRACT Rapid progress in graphene-based applications is calling for new processing techniques for creating graphene components with different shapes, sizes, and edge structures. Here we report a controlled cutting process for graphene sheets, using nickel nanoparticles as a knife that cuts with nanos...

Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an  ...

The existing literature gives efficient algorithms for mapping trees or less restrictively outerplanar graphs on a given set of points in a plane, so that the edges are drawn planar and as straight lines. We relax the latter requirement and allow very few bends on each edge while considering general plane graphs. Our results show two algorithms for mapping four-connected plane graphs with at mo...

It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into open convex cells whose dual graph (defined below) is 2-edge connected. Intuitively, every edge of the dual graph corresponds to a pair of adjacent cells that are both incident to the same vertex. Aichholzer et al. rec...

We propose a biologically motivated computational step, called surround inhibition, which improves the performance of contour detectors. The mechanism of surround inhibition is exhibited by the majority of the orientation selective neurons in the primary visual cortex of macaque monkeys and has been demonstrated to influence the visual perception of man as well. We illustrate the principle and ...

The existing literature gives efficient algorithms for mapping trees or less restrictively outerplanar graphs on a given set of points in a plane, so that the edges are drawn planar and as straight lines. We relax the latter requirement and allow very few bends on each edge while considering general plane graphs. Our results show two algorithms for mapping four-connected plane graphs with at mo...

The problem of fitt,ing straight lines to a, number of data points arises frequently in image processing and comp~it~er vision. In this paper, we consider two approaches to solve the line detection problem in range images. The first is a simple 3D approach that finds the best line among a randomly selected subset of lines each through a pair of edge points. The second approach, based on tabu se...