• Title/Summary/Keyword: 5-이웃

Search Result 297, Processing Time 0.029 seconds

A Tabu Search Algorithm for Minimum Cost Localization Problem in Underwater Sensor Networks (수중 센서 네트워크에서 최소 비용 위치 결정 문제를 위한 타부 서치 알고리즘)

  • Jang, Kil-woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.5
    • /
    • pp.929-935
    • /
    • 2017
  • All sensor nodes generally determine their positions using anchor nodes that are located in underwater sensor networks. This paper proposes a Tabu search algorithm to determine the minimum number of anchor nodes for the location of all sensor nodes in underwater sensor networks. As the number of the sensor nodes increases in the network, the amount of calculation that determines the number of anchor nodes would be too much increased. In this paper, we propose a Tabu search algorithm that determines the minimum number of anchor nodes within a reasonable computation time in a high dense network, and propose an efficient neighborhood generating operation of the Tabu search algorithm for efficient search. The proposed algorithm evaluates those performances through some experiments in terms of the minimum number of anchor nodes and execution time. The proposed algorithm shows 5-10% better performance than the conventional algorithm.

The Crystal and Molecular Structure of N-Acetyl-L-cysteine (N-Acetyl-L-cysteine의 결정 및 분자구조)

  • Young Ja Lee;Il-Hwan Suh
    • Journal of the Korean Chemical Society
    • /
    • v.24 no.3
    • /
    • pp.193-200
    • /
    • 1980
  • The crystal structure of N-acetyl-L-cysteine, $C_5H_9NO_3S,$ has been determined from three dimensional photographic intensity data $(CuK{\alpha}$ radiation) by single crystal X-ray diffraction analysis. There is one formula unit in the triclinic unit cell with a = 7.04(3), b = 5.14(2), c = 8.25(3) ${\AA}$, ${\alpha}$ = 106(2), ${\beta}$ = 51(1), ${\gamma}$ = 124(2)$^{\circ}$ and space group P$_1$, The structure was solved by the direct method and refined by the full matrix least-squares method. The final R value is 12.3% for 629 observed reflections. The C-carboxyl group and the N-acetyl group are very neary planar. The molecule appears to form with neighboring molecules a hydrogen bond, $O-H{\cdot}{\cdot}{\cdot}O(3)$ of length 2.59${\AA}$.

  • PDF

The Effect of Temperature and Flow Rate of Eluent on the Separation of Adjacent Lanthanides (La : Ce, Ce : Pr, Pr : Nd) with Displacement Chromatography (치환크로마토그래피에서 온도와 용리액의 흐름속도가 란탄족 원소들 (La : Ce, Ce : Pr, Pr : Nd) 의 분리에 미치는 영향)

  • Ha, Yeong Gu;Song, Gi Hun
    • Journal of the Korean Chemical Society
    • /
    • v.38 no.9
    • /
    • pp.660-666
    • /
    • 1994
  • The effects of temperature and flow rate of eluent on the separation of adjacent lighter lanthanide pairs (La : Ce, Ce : Pr, Pr: Nd) have been studied with displacement chromatography. Two serial columns packed with Amberlite 120 cation exchange resin are used for loading and separation. The retaining ion is $H^+$ ion and the eluent is 0.012M and 0.015M of EDTA solution. The columns and the eluent are maintained at the temperature of 90$^{\circ}C$ and pressurized to reduce vaporizing in the ion-exchange resin column. The eluated solution is analyzed directly with ICP-AES. The separation factors of the lanthanide pairs, La: Ce, Ce :Pr, and Pr: Nd, are 4.6, 2.8, and 1.9, respectively and are higher than that from theoretical calculation at 25$^{\circ}C$. When the flow rate is reduced from 2.5 ml/min to 1.5 ml/min, the HETP is reduced from 1.60 cm to 0.88 cm. The separation efficency can be improved at lower flow rate of eluent and higher operating temperature. The recoveries of pure lanthanides than 99.9% are 49∼77% from this separation.

  • PDF

