• Title/Summary/Keyword: Low-power Consumption

Search Result 2,351, Processing Time 0.033 seconds

Performance Characteristics of Organic Rankine Cycles Using Medium Temperature District Heating Water as Heat Source (지역난방용 중온수 열원 유기랭킨사이클 성능 특성)

  • Park, Woo-Jin;Yoo, Hoseon
    • Plant Journal
    • /
    • v.12 no.1
    • /
    • pp.29-36
    • /
    • 2016
  • It is becoming increasingly important to make use of alternative energy source. because It is not able to rely on only fossil fuel for the recent increasing demand of energy consumption. With this situation, lots of studies for utilizing low grade energy such as industrial waste heat, solar energy, and geothermal energy have been conducted. The aim of this study is to predict the operation characteristics of working fluid by using performance analysis program (ThermoFlex) through the system analysis which is not mixing district return water but using ORC(Organic Rankine Cycle, hereinafter ORC) as a downstream cycle when accumulating district heating (hereinafter DH). In this study, We conducted the performance analysis for the case which has the district heating water temperature($120^{\circ}C$) and Flow rate of $163m^3/h$ (including District Heating return water flow), and examined several working fluid which is proper to this temperature. The case using R245fa (which is the best-case) showed 269.2kW power output, 6.37% efficiency. Additionally, Cut down on fuel was expected because of the boiler inlet temperature increase by being Formed $57.3{\sim}85^{\circ}C$ in a temperature of district heating return water, depending on a pressure change of a condenser in ORC system.

  • PDF

Study on Local Path Control Method based on Beam Modeling of Obstacle Avoidance Sonar (장애물회피소나 빔 모델링 기반의 국부경로제어 기법 연구)

  • Kim, Hyun-Sik
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.2
    • /
    • pp.218-224
    • /
    • 2012
  • Recently, as the needs of developing the micro autonomous underwater vehicle (AUV) are increasing, the acquisition of the elementary technology is urgent. While they mostly utilizes information of the forward looking sonar (FLS) in conventional studies of the local path control as an elementary technology, it is desirable to use the obstacle avoidance sonar (OAS) because the size of the FLS is not suitable for the micro AUV. In brief, the local path control system based on the OAS for the micro AUV operates with the following problems: the OAS offers low bearing resolution and local range information, it requires the system that has reduced power consumption to extend the mission execution time, and it requires an easy design procedure in terms of its structures and parameters. To solve these problems, an intelligent local path control algorithm based on the beam modeling of OAS with the evolution strategy (ES) and the fuzzy logic controller (FLC), is proposed. To verify the performance and analyze the characteristic of the proposed algorithm, the course control of the underwater flight vehicle (UFV) is performed in the horizontal plane. Simulation results show that the feasibility of real application and the necessity of additional work in the proposed algorithm.

A Micro Fluxgate Magnetic Sensor with Closed Magnetic Path (폐자로를 형성한 마이크로 플럭스게이트 자기 센서)

  • 최원열;황준식;강명삼;최상언
    • Journal of the Microelectronics and Packaging Society
    • /
    • v.9 no.3
    • /
    • pp.19-23
    • /
    • 2002
  • This paper presents a micro fluxgate magnetic sensor in printed circuit board (PCB). In order to observe the effect of the closed magnetic path, the magnetic cores of rectangular-ring and two bars were each fabricated. Each fluxgate sensor consists of five PCB stack layers including one layer magnetic core and four layers of excitation and pick-up coils. The center layer as a magnetic core is made of a Co-based amorphous magnetic ribbon with extremely high DC permeability of ~100,000. Four outer layers as an excitation and pick-up coils have a planar solenoid and are made of copper foil. In case of the fluxgate sensor having the rectangular-ring shaped core, excellent linear response over the range of -100 $\mu$T to + 100 $\mu$T is obtained with 540 V/Tsensitivity at excitation square wave of 3 $V_{p-p}$ and 360 KHz. The chip size of the fabricated sensing element is $7.3 \times 5.7\textrm{mm}^2$. The very low power consumption of ~8 mW was measured. This magnetic sensor is very useful for various applications such as: portable navigation systems, telematics, VR game and so on.n.

  • PDF

