• Title/Summary/Keyword: 스마트 클러스터

Search Result 63, Processing Time 0.037 seconds

Efficacy of Listeria Innocua Reduction on Enoki Mushrooms by Utilization of an Air Sterilization Device (공기 살균 장치 적용 팽이버섯 재배사의 Listeria Innocua 저감 효과)

  • Lee, Hyun-Dong;Yu, Byeong-Kee;Seo, Da-Som;Kim, Se-Ri;Lee, Chan-Jung;Kwak, Kang-Su
    • Journal of Mushroom
    • /
    • v.19 no.3
    • /
    • pp.210-215
    • /
    • 2021
  • For sterilization of microorganisms of the Listeria genus contaminating enoki mushroom, pilot mushroom grower equipped with air sterilization devices were developed. Sterilization experiments were performed using physical and chemical treatments. Internal temperature and humidity were controlled, maintaining 6.62℃±0.30 in the upper shelves, 6.46℃±0.24 in the middle shelves, and 6.48℃±0.25 in the lower shelves. Humidities were 79.97%±4.42, 79.43%±4.06, and 79.94±4.30%, respectively, with a temperature setting of 6.5℃, and a relative humidity of 75%. A suitable enoki mushroom cultivation stage for air sterilizer application was during the growth stage, with temperature in the 6.5~8.5℃ range, and humidity of 70~80%. At these same internal conditions, the ozone concentration in the mushroom cultivator was found to be 160 ppb during ion-cluster generator operation. After physical sterilization, the Listeria innocua survival rate was 0.1 to 0.9% using ion cluster sterilization, and 9.3 to 10.6% using UV air sterilization. The Listeria innocua survival rates on different materials were 9.3~10.6% on the metal specimen, and 9.9~16.2% on the plastic wrapper. The survival rate was particularly high on the rough side of the plastic wrapper. Ion cluster air sterilization is a labor-saving and effective method for suppressing the occurrence of Listeria bacteria on mushroom growers walls and shelves. For the plastic wrapper, chemical sterilization is more effective than physical sterilization.

Authentication Performance Optimization for Smart-phone based Multimodal Biometrics (스마트폰 환경의 인증 성능 최적화를 위한 다중 생체인식 융합 기법 연구)

  • Moon, Hyeon-Joon;Lee, Min-Hyung;Jeong, Kang-Hun
    • Journal of Digital Convergence
    • /
    • v.13 no.6
    • /
    • pp.151-156
    • /
    • 2015
  • In this paper, we have proposed personal multimodal biometric authentication system based on face detection, recognition and speaker verification for smart-phone environment. Proposed system detect the face with Modified Census Transform algorithm then find the eye position in the face by using gabor filter and k-means algorithm. Perform preprocessing on the detected face and eye position, then we recognize with Linear Discriminant Analysis algorithm. Afterward in speaker verification process, we extract the feature from the end point of the speech data and Mel Frequency Cepstral Coefficient. We verified the speaker through Dynamic Time Warping algorithm because the speech feature changes in real-time. The proposed multimodal biometric system is to fuse the face and speech feature (to optimize the internal operation by integer representation) for smart-phone based real-time face detection, recognition and speaker verification. As mentioned the multimodal biometric system could form the reliable system by estimating the reasonable performance.

A study on the practical use of smart meter end-user demand data (스마트미터 데이터 활용 방법에 대한 연구)

  • Park, Geunyeong;Jung, Donghwi;Jun, Sanghoon
    • Journal of Korea Water Resources Association
    • /
    • v.54 no.10
    • /
    • pp.759-768
    • /
    • 2021
  • This work introduces a new approach that classifies individual household water usage by examining the characteristics of smart meter end-user demand data. Here, one of the most well-known unsupervised machine learning, K-means algorithm, is applied to classify water consumptions by each household. The intensity and duration of end-user demands are used as main features to determine the households with similar water consumption pattern. The results showed that 21 households are classified into 13 clusters with each cluster having one, two, three, or five houses. The reasoning why multiple households are classified into the same cluster is described in this paper with respect to the collected data and end-user water consumption behavior.

