• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1035-1038
• /
• 2008

가상 메모리의 스왑 저장 장치로서 플래시 메모리를 사용하는 경우, 시스템을 기동할 때 스왑 영역의 초기화를 위한 삭제 연산이 요구되어 기동 시간이 오래 걸리는 문제점이 있다. 본 논문에서는 스왑 영역의 플래시 메모리 내용을 모두 삭제하지 않고 일부만을 삭제함으로서 기동 시간을 줄일 수 있는 방법을 연구하였다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.11
• /
• pp.42-48
• /
• 1990

In this paper robust test generation for stuck-open faults in CMOS circuits is proposed. By obtaining initialization patterns and test patterns using the relationship of bit position and Hamming weight among input vectors for CMOS circuit test generation time for stuck-open faults can be reduced, and the problem of input transition skew which make fault detection difficult is solved, and the number of test sequences are minimized. Also the number of test sequences is reduced by arranging test sequences using Hamming distance between initialization patterns and test patterns for circuit.

• Geophysics and Geophysical Exploration
• /
• v.5 no.3
• /
• pp.178-184
• /
• 2002

For economy and convenience, seismic refraction survey is widely used in surveying for large civil engineering work. The purpose of this study is to obtain the numerical responses of various models using Kirchhoff migration, and to analyze its application to the real data processing. Synthetic traveltime curve was calculated by vidale's algorithm, and various models such as 2 or 3 layer model and irregular topography model are tested to simulate the response of real structure. In order to compare the effect of initial velocity model, true velocity models, inversion results by tomography, smooth velocity models are used as an initial guess. The responses of model data show that the algorithm of this study is more sensitive to initial velocity model than the reflection survey, so choosing a suitable initial velocity model will be the most important thing in real data processing.

• Journal of KIISE:Software and Applications
• /
• v.28 no.10
• /
• pp.757-763
• /
• 2001

This paper propose a new clustering algorithm called G-CLUS based on the relative gravitation. In this method every instance has the same mass at first. the gravitations among instances make each instance move to the attractive direction gradually and eventually natural clusters are formed without the initial seed and the number of clusters. Our proposed method can determine the number of clusters via a process of gravitational agglomeration and it can reduce the sensitivity to outliers by using the resultant of gravitation. We also improved the computational complexity by applying the concept of a cube to the proposed algorithm. In our experiments, we show the behavior of instance movement clustering process for each model, clustering process and the results for an example data set, and the results of comparison between the other clustering algorithm and our proposed. method.

• Journal of Internet of Things and Convergence
• /
• v.6 no.4
• /
• pp.15-19
• /
• 2020

In this paper, we propose a optimal CW(Conention Window) synchronization scheme in IEEE 802.11 WLANs. IEEE 802.11 WLANs support DCF(Distributed Coordination Function) mode for the MAC(Medium Access Control) operation. In DCF, the CW increases exponentially according to the collisions and becomes minimum CW according to the success of data transmissions. However, since the base minimum CW value is hardware or standard specific, the number of active stations and network status are not considered to determine the CW value. Even though the researches on optimal CW have beend conducted, they do not consider the optimal CW synchronization among mobile stations which occur network performance degradation. Therefore, this paper calculates the optimal CW value and shares it with mobile stations in the network.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.75-78
• /
• 2013

본 연구에서는 멀티코어 기반의 안드로이드 부팅 최적화 방법을 제안하고 있다. 안드로이드 부팅 구간 중 Zygote란 프로세스 초기화 과정 시 가장 많은 연산을 하고 있었으며 Zygote 내부의 4가지 기능 중 preload구간에서 병렬기법을 적용하였다. preload는 어플리케이션의 구동에 필요한 클래스들과 리소스를 순차적으로 가져오는 함수호출 구조로 이 함수호출 구조를 다른 프로세스로 분리시켜 독립적인 연산을 수행하였다. 제안 방법을 S5PV310 듀얼코어와 Exynos4412 쿼드코어에 적용시켰고 각각 14%와 12%의 성능향상 결과를 보였다.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 1996.11a
• /
• pp.15-24
• /
• 1996