Log-Structured B-Tree for NAND Flash Memory (NAND 플래시 메모리를 위한 로그 기반의 B-트리)

  • Kim, Bo-Kyeong;Joo, Young-Do;Lee, Dong-Ho
    • The KIPS Transactions:PartD
    • /
    • v.15D no.6
    • /
    • pp.755-766
    • /
    • 2008
  • Recently, NAND flash memory is becoming into the spotlight as a next-generation storage device because of its small size, fast speed, low power consumption, and etc. compared to the hard disk. However, due to the distinct characteristics such as erase-before-write architecture, asymmetric operation speed and unit, disk-based systems and applications may result in severe performance degradation when directly implementing them on NAND flash memory. Especially when a B-tree is implemented on NAND flash memory, intensive overwrite operations may be caused by record inserting, deleting, and reorganizing. These may result in severe performance degradation. Although ${\mu}$-tree has been proposed in order to overcome this problem, it suffers from frequent node split and rapid increment of its height. In this paper, we propose Log-Structured B-Tree(LSB-Tree) where the corresponding log node to a leaf node is allocated for update operation and then the modified data in the log node is stored at only one write operation. LSB-tree reduces additional write operations by deferring the change of parent nodes. Also, it reduces the write operation by switching a log node to a new leaf node when inserting the data sequentially by the key order. Finally, we show that LSB-tree yields a better performance on NAND flash memory by comparing it to ${\mu}$-tree through various experiments.

PERFORMANCE OF FIMS MICROCHANNEL PLATE DETECTOR SYSTEM (FIMS의 마이크로채널 플레이트 검출기 시스템의 특성)

  • Nam, U.W.;Rhee, J.G.;Kong, K.N.;Park, Y.S.;Jin, K.C.;Jin, H.;Park, J.H.;Yuk, I.S.;Seon, K.I.;Han, W.;Lee, D.H.;Ryu, K.S.;Min, K.W.;Edelstein, J.;Korpela, E.
    • Journal of Astronomy and Space Sciences
    • /
    • v.19 no.4
    • /
    • pp.273-282
    • /
    • 2002
  • We describe some performance of the detector electronics system for the FIMS (Far-ultraviolet Imaging Spectrograph) mission. The FIMS mission to map the far ultraviolet sky uses MCP (micro-channel plate) detectors with a crossed delay line anode to record photon arrival events. FIMS has two MCP detectors, each with a ~25mm$\times$25mm active area. The unconventional anode design allows for the use of a single set of position encoding electronics for both detector fields. The centroid position of the charge cloud, generated by the photon-stimulated MCP, is determined by measuring the arrival times at both ends of the anode following amplification and external delay. The temporal response of the detector electronics system determines the readout's positional resolution for the charge centroid. High temporal resolution (<$35{\times}75$ps FWHM) and low power consumption (< 6W) were achieved for the FIMS detector electronics system.

A Ranking Cleaning Policy for Embedded Flash File Systems (임베디드 플래시 파일시스템을 위한 순위별 지움 정책)

  • Kim, Jeong-Ki;Park, Sung-Min;Kim, Chae-Kyu
    • The KIPS Transactions:PartA
    • /
    • v.9A no.4
    • /
    • pp.399-404
    • /
    • 2002
  • Along the evolution of information and communication technologies, manufacturing embedded systems such as PDA (personal digital assistant), HPC (hand -held PC), settop box. and information appliance became realistic. And RTOS (real-time operating system) and filesystem have been played essential re]os within the embedded systems as well. For the filesystem of embedded systems, flash memory has been used extensively instead of traditional hard disk drives because of embedded system's requirements like portability, fast access time, and low power consumption. Other than these requirements, nonvolatile storage characteristic of flash memory is another reason for wide adoption in industry. However, there are some technical challenges to cope with to use the flash memory as an indispensable component of the embedded systems. These would be relatively slow cleaning time and the limited number of times to write-and-clean. In this paper, a new cleaning policy is proposed to overcome the problems mentioned above and relevant performance comparison results will be provided. Ranking cleaning policy(RCP) decides when and where to clean within the flash memory considering the cost of cleaning and the number of times of cleaning. This method will maximize not only the lifetime of flash memory but also the performance of access time and manageability. As a result of performance comparison, RCP has showed about 10 ~ 50% of performance evolution compared to traditional policies, Greedy and Cost-benefit methods, by write throughputs.

Block Replacement Scheme based on Reuse Interval for Hybrid SSD System (Hybrid SSD 시스템을 위한 재사용 간격 기반 블록 교체 기법)

  • Yoo, Sanghyun;Kim, Kyung Tae;Youn, Hee Yong
    • Journal of Internet Computing and Services
    • /
    • v.16 no.5
    • /
    • pp.19-27
    • /
    • 2015
  • Due to the advantages of fast read/write operation and low power consumption, SSD(Solid State Drive) is now widely adopted as storage device of smart phone, laptop computer, server, etc. However, the shortcomings of SSD such as limited number of write operations and asymmetric read/write operation lead to the problem of shortened life span of SSD. Therefore, the block replacement policy of SSD used as cache for HDD is very important. The existing solutions for improving the lifespan of SSD including the LARC scheme typically employ the LRU algorithm to manage the SSD blocks, which may increase the miss rate in SSD due to the replacement of frequently used block instead of rarely used block. In this paper we propose a novel block replacement scheme which considers the block reuse interval to effectively handle various data read/write patterns. The proposed scheme replaces the block in SSD based on the recency decided by reuse interval and age along with hit ratio. Computer simulation using workload trace files reveals that the proposed scheme consistently improves the performance and lifespan of SSD by increasing the hit ratio and decreasing the number of write operations compared to the existing schemes including LARC.

