• Journal of Korean Home Economics Education Association
• /
• v.16 no.3
• /
• pp.63-80
• /
• 2004

The purpose of this study was to investigate the actual ICT utilization and recognition, to identify the effective and relevant chapters of home economics which can be taught using ICT in teaching and learning method. There were 372 secondary school teachers being participated in the survey. The results of this study can be summarized as follows 1. The reason why they have ICT utilization Instruction is to help the learners improve the academic accomplishment in the development stage through providing data from web-surfing and presentational data such as developed CD, animation and presentations. 2. Regarding ICT utilization capability. teachers have the capability to send and receive E-mail, make a presentation data. practical use of Internet. In addition, the group with less than 10 years experience have a higher capability in information technology. 3. Concerning ICT utilization recognition, this result shows that ICT Instruction is the most effective to motivate learners, and teachers anticipate ICT Instruction would improve the quality of the teaching & learning. 4. The chapter such as 'how to make clothing and recycling'(database). 'the foundation of cooking and its application' (database). 'gender and acquaintance of the opposite sex', 'nutrition of during adolescence' (simulation program) should be the first priority in the development.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.281-285
• /
• 2008

Wireless sensor networks are closely related with the geometric environment in which they are deployed. We consider the probable case when a routing protocol runs on an environment with many complex obstacles like downtown surroundings. In addition, there are no unrealistic assumptions in order to increase practicality of the protocol. Our goal is to find a routing protocol for maximizing network lifetime by using only connectivity information in the complex sensor network environment. We propose a topology-based routing algorithm that accomplishes good performance in terms of network lifetime and routing complexity as measures. Our routing algorithm makes routing decision based on a weighted graph as topological abstraction of the complex network. The graph conduces to lifetime enhancement by giving alternative paths, distributing the skewed burden. An energy estimation method is used so as to maintain routing information without any additional cost. We show how our approach can be used to maximize network lifetime and by extensive simulation we prove that out approach gives good results in terms of both measures-network lifetime and routing complexity.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.203-214
• /
• 2005

The integration of 3G networks and WLANs as complementary has been begun to attract much attention in industry as well as academia. This topic is becoming a burning issue, and one of the key questions which it raises is how to support a seamless vertical handoff. This paper introduces a new network interface selection algorithm for energy-efficient vertical handoff in tightly coupled systems capable of supporting seamless handoff. Our proposed scheme, Wise Interface Selection (WISE) switches the active network interface, after taking into consideration the characteristics of the network interface cards and the current level of data traffic, with the cooperation of the mobile terminals and network. Network interface switching operates independently on both the downlink and the uplink for the purpose of energy conservation. We show through simulation that less energy is consumed with WISE than when only a 3G network or WLAN interface is used, resulting in a longer lifetime for the mobile terminals. In the case of TCP connections, additional throughput gain can also be obtained.

• 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.

• The Journal of the Korea Contents Association
• /
• v.11 no.11
• /
• pp.49-61
• /
• 2011

In recent, library is considered as an integrated knowledge convergence center that can respond to various requests about information service of users. Therefor it is necessary to establish a novel information system based on information communications technologies of the era. In other words, it is currently required to develop mobile information service available in portable devices such as smart phones or tablet PCs, and to establish information system reflecting cloud computing, SaaS, Annotation, and Library 2.0 etc. In this paper we design and implement a library information system using collective intelligence and cloud computing. This information system can be adapted for the varieties of mobile service paradigm and abruptly increasing amount of electronic materials. Advantages of this concept model are resource sharing, multi-tenant supporting, configuration, and meta-data supporting etc. In addition it can offer software on-demand type user services. In order to test the performance of our system, we perform an effectiveness analysis and TTA authentication test. The average response time corresponding to variance of data reveals 0.692 seconds which is very good performance in timing effectiveness point of view. And we detect maturity level-3 or 4 authentication in TTA tests such as SaaS maturity, performance, and application programs.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.39-45
• /
• 2005

