• Title/Summary/Keyword: electric tree

Search Result 143, Processing Time 0.024 seconds

Design of Stereo Image Match Processor for Real Time Stereo Matching (실시간 스테레오 정합을 위한 스테레오 영상 정합 프로세서 설계)

  • Kim, Yeon-Jae;Sim, Deok-Seon
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.37 no.2
    • /
    • pp.50-59
    • /
    • 2000
  • Stereo vision is a technique extracting depth information from stereo images, which are two images that view an object or a scene from different locations. The most important procedure in stereo vision, which is called stereo matching, is to find the same points in stereo images. It is difficult to match stereo images in real time because stereo matching requires heavy calculation. In this Paper we design a digital VLSI to Process stereo matching in real time, which we call stereo image match processor (SIMP). For implementation of real time stereo matching, sliding memory and minimum selection tree are presented. SIMP is designed with pipeline architecture and parallel processing. SIMP takes 64 gray level 64$\times$64 stereo images and yields 8 level 64 $\times$64 disparity map by 3 bit disparity and 12 bit address outputs. SIMP can process stereo images with process speed of 240 frames/sec.

  • PDF

An Efficient Algorithm for Test Pattern Compaction using Independent Faults and Compatible Faults (독립고장과 양립 가능한 고장을 이용한 효율적인 테스트 패턴 압축 기법)

  • Yun, Do-Hyeon;Gang, Seong-Ho;Min, Hyeong-Bok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.38 no.2
    • /
    • pp.145-153
    • /
    • 2001
  • As combinational ATPG algorithms achieve effectively 100% fault coverage, reducing the length of test set without loosing its fault coverage becomes a challenging work. The new approach is based on the independent and the compatible relationships between faults. For more compact test set, the size of compatible fault set must be maximized, thus this algorithm generates fault-pattern pairs, and a fault-pattern pair tree structure using the independent and the compatible relationships between faults. With the fault-pattern pair tree structure, a compact test set effectively generated. The experimental results for ISCAS 85 and 89 benchmark circuits demonstrate the effectiveness of the proposed method.

  • PDF

Properties of PD Pulses accompanying with propagation of Bush-type tree in LDPE (LDPE에서 부시형 전기트리의 성장에 수반되는 부분방전 펄스의 특성)

  • 박영국;강성화;정수현;박철현;임기조
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 1998.06a
    • /
    • pp.293-296
    • /
    • 1998
  • Surface electrical conduction in insulator is most important factor to assess the insulation performances of outdoor insulating materials. In this paper, contamination performance of the widely used materials for outdoor insulator - porcelain, EPDM, Silicone rubber - were discussed by measuring properties of average leakage current and scintillation discharge pulses under artificial contamination conditions. The artificial contaminations used were deionized distilled water fog, 0.5wt% NaCl salt fog of light pollution and 2wt% NaCl salt fog of medium pollution. The average leakage current was appeared linearly with applied voltage at dry and clean surface condition. The magnitude of leakage current was almost same at different kinds of samples. In case of deionized distilled water fog, the characteristics of leakage current and applied voltage was most different to that in case of dry and clean condition. In case of salt fog pollution condition, The leakage current was increased above critical voltage. The scintillation discharges were also activated at the level. the leakage current and scintillation discharges were increased with increasing pollution degree. The resistance to pollution properties of silicone rubber appeared excellent among them.

  • PDF

Risk Assessment of Energy Storage System using Event Tree Analysis (ETA를 이용한 에너지저장시스템의 위험성 평가)

  • Kim, Doo-Hyun;Kim, Sung-Chul;Kim, Eui-Sik;Park, Young-Ho
    • Journal of the Korean Society of Safety
    • /
    • v.31 no.3
    • /
    • pp.34-41
    • /
    • 2016
  • The purpose of this paper is to conduct ETA on six items of ESS: the whole system, battery, BMS, PCS, ESS and cable. To achieve that, ESS work flow and its components are categorized. Based on performance, human, environmental, management, and safety, this paper drew initiation events (IE) and end states (ES). ETA is applied to the main functions of each item, and the end states that may occur in one initiation event are suggested. In addition, detailed classification was performed to induce various end states on the basis of the suggested initiation events ; loss of grid electricity of ESS, loss of battery electricity(DC) of battery, impairment of electric function of BMS, loss of grid electricity(AC) of PCS, loss of data of EMS, Mechanical damage of cable, event sequence analysis conducted on the basis of event trees. If the suggested IEs and ESs are applied on the basis of ESS event cases, it is expected to prevent the same kinds of accident and operate ESS safely.

