• Journal of KIISE:Software and Applications
• /
• v.27 no.4
• /
• pp.384-392
• /
• 2000

As a software becomes more complicated and large-scaled, it is very important for a software engineer to analyze user's requirements precisely and apply them effectively in the development stage. Due to the growth of the internet, the necessity of requirements elicitation and analysis in distributed environments has also become larger. This paper proposes a requirements elicitation supporting system that offer the basis for effectively analyzing requirements collected in distributed environments. The proposed system automatically categorizes collected requirements sentences into selected subject fields by measuring their similarity using a similarity measurement technique. Therefore, it reduces the difficulties in the initial stage of requirements analysis and it supports rapid and correct requirements analysis. This paper verifies the efficiency of the proposed system in similarity measurement techniques through experiments, and presents a process for requirements specifications elicitation using the embodied system

• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1105-1113
• /
• 1999

객체 지향 소프트웨어의 확장과 더불어 소프트웨어의 재사용성의 중요도가 부각되면서 소프트웨어를 콤포넌트 단위로 구현하는 추세이다. 따라서 콤포넌트 기반의 소프트웨어 개발에서의 통합 테스트가 중요한 이슈로 떠오르고 있다. 그러나 콤포넌트들의 통합 테스트에 대한 연구는 미흡한 상태이다. 본 논문에서는 UML을 기반으로 체계적인 통합 테스트 모형을 제안하고. 나아가 본 논문에서는 "멀티미디어 정보처리 시스템"의 사례를 본 논문의 콤포넌트 통합 테스트 모형에 적용한 결과를 분석하여 기술한다. 콤포넌트 통합 테스트 모형은 UML(Unified Modeling Language)의 순서도(sequence diagram)와 협력도(collaboration diagram)를 이용하여 전체 시스템에서 UML의 사건흐름을 구성하는 콤포넌트들 사이의 인터페이스 영역에 존재하는 오류들을 추출한다. 그리고 UML을 기반으로 통합 테스트를 수행함으로써, 테스트 준비 작업을 줄이고, 기존의 UML 지원 도구들과 연계하여 테스트 자동화 도구의 구현을 앞당길 수 있다. 또한 시스템의 순차적 흐름 뿐 아니라, 동시에 수행되는 흐름에 대한 정보까지 모두 수용하여 테스트함으로써, 콤포넌트 기반의 분산 환경의 특성에 적합하다. Abstract As the object-oriented approach to software development becomes more mature, software development from pre-existing, independently developed components becomes an important aim of software engineering. Therefore, integration testing becomes an important aspect of component-based software development. However, there has been little work done in the area of the component-based integration testing. In this paper, we propose the "component integration test model" which is based on UML. Furthermore, we describe a case study on "Multimedia Information Processing System" conducted to analyse the result from which our model is applied. Our model extracts the faults, which exist in interfaces of components, using sequence diagram and collaboration diagram of UML(Unified Modeling Language). As our model is based on UML, the preparation effort for testing is reduced and its test-tools can be implemented more easily through linking existing UML tool. And our model accepts the information of concurrent flow represented by collaboration diagram as well as sequential flow, so it is more suitable to component-based distributed environment.based distributed environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.832-844
• /
• 2008

Distributed localization algorithms are necessary for large-scale wireless sensor network applications. In this paper, we introduce an efficient node distribution based localization algorithm that emphasizes simple refinement and low system load for low-cost and low-rate wireless sensors. Each node adaptively chooses neighbor nodes for sensors, update its position estimate by minimizing a local cost function and then passes this update to the neighbor nodes. The update process considers a distribution of nodes for large-scale networks which have same density in a unit area for optimizing the system performance. Neighbor nodes are selected within a range which provides the smallest received signal strength error based on the real experiments. MATLAB simulation showed that the proposed algorithm is more accurate than trilateration and les complex than multidimensional scaling. The implementation on MicaZ using TinyOS-2.x confirmed the practicality of the proposed algorithm.

• Spatial Information Research
• /
• v.22 no.2
• /
• pp.63-71
• /
• 2014

Ocean leisure sports have recently emerged as one of so-called blue ocean industries. They are sensitive to diverse environmental conditions such as current, temperature, and salinity, which can increase needs of forecasting data as well as in-situ observations for the ocean. In this context, a Web-based geovisualization system for coastal information produced by model forecasts was implemented for use in supporting various ocean activities. First, FVCOM(Finite Volume Coastal Ocean Model) was selected as a forecasting model, and its data was preprocessed by a spatial interpolation and sampling library. The interpolated raster data for water surface elevation, temperature, and salinity were stored in image files, and the vector data for currents including speed and direction were imported into a distributed DBMS(Database Management System). Web services in REST(Representational State Transfer) API(Application Programming Interface) were composed using Spring Framework and integrated with desktop and mobile applications developed on the basis of hybrid structure, which can realize a cross-platform environment for geovisualization.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1675-1685
• /
• 2012

