• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.51 no.6
• /
• pp.539-543
• /
• 2006

Lodging is classified as root lodging caused by the loss of supporting force in the root, bending caused by the deformation of the stem and breaking where the stem breaks down as loads exceeding critical elasticity were applied. This research excluded breaking which is not in a state of equilibrium and tried to partition the level of lodging using an algebraic model in root lodging and stem lodging, or bending. When a vertical load was applied, the deformation of the stem of rice plant showed the form of a quadratic equation. The trace of the panicle neck in the process of lodging was an ellipse-shape. When loading was pure root lodging, the trace of the panicle neck became a circle of which culm length is the radius. When it was a pure stem lodging, the trace of the panicle neck is an ellipse of which major axis is culm length and minor axis is 0.64* culm length. When both stem lodging and root lodging occurred in a natural setting, the partitioning of lodging can be calculated by a formula using eccentricity of an ellipse, S=e*100/0.768(S is the ratio of stem lodging in the whole lodging, e is eccentricity of the ellipse). This method is expected to be useful in simple lodging partitioning. We could also calculate the partitioning of stem lodging and root lodging as units of angles as an accuracy method, by using a straight line calculated by differentiating a quadratic equation of stem deformation at the origin of the coordinates. These two methods for dividing root and stem lodging showed different values. However, each of them showed almost same values with different lodging degree in one plant.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.141-148
• /
• 2011

Most of the previous works on scene change detection algorithm focus on the detection of abrupt rather than gradual changes. In general, gradual scene change detection algorithms require heavy computation. Some of those approaches don't consider the error factors such as flashlights, camera or object movements, and special effects. Many scenes change detection algorithms based on the histogram show better performances than other approaches, but they have computation load problem. In this paper, we proposed a scene change detection algorithm with fast and accurate performance using the vertical and horizontal blocked slice images and their macro block informations. We apply graph cut partitioning algorithm for clustering and partitioning of video sequence using generated spatio-temporal histogram. When making spatio-temporal histogram, we only use the central block on vertical and horizontal direction for performance improvement. To detect camera and object movement as well as various special effects accurately, we utilize the motion vector and type information of the macro block.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.46
• /
• pp.33-49
• /
• 1998

In order to improve the performance of relational databases, one has to reduce the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to reduce the number of disk I/O accesses by vertically partitioning relation into fragments and allowing attribute replication to fragments if necessary. When zero-one integer programming model is solved by the branch-and-bound method, it requires much computing time to solve a large sized problem. Therefore, heuristic solutions using genetic algorithm(GA) are presented. GA in this paper adapts a few ideas which are different from traditional genetic algorithms, for examples, a rank-based sharing fitness function, elitism and so on. In order to improve performance of GA, a set of optimal parameter levels is determined by the experiment and makes use of it. As relations are vertically partitioned allowing attribute replications and saved in disk, an attribute replicating vertical partition method by GA can attain less access cost than non-attribute-replication one and require less computing time than the branch-and-bound method in large-sized problems. Also, it can acquire a good solution similar to the optimum solution in small-sized problem.

• Proceedings of the Korea Database Society Conference
• /
• 1997.10a
• /
• pp.504-514
• /
• 1997

관계형 데이터베이스의 성능을 향상시키는데 중요한 요소 중의 하나는 트랜잭션을 처리하기 위해 데이터를 디스크에서 주기억장치로 옮기는데 필요한 디스크 액세스(access) 횟수이다. 본 연구는 관계형 데이터베이스에서 트랜잭션을 처리할 때, 릴레이션(relation)을 수직분할하여 디스크에 단편(fragment)으로 저장하므로써 필요한 단편만 액세스하여 액세스 횟수를 감소시키는데 목적이 있다. 단편에 속성을 중복할당하여 수직분할하므로써 트랜잭션을 만족시키는 단편의 수를 감소시켜 중복할당을 고려하지 않은 방법보다 디스크 액세스 횟수를 감소시킬 수 있다. 갱신트랜잭션의 경우 하나의 속성이 갱신되면 중복된 속성을 모두 갱신하여야 하므로 액세스 횟수가 증가하지만, 조회트랜잭션의 경우 각 단편에 속성을 중복할당하여 액세스 횟수를 감소시킬 수 있다. 본 연구에서는 속성의 중복을 허용하여 단편을 구성하는 경우에 중복을 고려하지 않은 경우를 포함하므로 효과적으로 디스크 액세스 횟수를 감소시킬 수 있다. 본 연구에서는 중복할당을 고려하여 디스크의 액세스 횟수를 최소화시킬 수 있는 수직분할문제의 0-1 정수계획모형을 개발하고, 모형에 대한 최적해법으로 분지한계법을 제안한다.

• Journal of Multimedia Information System
• /
• v.4 no.1
• /
• pp.19-26
• /
• 2017

