• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1166-1176
• /
• 1999

연속 매체, 특히 비디오 데이타에 대한 일반 사용자 연산에는 재생뿐만 아니라 임의 속도 탐색 연산, 정지 연산, 그리고 그 외 다양한 연산이 있다. 이 연산 중에서 원하는 화면을 빨리 찾는 데에 유용한 고속 전진(FF: fast-forward)과 고속 후진(FB: fast-backward)은 재생 연산과는 달리 비순차적인 디스크 접근을 요구한다. 이러한 경우에 디스크 부하가 균등하지 않으면 일부 디스크에 접근이 편중되어 서비스 품질이 떨어진다. 본 논문에서는 디스크 배열을 이용한 저장 시스템에서 디스크 접근을 고르게 분산시키기 위하여 '소수 라운드 로빈(PRR: Prime Round Robin)' 방식으로 연속 매체를 디스크에 배치하는 기법에서 문제가 됐던 낭비된 디스크 저장 공간을 신뢰도 향상을 위해서 사용하는 '그룹화된 패리티를 갖는 소수 라운드 로빈(PRRgp: PRR with Grouped Parities)' 방식을 제안한다. 이 기법은 PRR 기법처럼 임의 속도 검색 연산에 있어서 디스크 배열을 구성하는 모든 디스크의 부하를 균등하게 할뿐만 아니라 낭비됐던 디스크 저장 공간에 신뢰도를 높이기 위한 패리티 정보를 저장함으로서 신뢰도를 향상시킬 수 있다. 신뢰도 모델링 방법으로 조합 모델과 마르코프 모델을 이용해서 결함발생율과 결함복구율을 고려한 신뢰도를 산출하고 비교.분석한다. PRR 기법으로 연속 매체를 저장하고 낭비되는 공간에 패리티 정보를 저장할 경우에 동시에 두 개 이상의 결함 발생 시에 그 결함으로부터 복구가 불가능하지만 PRRgp 기법에서는 약 30% 이상의경우에 대해서 동시에 두 개의 결함 발생 시에 저장한 패리티 정보를 이용한 복구가 가능할 뿐만 아니라 패리티 그룹의 수가 두 개 이상인 경우에는 두 개 이상의 결함에 대해서도 복구가 가능하다.Abstract End-user operations on continuous media (say video data) consist of arbitrary-rate search, pause, and others as well as normal-rate play. FF(fast-forward) / FB(fast-backward) among those operations are desirable to find out the scene of interest but they require non-sequential access of disks. When accesses are clustered to several disks without considering load balance, high quality services in playback may not be available. In this paper, we propose a new disk placement scheme, called PRRgp(Prime Round Robin with Grouped Parities), with enhanced reliability by using the wasted disk storage space in an old one(PRR: Prime Round Robin), in which continuous media are placed on a disk array based storage systems to distribute disk accesses uniformly. The PRRgp can not only achieve load balance of disks consisting of a disk array under arbitrary-rate search like PRR, but also improve reliability by storing parity information on the wasted disk space appropriately. We use combinatorial and Markov models to evaluate the reliability for a disk array and to analyze the results. When continuous media like PRR are placed and parity information on the wasted disk space is stored, we cannot tolerate more than two simultaneous faults. But they can be recovered by using stored parity information for about 30 percent as a whole in case of PRRgp presented in this paper. In addition, more than two faults can be tolerated in case there are more than two parity groups.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.708-713
• /
• 2003

For many years clustered heterogeneous web server architecture has been formed on the internet because the explosive internet services and the various quality of requests. The critical point in cluster environment is the mapping schemes of request to server. and recently this is the main issue of internet architecture. The topic of previous mapping methods is to assign equal loads to servers in cluster using the number of requests. But recent growth of various services makes it hard to depend on simple load balancing to satisfy appropriate latency. So mapping based on requested content to decrease response time and to increase cache hit rates on entire servers - so called “content-based” mapping is highly valuated on the internet recently. This paper proposes Prioritized Highest Random Weight mapping(PHRW mapping) that improves content-based mapping to properly fit in the heterogeneous environment. This mapping scheme that assigns requests to the servers with priority, is very effective on heterogeneous web server cluster, especially effective on decreasing latency of reactive data service which has limit on latency. This paper have proved through algorithm and simulation that proposed PHRW mapping show higher-performance by decrease in latency.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.429-439
• /
• 2006

