• Journal of Korean Society of Environmental Engineers
• /
• v.22 no.3
• /
• pp.565-573
• /
• 2000

Sewer pipe in Korea is generally constructed with concrete pipes. Moreover, the sewer system is susceptible to the corrosion problem due to the regulation employing anaerobic treatment processes, such as domestic sewage treatment facilities, nightsoil septic tanks and so on. The objective of this study is investigated to experimental test of $H_2S$ production rate affecting corrosion of sewer pipe in Korea. In this study, tube-type and sealed-type reactor were used to examine the reactions in the microorganism suspended growth and biofilm. Furthermore. concentration changes were investigated with COD and sulfate reduction in each reactor. Sulfide production rate was $50.4mg-H_2S/g-VSS{\cdot}d$ in the sealed-type reactor and in the tube-type biofilm reactor was $2.8{\sim}18.8g-H_2S/m^2{\cdot}d$.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.296-309
• /
• 2003

One of commercial applications of mobile computing is ATIS(Advanced Traveler Information Systems) in ITS(Intelligent Transport Systems). In ATIS, a primary mobile computing task is to compute the shortest path from the current location to the destination. In this paper, we have studied the shortest path re-computation problem that arises in the DRGS(Dynamic Route Guidance System) in ATIS where the cost of topological digital road map is frequently updated as traffic condition changes dynamically. Previously suggested methods either re-compute the shortest path from scratch or re-compute the shortest path just between the two end nodes of the edge where the cost change occurs. However, these methods we trivial in that they do not intelligently utilize the previously computed shortest path information. In this paper, we propose an efficient approximate shortest path re-computation method based on the dynamic window scheme. The proposed method re-computes an approximate shortest path very quickly by utilizing the previously computed shortest path information. We first show the theoretical analysis of our methods and then present an in-depth experimental performance analysis by implementing it on grid graphs as well as a real digital road map.

• Journal of KIISE:Software and Applications
• /
• v.35 no.11
• /
• pp.671-680
• /
• 2008

Motion capture devices have been utilized in producing several contents, such as movies and video games. However, since motion capture devices are expensive and inconvenient to use, motions segmented from captured data was recycled and synthesized to utilize it in another contents, but the motions were generally segmented by contents producers in manual. Therefore, automatic motion segmentation is recently getting a lot of attentions. Previous approaches are divided into on-line and off-line, where ow line approaches segment motions based on similarities between neighboring frames and off-line approaches segment motions by capturing the global characteristics in feature space. In this paper, we propose a graph-based high-level motion segmentation method. Since high-level motions consist of repeated frames within temporal distances, we consider similarities between neighboring frames as well as all similarities among all frames within the temporal distance. This is achieved by constructing a graph, where each vertex represents a frame and the edges between the frames are weighted by their similarity. Then, normalized cuts algorithm is used to partition the constructed graph into several sub-graphs by globally finding minimum cuts. In the experiments, the results using the proposed method showed better performance than PCA-based method in on-line and GMM-based method in off-line, as the proposed method globally segment motions from the graph constructed based similarities between neighboring frames as well as similarities among all frames within temporal distances.

• Journal of Korean Society of Transportation
• /
• v.18 no.4
• /
• pp.7-18
• /
• 2000

KS-SIGNAL, a traffic signal optimization model for coordinated arterials, is an optimization model using the mixed integer linear Programming that minimizes total delay on arterials by optimizing left-turn Phase sequences. However, the Previous version of KS-SIGNAL had a difficulty in reducing computation speed because the related variables and constraints multiply rapidly in accordance with the increase of intersections. This study is designed to propose a new model, improving optimizing computation speed in KS-SIGMAl, and evaluate it. This Paper Puts forth three kinds of methodological approaches as to achieve the above goals. At the first step to reduce run-time in the proposed model objective function and a few constraints are Partially modified, which replaces variable in related to queue clearance time with constant, by using thru-movements at upstream intersection and the length of red time at downstream intersection. The result shows that the run-time can be reduced up to 70% at this step. The second step to load the library in LINDO for Windows, in order to solve mixed integer linear programming. The result suggests that run-time can be reduced obviously up to 99% of the first step result. The third step is to add constraints in related to left-turn Phase sequences. The proposed methodological approach, not optimizing all kinds of left-turn sequences, is more reasonable than that of previous model , only in the view of reducing run-tim. In conclusion, run-time could be reduced up to 30% compared with the second results. This Proposed model was tested by several optimization scenarios. The results in this study reveals that signal timing plan in KS-SIGNAL is closer to PASSER-II (bandwidth maximizing model) rather than to TRANSYT-7F(delay minimizing model).

• Journal of Korean Society of Transportation
• /
• v.21 no.5
• /
• pp.41-48
• /
• 2003

