• Journal of Korean Society of Environmental Engineers
• /
• v.31 no.4
• /
• pp.300-307
• /
• 2009

The transport of landfill leachate in the subsurface formations of unlined landfill sites is considered. The impacts of hydrogeological and chemical heterogeneities on the leachate transport are assessed by examining the results from a series of Monte-Carlo simulations. The landfill system simulated in this study is hypothetically represented with three levels of spatial variability for the hydrogeological and chemical parameter; (1) homogeneous hydraulic conductivity (K) and distribution coefficient ($K_d$), (2) K heterogeneity only, and (3) combined heterogeneities of K and $K_d$. To calculate the transport of leachate through negatively-correlated random hypothetical K-$K_d$ fields generated using geostatistical input parameters, a saturated flow model is linked with a contaminant transport model. Point statistic values such as mean, standard deviation, and coefficient of variation of the concentration were obtained from 100 Monte-Carlo trials. Results of point statistics show that the heterogeneities of K and $K_d$ in the landfill site prove to be an important parameter in controlling leachate concentrations. Consideration of combined K and $K_d$ heterogeneities results in enhancing the variability of contaminant transport. The variability in the leachate concentration for different realizations also increases as the distance between source and monitoring well increase.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.226-238
• /
• 2007

In this paper, we present a novel fully distributed topology control protocol that can construct the multiple-ring topology of Minimal Connected Dominating Set (MCDS) as the transport backbone for mobile ad hoc networks. It makes a topology from the minimal nodes that are chosen from all the nodes, and the constructed topology is comprised of the minimal physical links while preserving connectivity. This topology reduces the interference. The all nodes work as the nodes of the distributed parallel Boltzmann machine, of which the objective function is consisted of two Boltzmann factors: the link degree and the connection domination degree. To define these Boltzmann factors, we extend the Connected Dominating Set into a fuzzy set, and also define the fuzzy set of nodes by which the multiple-ring topology can be constructed. To construct the transport backbone of the mobile ad hoc network, the proposed protocol chooses the nodes that are the strong members of these two fuzzy sets as the clusterheads. We also ran simulations to provide the quantitative comparison against the related works in terms of the packet loss rate and the energy consumption rate. As a result, we show that the network that is constructed by the proposed protocol has far better than the other ones with respect to the packet loss rate and the energy consumption rate.

• Korean Chemical Engineering Research
• /
• v.48 no.1
• /
• pp.80-87
• /
• 2010

Lignite of low rank coal and petroleum coke of high sulfur content can be high potential energy sources for coal gasification process because of their plentiful supply. The kinetic study of steam gasification has been performed in an atmospheric thermobalance with wood chip, lignite, bituminous, anthracite, pet-coke. The effects of gasification temperature($600{\sim}850^{\circ}C$) and partial pressure of steam(30~90 kPa) on the gasification rate have been investigated. The modified volumetric reaction model was applied to the experimental data to describe the behavior of carbon conversion and to evaluate the needed kinetic parameters. Lignite and wood chip with high volatile content showed high average gasification rates comparing to other fuel and thus they might be proper fuel for gasification processes. The activation energies for wood chip, lignite, bituminous, anthracite, and pet-coke through Arrhenius plot were found to be 260.3, 167.9, 134.6, 82.2, 168.9 kJ/mol, respectively. The expression of apparent reaction rates for steam gasification of various chars have been proposed as basic information for the design of coal gasification processes.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.2
• /
• pp.1-7
• /
• 2002

The fast extraction of the silhouettes of a model is very useful for many applications in computer graphics and animation. In this paper, we present an efficient algorithm to compute a sequence of perspective silhouettes for a polyhedral model from a moving viewpoint. The viewpoint is assumed to move along a trajectory q(t), which is a space curve of a time parameter t. Then, we can compute the time-intervals for each edge of the model to be contained in the silhouette by two major computations: (i) intersecting q(t) with two planes and (ii) a number of dot products. If q(t) is a curve of degree n, then there are at most of n + 1 time-intervals for an edge to be in a silhouette. For each time point $t_i$ we can extract silhouette edges by searching the intervals containing $t_i$ among the computed intervals. For the efficient search, we propose two kinds of data structures for storing the intervals: an interval tree and an array. Our algorithm can be easily extended to compute the parallel silhouettes with minor modifications.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2001.12a
• /
• pp.413-426
• /
• 2001

