• Title/Summary/Keyword: Pair programming

Search Result 65, Processing Time 0.023 seconds

A Study of Applying Extreme Programming Method in Korean Software Development Environment (국내 소프트웨어 개발 환경에서의 Extreme Programming 개발 방식의 적용성 연구)

  • 공재원;심우곤;백인섭
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04a
    • /
    • pp.577-579
    • /
    • 2001
  • eXtreme Programming(이하 XP)은 프로젝트를 수행하는 데에 있어서 흔하게 발생하는 위험 요인들을 Light-weight 한 방법으로 해결하기 위한 방법론이다. XP 개발 방법론은 개발 주기의 단위를 작게 나누어서 피드백을 받는 기간을 짧게 잡았다는 점과, Pair Programming 방법을 도입했다는 점, 개발 과정에서의 고객의 비중을 높이고, 다양한 모듈 테스트/기능 테스트를 통해서 제품의 오류를 최소화 했다는 점 등의 특징을 갖고 있다. 그러나 XP는 소규모의 개발팀일 경우에만 그 효용성이 입증되고 있으며, 수많은 테스트 과정과 개발의 전과정에서의 고객의 적극적인 참여의 요구는 생산 비용면에서나 고객의 부담에 있어서 단점으로 여겨지고 있다. 따라서 본 고에서는 이러한 점들을 보완하기 위한 몇 가지 방안과 더불어 우리나라의 개발 환경에 효과적으로 적용하기 위한 방안을 제시하고자 한다.

  • PDF

A Case Study on Block Coding and Physical Computing Education for University of Education Students (교육대학생을 대상으로 한 블록 코딩 및 피지컬 컴퓨팅 교육 사례)

  • Han, Kyujung
    • Journal of Creative Information Culture
    • /
    • v.5 no.3
    • /
    • pp.307-317
    • /
    • 2019
  • This study is an example of the education of block coding and physical computing teaching tool for preservice teachers at the college of education. The students were familiar with coding and improved their coding skills in solving various problems through 'Entry' that support block coding. In addition, the students configured the computing system with various input / output devices of the physical computing teaching tool and controlled things through programming and produced the educational portfolio to experience the whole process of problem analysis, design, implementation, and testing in coding. We applied Flow based coding and Pair programming as the teaching methods, and the results of the survey to measure the effectiveness of the study show that students have a good understanding of the entry and physical computing teaching tool and using the combination of the entry and physical computing teaching tool were more effective in learning than the Entry-only coding. In addition, it was confirmed that the effect of Pair programming applied in the physical computing teaching tool.

ON MULTIOBJECTIVE GENERALIZED SYMMETRIC DUAL PROGRAMS WITH $\rho-(\eta,0)$-INVEXITY

  • Nahak, C.
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.3
    • /
    • pp.797-804
    • /
    • 1998
  • A pair of multiobjective generalized symmetric dual non-linear programming problems and weak strong and converse dual-ity theorems for these problems are established under generalized $\rho-(\eta,0)$-invexity assumptions. Several known results are obtained as special cases.

An Integer Programming Approach to Packing Lightpaths on WDM Networks (파장분할다중화망의 광경로 패킹에 대한 정수계획 해법)

  • Lee, Kyungsik;Lee, Taehan;Park, Sungsoo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.32 no.3
    • /
    • pp.219-225
    • /
    • 2006
  • We consider a routing and wavelength assignment (RWA) for the efficient operation of WDM networks. For a given physical network, a set of selected pairs of nodes, the number of required connections for each selected pair of nodes, and a set of available wavelengths, the RWA is to realize as many connections as possible without wavelength collision. We give an integer programming formulation and an algorithm based on column generation. Though the proposed algorithm does not guarantee optimal solutions, test results show that the algorithm gives probably good solutions.

Generic Obstacle Detection on Roads by Dynamic Programming and Remapping of Stereo Images to a Virtual Top-View (스테레오영상의 가상의 탑뷰변환과 동적계획법에 의한 도로상의 장애물 검출)

  • Lee Ki Yong;Lee Joon Woong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.5
    • /
    • pp.418-422
    • /
    • 2005
  • In this paper, a novel algorithm capable of detecting generic obstacles on a flat surface is proposed. The algorithm fundamentally exploits a distortion phenomena taken place in remapping process of original stereo images to a virtual top-view. Based on the distortion phenomena, we construct stereo polar histograms of edge maps, detect peaks on them, and search for matched peaks on both histograms using a Dynamic Programming (DP). Eventually, the searched corresponding peaks lead to estimate obstacles' positions. The advantages of the proposed algorithm are that it is not largely affected by an intensity difference between a pair of stereo images and does not depend on the typical stereo matching methodologies. Furthermore, the algorithm identifies the obstacles' positions quite robustly.

