• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4153-4169
• /
• 2014

To recognize F5-like (such as F5 and nsF5) steganographic algorithm from multi-class stego images, a recognition algorithm based on the identifiable statistical feature (IDSF) of F5-like steganography is proposed in this paper. First, this paper analyzes the special modification ways of F5-like steganography to image data, as well as the special changes of statistical properties of image data caused by the modifications. And then, by constructing appropriate feature extraction sources, the IDSF of F5-like steganography distinguished from others is extracted. Lastly, based on the extracted IDSFs and combined with the training of SVM (Support Vector Machine) classifier, a recognition algorithm is presented to recognize F5-like stego images from images set consisting of a large number of multi-class stego images. A series of experimental results based on the detection of five types of typical JPEG steganography (namely F5, nsF5, JSteg, Steghide and Outguess) indicate that, the proposed algorithm can distinguish F5-like stego images reliably from multi-class stego images generated by the steganography mentioned above. Furthermore, even if the types of some detected stego images are unknown, the proposed algorithm can still recognize F5-like stego images correctly with high accuracy.

• Journal of the Chungcheong Mathematical Society
• /
• v.4 no.1
• /
• pp.61-69
• /
• 1991

By $C^{(1)}$[0, 1] we denote the Banach algebra of complex valued continuously differentiable functions on [0, 1] with norm given by $${\parallel}f{\parallel}=\sup_{x{\in}[0,1]}({\mid}f(x){\mid}+{\mid}f^{\prime}(x){\mid})\text{ for }f{\in}C^{(1)}$$. By A we denote the sub algebra of $C^{(1)}$ defined by $$A=\{f{\in}C^{(1)}:f(0)=f(1)\text{ and }f^{\prime}(0)=f^{\prime}(1)\}$$. By an isometry of A we mean a norm-preserving linear map of A onto itself. The purpose of this article is to describe the isometries of A. More precisely, we show tht any isometry of A is induced by a point map of the interval [0, 1] onto itself.

• East Asian mathematical journal
• /
• v.19 no.2
• /
• pp.165-171
• /
• 2003

We show that any F-harmonic map from a compact manifold M to N is necessarily constant if N possesses a strictly-convex function, and prove 'Liouville type theorems' for F-harmonic maps. Finally, when the target manifold is the real line, we get a result for F-subharmonic functions.

• Journal of the Chungcheong Mathematical Society
• /
• v.33 no.1
• /
• pp.77-87
• /
• 2020

In this paper, we investigate the stability of a functional equation f(x + 3y) - 5f(x + 2y) + 10f(x + y) - 8f(x) + 5f(x - y) - f(x - 2y) - 2f(-x) - f(2x) + f(-2x) = 0 by using the fixed point theory in the sense of L. Cǎdariu and V. Radu.

• Asian-Australasian Journal of Animal Sciences
• /
• v.20 no.9
• /
• pp.1342-1348
• /
• 2007

POU1F1 is a positive regulator for GH, PRL and TSH${\beta}$ and its mutations associate with production traits in ruminant animals. We described a DdeI PCR-RFLP method for detecting a silent allele in the goat POU1F1 gene: TCT (241Ser)>TCG (241Ser). Frequencies of $D_1$ allele varied from 0.600 to 1.000 in Chinese 801 goats. Significant associations of DdeI polymorphism with production traits were found in milk yield (*p<0.05), litter size (*p<0.05) and one-year-old weight (*p<0.05) between different genotypes. Individuals with genotype $D_1D_1$ had a superior performances when compared to those with genotype $D_1D_2$ (*p<0.05). Hence, the POU1F1 gene was suggested to the potential candidate gene for superior milk performance, reproduction trait and weight trait. Genotype $D_1D_1$, characterized by a DdeI PCR-RFLP detection, was recommended to geneticists and breeders as a molecular marker for better performance in the goat industry.

• Journal of the Korean Society of Safety
• /
• v.11 no.4
• /
• pp.16-23
• /
• 1996

In controlling manipulators interacting with the external environment, an important role is played by the Force/Torque(F/T) sensors. Recently, a number of structures for F/T sensors have been proposed, and some criteria for their evaluation have been introduced. This paper presents a systematic analysis of F/T sensor at the design stage. A model of the F/T sensors, based on Stewart Platform structure, is developed on the basis of static and kinematic equation. The condition number defined by the kinematic velocity and force analysis of F/T sensor is used as a performance Index. Thus, 4 optimal structure factors of 6 D.O. F. F/T sensor are determined by using the condition number.

• Communications of the Korean Mathematical Society
• /
• v.9 no.3
• /
• pp.539-545
• /
• 1994

