• 제목/요약/키워드: space programming

검색결과 433건 처리시간 0.027초

Development of a Dynamic Simulator for Moving Capability Estimation of Track Vehicle (궤도 차량의 기동성능 예측을 위한 동적 시뮬레이터 개발)

  • Kim, Ch.S.;Chang, Y.H.;Lee, K.S.;Kim, Y.T.;Han, S.H.
    • Proceedings of the KSME Conference
    • /
    • 대한기계학회 2000년도 춘계학술대회논문집A
    • /
    • pp.666-671
    • /
    • 2000
  • In this paper, we developed a Windows 95 version off-line programing system which can simulate a track vehicle model in 3D graphics space. The track vehicle was adopted as an objective model. The interface between users and the off-line program system in the Windows 95's graphic user interface environment was also studied The developing language is Microsoft Visual C++. Graphic libraries, OpenGL, by Silicon Graphics, Inc. were utilized for 3D Graphics.

  • PDF

An (S-1, S) Spare-Part Inventory Model for Multi-Stage Machine Repair Problem (다단계 기계수리문제의 (S-1, S) 예비품 재고정책에 관한 연구)

  • Seo, Yong-Seong;Jeong, Sang-Hwan;Park, Yeong-Taek
    • Journal of Korean Society for Quality Management
    • /
    • 제19권1호
    • /
    • pp.129-140
    • /
    • 1991
  • This paper deals with on (S-1, S) spare-part inventory model for multi-stage machine repair problem with attrition. The steady-state availability of the system is maximized under some constraints such as total cost, available space etc.. The problem is formulated as a closed queueing network and the system availability is calculated by Buzen's computational algorithm. In order to find the optimal numbers of spare units and repair channels for each operating stage, the problem is formulated as a non-linear integer programming(NLIP) problem and an efficient algorithm. which is a natural extension of the new Lawler-Bell algorithm of Sasaki et el., is used to solve the NLIP problem. A numerical example is given to illustrate the algorithm.

  • PDF

Studies on the Computer Programming for Searching the Simple Paths and Its Applications(Summary) (단순경로탐색(單純經路探索)의 프로그래밍 및 그 응용(應用)에 관(關)한 연구(硏究)(선합(線合)))

  • Jeong, Su-Il
    • Journal of Korean Society for Quality Management
    • /
    • 제11권2호
    • /
    • pp.10-17
    • /
    • 1983
  • The former paper (Part I) studies two methods for searching and determining the simple paths in an acyclic or a cyclic network. The two methods are computer programmed as subroutines (SPLP1 and SPLP2) for various use. And a few examples of its applications are discussed Another paper (Par II) studies the reliability computation for a network by using the Event Space Methods. A computer program is developed for the computation by applying the SPLP2 subroutine subprogram. In this paper the former results are summarized with another computer program for reliability computation by using the Path Tracing Methods. The two subroutines appear in the Appendix as reference for others. The programs can be used in the reliability computation of reducible and irreducible structure networks.

  • PDF

Integrated Control System Design of SCARA Robot Based on OLP (OLP를 이용한 스카라 로봇의 통합제어 시스템 설계)

  • 정경규;정동연;신행봉;장영희;한성현;이만형
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 한국공작기계학회 2000년도 추계학술대회논문집 - 한국공작기계학회
    • /
    • pp.119-124
    • /
    • 2000
  • We developed a Off-Line Graphic Simulator which can simulate a robot model in 3D graphics space in Windows 95 version. 4 axes SCARA robot was adopted as an objective model. Forward kinematics, inverse kinematics and robot dynamics modeling were included in the developed program The interface between users and the off-line program system in the Windows 95's graphic user interface environment was also studied. The developing language is Microsoft Visual C++. Graphic libraries, OpenGL, by Silicon Graphics, Inc. were utilized for 3D graphics.

  • PDF

Effective Biological Sequence Alignment Method using Divide Approach

  • Choi, Hae-Won;Kim, Sang-Jin;Pi, Su-Young
    • Journal of Korea Society of Industrial Information Systems
    • /
    • 제17권6호
    • /
    • pp.41-50
    • /
    • 2012
  • This paper presents a new sequence alignment method using the divide approach, which solves the problem by decomposing sequence alignment into several sub-alignments with respect to exact matching subsequences. Exact matching subsequences in the proposed method are bounded on the generalized suffix tree of two sequences, such as protein domain length more than 7 and less than 7. Experiment results show that protein sequence pairs chosen in PFAM database can be aligned using this method. In addition, this method reduces the time about 15% and space of the conventional dynamic programming approach. And the sequences were classified with 94% of accuracy.

