• Proceedings of the Korea Water Resources Association Conference
• /
• 2020.06a
• /
• pp.360-360
• /
• 2020

조립식 빗물침투형 저류블록은 우수유출 저감시설로, 황토 및 친환경 무기질 결합재를 이용하여 제작한 고강도 투수성 블록의 적층 및 요철에 의한 끼움식 조립에 의해 형성된 공간에 빗물을 저류하고, 저장된 빗물은 시간이 지남에 따라 지반으로 침투시키는 우수유출 저감용 빗물관리시설로, 집중강우 시 유출수가 발생하는 해당지역에 분산식으로 설치하여 국지적 호우 발생에 대처할 수 있으며, 지속적인 침투를 통한 지하수위 확보 및 가뭄현상의 저감은 물론, 미기후 조성과 건전한 물순환 구조 형성에 이바지하는 빗물관리기술이다. 본 기술은 집중형 대규모 빗물저류조의 적용상의 문제점과 단순저류의 한계성을 극복하고, 기존 침투시설의 낮은 침투능을 증대시키고자 저류기능과 침투기능을 동시에 확보하여 집중호우시 빠른 침투저류능을 향상시킨 조립식 빗물침투형 저류시설이다. 보다 구체적으로는 집중강우에 대한 방재적 측면과 함께 가뭄으로 발생하는 지하수위 저하 등에 친환경적으로 대응하기 위한 복합적인 빗물관리 기술로서, 빗물 유출저감과 함께 물순환 회복 및 저영향개발을 위한 각 지자체의 지침과도 부합될 수 있다. 또한, 콘크리트 제품의 환경적 문제점과 플라스틱 제품의 낮은 물성을 극복하였고, 시공 시에는 보다 현장상황에 맞게 가변적 형태로 적용이 가능한 단순조립 적층공법으로 공기단축에 탁월한 장점이 있으며, 유지관리 시에는 별도의 동력이 요구되지 않는 형태로 개발하였다. 조립식 빗물침투저류블록의 구조체를 이루는 단위 블록유닛은 투수성 소재로 제작되며, 상하부가 개방되어 있고 사각형의 내부에 힘을 받는 격벽과 전후벽이 상호 대응되는 요철로 형성되어 있으며, 단위블록 유닛 다수개가 수직수평으로 연속적으로 조립되어 규모의 제한, 형태의 제한이 없는 구조물 형성이 가능하다. 본 구조체의 저류공극율은 80%이상 확보 가능하며, 또한 블록자체의 투수율이 0.83mm/sec로서 순모래나 순자갈의 포화투수계수보다 투수율이 높아 침투저류 효율성이 높으며 시공 후 상부 토지는 자유롭게 활용 가능하다. 본 조립식 빗물 침투형 저류블록을 이용하여 저영향개발 계획, 우수유출 저감대책 수립, 빗물관리시설 계획시 기존의 시설들에 비하여 경제적, 효율적인 설계가 가능하다.

• Journal of Internet of Things and Convergence
• /
• v.10 no.2
• /
• pp.109-114
• /
• 2024

Enterprise storage systems that require high data reliability are applying RAID (Redundant Array of Independent Disks) systems to recover from data loss and failure. In particular, RAID 5 ensures space efficiency and reliability by distributing parity across multiple storage devices. However, when storage devices have different capacities, RAID is built based on the smallest capacity storage device, resulting in wasted storage space. Therefore, research is needed to solve this resource management problem. In this paper, we propose a method for RAID grouping of each independent NAND flash memory block in a RAID consisting of SSD (Solid State Disk) with external SSDs as well as internal SSDs. This method is divided into a policy for delivering block information inside SSDs to the RAID system and a policy for RAID grouping of physical addresses delivered from the RAID system. This method allows us to maintain a RAID that does not waste resources when SSDs of different capacities are grouped into RAID5. Finally, we demonstrate the effectiveness of the proposed method through experiments.

• Journal of Cadastre & Land InformatiX
• /
• v.46 no.2
• /
• pp.57-77
• /
• 2016