Let $q = p^r$, where p is a prime. A polynomial $f(x) \in GF(q)[x]$ is called a permutation polynomial (PP) over GF(q) if the numbers f(a) where $a \in GF(Q)$ are a permutation of the a's. In other words, the equation f(x) = a has a unique solution in GF(q) for each $a \in GF(q)$. More generally, $f(x_1, \cdots, x_n)$ is a PP in n variables if $f(x_1,\cdots,x_n) = \alpha$ has exactly $q^{n-1}$ solutions in $GF(q)^n$ for each $\alpha \in GF(q)$. Mullen ([3], [4], [5]) has studied the concepts of local permutation polynomials (LPP's) over finite fields. A polynomial $f(x_i, x_2, \cdots, x_n) \in GF(q)[x_i, \codts,x_n]$ is called a LPP if for each i = 1,\cdots, n, f(a_i,\cdots,x_n]$ is a PP in $x_i$ for all $a_j \in GF(q), j \neq 1$.Mullen ([3],[4]) found a set of necessary and three variables over GF(q) in order that f be a LPP. As examples, there are 12 LPP's over GF(3) in two indeterminates ; $f(x_1, x_2) = a_{10}x_1 + a_{10}x_2 + a_{00}$ where $a_{10} = 1$ or 2, $a_{01} = 1$ or x, $a_{00} = 0,1$, or 2. There are 24 LPP's over GF(3) of three indeterminates ; $F(x_1, x_2, x_3) = ax_1 + bx_2 +cx_3 +d$ where a,b and c = 1 or 2, d = 0,1, or 2.

• The Pure and Applied Mathematics
• /
• v.24 no.2
• /
• pp.109-127
• /
• 2017

In this paper, we solve the following quadratic ${\rho}-functional$ inequalities ${\parallel}f({\frac{x+y+z}{2}})+f({\frac{x-y-z}{2}})+f({\frac{y-x-z}{2}})+f({\frac{z-x-y}{2}})-f(x)-f(y)f(z){\parallel}$ (0.1) ${\leq}{\parallel}{\rho}(f(x+y+z)+f(x-y-z)+f(y-x-z)+f(z-x-y)-4f(x)-4f(y)-4f(z)){\parallel}$, where ${\rho}$ is a fixed non-Archimedean number with ${\mid}{\rho}{\mid}$ < ${\frac{1}{{\mid}4{\mid}}}$, and ${\parallel}f(x+y+z)+f(x-y-z)+f(y-x-z)+f(z-x-y)-4f(x)-4f(y)-4f(z){\parallel}$ (0.2) ${\leq}{\parallel}{\rho}(f({\frac{x+y+z}{2}})+f({\frac{x-y-z}{2}})+f({\frac{y-x-z}{2}})+f({\frac{z-x-y}{2}})-f(x)-f(y)f(z)){\parallel}$, where ${\rho}$ is a fixed non-Archimedean number with ${\mid}{\rho}{\mid}$ < ${\mid}8{\mid}$. Using the direct method, we prove the Hyers-Ulam stability of the quadratic ${\rho}-functional$ inequalities (0.1) and (0.2) in non-Archimedean Banach spaces and prove the Hyers-Ulam stability of quadratic ${\rho}-functional$ equations associated with the quadratic ${\rho}-functional$ inequalities (0.1) and (0.2) in non-Archimedean Banach spaces.

• Korean Journal of Optics and Photonics
• /
• v.6 no.3
• /
• pp.201-213
• /
• 1995

By the use of computer simulation including collisional mixing kinetic processes of the B- and C-state in the upper laser level the output characteristics of electron-beam pumped XeF$(C\rightarrowA$ excimer laser are analyzed. We compared the results between experiments and simulations for the $XeF^*(C)$ formation that correlated the number of densities of the $XeF^*(B)$. We obtained good agreement$(28.5 mJ\pm5%)$ with comparisons between experiment and simulation and confirmed the optimal gas mixing ratio of $Xe/F_2/Ar=5.26/0.49/94.28%$ at atmospheric pressure laser medium under the condition of 70 ns [FWHM] electron-beam (800 kV, 21 kA). Also through the simulation we have investigated that the $XeF^*(C)$ formation channel, the $XeF^*(C)$ relaxation channel, and the absorption channel of bluegreen wavelength region as a function of F2 halogen donor and Xe partial pressure. ssure.

• Journal of applied mathematics & informatics
• /
• v.34 no.3_4
• /
• pp.227-237
• /
• 2016

In this paper we introduce a new graph labeling called k-prime cordial labeling. Let G be a (p, q) graph and 2 ≤ p ≤ k. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called a k-prime cordial labeling of G if |v_f (i) − v_f (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |e_f (0) − e_f (1)| ≤ 1 where v_f (x) denotes the number of vertices labeled with x, e_f (1) and e_f (0) respectively denote the number of edges labeled with 1 and not labeled with 1. A graph with a k-prime cordial labeling is called a k-prime cordial graph. In this paper we investigate the k-prime cordial labeling behavior of a star and we have proved that every graph is a subgraph of a k-prime cordial graph. Also we investigate the 3-prime cordial labeling behavior of path, cycle, complete graph, wheel, comb and some more standard graphs.