• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.26 no.5
• /
• pp.438-445
• /
• 1993

Spatial and seasonal variations of community structure of demersal fishes in Asan Bay were studied using seasonal samples collected by an otter trawl from autumn 1991 to summer 1992. For each sampling station, three trawl hauls were completed to obtain a reliable sample. Of 34 species identified, Cynoglossus joyneri, Johnius belengeri, Zoraces gillii and Thrissa koreana accounted for $93\%$ of the individuals collected. The former three dominant species were more abundant on the finer sediment of the inner bay than on the sandy bottom of the outer bay. Spatial variation of community structure of demersal fishes was analysed by principal component analysis using rank correlation. The community structure did not show a spatial difference, but a clear seasonal trend. This distribution pattern seems to be related significantly to the seasonal temperature fluctuation and to the active mixing of the water by strong tidal current of the bay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1937-1945
• /
• 1999

In paper, we propose a 3D polygonal mesh simplification technique based on vertex clustering. The proposed method differentiates the size of each cluster according to the local property of a 3D object. We determine the size of clusters by considering the normal vector of triangles and the vertex distribution. The subdivisions of cluster are represented by octree. In this paper, we use the Harsdorff distance between the original mesh and the simplified one as a meaningful error value. Because proposed method adaptively determine the size of cluster according to the local property of the mesh, it has smaller error as compared with the previous methods and represent the small regions on detail. Also it can generate a multiresolution model and selectively refine the local regions.

• Korean Journal of Environmental Biology
• /
• v.20 no.2
• /
• pp.146-151
• /
• 2002

The primary productivity and physicochemical factors were surveyed seasonally in Gangjin bay from February to October in 1998. The determination of the Primary Productivity Was performed in Situ by isotope-method using NaH/sup 14/CO/sub 3/. The range of primary productivity was 2.78 mgC m/sup -3/ hr/sup -1/-4.92 mgC m/sup -3/ hr/sup -1/ according to seasons. The primary productivity showed the highest value in summer, followed by those of winter, autumn and spring. The primary productivities of station 1, 2 which are located the upper area, were lower than those of station 3, 4, 5 and 6. The correlations showed that the primary productivity correlated with chlorophyll a, underwater light intensity but reversely correlated with suspended solids. These results suggested that the primary productivity in Gangjin Bay was mainly influenced by the inflow of freshwater from Tamjin River.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.103-111
• /
• 2014

This paper proposes a modified algorithm that improves on Dijkstra's algorithm by applying it to purely two-way traffic paths, given that a road where bi-directional traffic is made possible shall be considered as an undirected graph. Dijkstra's algorithm is the most generally utilized form of shortest-path search mechanism in GPS navigation system. However, it requires a large amount of memory for execution for it selects the shortest path by calculating distance between the starting node and every other node in a given directed graph. Dijkstra's algorithm, therefore, may occasionally fail to provide real-time information on the shortest path. To rectify the aforementioned shortcomings of Dijkstra's algorithm, the proposed algorithm creates conditions favorable to the undirected graph. It firstly selects the shortest path from all path vertices except for the starting and destination vertices. It later chooses all vertex-outgoing edges that coincide with the shortest path setting edges so as to simultaneously explore various vertices. When tested on 9 different undirected graphs, the proposed algorithm has not only successfully found the shortest path in all, but did so by reducing the time by 60% and requiring less memory.

• The Sea:JOURNAL OF THE KOREAN SOCIETY OF OCEANOGRAPHY
• /
• v.18 no.2
• /
• pp.70-79
• /
• 2013

Since crude oil contains various pollutants including heavy metals, the environmental impact should be assessed for heavy metals as well as oil itself. In order to estimate the extent of heavy metal contamination, surface sediments were collected at the intertidal and coastal zone around the Herbei sprit oil spill area during December 2007 and January 2008. Organic carbon, sulfur and heavy metals were determined to assess heavy metal contamination in sediments. The crude oils contained C, S, V and Ni, but little toxic metals such as As, Cd, etc. From organic carbon content, the highest contaminated site was estimated that oils contributed to sediments up to 10%, and this site showed high V concentration. Potentially contaminated sediments by crude oil could be differentiated from unaffected sediments through V/Al and Ni/Al ratios, which can be used as indicators of oil contamination even after the oils were fully degraded.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.5
• /
• pp.624-630
• /
• 2010