Performance Analysis of Siding Window based Stream High Utility Pattern Mining Methods (슬라이딩 윈도우 기반의 스트림 하이 유틸리티 패턴 마이닝 기법 성능분석)

  • Ryang, Heungmo;Yun, Unil
    • Journal of Internet Computing and Services
    • /
    • v.17 no.6
    • /
    • pp.53-59
    • /
    • 2016
  • Recently, huge stream data have been generated in real time from various applications such as wireless sensor networks, Internet of Things services, and social network services. For this reason, to develop an efficient method have become one of significant issues in order to discover useful information from such data by processing and analyzing them and employing the information for better decision making. Since stream data are generated continuously and rapidly, there is a need to deal with them through the minimum access. In addition, an appropriate method is required to analyze stream data in resource limited environments where fast processing with low power consumption is necessary. To address this issue, the sliding window model has been proposed and researched. Meanwhile, one of data mining techniques for finding meaningful information from huge data, pattern mining extracts such information in pattern forms. Frequency-based traditional pattern mining can process only binary databases and treats items in the databases with the same importance. As a result, frequent pattern mining has a disadvantage that cannot reflect characteristics of real databases although it has played an essential role in the data mining field. From this aspect, high utility pattern mining has suggested for discovering more meaningful information from non-binary databases with the consideration of the characteristics and relative importance of items. General high utility pattern mining methods for static databases, however, are not suitable for handling stream data. To address this issue, sliding window based high utility pattern mining has been proposed for finding significant information from stream data in resource limited environments by considering their characteristics and processing them efficiently. In this paper, we conduct various experiments with datasets for performance evaluation of sliding window based high utility pattern mining algorithms and analyze experimental results, through which we study their characteristics and direction of improvement.

An Efficient Data Block Replacement and Rearrangement Technique for Hybrid Hard Disk Drive (하이브리드 하드디스크를 위한 효율적인 데이터 블록 교체 및 재배치 기법)

  • Park, Kwang-Hee;Lee, Geun-Hyung;Kim, Deok-Hwan
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.1
    • /
    • pp.1-10
    • /
    • 2010
  • Recently heterogeneous storage system such as hybrid hard disk drive (H-HDD) combining flash memory and magnetic disk is launched, according as the read performance of NAND flash memory is enhanced as similar to that of hard disk drive (HDD) and the power consumption of NAND flash memory is reduced less than that of HDD. However, the read and write operations of NAND flash memory are slower than those of rotational disk. Besides, serious overheads are incurred on CPU and main memory in the case that intensive write requests to flash memory are repeatedly occurred. In this paper, we propose the Least Frequently Used-Hot scheme that replaces the data blocks whose reference frequency of read operation is low and update frequency of write operation is high, and the data flushing scheme that rearranges the data blocks into the multi-zone of the rotation disk. Experimental results show that the execution time of the proposed method is 38% faster than those of conventional LRU and LFU block replacement schemes in I/O performance aspect and the proposed method increases the life span of Non-Volatile Cache 40% higher than those of conventional LRU, LFU, FIFO block replacement schemes.

A Centralized Deployment Protocol with Sufficient Coverage and Connectivity Guarantee for WSNs (무선 센서 네트워크에서 유효 커버리지 및 접속성 보장을 위한 중앙 집중형 배치 프로토콜)

  • Kim, Hyun-Tae;Zhang, Gui-Ping;Kim, Hyoung-Jin;Joo, Young-Hoon;Ra, In-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.6
    • /
    • pp.683-690
    • /
    • 2006
  • Reducing power consumption to extend network lifetime is one of the most important challenges in designing wireless sensor networks. One promising approach to conserving system energy is to keep only a minimal number of sensors active and put others into low-powered sleep mode, while the active sensors can maintain a connected covet set for the target area. The problem of computing such minimum working sensor set is NP-hard. In this paper, a centralized Voronoi tessellation (CVT) based approximate algorithm is proposed to construct the near optimal cover set. When sensor's communication radius is at least twice of its sensing radius, the covet set is connected at the same time; In case of sensor's communication radius is smaller than twice of its sensing radius, a connection scheme is proposed to calculate the assistant nodes needed for constructing the connectivity of the cover set. Finally, the performance of the proposed algorithm is evaluated through theoretical analysis and extensive numerical experiments. Experimental results show that the proposed algorithm outperforms the greedy algorithm in terms of the runtime and the size of the constructed connected cover set.