• Title/Summary/Keyword: 사이클 수

Search Result 1,280, Processing Time 0.027 seconds

Exergy Analysis of Regenerative Wet-Compression Gas-Turbine Cycles (습식 압축을 채용한 재생 가스터빈 사이클의 엑서지 해석)

  • Kim, Kyoung-Hoon;Kim, Se-Woong;Ko, Hyung-Jong
    • Journal of Energy Engineering
    • /
    • v.18 no.2
    • /
    • pp.93-100
    • /
    • 2009
  • An exergy analysis is carried out for the regenerative wet-compression Brayton cycle which has a potential of enhanced thermal efficiency owing to the reduced compression power consumption and the recuperation of exhaust energy. Using the analysis model, the effects of pressure ratio and water injection ratio are investigated on the exergy efficiency of system, exergy destruction ratio for each component of the system, and exergy loss ratio due to exhaust gas. The results of computation for the typical cases show that the regenerative wet-compression gas turbine cycle can make a notable enhancement of exergy efficiency. The injection of water results in a decrease of exergy loss of exhaust gas and an increase of net power output.

The Protocol of Basic Body Ability for 4D Cycling System (4D 사이클링에 대한 기초 신체능력 프로토콜)

  • Kim, Ki-Bong;Lee, Sung-Han
    • Journal of Digital Convergence
    • /
    • v.11 no.11
    • /
    • pp.313-320
    • /
    • 2013
  • The four-dimensional cycle simulator, which can recognize whether the road is ascent or descent, its gradient, and status of its surface on Virtual Reality, is introduced in this paper. On the base of these recognitions, various virtual motion path situations are displayed on LCD monitor attached ahead. These various situations may support not only the sense of realty but also an interest in a game in opposition to previous exercise cycles that might be monotonous. In this paper both analysis and estimation of basic bodily abilities for the four-dimensional cycling are addressed.

System Analysis of the Liquid Rocket Engine with Staged Combustion Cycle (단계식 연소 사이클 액체로켓엔진의 시스템 해석)

  • Lee, Sang-Bok;Lim, Tae-Kyu;Yoo, Seung-Young;Oh, Seok-Hwan;Roh, Tae-Seoung
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2012.05a
    • /
    • pp.46-51
    • /
    • 2012
  • This study aims to develop the performance analysis program on the staged combustion cycle of the liquid rocket engine using liquid oxygen(LOx) as oxidizer, liquid hydrogen(LH2) and RP-1 as fuel. The developed analysis program can obtain the propellant mass flow rate, the specific impulse, and representative design values of engine components for the required thrust satisfying pressure, mass flow, and energy balance conditions. The analysis results show that the the specific impulses (Isp) compared to those of the real engines have been less than 1%. With additional constraints, the program will be improved for the system optimization.

  • PDF

Minimum Spanning Tree Algorithm for Deletion of Maximum Weight Edge within a Cycle (한 사이클 내에서 최대 가중치 간선을 제거하기 위한 최소 신장트리 알고리즘)

  • Choi, Myeong-Bok;Han, Tae-Yong;Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.2
    • /
    • pp.35-42
    • /
    • 2014
  • This paper suggests a method that obtains the minimum spanning tree (MST) far more easily and rapidly than the present ones. The suggested algorithm, firstly, simplifies a graph by means of reducing the number of edges of the graph. To achieve this, it applies a method of eliminating the maximum weight edge if the valency of vertices of the graph is equal to or more than 3. As a result of this step, we can obtain the reduced edge population. Next, it applies a method in which the maximum weight edge is eliminated within the cycle. On applying the suggested population minimizing and maximum weight edge deletion algorithms to 9 various graphs, as many as the number of cycles of the graph is executed and MST is easily obtained. It turns out to lessen 66% of the number of cycles and obtain the MST in at least 2 and at most 8 cycles by only deleting the maximum weight edges.

