• Proceedings of the Korea Water Resources Association Conference
• /
• 2012.05a
• /
• pp.593-593
• /
• 2012

본 연구는 화력 및 원자력 발전소로 취입된 냉각수(circulating and essential service water)가 복수기로부터 온배수 형태의 개수로 흐름으로 표층배수 될 경우 수온을 저감시키기 위해 주입하는 희석수(by-pass cooling water)와의 혼합효과의 효율성을 증대시키고, 불리한 수리현상을 야기하지 않으며, 경제적인 배수로 구조물을 고찰하기 위한 목적으로 시도되었다. 배수로 구조물 내 온배수와 희석수가 혼합되는 구간을 혼합지(mixing basin)라 하는데, 본 과업에서는 ${\bigcirc}{\bigcirc}$발전소의 배수로 구간 중 혼합지를 대상으로 FLOW-3D$^{(R)}$를 이용한 3차원 수치모형을 구축하고, 총 9개에 해당하는 각 대안별 현상을 분석하고 비교하였다. 각 대안들의 차이점은 배수로에 설치되는 보조구조물들의 형상과 배열 등이며, 복수기로부터 나오는 배출수의 수온은 $42^{\circ}C$, 희석수는 $35^{\circ}C$이고, 본 과업의 주요 관심대상 물리량은 유속과 온도이다. 배수로에 아무런 보조 구조물이 없는 형태인 기본 계획안을 검토한 결과, 평균 $3.31^{\circ}C$의 수온강하가 이루어졌으나, 우안 쪽으로 강한 흐름이 발생하여 수온의 좌우편차가 $4.61^{\circ}C$ 가량 발생하는 것으로 나타났다. 기본 계획안의 검토결과를 보완하기 위한 대안으로 연직 흐름의 소산을 위해 고안된 잠형 소파블록(baffle block) 설치안은 평균 $3.06^{\circ}C$의 수온강하가 이루어지고 $4.44^{\circ}C$의 수온 좌우편차가 발생했다. 지그재그(zigzag) 형태의 흐름을 만들어 혼합효과를 올리기 위한 미로형 수제(labyrinth groin) 설치안은 평균 $5.33^{\circ}C$의 수온강하가 이루어지고, $1.43^{\circ}C$의 수온 좌우편차를 보여줘 검토했던 대안들 중 가장 좋은 결과를 보여주었다. V자 배열 소파블럭(deformed block) 설치안은 연직 및 수평방향의 소산을 기대했으나 평균 $3.00^{\circ}C$의 수온 강하와 $4.41^{\circ}C$의 수온 좌우편차를 나타냈다. 벤츄리(Venturi) 형태의 흐름을 발생시키기 위한 병목형(bottleneck) 수로안은 평균 $3.18^{\circ}C$의 수온강하와 $3.94^{\circ}C$의 수온 좌우편차, 흐름의 소산과 흐름방향을 변화시키기 위한 와형 수제(swirl groin) 설치안은 평균 $2.24^{\circ}C$의 수온강하와 $1.48^{\circ}C$의 수온좌우편차, 우안 흐름을 지연시키기 위한 물방석(water cushion) 수로안은 평균 $3.03^{\circ}C$의 수온강하와 $4.50^{\circ}C$의 수온 좌우편차, 우안의 흐름을 좌안으로 보내기 위한 분사형(injector) 수로안은 평균 $3.13^{\circ}C$의 수온강하와 $4.45^{\circ}C$의 수온 좌우편차, 우안의 흐름을 막기 위한 외팔형 수제(cantilever groin) 설치안은 평균 $3.11^{\circ}C$의 수온강하와 $3.02^{\circ}C$의 수온 좌우편차가 발생하는 것으로 나타났다.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2013.08a
• /
• pp.91-91
• /
• 2013