Draft Design of AI Services through Concept Extension of Connected Data Architecture (Connected Data Architecture 개념의 확장을 통한 AI 서비스 초안 설계)

  • Cha, ByungRae;Park, Sun;Oh, Su-Yeol;Kim, JongWon
    • Smart Media Journal
    • /
    • v.7 no.4
    • /
    • pp.30-36
    • /
    • 2018
  • Single domain model like DataLake framework is in spotlight because it can improve data efficiency and process data smarter in big data environment, where large scaled business system generates huge amount of data. In particular, efficient operation of network, storage, and computing resources in logical single domain model is very important for physically partitioned multi-site data process. Based on the advantages of Data Lake framework, we define and extend the concept of Connected Data Architecture and functions of DataLake framework for integrating multiple sites in various domains and managing the lifecycle of data. Also, we propose the design of CDA-based AI service and utilization scenarios in various application domain.

A Structured Tag Clustering Method using Semantic Similarities for Photo Categorization (사진 콘텐츠의 분류를 위한 의미적 유사도 기반 구조적 태그 클러스터링 기법)

  • Won, Ji-Hyeon;Park, Hee-Min;Lee, Jong-Woo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06c
    • /
    • pp.427-429
    • /
    • 2012
  • 개인이 사용할 수 있는 스마트 기기가 다양해지면서 여러 기기로 생산된 사진 콘텐츠가 어떤 기준이나 규칙 없이 분산되어 있어 콘텐츠를 관리하고 원하는 콘텐츠를 검색하는 것이 어려워졌다. 따라서 본 논문에서는 개인 사진 콘텐츠를 효과적으로 분류하기 위하여 의미적 유사도를 기반으로 한 태그 클러스터링 기법을 제안한다. 태그들 사이의 유사도를 계산하여 서로 관련이 있다고 판단되는 태그들을 클러스터링 하는데, 태그가 같은 클러스터에 포함되어 있으면 그 태그를 가진 사진들도 유사성을 가진다고 볼 수 있으므로 개인 사진들을 의미에 따라 분류하는데 이용할 수 있다.

Analysis on Security Vulnerabilities of a Password-based User Authentication Scheme for Hierarchical Wireless Sensor Networks (계층적 무선 센서 네트워크를 위한 패스워드 기반 사용자 인증 스킴의 보안 취약점 분석)

  • Joo, Young-Do
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.63-70
    • /
    • 2015
  • The numerous improved schemes of user authentication based on password have been proposed in order to prevent the data access from the unauthorized person. The importance of user authentication has been remarkably growing in the expanding application areas of wireless sensor networks. Recently, emerging wireless sensor networks possesses a hierarchy among the nodes which are divided into cluster heads and sensor nodes. Such hierarchical wireless sensor networks have more operational advantages by reducing the energy consumption and traffic load. In 2012, Das et al. proposed a user authentication scheme to be applicable for the hierarchical wireless sensor networks. Das et al. claimed that their scheme is effectively secure against the various security flaws. In this paper, author will prove that Das et al.'s scheme is still vulnerable to man-in-the-middle attack, password guessing/change attack and does not support mutual authentication between the user and the cluster heads.

Hierarchical Clustering-Based Cloaking Algorithm for Location-Based Services (위치 기반 서비스를 위한 계층 클러스터 기반 Cloaking 알고리즘)

  • Lee, Jae-Heung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.8
    • /
    • pp.1155-1160
    • /
    • 2013
  • The rapid growth of smart phones has made location-based services (LBSs) widely available. However, the use of LBS can raise privacy issues, as LBS can allow adversaries to violate the location privacy of users. There has been a considerable amount of research on preserving user location privacy. Most of these studies try to preserve location privacy by achieving what is known as location K-anonymity. In this paper, we propose a hierarchical clustering-based spatial cloaking algorithm for LBSs. The proposed algorithm constructs a tree using a modified version of agglomerative hierarchical clustering. The experimental results show, in terms of the ASR size, that the proposed algorithm is better than Hilbert Cloak and comparable to RC-AR (R-tree Cloak implementation of Reciprocal with an Asymmetric R-tree split). In terms of the ASR generation time, the proposed algorithm is much better in its performance than RC-AR and similar in performance to Hilbert Cloak.