DVC (Distributed Video Coding) technique plays an essential role in providing low-complexity video encoder. But, in order to achieve the better rate-distortion performances, most DVC systems need feedback channel for parity bit control. This causes the DVC-based system to have high decoding latency and becomes as one of the most critical problems to overcome for a real implementation. In order to overcome this problem and to accelerate the commercialization of the DVC applications, this paper analyzes an effect of LDPCA frame size for adaptive LDPCA frame-based parity bit request estimations. First, this paper presents the LDPCA segmentation method in pixel-domain and explains the temporal-based bit request estimation method and the spatial-based bit request estimation method using the statistical characteristics between adjacent LDPCA frames. Through computer simulations, it is shown that the better performance and fast decoding is observed specially when the LDPCA frame size is 3168 in QCIF resolution.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.373-376
• /
• 2003

This paper presents a new, three-dimensional round-robin scheduler that provides high throughput and fair across in an advanced input-queued packet switch using shared input buffers. We consider an architecture in which each input port group shares a common buffer and maintains a separate queue for each output, which is ratted the distributed common input buffer switch. In an NxN switch, our scheduler determines which queue in the total MxN input queues is served during each time slot where M is the number of common buffers. We suppose that each common buffer has K input ports and K output ports, and manages N output queues. The 3DRR scheduler determines MxK queues in every K(M) cycle when $K\geq$M (K$\leq$M), and provides massively parallel processing for the applications of high-speed switches with a large number of ports. The 3-DRR scheduler can be implemented using duplicated simple logic components allowing very high-speed implementation.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.923-930
• /
• 2004

Wireless sensor networks is a core technology of ubiquitous computing which enables the network to aware the different kind of context by integrating exiting wired/wireless infranet with various sensor devices and connecting collected environmental data with applications. However it needs an energy-efficient approach in network layer to maintain the dynamic ad hoc network and to maximize the network lifetime by using energy constrained node. Cluster-based data aggregation and routing are energy-efficient solution judging from architecture of sensor networks and characteristics of data. In this paper. we propose a new distributed clustering algorithm in using distance from the sink. This algorithm shows that it can balance energy dissipation among nodes while minimizing the overhead. We verify that our clustering is more en-ergy-efficient and thus prolongs the network lifetime in comparing our proposed clustering to existing probabilistic clustering for sensor network via simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.1-6
• /
• 2005

Communication network is in a transition toward the NGN (Next Generation Networks) to accommodate the explosive demand of new services. The NGN allows the third-party application provisioning by defining the networks as layers of Services, Distributed Processing Environment and Transport. Especially, the Service layer can further be divided into Application and Service Component layer. In order to realize the third-party application provisioning, the Parlay Group has adopted an open Parlay API as an interface between the Application and the Service Component layer. Using Parlay API, the third parties may develop and deploy the IT-based applications at the Application layer exploiting the service components located within network operators' domain. In this paper, we present the implementation details about the Third Party Call Control (TPCC) Service using the third-party service logic based on Parlay API and Parlay X API, when SIP is used as a signaling protocol in Transport layer. Also, we compare the performance evaluation of both implementations.

• The KIPS Transactions:PartA
• /
• v.15A no.1
• /
• pp.17-26
• /
• 2008

This paper proposes an efficient caching mechanism appropriate for the integrated RFID middleware which can integrate wireless sensor networks (WSNs) and RFID (radio frequency identification) systems. The operating environment of the integrated RFID middleware is expected to face the situations of a significant amount of data reading from RFID readers, constant stream data input from large numbers of autonomous sensor nodes, and queries from various applications to history data sensed before and stored in distributed storages. Consequently, an efficient middleware layer equipping with caching mechanism is inevitably necessary for low latency of request-response while processing both data stream from sensor networks and history data from distributed database. For this purpose, the proposed caching mechanism includes two optimization methods to reduce the overhead of data processing in RFID middleware based on the classical cache implementation polices. One is data stream cache (DSC) and the other is history data cache (HDC), according to the structure of data request. We conduct a number of simulation experiments under different parameters and the results show that the proposed caching mechanism contributes considerably to fast request-response times.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.668-675
• /
• 2005

With the proliferation of wireless network and the advances of the embedded systems, the traditional distributed systems begin to include the wireless embedded systems. Clock synchronization in the distributed systems is one of the major issues that should be considered for diverse Purposes including synchronization, ordering, and consistency. Many clock synchronization algorithms have been proposed over the years. Since clock synchronization in wireless embedded systems should consider the low bandwidth of a network and the poor resources of a system, most traditional algorithms cannot be applied directly. We propose a clock synchronization algorithm in wireless embedded systems, extending IEEE 802.11 standard. The proposed algorithm can not only achieve high precision by loosening constraints and utilizing the characteristics of wireless broadcast but also provide continuous time synchronization by tolerating the message losses. In master/slave structure the master broadcasts the time information and the stave computes the clock skew and the drift to estimate the synchronized time of the master. The experiment results show that the achieved standard deviation by the Proposed scheme is within the bound of about 200 microseconds.