Imagine a world where we could biomanufacture hybrid nanomaterials having atomic-scale resolution over functionality and architecture. Toward this vision, a fundamental challenge in materials science is how to design and synthesize protein-like material that can be fully self-assembled and exhibit information-specific process. In an ongoing effort to extend the fundamental understanding of protein structure to non-natural systems, we have designed a class of short peptides to fold like proteins and assemble into defined nanostructures. In this talk, I will talk about new strategies to drive the self-assembled structures designing sequence of peptide. I will also discuss about the specific interaction between proteins and inorganics that can be used for the development of new hybrid solar energy devices. Splitting water into hydrogen and oxygen is one of the promising pathways for solar to energy convertsion and storage system. The oxygen evolution reaction (OER) has been regarded as a major bottleneck in the overall water splitting process due to the slow transfer rate of four electrons and the high activation energy barrier for O-O bond formation. In nature, there is a water oxidation complex (WOC) in photosystem II (PSII) comprised of the earthabundant elements Mn and Ca. The WOC in photosystem II, in the form of a cubical CaMn4O5 cluster, efficiently catalyzes water oxidation under neutral conditions with extremely low overpotential (~160 mV) and a high TOF number. The cluster is stabilized by a surrounding redox-active peptide ligand, and undergo successive changes in oxidation state by PCET (proton-coupled electron transfer) reaction with the peptide ligand. It is fundamental challenge to achieve a level of structural complexity and functionality that rivals that seen in the cubane Mn4CaO5 cluster and surrounding peptide in nature. In this presentation, I will present a new strategy to mimic the natural photosystem. The approach is based on the atomically defined assembly based on the short redox-active peptide sequences. Additionally, I will show a newly identified manganese based compound that is very close to manganese clusters in photosystem II.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.10
• /
• pp.962-974
• /
• 2010

Recently, the convergence of information technology with bio-technology, nano-technology or other technologies has been creating a new paradigm. In a field of transportation, the intelligent transport systems which is a convergence of intelligent technologies and transportation systems have been studied. The Variable Speed Limit(VSL), is one of ITS technologies, is thought to improve safety and efficiency of transportation while controlling speed limit based on road conditions. Legacy studies have considered only one station for VSL algorithm. However, it is not appropriate for an urban freeway installed with many stations. In this paper, new algorithm is proposed to not only enhance effectiveness of VSL based on cooperation of stations but also reflect road conditions within 30 seconds. The proposed algorithm consists of 4 steps: the first is a "searching bottleneck station" step, the second is a "calculating a size of congestion" step, the third is a "calculating the number of controlled stations" step, the final is a "calculating VSL" step. This algorithm guarantees improved safety and minimum additional travel time. The travel time should be considered because drivers would against the VSL algorithm when the proposed algorithm occurs additional travel time. In our experiments, microscopic traffic simulator VISSIM is selected to perform a modeling work. The results show that proposed algorithm provides the improved safety and minimum increase of travel time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.813-826
• /
• 1999