Reliability evaluation of distribution systems vs. the optimal load transferring using genetic algorithms (유전 알고리즘을 이용한 최적부하절체에 의한 배전계통의 신뢰도 평가)

  • Han, Seong-Ho;Choi, Joon-Ho;Choi, Do-Hyuk;Rhee, Wook;Choi, Dai-Seub;Kim, Jae-Chul
    • Proceedings of the KIEE Conference
    • /
    • 1996.07b
    • /
    • pp.862-864
    • /
    • 1996
  • This paper presents a new approach to evaluate reliability indices of electric distribution systems using genetic algorithm(GA). The use of reliability evaluation is an important aspect of distribution system planning and operation to adjust the reliability level of each area. In this paper, the reliability model is based on the optimal load transferring problem to minimize over load generated load point outage in each sub-section. This kind of the approach is one of the most difficult procedure which becomes a combination problems. A new approach using GA Was developed for this problem. We proposed a tree search algorithm which satisfied the tree constraint. GA is general purpose optimization techniques based on principles inspired from the biological evolution such as natural selection, genetic recombination and survival of the fittest Test results for the model system with 24 nodes and 29 branches are reported in the paper.

  • PDF

Analysis of failure rate according to capacitor position of bidirectional converter (양방향 컨버터의 커패시터 위치에 따른 고장률 분석)

  • Kim, Ye-rin;Kang, Feel-soon
    • Journal of IKEEE
    • /
    • v.23 no.1
    • /
    • pp.261-265
    • /
    • 2019
  • We analyze the failure rate change of a conventional bidirectional converter and a modified one which moves an output capacitor towards propulsion battery. We analysis of the circuit structural homogeneity and the difference between both converters, and confirm that the capacitor working voltage is reduced by changing the capacitor position. After obtaining the capacitor failure rate according to voltage stress factor and operating temperature, it is applied to the fault-tree of the bidirectional converter to obtain the overall failure rate of the converter. We analyzes the advantages and disadvantages of design changes by comparing and analyzing the failure rate and mean time between failures (MTBF) according to operating temperature and capacitance value.

Distributed Mutual Exclusion Algorithm for Maintaining Tree-Height Balance in Mobile Computing Environments (이동 컴퓨팅 환경에서 트리 높이의 균형을 유지하는 상호 배제 알고리즘)

  • Kim, Hyeong-Sik;Eom, Yeong-Ik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.10
    • /
    • pp.1206-1216
    • /
    • 1999
  • 이동 호스트란 시간과 공간의 제약 없이 필요한 기능을 수행하고, 또한 원하는 정보에 접근할 수 있는 휴대용 컴퓨터를 일컫는다. 이동 컴퓨팅 환경이란 이러한 이동 호스트들을 지원할 수 있도록 구성된 분산 환경이다. 따라서 이동 컴퓨팅 환경에서의 분산 알고리즘은 정적 호스트만을 고려한 기존의 분산 환경에서와는 다르게 이동 호스트의 여러 가지 특성들을 고려하여 제안되어야 한다. 즉, 이동 컴퓨팅 환경의 도래로 인하여 이동성과 휴대성, 그리고 무선 통신과 같은 특성들을 고려한 새로운 분산 상호 배제 알고리즘이 필요하다. 이제까지 이동 컴퓨팅 환경에서의 상호 배제 알고리즘은 토큰 링 구조에 기반을 두고 설계되었다. 토큰 링 구조는 이동 호스트들의 위치를 유지하기 위하여 높은 비용을 필요로 하는 단점을 가지고 있다. 본 논문에서는 균형 높이 트리(height-balanced tree)라는 새로운 모형을 제안함으로써 정적 분산 환경과 이동 분산 환경이 혼합된 환경에서 상호 배제 비용을 감소시킬 수 있는 새로운 알고리즘을 제안하며, 각 경우에 있어서의 비용을 산출하고 평가한다.Abstract The mobile host is a potable computer that carries out necessary functions and has the ability to access desirable informations without any constraints in time and space. Mobile computing environment is a distributed environment that is organized to support such mobile hosts. In that environment, distributed algorithms of which environment not only with static hosts but with mobile host's several properties should be proposed. With the emergence of mobile computing environments, a new distributed mutual exclusion method should be required to consider properties mobile computing system such as mobility, portability, and wireless communication. Until now, distributed mutual exclusion methods for mobile computing environments are designed based on a token ring structure, which have the drawbacks of requiring high costs in order to locate mobile hosts. In this paper, we propose a distributed mutual exclusion method that can reduce such costs by structuring the entire system as a height-balanced tree for static distributed networks and for networks with mobile hosts. We evaluated the operation costs in each case.

