• Journal of the Korean Society of Combustion
• /
• v.8 no.3
• /
• pp.15-23
• /
• 2003

Partial quenching structure of turbulent diffusion flames in a turbulent mixing layer is investigated by the method of flame hole dynamics in order to develop a prediction model for turbulent flame lift off. The essence of flame hole dynamics is derivation of the random walk mapping, from the flame-edge theory, which governs expansion or contraction of flame holes initially created by local quenching events. The numerical simulation for flame hole dynamics is carried out in two stages. First, a direct numerical simulation is performed for constant-density fuel-air channel mixing layer to obtain the turbulent flow and mixing fields, from which a time series of two dimensional scalar dissipation rate array is extracted at a fixed virtual flame surface horizontally extending from the end of split plate to the downstream. Then, the Lagrangian simulation of the flame hole random walk mapping projected to the scalar dissipation rate array yields temporally evolving turbulent extinction process and its statistics on partial quenching characteristics. The statistical results exhibit that the chance of partial quenching is strongly influenced by the crossover scalar dissipation rate while almost unaffected by the iteration number of the mapping that can be regarded as a flame-edge speed.

• 한국연소학회:학술대회논문집
• /
• 2003.05a
• /
• pp.223-227
• /
• 2003

The method of flame hole dynamics is demonstrated as a mean to simulate turbulent flame extinction. The core of the flame hole dynamics involves derivation of a random walk mapping for the flame holes, created by local quenching, between the burning and quenched states provided that the dynamic characteristics of flame edges is known. Then, the random walk mapping is projected to a background turbulent field. The numerical simulations are carried out with the further simplifications of flame string and unconditioned scalar dissipation rate. The simulation results show how the chance of partial quenching is influenced by the crossover scalar dissipation rate. Finally, a list of improvements, necessary to achieve more realistic turbulent flame quenching simulation, are discussed.

• Journal of Mechanical Science and Technology
• /
• v.17 no.11
• /
• pp.1775-1783
• /
• 2003

The method of flame hole dynamics is demonstrated as a mean to simulate turbulent flame extinction. The core of the flame hole dynamics involves derivation of a random walk mapping for the flame holes, created by local quenching, between burning and quenched states provided that the dynamic characteristics of flame edges is known. Then, the random walk mapping is projected to a background turbulent field. The numerical simulations are carried out with further simplifications of flame string and unconditioned scalar dissipation rate. The simulation results show how the chance of partial quenching is influenced by the crossover scalar dissipation rate. Finally, a list of improvements, necessary to achieve more realistic turbulent flame quenching simulation, are discussed.

• Journal of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.1-12
• /
• 1997

Complementaity problem theory developed by Lemke [10], Cottle and Dantzig [8] and others in the early 1960s and thereafter, has numerous applications in diverse fields of mathematical and engineering sciences. And it is closely related to variational inquality theory and fixed point theory. Recently, fixed point methods for the solving of nonlinear complementarity problems were considered by Noor et al. [11, 12]. Also complementarity problems related to variational inequality problems were investigated by Chang [1], Cottle [7] and others.

• Journal of Korea Multimedia Society
• /
• v.16 no.3
• /
• pp.318-329
• /
• 2013

This paper proposes a DNA watermarking method for the privacy protection and the prevention of illegal copy. The proposed method allocates codons to random circular angles by using random mapping table and selects triplet codons for embedding target with the help of the Lipschitz regularity value of local modulus maxima of codon circular angles. Then the watermark is embedded into circular angles of triplet codons without changing the codes of amino acids in a DNA. The length and location of target triplet codons depend on the random mapping table for 64 codons that includes start and stop codons. This table is used as the watermark key and can be applied on any codon sequence regardless of the length of sequence. If this table is unknown, it is very difficult to detect the length and location of them for extracting the watermark. We evaluated our method and DNA-crypt watermarking of Heider method on the condition of similar capacity. From evaluation results, we verified that our method has lower base changing rate than DNA-crypt and has lower bit error rate on point mutation and insertions/deletions than DNA-crypt. Furthermore, we verified that the entropy of random mapping table and the locaton of triplet codons is high, meaning that the watermark security has high level.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.708-713
• /
• 2003

For many years clustered heterogeneous web server architecture has been formed on the internet because the explosive internet services and the various quality of requests. The critical point in cluster environment is the mapping schemes of request to server. and recently this is the main issue of internet architecture. The topic of previous mapping methods is to assign equal loads to servers in cluster using the number of requests. But recent growth of various services makes it hard to depend on simple load balancing to satisfy appropriate latency. So mapping based on requested content to decrease response time and to increase cache hit rates on entire servers - so called “content-based” mapping is highly valuated on the internet recently. This paper proposes Prioritized Highest Random Weight mapping(PHRW mapping) that improves content-based mapping to properly fit in the heterogeneous environment. This mapping scheme that assigns requests to the servers with priority, is very effective on heterogeneous web server cluster, especially effective on decreasing latency of reactive data service which has limit on latency. This paper have proved through algorithm and simulation that proposed PHRW mapping show higher-performance by decrease in latency.

• The Pure and Applied Mathematics
• /
• v.19 no.1
• /
• pp.59-71
• /
• 2012

In this paper, we prove the stability in random normed spaces via fixed point method for the functional equation $$f(x+y+z)-f(x+y)-f(y+z)-f(x+z)+f(x)+f(y)+f(z)=0$$. by using a fixed point theorem in the sense of L. C$\breve{a}$dariu and V. Radu.

• Korean Journal of Mathematics
• /
• v.20 no.1
• /
• pp.19-31
• /
• 2012

In this paper, we prove the stability in random normed spaces via fixed point method for the functional equation $$2f(x+y)+f(x-y)+f(y-x)-f(2x)-f(2y)=0$$.

• Korean Journal of Mathematics
• /
• v.19 no.4
• /
• pp.437-451
• /
• 2011

In this paper, we prove the stability in random normed spaces via fixed point method for the functional equation $$f(x+2y)-2f(x+y)+2f(x-y)-f(x-2y)=0$$.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.2
• /
• pp.201-215
• /
• 2012

In this paper, we prove the stability in random normed spaces via fixed point method for the functional equation $f(x+y+z+w)\;+\;2f(x)\;+\;2f(y)\;+\;2f(z)\;+\;2f(w)\;-\;f(x+y)\;-\;f(x+z)\;-\;f(x+w)\;-\;f(y+z)\;-\;f(y+w)\;-\;f(z+w)=0$.