실시간 멀티미디어 응용의 등장으로 멀티캐스트와 QoS(Quality of Service) 지원이 필수적인 망 서비스로 부각되고 있다. 이에, ATM 기반의 인터넷에서 IP 멀티캐스트의 효율적인 처리를 위하여 MARS(Multicast Address Resolution Server)가 제안되었고, 기존의 최선 서비스 기반의 인터넷에서 QoS(Quality of Service)를 지원하기 위하여 RSVP(Resource Reservation Protocol)가 제안되었다. 본 논문에서는 ATM 망에서 QoS가 지원되는 IP 멀티캐스트 서비스를 제공하기 위하여 MARS 구조에서 RSVP를 지원하는 두 가지 방안을 제안하고, 시뮬레이션을 통하여 그 성능을 분석하였다. 제안하는 두 가지 방법은 각각 'RSVP 전 홉 노드 방식'과 'MARS 서버 방식'이라 명명하였다. RSVP 전 홉 노드 방식은 송신원으로부터 ATM 망으로 진입하는 노드와 수신원을 향하여 ATM 망을 진출하는 노드 간에 각각 일대일 양방향 VC를 설정하여 멀티캐스트 그룹에 속하는 수신원들이 보내는 자원 예약 메시지를 ATM 망에서 전송하는 방안이다. MARS 서버 방식은 ATM 망을 진출하는 노드와 MARS 서버간에 MARS 제어 메시지 교환을 위해 존재하는 ATM VC를 사용하여 RSVP의 자원 예약 메시지를 전송하고, MARS 서버가 RSVP 자원 예약 메시지를 처리하도록 그 기능을 확장함으로써 ATM 망에서 필요로 하는 제어 VC 수를 절약할 수 있는 방안이다. 시뮬레이션을 통하여, MARS 서버 방식은 ATM 제어 VC의 수를 절약할 수 있을 뿐 아니라 경우에 따라 RSVP 자원 예약 메시지 전달 지연을 줄일 수도 있음을 볼 수 있었다. 그러나, MARS 클러스터 내에 동시에 존재하는 RSVP 흐름이 많을 때에는 MARS 서버 방식의 경우 MARS 서버에서의 병목 현상으로 인해 성능이 저하될 수 있다.Abstract Emerging real time multimedia applications require multicast service with a QoS(Quality of Service) support. An overlay service architecture MARS(Multicast Address Resolution Server) is proposed to support IP multicast over an ATM network, and a resource reservation protocol RSVP is proposed to provide QoS support in the Internet which is originally based upon best effort service only. In this paper, we propose two schemes to support IP multicast service with QoS support over ATM networks: 'RSVP Previous Hop Node(RPHN) scheme' and 'MARS server based scheme'. In RPHN scheme, the RSVP reservation messages are transported via one-to-one ATM control VC from the egress nodes to the ingress nodes of the the multicast flow set up between each pair of nodes. The RSVP message processing occurs at the ingress nodes of the multicast flow. Whereas, in the MARS server based scheme, the RSVP reservation messages are transported via the MARS control VCs between the egress nodes and the MARS server. The RSVP message processing burden is imposed at MARS server in this scheme. For MARS server based scheme, no additional ATM VC is required for RSVP reservation message transmission, while the processing burden at the MARS server is high. Simulation results show that the MARS server based scheme, may accomplish RSVP reservation message delivery with smaller delay as well as saving of the number of ATM VCs. When the number of simultaneous RSVP flows in the MARS cluster is large, however, MARS based scheme may suffer performance degradation since MARS server becomes a performance bottleneck.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.117-128
• /
• 2002

Virtual LAN (VLAN) is an architecture to enable communication between end stations as if they were on the same LAN regardless of their physical locations. VLAN defines a limited broadcast domain to reduce the bandwidth waste. The Newbridge Inc. developed a layer 3 VLAN product called VIVID, which configures a VLAN based on W subnet addresses. In a VIVID system, a single route server is deployed for address resolution, VLAN configuration, and data broadcasting to a VLAN. If the size of the network, over which the VLANS supported by the VIVID system spans, becomes larger, this single route server could become a bottleneck point of the system performance. One possible approach to cope with this problem is to deploy multiple route servers. We propose two architectures, organic and independent, to expand the original VIVID system to deploy multiple route servers. A course of simulations are done to analyze the performance of each architecture that we propose. The simulation results show that the performances of the proposed architectures depend on the lengths of VLAN broadcasting sessions and the number of broadcast data frames generated by a session. It has also been shown that there are tradeoffs between the scalability of the architecture and their efficiency in data transmissions.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.7
• /
• pp.63-73
• /
• 2015

In the end to end data transfer protocols, it is very important to correctly estimate available bandwidth. In UDT (UDP based Data Transfer), receiver estimates the MTR (Maximum Transfer Rate) of the current link using pair packets transmitted periodically from sender and, then sender finally decides the MTR through EWMA (Exponential Weighted Moving Average) algorithm. Here, MTR has to be exactly estimated because available bandwidth is calculated with difference of MTR and current transfer rate. However, when network is congested due to traffic load and where competing flows are coexisted, it bring about a severe fairness problem. This paper proposes a congestion degree based MTR estimation algorithm. Here, the congestion degree stands a relative index for current congestion status on bottleneck link, which is calculated with arriving intervals of a pair packets. The algorithm try to more classify depending on the congestion degree to estimate more actual available bandwidth. With the network simulation results, our proposed method showed that the fairness problem among the competing flows is significantly resolved in comparison with that of UDT.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.10
• /
• pp.1845-1852
• /
• 2008