Estimation of transformation parameters using shape matching (형상 정합을 통한 변환 파라미터 추출)

  • 박용희;전병호;김태균
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제22권7호
    • /
    • pp.1523-1533
    • /
    • 1997
  • Image registration is concerned with the establishment of correspondence between images of the same scene with translational, rotational, and scaling differences. The estimated transformation parameters between images are very important information in the field of many applications. In this paper, we propose a shape matching scheme for finding correspondence points for images with various differences, Tranditional solutions to this area are unreliable for the rotational and schaling changes between images, and the feature extraction of partially occluded scene. To solve those problems, dominant points on digital curves are detected by scale-space filtering, and initial matching is performed by similarity measure of cumulative curvatures for dominant points. For initial matching segments pairs, optimal matching points are calculated using dynamic programming.Finally, transformation parameters are estimated.

  • PDF

A Comparative Reliability Evaluation of Rod Control Mechanisms with Corresponding for Nuclear Power Plants (원전용 제어봉구동장치의 해석적인 신뢰성 비교 평가)

  • Kwon, S.;Ahn, J.B.;Cheon, J.M.;Lee, J.M.;Shin, J.R.
    • Proceedings of the KIEE Conference
    • /
    • 대한전기학회 2002년도 하계학술대회 논문집 D
    • /
    • pp.2646-2648
    • /
    • 2002
  • This paper deals with a comparative evaluation of the reliability of control rod drive mechanisms including their driving methods for nuclear power plants. Basically there exist two types of electromagnetic-jack-type drive mechanisms in commercial use that are called as Control Rod Drive Mechanism and Control Element Drive Mechanism. Each type has corresponding drive sequence to make the movements of insertion and withdrawal. A state-space model is derived for each model graphically. Then the evaluation of the reliability is carried out on the programming tool called SHARPE. The evaluation does not give any meaningful numerical values for the reliability but just shows a relative degree to each other in view of reliability.

  • PDF

Information Propagation Neural Networks for Real-time Recognition of Vehicles in bad load system (최악환경의 도로시스템 주행시 장애물의 인식율 위한 정보전파 신경회로망)

  • Kim, Jong-Man;Kim, Won-Sop;Lee, Hai-Ki;Han, Byung-Sung
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 한국전기전자재료학회 2003년도 춘계학술대회 논문집 기술교육전문연구회
    • /
    • pp.90-95
    • /
    • 2003
  • For the safety driving of an automobile which is become individual requisites, a new Neural Network algorithm which recognized the load vehicles in real time is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion. In the network, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of vehicles, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through several simulation experiments, real time reconstruction of the nonlinear image information is processed. 1-D LIPN hardware has been composed and various experiments with static and dynamic signals have been implemented.

  • PDF

Townscape in a High-rise: Imageability and Accessibility of Vertical Malls in Hong Kong

  • Tan, Zheng
    • International Journal of High-Rise Buildings
    • /
    • 제4권2호
    • /
    • pp.143-152
    • /
    • 2015
  • The increasing integration of public space and consumerism in Hong Kong has yielded new urban forms. The emergent vertical malls in Hong Kong and other East Asian metropolises have overturned the existing vertical order of the city. This vertical order is determined by the level of accessibility, but is being challenged by widely adopted vertical circulation technology. Inspired by Fredric Jameson's and Rem Koolhaas' reflections on the cultural significance of vertical transportation, this article examines the conflict between market logic and urban design requirements in the vertical interior spaces. "Departmentalization," as the current programming formula for vertical malls, can be further optimized by critically applying urban design doctrines such as Kevin Lynch's five elements of city image. It concludes with a statement that the knowledge base of vertical urbanism should be open to a set of new terminology informed by a new technological environment.

An Optimization of the Ships Building Mix under Dock -Space and Resource Constraints (도크 공간 및 자원 제약하의 선박 건조 혼합의 최적화)

  • Kim Yeon-Min
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 한국경영과학회 2004년도 추계학술대회 및 정기총회
    • /
    • pp.245-249
    • /
    • 2004
  • This paper deals with two most important problems, from both practical and theoretical standpoints, arising when building the ships in docks. Such docks have become core components of modern ship construction. One problem is to minimize the number of building docks in the shipyard, while the other is to keep the usage rate of resources fed into dock as constant as possible. In this paper the combined problem is formulated as a single-integer programming model. The LP-relaxation of this model is solved by column-generation techniques. The results of an experimental evaluation show that the lower bounds are tight. Practical applications of this formulation are also discussed.

  • PDF