Korea Claim Adjustor Association(KCAA) defines the near pedestrian crossing accidents as those accidents that occurred in the area within 25m from pedestrian crossing on the arterial road and within 15m from pedestrian crossing on other classes of road. Accidents between pedestrian crossing and stop line are classified as the accident near pedestrian crossing. Reviewing of current statute and court precedent, three kinds of traffic accidents which are accidents occurred in the pedestrian crossing. near pedestrian crossing and the area between pedestrian crossing and stop line. should be distinguished by different pedestrian contributory negligence. To find out how different they are. we surveyed transportation society members about the contributory negligence of traffic accidents between pedestrian crossing and stop line and the results are as follows : (1) The current two classification of pedestrian crossing accidents and near pedestrian crossing accidents should be changed to three classification of pedestrian crossing accidents that includes accidents on pedestrian crossing, near pedestrian crossing and between pedestrian crossing and the stop line. (2) For the pedestrian's contributory negligence, the least reasonability to pedestrian is accident on the pedestrian crossing. The next one is the accident between pedestrian crossing and stop line and the last is the accident near pedestrian crossing. (3) Pedestrian contributory negligence for accident by space is recommended as 〈table 8〉, 〈table 9〉, 〈table 10〉. (4) Contributory negligence rate of the accident on the pedestrian crossing during red light should be modified to be less than that of near pedestrian crossing.

• Journal of the Korean Geographical Society
• /
• v.49 no.3
• /
• pp.405-422
• /
• 2014

Two important issues in hedonic model are to specify accurate model and delineate submarkets. While the former has experienced much improvement over recent decades, the latter has received relatively little attention. However, the accuracy of estimates from hedonic model will be necessarily reduced when the analysis does not adequately address market segmentation which can capture the spatial scale of price formation process in real estate. Placing emphasis on improvement of performance in hedonic model, this paper tried to segment real estate markets in Gangnam-gu and Jungrang-gu, which correspond to most heterogeneous and homogeneous ones respectively in 25 autonomous districts of Seoul. First, we calculated variable coefficients from mixed geographically weighted regression model (mixed GWR model) as input for clustering, since the coefficient from hedonic model can be interpreted as shadow price of attributes constituting real estate. After that, we developed a spatially constrained data-driven methodology to preserve spatial contiguity by utilizing the SKATER algorithm based on a minimum spanning tree. Finally, the performance of this method was verified by applying a multi-level model. We concluded that submarket does not exist in Jungrang-gu and five submarkets centered on arterial roads would be reasonable in Gangnam-gu. Urban infrastructure such as arterial roads has not been considered an important factor for delineating submarkets until now, but it was found empirically that they play a key role in market segmentation.

• Journal of Korea Port Economic Association
• /
• v.31 no.1
• /
• pp.15-36
• /
• 2015

The purpose of this paper is "A Study on the Establishment of Distribution and Logistics System in the unified Korea". The main conclusion of this paper are as follows : North and South Korea shall conjunctionally foster the exchange and cooperation area and operate the joint pilot project to combine distribution and logistics system. To solve the problems of the maritime affairs, Fisheries, and international logistics, the cooperative agreement between North and South Korea will be needed to protect and develop of shipping, aviation and shipbuilding industry. Unification of two Koreas must be prepared as stage by stage ; ${\cdot}$Stage1(preparation period) : initiation of peace area. ${\cdot}$Stage2(development period) : forming the exchange and cooperation area ${\cdot}$Stage3(settlement period) : establishing peace belt on border area. After the unification, two Koreas must plan and undertake the construction of the distribution and logistics infrastructures, establishment of SCM system through Network and the connection to China through railway and road Network.

• Journal of Internet Computing and Services
• /
• v.15 no.6
• /
• pp.125-132
• /
• 2014

Since frequent pattern mining was proposed in order to search for hidden, useful pattern information from large-scale databases, various types of mining approaches and applications have been researched. Especially, frequent graph pattern mining was suggested to effectively deal with recent data that have been complicated continually, and a variety of efficient graph mining algorithms have been studied. Graph patterns obtained from graph databases have their own importance and characteristics different from one another according to the elements composing them and their lengths. However, traditional frequent graph pattern mining approaches have the limitations that do not consider such problems. That is, the existing methods consider only one minimum support threshold regardless of the lengths of graph patterns extracted from their mining operations and do not use any of the patterns' weight factors; therefore, a large number of actually useless graph patterns may be generated. Small graph patterns with a few vertices and edges tend to be interesting when their weighted supports are relatively high, while large ones with many elements can be useful even if their weighted supports are relatively low. For this reason, we propose a weight-based frequent graph pattern mining algorithm considering length-decreasing support constraints. Comprehensive experimental results provided in this paper show that the proposed method guarantees more outstanding performance compared to a state-of-the-art graph mining algorithm in terms of pattern generation, runtime, and memory usage.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.3
• /
• pp.112-123
• /
• 2012

Different from general roads, intersections are the points where roads having different geometric structure and traffic operation system are met, and thereby they have complicated road structure and environmental factors. Various changes in driving patterns such as collision between vehicles approaching from roads adjacent to intersections, sudden stop of vehicles upon stop sign, quick start upon green lights kept increasing traffic accidents. It is known that traffic accidents are mainly derived from human factors. This study, in order to find out factors affecting drivers' behaviors within intersections, measured physiological responses such as brain wave, sight, driving speed, and so on by using state-of-the-art measuring device. As to concentration brain wave at individual intersections, it was found out that brain wave of testes was higher at main Arterial and accident-prone intersections compared with that of subsidiary Arterial. In addition, it was detected that drivers' visual activity was widely distributed at accident-prone intersections, meaning that it enhanced cautious driving from nearby vehicles. As to major factors causing drivers' workloads, factors from nearby vehicles such as deceleration, acceleration, lane change of nearby vehicles appeared as direct factors causing drivers' workloads, clarifying that these factors were closely related to causes of traffic accidents at intersections. Results of this study are expected to be used as basic data for evaluation of safety at intersections in consideration of physiological response of drivers.

• 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.