• 제목/요약/키워드: Time-space diagram

검색결과 86건 처리시간 0.021초

작업공간과 자원의 여유시간 최소화를 통한 반복작업 공정계획기법 (Network Compression by Saying Idle Time of Resources and Spaces for Repetitive Activities)

  • 이규진
    • 한국건설관리학회논문집
    • /
    • 제1권3호
    • /
    • pp.75-80
    • /
    • 2000
  • 공간의 분할이 많은 건축공사에서는 반복적 특성으로 인해 공정계획상에 다수의 대안이 존재한다. 공사기간은 각 액티비티의 기간뿐 아니라 반복되는 액티비티의 배열방법에 의해서도 많은 영향을 받는다. 본 연구는 각 액티비티에 적정한 선행 액티비티를 할당함으로써 여유시간을 최소화하는 공정계획기법을 제시하는 것을 목적으로 진행되었다. Line of Balance 기법을 기본으로 하는 기존연구와는 달리 본 연구에서는 AON방식의 네트워크 기법을 기본으로 하여 공간과 자원의 두 축 사이에 액티비티를 배열하였다. 각 액티비티별로 자원과 공간의 양방향으로 가장 적절한 선행 액티비티를 검색하여 여유시간을 최소화한다. 본 연구에서 제시한 액티비티 배열방법을 공동주택공사 건설공사를 대상으로 적용한 결과, 액티비티 배열을 달리함에 따라서 다수의 대안이 존재함을 확인할 수 있었으며 그중 적정대안을 찾아낼 수 있었다. 본 기법은 공동주택공사와 같은 다수의 유사공간으로 구성된 건설공사의 공정 계획에 도움을 줄 수 있을 것으로 판단된다.

  • PDF

장치와 태스크 간 입출력 데이터 교환의 예측성 향상 방안 (METHODOLOGY TO ENHANCE THE PREDICTABILITY OF I/O DATA EXCHANGE BETWEEN DEVICE AND TASKS)

  • 구철회;양군호;최성봉
    • Journal of Astronomy and Space Sciences
    • /
    • 제24권4호
    • /
    • pp.451-456
    • /
    • 2007
  • 장치로부터 발생된 데이터는 소프트웨어에서 사용되기 위해 최대한 정확한 시간에 데이터의 완결성을 가지고 해당 태스크에 전달되어야 한다. 이 과정에서 구조적인 위험성과 성능 저하가 발생할 원인이 잠재되어 있다. 이 논문은 장치와 태스크 사이에서 I/O 데이터 교환이 발생할 시 충돌에 의해서 발생가능한 데이터 손실을 예방할 수 있는 방안을 기술한다. 이 논문에서 기술하는 방안에 대한 메커니즘의 예시도를 제안하고 그 효과 및 장단점을 고찰하였다.

트리즈의 물리적 모순에 대한 모순해결 나비모형의 모순관계와 해결차원 분류 (Classification of Contradiction Relations and their Solving Dimensions based on the Butterfly Model for Contradiction Solving for Physical Contradiction of TRIZ)

  • 현정석;박찬정
    • 지식경영연구
    • /
    • 제15권4호
    • /
    • pp.15-34
    • /
    • 2014
  • Creative problem solving has become an important issue in many fields. Among problems, dilemma need creative solutions. New creative and innovative problem solving strategies are required to handle the contradiction relations of the dilemma problems because most creative and innovative cases solved contradictions inherent in the dilemmas. Among various kinds of problem solving theories, TRIZ provides the concept of physical contradiction as a common problem solving principle in inventions and patents. In TRIZ, 4 separation principles solve the physical contradictions of given problems. The 4 separation principles are separation in time, separation in space, separation within a whole and its parts, and separation upon conditions. Despite this attention, an accurate definitions of the separation principles of TRIZ is missing from the literature. Thus, there have been several different interpretations about the separation principles of TRIZ. The different interpretations make problems more ambiguous to solve when the problem solvers apply the 4 separation principles. This research aims to fill the gap in several ways. First, this paper classify the types of contradiction relations and the contradiction solving dimensions based on the Butterfly model for contradiction solving. Second, this paper compares and analyzes each contradiction relation type with the Butterfly diagram. The contributions of this paper lies in reducing the problem space by recognizing the structures and the types of contradiction problems exactly.

