Search

The practice of transmitting secret data by using cover data is called steganography. At present, several versatile steganographic methods are available using different digital objects (e.g. image,...

In this paper, an iterative implement of level set methodology has been proposed for the precise segmentation of normal and abnormal tissues in magnetic resonance imaging (MRI) brain images. In thi...

The present work aims to study the effect of 50 MeV Li+3 ion beam irradiation on the structural, morphological and magnetic properties of Zn0.96Mn0.04O samples. Zn0.96Mn0.04O samples were synthesized by solid-state reaction technique. The samples exhibit impurity phase and upon irradiation it disappears. Rietveld refinement analysis indicates that the substitutional incorporation of Mn in the host lattice increases with irradiation. Field-dependent magnetization (M–H) measurement explicitly indicates ferromagnetic nature of the samples at room temperature. The variation observed in temperature-dependent magnetization (M–T) measurement (500 Oe) indicates that ferromagnetism in the system seems to be mainly intrinsic, though superparamagnetic Mn nanoparticles also has a minor role. The analysis of M–T data at comparatively high field (5000 Oe) provides an estimation of antiferromagnetic exchange, which acts as a reducing agent for observed magnetic moment. The value of saturation magnetization has been incr...

A method is presented for the analysis of electrocardiogram (ECG) diagnosable diseases using syntactic pattern recognition techniques. The ECG analysis described here will determine right-bundle branch block, left-bundle branch block, left ventricular hypertrophy, left-anterior hemiblock, and left-atnal hypertrophy. The 'patient data matrix’, obtained through the already developed data acquisition, string generation program, string compression program, wave recognition programs, wave measurement programs, the axis analysis programs and the arrhythmia programs, is used to classify ECG diagnosable diseases of a standard patient ECG. The ECG analysis program together with the above-specified programs can be connected to standard three-channel ECG chart to provide immediate on-site ECG interpretation.

A method of pattern recognition is presented to test the unstructuredness of any arbitrary flowchart. The method involves the development of a context-free plex grammar from a fixed basis set of prime programs. This grammar is utilized to verify whether any arbitrary flowchart is structured or not with respect to a fixed basis set. A top-down parsing algorithm is also developed to recognize the input string corresponding to the flowchart. An illustrative example is also given.

In this paper a cellular array has been described where each cell contains a threshold gate. It has been shown that this array can be used to realize any Boolean function and that just two tests are sufficient, to test the entire array for faults. An extension of the principle of this array has been described. It deals with the design of an array where a faulty cascade, if there be any, is automatically by-passed and and identical fault-free cascade is introduced into the array.

We describe a heuristic algorithm to colour the vertices of a graph which relies upon the comparison of the degrees and structure of the graph. We have compared it with the maximum-degree-node-first and minimum-degree-node-last criteria based algorithms. The interchange of colours without bound normally amounts to an exhaustive search and hence is not taken into account. Additionally, this paper reviews a broad spectrum of sequential vertex colouring algorithms based on heuristics.

This paper considers the applicability of a special type of graph, the boolean graph, for the state assignment problem of asynchronous sequential machines. It also utilizes the properties of a layer representation of a boolean graph for developing a method for deriving a connected row set assignment of an asynchronous sequential machine. This method provides, for quite a large number of flow tables, an assignment with minimal memory requirements or requiring one or two additional state variables.