Earticle

Unbraced vinyl house frame that is economically installed is certainly easy to collapse under the influence of excess snow load. To make it more cheaply in putting up as well as more efficiently in withstanding the applied snow load, it is essential to insert additional bracing into the existing unbraced vinyl house frame. On the other hand, there are varieties of possible bracing shapes that can be formed. However, their efficiencies are different. Therefore, it is important to identify the most effective bracing shape. In this study, 2 different kinds of bracing shapes, horizontal and inclined bracing, are used to additionally install in the ordinary single frames in order to show the effect of the bracing resisting the applied snow load and compare the bending moment, axial force, combined stress and vertical displacement of the vinyl house frame.

1990년대 초반 데이터마이닝 방법론이 등장한 이후 현재까지 정확성과 신속성을 향상시키기 위한 기법들이 꾸준히 연구되고 있다. 본 연구에서는 데이터마이닝 방법론 중 하나인 연관규칙 마이닝 과정에서 작업 수행 시간을 최소화하기 위하여 그래프 구조를 사용하였다. 본 연구에서 제시한 알고리즘의 특징은 다음과 같다. 첫째, 데이터베이스 스캐닝을 하여 연관규칙을 찾는데 필요한 모든 정보를 그래프에 저장하였다. 둘째, 트랜잭션 그룹핑을 통해 동일한 레코드 값에 대한 접근 횟수를 최소화하였다. 셋째, 동일한 데이터에서 파라메터의 값만 변경하여 새로 연관규칙을 찾으려 하는 경우, 기 생성된 그래프의 데이터를 재사용함으로써 연관규칙을 찾는 시간을 최소화하였다. 넷째, 빈발항목집합을 찾는 과정에서 후보항목집합의 생성을 배제하였다. 마지막으로, 알고리즘의 성능을 측정하기 위하여 전통적인 연관규칙분석 방법인 Apriori Algorithm과 메모리 기반의 데이터 클러스터링 방법을 사용한 Cluster-based Association Rule Algorithm을 구현하여 비교한 결과, 본 연구에서 제시한 알고리즘이 기존 연구보다 효율성이 높게 나타남을 확인하였다.

우리나라의 지방정부는 재난대응에 있어서 일차적 책임을 지닌다. 현재 지방정부의 재난관리 조직의 운영형태는 대체로 분산관리방식을 택하고 있다. 현재 지방정부별로 재난을 담당하고 있는 부서의 명칭과 운영체계는 통일성이 확보되지 못하고 있고, 재난관리업무 협조, 지역의 민간단체와 협력, 재난관리인력, 장비부족과 같은 다양한 문제점이 지적되고 있다. 이 논문은 우리나라의 지방정부별재난관리 조직운영을 분석하여 한국의 지방정부 재난관리 조직을 효율적으로 운영하기 위하여 정책적 방향을 제시하는 데 연구의 목적이 있다. 연구결과 지역 재난통합컨트롤 타워 확보를 통한 운영체계의 일원화, 상시기구와 비상기구의 혼란을 방지, 재난관련 유관부서의 이기주의 극복, 전문성과실효성 있는 재난관리 조직에 대한 계획 수립이 필요하다고 본다. 지방정부의 특수성이 포함될 수있도록 포괄적인 범위에서 협력적 네트워크 구축과 함께 적시적 여건과 전망 분석을 통해 현실적인계획 수립에 힘쓰고, 현재의 재난관리 역량수준을 진단하여 재난안전예산 확보를 위한 나름대로의근거를 마련하고 재난관리 역량의 강화에 노력을 쏟아야 할 것이다.

Local governments in Korea bear the primary responsibility for disaster response. This study aims to explore an efficient way to operate disaster management organizations of Korea’s regional local governments. The findings are as follows. First, the unification of operating system should be needed by securing a regional-level integrated disaster control tower. Second, any confusion between a permanent organization and an emergency organization should be prevented. Third, institutional egoism related to disaster management should be overcome. More efforts should be made to construct a comprehensive cooperative network to incorporate region-specific characteristics and contents, collect all disaster-related information within each administrative area, establish a realistic plan through an analysis of appropriate conditions and prospects, and prepare the foundation to reinforce disaster management capability.

