• Title/Summary/Keyword: 대표 프레임

Search Result 462, Processing Time 0.03 seconds

Image Classification of Damaged Bolts using Convolution Neural Networks (합성곱 신경망을 이용한 손상된 볼트의 이미지 분류)

  • Lee, Soo-Byoung;Lee, Seok-Soon
    • Journal of Aerospace System Engineering
    • /
    • v.16 no.4
    • /
    • pp.109-115
    • /
    • 2022
  • The CNN (Convolution Neural Network) algorithm which combines a deep learning technique, and a computer vision technology, makes image classification feasible with the high-performance computing system. In this thesis, the CNN algorithm is applied to the classification problem, by using a typical deep learning framework of TensorFlow and machine learning techniques. The data set required for supervised learning is generated with the same type of bolts. some of which have undamaged threads, but others have damaged threads. The learning model with less quantity data showed good classification performance on detecting damage in a bolt image. Additionally, the model performance is reviewed by altering the quantity of convolution layers, or applying selectively the over and under fitting alleviation algorithm.

Design and Implementation of Distributed Cluster Supporting Dynamic Down-Scaling of the Cluster (노드의 동적 다운 스케일링을 지원하는 분산 클러스터 시스템의 설계 및 구현)

  • Woo-Seok Ryu
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.2
    • /
    • pp.361-366
    • /
    • 2023
  • Apache Hadoop, a representative framework for distributed processing of big data, has the advantage of increasing cluster size up to thousands of nodes to improve parallel distributed processing performance. However, reducing the size of the cluster is limited to the extent of permanently decommissioning nodes with defects or degraded performance, so there are limitations to operate multiple nodes flexibly in small clusters. In this paper, we discuss the problems that occur when removing nodes from the Hadoop cluster and propose a dynamic down-scaling technique to manage the distributed cluster more flexibly. To do this, we design and implement a modified Hadoop system and interfaces to support dynamic down-scaling of the cluster which supports temporary pause of a node and reconnection of it when necessary, rather than decommissioning the node when removing a node from the Hadoop cluster. We have verified that effective downsizing can be performed without performance degradation based on experimental results.

Dynamic Web Service Composition Support for OSGi Environments (OSGi 환경에서의 동적 웹서비스 조합 기법)

  • Ko, Sung-Hoon;Kim, Eun-Sam;Lee, Choon-Hwa
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.11
    • /
    • pp.145-157
    • /
    • 2009
  • OSGi enables services to be dynamically discovered through its service registry for fostering interactions among themselves, positioning itself as one of the most prominent SOA technologies. Web Services also provide a mature technical base of open business services being employed over the Internet and allow more value-added applications to be built up from component services. In this paper, we propose a new architecture, built on the concept of dynamic service binding, to support interbred service compositions of OSGi and Web Services. Web Services are imported into OSGi domains, and the compositions are described in WS-BPEL language. The support for crossbred compositions of OSGi services and Web Services opens up a new opportunity of a wider range of applications beyond their respective traditional target domains of home gateways in LAN environments and business applications in global Internet environments.

A Data-driven Multiscale Analysis for Hyperelastic Composite Materials Based on the Mean-field Homogenization Method (초탄성 복합재의 평균장 균질화 데이터 기반 멀티스케일 해석)

  • Suhan Kim;Wonjoo Lee;Hyunseong Shin
    • Composites Research
    • /
    • v.36 no.5
    • /
    • pp.329-334
    • /
    • 2023
  • The classical multiscale finite element (FE2 ) method involves iterative calculations of micro-boundary value problems for representative volume elements at every integration point in macro scale, making it a computationally time and data storage space. To overcome this, we developed the data-driven multiscale analysis method based on the mean-field homogenization (MFH). Data-driven computational mechanics (DDCM) analysis is a model-free approach that directly utilizes strain-stress datasets. For performing multiscale analysis, we efficiently construct a strain-stress database for the microstructure of composite materials using mean-field homogenization and conduct data-driven computational mechanics simulations based on this database. In this paper, we apply the developed multiscale analysis framework to an example, confirming the results of data-driven computational mechanics simulations considering the microstructure of a hyperelastic composite material. Therefore, the application of data-driven computational mechanics approach in multiscale analysis can be applied to various materials and structures, opening up new possibilities for multiscale analysis research and applications.

