• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4555-4571
• /
• 2019

Due to increasing interest in distributed agile software development, there is a need to systematically review the literature on challenges encountered in the agile software development environment. Using the Systematic Literature Review (SLR) approach, 32 relevant publications, dated between 2013 and 2018 were selected from four electronic databases. Data from these publications were extracted to identify the key challenges across the system development life cycle (SDLC) phases, which essentially are short phases in each agile-based iteration. 5 types of key challenges were identified as impacting the SDLC phases; these challenges are Communication, Coordination, Cooperation, Collaboration and Control. In the context of the SLDC phases, the Communication challenge was discussed the most often (79 times, 33%). The least discussed challenges were Cooperation and Collaboration (26 times, 11% each). The 5 challenges occur because of distances which occur in distributed environment. This SLR identified 4 types of distances which contribute to the occurrence of these key challenges - physical, temporal, social-cultural and knowledge/experience. Of the 32 publications, only 4 included research which proposed new solutions to address challenges in agile distributed software development. The authors of this article believe that the findings in this SLR are a resource for future research work to deepen the understanding of and to develop additional solutions to address the challenges in distributed agile software development.

• 정보보호학회논문지
• /
• 제15권5호
• /
• pp.115-124
• /
• 2005

본 논문에서는 모바일 노드(mobile node, MN)와 대응노드(correspondent node, CN)사이의 바인딩 업데이트 (binding update, BU) 프로토콜에 대해 기존 프로토콜들에서 알려진 Redirect 공격과 DOS(denial-of service) 공격을 방지하고 효율성을 향상시키기 위해 새로운 BU 프로토콜을 제안한다. 제안 프로토콜에서 홈 에이전트(home agent, HA)는 BU 메시지의 유효성을 확인하는 인증서버(authentication server)의 기능과 MN과 CN를 위한 세션키 분배센터의 기능을 수행한다. 또한 CGA(cryptographically generated address)를 기반으로 한 stateless Diffie-Hellman 키 합의 기법을 소개하고, 제안 프로토콜의 안전성을 기존 프로토콜과 함께 비교하고 분석한다. 제안 프로토콜은 메시지 수, 계산적 오버헤드 측면에서 기존기법보다 효율적이며, Redirect와 DoS 공격으로부터 안전하다.

• Journal of Information Processing Systems
• /
• 제9권2호
• /
• pp.247-258
• /
• 2013

A new secure network communication technique that has been designed for mobile wireless services, is presented in this paper. Its network services are mobile, distributed, seamless, and secure. We focus on the security of the scheme and achieve anonymity and reliability by using cryptographic techniques like blind signature and the electronic coin. The question we address in this paper is, "What is the best way to protect the privacy and anonymity of users of mobile wireless networks, especially in practical applications like e-commerce?" The new scheme is a flexible solution that answers this question. It efficiently protects user's privacy and anonymity in mobile wireless networks and supports various applications. It is employed to implement a secure e-auction as an example, in order to show its advantages in practical network applications.

• Journal of Electrical Engineering and Technology
• /
• 제9권6호
• /
• pp.1967-1977
• /
• 2014

In this paper, for the development of a safe and reliable DC home appliance suitable for DC home power supply system, we classified a number of inherent problems with help of the comparative analysis of existing AC and new DC home appliance. Several new technical problems of DC home appliances are mainly linked to the DC transient state. Among them, this paper concentrates on start-up inrush current problem, uni-polarity problem, and heavy DC load control problem. And to address these problems, we herein present an implementation of robust safety circuits for DC home appliances. Specifically, we investigate several multi-circuit countermeasures and select the best among them through comparative evaluation, based on theoretical, simulational, and experimental results.

• Journal of Communications and Networks
• /
• 제3권4호
• /
• pp.374-382
• /
• 2001

