• Horticultural Science & Technology
• /
• v.33 no.5
• /
• pp.647-657
• /
• 2015

To investigate a method for calculation of the heating load for environmental designs of horticultural facilities, measurements of total heating load, infiltration rate, and floor heat flux in a large-scale plastic greenhouse were analyzed comparatively with the calculation results. Effects of ground heat exchange and infiltration loss on the greenhouse heating load were examined. The ranges of the indoor and outdoor temperatures were $13.3{\pm}1.2^{\circ}C$ and $-9.4{\sim}+7.2^{\circ}C$ respectively during the experimental period. It was confirmed that the outdoor temperatures were valid in the range of the design temperatures for the greenhouse heating design in Korea. Average infiltration rate of the experimental greenhouse measured by a gas tracer method was $0.245h^{-1}$. Applying a constant ventilation heat transfer coefficient to the covering area of the greenhouse was found to have a methodological problem in the case of various sizes of greenhouses. Thus, it was considered that the method of using the volume and the infiltration rate of greenhouses was reasonable for the infiltration loss. Floor heat flux measured in the center of the greenhouse tended to increase toward negative slightly according to the differences between indoor and outdoor temperature. By contrast, floor heat flux measured at the side of the greenhouse tended to increase greatly into plus according to the temperature differences. Based on the measured results, a new calculation method for ground heat exchange was developed by adopting the concept of heat loss through the perimeter of greenhouses. The developed method coincided closely with the experimental result. Average transmission heat loss was shown to be directly proportional to the differences between indoor and outdoor temperature, but the average overall heat transfer coefficient tended to decrease. Thus, in calculating the transmission heat loss, the overall heat transfer coefficient must be selected based on design conditions. The overall heat transfer coefficient of the experimental greenhouse averaged $2.73W{\cdot}m^{-2}{\cdot}C^{-1}$, which represents a 60% heat savings rate compared with plastic greenhouses with a single covering. The total heating load included, transmission heat loss of 84.7~95.4%, infiltration loss of 4.4~9.5%, and ground heat exchange of -0.2~+6.3%. The transmission heat loss accounted for larger proportions in groups with low differences between indoor and outdoor temperature, whereas infiltration heat loss played the larger role in groups with high temperature differences. Ground heat exchange could either heighten or lessen the heating load, depending on the difference between indoor and outdoor temperature. Therefore, the selection of a reference temperature difference is important. Since infiltration loss takes on greater importance than ground heat exchange, measures for lessening the infiltration loss are required to conserve energy.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.277-284
• /
• 2007

The routing algorithm many used in the wireless sensor network features the clustering method to reduce the amount of data transmission from the energy efficiency perspective. However, the clustering method results in high energy consumption at the cluster head node. Dynamic clustering is a method used to resolve such a problem by distributing energy consumption through the re-selection of the cluster head node. Still, dynamic clustering modifies the cluster structure every time the cluster head node is re-selected, which causes energy consumption. In other words, the dynamic clustering approaches examined in previous studies involve the repetitive processes of cluster head node selection. This consumes a high amount of energy during the set-up process of cluster generation. In order to resolve the energy consumption problem associated with the repetitive set-up, this paper proposes the Round-Robin Cluster Header (RRCH) method that fixes the cluster and selects the head node in a round-robin method The RRCH approach is an energy-efficient method that realizes consistent and balanced energy consumption in each node of a generated cluster to prevent repetitious set-up processes as in the LEACH method. The propriety of the proposed method is substantiated with a simulation experiment.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.2
• /
• pp.388-395
• /
• 2020

