• Title/Summary/Keyword: 사이클

Search Result 2,975, Processing Time 0.024 seconds

Reliability Prediction of Liquid Rocket Engines for Different Propellant and Engine Cycles (추진제 및 연소 사이클을 고려한 액체로켓 엔진의 신뢰도 예측)

  • Kim, Kyungmee O.
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.44 no.2
    • /
    • pp.181-188
    • /
    • 2016
  • It is known that reliability of liquid rocket engines depends on the design thrust, propellant, engine cycle, and hot firing test time. Previously, a method was developed for estimating reliability of a new engine by adjusting the design thrust and hot firing test time of reference engines where reference engines have the same propellant and engine cycle with the new engine. In this paper, we provide a procedure to predict the engine reliability when the new engine and the reference engine have different propellant and engine cycles. The proposed method is illustrated to estimate the engine reliability of the first stage of Korea Space Launch Vehicle II.

Maximum Power Output Condition of the Binary Power Cycle Composed of Two Carnot Cycles (이중 동력 사이클의 최대 출력 조건)

  • 김창욱;김수연;정평석
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.15 no.1
    • /
    • pp.349-354
    • /
    • 1991
  • The power output behavior of the binary cycle composed of two Carnot cycles is analyzed with considering heat transfer processes, in which the finitely constant temperature differences between heat sources and working fluids exists. The power output has the maximum value as an extremum for cycle temperatures and capacities of heat exchangers. In the internally reversible cycle, the power output is independent of the cycle temperature in the intermediate heat exchanger. In this case when the total capacities of heat exchangers are given, three heat exchangers have the same capacities at the maximum power output condition. In addition, when the cycle is not extremum for cycle temperatures and capacities of heat exchangers. At the maximum power output condition, the capacity of heat exchanger at the cold side is slightly more than the hot side as the cycle effectiveness decreases.

Basic Static Characteristics of a Closed and a Regeneration Cycles for the OTEC System (해양온도차발전 Closed and Regeneration Cycle의 기본 정특성)

  • Cha, Sang-Won;Kim, You-Taek;Mo, Jang-Oh;Lim, Tae-Woo;Lee, Young-Ho
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.36 no.8
    • /
    • pp.1151-1157
    • /
    • 2012
  • Ocean Thermal Energy Conversion(OTEC) technology is one of the new and renewable energy that utilizes the natural temperature gradient that exists in the tropical ocean between warm surface water and the deep cold water, to generate electricity. The selection of working fluid and the OTEC cycle greatly influence the effect on the system operation, and it's energy efficiency and impacts on the environment. Working fluids of the OTEC are ammonia, R22, R407C, and R410A. In this paper, we compared boiling pressure to optimize OTEC system at $25^{\circ}C$. Also, this paper showed net-power and efficiency according to working fluids for closed cycle and regeneration cycle.

System Kinetic Model based Cycle Slip Free Technique for GPS Carrier Phase Precise Positioning (GPS 반송파 기반의 정밀 상대 항법에서 운동 모델 적용을 통한 사이클 슬립 대응 기법)

  • Chun, Se-Bum;Heo, Moon-Beom;Nam, Gi-Wook
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.4
    • /
    • pp.502-509
    • /
    • 2011
  • It is necessary to resolve integer ambiguity in GPS carrier based precise positioning. If there is no signal blockage or cycle slip, the integer ambiguity does not changed. however, signal blockage and cycle slip occur frequently under real operational environment. under this situation, integer ambiguity maintenance is indispensable for continuity of navigation information. In this paper, a cycle slip free technique is proposed for simplifying integer ambiguity maintenance procedure. this technique tested with simulated carrier phase signal with cycle slip aided intentionally. As a result, the proposed technique can give navigation information continuously even if cycle slip is occured.

A Constant Time Parallel Algorithm for Finding a Vertex Sequence of the Directed Cycle Graph from the Individual Neighborhood Information (각 정점별 이웃 정보로부터 유향 사이클 그래프의 정점 순서를 찾는 상수 시간 병렬 알고리즘)

  • Kim, Soo-Hwan;Choi, Jinoh
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.773-775
    • /
    • 2013
  • In this paper, we consider the problem for finding a vertex sequence of the directed cycle graph from the individual neighborhood information on a reconfigurable mesh(in short, RMESH). This problem can be solved in linear time using a sequential algorithm. However, it is difficult to develop a sublinear time parallel algorithm for the problem because of its sequential nature. All kinds of polygons can be represented by directed cycles, hence a solution of the problem may be used to solving problems in which a polygon should be constructed from the adjacency information for each vertex. In this paper, we present a constant time $n{\times}n^2$ RMESH algorithm for the problem with n vertices.

  • PDF