로켓모타의 연소관은 구조적인 편의성 및 경량화를 위하여 도옴-실린더부와 실린더-노즐부에 나사체결방법을 많이 적용하고 있는데, 나사의 골부위에 집중응력이 발생하여 인장강도를 넘는 응력이 발생하는 경우가 있다. 본 연구에서는 나사의 골부위의 응력수준을 좀 더 정확히 예측하기 위하여 나사체결시 작용하는 조립 토오크에 의한 초기하중을 고려한 구조해석을 수행하였으며, 나사부위에 발생하는 응력이 항복강도를 초과하므로 정확한 해석을 위하여 탄소성해석을 수행하였다. 조립 토오크에 의한 초기하중은 나사체결 멈춤부에 음(-)의 접촉 간극을 부여하여 모델링하였으며, 조립 토오크의 크기는 나사체결 근접부에서 변형률을 측정하여 모사하였다. 해석결과 초기하중을 고려하여 구조해석을 수행하면 최대예상 작동압력에서 초기하중의 영향은 거의 나타나지 않았으며, 마찰계수를 감소시키면 최대응력이 감소하여 구조적 안전성이 증가할 것으로 판단된다.

• Korean Journal of Environmental Agriculture
• /
• v.7 no.2
• /
• pp.146-152
• /
• 1988

In order to examine the seasonal variation of organic and inorganic nitrogen compounds, nitrogen compounds in compost were determined at various composting periods. Total nitrogen, organic nitrogen and biodegradable nitrogen contents in compost were almost not changed, while nonbiodegradable nitrogen contents were increased a little with the lapse of composting time. But effective contents of total nitrogen, organic nitrogen and biodegradable nitrogen were decreased with the progress of composting, while effective contents of nonbiodegradable nitrogen were not changed during composting. Ammonium nitrogen contents in compost were highest at the start of composting, and then the contents were decreased with the lapse of composting time. But after turning the contents were increased again, and thereafter the contents were decreased with the progress of composting. Nitrate contents showed a tendency adverse to ammonium nitrogen contents. Organic nitrogens in organic matter in compost were increased slowly within 9 weeks after composting, and thereafter the contents were increased rapidly to 21 weeks after composting. Total nitrogen contents determined by $F{\"{o}}rster$ Method were higher than those determined by Kjeldahl Method. Total nitrogen contents determined by Kjeldahl Method were 6% higher than biodegradable nitrogen contents determined by $F{\"{o}}rster$ Method. Loss of nitrogen in compost was highest at early periods of composting and its losses determined by Kjeldahl Method and $F{\"{o}}rster$ Method in 30 weeks after composting were 50% and 48% of total nitrogen, respectively. Highly positive correlations were observed among total nitrogen determined by Kjeldahl Method, biodegradable nitrogen determined by Kjeldahl Method, total nitrogen determined by $F{\"{o}}rster$ Method and biodegradable nitrogen determined by $F{\"{o}}rster$ Method one another.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.1011-1013
• /
• 2014

2D/3D 입체영상의 변환을 위해 산업현장에서 아티스트가 경험적으로 양자화된 깊이 정보를 제작하고, 입력된 깊이 정보의 차이와 픽셀 간의 유사성을 이용하여 물체의 윤곽을 보존하는 한편, 실시간으로 평활화 과정을 수행하는 방법을 제안한다. 아티스트의 의도를 반영하기 위해 초기 입력한 깊이 정보를 바탕으로 적응적인 스무딩 파라미터를 할당함으로써 기존의 수작업을 반자동화하였다. 제안된 방법에서는 기존 방법의 평활화 단계에서 Domain Transformation 기법을 적용하고, 노이즈 제거 단계에서 양방향 필터를 적용하였다. 즉 산업 현장에서 문제점들을 해결하도록 알고리즘을 변형하여 기존 알고리즘의 성능을 개선하였다. 실험 결과는 제안된 방법이 기존의 제작 방법과 비교하여 적은 양자화 단계로 동일한 성능을 내는 것을 확인하였다.

• Journal of Korean Society of Steel Construction
• /
• v.13 no.5
• /
• pp.577-586
• /
• 2001

The objective of this study is the development of sizing and system shape discrete optime design algorithm which is based on the genetic algorithms (GAs). The algorithm can perform both size and shape optimum designs of space trusses. The developed algorithm was implemented in a computer program. The algorithm is known to be very efficient for the discrete optimization The genetic process selects the next design points based on the survivability of the current design points The evolutionary process evaluates the survivability of the design points selected from the genetic process in the genetic process of the simple genetic algorithms there are three basic operators : reproduction cross-over and mutation operators. The efficiency and validity of the developed discrete optimum design algorithm was verified by applying the algorithm to optimum design examples.