A Study on the Dépaysement of the Animation (애니메이션에 있어서 데페이즈망에 관한 연구)

Exploring an Integrated Garden City Theory Based on East Asian Garden Culture - Centering on Community and Integration - (동아시아 정원문화에 기반한 통합적 정원도시론의 모색 - 공동체성과 통합성을 중심으로 -)

  • Ahn, Myung-June
    • Journal of the Korean Institute of Traditional Landscape Architecture
    • /
    • v.41 no.3
    • /
    • pp.13-26
    • /
    • 2023
  • Landscapes and gardens have emerged as an important medium of practice in contemporary cities. Among them, this paper examines the city through the frame of gardens. This is because gardens are being reconceptualized as a medium of activity for urban residents and have become an important subject of action in urban regeneration and the creation of urban villages. From this perspective, this paper examines and proposes an "integrated garden city theory" as a landscape theory suitable for the contemporary era by focusing on the urban structure and the behavior of urban residents through the medium of gardens, as well as the process and results. This is both a process and a result of looking back at the evolution of landscape for over a century and rethinking the identity of landscape. We first examined garden city theory, noting that Ebenezer Howard and Frederick Law Olmsted's positions on the relationship between gardens and cities were not so different, and that "working and responsive landscapes" were fundamental to cities and the beginning of landscape theory. We also examine how their ideals have not been fully realized in cities over the past century, but the prototype of gardens based on traditional garden culture is now being formed in East Asian cities, and the evolution of landscape theory in response. The conclusion is that a new version of the garden concept should be reestablished as a living infrastructure in our cities, and a new garden city theory is needed to make it work. To this end, each chapter examines three arguments, as follows First, the values of gardens and East Asian garden cultures in contemporary cities are shaped by the themes of community and integrity. Second, Korean communality, represented by apartments, is expressed through gardening and requires the reconciliation of city and life and the role of landscape architecture as a specialized field to support it. Third, we examine and consider an integrated garden city theory as a theory of practice in which city-based, everyday life, and garden mediums, i.e., city, life, and garden, are organic, based on an oriental view of nature. As a result, it is confirmed that contemporary gardens and cities are looking for important elements and values that still need to be rediscovered in East Asian landscape and garden cultures. Although the proposal of an integrated garden city theory cannot guarantee the continuation of landscaping, it can be an opportunity for all fields related to cities, not just landscaping, to collaborate and consider garden cities. Through this, it is hoped that "the concept of garden and city suitable for metropolitan or dense cities, ways to spread and support garden culture based on community, evolution of landscape theory/design theory suitable for lifestyle and terrain conditions, search for sustainable/resilient garden city theory that can respond to climate change, and establishing a new role for landscape in the 21st century" will be seriously considered.

Using the Binomial Option Pricing Model for Strategic Sales of CER's to Improve the Economic Feasibility of CDM projects (이항옵션가격 모형을 활용한 CER 판매전략 구축과 이를 통한 CDM 사업 수익성 향상 방안에 관한 연구)

  • Koo, Bonsang;Park, Jong-Ho;Kim, Cheong-Woon
    • Korean Journal of Construction Engineering and Management
    • /
    • v.15 no.1
    • /
    • pp.111-121
    • /
    • 2014
  • The Clean Development Mechanism (CDM) allows New & Renewable Energy projects to make additional income by selling CER's, which represent the amount of Green House Gases(GHG) that is reduced in the project. However, forward contracts used to hedge fluctuating market prices does not allow projects to sell CER's at a premium. As an alternate approach to maximize CER revenue, CER's are modeled as a 'real option', in which CER's are sold only above the desired sales price. Using the Binomial Option Pricing model, the resultant lattices are used to determine whether to sell, defer or abandon the option at individual nodes. Overlaying Pascal's Triangle on the lattices also enabled the calculation of the annual probabilities for deferring CER sales without incurring downside losses. Application to an actual Landfill Gas project showed increased overall NPV, and that CER sales could be deferred at a maximum of 2 years. The proposed framework allows transparency in the analysis and provides valuable and strategical information when making investment decisions related to CER sales of CDM projects.