UBV I CCD PHOTOMETRY OF THE OPEN CLUSTERS NGC 4609 AND HOGG 15

  • Kook, Seung-Hwa;Sung, Hwan-Kyung;Bessell, M.S.
    • 천문학회지
    • /
    • 제43권5호
    • /
    • pp.141-152
    • /
    • 2010
  • UBV I CCD photometry is obtained for the open clusters NGC 4609 and Hogg 15 in Crux. For NGC 4609, CCD data are presented for the first time. From new photometry we derive the reddening, distance modulus and age of each cluster - NGC 4609 : E(B-V ) = $0.37{\pm}0.03$, $V_0-M_V=10.60{\pm}0.08$, log $\tau$= 7.7 $\pm$ 0.1; Hogg 15 : E(B - V ) = 1.13 $\pm$ 0.11, $V_0-M_V$ = 12.50 $\pm$ 0.15, log $\tau$ $\lesssim$ 6.6. The young age of Hogg 15 strongly implies that WR 47 is a member of the cluster. We also determine the mass function of these clusters and obtain a slope $\Gamma$ = -1.2 ($\pm$0.3) for NGC 4609 which is normal and a somewhat shallow slope (${\Gamma}=-0.95{\pm}0.5$) for Hogg 15.

다수 위협에 대한 무인항공기 최적 경로 계획 (Optimal Path Planning for UAVs under Multiple Ground Threats)

  • 김부성;방효충;유창경;정을호
    • 한국항공우주학회지
    • /
    • 제34권1호
    • /
    • pp.74-80
    • /
    • 2006
  • 본 논문은 레이더와 같은 지상의 다수위협이 존재하는 상황에서 무인항공기의 비행경로 최적화에 관한 것이다. 레이더에 의한 피탐성, 즉 비행체에 의해 반사되는 레이더 신호강도를 최소화하면서 목적지까지의 비행시간을 최소화하는 관점에서 성능지수를 제안하였다. 1차의 시간지연 시스템으로 가정된 비행체의 경사각을 제어입력으로 고려하였으며, Sequential Quadratic Programming기법에 기반한 입력 파라미터 최적화 기법을 사용하여 궤적최적화를 수행하였다. 제안된 무인 항공기 경로계획 기법은 Voronoi 선도기법과 비교하였을 때, 생존성을 증대시키면서도 항공기의 역학적 특성을 고려한 비행경로를 제공한다.

식혜(食醯) 생산(生産)라인의 공정(工程)/배치(配置) 설계(設計)에 대한 사례 연구 (A Case Study for a Process/Layout Design of a Sikhye Production Line)

  • 양문희
    • 산업공학
    • /
    • 제16권4호
    • /
    • pp.450-462
    • /
    • 2003
  • In this paper, we deal with a process and layout design for producing a planned amount of Sikhye in a given limited time period under a reasonable production schedule. We represent a Sikhye production line as a vector N, the element of which denotes the number of tanks required in each process and our objective is to find an appropriate vector which minimizes the total investment cost. We suggest a systematic method for finding an appropriate N and an appropriate layout to N. In detail, first, we decide the required sequence of processes and the required operations for each process and we estimate standard operating times. Second, constructing a precedence diagram, we find a critical path in order to reduce the total production lead time for a batch of Sikhye. Third, given a limited N space, we manage to construct manually each production schedule using both the processing times of the critical operations and transfer times. Finally, we find an optimal vector N which gives a minimum investment cost and meets both the time constraint and quantity constraint. In addition, with the estimated relative size of each tank, we suggest an appropriate conceptual layout design including an expansion area for future demands, based on the span technique used in the field of architectural design.