Algorithm for Maximum Cycle Detection of Directed and Undirected General Graphs (방향과 무 방향 일반 그래프의 최대 사이클 검출 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.6
    • /
    • pp.91-97
    • /
    • 2022
  • There is hare and tortoise racing algorithm(HTA) for single-source(SS) singly linked list(SLL) with O(n) time complexity. But the fast method is unknown for general graph with multi-source, multi-destination, and multi-branch(MSMDMB). This paper suggests linear time cycle detection algorithm for given undirected and digraph with MSMDMB. The proposed method reduced the given graph G contained with unnecessary vertices(or nodes) to cycle into reduced graph G' with only necessary vertices(or nodes) to cycle based on the condition of cycle formation. For the reduced graph G', we can be find the cycle set C and cycle length λ using linear search within linear time. As a result of experiment data, the proposed algorithm can be obtained the cycle for whole data.

Understanding MZ Generation's Perceptions and Preferences for Eco-Friendly Consumption and Upcycled Souvenirs

  • Cheon Yu;Su-Joung Cha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.4
    • /
    • pp.151-163
    • /
    • 2023
  • This study aims to explore the perceptions of MZ's on eco-friendly consumption and their preferences for eco-friendly souvenirs. The top reasons for buying upcycling products include design, price, differentiation, and environmentalism, with design having the most influence on product purchase. Design is also a top consideration when buying upcycling souvenirs. Regarding environmental issues, they were most aware of the seriousness of environmental pollution and thought that recycling of fashion products was necessary. When it comes to eco-friendly fashion purchasing behaviors, the most common choice is to buy clothes that will last longer than those that are in fashion. Upcycling products are more likely to be purchased when there is a concern for the environment or an interest in eco-friendly products. In addition, those who have purchased upcycling products are more likely to be aware of and interested in eco-friendly fashion products and recycling of fashion products. Women are more likely than men to be concerned about environmental issues, and women are also more likely to be aware of upcycling souvenirs. In future research, it would be useful to study the relationship between upcycling products, environmental issues, consumer behavior, and upcycling souvenirs.

EIS Processor Architecture for Enhanced Instruction Processing (빠른 명령어 처리가 가능한 EIS 프로세서 구조)

  • 지승현;전중남;김석일
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.12B
    • /
    • pp.1967-1978
    • /
    • 2000
  • 본 논문에서는 실행 시에 긴명령어를 구성하는 각 단위 명령어를 독립적으로 스케줄링할 수 있는 EIS 프로세서 구조를 제안하였다. 단위 명령어별 독립적인 수행을 위해서, EIS 프로세서 구조는 여러 개의 연산처리기와 스케줄러의 쌍으로 구성된다. EIS 프로세서 구조내의 모든 스케줄러는 독립적으로 자료종속성이나 자원충돌 여부를 검사하여 단위 명령어를 실행할지 혹은 다음 파이프라인 사이클동안 실행을 지연시킬지를 결정한다. 또한 EIS프로세서용 목적코드는 단위 명령어들간 동기화를 위해서 모든 단위 명령어에 종속성정보를 삽입하는 특징을 지닌다. 즉, EIS 프로세서 구조는 긴명령어내의 각 단위 명령어를 독립적으로 실행시킬 수 있으므로 기존의 VLIW 프로세서 구조나 SVLIW 프로세서 구조에서의 실행지연 시간을 제거할 수 있다. 시뮬레이션을 통해서도 EIS 프로세서 구조의 실행사이클이 VLIW 프로세서 구조나 SVLIW 프로세서 구조에서의 경우보다 더 빠름을 입증할 수 있었다. 특히 실수 명령어 분포가 높은 프로그램에서 EIS 프로세서에서의 실행사이클이 다른 프로세서 구조의 경우에 비하여 현저하게 줄어드는 것을 확인할 수 있었다.

  • PDF

LCA에 의한 변전기기의 환경부하 평가

  • 대한전기협회
    • JOURNAL OF ELECTRICAL WORLD
    • /
    • s.319
    • /
    • pp.60-66
    • /
    • 2003
  • 변전기기의 전력손실은 전력계 전체 중에서는 얼마 안되는 양으로, 그 전력손실에 관련되는 온실효과가스 배출의 비율은 비교적 적다고 할 수 있다. 그러나 일본 전체의 온실효과가스 배출량이 증가추세에 있음을 고려하면, 변전기기에 대해서도 꾸준한 개선노력이 필요하다. 변전기기에 대한 당초부터의 제품개발 방침은 소형화(小型化)$\cdot$간소화(簡素化)이며, 주로 설치환경의 배려(配慮)와 경제성 추구를 목적으로 한 것이므로, 온난화(溫暖化)의 영향을 의식하게 된 것은 지난 몇 년 동안의 일이다. 이들의 제품개발 방침에 의거하여 제품 제작에 따른 환경부하(環境負荷)에 대하여 상대(相對) 비교는 할 수 있으나, 라이프사이클을 고려한 경우에는 운용과 제작시의 환경부하 합계가 지금까지에 대하여 경감(輕減)되었는지를 추정하기가 곤란하다는 문제도 있다. 그래서 제품의 라이프사이클 전체를 통하여 환경에 미치는 부하의 크기를 수치화(數値化)하여 평가하는 것이 필요하게 된다. 라이프사이클 어세스먼트(LCA, Life Cycle Assessment)는 이러한 관점에서 개발된 틀로서 데이터를 취득하는데 많은 시간이 걸리지만, 용도에 따라서는 간편한 방법을 선택하거나 소형화$\cdot$간소화쪽으로 방향을 좁혀 LCA로 상세하게 평가하는 구성도 할 수 있다. 그 최대의 효과는 환경부하를 정량화(定量化)할 수 있는 것이며, 아울러 환경부하의 가일층의 저감이 가능하다는 것을 생각할 수 있다. 또한 LCA사례에서, 제품개발방침인 소형화$\cdot$간소화가 환경부하 저감에 합치하며, 이 방침이 유효하다는 것을 확인하였다.

  • PDF

Perceived Consumption Value and Purchase Behavior of Upcycling Cosmetics According to Environmental Values (환경가치관에 따른 업사이클링 화장품의 지각된 소비가치 및 구매행동)

  • Jae-Nam Lee
    • Journal of the Korean Applied Science and Technology
    • /
    • v.41 no.2
    • /
    • pp.208-218
    • /
    • 2024
  • Domestic cosmetics companies are striving to protect the environment and solve environmental problems through ESG management. This study analyzed the relationship and influence between the perceived consumption value and purchasing behavior of upcycling cosmetics according to environmental values for MZ generation women in Seoul and Gyeonggi Province. In addition, based on the research results, it was intended to provide basic data for product development and marketing strategies related to upcycling cosmetics. First, all variables were found to be positive (+) correlation. Second, it was found that the higher the environmental value, the higher the perceived consumption value of upcycling cosmetics. Third, it was found that the higher the environmental values, the higher the purchasing behavior. Therefore, it is hoped that it will induce a positive consumption value for upcycling cosmetics, and that the cosmetics industry will be helpful as basic data for the development of related products and the establishment of differentiated marketing strategies.

Cycle Property in the (n,k)-star Graph ((n,k)-스타 그래프의 사이클 특성)

  • Chang, Jung-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.5
    • /
    • pp.1464-1473
    • /
    • 2000
  • In this paper, we analyze the cycle property of the (n,k)-star graph that has an attention as an alternative interconnection network topology in recent years. Based on the graph-theoretic properties in (n,k)-star graphs, we show the pancyclic property of the graph and also present the corresponding algorithm. Based on the recursive structure of the graph, we present such top-down approach that the resulting cycle can be constructed by applying series of "dimension expansion" operations to a kind of cycles consisting of sub-graphs. This processing naturally leads to such property that the resulting cycles tend to be integrated compactly within some minimal subset of sub-graphs, and also means its applicability of another classes of the disjoint-style cycle problems. This result means not only the graph-theoretic contribution of analyzing the pancyclic property in the underlying graph model but also the parallel processing applications such a as message routing or resource allocation and scheduling in the multi-computer system with the corresponding interconnection network.

  • PDF