There is no question that data hiding has increasingly drawn extensive attention recently. This report presents a data hiding technique based on the modification of image histogram. It is fully reversible, that means, the original cover image can be recovered from the marked image, after the hidden data has been extracted. In this work, a data hiding scheme using reversibly designed difference-...

We show that a recently introduced Lax pair of the Sawada-Kotera equation is nota new one but is trivially related to the known old Lax pair. Using the so-called trivialcompositions of the old Lax pairs with a differentially constrained arbitrary operators,we give some examples of trivial Lax pairs of KdV and Sawada-Kotera equations.

A new set of software development methodologies has become prevalent in previous years, commonly known as Agile techniques. Pair programming (an activity from agile techniques)where two programmers work on the same module at one computer; with one programmer takes responsibilities of writing the actual code and the other one takes the responsibility for the monitoring of strategies, designing a...

T This paper reports the mixing performance of an AC electroosmotic micromixer based on the three-dimensional extensional flow generated by a face-to-face, asymmetric pair of planar electrodes. This work represents the first successful use of such an asymmetric electrode pair in an AC electroosmotic micromixer. Due to the highly 3dimentional flow pattern generated by the face-to-face electrode ...

from the early 1950s, estimating the autocorrelations of polynomials with coefficients on the unit circle has found applications in ising spin systems and in surface acoustic wave designs. in this paper, a technique is introduced that not only estimates the autocorrelations, but for some special types of such polynomials, it locates the frequencies at which maximum autocorrelation occurs.

this paper is concerned with the best proximity pair problem in hilbert spaces. given two subsets $a$ and $b$ of a hilbert space $h$ and the set-valued maps $f:a o 2^ b$ and $g:a_0 o 2^{a_0}$, where $a_0={xin a: |x-y|=d(a,b)~~~mbox{for some}~~~ yin b}$, best proximity pair theorems provide sufficient conditions that ensure the existence of an $x_0in a$ such that $$d(g(x_0),f(x_0))=d(a,b).$$

‎let $g$ be a finite $p$-group and $n$ be a normal subgroup of $g$ with‎ ‎$|n|=p^n$ and $|g/n|=p^m$‎. ‎a result of ellis (1998) shows‎ ‎that the order of the schur multiplier of such a pair $(g,n)$ of finite $p$-groups is bounded‎ ‎by $ p^{frac{1}{2}n(2m+n-1)}$ and hence it is equal to $‎ ‎p^{frac{1}{2}n(2m+n-1)-t}$ for some non-negative integer $t$‎. ‎recently‎, ‎the authors have characterized...

SHUKLA, ANUJA. Pair programming and the factors affecting Brooks’ Law. (Under the direction of Dr. Laurie Ann Williams). Frederick Brooks states in his book The Mythical Man-Month, “Adding manpower to a late software project makes it later.” Brooks explains that often software development managers react to schedule problems by adding more manpower to the project. However, the new team members t...

A conjugate code pair is defined as a pair of linear codes either of which contains the dual of the other. A conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum error-correcting code. It is known that conjugate code pairs are applicable to quantum cryptography. In this work, a polynomial construction of conjugate code pairs is present...

A dense stereo reconstruction technique for extracting a 3D model of a rock scene from a pair of images is presented. The technique falls under the conventional approach of extracting 3D information from a calibrated stereo pair. In this work, a single camera that is under going linear motion with respect to the scene is used. As far as correspondence analysis is concerned, a simple method for ...