• Journal of Soil and Groundwater Environment
• /
• v.23 no.1
• /
• pp.85-91
• /
• 2018

Arsenic (As) usually is bound to amorphous iron oxides in the soils, and it can be removed via dissolution of iron oxides. Inorganic acid and chelating agent are widely used to extract As in the soil washing. However, the overall performance is highly dependent on the state of As fractionation. In this study, oxalic acid and inorganic acids (HCl, $H_2SO_4$, and $H_3PO_4$) were applied to enhance the dissolution of iron oxides for remediation of As-contaminated soils. Oxalic acid was most effective to extract As from soils and removal of As was two times greater than other inorganic acids. Additionally, 75% of As bound to amorphous iron oxides was removed by 0.2 M oxalic acid. Arsenic removal by oxalic acid was directly proportional to the sum of labile fractions of As instead of the total concentration of As. Therefore, the oxalic acid could extract most As bound to amorphous iron oxides.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2001.03a
• /
• pp.41-48
• /
• 2001

In this study, two factors are simultaneously considered for assessing tunnel face stability: one is the effective stress acting on the tunnel face calculated by upper bound solution; and the other is the seepage force calculated by numerical analysis under the condition of steady-state groundwater flow. The seepage forces calculated by numerical analysis are compared with the results of a model test. From the results of derivations of the upper bound solution with the consideration of seepage forces acting on the tunnel face, it could be found that the minimum support pressure for the face stability is equal to the sum of effective support pressure and seepage pressure acting on the tunnel face. Also it could be found that the average seepage pressure acting on the tunnel face is proportional to the hydrostatic pressure at the same elevation and the magnitude is about 22% of the hydrostatic pressure for the drainage type tunnel and about 28% for the water-proof type tunnel. The model tests performed with a tunnel model had a similar trend with the seepage pressure calculated by numerical analysis. From the model tests it could be also found that the collapse at the tunnel face occurs suddenly and leads to unlimited displacement.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.1
• /
• pp.101-121
• /
• 1997

Consider a Jackson type closed queueing network in which each queue has a single exponential server. Assume that N customers are moving among .kappa. queues. We propose a candidata procedure which yields a lower bound of the network throughput which is sharper than those which are currently available : Let (.rho.$_{1}$, ... .rho.$_{\kappa}$) be the loading vector, let x be a real number with 0 .leq. x .leq. N, and let y(x) denote that y is a function of x and be the unique positive solution of the equation. .sum.$_{i = 1}$$^{\kappa}$y(x) .rho.$_{i}$ (N - y(x) x $p_{i}$ ) = 1 Whitt [17] has shown that y(N) is a lower bound for the throughput. In this paper, we present evidence that y(N -1) is also a lower bound. In dosing so, we are led to formulate a rather general conjecture on 'quot;Migrating Critical Points'quot; (MCP). The .MCP. conjecture asserts that zeros of successive derivatives of certain rational functions migrate at an accelerating rate. We provide a proof of MCP in the polynomial case and some other special cases, including that in which the rational function has exactly two real poles and fewer than three real zeros.tion has exactly two real poles and fewer than three real zeros.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.731-736
• /
• 2017

It is well-known that there exists a constant-weight $[s{\theta}_{k-1},k,sq^{k-1}]_q$ code for any positive integer s, which is an s-fold simplex code, where ${\theta}_j=(q^{j+1}-1)/(q-1)$. This gives an upper bound $n_q(k,sq^{k-1}+d){\leq}s{\theta}_{k-1}+n_q(k,d)$ for any positive integer d, where $n_q(k,d)$ is the minimum length n for which an $[n,k,d]_q$ code exists. We construct a two-weight $[s{\theta}_{k-1}+1,k,sq^{k-1}]_q$ code for $1{\leq}s{\leq}k-3$, which gives a better upper bound $n_q(k,sq^{k-1}+d){\leq}s{\theta}_{k-1}+1+n_q(k-1,d)$ for $1{\leq}d{\leq}q^s$. As another application, we prove that $n_q(5,d)={\sum_{i=0}^{4}}{\lceil}d/q^i{\rceil}$ for $q^4+1{\leq}d{\leq}q^4+q$ for any prime power q.

• Journal of Advanced Navigation Technology
• /
• v.15 no.2
• /
• pp.234-240
• /
• 2011

In this paper, the performances of Cram$\acute{e}$r-Rao Lower Bound (CRLB) with Frequency Difference of Arrival (FDOA) measurements for Unmanned Aerial Vehicle (UAV) tracking are investigated. We focus on two cases: the influence on CRLB with FDOA measurements collected by time, and random distribution of Ground Stations (GSs). We derived the performance by gauging the size of CRLB through Complementary Cumulative Distribution Function (CCDF). From the simulation results, broader distribution of GSs and FDOA measurements by longer time bring about better performance.

