• Spatial Information Research
• /
• v.21 no.2
• /
• pp.23-33
• /
• 2013

W ith the recent advancement of IoT (Internet of Things) technology, there has been much interest in the spatial query processing which energy-efficiently acquires sensor readings from sensor nodes inside specified geographical area of interests. Therefore, various kinds of spatial query processing algorithms and distributed spatial indexing methods have been proposed. They can minimize energy consumption of sensor nodes by reducing wireless communication among them using in-network spatial filtering technology. However, they cannot optimize multiple spatial queries which w ill be w idely used in IoT, because most of them have focused on a single spatial query optimization. Therefore, we propose a new multiple spatial query optimization algorithm which can energy-efficiently process multiple spatial queries in a sensor network. The algorithm uses a concept of 'query merging' that performs the merged set after merging multiple spatial queries located at adjacent area. Here, our algorithm makes a decision on which is better between the merged and the separate execution of queries. For such the decision making, we additionally propose the cost estimation method on the spatial query execution. Finally, we analyze and clarify our algorithm's distinguished features using the spatial indexing methods of GR-tree, SPIX, CPS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1094-1103
• /
• 2012

Recently, software industry regarding national defense increases system development of distributed simulation system of M&S based to overcome limit of resource and expense. It is one of key technologies for offering of mutual validation among objects and reuse of objects which are discussed for developing these systems. RTI, implementation of HLA interface specification as software providing these technologies uses Federation Object Model for exchanging information with joined federates in the federation and each federate has a characteristic that is supposed to have identical FOM in the federation. This technology is a software which is to provide the core technology which was suggested by the United state's military M&S standard framework. Simulator, virtual simulation, and inter-connection between military weapons system S/W which executes on network which is M&S's core base technology, and it is a technology which also can be used for various inter-connection between S/W such as game and on-line phone. These days although RTI is used in military war game or tactical training unit field, there is none in Korea. Also, it is used in mobile-game, distribution game, net management, robot field, and other civilian field, but the number of examples are so small and informalized. Through this developing project, we developed the core technique and RTI software and provided performance of COTS level to improve communication algorithms.

• KIEE International Transaction on Systems and Control
• /
• v.2D no.2
• /
• pp.78-91
• /
• 2002

In the thermal power plant, there are six manipulated variables: main steam flow, feedwater flow, fuel flow, air flow, spray flow, and gas recirculation flow. There are five controlled variables: generator output, main steam pressure, main steam temperature, exhaust gas density, and reheater steam temperature. Therefore, the thermal power plant control system is a multinput and output system. In the control system, the main steam temperature is typically regulated by the fuel flow rate and the spray flow rate, and the reheater steam temperature is regulated by the gas recirculation flow rate. However, strict control of the steam temperature must be maintained to avoid thermal stress. Maintaining the steam temperature can be difficult due to heating value variation to the fuel source, time delay changes in the main steam temperature versus changes in fuel flow rate, difficulty of control of the main steam temperature control and the reheater steam temperature control system owing to the dynamic response characteristics of changes in steam temperature and the reheater steam temperature, and the fluctuation of inner fluid water and steam flow rates during the load-following operation. Up to the present time, the Proportional-Integral-Derivative Controller has been used to operate this system. However, it is very difficult to achieve an optimal PID gain with no experience, since the gain of the PID controller has to be manually tuned by trial and error. This paper focuses on the characteristic comparison of the PID controller and the modified 2-DOF PID Controller (Two-Degrees-Freedom Proportional-Integral-Derivative) on the DCS (Distributed Control System). The method is to design an optimal controller that can be operated on the thermal generating plant in Seoul, Korea. The modified 2-DOF PID controller is designed to enable parameters to fit into the thermal plant during disturbances. To attain an optimal control method, transfer function and operating data from start-up, running, and stop procedures of the thermal plant have been acquired. Through this research, the stable range of a 2-DOF parameter for only this system could be found for the start-up procedure and this parameter could be used for the tuning problem. Also, this paper addressed whether an intelligent tuning method based on immune network algorithms can be used effectively in tuning these controllers.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.10
• /
• pp.300-309
• /
• 2016

Curved beams are increasingly used in buildings, vehicles, ships, and aircraft, which has resulted in considerable effort towards developing an accurate method for analyzing the dynamic behavior of such structures. The stability behavior of elastic curved beams has been the subject of many investigations. Solutions to the relevant differential equations have traditionally been obtained by the standard finite difference or finite element methods. However, these techniques require a great deal of computer time for a large number of discrete nodes with conditions of complex geometry and loading. One efficient procedure for the solution of partial differential equations is the differential quadrature method (DQM). This method has been applied to many cases to overcome the difficulties of complex algorithms and high storage requirements for complex geometry and loading conditions. Out-of-plane buckling of curved beams with rotatory inertia were analyzed using DQM under uniformly distributed radial loads. Critical loads were calculated for the member with various parameter ratios, boundary conditions, and opening angles. The results were compared with exact results from other methods for available cases. The DQM used only a limited number of grid points and shows very good agreement with the exact results (less than 0.3% error). New results according to diverse variation are also suggested, which show important roles in the buckling behavior of curved beams and can be used for comparisons with other numerical solutions or experimental test data.

• The Journal of Bigdata
• /
• v.9 no.1
• /
• pp.101-113
• /
• 2024