This paper analysis spatial correlation applying commercial activating factor and categories clusters among have homogeneity in garosu street which are rising commercial issue in residential district. Based on this research we can draw several implications. Firstly, Garosu street are forming unique space around fassion feature like clothes and food and Beverage stores are supporting main functions. secondly, in terms of utilization of semi-public space in individual buildings, main Street are using display goods and put product.Also restaurants and cafes are using public space as terrace seats. These results mean principal road emphasizes displaying and passing but inner road emphasizes taking a break and staying. Third, repetitive action between high rising vacancy and new building cause negative effects city decline and lossing identity. So residents and merchants should cooperate and make communities for sustainable district.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.438-441
• /
• 2011

최근 태블릿 컴퓨터(Tablet computer) 등 첨단 모바일 기기가 대중화되고 고성능 노트북이 널리 사용되면서 SSD(Solid State Drive)를 주 저장장치로 사용하는 시스템이 증가하고 있다. 이들 시스템에서는 SSD를 가상메모리의 스왑 영역으로 사용하므로 이에 적합한 가상메모리 정책이 필요하다. SSD 제조사는 SSD 내부의 자세한 정보는 제공하지 않기 때문에 최적화된 할당에 어려움이 생긴다. 본 논문에서는 SSD의 내부 상태를 기록하고, VM의 스왑 공간으로 사용 시 각블록 상태를 고려하여 최적화된 할당 페이지를 선택하는 기법을 제안한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.6
• /
• pp.99-105
• /
• 2022

This paper deals with the problem of appropriately allocating multiple processors arriving at the ready queue to the block in the user space of the main memory is divided into blocks of variable size at compilation time. The existing allocation methods, first fit(FF), best fit(BF), worst fit(WF), and next fit(NF) methods, had the disadvantage of waiting for a specific processor because they failed to allocate all processors arriving at the ready queue. The proposed algorithm in this paper is a simple block packing algorithm that allocates as many processors as possible to the largest block by sorting the size of the partitioned blocks(holes) and the size of the processor in the ready queue in descending order. The application of the proposed algorithm to nine benchmarking experimental data showed the performance of allocating all processors while having minimal internal fragment(IF) for all eight data except one data in which the weiting processor occurs due to partition errors.

• Applied Microscopy
• /
• v.41 no.3
• /
• pp.147-154
• /
• 2011

Backscattered electrons (BSE) are generated at the impact of the primary electron beam on the specimen. BSE imaging provides the compositional contrast to resolve chemical features of sectioned block-face. A focused ion beam (FIB) column can be combined with a field emission scanning electron microscope (FESEM) to ensure a dual (or cross)-beam system (FIB-FESEM). Due to the milling of the specimen material by 10 to 100 nm with the gallium ion beam, FIB-FESEM allows the serial block-face (SBF) imaging of plastic-embedded specimens with high z-axis resolution. After contrast inversion, BSE images are similar to transmitted electron images by transmission electron microscopy. As another means of SBF imaging, a specialized ultramirotome has been incorporated into the specimen chamber of FESEM ($3View^{(R)}$). Internal structures of plastic-embedded specimens can be serially revealed and analyzed by $3View^{(R)}$ with a large field of view to facilitate three-dimensional reconstruction. These two SBF approaches by FESEM can be employed to unravel spatial association of (sub)cellular entities for a comprehensive understanding of complex biological systems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.4
• /
• pp.231-239
• /
• 2007

This paper presents the trade-off relationship between area and performance in the hardware design space exploration for the Korean national standard 128-bit block cipher algorithm SEED. In this paper, we compare the following four hardware design types of SEED algorithm : (1) Design 1 that is 16 round fully pipelining approach, (2) Design 2 that is a one round looping approach, (3) Design 3 that is a G function sharing and looping approach, and (4) Design 4 that is one round with internal 3 stage pipelining approach. The Design 1, Design 2, and Design 3 are the existing design approaches while the Design 4 is the newly proposed design in this paper. Our new design employs the pipeline between three G-functions and adders consisting of a F function, which results in the less area requirement than Design 2 and achieves the higher performance than Design 2 and Design 3 due to pipelining and module sharing techniques. We design and implement all the comparing four approaches with real hardware targeting FPGA for the purpose of exact performance and area analysis. The experimental results show that Design 4 has the highest performance except Design 1 which pursues very aggressive parallelism at the expanse of area. Our proposed design (Design 4) shows the best throughput/area ratio among all the alternatives by 2.8 times. Therefore, our new design for SEED is the most efficient design comparing with the existing designs.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.458-461
• /
• 2011