• Journal of Mechanical Science and Technology
• /
• v.15 no.1
• /
• pp.1-9
• /
• 2001

The recent spread of scaled telemanipulation into microsurgery and the nano-world increasingly requires the identification of the possible operation region as a main system specification. A teleoperation system is a complex cascaded system since the human operator, master, slave, and communication are involved bilaterally. Hence, a small time delay inside a master and slave system can be critical to the overall system stability even without communication time delay. In this paper we derive an upper bound of the scaling product of position and force by using Llewellyns unconditional stability. This bound can be used for checking the validity of the designed bilateral controller. Time delay from the sample and hold of computer control and its effects on stability of scaled teleoperation are modeled and simulated based on the transfer function of the teleoperation system. The feasible operation region in terms of position and force scaling decreases sharply as the sampling rate decreases and time delays inside the master and slave increase.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.2 no.2
• /
• pp.126-131
• /
• 1997

The biosorption and desorption of Cr, Cu and Al were carried out using brown marine algae Sargassum fluitans biomass, known as the good biosorbent of heavy metals. The content of alginate bound to light metals could be changed by physical and chemical pretreatment. The maximum uptake of Cr, Cu and Al was independent of the alginate content. The maximum uptaker of Al was two times(mole basis) than those of Cu and Cr. The aluminum-alginate complex was found in the sorption solution of raw and protonated biomass. Most of Cu, Al and light metals sorbed in the biomass were eluted at pH 1.1. However, only 5 to 10% of Cr sorbed was eluted at pH 1.1. The stoiceometric ion exchange between Cu and Ca ion was observed on Cu biosorption with Ca-loaded biomass. A part of Cr ion was bound to biomass as Cr(OH)2+ or Cr(OH)2+. Al was also bound to biomass as multi-valence ion and interfered with the desorbed Ca ion. The behavior of raw S. fluitans in ten consecutive sorption-desorption cycles has been investigated in a packed bed flow-through-column during a continuous removal of copper from a 35 mg/L aqueous solution at pH 5. The eluant used was a 1%(w/v) CaCl2/HC solution at pH 3.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.1
• /
• pp.62-68
• /
• 2005

This paper presents a scheme to enhance fixed priority scheduling algorithms on multiprocessors. This scheme gives the highest priority to jobs with zero laxity and schedules them Prior to other jobs. A fixed priority algorithm employing this scheme strictly dominates the original one; it can schedule all task sets schedulable by the fixed priority algorithm and some task sets not schedulable by the fixed priority algorithm. Simulation results show that the proposed scheme improves fixed priority algorithms in terms of the number of schedulable task sets and schedulable utilization bound.

• Environmental Engineering Research
• /
• v.11 no.1
• /
• pp.33-44
• /
• 2006

The objective of this study was to develop and assess a method for estimating the rain scavenging ratios (RSRs) of particle-bound PAHs and PCBs using measured scavenging ratio of particulate matters (PM) and routinely available data of physico-chemical properties of PM. Paired atmospheric and rainwater sampling was conducted for a total of 4 rain events. Assuming equilibrium partitioning in rainwater-gas-PM system, an equation was derived for estimating the RSR of particle-bound chemicals as a function of RSR of PM and three equilibrium partition constants (i.e. dimensionless Henry's law constant, gas-particle partition coefficient, and water-particle partition coefficient). For all PAHs, the model significantly under-predicted the RSR while the model prediction for PCBs agreed with observation mostly within a factor of 5. The RSR model for the chemicals is of limited use as its accuracy critically depends on how close the observed partitioning of the chemicals in the gas-PM-rainwater system is to that estimated under the equilibrium assumption.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.20 no.2
• /
• pp.107-121
• /
• 2016

We analyze the complexity of the LLL algorithm, invented by Lenstra, Lenstra, and $Lov{\acute{a}}sz$ as a a well-known lattice reduction (LR) algorithm which is previously known as having the complexity of $O(N^4{\log}B)$ multiplications (or, $O(N^5({\log}B)^2)$ bit operations) for a lattice basis matrix $H({\in}{\mathbb{R}}^{M{\times}N})$ where B is the maximum value among the squared norm of columns of H. This implies that the complexity of the lattice reduction algorithm depends only on the matrix size and the lattice basis norm. However, the matrix structures (i.e., the correlation among the columns) of a given lattice matrix, which is usually measured by its condition number or determinant, can affect the computational complexity of the LR algorithm. In this paper, to see how the matrix structures can affect the LLL algorithm's complexity, we derive a more tight upper bound on the complexity of LLL algorithm in terms of the condition number and determinant of a given lattice matrix. We also analyze the complexities of the LLL updating/downdating schemes using the proposed upper bound.