A desktop grid, which is a computing grid composed of idle computing resources in a large network of desktop computers, is a promising platform for compute-intensive distributed computing applications. However, due to reliability and unpredictability of computing resources, effective scheduling of parallel computing applications on such a platform is a difficult problem. This paper proposes a new scheduling method aimed at reducing the total execution time of a parallel application on a desktop grid. The proposed method is based on utilizing the histories of execution behavior of individual computing nodes in the scheduling algorithm. In order to test out the feasibility of this idea, execution trace data were collected from a set of 40 desktop workstations over a period of seven weeks. Then, based on this data, the execution of several representative parallel applications were simulated using trace-driven simulation. The simulation results showed that the proposed method improves the execution time of the target applications significantly when compared to previous desktop grid scheduling methods. In addition, there were fewer instances of application suspension and failure.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1067-1076
• /
• 2003

Database sharing system (DSS) refers to a system for high performance transaction processing. In DSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. In this paper, we propose a dynamic transaction routing algorithm to balance the load of each node in the DSS. The proposed algorithm is novel in the sense that it can support node-specific locality of reference by utilizing the primary copy authority assigned to each node; hence, it can achieve better cache hit ratios and thus fewer disk I/Os. Furthermore, the proposed algorithm avoids a specific node being overloaded by considering the current workload of each node. To evaluate the performance of the proposed algorithm, we develop a simulation model of the DSS, and then analyze the simulation results. The results show that the proposed algorithm outperforms the existing algorithms in the transaction processing rate. Especially the proposed algorithm shows better performance when the number of concurrently executed transactions is high and the data page access patterns of the transactions are not equally distributed.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.89-99
• /
• 2005

Advances of Internet and rC accelerate distribution and sharing of information, which make P2P(Peer-to-Peer) computing paradigm appear P2P computing Paradigm is the computing paradigm that shares computing resources and services between users directly. A fundamental problem that confronts Peer-to-Peer applications is the efficient location of the node that stoles a desired item. P2P systems treat the majority of their components as equivalent. This purist philosophy is useful from an academic standpoint, since it simplifies algorithmic analysis. In reality, however, some peers are more equal than others. We propose the P2P protocol considering differences of capabilities of computers, which is ignored in previous researches. And we examine the possibility and applications of the protocol. Simulating the Magic Square, we estimate the performances of the protocol with the number of hop and network round time. Finally, we analyze the performance of the protocol with the numerical formula. We call our p2p protocol the Magic Square. Although the numbers that magic square contains have no meaning, the sum of the numbers in magic square is same in each row, column, and main diagonal. The design goals of our p2p protocol are similar query response time and query path length between request peer and response peer, although the network information stored in each peer is not important.

• Journal of Korean Society of Disaster and Security
• /
• v.13 no.2
• /
• pp.65-75
• /
• 2020

The efficiency of sewage treatment was ananlyzed selecting a sewage treatment plant in Gyeonggi-do where A₂O process was applied. Statistical techniques based on the operation data of the sewage treatment were used. The main factors directly affecting the efficiency of the treatment process were analyzed using a GPS-X model. The correlation analysis and one-way ANOVA were performed. The T-N and NH₄⁺-N values of the effluent did not generate statistically significant level (p-value:>0.05) when compared with C/N ration values. Removel of nitrogen components form sewage treatment plants were affected by temperature, HRT, SRT and DO. In the case of BOD, all operating factors were affected, while COD was affecte by factors of HRT, STR and DO. In simulations using GPS-X, the parameters that greatly influence was included the maximum sedimentation rate, the dependent nutrient microbial yield (anoxic), the phosphorus saturation coefficient, the dependent nutrient microbial killing rate, the dependent nutrient microbial maximum growth rate, and the independent trophic microorganisms. The maximum growth rate and the maximum setting rate were identified.

