• 제목/요약/키워드: Programming complexity

검색결과 211건 처리시간 0.026초

Deadlock과 Workload에 따른 FMS의 버퍼 Capacity 결정에 관한 연구 (A Study of Buffer Allocation in FMS based on Deadlock and Workload)

  • 김경섭;이정표
    • 한국시뮬레이션학회논문지
    • /
    • 제9권2호
    • /
    • pp.63-73
    • /
    • 2000
  • Due to the complexity of part flow and limited resources, FMS(Flexible Manufacturing System) develops blocking, starvation and deadlock problems, which reduce its performance. In order to minimize such problems buffers are imposed between workstations of the manufacturing lines. In this paper, we are concerned with finding the optimal buffer allocation with regard to maximizing system throughput in limited total buffer capacity situation of FMS. A dynamic programming algorithm to solve the buffer allocation problem is proposed. Computer simulation using Arena is experimented to show the validation of the proposed algorithm.

  • PDF

POLYNOMIAL CONVERGENCE OF PREDICTOR-CORRECTOR ALGORITHMS FOR SDLCP BASED ON THE M-Z FAMILY OF DIRECTIONS

  • Chen, Feixiang;Xiang, Ruiyin
    • Journal of applied mathematics & informatics
    • /
    • 제29권5_6호
    • /
    • pp.1285-1293
    • /
    • 2011
  • We establishes the polynomial convergence of a new class of path-following methods for semidefinite linear complementarity problems (SDLCP) whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the well known algorithms for linear programming, namely the predictor-corrector algorithm of Mizuno and Ye, carry over to the context of SDLCP.

POLYNOMIAL CONVERGENCE OF PRIMAL-DUAL ALGORITHMS FOR SDLCP BASED ON THE M-Z FAMILY OF DIRECTIONS

  • Chen, Feixiang
    • Journal of applied mathematics & informatics
    • /
    • 제30권1_2호
    • /
    • pp.127-133
    • /
    • 2012
  • We establish the polynomial convergence of a new class of path-following methods for SDLCP whose search directions belong to the class of directions introduced by Monteiro [3]. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP.

문제중심학습(Problem-Based Learning)을 적용한 비주얼베이식(VisualBasic) 프로그래밍 학습의 사례 연구 (A Case Study of VisualBasic Programming Learning based on Problem-Based Learning)

  • 손경아
    • 컴퓨터교육학회논문지
    • /
    • 제5권1호
    • /
    • pp.17-25
    • /
    • 2002
  • 학습자중심의 문제중심 학습이 정보산업고등학교 프로그래밍 교과에 적용되는 과정을 알아보기 위해 사례연구를 실시하였다. 프로그래밍 학습은 프로그램을 사용하는 목적과 적용하는 문제상황에 따라 학습해야할 기능과 기법이 매우 다양하고 복잡하므로 학습의 맥락에 따라 적합한 문제를 제공하는 것이 중요하기 때문에 학습자가 비주얼베이식 프로그램으로 퀴즈문제를 개발하는 학습내용을 선정하였다. 개발과정에서 학습자는 다양한 사례를 토대로 문제를 작성하고 개발에 필요한 프로그램 기능을 선택하여 협동학습을 통해 문제를 해결하였고 동료평가와 모둠별 평가를 실시하였다. 학습 후 실시한 서술식 설문조사 결과 학습자들은 자신의 학습 상태를 명확히 파악할 수 있었고 학습태도와 참여가 높아져 만족감과 자신감이 증가하였으며 협동학습을 통해 다양한 경험을 할 수 있었다고 하였다.

  • PDF

응용프로그램 인터페이스를 활용한 주문형 유연 CAD 시스템 개발 (Development Strategy for Customized Flexible CAD Systems Using Application Programming Interface)

  • 신정호;곽병만
    • 대한기계학회논문집A
    • /
    • 제28권1호
    • /
    • pp.92-99
    • /
    • 2004
  • With the advent of computers, CAD systems are widely used for various design practice. Complexity of CAD systems and difficulty of exchanging data among different CAD systems, however, do not allow efficient use as desired. In addition, to follow variety of designers' need, CAD activities should be customized. This article proposed a methodology fer developing an intelligent CAD system and the sate-of-the-art technologies described fur customizing CAD systems using API (Application Programming Interface). A basic platform is proposed and a useful application system is implemented to enable a parametric design by directly inputting numerical values on a CAD model. Based on this application, we developed a system that makes it possible to share part family data between SolidEdge and Pro/Engineer. The proposed concept on intelligent CAD systems facilitates integration of external systems such as CAE tools and promotes the use of CAD for both engineering designers and analysts.