Evaluation of Soil Parameters Using Adaptive Management Technique (적응형 관리 기법을 이용한 지반 물성 값의 평가)

  • Koo, Bonwhee;Kim, Taesik
    • Journal of the Korean GEO-environmental Society
    • /
    • v.18 no.2
    • /
    • pp.47-51
    • /
    • 2017
  • In this study, the optimization algorithm by inverse analysis that is the core of the adaptive management technique was adopted to update the soil engineering properties based on the ground response during the construction. Adaptive management technique is the framework wherein construction and design procedures are adjusted based on observations and measurements made as construction proceeds. To evaluate the performance of the adaptive management technique, the numerical simulation for the triaxial tests and the synthetic deep excavation were conducted with the Hardening Soil model. To effectively conduct the analysis, the effective parameters among the parameters employed in the model were selected based on the composite scaled sensitivity analysis. The results from the undrained triaxial tests performed with soft Chicago clays were used for the parameter calibration. The simulation for the synthetic deep excavation were conducted assuming that the soil engineering parameters obtained from the triaxial simulation represent the actual field condition. These values were used as the reference values. The observation for the synthetic deep excavation simulations was the horizontal displacement of the support wall that has the highest composite scaled sensitivity among the other possible observations. It was found that the horizontal displacement of the support wall with the various initial soil properties were converged to the reference displacement by using the adaptive management technique.

A Static Analysis Technique for Android Apps Written with Xamarin (자마린으로 개발된 안드로이드 앱의 정적 분석 연구)

  • Lim, Kyeong-hwan;Kim, Gyu-sik;Shim, Jae-woo;Cho, Seong-je
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.3
    • /
    • pp.643-653
    • /
    • 2018
  • Xamarin is a representative cross-platform development framework that allows developers to write mobile apps in C# for multiple mobile platforms, such as Android, iOS, or Windows Phone. Using Xamarin, mobile app developers can reuse existing C# code and share significant code across multiple platforms, reducing development time and maintenance costs. Meanwhile, malware authors can also use Xamarin to spread malicious apps on more platforms, minimizing the time and cost of malicious app creation. In order to cope with this problem, it is necessary to analyze and detect malware written with Xamarin. However, little studies have been conducted on static analysis methods of the apps written in Xamarin. In this paper, we examine the structure of Android apps written with Xamarin and propose a static analysis technique for the apps. We also demonstrate how to statically reverse-engineer apps that have been transformed using code obfuscation. Because the Android apps written with Xamarin consists of Java bytecode, C# based DLL libraries, and C/C++ based native libraries, we have studied static reverse engineering techniques for these different types of code.

CC-GiST: A Generalized Framework for Efficiently Implementing Arbitrary Cache-Conscious Search Trees (CC-GiST: 임의의 캐시 인식 검색 트리를 효율적으로 구현하기 위한 일반화된 프레임워크)

  • Loh, Woong-Kee;Kim, Won-Sik;Han, Wook-Shin
    • The KIPS Transactions:PartD
    • /
    • v.14D no.1 s.111
    • /
    • pp.21-34
    • /
    • 2007
  • According to recent rapid price drop and capacity growth of main memory, the number of applications on main memory databases is dramatically increasing. Cache miss, which means a phenomenon that the data required by CPU is not resident in cache and is accessed from main memory, is one of the major causes of performance degradation of main memory databases. Several cache-conscious trees have been proposed for reducing cache miss and making the most use of cache in main memory databases. Since each cache-conscious tree has its own unique features, more than one cache-conscious tree can be used in a single application depending on the application's requirement. Moreover, if there is no existing cache-conscious tree that satisfies the application's requirement, we should implement a new cache-conscious tree only for the application's sake. In this paper, we propose the cache-conscious generalized search tree (CC-GiST). The CC-GiST is an extension of the disk-based generalized search tree (GiST) [HNP95] to be tache-conscious, and provides the entire common features and algorithms in the existing cache-conscious trees including pointer compression and key compression techniques. For implementing a cache-conscious tree based on the CC-GiST proposed in this paper, one should implement only a few functions specific to the cache-conscious tree. We show how to implement the most representative cache-conscious trees such as the CSB+-tree, the pkB-tree, and the CR-tree based on the CC-GiST. The CC-GiST eliminates the troublesomeness caused by managing mire than one cache-conscious tree in an application, and provides a framework for efficiently implementing arbitrary cache-conscious trees with new features.