• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.7
• /
• pp.765-767
• /
• 2016

Building Energy commissioning is a process in which verifying and making the document during entire lifetime including planning, design, construction, test run of equipment, and maintenance to minimize the operational problems of building energy efficiency. The general commissioning is replacing the equipment or reconstructing the skin to achieve the performance for the design. This process is expensive and has the disadvantage of taking a long payback period by one operation. In this paper, we studied the monitoring-based commissioning (MBCx) to increase the energy efficiency of buildings through analyzing energy use data. MBCx is modeling a building energy, comparing the real energy use with it, detecting the cause of falling the efficiency, and running the optimal operation regularly.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.19 no.10
• /
• pp.695-702
• /
• 2007

In this paper, the ventilation efficiencies of an underground sewage disposal plant were investigated for ventilating system without fan, ventilating system with eleven cross flow fans and ventilating system with sixteen cross flow fans by numerical method. It has been found that the air change effectiveness of the system without fan was predicted 0.44. It means that an additional ventilating equipment is needed to maintain good indoor air quality. For the ventilating system with sixteen cross flow fans, the air change effectiveness was predicted 0.55. The air change effectiveness of the ventilating system with eleven cross flow fans was predicted 0.51. It is known that the air change effectiveness above 0.5 is enough to eliminate pollutant and bad smell in the indoor. Therefore, it is recommended to select the ventilating system with eleven cross flow fans for the underground sewage disposal plant in an economic point of view.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1108-1118
• /
• 2005

A mobile Ad Hoc network is a dynamic mobile wireless network that can be formed without the need for any pre-existing wired or wireless infrastructure. A mobile ad hoc node has limited battery capacity. Hence, Ad Hoc routing protocol ought to be energy conservative. Previous energy aware routing has limit in fairness among nodes and network wide power consumption. In this research, we propose a new routing protocol called Clustering Based Energy-Aware Routing(CBEAR) which can improve the problems. Simulation results show that the routing protocol improves fairness and network wide power consumption as well as life time of nodes.

• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.65-70
• /
• 2001

In this paper, a Modified RED algorithm for congestion avoidance in IP networks is presented. The RED detects incipient congestion by computing the average queue size. By notifying only a randomly selected fraction of connection, it causes to the global synchronization or fairness problem, And also, the network characteristics need to be known in order to find th optimum average queue length. When the average queue size exceeds a minimum threshold, a modified RED algorithm drops packets based on the state of each connection. Performance is improved because of keeping the average queue size low while allowing occasional bursts of packets in the queue, we compare performance of modified RED with RED and Drop Tail in terms of goodput, network utilization and fairness.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.132-139
• /
• 2004

A range $Top-\kappa$ query returns top k records in order of a measure attribute within a specified region on multi-dimensional data, and it is a powerful tool for analysis in spatial databases and data warehouse environments. In this paper, we propose an algorithm for answering the query via selective traverse of a Hierarchical Max R-Tree(HMR-tree). It is possible to execute the query by accessing only a small part of the leaf nodes in the query region, and the query performance is nearly constant regardless of the size of the query region. The algorithm manages the priority queue efficiently to reduce cost of handling the queue and the proposed HMR-tree can guarantee the same fan-out as the original R-tree.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10C
• /
• pp.983-991
• /
• 2005

Human faces are commonly found in a video such as a drama and provide useful information for video content analysis. Therefore, face detection plays an important role in applications such as face recognition, and face image database management. In this paper, we propose a face detection algorithm based on pre-processing of scene change detection for indexing and cast searching in video. The proposed algorithm consists of three stages: scene change detection stage, face region detection stage, and eyes and mouth detection stage. Experimental results show that the proposed algorithm can detect faces successfully over a wide range of facial variations in scale, rotation, pose, and position, and the performance is improved by $24\%$with profile images comparing with conventional methods using color components.

• Journal of The Korean Association of Information Education
• /
• v.4 no.1
• /
• pp.24-31
• /
• 2000

This paper is a study on the design and implementation of cooperative monitoring agent using mobile agent for educational portal site. Generally educational portal sites have many addresses of teachers homepage. Therefore, portal site has a very difficult task with maintaining a consistent address of site and administration of portal is impossible while to be on the search for all dead sites. In order to overcome this problem, we designed and implemented a mutual cooperative monitoring agent in order to filter off dead site using mobile agent. The monitoring agent applies at Korean educational portal site (KEPS) for elementary student and makes an experiment efficient. Finally a cooperative mobile agent is compared with a stationary monitoring agent.

• Information and Communications Magazine
• /
• v.31 no.6
• /
• pp.32-38
• /
• 2014