Enhancement of MCFC System Performance by Adding Bottoming Cycles (하부 사이클 추가에 의한 MCFC 시스템의 성능향상)

  • Ji, Seung-Won;Park, Sung-Ku;Kim, Tong-Seop
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.34 no.10
    • /
    • pp.907-916
    • /
    • 2010
  • Integration of various bottoming cycles such as the gas turbine (GT) cycle, organic Rankine cycle, and oxy-fuel combustion cycle with an molten carbonate fuel cell (MCFC) power-generation system was analyzed, and the performance of the power-generation system in the three cases were compared. Parametric analysis of the three different integrated systems was carried out under conditions corresponding to the practical use and operation of MCFC, and the optimal design condition for each system was derived. The MCFC/oxy-combustion system exhibited the greatest power upgrade from the MCFC-only system, while the MCFC/GT system showed the greatest efficiency enhancement.

Data Life Cycle Proposal for Research Data Management (연구 데이터 관리를 위한 데이터 라이프 사이클 제안)

  • Kim, Juseop;Kim, Suntae;Jeon, Yerin
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.53 no.4
    • /
    • pp.309-340
    • /
    • 2019
  • Although overseas countries have already developed data life cycle for the preservation and curation of data since the 1990s, the research in Korea has been very insufficient. In this study, we analyzed the data life cycles developed in DCC, ICPSR, IWGDD, DataONE, USGS and UKDA to propose data life cycle for efficient management of research data. As a result of the analysis, the common components derived are 'Plan', 'Create & Collect', 'Process', 'Preserve', 'Dispose', 'Access & Use', 'Describe', 'Assure' and 'Backup & Secure'. In addition, the nine components were subdivided into stages to describe the details to be carried out at that stage. It is expected that the content of this study will be applicable in the future development of data life cycle for research data management in Korea.

Advanced Dual Refrigerant Expansion Cycle for LNG Liquefaction (천연가스 액화용 이중 냉매 팽창 사이클)

  • Kim, Minki;Kim, Mungyu;Lee, Kihwan;Kim, Hyobin;Lee, Donghun;Min, Joonho;Kim, Jinmo
    • Plant Journal
    • /
    • v.15 no.2
    • /
    • pp.46-55
    • /
    • 2019
  • This paper presents a LNG Liquefaction cycle configuration using two stages of methane expansion (i.e. spliting into two stages as warm & cold to generate an additional inflection point within a cold composite curve) and a single stage of nitrogen expansion to improve the efficiency of the conventional Methane & Nitrogen Expansion Cycle. In comparison with Double Nitrogen Expansion Cycel and Methane & Nitrogen Expansion Cycle, the cycle efficiency has increased approximately from 13.92 and 13.13 to 12.08 kW/ton/day (8~15% efficiency increase). A Life Cycle Cost (LCC) analysis based on Net Present Value (NPV) also show an improvement in therms of project NPV, against a minor increment of a CAPEX.

Personal Information life Cycle Model Considering the Learning Cha racteristics of Artificial Intelligence (인공지능의 학습 특성을 고려한 개인정보 라이프 사이클 모델)

  • Jaeyoung Jang;Jong-Min Kim
    • Convergence Security Journal
    • /
    • v.24 no.2
    • /
    • pp.47-53
    • /
    • 2024
  • The traditional personal information life cycle model, primarily tailored to conventional systems, is inherently unsuitable for comprehending the nuances of personal information flow within artificial intelligence frameworks and for formulating effective protective measures. Therefore, this study endeavors to introduce a personal information life cycle model specifically designed for artificial intelligence (AI). This paper presents a personal information life cycle model suitable for artificial intelligence, which includes the stages of collection, retention, learning, use, and destruction/suspension, along with the re-learning process for destruction/suspension. Subsequently, we compare the performance of these existing models (such aspersonal information impact assessment and the ISMS-P model) with the newly proposed model. This underscores the superiority of our proposed model in comprehensively understanding the personal information flow in AI and establishing robust protective measures.

Cycle Detection Using Single Edge Node Pruning (단일 간선 노드 전정 사이클 검출)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.1
    • /
    • pp.149-154
    • /
    • 2024
  • This paper proposes an algorithm that remedy Floyd's the tortoise and the hare algorithm (THA) shortcomings which is specialized in singly linked list (SLL), so this algorithm fails to detect the cycle in undirected graph, digraph, and tree with multiple inputs or outputs. The proposed algorithm simply pruning the source and sink with only one edge using cycle detection of single edge node pruning. As a result of the experimental of various list, undirected graph, digraph, and tree, the proposed algorithm can be successively detect the cycle all of them. Thus, the proposed algorithm has the simplest and fastest advantage in the field of cycle detection.