This study was conducted from March 15 to March 19, 2019. The purpose of this study was to examine the recognition of uniforms and their images for the selection and development of uniforms and the pursuit of images for dental hygienists and students in some regions. Study methods included frequency analysis, factor analysis, reliability analysis, ANOVA, chi-squared test, and regression analysis. The collected data was analyzed using the IBM SPSS Statistics 21.0 program. This study found that students majoring in dental hygiene thought that uniforms influenced their image and that they influenced the image of the hospital. In addition, students who experienced clinical practice preferred the pants type to the uniform type and the color to achromatic color. In addition, these students preferred scrubs and the use of Crocs for shoes. The results of this study showed that dental hygiene students considered image transmission through uniforms as important. However, it appears that they prefer practical uniforms and shoes over uniforms that convey external images. This is a part that makes us aware of the need for changes in training clothes and training. In conclusion, it is necessary to develop a practical uniform while expressing the image of the institution, which will be reflected in future dental uniform selection.

• Journal of Broadcast Engineering
• /
• v.14 no.3
• /
• pp.322-331
• /
• 2009

This paper proposes an efficient data representation of stereo images using edge-based mesh optimization. Mash-based two dimensional warping for stereo images mainly depends on the performance of a node selection and a disparity estimation of selected nodes. Therefore, the proposed method first of all constructs the feature map which consists of both strong edges and boundary lines of objects for node selection and then generates a grid-based mesh structure using initial nodes. The displacement of each nodal position is iteratively estimated by minimizing the predicted errors between target image and predicted image after two dimensional warping for local area. Generally, iterative two dimensional warping for optimized nodal position required a high time complexity. To overcome this problem, we assume that input stereo images are only horizontal disparity and that optimal nodal position is located on the edge include object boundary lines. Therefore, proposed iterative warping method performs searching process to find optimal nodal position only on edge lines along the horizontal lines. In the experiments, we compare our proposed method with the other mesh-based methods with respect to the quality by using Peak Signal to Noise Ratio (PSNR) according to the number of nodes. Furthermore, computational complexity for an optimal mesh generation is also estimated. Therefore, we have the results that our proposed method provides an efficient stereo image representation not only fast optimal mesh generation but also decreasing of quality deterioration in spite of a small number of nodes through our experiments.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.571-582
• /
• 2007

Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.

• Journal of Digital Convergence
• /
• v.14 no.5
• /
• pp.273-281
• /
• 2016

The issue about the safety management of gas related work has been studied toward a direction to utilize IoT system recently. For this purpose, the matters of user's demand has been deduced through the literature survey, field survey, and professional consultation, by studying the characteristics of worker, work, and work site. In summary, these are the demands for mobile App, 1)a clear arrangement of contents, 2)a design with high readability, 3)a design with low death, 4) securing of user's accessibility, 5)an effective information transmission plan in the work section where it is impossible to operate the mobile device, 6)an activation of alarm function at the section of high working error, 7)a fast two-way transmission and receipt of safety inspection matter needed at work, 8)a selection of images and contents that can guide the situation to the worker in case of accident, 9)an alarm function for the degree of danger in an area of worker's location. Based on these, a basic design of safety application for gas related work has been proposed, that can secure the user accessibility.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.1
• /
• pp.8-15
• /
• 2018

New methodology for probabilistic reliability based grid expansion planning of HVDC in power system including Wind Turbine Generators(WTG) is developed in this paper. This problem is focused on scenario based optimal selection technique to decide best connection bus of new transmission lines of HVDC in view point of adequacy reliability in power system including WTG. This requires two kinds of modeling and simulation for reliability evaluation. One is how is reliability evaluation model and simulation of WTG. Another is to develop a failure model of HVDC. First, reliability evaluation of power system including WTG needs multi-state simulation methodology because of intermittent characteristics of wind speed and nonlinear generation curve of WTG. Reliability methodology of power system including WTG has already been developed with considering multi-state simulation over the years in the world. The multi-state model already developed by authors is used for WTG reliability simulation in this study. Second, the power system including HVDC includes AC/DC converter and DC/AC inverter substation. The substation is composed of a lot of thyristor devices, in which devices have possibility of failure occurrence in potential. Failure model of AC/DC converter and DC/AC inverter substation in order to simulate HVDC reliability is newly proposed in this paper. Furthermore, this problem should be formulated in hierarchical level II(HLII) reliability evaluation because of best bus choice problem for connecting new HVDC and transmission lines consideration. HLII reliability simulation technique is not simple but difficult and complex. CmRel program, which is adequacy reliability evaluation program developed by authors, is extended and developed for this study. Using proposed method, new HVDC connected bus point is able to be decided at best reliability level successfully. Methodology proposed in this paper is applied to small sized model power system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.9-21
• /
• 2004