The compression of video for both full HD and UHD requires the inclusion of extra vertical lines to every video frame, named as the DTV essential hidden area (DEHA), for the effective functioning of the MPEG-2/4/H encoder, stream, and decoder. However, while the encoding/decoding process is dependent on the DEHA, the DEHA is conventionally viewed as a redundancy in terms of channel utilization or storage efficiency. This paper proposes a block mode DEHA method to more effectively utilize the DEHA. Partitioning video block images and then evenly filling the representative DEHA macroblocks with the average DC coefficient of the active video macroblock can minimize the amount of DEHA data entering the compressed video stream. Theoretically, this process results in smaller DEHA data entering the video stream. Experimental testing of the proposed block mode DEHA method revealed a slight improvement in the quality of the active video. Outside of this technological improvement to video quality, the attractiveness of the proposed DEHA method is also heightened by the ease that it can be implemented with existing video encoders.

• The Journal of Information Technology and Database
• /
• v.4 no.2
• /
• pp.3-19
• /
• 1998

관계형 데이터베이스 성능을 향상시키는데 중요한 요소 중의 하나는 트랜잭션을 처리하기 위해 데이터를 디스크에서 주 기억장치로 옮기는데 필요한 디스크 액세스(access) 횟수이다. 본 연구는 관계형 데이터베이스에서 트랜잭션을 처리할 때, 릴레이션(relation)을 속성의 중복할당을 허용하여 분할하고, 디스크에 단편(fragment)으로 저장하므로써 필요한 단편만을 액세스하여 디스크의 액세스 횟수를 줄이는 방법을 연구하였다. 본 연구에서는 속성의 중복할당을 허용하여 디스크의 액세스 횟수를 최소화시킬 수 있는 수직분할문제에 수리모형을 조회, 갱신트랙잭션을 모두 고려하여 0-1 정수계획법으로 개발하였다. 또한 모형에 대한 최적해법으로 분지한계법을 제안하였으며, 분지한계법으로 큰 문제를 푸는데는 많은 시간이 소요되므로 계산량을 줄일 수 있는 초기처리방법과 비용계산방법을 제안하였다. 속성의 중복을 허용하여 구한 해가 중복을 고려하지 않은 경우의 해보다 디스크 액세스횟수가 감소한 것으로 나타났으며, 갱신트랜？션의 수가 증가함에 따라 중복되는 속성의 수가 감소하는 결과를 나타내었다.

• The Sea:JOURNAL OF THE KOREAN SOCIETY OF OCEANOGRAPHY
• /
• v.18 no.4
• /
• pp.266-276
• /
• 2013

The ocean is the largest reservoir of carbon in the climate system. Atmospheric $CO_2$ is efficiently transferred to the deep ocean by a process called the biological carbon pump: photosynthetic fixation of $CO_2$ at the sea surface and remineralization of sinking organic carbon at depths are main causes for the vertical contrast of carbon in the ocean. The sequestered carbon to the deep ocean returns to the sea surface by ocean circulation. Part of the upwelled $CO_2$ leaks into the atmosphere through air-sea gas exchange. It has been suggested that the air-sea partitioning of carbon has varied in concert with the glacial-interglacial climate variations, due partly to changes in ocean circulation. In this review paper, we briefly summarize key concepts of the oceanic carbon pump. We also discuss the response of the air-sea carbon partitioning to change in ocean circulation in the context of the glacial-interglacial climate change.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.4
• /
• pp.487-494
• /
• 2022

With the recent demand for analysis using data, the size of the knowledge graph, which is the data to be analyzed, gradually increased, reaching about 82 billion edges when extracted from the web as a knowledge graph. A lot of knowledge graphs are represented in the form of Resource Description Framework (RDF), which is a standard of W3C for representing metadata for web resources. Because of the characteristics of RDF, existing RDF storages have the limitations of processing time overhead when converting and storing large amounts of RDF data. To resolve these limitations, in this paper, we propose a method of compressing and converting large amounts of RDF data into integer IDs using MapReduce, and vertically partitioning and storing them. Our proposed method demonstrated a high performance improvement of up to 25.2 times compared to RDF-3X and up to 3.7 times compared to H2RDF+.

• Journal of the Korean Recycled Construction Resources Institute
• /
• v.10 no.3
• /
• pp.219-226
• /
• 2022

In this experimental study, the effect of continuously changing the position of electromagnetic force using several coils and a relay switch on fracture energy was investigated. Normal mortar and steel slag mortar specimens in which 50 % and 100 % of sand was replaced with steel slag were cast and exposed to electromagnetic field. The electric field was induced by one coil without a relay switch as an existing method and by partitioning the coil and continuously changing the position using a relay switch. The fracture energy was calculated from the load-vertical displacement curve obtained from the experiment and compared with each other. As a result of the experiment, it was confirmed that the method of partitioning the coil and changing the position of electromagnetic force by using a relay switch is effective in increasing the fracture energy even if the same amount of power is used.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.2
• /
• pp.677-685
• /
• 2014

Despite the significant benefits of BIM (Building Information Modeling), it is not being vitalized for the facilities that are designed based on the horizontal and vertical alignments because of the lack of flexibility in manipulating surface models generated based on alignments. Alignment-based design produces a surface model in one piece through the definition of the typical cross-section along the alignment. Therefore, linking these alignment-based 3D surface models, that are not modularized and difficult to partition, to the required attribute information is very difficult This paper presents design of a flexible BIM technology suitable for the alignment-based civil infrastructure by providing the partitioning functionality for surface models, the contents library for cross-sectional design components, and the attribute information along with the critical functionalities needed for the design, construction and maintenance of alignment-based civil infrastructure.