공격 무기체계의 발전에 따라 함정전투체계는 짧은 반응, 시간에 적합한 전술 대응 방법으로 자함의 생존율을 증가시켜야 한다. 신속한 센서표적 처리를 통한 신속한 전술상황의 평가가 이를 달성할 수 있게 한다. 기존 함정전투체계는 해시맵 기반 표적 저장소를 사용하여 신속하게 센서표적을 처리하고자 하였다. 그러나 해시맵 기반 저장소의 값 기반 검색은 상대적으로 비효율적이며, 센서표적 처리시간을 증가시키는 한 가지 요인이 될 수 있다. 본 논문은 값 기반 검색 성능을 개선한 표적 저 장소 구조를 제안하여 더욱 신속하게 센서표적을 처리하고자 한다. 제안된 구조의 효과성을 평가하기 위해 수행된 실험에서, 제안 저장소 구조는 기존 해시맵 기반 구조에 비해 센서표적 처리시간을 5%-10% 축소시켰음을 확인할 수 있었다.

With the advancement of attack weapon systems, naval combat systems must increase their own survival rate through appropriate tactical responses in a short reaction time. Agile assessment of the tactical situation through rapid sensor track processing makes this achievable. Common naval combat systems aim to process sensor tracks more efficiently using a hashmap-based track repository. However, the value-based search of a hashmap-based repository can be relatively inefficient, potentially increasing the sensor track processing t ime. T his paper presents a n ew t rack r epository structure that improves the performance of value-based searches to process sensor tracks more efficiently. The experiments showed that the proposed repository structure reduced the sensor track processing time by 5%-10% compared to the hashmap-based structure.

While the World-Wide Web offers an incredibly rich base of information. organized as a hypertext it does not provide a uniform and efficient way to retrieve specific information. Therefore. it is needed to develop an efficient web crawler for gathering useful information in acceptable amount of time. In this paper. we studied the order in which the web crawler visit URLs to rapidly obtain more important web pages. We also developed an internet agent for efficient web crawling using hyperlink structure and fitness of hypertext documents. As a result of experiment on a website. it is shown that proposed agent outperforms other web crawlers using BackLink and PageRank algorithm.

그룹 통신은 인터넷을 통해 급속도로 발전 중이며, 그룹통신으로는 화상회의, 인스턴트 메시지, 데스크 탑 공유, 다양한 e-커머스등과 같은 응용프로그램들이 있다. 안전한 그룹통신을 위해서 그룹 키를 생성하여 통신 메시지를 암호화하여 교환함으로써 그룹통신의 기밀성을 보장할 수 있다. 본 연구에서는 그룹 키를 보다 안전하면서 효율적으로 생성하여 안전한 그룹통신에 기여하는데 그 목적이 있다.

Group communication on the Internet is exploding in popularity. Video conferencing, Enterprise IM, desktop sharing, and numerous forms of e-commerce are but a few examples of the ways in which the Internet is being used for business. The growing use of group communication has highlighted the need for advances in security. There are several approaches to securing user identities and other information transmitted over the Internet. One of the foundations of secure communication is key management, a building block for encryption, authentication, access control, and authorization.

최근 가상환경에서 몰입감을 늘리고 자유로운 상호작용을 제공하기 위한 손 제스처 인식에 대한 연구가 활발히 진행 되고 있다. 그러나 기존의 연구는 특화된 센서나 장비를 요구하거나, 낮은 인식률을 보이고 있다. 본 논문은 정적 손 제스처와 동적 손 제스처 인식을 위해 카메라 이외의 별도의 센서나 장비 없이 딥러닝 기술을 사용한 손 제스처 인식 방법을 제안한다. 일련의 손 제스처 영상을 고주파 영상으로 변환한 후 손 제스처 RGB 영상들과 이에 대한 고주파 영상들 각각에 대해 덴스넷 3차원 합성곱 신경망을 통해 학습한다. 6개의 정적 손 제스처와 9개의 동적 손 제스처 인터페이스에 대해 실험한 결과 기존 덴스넷에 비해 4.6%의 성능이 향상된 평균 92.6%의 인식률을 보였 다. 본 연구결과를 검증하기 위하여 3D 디펜스 게임을 구현한 결과 평균 34ms로 제스처 인식이 가능하여 가상현실 응용의 실시간 사용자 인터페이스로 사용가능함을 알 수 있었다.