In this paper, we proposed the image hiding method which decreases calculation amount by encrypt partial data using discrete wavelet transform and linear scale quantization which were adopted as the main technique for frequency transform in JPEG2000 standard. Also we used the chaotic system which has smaller calculation amount than other encryption algorithms and then dramatically decreased calculation amount. This method operates encryption process between quantization and entropy coding for preserving compression ratio of images and uses the subband selection method and the random changing method using the chaotic system. For ciphering the quantization index we use a novel image encryption algerian of cyclically shifted in the right or left direction and encrypts two quantization assignment method (Top-down/Reflection code), made change of data less. Also, suggested encryption method to JPEG2000 progressive transmission. The experiments have been performed with the proposed methods implemented in software for about 500 images. consequently, we are sure that the proposed are efficient image encryption methods to acquire the high encryption effect with small amount of encryption. It has been shown that there exits a relation of trade-off between the execution time and the effect of the encryption. It means that the proposed methods can be selectively used according to the application areas. Also, because the proposed methods are performed in the application layer, they are expected to be a good solution for the end-to-end security problem, which is appearing as one of the important problems in the networks with both wired and wireless sections.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.4
• /
• pp.53-64
• /
• 2009

Inter-vehicular communication that propagates information without infrastructures has drawn a lot of interest. However, it is difficult to apply conventional ad-hoc routing protocols directly in inter-vehicular communication due to frequent changes in the network topology caused by high mobility of the vehicles. MMFP(Multi-hop MAC Forwarding) is a unicast forwarding protocol that transport packets based on the reachability information instead of path selection or position information. However, delivering public safety messages informing road conditions such as collision, obstacles and fog through inter-vehicular communication requires broadcast rather than unicast since these messages contain information valuable to most drivers within a close proximity. Flooding is one of the simplest methods for multi-hop broadcast, but it suffers from reduced packet delivery-ratio and high transmission delay due to an excessive number of duplicated packets. This paper presents two multi-hop broadcast protocols for inter-vehicular communication that extend the MMFP. UMHB(Unreliable Multi-Hop Broadcast) mitigates the duplicated packets of MMFP by limiting the number of nodes to rebroadcast packets. UMHB, however, still suffers from low delivery ratio. RMHB(Reliable Multi-Hop Broadcast) uses acknowledgement and retransmission in order to improve the reliability of UMHB at the cost of increase in transmission delay, which we show through simulation is within an acceptable range for collision avoidance application.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.15-30
• /
• 2000

The important considerations in the design of fiber-optic networks are reliability and survivability preparing against a failure. The SDH(Synchronous Digital Hierarchy), the international standard of optical transmission, offers several network reconfiguration methods that enable network to be automatically restored from failure. One of the methods is the SHR(Self Healing Ring), which is a ring topology system. Most network providers have constructed their backbone networks with SHR architecture since it can provide survivability economically. The network architecture has eventually evolved into a multi-ring network comprised of interconnected rings. This paper addresses multi-ring network design problems is to minimize ring-construction cost. This problem can be formulated with MIP(mixed integer programming) model. However, it is difficult to solve the model within reasonable computing time on a large scale network because the model is NP-complete. Furthermore, in practice we should consider the problem of routing demands on rings to minimize total cost. This routing problem involves multiplex bundling at the intermediate nodes. A family of heuristic algorithms is presented for this problem. These algorithms include gateway selection and routing of inter-ring demands as well as load balancing on single rings. The developed heuristic algorithms are applied to some network provider's regional and long-distance transmission networks. We show an example of ring design and compare it with another ring topology design. Finally, we analysis the effect bundling.