• KSBB Journal
• /
• v.15 no.1
• /
• pp.60-65
• /
• 2000

In order to predict the chromatogram for organic acid in ion chromatography, Langmuir isotherm parameters were obtained by Retention Time Method (RTM) and moment method. Ion chromatography analysis for formic acid was performed and compared with theoretically predicted profiles under isocratic condition. Band profiles were estimated with the equilibrium-dispersive model of chromatography using a PDEsolver Macsyma . The relationship between the characteristics of chromatogram and the variable operating condition in chromatography such as the flow rate, ionic strength and injection volume was studied. Satisfactory agreement was observed between the experimental and the estimated chromatograms with parameters obtained form the moment method.

• 정보저장시스템학회:학술대회논문집
• /
• 2005.10a
• /
• pp.139-144
• /
• 2005

Because of the photorefractive recording dynamics, each newly recorded hologram partially erases all previously stored image. Thus achieving the desired diffraction efficiency profile for the entire sequence after all images have been recorded requires exposure time schedule. The often cited classical exposure-schedule model predicts a rising-exponential build-up and an exponential decay in An with an exposure time. However because we cannot directly measure the An, it's difficult to establish the relation of both. In this paper, we deduce the relation of diffraction efficiency and exposure time from experiment data and suggest an algorithm to make time schedule profile in angle/fractal multiplexing of holographic data storage. After that, we present simulated result with equal hologram diffraction efficiency for a sequence of 250 holograms recorded by angle/fractal multiplexing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7C
• /
• pp.733-742
• /
• 2003

Unlikely unicast transmission, there are many elements that threaten security. Thus, key management of creating and distributing group keys to authorized group members is a critical aspect of secure multicast operations. To offer security in multicast environment, the recent researches are related to most group key distribution. In this thesis, we propose a group key management protocol for efficient, scalable, and multicast operation. This proposed protocol architecture can distribute traffic centralized to the key server. since the group key rekeyed by sub-group manager. The detailed simulation compared with other group key management protocol show that the proposed group key management protocol is better for join, leave, and data latency.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.157-162
• /
• 2002

In this study, the secure Internet phone system using digital signature and data encryption with DES algorithm and EDE algorithm was implemented. And new key distribution algorithm was suggested utilizing the Diffie-bellman algorithm. For reducing processing time, a table combined with S-BOX and P-BOX of the DES was used. The proposed system was implemented with Java and the results showed the processing time using DES algorithm for encryption was 1.46 seconds and that of EDE algorithm was 3.25 seconds respectively. This system can be applied to Protect the copyright of sound products and data using internet.

• Journal of Internet Computing and Services
• /
• v.2 no.3
• /
• pp.81-92
• /
• 2001

The clustering environment with heterogeneous workstations provides the cost effectiveness and usability for executing applications in parallel. The load balancing is considered as a necessary feature for the clustering of heterogeneous workstations to minimize the turnaround time. Since each workstation may have different users, groups. requests for different tasks, and different processing power, the capability of each processing unit is relative to the others' unit in the clustering environment Previous works is a static approach which assign a predetermined weight for the processing capability of each workstation or a dynamic approach which executes a benchmark program to get relative processing capability of each workstation. The execution of the benchmark program, which has nothing to do with the application being executed, consumes the computation time and the overall turnaround time is delayed. In this paper, we present an efficient task distribution method and implementation of load balancing system for the clustering environment with heterogeneous workstations. Turnaround time of the methods presented in this paper is compared with the method without load balancing as well as with the method load balancing with performance evaluation program. The experimental results show that our methods outperform all the other methods that we compared.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.162-169
• /
• 2022

In a dynamically changing time-varying network environment, the optimal moving pattern of edge devices can be applied to distributing computing resources to edge cloud servers or deploying new edge servers in the FEC(Fog/Edge Computing) environment. In addition, this can be used to build an environment capable of efficient computation offloading to alleviate latency problems, which are disadvantages of cloud computing. This paper proposes an algorithm to extract the optimal moving pattern by analyzing the moving path of multiple edge devices requiring application services in an arbitrary spatio-temporal environment based on frequency. A comparative experiment with A^* and Dijkstra algorithms shows that the proposed algorithm uses a relatively fast execution time and less memory, and extracts a more accurate optimal path. Furthermore, it was deduced from the comparison result with the A^* algorithm that applying weights (preference, congestion, etc.) simultaneously with frequency can increase path extraction accuracy.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1356-1358
• /
• 2007