Nowadays, the demand of the output analyzed from the grid data have been sharply increased as the remote sensing technologies and GIS related industry have been developed. Therefore, a metadata access system which fits the requirements of the users should be developed for better managing and utilizing gridded data. In this background, this study defined a common application schema through the analysis of the metadata built by numerous institutes based on the draft metadata standards. The draft metadata standards has been proposed from the study supported by ETRI at 2003 which mainly concentrated on establishing the standards of distributing metadata for the grid data. Also, XML based integrated system was developed to access metadata maintained by SaTReC as well as SIMC to facilitate more convenient data access for the grid data users. The results of the pilot system developed from this study can be expected to contribute to build more efficient and enlarged integrated access system of metadata for grid data.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.318-326
• /
• 2005

This paper presents the image feature extraction method and the image classification technique to select the harmful image flowed from the Internet by grade of image contents such as harmlessness, sex-appealing, harmfulness (nude), serious harmfulness (adult) by the characteristic of the image. In this paper, we suggest skin area detection technique to recognize whether an input image is harmful or not. We also propose the ROI detection algorithm that establishes region of interest to reduce some noise and extracts harmful degree effectively and defines the characteristics in the ROI area inside. And this paper suggests the multiple-SVM training method that creates the image classification model to select as 4 types of class defined above. This paper presents the multiple-SVM classification algorithm that categorizes harmful grade of input data with suggested classification model. We suggest the skin likelihood image made of the shape information of the skin area image and the color information of the skin ratio image specially. And we propose the image feature vector to use in the characteristic category at a course of traininB resizing the skin likelihood image. Finally, this paper presents the performance evaluation of experiment result, and proves the suitability of grading image using image feature classification algorithm.

• 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의 해수(海水)에 적응(適應)된 틸라피아의 평균 신사구체(腎絲球體)의 면적은 담수(淡水)에 적응된 개체의 면적보다 유의성

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.512-527
• /
• 2001

In a client-server spatial database, it is desirable to maintain the cached data in a client side to minimize the communication overhead across a network. This paper deals with the issues of concurrency and consistency of map updates in this environment. A client transaction to update map data is an interactive work and takes a long time to complete it. The map update in a client site may affect the other sites'updates because of dependencies between spatial data stored at different sites. The concurrent updates should be propagated to the other clients as well as the server to keep the consistency of map replicated in a client cache, and also the communication overhead of the update propagation should be minimized not to lose the benefit of caching. The newly proposed cache region locking with CR lock and CX lock controls the update dependency due to spatial relationships. CS lock and COD lock are suggested to use optimistic detection-based approaches for guaranteeing the consistency of cached client data. The cooperative update protocol uses these extended locking primitives and Spatial Relationship-based 2PC (SR-based 2PC). This paper argues that the concurrent updates of cached client spatial data can be achieved by deciding on collaborative updates or independent updates based on spatial relationships.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.134-142
• /
• 2003

We present an ATM switch architectures based on the multistage interconnection network(MIN) for the efficient multicast traffic control. Many of these applications require multicast connections as well as point-to-point connections. Muiticast connection in which the same message is delivered from a source to arbitrary number of destinations is fundamental in the areas such as teleconferencing, VOD(video on demand), distributed data processing, etc. In designing the multicast ATM switches to support those services, we should consider the fairness(impartiality) and priority control, in addition to the overflow problem, cell processing with large number of copies, and the blocking problem. In particular, the fairness problem which is to distribute the incoming cells to input ports smoothly is occurred when a cell with the large copy number enters upper input port. In this case, the upper input port sends before the lower input port because of the calculating method of running sum, and therefore cell arrived into lower input port Is delayed to next cycle to be sent and transmission delay time becomes longer. In this paper, we propose the cell splitting and group splitting algorithm, and also the fairness scheme on the basis of the nonblocking characteristics for issuing appropriate copy number depending on the number of Input cell in demand. We evaluate the performance of the proposed schemes in terms of the throughput, cell loss rate and cell delay.