Secure Data Transmission using Content Fingerprinting Digital Watermarking Techniques

R.Gayathri,V.Nagarajan 대한전자공학회 2015 ITC-CSCC :International Technical Conference on Ci Vol.2015 No.6

In order to hinder the unauthorized redistribution of digital data, digital watermarking has increasingly applied to conceal information in digital multimedia data, thus enlisting the watermarking technology in the difficult fight against intellectual property rights infringement. Brought up by the crucial issue of copyright, digital watermarking plays a key role in protecting integrity and providing authorization for multimedia. Fingerprinting is a means to trace the illegally redistributed intellectual property (IP) by creating a unique IP instance with a different signature for each user. Existing fingerprinting techniques focus on lowering the design effort to create a large number of different IP instances without paying much attention on the ease of fingerprint detection upon IP integration. A new framework that enhances the Mobile commerce by the use of content fingerprinting and digital watermarking techniques provides security and privacy to the content owner. The content fingerprinting technique is based on active content fingerprinting in which fingerprint can be hided into image using reversible watermarking of haar transform for secure transmission. The performance of this system can be examined based on peak signal to noise ratio and mean square error and it can be compared with existing methods. Thus digital watermarking technology can be introduced into the field of mobile commerce to provide high level of security for online transactions.

Ontology based knowledge representation technique, domain modeling languages and planners for robotic path planning: A survey

Gayathri R.,V. Uma 한국통신학회 2018 ICT Express Vol.4 No.2

Knowledge Representation and Reasoning (KR & R) has become one of the promising fields of Artificial Intelligence. KR is dedicated towards representing information about the domain that can be utilized in path planning. Ontology based knowledge representation and reasoning techniques provide sophisticated knowledge about the environment for processing tasks or methods. Ontology helps in representing the knowledge about environment, events and actions that help in path planning and making robots more autonomous. Knowledge reasoning techniques can infer new conclusion and thus aids planning dynamically in a non-deterministic environment. In the initial sections, the representation of knowledge using ontology and the techniques for reasoning that could contribute in path planning are discussed in detail. In the following section, we also provide comparison of various planning domain modeling languages, ontology editors, planners and robot simulation tools.

Influence of potassium nitrate on antioxidant level and secondary metabolite genes under cold stress in Panax ginseng

Devi, B. S. R.,Kim, Y. J.,Selvi, S. K.,Gayathri, S.,Altanzul, K.,Parvin, S.,Yang, D. U.,Lee, O. R.,Lee, S.,Yang, D. C. Pleiades Publishing 2012 Russian journal of plant physiology: a comprehensi Vol.59 No.3

A critical review on biochar for environmental applications

R. Sivaranjanee,P. Senthil Kumar,Gayathri Rangasamy 한국탄소학회 2023 Carbon Letters Vol.33 No.5

Water contamination is one of the most pressing environmental issues of the present. There is a significant amount of interest in the slow pyrolysis of biomass to produce biochar, a solid byproduct that is stable and rich in carbon. Adsorbents manufactured from hydrochars, sometimes referred to as hydrochar created by hydrothermal methods, have been tested for the removal of possible contaminants from wastewater. The hydrothermal processes of hydrothermal carbonization (HTC) and liquefaction (HTL) yield hydrochars, a distinct category of biochar. Because of its peak efficiency, large surface area, large size of pore and capacity to regenerate, hydrochar is an acceptable option for the rehabilitation of a range of pollutants. The formation, activation, identification, and use of biochar and hydrochar were highlighted in this review. The physiochemical properties of the char produced by the two processes are very different, which has an impact on their potential uses in areas like wastewater pollution remediation, soil improvement, greenhouse gas emission and carbon sequestration among others.

A recent advancement on hydrothermal carbonization of biomass to produce hydrochar for pollution control

R. Sivaranjanee,P. Senthil Kumar,Gayathri Rangasamy 한국탄소학회 2023 Carbon Letters Vol.33 No.7

A thermochemical conversion method known as hydrothermal carbonization (HTC) is appealing, because it may convert wet biomass directly into energy and chemicals without the need for pre-drying. The hydrochar solid product’s capacity to prepare precursors of activated carbon has attracted attention. HTC has been utilized to solve practical issues and produce desired carbonaceous products on a variety of generated wastes, including municipal solid waste, algae, and sludge in addition to the typically lignocellulose biomass used as sustainable feedstock. This study aims to assess the in-depth description of hydrothermal carbonization, highlighting the most recent findings with regard to the technological mechanisms and practical advantages. The process parameters, which include temperature, water content, pH, and retention time, determine the characteristics of the final products. The right setting of parameters is crucial, since it significantly affects the characteristics of hydrothermal products and opens up a range of opportunities for their use in multiple sectors. Findings reveal that the type of precursor, retention time, and temperature at which the reaction is processed were discovered to be the main determinants of the HTC process. Lower solid products are produced at higher temperatures; the carbon concentration rises, while the hydrogen and oxygen content declines. Current knowledge gaps, fresh views, and associated recommendations were offered to fully use the HTC technique's enormous potential and to provide hydrochar with additional useful applications in the future.

PAIR DIFFERENCE CORDIAL LABELING OF PETERSEN GRAPHS P(n, k)

R. PONRAJ,A. GAYATHRI,S. SOMASUNDARAM The Korean Society for Computational and Applied M 2023 Journal of applied and pure mathematics Vol.5 No.1/2