A Cooperative-Aided Routing Protocol for Supporting Stable Route Life-Time in Mobile Ad-hoc Wireless Sensor Networks (모바일 Ad-hoc 무선 센서 네트워크에서 안정된 경로의 Life-Time 을 지원하기 위한 협력 도움 라우팅 프로토콜)

  • Lee, Joo-Sang;An, Beongku;Kong, Hyung-Yun;Ahn, Hongyoung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.3
    • /
    • pp.47-55
    • /
    • 2008
  • 본 논문에서는 모바일 ad-hoc 무선 센서 네트워크[1]에서 안정된 경로의 설정 및 설정된 경로의 lifetime 을 효과적으로 지원하여 데이터 전송효율을 향상시키기 위한 협력 도움 라우팅 프로토콜(CARP: Cooperative_Aided Routing Protocol) 을 제안한다. 제안된 라우팅 프로토콜의 기본 아이디어 및 특징은 다음과 같다. 첫째, 소스노드와 목적지 노드 사이의 안정된 라우팅 경로의 설정이다. 본 연구에서는 모바일 노드들의 이동성 정보를 이용한 엔트로피 기반의 안정된 경로 설정방법을 제안 사용한다. 둘째, 협력도움 전송 방법이다[3][4][5]. 설정된 경로 위로 데이터 패킷을 전송 할 때 경로 lifetime과 SNR의 효과적인 지원으로 데이터 전송률을 증가시키기 위해 이웃 노드들로부터 협력 도움을 받는다. 셋째, 기존의 센서 네트워크는 주로 고정된 노드 환경에서 많은 연구가 되어 왔지만, 본 연구에서는 노드들의 이동성을 고려한 환경에서 연구가 이루어진다. 제안된 CARP 의 성능평가는 OPNET(Optimized Network Engineering Tool)을 사용하여 이루어졌으며 성능평가를 통하여 제안한 프로토콜은 안정된 경로의 설정 및 데이터 전송효율을 효과적으로 증가 시킬 수 있음을 알 수 있다.

  • PDF

Detection and Analysis of the liver Area and liver tumors in CT Images using Quantization Method and Fuzzy based-SOM Algorithm (양자화 기법과 퍼지 기반 SOM 알고리즘을 이용한 CT 영상에서의 간 영역과 간 종양 검출 및 분석)

  • Jeon, Tae-Ryong;Jeong, Gyeong-Hun;Kim, Gwang-Baek
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2007.04a
    • /
    • pp.63-74
    • /
    • 2007
  • 간은 인체의 생명을 유지하고 성장할 수 있도록 하는 영양섭취와 매우 밀접한 관계를 가진 중요한 장기이다. 이러한 간의 중요성에도 불구하고 현재 우리나라의 간암 발병률이 세계에서 가장 높은 수치를 기록하고 있으며 이에 따라 간암을 조기 진단하고 예방할 수 있는 방법의 중요성이 확대되고 있다. 따라서 본 논문에서는 영상 의학적 검사 방법 중 하나인 CT 촬영으로 획득된 조영 증강 CT 영상에서 간 영역과 간 종양 영역을 정확히 검출하고 간 종양의 악성도를 판별할 수 있는 방법을 제안한다. 흉부로부터 5mm 간격으로 약 $40\;{\sim}\;50$장 정도로 촬영한 조영 증강 CT 영상에서 명암도와 명암의 분포도를 이용한 양자화 기법과 장기들의 위치 및 형태학적 특징정보, 그리고 흉부와 복부 양방향으로 인접한 CT 영상들의 정보를 분석하여 간 영역을 검출한다. 간 종양 영역은 과혈관성 종양의 특징을 분석하고 간 영역의 검출 방법에 적용하여 추출한다. 추출된 간 종양 영역은 퍼지 기반 SOM 알고리즘을 제안하여 간 종양의 악성도를 분석하는데 적용한다. 제안된 퍼지 기반 SOM 알고리즘은 SOM의 이웃 반경을 동적으로 조정하는데 퍼지 제어 기법을 적용하여 기존의 SOM 알고리즘보다 종양의 악성 정도를 분류하는 정확성을 개선하였다. 제시된 간 영역과 간 종양 검출 및 분석 방법의 결과와 전문의가 진단한 결과를 비교 분석한 결과, 기존의 간 영역 및 간 종양 영역 검출 방법보다 정확성이 향상된 것을 확인할 수 있었다.

  • PDF