Recently, there has been active studies on hand gesture recognition to increase immersion and provide user-friendly interaction in a virtual reality environment. However, most studies require specialized sensors or equipment, or show low recognition rates. This paper proposes a hand gesture recognition method using Deep Learning technology without separate sensors or equipment other than camera to recognize static and dynamic hand gestures. First, a series of hand gesture input images are converted into high-frequency images, then each of the hand gestures RGB images and their high-frequency images is learned through the DenseNet three-dimensional Convolutional Neural Network. Experimental results on 6 static hand gestures and 9 dynamic hand gestures showed an average of 92.6% recognition rate and increased 4.6% compared to previous DenseNet. The 3D defense game was implemented to verify the results of our study, and an average speed of 30 ms of gesture recognition was found to be available as a real-time user interface for virtual reality applications.

본 논문에서는 상황 변화 환경에서 적응적인 객체 인식을 위한 계층적 트리 구조를 이용한 조명 온톨로지 분류에 대한 방식을 제안한다. 본 논문에서는 상황이 불변하는 환경에서 동작하는 개발된 많은 시스템을 찾아냈고, 상황에 맞는 감지를 위한 새로운 개념의 트리 구조를 이용한 온톨로지를 도입하였다. 조명의 영향이 상황 인지 인식 시스템을 아주 설계하기 어려운 시스템으로 만들기 때문에 본 논문에서는 트리 구조의 온톨로지를 사용하여 이러한 상황 변화 시스템을 설계하는데 더 중점을 두었다. 온톨로지는 일반적으로 사람들이 특정 분야의 것들에 대해 생각하는 방법의 추상적 모델에서 전형적으로 캡처된 한 분야의 개념화의 명시적 사양으로 정의 할 수 있다. 인간은 기본 원칙과 환경을 이해하고 설명하기 위해 온톨로지를 생성한다. 본 연구에서는 상황 온톨로지, 상황 모델링, 상황 적응 및 조명 기준에 따라 트리 구조 온톨로지를 설계하는 상황 분류를 제안했다. 조명 온톨로지의 적당한 영역을 선택한 후, 그 영역에서 더 나은 성능을 생산하는 동작의 한 집합을 선택하는데 있어서 장점을 얻었다. 본 논문에서는 역동적인 변화 환경에서 객체 인식의 영역에서 이러한 개념을 이용하여 폭 넓은 실험을 수행하였으며 제안하는 기본 개념에 대해 수행할 수 있는 많은 성공을 얻었다.

This paper proposes a ontology of tree structure approach for adaptive object recognition in a situation-variant environment. In this paper, we introduce a new concept, ontology of tree structure ontology, for context sensitivity, as we found that many developed systems work in a context-invariant environment. Due to the effects of illumination on a supreme obstinate designing context-sensitive recognition system, we have focused on designing such a context-variant system using ontology of tree structure. Ontology can be defined as an explicit specification of conceptualization of a domain typically captured in an abstract model of how people think about things in the domain. People produce ontologies to understand and explain underlying principles and environmental factors. In this research, we have proposed context ontology, context modeling, context adaptation, and context categorization to design ontology of tree structure based on illumination criteria. After selecting the proper light-ontology domain, we benefit from selecting a set of actions that produces better performance on that domain. We have carried out extensive experiments on these concepts in the area of object recognition in a dynamic changing environment, and we have achieved enormous success, which will enable us to proceed on our basic concepts.

With the development of 3D devices such as TV, monitors, and mobile phones, 3D display can support multiple viewpoints in the user's terminal. For these applications, higher coding efficiency for stored or transmitted data is significant, since the number of views has been increased with the technical development of 3D display. To adapt the coder to 2D and diverse views devices, it is important to support view scalability in 3DVC. In this paper, we propose a prediction structure of 3D video to support view scalability considering reliable performance in coding efficiency. In order to use correlation between color video and depth map, an inter-layer prediction structure in SVC is applied to 3DVC. It improves the coding efficiency of the additional depth map with supporting the view scalability. The experimental results show that the proposed prediction structure reduces the bitrates by 0.5~8.3% compared with the reference prediction structure, JMVC 8.5.