객체지향 기술의 확산에 영향을 주는 요인에 관한 경험적 연구 (An Empirical Study on the Factors Affecting Diffusion of Objeccl-Oriented Technology)

  • 이민화
    • 한국정보시스템학회지:정보시스템연구
    • /
    • 제10권1호
    • /
    • pp.97-126
    • /
    • 2001
  • Object-orientation has been proposed as a promising software process innovation to improve software productivity and quality. It has not been understood clearly, however, what factors influences the diffusion of object-oriented technology in organizations. A research model was formulated and hypotheses were generated based on the literature of information technology implementation and software process innovation. To test the research hypotheses, a questionnaire survey was conducted. The results based on 121 responses from Korean companies revealed that project characteristics, use of external experts, and number of development projects are significantly related to the diffusion of object-oriented analysis and design and object-oriented programming. Innovation champion is positively related to the diffusion of object-oriented analysis and design, whereas it is not related to the diffusion of object-oriented programming language. Only project complexity was significantly related to the diffusion of visual programming language. On the other hand, organizational size was not significantly related to any object-oriented technology in this study.

  • PDF

Automated yield-line analysis of beam-slab systems

  • Johnson, David
    • Structural Engineering and Mechanics
    • /
    • 제3권6호
    • /
    • pp.529-539
    • /
    • 1995
  • The rigid-plastic yield-line analysis of isotropically reinforced concrete slabs acting in conjunction with torsionally weak supporting beams is developed as the lower-bound form of a linear programming formulation. The analysis is extended to consider geometric variation of chosen yield-line patterns by the technique of sequential linear programming. A strategy is followed of using a fine potential yield-line mesh to identify possible collapse modes, followed by analysis using a coarser, simplified mesh to refine the investigation and for use in conjunction with geometric optimization of the yield-line system. The method is shown to be effective for the analysis of three slabs of varying complexity. The modes detected by the fine and simplified analyses are not always similar but close agreement in load factors has been consistently obtained.

시간 복잡도를 개선한 웹 서버 배치 알고리즘 (A Replica Placement Algorithm reducing Time Complexity)

  • 김선호;윤미연;신용태
    • 정보처리학회논문지C
    • /
    • 제11C권3호
    • /
    • pp.345-352
    • /
    • 2004
  • Recently, contents distribution technologies have been used to cope with the explosive demand for Web services. In this paper, we addressed the issue of the optimal placement of replicas in the environment where Web contents are replicated. We placed replicas so that clients can have access to replicas with the proper delay and bandwidth. We attempted to solve the problem via dynamic programming considering cost of delay and traffic We have come up with time complexity that is less than $O(n^2)$. We defined the threshold and proved that our algorithm guarantees the reliable services.

이기종 클러스터 시스템에서 Cilk와 MPI 특성 비교 (Comparing Cilk and MPI on a heterogeneous cluster system)

  • 이규호;김준성
    • 전자공학회논문지CI
    • /
    • 제44권4호통권316호
    • /
    • pp.21-27
    • /
    • 2007
  • 최근 수년간의 급속한 기술의 발전과 대량생산 체제의 영향으로 개인용 컴퓨터와 간단한 네트워크 장비를 이용한 클러스터 시스템 구현이 용이해졌으나 개인용 컴퓨터의 교체 주기가 짧아짐에 따라 시스템 구성을 자유롭게 할 수 있는 클러스터 시스템의 이기종화를 초래하였다. 이기종 클러스터 시스템을 이용하여 구축된 병렬처리 시스템의 경우 그 성능을 효율적으로 사용하기 위해서는 각 노드의 성능을 고려한 작업 관리가 필요하다. 본 연구에서는 이기종 클러스터 시스템에서 MPI와 Cilk 병렬처리 시스템의 특성을 성능측면에서의 speedup과 활용도측면에서의 프로그램 코드의 복잡도를 정량적으로 살펴보았다. 실험에 따르면 작은 데이터를 이용하는 경우 Cilk가, 큰 데이터를 이용하거나 정규화된 데이터 교환 형태를 갖는 경우 MPI가 더 좋은 성능을 보였으며 코드 복잡도의 경우 Cilk가 간결한 프로그래밍 스타일을 제공함을 보였다.

협대역 통신시스템을 위한 전처리기-등화기 구조의 FIR 여파기 설계 (Design of FIR filters with Prefilter-Equalizer Structure for Narrowband Communication Systems)

  • 오혁준;안희준
    • 한국통신학회논문지
    • /
    • 제30권6C호
    • /
    • pp.577-584
    • /
    • 2005
  • 본 연구는 협대역 통신시스템을 위한 전처리기-등화기 구조의 여파기에서, 곱셈기를 사용하지 않는 최소 복잡도의 디지털 FIR 여파기를 설계하는 방법을 제안한다. 제안하는 여파기는 순환 다항식(cyclotomic polynomial, CP) 여파기와 2차 내삽 다항식(interpolated second order polynomial, ISOP) 등화기로 구성되며, 이 두 여파기가 동시에 혼합 정수 선형 계획법(mixed integer linear programming (MILP))으로 최적 설계되어 최소의 복잡도를 갖는 특성을 갖게 된다. 제안된 방식으로 설계된 여파기들은, 설계 규격을 만족하면서도 기존의 여파기에 비하여 복잡도면에서 월등히 간단함을 확인하였다.