As electrocardiogram(ECG) signals are generally sampled with a frequency of over 200Hz, a method to compress diagnostic information without losing data is required to store and transmit them efficiently. In this paper, an ECG signal compression method, which uses feature points based on curvature, is proposed. The feature points of P, Q, R, S, T waves, which are critical components of the ECG signal, have large curvature values compared to other vertexes. Thus, these vertexes are extracted with the proposed method, which uses local extremum of curvatures. Furthermore, in order to minimize reconstruction errors of the ECG signal, extra vertexes are added according to the iterative vertex selection method. Through the experimental results on the ECG signals from MIT-BIH Arrhythmia database, it is concluded that the vertexes selected by the proposed method preserve all feature points of the ECG signals. In addition, they are more efficient than the AZTEC(Amplitude Zone Time Epoch Coding) method.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.1
• /
• pp.227-235
• /
• 2015

In this paper, I propose a linear time algorithm devised to produce exact solution to NP-complete maximum clique problem. The proposed algorithm firstly, from a given graph G=(V,E), sets vertex $v_i$ of the maximum degree ${\Delta}(G)$ as clique's major vertex. It then selects vertex $v_j$ of ${\Delta}(G)$ among vertices $N_G(v_i)$ that are adjacent to $v_i$, only to determine $N_G(v_i){\cap}N_G(v_j)$ as candidate cliques w and $v_k$. Next it obtains $w=w{\cap}N_G(v_k)$ by sorting $d_G(v_k)$ in the descending order. Lastly, the algorithm executes the same procedure on $G{\backslash}w$ graph to compare newly attained cliques to previously attained cliques so as to choose the lower. With this simple method, multiple independent cliques would also be attainable. When applied to various regular and irregular graphs, the algorithm proposed in this paper has obtained exact solutions to all the given graphs linear time O(n).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.3
• /
• pp.193-199
• /
• 2019

In this paper I propose an algorithm of linear time complexity for NP-complete Maximum Independent Set (MIS) problem. Based on the basic property of the MIS, which forbids mutually adjoining vertices, the proposed algorithm derives the solution by repeatedly selecting vertices in the ascending order of their degree, given that the degree remains constant when vertices ${\nu}$ of the minimum degree ${\delta}(G)$ are selected and incidental edges deleted in a graph of n vertices. When applied to 22 graphs, the proposed algorithm could obtain the MIS visually yet effortlessly. The proposed linear MIS algorithm of time complexity O(n) always executes ${\alpha}(G)$ times, the cardinality of the MIS, and thus could be applied as a general algorithm to the MIS problem.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.41 no.3
• /
• pp.191-200
• /
• 2021

This paper deals with the boundary conditions of the stress resultants at the mid-arc for free vibration analyses of the arch. The considered arch is a horseshoe symmetric elliptic arch. The work dealing with the boundary conditions of the deflection at both ends of the arch has already been reported in the open literature. This revisited paper aims to study the suitability of the boundary conditions of the stress resultants at the mid-arc to be replaced by the boundary condition at both ends. In this study, the boundary conditions of the stress resultants at the mid-arc are newly derived based on the theory of the previous work, and natural frequencies and mode shapes are obtained using the new boundary conditions of the stress resultants. The numerical results of this paper confirm that the new boundary conditions have been validated according to previous studies and results of finite element ADINA.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.129-137
• /
• 2010

Currently used shortest path search algorithms involve graphs with vertices and weighted edges between each vertex. However, when finding the shortest path with a randomly shaped obstacle(an island, for instance) positioned in between the starting point and the destination, using such algorithms involves high memory inefficiency and is significantly time consuming - all positions in the map should be considered as vertices and every line connecting any of the two adjacent vertices should be considered an edge. Therefore, we propose a new method for finding the shortest path in such conditions without using weighted graphs. This algorithm will allow finding the shortest obstacle bypass given only the positions of the obstacle boundary, the starting point and the destination. When the row and column size of the minimum boundary rectangle to include an obstacle is m and n, respectively, the proposed algorithm has the maximum time complexity, O(mn). This performance shows the proposed algorithm is very efficient comparing with the currently used algorithms.