With the development of many new technologies, the data grows much faster than before, and most of the data are stored in database. When the data amount in database is huge, it is needed to create appropriate index to keep the performance of database applications. This paper proposes a new index structure, namely MCRC-tree, to solve complicated range count query problem efficiently. Multiple experiments show that the performance of MCRC-tree is similar to that of traditional B-tree, to be specific, MCRC-tree can solve any range count query in O(logcN) I/Os, so is the complexity of insert and delete operations, here C means the disk page size, N is the total data amount.

The previous PDA based wireless meter reading system uses the method of transmitting the meter value of the gauge using the PDA meter reader when instructed by the PDA meter reader. Such meter reading methods requires a considerable amount of time when collecting the data from multiple collectors. This paper will propose the structuring of new meter reading system (Mobile OMR) and meter reading infra (Mobile Dongle) in order to overcome the limits and disadvantages of the previous PDA wireless meter reading system using the smart devices that can directly communicate with the remote meter reading system and the mobile dongle that can be linked to the smart devices. In addition, by utilizing the many features of smart devices and to solve the problems of timely/costly occurrence of installing wireless meter reading system, meter reading and maintenance, it was configured to enable the selection change of each devices and immediate meter reading operation test directly at the site according to the situation of the site where the remote meter reading system is installed. In addition, by using the smart devices, a user authentication technique to solve the security issues on the use of application was proposed, and through the GPS and map function, the location information of installation site of each devices were accurately mapped in order to allow the convenience in management of location information on the installation site of all devices, and by receiving the log data or status information stored in the remote meter reading system in high speed, it intends to provide the installation check, meter reading and maintenance methods of remote meter reading system using the smart devices and mobile dongle that can enable to recovery of data during the failure period and reducing the maintenance time.

RDF data is widely used for exchanging data nowadays to enable semantic web era. This leads to the need for storing and retrieving these data efficiently and effectively. Recently, the structure index in graph-based perspective is considered as a promising approach to deal with issues of complex query graphs. However, even though there are many researches based on structure indexing, there can be a better architectural approach instead of addressing the issue as a part. In this research, we propose architecture for storing, query processing and retrieving RDF data in efficient manner using structure indexing. Our research utilizes research results from iStore and 2 relation-based approaches and we focus on improving query processing to reduce the time of loading data and I/O cost.

This paper presents a comparative research of low-power and high-speed full adder cells which are based on XOR-XNOR algorithm. The adder cells are decomposed into small modules and all of them have an in-depth analysis. Several designs of each of them are implemented, optimized, simulated and analyzed separately. We also design a novel XOR-XNOR module built upon bootstrapped pass transistor logic use silicon on insulator (SOI) process with the characteristics of the full voltage swing at internal nodes and low short-circuit current which helps in reducing the power-delay product (PDP) for high performance applications. Many different full adder cells are constructed with different XOR-XNOR modules. A realistic test environment with buffers and loads are used for simulation. All full adder cells were simulated by HSPICE based on 130 nm CMOS technology at 1.2 V supply voltages. Four sets of frequencies were operated: 25 MHz, 50 MHz, 100 MHz and 200 MHz with 50% duty cycle at four different load capacitances. A comprehensive comparison and analysis are also carried out to test the performance of the adders. Each of these cells shows different performances in terms of power consumption, speed, and PDP. The simulation results of this research are expected to help designers to select the appropriate full adder cell that satisfies their specific applications.

최근 실시간 서비스의 요구 사항을 갖는 위치 기반 서비스와 텔레매틱스 서비스를 효율적으로 제공하기 위해서 공간 메인메모리 DBMS에 대한 관심이 급증하고 있다. 이러한 공간 메인 메모리 DBMS에서 기존의 디스크 기반 공간 인덱스들을 메인 메모리에 최적화하기 위해 엔트리 크기를 줄여 캐시 접근 실패를 최소화한 공간 인덱스 구조들이 제안되고 있다. 그러나 엔트리 크기를 줄이기 위하여 부모 노드의 MBR을 기준으로 압축하거나 중복된 MBR을 제거하기 때문에 인덱스 갱신 시 MBR 재구성 비용이 증가하고 인덱스 검색 시 효율이 떨어지는 문제점이 있다. 본 논문에서는 MBR 재구성 비용을 줄이기 위하여 넓은 분포의 경우와 좁은 분포의 경우로 나누어 압축 기준점을 다르게 적용하는 RSMBR(Relative-Sized MBR) 압축 기법을 제시하였다. RSMBR 압축 기법은 넓은 분포일 경우 부모 노드 확장 MBR의 좌하점을 기준으로 압축하고, 좁은 분포일 경우 전체 MBR을 일정 크기의 셀로 나누고 각 셀의 좌하점을 기준으로 압축한다. 또한 인덱스 검색 시 검색 비용을 줄이기 위하여 상대 좌표와 크기를 이용하여 MBR을 압축한다. 마지막으로, 본 논문에서는 실제 데이타를 통한 성능 평가를 수행하여 RSMBR 압축 기법의 우수성도 입증하였다.