Nowadays, the commonly used table lookup scheme for IP routing is based on the sc-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, this complicates the IP lookup. Currently, this process is mainly performed in software and several schemes hale been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the new generation routers, in this article we investigate the properties of the routing table and present a new approach for IP lookups, our approach is not based Gn BMP and significantly reduces the complexity, thus the computation cast of existing schemes can be significantly reduced. We also propose an efficient IP lookup algorithm, with which we improve the binary search on prefixes to 30 millions of packets per second (MPPS) and 5,000 route updates/s under the same experiment setup with an even larger routing table.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2005년도 가을 학술발표논문집 Vol.32 No.2 (2)
• /
• pp.979-981
• /
• 2005

"버퍼에 대한 바운드 체크를 하지 않는다"라는 작은 취약성 하나가 버퍼 오버플로우라는 큰 위협을 만들어냈다. 그러나 그것을 단지 C언어의 무결성 문제로 단정 지어 버릴 수도 없는 문제이다. 일반적으로 버퍼 오버플로우 공격은 메모리에 할당된 버퍼의 경계를 넘는 데이터를 입력하여 프로그램의 함수복귀주소를 조작하고 공격자가 원하는 코드를 삽입하여 이루어진다. 이러한 버퍼 오버플로우에 대한 여러가지 대응책들이 나왔지만 약간의 문제점들을 가지고 있다. 그래서 본 논문에서는 운영체제의 세그멘테이션 기법을 이용하여 그 공격에 대응할 수 있는 한 가지 방법을 제시하고자 한다. 기존의 스택가드(카나리아 버전)의 문제점인 우회공격과 카나리아 워드를 추측하여 이루어지는 공격 그리고 MineZone RAD의 문제가 되는 DRAMA 등에 있어서도 효과적으로 방어할 수 있을 것으로 기대한다. 또한 스택가드(Memguard 버전)에서 이곳저곳에 산재되어 관리하기 어려운 함수복귀주소를 별도의 세그먼트 테이블로 쉽게 관리할 수 있을 것이다.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1999년도 추계학술대회 논문집
• /
• pp.75-80
• /
• 1999

This paper presents a new method to find a optimal solution for stochastic system. This method uses Genetic Algorithm(GA) and simulation. GA is used to search for new alternative and simulation is used to evaluate alternative. The stochastic system has one or more random variables as inputs. Random inputs lead to random outputs. Since the outputs are random, they can be considered only as estimates of the true characteristics of they system. These estimates could greatly differ from the corresponding real characteristics for the system. We need multiple replications to get reliable information on the system. And we have to analyze output data to get a optimal solution. It requires too much computation to be practical. We address the problem of reducing computation. The procedure on this paper use GA character, an iterative process, to reduce the number of replications. The same chromosomes could exit in post and present generation. Computation can be reduced by using the information of the same chromosomes which exist in post and present current generation.

• 전자공학회지
• /
• 제25권4호
• /
• pp.14-26
• /
• 1998

Emergence of the Interned, World Wide Web (WWW), and multimedia services accelerates the demand for broadband access to mass market. As the demand for broader bandwidth for local access rapidly increases, new types of services for local access have been offered or are being developed. However, nothing has yet been shown up for a definite long-term solution. In this article, we address some issues and technological perspectives of such emerging local access demand.

• Journal of Microbiology and Biotechnology
• /
• 제8권2호
• /
• pp.101-110
• /
• 1998

The extent of biological diversity being revealed by molecular techniques accentuates the need to develop methods to isolate and culture the large numbers of microorganisms that remain to be studied. The discovery and characterization of novel microorganisms will provide information useful in understanding microbial ecosystems and have the potential to lead to new products for the biotechnology industry. In this review, the use of innovative techniques and exploration of unusual ecosystems, that have begun to address the challenge of isolating the "uncultured" members of the microbial population, are examined.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.1005-1008
• /
• 1999

This paper presents a method for procedure-based on-line program replacement for user applications. To deal with the size change in the procedure to replace, the method uses the unmapped area of process address space for mapping a new version of procedure. The method is effective in that and it does not cause large performance loss during the replacement or require any additional software layer for the replacement. The method is illustrated in the SUN Solaris environment.