Let G = (V, E) be a (p, q) graph. Define $${\rho}=\{{\frac{2}{p}},\;{\text{{\qquad} if p is even}}\\{\frac{2}{p-1}},\;{{\text{if p is odd}}$$ and L = {±1, ±2, ±3, … , ±ρ} called the set of labels. Consider a mapping f : V ⟶ L by assigning different labels in L to the different elements of V when p is even and different labels in L to p-1 elements of V and repeating a label for the remaining one vertex when p is odd.The labeling as defined above is said to be a pair difference cordial labeling if for each edge uv of G there exists a labeling |f(u) - f(v)| such that ${\mid}{\Delta}_{f_1}-{\Delta}_{f^c_1}{\mid}{\leq}1$, where ${\Delta}_{f_1}$ and ${\Delta}_{f^c_1}$ respectively denote the number of edges labeled with 1 and number of edges not labeled with 1. A graph G for which there exists a pair difference cordial labeling is called a pair difference cordial graph. In this paper we investigate pair difference cordial labeling behaviour of Petersen graphs P(n, k) like P(n, 2), P(n, 3), P(n, 4).

Pair difference cordial labeling of Petersen graphs P(n,k)

R. Ponraj,A. Gayathri,S. Somasundaram 한국전산응용수학회 2023 Journal of Applied and Pure Mathematics Vol.5 No.1

Let $G = (V, E)$ be a $(p,q)$ graph. Define \begin{equation*} \rho = \begin{cases} \frac{p}{2} ,& \text{if $p$ is even}\\ \frac{p-1}{2} ,& \text{if $p$ is odd}\\ \end{cases} \end{equation*}\\ and $L = \{\pm1 ,\pm2, \pm3 , \cdots ,\pm\rho\}$ called the set of labels.\\ \noindent Consider a mapping $f : V \longrightarrow L$ by assigning different labels in L to the different elements of V when p is even and different labels in L to p-1 elements of V and repeating a label for the remaining one vertex when $p$ is odd.The labeling as defined above is said to be a pair difference cordial labeling if for each edge $uv$ of $G$ there exists a labeling $\left|f(u) - f(v)\right|$ such that $\left|\Delta_{f_1} - \Delta_{f_1^c}\right| \leq 1$, where $\Delta_{f_1}$ and $\Delta_{f_1^c}$ respectively denote the number of edges labeled with $1$ and number of edges not labeled with $1$. A graph $G$ for which there exists a pair difference cordial labeling is called a pair difference cordial graph. In this paper we investigate pair difference cordial labeling behaviour of Petersen graphs $P(n,k)$ like $P(n,2), P(n,3),P(n,4)$.

Pair difference cordiality of some special graphs

R. Ponraj,A. Gayathri,S. Somasundaram 한국전산응용수학회 2021 Journal of Applied and Pure Mathematics Vol.3 No.5

Let G = (V, E) be a (p,q) graph. Define \begin{equation*}\rho =\begin{cases}\frac{p}{2} ,& \text{if p is even} \frac{p-1}{2} ,& \text{if p is odd}\end{cases} \end{equation*} and L = \{\pm1 ,\pm2, \pm3 , \cdots ,\pm\rho\} called the set of labels. Consider a mapping f : V \longrightarrow L by assigning different labels in L to the different elements of V when p is even and different labels in L to p-1 elements of V and repeating a label for the remaining one vertex when p is odd.The labeling as defined above is said to be a pair difference cordial labeling if for each edge uv of G there exists a labeling \left|f(u) - f(v)\right| such that \left|\Delta_{f_1} - \Delta_{f_1^c}\right| \leq 1, where \Delta_{f_1} and \Delta_{f_1^c} respectively denote the number of edges labeled with 1 and number of edges not labeled with 1. A graph G for which there exists a pair difference cordial labeling is called a pair difference cordial graph. In this paper we investigate pair difference cordial labeling behavior of some special graphs like jelly fish, jewel graph, kayak padal graph, theta graph, bamboo tree, and olive tree.

Pair Difference Cordial Graphs Obtained From The Wheels and The Paths

R. Ponraj,A. Gayathri,S. Somasundaram 한국전산응용수학회 2021 Journal of Applied and Pure Mathematics Vol.3 No.3

Let G = (V, E) be a $(p,q)$ graph. Define \rho = \begin{cases}\frac{p}{2} ,& \text{if $p$ is even}\frac{p-1}{2} ,& \text{if $p$ is odd}\end{cases} and L = \{\pm1 ,\pm2, \pm3 , \cdots ,\pm\rho\} called the set of labels. Consider a mapping f : V \longrightarrow L by assigning different labels in L to the different elements of V when p is even and different labels in L to p-1 elements of V and repeating a label for the remaining one vertex when p is odd.The labeling as defined above is said to be a pair difference cordial labeling if for each edge uv of G there exists a labeling \left|f(u) - f(v)\right| such that \left|\Delta_{f_1} - \Delta_{f_1^c}\right| \leq 1, where \Delta_{f_1} and \Delta_{f_1^c} respectively denote the number of edges labeled with 1 and number of edges not labeled with 1. A graph G for which there exists a pair difference cordial labeling is called a pair difference cordial graph. In this paper we investigate the pair difference cordial labeling behavior of some wheel and path related graphs.

Pair difference cordial labeling of m-copies of some graphs

R. Ponraj,A. Gayathri,S. Somasundaram 한국전산응용수학회 2022 Journal of Applied and Pure Mathematics Vol.4 No.5

In this paper we investigate the pair difference cordial labeling behaviour of $m-$ copies of $K_4$, subdivision of star, fan, comb graphs.