• Journal of Biosystems Engineering
• /
• v.28 no.6
• /
• pp.517-524
• /
• 2003

There have been worldwide research and development efforts to automate various processes of bio-production and those efforts will be expanded with priority given to tasks which require high intensive labor or produce high value-added product and tasks under hostile environment. In the field of bio-production capabilities of the versatility and robustness of automated system have been major bottlenecks along with economical efficiency. This paper introduces a new concept of automation based on tole-operation, which can provide solutions to overcome inherent difficulties in automating bio-production processes. Operator(farmer), computer, and automatic machinery share their roles utilizing their maximum merits to accomplish given tasks successfully. Among processes of greenhouse watermelon cultivation tasks such as pruning, watering, pesticide application, and harvest with loading were chosen based on the required labor intensiveness and functional similarities to realize the proposed concept. The developed system was composed of 5 major hardware modules such as wireless remote monitoring and task control module, wireless remote image acquisition and data transmission module, gantry system equipped with 4 d.o.f. Cartesian type robotic manipulator, exchangeable modular type end-effectors, and guided watermelon loading and storage module. The system was operated through the graphic user interface using touch screen monitor and wireless data communication among operator, computer, and machine. The proposed system showed practical and feasible way of automation in the field of volatile bio-production process.

• Journal of Digital Convergence
• /
• v.10 no.11
• /
• pp.427-432
• /
• 2012

The article herein suggested a compound repository and a descriptive method to develop a compound knowledge process. A data target saved in a compound knowledge repository suggested in this article includes all compound knowledge meta data and digital resources, which can be divided into the three following factors according to the purpose: user roles, functional elements, and service ranges. The three factors are basic components to describe abstract models of repository. In this article, meta data of compound knowledge are defined by being classified into the two factors. A component stands for the property about a main agent, activity unit or resource that use and create knowledge, and a context presents the context in which knowledge object are included. An agent of the compound knowledge process performs classification, registration, and pattern information management of composite knowledge, and serves as data flow and processing between compound knowledge repository and user. The agent of the compound knowledge process consists of the following functions: warning to inform data search and extraction, data collection and output for data exchange in an distributed environment, storage and registration for data, request and transmission to call for physical material wanted after search of meta data. In this article, the construction of a compound knowledge repository for recommendation system to be developed can serve a role to enhance learning productivity through real-time visualization of timely knowledge by presenting well-put various contents to users in the field of industry to occur work and learning at the same time.

• Proceedings of the Korea Database Society Conference
• /
• 1998.09a
• /
• pp.293-312
• /
• 1998