Improved face detection method at a distance with skin-color and variable edge-mask filtering (피부색과 가변 경계마스크 필터를 이용한 원거리 얼굴 검출 개선 방법)

  • Lee, Dong-Su;Yeom, Seok-Won;Kim, Shin-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.2A
    • /
    • pp.105-112
    • /
    • 2012
  • Face detection at a distance faces is very challenging since images are often degraded by blurring and noise as well as low resolution. This paper proposes an improved face detection method with AdaBoost filtering and sequential testing stages with color and shape information. The conventional AdaBoost filter detects face regions but often generates false alarms. The face detection method is improved by adopting sequential testing stages in order to remove false alarms. The testing stages comprise skin-color test and variable edge-mask filtering. The skin-color filtering is composed of two steps, which involve rectangular window regions and individual pixels to generate binary face clusters. The size of the variable edge-mask is determined by the ellipse which is estimated from the face cluster. The validation of the horizontal and vertical ratio of the mask is also investigated. In the experiments, the efficacy of the proposed algorithm is proved by images captured by a CCTV and a smart-phone

Resource Clustering Simulator for Desktop Virtualization Based on Intra Cloud (인트라 클라우드 기반 데스크탑 가상화를 위한 리소스 클러스터링 시뮬레이터)

  • Kim, Hyun-Woo
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.8 no.1
    • /
    • pp.45-50
    • /
    • 2019
  • With the gradual advancement of IT, passive work processes are automated and the overall quality of life has greatly improved. This is made possible by the formation of an organic topology between a wide variety of real-life smart devices. To serve these diverse smart devices, businesses or users are using the cloud. The services in the cloud are divided into Infrastructure as a Service (IaaS), Platform as a Service (PaaS) and Software as a Service (SaaS). SaaS runs on PaaS, and PaaS runs on IaaS. Since IaaS is the basis of all services, an algorithm is required to operate virtualization resources efficiently. Among them, desktop resource virtualization is used for resource high availability of unused state time of existing desktop PC. Clustering of hierarchical structures is important for high availability of these resources. In addition, it is very important to select a suitable algorithm because many clustering algorithms are mainly used depending on the distribution ratio and environment of the desktop PC. If various attempts are made to find an algorithm suitable for desktop resource virtualization in an operating environment, a great deal of power, time, and manpower will be incurred. Therefore, this paper proposes a resource clustering simulator for cluster selection of desktop virtualization. This provides a clustering simulation to properly select clustering algorithms and apply elements in different environments of desktop PCs.

Load Balancing for Distributed Processing of Real-time Spatial Big Data Stream (실시간 공간 빅데이터 스트림 분산 처리를 위한 부하 균형화 방법)

  • Yoon, Susik;Lee, Jae-Gil
    • Journal of KIISE
    • /
    • v.44 no.11
    • /
    • pp.1209-1218
    • /
    • 2017
  • A variety of sensors is widely used these days, and it has become much easier to acquire spatial big data streams from various sources. Since spatial data streams have inherently skewed and dynamically changing distributions, the system must effectively distribute the load among workers. Previous studies to solve this load imbalance problem are not directly applicable to processing spatial data. In this research, we propose Adaptive Spatial Key Grouping (ASKG). The main idea of ASKG is, by utilizing the previous distribution of the data streams, to adaptively suggest a new grouping scheme that evenly distributes the future load among workers. We evaluate the validity of the proposed algorithm in various environments, by conducting an experiment with real datasets while varying the number of workers, input rate, and processing overhead. Compared to two other alternative algorithms, ASKG improves the system performance in terms of load imbalance, throughput, and latency.