수평방향의 정현파 가진을 받는 강체 블록의 비선형 록킹진동특성 (Nonlinear Rocking Vibration Characteristics for Rigid Block Subjected to Horizontal Sinusoidal Excitation)

  • 정만용;김정호;김지훈;정낙규;양인영
    • 한국안전학회지
    • /
    • 제14권4호
    • /
    • pp.3-12
    • /
    • 1999
  • This research concentrates on the influence of non-linearities associated with impact for the nonlinear rocking behavior of rigid block subjected to one dimensional sinusoidal excitation of horizontal direction. The transition of two governing rocking equations, the abrupt reduction in the kinetic energy associated with impact, and sliding motion of block. In this study, two type of rocking vibration system are considered. One is the undamped rocking vibration system, disregarding energy dissipation at impact and the other is the damped rocking system, including energy dissipation and sliding motion. The response analysis using non-dimensional rocking equation is carried out for the change of excitation parameters and friction coefficient. The chaos responses were discovered in the wide response region, particularly, for the case of high excitation amplitude and their chaos characteristics were examined by the time history, Poincare map, power spectra and Lyapunov Exponent of rocking responses. The complex behavior of chaos response, in the phase space, were illustrated by Poincare map. The bifurcation diagram and Poincare map were shown to be effective in order to understand chaos of rocking system.

  • PDF

REVISIT TO THE SUNSPOT CYCLES

  • Kim, K.T.
    • 천문학회지
    • /
    • 제24권1호
    • /
    • pp.117-127
    • /
    • 1991
  • Here I report the confirmation of a long-term modulation of a period of $92^{+21}_{-13}$ years with the "time-delay correlation" method on the sunspot data compiled over the last a total of 289 years. This periodicity better specifies the cycle which falls pretty well within Gleissberg cycle, and clearly contrasts with the 55 year grand cycle which Yoshimura (1979) claimed. It is argued that the period-amplitude diagram method. which Yoshimura used, ana lysed peak amplitudes only so that a large number of data were disregarded, and thus was more susceptible to a bias. The planetary tidal force on Sun as for the possible cause to the solar activity was investigated and its possibility was ruled out in view of no period correlation between them.

  • PDF

산개성단 M38 (NGC 1912) 영역의 새로운 변광성 I: δ Scuti와 γ Doradus 변광성 (NEW VARIABLE STARS IN THE REGION OF THE OPEN CLUSTER M38 (NGC 1912) I: δ SCUTI AND γ DORADUS TYPE STARS)

  • 전영범
    • 천문학논총
    • /
    • 제24권1호
    • /
    • pp.9-18
    • /
    • 2009
  • From the short-period variability survey (SPVS) in Bohyunsan Optical Astronomy Observatory, we obtained time-series BV CCD images in the region of an open cluster M38 (NGC 1912) for 23 nights from February 1, 2007 to December 7, 2008. We found 18 $\delta$ Scuti stars and 2 $\gamma$ Doradus stars. Among them, only 3 $\delta$ Scuti stars were known ones. From the color-magnitude diagram (CMD) of M38, most of them have been located in the instability strip. The two $\gamma$ Doradus stars have been located within $\gamma$ Doradus strip of M38. But, only four $\delta$ Scuti stars were located within radius 10' from the center of M38. To confirm of their membership for M38, we need more study, such as, proper motion by spectroscopic observation.

기하학적 해싱을 이용한 딜러니 개선 알고리듬의 가속화 (Acceleration of Delaunay Refinement Algorithm by Geometric Hashing)

  • 김동욱
    • 한국CDE학회논문집
    • /
    • 제22권2호
    • /
    • pp.110-117
    • /
    • 2017
  • Delaunay refinement algorithm is a classical method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. It computes the Delaunay triangulation for given points and edges to obtain an initial solution, and update the triangulation by inserting steiner points one by one to get an improved quality triangulation. This process repeats until it satisfies given quality criteria. The efficiency of the algorithm depends on the criteria and point insertion method. In this paper, we propose a method to accelerate the Delaunay refinement algorithm by applying geometric hashing technique called bucketing when inserting a new steiner point so that it can localize necessary computation. We have tested the proposed method with a few types of data sets, and the experimental result shows strong linear time behavior.