The key elements of inter prediction are motion estimation(ME) and motion compensation(MC). Motion estimation is to find the optimum motion vectors, not only by using a distance criteria like the SAD, but also by taking into account the resulting number of 비트s in the 비트 stream. Motion compensation is compensate for movement of blocks of current frame. Inter-prediction Encoding is always the main bottleneck in high-quality streaming applications. Therefore, in real-time streaming applications, dedicated hardware for executing Inter-prediction is required. In this paper, we studied a motion estimator(ME) for H.264/AVC. The designed motion estimator is based on 2-D systolic array and it connects processing elements for fast SAD(Sum of Absolute Difference) calculation in parallel. By providing different path for the upper and lower lesion of each reference data and adjusting the input sequence, consecutive calculation for motion estimation is executed without pipeline stall. With data reuse technique, it reduces memory access, and there is no extra delay for finding optimal partitions and motion vectors. The motion estimator supports variable-block size and takes 328 cycles for macro-block calculation. The proposed architecture is local memory-free different from paper [6] using local memory. This motion estimation encoder can be applicable to real-time video processing.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.112-115
• /
• 2009

Inter-Prediction is always the main bottleneck in H.264/AVC Baseline Profile. This paper describes an efficient Inter-Prediction hardware architecture design. H.264/AVC decoder supports various block types such as $16{\times}16$, $16{\times}8$, $8{\times}16$, $8{\times}8$, $8{\times}4$, $4{\times}8$, $4{\times}4$ block types. Reference Software(JM) only considers the $4{\times}4$ block type when the reference block is being fetched. This causes duplicated pixels which needs extra fetch cycles. In order to eliminate some of the duplicated pixels, the $8{\times}8$ and $4{\times}4$ block types were considered in the previous design. If the block size is larger than or equal to the $8{\times}8$ block type, it will be separated into several $8{\times}8$ block types and if the block size is smaller than the $8{\times}8$ block type it will be separated into several $4{\times}4$ blocks. For further reduction of the fetch cycles, the various block types are considered in this paper. As a result, the maximum cycle reduction percentage is 18.6% comparing with the previous design.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.39 no.5
• /
• pp.595-603
• /
• 2019

To alleviate the demand on private car that is constantly increasing, Busan Metropolitan City (BMC) has established Bus Rapid Transit (BRT) to revitalize public transportation. But there are no unified lane system between BRT and general bus stations, which makes off-lane turning general bus to contribute to congestion. And as the bottleneck phenomenon at entrance/exit accelerates the congestion, there has been huge dissatisfaction among commuting drivers. Therefore, this study identifies efficient methods to operate better through measuring civilian awareness. We evaluate both satisfaction and drawbacks on BRT service with Importance-Performance Analysis (IPA). We first distinguish the groups by the awareness on BRT and their main transit usage, and then clarify the difference between the groups. And as a result, the group who is positive to BRT and uses buses often demands improvement in bus indoor comfort and curbing jaywalking. On the other hand, group who is negative to BRT and uses private cars often demands improvement in lane changing and the moving speed of private cars. We next examines the groups with MDPREF, one method of Multidimensional Scaling (MDS). And we have clarified that the evaluating criteria and the individual attributes of the groups corresponds very well.

• Journal of Cadastre & Land InformatiX
• /
• v.48 no.2
• /
• pp.171-183
• /
• 2018

Despite the rapid expansion of satellite images supply, the application of imagery is often restricted due to unautomated image processing. This paper presents the automated process for the selection of training areas which are essential to conducting supervised image classification. The training areas were selected based on the prior and cover information. After the selection, the training data were used to classify land cover in an urban area with the latest image and the classification accuracy was valuated. The automatic selection of training area was processed with following steps, 1) to redraw inner areas of prior land cover polygon with negative buffer (-15m) 2) to select the polygons with proper size of area ($2,000{\sim}200,000m^2$) 3) to calculate the mean and standard deviation of reflectance and NDVI of the polygons 4) to select the polygons having characteristic mean value of each land cover type with minimum standard deviation. The supervised image classification was conducted using the automatically selected training data with Sentinel-2 images in 2017. The accuracy of land cover classification was 86.9% ($\hat{K}=0.81$). The result shows that the process of automatic selection is effective in image processing and able to contribute to solving the bottleneck in the application of imagery.