모바일 디바이스 저장 장치로 많이 사용되고 있는 플래시 메모리는 가벼운 무게, 내구성, 낮은 전력 소비 등의 장점을 가지고 사용되기 시작하였으며 근래에는 모바일 뿐 아니라 다양한 멀티 미디어 디바이스 전반의 많은 제품에 채용되어 더욱 더 그 범위가 확산되는 추세에 있다. 플래시 메모리는 위에서 언급한 많은 장점이 있지만 기존에 사용되던 디스크와 달리 플래시 메모리 블록을 재사용하기 위해서는 삭제 후 쓰기라는 별도의 연산을 필요로 한다. 이를 FTL (Flash Translation Layer) 이라는 S/W 모듈을 통해 구현되어 있으며 FTL의 구현 알고리즘에 따라 소용되는 연산 비용 또한 상이하며 그 특성과 성능이 매우 다양하게 나타난다. 일반적으로 리눅스에서 FTL은 커널 내부에 구현되어 디바이스 드라이버 형태로 존재하며 일반적인 S/W 개발자보다는 플래시 및 커널 관련 전문지식을 가진 시스템 개발자가 구현을 하게 된다. 이 논문에서는 커널 및 시스템에 대한 깊은 지식 없이도 새롭게 고안된 FTL 알고리즘을 쉽고 빠르게 구현, 검증할 수 있도록 커널이 아닌 사용자 공간에 FTL을 구현하여 빠른 시간 내에 착안된 알고리즘을 실험, 검증할 수 있는 UFTL(User Space Flash Translation Layer) 개발 플랫폼올 제안한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.6
• /
• pp.440-447
• /
• 2020

Masonry structures are used as bearing walls in small buildings, but they are generally considered non-bearing walls. They are used as partition walls that divide the interior spaces of the frame structures of buildings. In addition, wetting techniques that use mortar as an adhesive between blocks or bricks in construction are vulnerable to climatic conditions, especially cracks in mortar, which can cause conduction collapse of the walls in seismic loading. The purpose of this research was to propose a dry concrete block construction method that complements the weak axial shear stiffness and improves the weakness of the wet construction method as well as to investigate its structural behavior. In this study, the material properties of concrete blocks were examined, and the seismic performance of the proposed dry assembly structure was verified by structural behavior tests on horizontal cyclic loads. First, in these study results, concrete blocks can be applied to the dry block construction method instead of wet construction methods because they secure more than C-type blocks in KS regulations. Second, the structural performance of the wall against a horizontal cyclic load indicates that the resisting force of the assembly block wall is increased by increasing the horizontal length of the wall, forming several diagonal cracks. Finally, the proposed dry block wall structure requires a seismic performance assessment considering that the ratio of the shape of the wall by height and length is considered a major influence variable on the structural behavior under a horizontal load.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.119-127
• /
• 2006

Real-time animation of human figures in virtual environments is an important problem in the context of computer games and virtual environments. Recently, the use of large collections of captured motion data have added increased realism in character animation. However, assuming that the virtual environment is large and complex, the effort of capturing motion data in a physical environment and adapting them to an extended virtual environment is the bottleneck for achieving interactive character animation and control. We present a new technique for allowing our animated characters to navigate through a large virtual environment, which is constructed using a small set of building blocks. The building blocks can be tiled or aligned with a repeating pattern to create a large environment. We annotate each block with a motion patch, which informs what motions are available for animated characters within the block. We demonstrate the versatility and flexibility of our approach through examples in which multiple characters are animated and controlled at interactive rates in large, complex virtual environments.