본 연구는 첫째, 정보통신기술의 발달이 시각장애인 복지 증진에 미칠 수 있는 가능성에 대한 이론적인 부분을 고찰하였다. 둘째, 우리나라 시각장애인 정보화의 문제점과 해결책을 도출하였고 셋째, 시각장애 사용자를 위한 전자상거래 인터페이스 디자인의 분석 및 설계를 통해 전자상거래에서 시각장애 사용자들이 큰 제약없이 사용할 수 있는 방안을 제시하고자 한다. 현재 시각장애인들의 웹 사용을 보면 시각장애 전용 S/W의 보조 하에 사용을 하고 있다. 그러한 보조 도구의 실정에 맞도록 텍스트 버전 및 Non-Frame버전, Alt-Text 옵션, 캡션 등을 넣어 접근성을 확보하고 인터넷을 큰 제약을 받지않고 이용할 수 있도록 웹 페이지의 설계가 필요한 실정이다. 이를 위하여 먼저 시각장애에 대한 개념과 원인 및 종류 그리고 특성을 통해 시각장애인에 대한 이론적 배경을 파악하였다. 그리고 시각장애인의 정보화 환경과 이용 현황과 시각장애인의 정보 접근을 제도적, 기기 및 소프트웨어 개발 측면에서 분석을 하였고, 장애인을 위한 정보통신기술 중 대표적인 사례를 검토해 보았다. 다음으로 국내외의 대표적인 전자상거래 사이트에서의 인터페이스를 화면구성(Layout), 텍스트(Text), 그래픽(Graphic), 멀티미디어(MultiMedia) 측면에서 분석을 하였다. 분석한 내용을 바탕으로 시각장애 사용자의 입력(User Input) 부분을 고려한 인터페이스 방향을 제시하고 프로토타입을 개발하여 시험 대상 사이트와의 만족도를 시각장애 사용자를 통해 비교 ·분석하였다. 결론부분에서는 정보불평등을 해소하고, 정보통신기술이 장애인의 복지향상에 기여하도록 하기 위해 전자상거래 싸이트에서의 시각 장애인들을 위한 방향을 제시하고자 한다.박의 표현, 등록 및 색인방법 (c) 공급 선박의 분류와 표현 방법 (d) 에이전트의 정보 수집을 위한 메시지 표현 방법 (e) 수집된 선박정보의 데이터베이스 저장 표현방법 (f) 요구 선박을 찾아주는 정보제공 서비스가 요구된다.동을 보여 조사대상 5호분, 6호분, 7호분, 중 가장 심한 거동을 보이고 있다. 이는 고분 벽돌의 깨짐이 6호분이 가장 심하다는 사실과 무관하지 않은 것으로 판단된다. 봉분내부의 토양층구조에 대한 지오레이다 영상단면을 분석한 결과 무령왕릉 연도상부의 누수지방지층이 심하게 균열되어 있음을 발견하였다. 이 곳은 고분내부로 직접누수가 발생하는 곳이다. 직접누수와 지하수 형태로 유입된 침투수는 고분군 주위의 지반의 함수비를 증가시켜 지반의 지지력을 약화시키고 또한 고분내로 서서히 유입되어 고분내부의 습도를 100%로 유지시키는 주된 원인이다. 이러한 높은 습도는 고분내의 남조류의 번식을 가져왔으며 남조류의 번식은 현재 6호분이 가장 심각하고 7호분이 우려되는 수준이며 5호분은 문제가 없는 것으로 판단된다. 이와 같이 고분군의 발굴후 인위적인 환경변화와 지속적인 강우침투 및 배수 불량의 영향은 고분군의 안정성에 상당한 위험을 초래하였으며, 현 상태는 각 고분에 대한 보강이 불가피한 것으로 판단된다. 고분 벽돌의 깨짐, 고분 벽체의 거동, 조류의 서식등을 포함하여 송산리 고분군에서 발생되고 있는 보존상의 제반 문제점들을 일차적으로 누수 및 침투수에 의한 결과이다. 그러므로 무엇보다도 고분군 내부 및 고분 주변으로의 강우 및 지하수 침투를 막는 차수 대책이 시급한 것으로 판단된다. 또한 이미 발생한 변위가 더 이상 진행되지 않도록 하중을 경감하고 토압의 균형을 이루는 보강대책이 시급한 실정이다. 고분군

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.3
• /
• pp.18-31
• /
• 2002

In this study, we introduce a concept of advanced neurofuzzy polynomial networks(ANFPN), a hybrid modeling architecture combining neurofuzzy networks(NFN) and polynomial neural networks(PNN). These networks are highly nonlinear rule-based models. The development of the ANFPN dwells on the technologies of Computational Intelligence(Cl), namely fuzzy sets, neural networks and genetic algorithms. NFN contributes to the formation of the premise part of the rule-based structure of the ANFPN. The consequence part of the ANFPN is designed using PNN. At the premise part of the ANFPN, NFN uses both the simplified fuzzy inference and error back-propagation learning rule. The parameters of the membership functions, learning rates and momentum coefficients are adjusted with the use of genetic optimization. As the consequence structure of ANFPN, PNN is a flexible network architecture whose structure(topology) is developed through learning. In particular, the number of layers and nodes of the PNN are not fixed in advance but is generated in a dynamic way. In this study, we introduce two kinds of ANFPN architectures, namely the basic and the modified one. Here the basic and the modified architecture depend on the number of input variables and the order of polynomial in each layer of PNN structure. Owing to the specific features of two combined architectures, it is possible to consider the nonlinear characteristics of process system and to obtain the better output performance with superb predictive ability. The availability and feasibility of the ANFPN are discussed and illustrated with the aid of two representative numerical examples. The results show that the proposed ANFPN can produce the model with higher accuracy and predictive ability than any other method presented previously.

• Journal of the Korean Society of Radiology
• /
• v.8 no.7
• /
• pp.455-459
• /
• 2014