Recently there is growing interest in LBS requiring real-time services and the spatial main memory DBMS for efficient Telematics services. In order to optimize existing disk-based spatial indexes of the spatial main memory DBMS in the main memory, spatial index structures have been proposed, which minimize failures in cache access by reducing the entry size. However, because the reduction of entry size requires compression based on the MBR of the parent node or the removal of redundant MBR, the cost of MBR reconstruction increases in index update and the efficiency of search is lowered in index search. Thus, to reduce the cost of MBR reconstruction, this paper proposed the RSMB (relative-sized MBR)compression technique, which applies the base point of compression differently in case of broad distribution and narrow distribution. In case of broad distribution, compression is made based on the left-bottom point of the extended MBR of the parent node, and in case of narrow distribution, the whole MBR is divided into cells of the same size and compression is made based on the left-bottom point of each cell. In addition, MBR was compressed using a relative coordinate and size to reduce the cost of search in index search. Lastly, we evaluated the performance of the proposed RSMBR compression technique using real data, and proved its superiority.

The plasma tube array display is expected to realize the wall size display with very high luminous efficacy. The cell design for high luminous efficacy was investigated. Also discharging in plasma tube was observed to investigate the structure for high luminous efficacy. As the result, high luminous efficacy of 5.4 lm/W was achieved.

Highly efficient red phosphorescent OLEDs (PHOLEDs) with a simple, organic, triple-layer structure was developed using the narrow-bandgap fluorescent host material bis(10-hydroxybenzo[h] quinolinato)beryllium complex (Bebq2) and the deep-red dopant tris(1-phenylisoquinoline)iridium (Ir(piq)3). The maximum current and power efficiency values of 12.71 cd/A and 16.02 lm/W, respectively, with an extremely low doping technology of 1%, are demonstrated herein. The results reveal a practical, cost-saving host dopant system for the fabrication of highly efficient PHOLEDs involving the simple structure presented herein, with a reduction of expensive Ir dopants.

As the capacity of NAND flash module increases, the amount of RAM increases for caching and maintaining the FTL mapping information. In order to reduce the amount of mapping information managed in the RAM, a demand-based address mapping method stores the entire mapping information in the flash and some valid mapping information in the form of cache in the RAM so that the RAM can be used efficiently. However, when cache miss occurs, it is necessary to read the mapping information recorded in the flash, so overhead occurs to translate the address. If the RAM space is not enough, the cache hit ratio decreases, resulting in greater overhead. In this paper, we propose a method using two tables called TPMT(Translation Page Mapping Table) and SMT(Segmented Translation Page Mapping Table) to utilize both temporal locality and spatial locality more efficiently. A performance evaluation shows that this method can improve the cache hit ratio by up to 30% and reduces the extra translation operations by up to 72%, compared to the TPM scheme.

The network service have been achieved recently in the vehicle train, bus etc. Network portability have been processed so that it is active around NEMO WG (Network Mobility Working Group)of IETF. We organize NEMO in the railroad environment of the route among the masses traffic mean which has the forecasting. We try to present necessary for a portability network protocol to produce CoA rather efficiently.

Generally, multidimensional data such as image and spatial data require large amount of storage space. There is a limit to store and manage those large amounts of data in single workstation. If we manage the data on parallel computing environment which is being actively researched these days, we can get highly improved performance. In this paper, we propose a parallel multidimensional index structure that exploits the parallelism of the parallel computing environment. The proposed index structure is nP(processor)-nxmD(disk) architecture which is the hybrid type of nP-nD and 1P-nD. Its node structure in-creases fan-out and reduces the height of an index. Also, a range search algorithm that maximizes I/O parallelism is devised, and it is applied to k-nearest neighbor queries. Through various experiments, it is shown that the proposed method outperforms other parallel index structures.