Federated learning has garnered attention as an efficient method for training machine learning models in a distributed environment while maintaining data privacy and security. This study proposes a novel FedRFBagging algorithm to optimize the performance of random forest models in such federated learning environments. By dynamically adjusting the trees of local random forest models based on client-specific data characteristics, the proposed approach reduces communication costs and achieves high prediction accuracy even in environments with numerous clients. This method adapts to various data conditions, significantly enhancing model stability and training speed. While random forest models consist of multiple decision trees, transmitting all trees to the server in a federated learning environment results in exponentially increasing communication overhead, making their use impractical. Additionally, differences in data distribution among clients can lead to quality imbalances in the trees. To address this, the FedRFBagging algorithm selects only the highest-performing trees from each client for transmission to the server, which then reselects trees based on impurity values to construct the optimal global model. This reduces communication overhead and maintains high prediction performance across diverse data distributions. Although the global model reflects data from various clients, the data characteristics of each client may differ. To compensate for this, clients further train additional trees on the global model to perform local optimizations tailored to their data. This improves the overall model's prediction accuracy and adapts to changing data distributions. Our study demonstrates that the FedRFBagging algorithm effectively addresses the communication cost and performance issues associated with random forest models in federated learning environments, suggesting its applicability in such settings.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.12
• /
• pp.849-854
• /
• 2013

In this paper, a system technology-based algorithms and visualization is proposed to show a space data. Also the proposed system provides analysis function with combination of usual map and automatic document generation function to give a useful information for making an important decision based on spatial distributed data. In the proposed method, we employ the heat map analysis to present a suitable color distribution for 2 dimensional map data. The buffering analysis method is also used to define the spatial data access. By using the proposed system, spatial information in a variety of distribution will be easy to identify. Also, if we make a use of automatic document generation function in the proposed algorithm, a lot of time and cost savings are expected to make electronic document which representation of spatial information is required.

• Journal of Digital Contents Society
• /
• v.19 no.4
• /
• pp.837-844
• /
• 2018

Recently, the cloud technology has made dynamical network changes by enabling the construction of a logical network without building a physical network. Despite recent research on the cloud, it is necessary to study security functions for the identification of fake virtual network functions and the encryption of communication between entities. Because the VNFs are open to subscribers and able to implement service directly, which can make them an attack target. In this paper, we propose a virtual public key infrastructure mechanism that detects a fake VNFs and guarantees data security through mutual authentication between VNFs. To evaluate the virtual PKI, we built a management and orchestration environment to test the performance of authentication and key generation for data security. And we test the detection of a distributed denial of service by using several AI algorithms to enhance the security in NFV.

• Journal of Digital Convergence
• /
• v.10 no.8
• /
• pp.287-297
• /
• 2012

In order to prepare for the introduction of the E-Discovery system from the United States and to cope with some causable changes of legal systems, we propose a general E-Discovery process and essential tasks of the each phase. The proposed process model is designed by the analysis of well-known projects such as EDRM, The Sedona Conference, which are advanced research for the standardization of E-Discovery task procedures and for the supply of guidelines to hands-on workers. In addition, Machine Learning Algorithms, Open-source libraries for the Information Retrieval and Distributed Processing technologies based on the Hadoop for big data are introduced and its application methods on the E-Discovery work scenario are proposed. All this information will be useful to vendors or people willing to develop the E-Discovery service solution. Also, it is very helpful to company owners willing to rebuild their business process and it enables people who are about to face a major lawsuit to handle a situation effectively.

• Journal of Internet Computing and Services
• /
• v.11 no.3
• /
• pp.131-137
• /
• 2010

Today, many museums are changing their forms with ubiquitous environment. Unlike traditional museums providing only static text-based information attached to its corresponding artifacts to visitors, those ubiquitous museums provide not only artifacts' text information, but also many different forms of information such as sound or media through personal digital assistance or cell phones. However, these existing ubiquitous museums still provide each visitor only with artifact-centric information in very simple ways. Also this disadvantageous feature causes high gallery congestion problem resulting from providing a uniform path for every visitor. These limitations may be the biggest barrier to providing more various and useful information about artifacts to visitors through considering each visitor's preference. This paper propose a new optimal viewing path search algorithm to provide comfortable museum viewing for each visitor according to its preference. Also, a new congestion control method is developed to protect visitors from being put in some hot spots on their museum viewing, improving its comfort to a maximum.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.575-581
• /
• 2010

With widespread use of the Internet and improvements in streaming media and compression technology, digital music, video, and image can be distributed instantaneously across the Internet to end-users. However, most conventional Digital Right Management are often not secure and not fast enough to process the vast amount of data generated by the multimedia applications to meet the real-time constraints. The SVC offers temporal, spatial, and SNR scalability to varying network bandwidth and different application needs. Meanwhile, for many multimedia services, security is an important component to restrict unauthorized content access and distribution. This suggests the need for new cryptography system implementations that can operate at SVC. In this paper, we propose a new scrambling encryption for reserving the characteristic of scalability in MPEG4-SVC. In the base layer, the proposed algorithm is applied and performed the selective scambling. And it encrypts various MVS and intra-mode scrambling in the enhancement layer. In the decryption, it decrypts each encrypted layers by using another encrypted keys. Throughout the experimental results, the proposed algorithms have low complexity in encryption and the robustness of communication errors.