We grew the $Li_6Gd(BO_3)_3:Ce^{3+}$ scintillator and determined the scintillation and thermoluminescence properties for X-rays. The emission spectrum of $Li_6Gd(BO_3)_3:Ce^{3+}$ is located in the range of 370~500 nm, peaking at 423 nm an 455 nm, due to the $4f{\rightarrow}5d$ transition of $Ce^{3+}$ ions. The fluorescence decay time of the crystal is composed three components. The fast component is 60 ns (25%), the intermediate component is 787 ns (29%) and the slow component is $5.9{\mu}s$ (46%) of the crystal. The after-glow is caused by the electron and hole traps in the crystal lattice. We determined physical parameters of the traps in the crystal. The thermoluminescence trap are composed two traps. The determined activation energy (E), kinetic order (m) and frequency factor (s) of the first trap are 0.65 eV, 1.01 and $6.9{\times}10^8s^{-1}$. And, the determined activation energy, kinetic order and frequency factor of the second trap are 0.96 eV, 1.79 and $3.1{\times}10^{12 }s^{-1}$, respectively.

• Tunnel and Underground Space
• /
• v.8 no.3
• /
• pp.209-225
• /
• 1998

Recently, Umbrella Arch Method(UAM), one of the auxiliary techniques for tunnelling, is used to reinforce the ground and improve stability of tunnel face. Because UAM combines the advantages of a modern forepoling system with the grouting injection method, this technique has been applied in subway, road and utility tunnel sites for the last few years in Korea. Also, several research results are reported on the examination of the roles of inserted pipes and grouted materials in UAM. But, because of its empirical design and construction methodology, more qualitative and systematic design sequences are needed. Therefore, above sequences using numerical analysis are proposed and, the effects of some design parameters were studied in this research. In order to acco,mplish these objects, first, the roles of pipe and grouting materials, steel-rib and the others in ground improving mechanism of UAM are clarified. Second, the effects of design parameters are investigated through parametric studies. Design parameters are as follows; 1) ground condition, 2) overburden, 3) geometrical formulation of pipes, 4) grouting region and 5) characteristics of pipes.

• Phonetics and Speech Sciences
• /
• v.11 no.4
• /
• pp.97-108
• /
• 2019

An automated Praat script was implemented to measure optimal formant frequencies for adults. Optimal formant analysis could be interpreted to show that the deviation of formant frequency that resulted from the two variously combined setting parameters (maximum formant and number of formants) was minimal. To increase the reliability of formant analysis, LPC order should be set differently, based on the gender or vowel type. Praat recommends 5,000 Hz and 5,500 Hz as maximum formant settings and, at the same time, recommends 5 as the number of formants for males and females. However, verification is needed to determine whether these recommended settings are valid for Korean vowels. Statistical analysis showed that formant frequencies significantly varied across the adapted scripts, especially with respect to the data on females. Formant plots and statistical results showed that linear_script and qtone_script are much more reliable in formant measurements. Among four kinds of scripts, the linear and qtone_scripts proved to be more stable and reliable. While the linear_script was designed to have a linearly increased formant step in for-loop, the increment of formant step in the qtone_script was arranged by quarter tone scale (base frequency×common ratio ($\sqrt[24]{2}$)). When looking at the tendency of the formant setting drawn by the two referred algorithms in the context of front vowel [i, e], the maximum formant was set higher; and the number of formants set at a lower value than recommended by Praat. The back vowel [o, u], on the contrary, has a lower maximum formant and a higher number of formants than the standard setting.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.263-269
• /
• 2014

In this paper, I disprove Hadwiger conjecture of the vertex coloring problem, which asserts that "All $K_k$-minor free graphs can be colored with k-1 number of colors, i.e., ${\chi}(G)=k$ given $K_k$-minor." Pursuant to Hadwiger conjecture, one shall obtain an NP-complete k-minor to determine ${\chi}(G)=k$, and solve another NP-complete vertex coloring problem as a means to color vertices. In order to disprove Hadwiger conjecture in this paper, I propose an algorithm of linear time complexity O(V) that yields the exact solution to the vertex coloring problem. The proposed algorithm assigns vertex with the minimum degree to the Maximum Independent Set (MIS) and repeats this process on a simplified graph derived by deleting adjacent edges to the MIS vertex so as to finally obtain an MIS with a single color. Next, it repeats the process on a simplified graph derived by deleting edges of the MIS vertex to obtain an MIS whose number of vertex color corresponds to ${\chi}(G)=k$. Also presented in this paper using the proposed algorithm is an additional algorithm that searches solution of ${\chi}^{{\prime}{\prime}}(G)$, the total chromatic number, which also remains NP-complete. When applied to a $K_4$-minor graph, the proposed algorithm has obtained ${\chi}(G)=3$ instead of ${\chi}(G)=4$, proving that the Hadwiger conjecture is not universally applicable to all the graphs. The proposed algorithm, however, is a simple algorithm that directly obtains an independent set minor of ${\chi}(G)=k$ to assign an equal color to the vertices of each independent set without having to determine minors in the first place.