in this paper, we proposed a data-hiding scheme based on run length matrix. in a previously proposed method, a technique based on texture classification was introduced where four statically features extracted from run length matrix; then best cover images are selected based on these features. using appropriate features for comparing images from undetectability viewpoint, guarantees, less detect...

We present exact algorithms for the NP-complete Longest Common Subsequence problem for sequences with nested arc annotations, a problem occurring in structure comparison of RNA. Given two sequences of length at most n and nested arc structure, one of our algorithms determines (if existent) in O(3.31k1+k2 · n) time an arc-preserving subsequence of both sequences, which can be obtained by deletin...

Seven potential geometric cues for contour-curvature discrimination were tested: curvature, turning-angle, arc-length, arc-length-divided-by-chord-length, maximum-deviation (sag), mean-deviation and area. Three experiments were performed, each requiring the discrimination of two simultaneously presented, 1-sec-duration, curved-line stimuli, whose chord-lengths ranged from 12 to 48 arcmin visual...

We present a new parameterization of the trinucleon wavefunction. As a novel feature a separable parameterization for the complete wavefunction is given. In this way any calculation that considers two body forces only is largely simplified. To demonstrate this we calculate the π3He scattering length. PACS: 25.80.Ls, 25.80.Hp, 25.10.+s, 21.45.+v Typeset using REVTEX

We present new high resolution and high sensitivity multi-frequency VLA radio continuum observations of the G9.62+0.19-F hot molecular core. We detect for the first time faint centimetric radio continuum emission at the position of the core. The centimetric continuum spectrum of the source is consistent with thermal emission from ionised gas. This is the first direct evidence that a newly born ...

In this paper we study k-noncrossing RNA structures with minimum arc-length 4 and at most k − 1 mutually crossing bonds. Let T k (n) denote the number of knoncrossing RNA structures with arc-length ≥ 4 over n vertices. We prove (a) a functional equation for the generating function ∑ n≥0 T [4] k (n)z n and (b) derive for k ≤ 9 the asymptotic formula T k (n) ∼ ck n +(k−1)/2) γ k . Furthermore we ...

We propose a new camera-based biometric: visual signature identification. We discuss the importance of the parameterization of the signatures in order to achieve good classification results, independently of variations in the position of the camera with respect to the writing surface. We show that affine arc-length parameterization performs better than conventional time and Euclidean arc-length...

Part 1. Geometry of Curves We assume that we are given a parametric space curve of the form (1) x(u) =   x 1 (u) x 2 (u) x 3 (u)   u 0 ≤ u ≤ u 1 and that the following derivatives exist and are continuous (2) x (u) = dx du x (u) = d 2 x du 2 1. Arc Length The total arc length of the curve from its starting point x(u 0) to some point x(u) on the curve is defined to be (3) s(u) = u u 0 √ x ·x...

This paper is addressed to the so-called overflow problem commonly encountered in the computer simulation of nonlinear resistive circuits containing rapidly varying nonlinearities such as exponentials found in the models of diodes and transistors. A novel approach which makes use of the arc-lengths of the nonlinear characteristic curves as the variables of iteration is proposed. It is proved, u...