• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• 제22권5호
• /
• pp.182-199
• /
• 2023

Since 2021, government departments have been promoting Automated Driving Technology Development and Innovation Project as national research and development(R&D) project. The automated vehicles and service technologies developed as part of these projects are planned to be subsequently provided to the public at the selected Living Lab City. Therefore, it is important to determine a spatial area and operation section that enables safe and stable automated driving, depending on the purpose and characteristics of the target service. In this study, the static Operational Design Domain(ODD) elements for Level 4 automated driving services were reclassified by reviewing previously published papers and related literature surveys and investigating field data. Spatial analysis techniques were used to consider the reclassified ODD elements for level 4 in the real area of level 3 automated driving services because it is important to reflect the spatial factors affecting safety related to real automated driving technologies and services. Consequently, a total of six driving mode changes(disengagement) were derived through spatial information analysis techniques, and the factors affecting the safety of automated driving were crosswalk, traffic light, intersection, bicycle road, pocket lane, caution sign, and median strip. This spatial factor analysis method is expected to be useful for determining special areas for the automated driving service.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제23권5호
• /
• pp.151-158
• /
• 2023

The researchers entirely focused on meta-heuristic method for generalized assignment problem(GAP) that is known as NP-hard problem because of the optimal solution within polynomial time algorithm is unknown yet. On the other hand, this paper proposes a heuristic greedy algorithm with rules for finding solutions. Firstly, this paper reduces the weight matrix of original data to w_ij ≤ b_i/l in order to n jobs(items) pack m machines(bins) with l = n/m. The maximum profit of each job was assigned to the machine for the reduced data. Secondly, the allocation was adjusted so that the sum of the weights assigned to each machine did not exceed the machine capacity. Finally, the k-opt swap optimization was performed to maximize the profit. The proposed algorithm is applied to 50 benchmarking data, and the best known solution for about 1/3 data is to solve the problem. The remaining 2/3 data showed comparable results to metaheuristic techniques. Therefore, the proposed algorithm shows the possibility that rules for finding solutions in polynomial time exist for GAP. Experiments demonstrate that it can be a P-problem from an NP-hard.

• Journal of the Korean Society of Marine Environment & Safety
• /
• 제29권6호
• /
• pp.562-575
• /
• 2023

In an effort to improve water quality, the South Korean government has implemented measures to increase seawater circulation in Saemangeum Lake. We analyzed the effect of increasing the frequency of seawater circulation based on salinity levels and bottom water exchange in the lake, using an environmental fluid dynamics code model. When the sluice gate opening and shutting frequency increased from once to twice per day, the internal water level of Saemangeum Lake increased by up to ~0.7 m. The salinity increased by 2.12 psu near the western breakwater and decreased by 1.18 psu near the freshwater inlet. We analyzed the extent of bottom water exchange using a particle tracing method and observed that the residual rate of particles shallower than 5 m in water depth decreased by 2.52% in Case 2 (opening and shutting twice per day) compared to Case 1 (opening and shutting once per day). This indicates that increasing the frequency of sluice gate opening and shutting would promote enhanced bottom water exchange. Consequently, the increased salinity and bottom water exchange associated with increased seawater circulation are expected to improve water quality in Saemangeum Lake.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• 제23권2호
• /
• pp.79-88
• /
• 2024

We used actual field data to analyze from a traffic engineering perspective how AI and edge computing technologies affect the reduction of traffic accidents. By providing object information from 20m behind with AI object recognition, the driver secures a response time of about 3.6 seconds, and with edge technology, information is displayed in 0.5 to 0.8 seconds, giving the driver time to respond to intersection situations. In addition, it was analyzed that stopping before entering the intersection is possible when speed is controlled at 11-12km at the 10m point of the intersection approach and 20km/h at the 20m point. As a result, it was shown that traffic accidents can be reduced when the high object recognition rate of AI technology, provision of real-time information by edge technology, and the appropriate speed management at intersection approaches are executed simultaneously.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제24권1호
• /
• pp.37-42
• /
• 2024

This paper suggests polynomial time algorithm for cutwidth minimization problem that classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. To find the minimum cutwidth CW_f(G)=max_𝜈∈_VCW_f(𝜈)for given graph G=(V,E),m=｜V｜, n=｜E｜, the proposed algorithm divides neighborhood N_G[𝜈_i] of the maximum degree vertex 𝜈_i in graph G into left and right and decides the vertical cut plane with minimum number of edges pass through the vertex 𝜈_i firstly. Then, we split the left and right N_G[𝜈_i] into horizontal sections with minimum pass through edges. Secondly, the inner-section vertices are connected into line graph and the inter-section lines are connected by one line layout. Finally, we perform the optimization process in order to obtain the minimum cutwidth using vertex moving method. Though the proposed algorithm requires O(n²) time complexity, that can be obtains the optimal solutions for all of various experimental data

• Journal of the Korean GEO-environmental Society
• /
• 제25권6호
• /
• pp.19-24
• /
• 2024