$\square$ 정보화 혁명의 대국민 인식수단과 초고속정보통신망의 주요 응용 서비스로서 부각 $\square$ 전통적인 정보이용방법에 대한 이용자들의 인식의 변화로 도서관 활성화 방안으로써 정보통신기술의 도입 $\square$ 선진 각국의 전자도서관 구축의 국가적 추진 $\square$ 국내 초고속정보통신망의 구축과 보급 확대 $\square$ 모든 국민이 지역, 시간의 제약없이 도서관에 접근하여 필요한 자료를 획득 $\square$ 정보획득시간 단축으로 국내연구자들의 연구력 증진 $\square$ 정보화의 지역격차 해소 $\square$ 국내 도서관의 전자도서관 사업 촉진 $\square$ 주요 전자도서관의 통합연동체제를 마련 $\square$ 주요 도서관별 대상분야 조정으로 중복투자 방지 $\square$ 초고속정보통신망의 주요한 응용서비스로 가시화 - 초고속정보통신망의 선도적 대국민 가시화 - 이에 따른 민간부문의 참여 및 투자 촉진 $\square$ 국가, 산업, 국민생활 정보화의 주요한 기반 구축 $\square$ 지역적 정보불균형 해소 - 일부지역에 편중되어 있는 정보를 인터넷을 이용하여 시.공간 제약없이 제공함으로써 정보의 불균형 해소 $\square$ 전자도서관의 기본모델 제시 -전자도서관의 주요기능인 타기관간 자료연동 및 검색시스템을 구현함으로써 향후 구축되는 전자도서관의 기본모델 제시 $\square$ 전자도서관간 자료공유체제 구축 -시범사업 참여도서관간 분산 관리하고 있는 정보의 공유를 위한 표준체제 구축(중략) 것으로 나타났다.까지 증가율을 보여 주었다. 것으로 나타났다.대표하는 압밀계수의 추정이 가능할 것으로 사료된다. $O_3$/라는 결정학적 관계를 가지며 에피탁샬 성장했음을 알 수 있었다.있었다.다(p<0.05)..8800-0.6800로 각각 표시되었다.~$\pm$10 V의 측정범위에서 memory window가 계속 증가하는 것을 보여주었다./$^{\circ}C$의 고주파 유전특성을 얻었다. 얻었다.끼쳤다.보였다.다. 싸이클링 성능을 보였다.다.보였다.다.고 입력 반사손실을 그림 I, 2, 3에 각각 나타내었다. 대책을 요구하고 있다.하는 경향을 보였다. 생존율은 48시간째부터 폐사하기 시작하여 144시간째에는 전량폐사하였다. 삼투압 조절 능력을 위한 여러가지 파라메타에서 15 $\textperthousand$구는 이상이 없는 것으로 추측되나, 0 $\textperthousand$구에서는 코티졸, Na$^{+}$, K$^{+}$, Cl￣, 총단백질 및 AST에서 시간경과에 따른 삼투압 조절 능력에 문제가 있는 것으로 보여진다.c}C$에서 5시간 가열조리 후 잔존율은 각각 84.7% 및 73.3%였고, 질소가스 통기하에서는 잔존율이 88.9% 및 81.8%로 더욱 안정하였다.8% 및 12.44%, 201일 이상의 경우 13.17% 및 11.30%로 201일 이상의 유기의 경우에만 대조구와 삭제 구간에 유의적인(p<0.05) 차이를 나타내었다.는 담수(淡水)에서 10%o의 해수(海水)로 이주된지 14일(日) 이후에 신장(腎臟)에서 수축된 것으로 나타났다. 30%o의 해수(海水)에 적응(適應)된 틸라피아의 평균 신사구체(腎絲球體)의 면적은 담수(淡水)에 적응된 개체의 면적보다 유의성

• Korean Journal of Food Science and Technology
• /
• v.32 no.5
• /
• pp.1002-1008
• /
• 2000

The purpose of this study was to provide the fundamental information for establishing the database needed to estimate total intakes of trans fatty acids in Korea. The amounts of trans fatty acids contained in 164 samples including 25 samples of margarines, 21 samples of shortenings, 19 samples of vegetable salad and cooking oils, 53 samples of confectionery products, 18 samples of bakery products, 19 samples of dairy products, and 9 samples of animal fats and meats were analyzed by capillary gas liquid chromatography. The average amounts of trans fatty acids in those foods were calculated and expressed as gram per one serving. Then, the average daily intakes of trans fatty acids per capita were estimated using the analyzed amounts of trans fatty acids and the amount of yearly production for those foods. The amounts of trans fatty acids per 100 g of lipids were $2.11{\sim}33.83%$ (14.66% on average) in margarines, $1.47{\sim}44.48%$ (14.21% on average) in shortenings, $0.18{\sim}3.82$ (1.54% on average) in vegetable salad and cooking oils, $0{\sim}45.81%$ (10.92% on average) in confectionery products, $0{\sim}18.32%$ (7.87% on average) in bakery products, $0.90{\sim}4.54%$ (2.27% on average) in dairy products, and $0.61{\sim}6.07%$ (2.24% on average) in animal fats and meats. Major isomers of trans fatty acid in the sample foods were $C_{18:1}$ and $C_{18:2}$. As a result, the korean average daily intake of trans fatty acids in korea was estimated to be 2.3 g per capita. The amounts of trans fatty acids consumed from each selected food were as follows: 0.35 g from margarines, 0.57 g from shortenings, 0.11 g from vegetable salad and cooking oils, 0.65 g from confectionery products, 0.07 g from bakery products, 0.14 g from dairy products and 0.21 g from animal fats and meats.