A New merging Algorithm for Constructing suffix Trees for Integer Alphabets (정수 문자집합상의 접미사트리 구축을 위한 새로운 합병 알고리즘)

  • Kim, Dong-Kyu;Sim, Jeong-Seop;Park, Kun-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.2
    • /
    • pp.87-93
    • /
    • 2002
  • A new approach of constructing a suffix tree $T_s$for the given string S is to construct recursively a suffix tree $ T_0$ for odd positions construct a suffix tree $T_e$ for even positions from $ T_o$ and then merge $ T_o$ and $T_e$ into $T_s$ To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets The hardest part of Farachs algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search) Our merging algorithm is more intuitive than Farachs coupled DFS (depth-first search ) merging and thus it can be easily extended to other applications.

Pre-Hospital and In-Hospital Management of an Abdominal Impalement Injury Caused by a Tree Branch

  • Ahn, So Ra;Lee, Joo Hyun;Kim, Keun Young;Park, Chan Yong
    • Journal of Trauma and Injury
    • /
    • v.34 no.4
    • /
    • pp.288-293
    • /
    • 2021
  • In South Korea, most patients who visit trauma centers with abdominal injuries have blunt trauma, and penetrating injuries are relatively rare. In extremely rare cases, some patients are admitted with a long object penetrating their abdomen, and these injuries are referred to as abdominal impalement injuries. Most cases of impalement injuries lead to fatal bleeding, and patients often die at the scene of the accident. However, patients who survive until reaching the hospital can have a good prognosis with optimal treatment. A 68-year-old female patient was admitted to the trauma center with a 4-cm-thick tree branch impaling her abdomen. The patient was transported by a medical helicopter and had stable vital signs at admission. The branch sticking out of the abdomen was quite long; thus, we carefully cut the branch with an electric saw to perform computed tomography (CT). CT revealed no signs of major blood vessel injury, but intestinal perforation was observed. During laparotomy, the tree branch was removed after confirming that there were no vascular injuries, and enterostomy was performed because of extensive intestinal injury. After treating other injuries, the patient was discharged without any complications except colostomy. Abdominal impalement injuries are treated using various approaches depending on the injury mechanism and injured region. However, the most important consideration is that the impaled object should not be removed during transportation and resuscitation. Instead, it should only be removed after checking for injuries to blood vessels during laparotomy in an environment where injury control is possible.

An Improved Privacy Preserving Construction for Data Integrity Verification in Cloud Storage

  • Xia, Yingjie;Xia, Fubiao;Liu, Xuejiao;Sun, Xin;Liu, Yuncai;Ge, Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.10
    • /
    • pp.3607-3623
    • /
    • 2014
  • The increasing demand in promoting cloud computing in either business or other areas requires more security of a cloud storage system. Traditional cloud storage systems fail to protect data integrity information (DII), when the interactive messages between the client and the data storage server are sniffed. To protect DII and support public verifiability, we propose a data integrity verification scheme by deploying a designated confirmer signature DCS as a building block. The DCS scheme strikes the balance between public verifiable signatures and zero-knowledge proofs which can address disputes between the cloud storage server and any user, whoever acting as a malicious player during the two-round verification. In addition, our verification scheme remains blockless and stateless, which is important in conducting a secure and efficient cryptosystem. We perform security analysis and performance evaluation on our scheme, and compared with the existing schemes, the results show that our scheme is more secure and efficient.