Routing Protocol for Hybrid Ad Hoc Network using Energy Prediction Model (하이브리드 애드 혹 네트워크에서의 에너지 예측모델을 이용한 라우팅 알고리즘)

  • Kim, Tae-Kyung
    • Journal of Internet Computing and Services
    • /
    • v.9 no.5
    • /
    • pp.165-173
    • /
    • 2008
  • Hybrid ad hoc networks are integrated networks referred to Home Networks, Telematics and Sensor networks can offer various services. Specially, in ad hoc network where each node is responsible for forwarding neighbor nodes' data packets, it should net only reduce the overall energy consumption but also balance individual battery power. Unbalanced energy usage will result in earlier node failure in overloaded nodes. it leads to network partitioning and reduces network lifetime. Therefore, this paper studied the routing protocol considering efficiency of energy. The suggested algorithm can predict the status of energy in each node using the energy prediction model. This can reduce the overload of establishing route path and balance individual battery power. The suggested algorithm can reduce power consumption as well as increase network lifetime.

  • PDF

Fast Warping Prediction using Bit-Pattern for Motion Estimation (비트패턴을 이용한 고속 워핑 예측)

  • 강봉구;안재형
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.5
    • /
    • pp.390-395
    • /
    • 2001
  • In this paper, we propose a fast warping prediction using bit-pattern for motion estimation. Because of the spatial dependency between motion vectors of neighboring node points carrying motion information, the optimization of motion search requires an iterative search. The computational load stemming from the iterative search is one of the major obstacles for practical usage of warping prediction. The motion estimation in the proposed algorithm measures whether the motion content of the area is or not, using bit-pattern. Warping prediction using the motion content of the area make the procedure of motion estimation efficient by eliminating an unnecessary searching. Experimental results show that the proposed algorithm can reduce more 75% iterative search while maintaining performances as close as the conventional warping prediction.

  • PDF

A Study on the Efficiency of CDMA Cellular System Simulation with Wrap Around Technique (Wrap Around 기법에 의한 CDMA 셀룰라 시스템 시뮬레이션 효율에 관한 연구)

  • 김호준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5A
    • /
    • pp.276-283
    • /
    • 2003
  • Most of CDMA system algorithm must be verified by simulating the cellular system consisted of many other tier cells. But it takes long time to simulate such a huge CDMA cellular system. In this paper, we propose an effective time saving simulation scheme based on wraparound technique. And we study that how our remaining cell interference compensation method works on calculating of the total interference, SIR, outage probability, and cell capacity. We made a conclusion that by using proposed scheme, we can get the same result of maximum configuration cells with only one tier real cells and that we can minimize the simulation time.

Thermal Management on 3D Stacked IC (3차원 적층 반도체에서의 열관리)

  • Kim, Sungdong
    • Journal of the Microelectronics and Packaging Society
    • /
    • v.22 no.2
    • /
    • pp.5-9
    • /
    • 2015
  • Thermal management becomes serious in 3D stacked IC because of higher heat flux, increased power generation, extreme hot spot, etc. In this paper, we reviewed the recent developments of thermal management for 3D stacked IC which is a promising candidate to keep Moore's law continue. According to experimental and numerical simulation results, Cu TSV affected heat dissipation in a thin chip due to its high thermal conductivity and could be used as an efficient heat dissipation path. Other parameters like bumps, gap filling material also had effects on heat transfer between stacked ICs. Thermal aware circuit design was briefly discussed as well.

A Test Algorithm for Word-Line and Bit-line Sensitive Faults in High-Density Memories (고집적 메모리에서 Word-Line과 Bit-Line에 민감한 고장을 위한 테스트 알고리즘)

  • 강동철;양명국;조상복
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.4
    • /
    • pp.74-84
    • /
    • 2003
  • Conventional test algorithms do not effectively detect faults by word-line and bit-line coupling noise resulting from the increase of the density of memories. In this paper, the possibility of faults caused by word-line coupling noise is shown, and new fault model, WLSFs(Word-Line Sensitive Fault) is proposed. We also introduce the algorithm considering both word-line and bit-line coupling noise simultaneously. The algorithm increases probability of faults which means improved fault coverage and more effective test algorithm, compared to conventional ones. The proposed algorithm can also cover conventional basic faults which are stuck-at faults, transition faults and coupling faults within a five-cell physical neighborhood.