Abstract:
In this paper, an integrated model based on Finite Element Method (FEM) and Geographical Information Systems (GIS) has been presented for the runoff simulation of small watersheds. Interception is estimated by an exponential model based on Leaf Area Index (LAI). Philip two term model has been used for the estima-tion of infiltration in the watershed. For runoff estimation, diffusion wave equations solved by FEM are used. Interflow has been simulated using FEM based model. The developed integrated model has been applied to Peacheater Creek watershed in USA. Sensitivity analysis of the model has been carried out for various pa-rameters. From the results, it is seen that the model is able to simulate the hydrographs with reasonable ac-curacy. The presented model is useful for runoff estimation in small watersheds.

Abstract:
In this paper an attempt has been made to analyse different wavelet techniques for image compression.Both hand-designed and lifting based wavelets are considered. Hand designed wavelets considered in thiswork are Haar wavelet, Daubechie wavelet, Biorthognal wavelet, Demeyer wavelet, Coiflet wavelet andSymlet wavelet. Lifting based wavelet transforms considered are 5/3 and 9/7. Wide range of images,including both color and gray scale images were considered. These wavelet transforms are used tocompress the test images competitively by using Set Partitioning In Hierarchical Trees (SPIHT) algorithmand by incorporating lifting concepts. Set Partitioning In Hierarchical Trees is a new advanced algorithmbased on wavelet transform which is gaining attention due to many potential commercial applications inthe area of image compression. These algorithms resulted in practical advantages, such as, superior lowbit rate performance, bit-level compression, progressive transmission by pixel, accuracy and resolution.The SPIHT coder is also a highly refined version of the EZW algorithm and is a powerful imagecompression algorithm, that produces an embedded bit stream form, in which the best reconstructedimages shows a significant perceptual improvement as well as an increased PSNR.

Abstract:
For integers $k, r > 0$, a conditional $(k,r)$-coloring of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex $v$ of degree $d(v)$ in $G$ is adjacent to at least $\min\{r, d(v)\}$ differently colored vertices. Given $r$, the smallest integer $k$ for which $G$ has a conditional $(k,r)$-coloring is called the $r$th order conditional chromatic number $\chi_r(G)$ of $G$. We give results (exact values or bounds for $\chi_r(G)$, depending on $r$) related to the conditional coloring of some graphs. We introduce \emph{unique conditional colorability} and give some related results. (Keywords. cartesian product of graphs; conditional chromatic number; gear graph; join of graphs.)

Abstract:
For integers k>0 and r>0, a conditional (k,r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex v of degree d(v) in G is adjacent to vertices with at least min{r,d(v)} different colors. The smallest integer k for which a graph G has a conditional (k,r)-coloring is called the rth order conditional chromatic number, denoted by $\chi_r(G)$. For different values of r we obtain $\chi_r(G)$ of certain parameterized graphs viz., Windmill graph, line graph of Windmill graph, middle graph of Friendship graph, middle graph of a cycle, line graph of Friendship graph, middle graph of complete k-partite graph and middle graph of a bipartite graph.

Abstract:
A D2CS of a graph G is a set $S \subseteq V(G)$ with $diam(G[S]) \leq 2$. We study the problem of counting and enumerating D2CS of a graph. First we give an explicit formula for the number of D2CS in a complete k-ary tree, Fibonacci tree, binary Fibonacci tree and the binomial tree. Next we give an algorithm for enumerating and counting D2CS of a graph. We then give a linear time algorithm for finding all maximal D2CS in a strongly chordal graph.

Abstract:
For integers r and k > 0(k>r),a conditional (k, r)-coloring of a graph G is a proper k-coloring of G such that every vertex v of G has at least min{r,d(v)} differently colored neighbors, where d(v) is the degree of v. In this note, for different values of r we obtain the conditional chromatic number of a grid $G(2,n) \cong P_2 \ \Box \ P_n$, $C_n^2$ and the strong product of $P_n$ and $P_m$ (n,m being positive integers). Also, for integers $n \geq 3$ and $t \geq 1$ the second order conditional chromatic number (also known as dynamic chromatic number) of the (t,n)-web graph is obtained.

Abstract:
Defining data with fuzziness made the knowledge discovery process easy and secure to data in data mining. The fuzzy data bases may have linguistic variables. In this paper, fuzzy conditional inference and reasoning are studied for generalized fuzzy data mining. Generalized fuzzy data mining and reasoning is studied with two membership functions “Belief” and “Disbelief”. The fuzzy logic with two membership functions will give more evidence than single membership function. The fuzzy certainty factor is studied as difference between these functions and made it as single membership function. The fuzzy data mining methods are studied. The generalized data mining is studied with different fuzzy conditional inferences. The business intelligence is given as an example.

Abstract:
Multi layered neural network architecture is proposed for compression of high-resolution images. The architecture considered has 64-4-64 structures, which achieves 100% compression. The proposed network is initially trained with preselected data sets for accurate training. Feeding the scaled error back into the network at specific points, reduces the training time and reduces redundancy in weight storage. Results show the performance superiority of the network as compared with JPEG compression standard. Inserting noise on the compressed sets of data tests the network performance. Reconstructed image is compared with original image using SE and number of bits per pixel. The proposed architecture models array multipliers, carry save adders, global LUTs (Lookup Tables) for neuron construction. Calculated weights are stored in memory and read whenever required for signal processing. The control unit developed manages the data processing activity saving 20% of power when compared to direct form network structures. Power efficient architecture is developed for hardware implementation. A modification in the proposed architecture enhances the compression by 100% with sum-squared error of about 47.36.

Abstract:
Two series of NiMgCuZn ferrites, that is, (1) NixMg0.6−xCu0.1Zn0.3Fe2O4 and sample G: Ni0.3Mg0.3−yCu0.1Zn0.5−yFe2O4 with =0.0, 0.1, 0.2, 0.3 and (2) NixMg0.6−xCu0.1Zn0.3Fe2O4 with =0.0, 0.1, 0.2 were synthesized and prepared by conventional ceramic double-sintering process and to use them as core materials for microinductor applications. The formation of single phase was confirmed by X-ray diffraction. The temperature and compositional variation of DC, AC electrical conductivities (σ) and thermoelectric power () were studied on these two series of polycrystalline ferrospinels. The studies were carried out in wide range of temperature from 30 to 350°C. On the basis of thermoelectric study, the ferrites under present work were found to be shown as n-type and p-type transition. The electrical conduction in these ferrospinels is explained in the light of polaron hopping mechanism. These ferrite compositions have been developed for their use as core materials for microinductor applications.

Abstract:
Continuing Education, professional development and lifelong learning are all terms used to describe an educational or training process that is a key component for successful organizations. The term Continuing Education often elicits several definitions, however one of the most comprehensive and applicable is Liveright and Haygood's 1969 version, "a process whereby persons who no longer attend school on a regular full-time basis … undertake sequential and organized activities with the conscious intention of bringing about changes in information, knowledge undertaking, skill appreciation and attitudes or for the purpose of identifying or solving personal or community problems" (Courtenay, 1990).