소프트웨어기반의 네트워크 미들박스 시스템은 특정 하드웨어의 종속성을 탈피하고, 다양한 여러 기능을 유연하게 제공할 수 있는 장점이 있어 최근 큰 각광을 받고 있다. 더욱이 최근 멀티코어 및 매니코어 프로세서의 발전 및 큰 대역폭을 지원하는 네트워크 카드의 등장은 저렴한 범용 컴퓨팅 하드웨어 기반에서도 높은 성능의 미들박스 서비스를 소프트웨어만으로 쉽게 제공할 수 있는 가능성을 보여주고 있다. 하지만 기존의 소프트웨어기반 네트워크 미들박스 시스템 개발에서 쓰이는 네트워킹 소프트웨어 스택은 여러 미들박스 서비스를 쉽게 만들고 유지하기에 불편한 점이 많이 있다. 첫째로, 리눅스(Linux)와 같은 범용 운영체제는 버클리 소켓(Berkeley socket)과 같이 엔드 노드를 위한 네트워킹 스택을 지원하는 반면 네트워크 미들박스 서비스 제작을 위한 전용 스택은 지원하지 않고 있다. 이로 인해 미들박스에서 많이 쓰는 플로 관리 같은 기능을 IP 패킷처리부터 새로 구현해야 하는 부담이 생긴다. 두번째로, 전용 스택의 부재는 같은 기능을 갖는 여러 미들박스 서비스가 공존할 때에도 그 구현을 공유하지 못하는 문제를 만들어 낸다. 또, 여러 미들박스 서비스가 하나의 물리적 하드웨어 위에서 수행될 경우에도 인터페이스가 일정하지 않아 같은 연산을 중복 수행해 자원 낭비를 초래한다. 본 논문에서는 차세대 소프트웨어기반 미들박스 서비스 설계 및 제작을 용이하게 하기 위한 전용 소프트웨어 스택의 필요성을 알아보고, 이런 전용 스택이 만들어 낼 수 있는 여러 가능성을 짚어본다.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3172-3174
• /
• 1999

교환기나 전송장치 등 각종 통신설비에 전원을 공급하기 위해서 정류기, 축전지 및 발전기 등의 전원설비가 사용되고 있다. 이들 중에서도 정류기는 통신설비에 직류전원을 공급하기 때문에 다른 전원설비 보 다도 신뢰성 및 안정성이 확보된 장치로 인식되어 왔다. 그러나 현재 사내전화국에 설치 운용중인 정류기는 교환 기별로 종류가 다양하여 유지보수에 어려움이 내재하고 있을 뿐만 아니라 통신망의 광대역화, 대용량화에 대처가 곤란하며 정류기를 전력실 또는 통신실에 집중해서 설치 운용하는 집중공급방식으로는 축전지의 만충전이 곤란하다. 또한 현재의 이러한 급전방식은 통신장치의 광대역화, 고도화 등 통신망의 급격한 발전과 함께 다음과 같은 문제점이 대두되고 있다. 첫째, 전력실에서 총괄하여 교류전력을 직류48V로 변환해서 급전하기 때문에 급전전류가 크게되고, 또한 전력실에서 통신실까지의 급전손실이 크다 둘째, 통신설비의 증감에 따른 전원설비의 증감이 어렵기 때문에 설비 가동율이 나쁘다 셋째, 전원설비의 고장에 의한 전화국 전체설비에 심각한 영향을 미칠수 있다 이러한 문제점을 해소하기 위하여 집중 및 분산급전방식으로 운용이 가능하며, 또한 모든 전원설비를 감시/제어하는 전원 집중관리 시스템과의 인터페이스 등이 가능한 정류시스템을 1997년부터 개발하였다. 본고에서는 신형 정류기와 기존의 정류기와의 성능 및 특성에 대해 비교하였고, 특히 경제성측면과 설치상련에 대해 비교분석 하였다. 또한 집중급전방식과 분산급전방식의 특성에 대해서도 서술하였다.

• KIISE Transactions on Computing Practices
• /
• v.22 no.5
• /
• pp.235-239
• /
• 2016

'Commit-bug link', the link between commit history and bug reports, is used for software maintenance and defect prediction in bug tracking systems. Previous studies have shown that the links are automatically detected based on text similarity, time interval, and keyword. Existing approaches depend on the quality of commit history and could thus miss several links. In this paper, we proposed a technique to link commit and bug report using not only messages of commit history, but also the similarity of files in the commit history coupled with bug reports. The experimental results demonstrated the applicability of the suggested approach.