The Educational Effects of Peer Agent System to Improve Problem-Solving Ability (문제해결력 향상을 위한 동료 에이전트 시스템의 교육적 효과)

  • Han, Keun-Woo
    • The Journal of Korean Association of Computer Education
    • /
    • v.12 no.4
    • /
    • pp.1-11
    • /
    • 2009
  • There are several studies in order to learn about programming language. This paper develops a peer agent system based on teaching and learning strategies in order to improve problem-solving ability. Problem-solving ability involves three components - content understanding, domain-dependent problem-solving strategies, and self-regulation. This paper shows the teaching and learning strategies about components of problem-solving for learning to program and the peer agent system uses the teaching and learning strategies. This study intents to analyze the educational effects of the peer agent system. The results show that the system has superior effects on problem-solving ability compared to traditional programming courses or pair programming courses. It means that the peer agent system is the effective educational system in improving student's problem-solving ability.

  • PDF

Tabu Search Algorithm for Frequency Reassignment Problem in Mobile Communication Networks (주파수 재할당 문제 해결을 위한 타부 서치 알고리듬 개발)

  • Han, Junghee
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.31 no.1
    • /
    • pp.1-9
    • /
    • 2005
  • This paper proposes the heuristic algorithm for the generalized GT problems to consider the restrictions which are given the number of machine cell and maximum number of machines in machine cell as well as minimum number of machines in machine cell. This approach is split into two phase. In the first phase, we use the similarity coefficient which proposes and calculates the similarity values about each pair of all machines and sort these values descending order. If we have a machine pair which has the largest similarity coefficient and adheres strictly to the constraint about birds of a different feather (BODF) in a machine cell, then we assign the machine to the machine cell. In the second phase, we assign parts into machine cell with the smallest number of exceptional elements. The results give a machine-part grouping. The proposed algorithm is compared to the Modified p-median model for machine-part grouping.

An Algorithm for Computing the Reliability of Multiple Terminal-Pairs (다중 터미널 신뢰도 계산을 위한 효율적 알고리즘)

  • 하경재;김원경
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.385-388
    • /
    • 2000
  • The computation of a terminal-pair reliability is started with a Boolean sum of products expression corresponding to simple paths of the pair of nodes. This expression is then transformed into another equivalent expression to be a Sum of Disjoint Products form. The terminal reliability can then be obtained in a straightforward manner from the Sum of Disjoint Products form. In this paper, we proposed an efficient method to obtain reliability expressions for calculating multiple K terminal-pairs reliability between terminal-pairs of nodes of computers of complex networks. Actual programming results show that the new method is superior with regard to computational efficiency, especially for computing the reliability of multiple terminals.

  • PDF

A Near Minimum-Time Trajectory Planning for Two Robots Using Dynamic Programming Technique (다이나믹 프로그래밍에 의한 두 대의 로보트를 위한 최소시간 경로계획)

  • 이지홍;오영석
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.11
    • /
    • pp.36-45
    • /
    • 1992
  • A numerical trajectory planning method for path-constrained trajectory planning is proposed which ensures collision-free and time-optimal motions for two robotic manipulators with limited actuator torques and velocities. For each robot, physical constraints of the robots such as limited torques or limited rotational velocities of the actuators are converted to the constraints on velocity and acceleration along the path, which is described by a scalar variable denoting the traveled distance from starting point. Collision region is determined on the coordination space according to the kinematic structures and the geometry of the paths of the robots. An Extended Coordination Space is then constructed` an element of the space determines the postures and the velocities of the robots, and all the constraints described before are transformed to some constraints on the behaviour of the coordination-velocity curves in the space. A dynamic programming technique is them provided with on the discretized Extended Coordination Space to derive a collision-free and time-optimal trajectory pair. Numerical example is included.

  • PDF

The Method of Extended Extreme Programming for Content Software Development Environment (콘텐츠 소프트웨어 개발 환경을 위해 확장된 익스트림 프로그래밍 방법)

  • Seo, Yeung-Su;Jung, Hun;Kang, Byung-Wook
    • Journal of the Korea society of information convergence
    • /
    • v.1 no.1
    • /
    • pp.33-40
    • /
    • 2008
  • When performing a software development project, the most important thing is building a result with planned quality within development period. Particularly, if the project is delayed or has no good quality in the case of the content software development project which is sensitive to the release time and quality, it is immediately connected to the failure of the whole project. Extreme programming is a methodology that divides the development cycle into smaller units for reducing the risk factor of the project in which the development period is important. In this paper, we suggest the expanded extreme programming which can consider the development period and quality at the same time for content software development environment. The suggested methods are documentation mechanism that is upcoming during the development project and multiple role model which is extended from pair programming method.

  • PDF