• Journal of Korean Society of Water and Wastewater
• /
• v.25 no.6
• /
• pp.989-994
• /
• 2011

Nitrate contamination of groundwater is a common problem throughout intensive agriculture areas (non-point source pollution). Current processes (e.g. ion exchange and membrane separation) for nitrate removal have various disadvantages. The objective of this study was to evaluate electrochemical method such as electroreduction using bipolar ZVI packed bed electrolytic cell to remove nitrate from groundwater at field pilot. In addition ammonia stripping tower continuously removed up to 77.0% of ammonia. Bipolar ZVI packed bed electrolytic cell also removed E.coli. In the field pilot experiment for groundwater in 'I' city (average nitrate 30~35 mg N/L, pH 6.4), maximum 99.9% removal of nitrate was achieved in the applied 600 V.

• Journal of the Korean Mathematical Society
• /
• v.49 no.2
• /
• pp.315-324
• /
• 2012

We consider the global existence of strong solutions of the 3D incompressible Navier-Stokes equations in a long periodic domain. We show by a simple argument that a strong solution exists globally in time when the initial velocity in $H^1$ and the forcing function in $L^p$([0; T);$L^2$), T > 0, $2{\leq}p{\leq}+\infty$ satisfy a certain condition. This condition common appears for the global existence in thin non-periodic domains. Larger and larger initial data and forcing functions satisfy this condition as the thickness of the domain $\epsilon$ tends to zero.

• 전기의세계
• /
• v.30 no.10
• /
• pp.645-654
• /
• 1981

A technique has been proposed for fabricating a submicron channel vertical V-groove JFET using standard photolithography. A finite element numerical simulation of the V-groove JFET operation was performed using a FORTRAN progrma run on a Cyber-174 computer. The numerical simulation predicts pentode like common source output characteristics for the p$^{+}$n Vertical V-groove JFET with maximum transconductance representing approximately 6 precent of the zero bias drain conductance value and markedly high drain conductance at large drain voltages. An increase in the acceptor concentration of the V-groove JFET gate was observed to cause a significant increase in the transconductance of the device. Therefore, as above mentioned, this paper is study on the analysis of a Vertical V-groove Junction Field Effect Transistor with Finite Element Method.d.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.10
• /
• pp.525-533
• /
• 2002

It is common to install multiple lines in the same route. Recently, excessive sheath circulating current was partially measured in underground cable systems of KEPCO. Especially, the installation type, unbalance section length between joint boxes and zero sequence current by distribution cable have an effect on the rising of sheath circulating current in the underground transmission system. If excessive current flows in sheath, sheath loss which is reduced the transmission capacity is produced. This paper describes the relation analysis of sheath circulating current and burying types. And also, a detailed analysis on rising cause and characteristic of sheath circulating current by considering various unbalanced conditions presents using analysis and measurement regarding cable systems which have the problem of excessive sheath circulation current.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1790-1806
• /
• 2016

Digital image encryption is widely used for image data security. JPEG standard compresses image with great performance on reducing file size. Thus, to encrypt an image in JPEG format we should keep the quality of original image and reduced size. This paper proposes a JPEG image encryption scheme based on quantized DC and non-zero AC coefficients inner category scrambling. Instead of coefficient value encryption, the address of coefficient is encrypted to get the address of cipher text. Then 8*8 blocks are shuffled. Chaotic iteration is employed to generate chaotic sequences for address scrambling and block shuffling. Analysis of simulation shows the proposed scheme is resistant to common attacks. Moreover, the proposed method keeps the file size of the encrypted image in an acceptable range compared with the plain text. To enlarge the cipher text possible space and improve the resistance to sophisticated attacks, several additional procedures are further developed. Contrast experiments verify these procedures can refine the proposed scheme and achieve significant improvements.

• Kyungpook Mathematical Journal
• /
• v.53 no.4
• /
• pp.541-552
• /
• 2013

This research is a continuation of a recent paper due to the first author in [9]. Different from previous results, we investigate the value distribution of difference polynomials of moromorphic functions in this paper. In particular, we are interested in the existence of zeros of $f(z)^n({\lambda}f(z+c)^m+{\mu}f(z)^m)-a$, where f is a moromorphic function, n, m are two non-negative integers, and ${\lambda}$, ${\mu}$ are non-zero complex numbers. However, the proof here is obviously different to the one in [9]. We also study difference polynomials of entire functions sharing a common value, which improves the result in [10, 13].

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.47-57
• /
• 2000

In this paper we consider an n-job non-preemptive and identical parallel machine scheduling problem of minimizing the sum of earliness and tardiness with different release times and due dates. In the real world this problem is more realistic than the problems that release times equal to zero or due dates are common. The problem is proved to be NP-complete. Thus a heuristic is developed to solve this problem To illustrate its suitability a proposed heuristic is compared with a genetic algorithm for a large number of randomly generated test problems. Computational results show the effectiveness and efficiency of proposed heuristic. In summary the proposed heuristic provides good solutions than genetic algorithm when the problem size is large.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.3
• /
• pp.47-54
• /
• 1996

In this paper we propose a new timing recovery method by means of utilizing service data filling rate instead of timing information of transmitter. A proposed algorithm controls the phase locked loop in the opposite direction ot data filling rate of FIFO in receiver, and it is based on the fact that average of cell jitters is zero. The proposed method is simple compared with timing information method of transmitter. It can be utilized for timing recovery in synchronous digital hierarchy as well as in plesiochronous digial hierarchy without common reference clocks in end-to-end erminals. We implement the interactive video communication system and test the proposed algorithm. As a result, we hav econfirmed that it yields good perfomrnces in terms of jitters characteristics and hardware complexity.

• Journal of the Korean Society of Safety
• /
• v.29 no.3
• /
• pp.107-113
• /
• 2014

The goal of this study is to develop the accident models of motorcycle at roundabouts. In the pursuing the above, this study gives particular attentions to developing the appropriate models using ZAM. The main results are as follows. First, the evaluation of various developed models by the Vuong statistic and over-dispersion parameter shows that ZINB is analyzed to be optimal among Poisson, NB, ZIP(zero-inflated Poisson) and ZINB regression models. Second, the traffic volume, width of central island and width of approach are evaluated to be important variables to the accidents. Finally, the common variables that affect to the accident are selected to be traffic volume and width of approach. This study might be expected to give some implications to the accident research on the roundabout by motorcycle.

• ETRI Journal
• /
• v.38 no.5
• /
• pp.934-940
• /
• 2016

In this paper, secure multicasting with the help of cooperative decode-and-forward relays is considered for the case in which a source securely sends a common message to multiple destinations in the presence of a single eavesdropper. We show that the secrecy rate maximization problem in the secure multicasting scenario under an overall power constraint can be solved using semidefinite programing with semidefinite relaxation and a bisection technique. Further, a suboptimal approach using zero-forcing beamforming and linear programming based power allocation is also proposed. Numerical results illustrate the secrecy rates achieved by the proposed schemes under secure multicasting scenarios.