데이터 병합은 무선 센서 네트워크에서 발생하는 통신량 축소로 에너지 소비의 최소화를 달성하기 위해 적용되는 기법이다. 이런 데이터 병합의 시간 제어는 종단간 지연시간을 최적화하면서 병합 시간의 적응적인 조절로 WSNs의 성능을 크게 향상시킬 수 있다. 따라서 본 논문은 WSNs에서 데이터 정확성과 종단간 지연시간 사이에 발생하는 상충조건의 최적화를 위해 무선 손실을 고려한 적응성 있는 타이밍 제어 프로토콜을 설계하였다. 이 프로토콜은 무선 손실의 변화에 적응성을 있는 데이터 병합을 수행할 수 있도록 선택적 참여율과 중요도를 결정함으로써 네트워크 전체에 패킷 전송 횟수를 균등하게 분배하여 전체 네트워크 안정성을 높일 수 있도록 하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.74-78
• /
• 2001

무선 ATM망에서 VBR 서비스는 매 순간마다 대역폭 요구 사항이 가변적이기 때문에 채널의 효율적 분배가 어려운 실정이다. 본 논문에서는 무선 ATM망에서 VBR 트래픽을 서비스하기 위하여 지연 시간이 부족한 패킷들에게 우선순위를 부여하는 슬롯 할당 알고리즘을 제안한다. 제안한 방법에서 단말기는 VBR 트래픽의 변화정보를 미니 셀에 피기백하고, 이를 예약방식으로 기지국에 전송한다. 한편 기지국에서는 각 단말기가 전송한 트래픽의 변화정보를 기반으로 슬롯을 할당한다. 슬롯 할당에 있어서 기지국은 전송을 요구한 패킷들의 최대 전송지연 허용 시간과 요청한 슬롯 수를 확인한 후, 요구한 슬롯을 다음 프레임에 즉시 할당하지 않고, 최대 전송지연 허용 시간 범위 내에서 전송지연 시간이 적은 패킷에 우선적으로 슬롯을 할당한다.

• Journal of Labour Economics
• /
• v.37 no.2
• /
• pp.49-78
• /
• 2014

This paper examines the impacts of introducing Five-day school week in South Korean on adolescents' time use. Exploiting the exogenous variation in the adolescents' time at school on Saturday, I estimate the causal effect of change of adolescents' discretion time on their time use. The main findings are as follows. The introduction of the five day school week increased the adolescents' discretion time and their time spent on sleeping, passive leisure(mainly watching television). A one-minute decrease in the adolescents' time at school increase their sleeping time by 0.46 minute and passive leisure time by 0.26 minute.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.247-249
• /
• 2004

노드가 네트워크에 참여하고 다른 노드와 통신을 하기 위해서는 관리자가 수동으로 해당 노드를 설정하거나 네트워크 상의 DHCP 서버로부터 자동 설정이 가능해야 한다. 그러나 이러한 방법은 인프라 구조가 없는 이동 애드혹 네트워크에서는 실용적이지 못하다. 본 논문은 이동 애드혹 네트워크에 참여하려는 새로운 노드가 충돌 없이 효율적으로 IP 주소를 획득할 수 있는 LDAP 알고리즘을 제시한다 LDAP 알고리즘에서는 모든 노드가 모든 IP 주소에 대한 주소 풀(address pool)을 가지고 있으며 새롭게 네트워크에 참여하는 노드에게 주위 노드가 주소 풀을 분배하는 방식으로 동작한다. 모의 실험을 통하여 제안된 기법이 기존에 제시된 알고리즘에 비하여 주소 설정 시간과 통신 오버헤드 측면에서 우수한 성능을 보임을 증명한다.