Urban densification has necessitated the development of subterranean spaces such as subway networks and underground tunnels to facilitate the dispersal and movement of populations. Development of these underground spaces requires excavation from the ground surface, which can induce groundwater flow and potentially lead to ground subsidence and sinkholes, damaging structures. To mitigate these risks, it is essential to model groundwater flow prior to construction, analyze its characteristics, and predict potential groundwater discharge during excavation. In this study, we collected meteorological, topographical, and soil conditions data for the city of ○○, where tunnel construction was planned. Using the Visual MODFLOW program, we modeled the groundwater flow. Excavation sections were set as drainage points to monitor groundwater discharge during the excavation process, and the effectiveness of seepage control measures was assessed. The model was validated by comparing measured groundwater levels with those predicted by the model, yielding a coefficient of determination of 0.87. Our findings indicate that groundwater discharge is most significant at the beginning of the excavation. Additionally, the presence of seepage barriers was found to reduce groundwater discharge by approximately 59%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제24권2호
• /
• pp.99-104
• /
• 2024

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제24권2호
• /
• pp.105-111
• /
• 2024

This paper deals with the minimum linear arrangement(MinLA) of a lattice graph, to which an approximate algorithm of linear complexity O(n) remains as a viable solution, deriving the optimal MinLA of 31,680 for 33×33 lattice. This paper proposes a partitioning arrangement algorithm of complexity O(1) that delivers exact solution to the minimum linear arrangement. The proposed partitioning arrangement algorithm could be seen as loading boxes into a container. It firstly partitions m rows into r₁,r₂,r₃ and n columns into c₁,c₂,c₃, only to obtain 7 containers. Containers are partitioning with a rule. It finally assigns numbers to vertices in each of the partitioned boxes location-wise so as to obtain the MinLA. Given m,n≥11, the size of boxes C₂,C₄,C₆ is increased by 2 until an increase in the MinLA is detected. This process repeats itself 4 times at maximum given m,n≤100. When tested to lattice in the range of 2≤n≤100, the proposed algorithm has proved its universal applicability to lattices of both m=n and m≠n. It has also obtained optimal results for 33×33 and 100×100 lattices superior to those obtained by existing algorithms. The minimum linear arrangement algorithm proposed in this paper, with its simplicity and outstanding performance, could therefore be also applied to the field of Very Large Scale Integration circuit where m,n are infinitely large.

• Korean Journal of Environmental Agriculture
• /
• 제23권2호
• /
• pp.92-98
• /
• 2004

The adsorption and desorption of Pb, Cd, Co, Zn, Cr, Co, Ni, and Mo on the waste Undaria sp. were studied. Except for Pb. the mono adsorption rate for all heavy metals were lower than that of the heavy metals mixed. However, the adsorption capacity of the heavy metals by 1g of biosorption, in mixed heavy metals increased According to FT-IR analysis of the biosorbent after heavy metal biosorption, the replacement of the functional group by the heavy metals ions could be confirmed and the inverted peaks became larger after heavy metals adsorption. The adsorption equilibrium of heavy metals was reached in about 1 hour. The equilibrium parameters were determined based on Langmuir and Freundlich isotherms. The affinity of metals on the biosorbent decreased in the following order: Pb>Cu>Cr>Cd>Co. The desorption rate decreased in the following sequence: NTA>$H_2SO_4$>HCl>EDTA. The desorption rate of heavy metals by NTA increased with increase in the concentration from 0.1 to 0.3% but the desorption rate became constant beyond 0.3%. Therefore, it represented that desorption rate of heavy metals was suitable under optimized condition ($30^{\circ}C$, pH 2 and 0.3% NTA solution) and was fast with 80% or more the uptake occurring within 10 min of contact time.

• Proceedings of the Korean Geotechical Society Conference
• /
• 한국지반공학회 1991년도 추계학술발표회 논문집 지반공학에서의 컴퓨터 활용 COMPUTER UTILIZATION IN GEOTECHNICAL ENGINEERING
• /
• pp.87-102
• /
• 1991

It has been reported that the failure of Carsington Dam in Eng1and occured due to the existence of a thin yellow clay layer which was not identified during the design work, and due to pre-existing shears of the clay layer. The slope stability analyses during the design work, which utilized traditional circular arc type failure method and neglected the existence of the clay layer, showed a safety factor of 1.4. However, the post-failure analyses which utilized translational failure mode considering the clay layer and the pre-existing shear deformation revealed the reduction of safety factor to unity. The post-failure analysis assumed 10。 inclination of the horizontal forces onto each slice based on the results of finite element analyses. In this paper, Bishop's simplified method, Janbu method, and Morgenstern-Price method were used for the comparison of both circular and translational failure analysis methods. The effects of the pre-existing shears and subsquent movement were also considered by varying the soil strength parameters and the pore pressure ratio according to the given soi1 parameters. The results showed factor of safefy 1.387 by Bishop's simplified method(STABL) which assumed circular arc failure surface and disregarding yellow clay layer and pre-failure material properties. Also the results showed factor of safety 1.093 by Janbu method(STABL) and 0.969 by Morgenstern-Price method(MALE) which assumed wedge failure surface and considerd yellow clay layer using post failure material properties. In addition, dam behavior was simulated by Cam-Clay model FEM program. The effects of pore pressure changes with loading and consolidation, and strength reduction near or at failure were also considered based on properly assumed stress-strain relationship and pore pressure characteristics. The results showed that the failure was initiated at the yellow clay layer and propagated through other zones by showing that stress and displacement were concentrated at the yel1ow clay layer.