• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.101-104
• /
• 2007

Efficient Query processing and optimization are critical for reducing network traffic and decreasing latency of query when accessing and manipulating sensor data of large-scale sensor networks. Currently it has been studied in sensor database projects. These works have mainly focused on in-network query processing for sensor networks and assumes homogeneous sensor networks, where each sensor network has same hardware and software configuration. In this paper, we present a framework for efficient query processing over heterogeneous sensor networks. Our proposed framework introduces query processing paradigm considering two heterogeneous characteristics of sensor networks: (1) data dissemination approach such as push, pull, and hybrid; (2) query processing capability of sensor networks if they may support in-network aggregation, spatial, periodic and conditional operators. Additionally, we propose multi-query optimization strategies supporting cross-translation between data acquisition query and data stream query to minimize total cost of multiple queries. It has been implemented in WSN middleware, COSMOS, developed by ETRI.

• Communications for Statistical Applications and Methods
• /
• v.10 no.1
• /
• pp.153-166
• /
• 2003

This study presents the time-divided forecasting model to integrate evolutionary optimization algorithm and change point detection based on artificial neural networks (ANN) for the prediction of (Korea) stock price index. The genetic algorithm(GA) is introduced as an evolutionary optimization method in this study. The basic concept of the proposed model is to obtain intervals divided by change points, to identify them as optimal or near-optimal change point groups, and to use them in the forecasting of the stock price index. The proposed model consists of three phases. The first phase detects successive change points. The second phase detects the change-point groups with the GA. Finally, the third phase forecasts the output with ANN using the GA. This study examines the predictability of the proposed model for the prediction of stock price index.

• Smart Structures and Systems
• /
• v.6 no.7
• /
• pp.867-887
• /
• 2010

An energy-based variational approach is used for structural dynamic modeling of the IPMC (Ionic Polymer Metal Composites) flapping wing. Dynamic characteristics of the wing are analyzed using numerical simulations. Starting with the initial design, critical parameters which have influence on the performance of the wing are identified through parametric studies. An optimization study is performed to obtain improved flapping actuation of the IPMC wing. It is shown that the optimization algorithm leads to a flapping wing with dimensions similar to the dragonfly Aeshna Multicolor wing. An unsteady aerodynamic model based on modified strip theory is used to obtain the aerodynamic forces. It is found that the IPMC wing generates sufficient lift to support its own weight and carry a small payload. It is therefore a potential candidate for flapping wing of micro air vehicles.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.5
• /
• pp.476-480
• /
• 2010

This study deals with stockout costs in the supply chain optimization model under the framework of batch-storage network. Stockout is very popular in chemical industries. Estimating stockout cost involves an understanding of customer reactions to a seller being out of stock at the time the customer wants to buy an item. This involves massively non-trivial work such as direct customer interviews and extensive mail survey. In this study, we will introduce a new interpretation of stockout costs combined with batchstorage network optimization model and thus suggest an easy way of estimating stockout costs. Optimization model suggest that optimal process and storage sizes considering stockout cost are smaller than those that do not consider stockout cost. An illustrative example support the analytical results.

• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.1
• /
• pp.89-100
• /
• 2016

Given the unpredictability of the space environment, satellite communications are manually performed by exchanging telecommands and telemetry. Ground support for orbiting satellites is given only during limited periods of ground antenna visibility, which can result in conflicts when multiple satellites are present. This problem can be regarded as a scheduling problem of allocating antenna support (task) to limited visibility (resource). To mitigate unforeseen errors and costs associated with manual scheduling and mission planning, we propose a novel method based on a genetic algorithm to solve the ground support problem of multiple satellites and antennae with visibility conflicts. Numerous scheduling parameters, including user priority, emergency, profit, contact interval, support time, remaining resource, are considered to provide maximum benefit to users and real applications. The modeling and formulae are developed in accordance with the characteristics of satellite communication. To validate the proposed algorithm, 20 satellites and 3 ground antennae in the Korean peninsula are assumed and modeled using the satellite tool kit (STK). The proposed algorithm is applied to two operation modes: (i) telemetry, tracking, and command and (ii) payload. The results of the present study show near-optimal scheduling in both operation modes and demonstrate the applicability of the proposed algorithm to actual mission control systems.

• Asia pacific journal of information systems
• /
• v.15 no.2
• /
• pp.195-218
• /
• 2005

The emergence of ubiquitous computing environment will change the service architecture of business information systems such as Decision Support System(DSS), which will be a new application. Recent mobile DSSs allow the decision makers to be benefited from web and mobile technology. However, they seldom refer to context data, which are useful for proactive decision support. Meanwhile, ubiquitous applications so far provide restricted personalization service using context and preference of the user, that is, they do not fully make use of decision making capabilities. Hence, this paper aims to describe how the decision making capability and context-aware computing are jointly used to establish ubiquitous applications. To do so, an amended DSS paradigm: CKDDM(Context-Knowledge-Dialogue-Data-Model) is proposed in this paper. What will be considered for the future decision support systems when we regard ubiquitous computing technology as an inevitable impact that enforces the change of the way of making decisions are described. Under the CKDDM paradigm, a framework of ubiquitous decision support systems(ubiDSS) is addressed with the description of the subsystems within. To show the feasibility of ubiDSS, a prototype system, CAMA-myOpt(Context-Aware Multi Agent System-My Optimization) has been implemented as an illustrative example system.

• Journal of the Korean Society of Industry Convergence
• /
• v.23 no.4_2
• /
• pp.627-635
• /
• 2020

In this study, the optimal support span determination of pipeline system was carried out in consideration of the effects of seismic loads. The theoretical support and structural analysis were used to determine the optimal support span of piping system according to pipe diameter using theoretical and structural deflection criteria. The reliability of the analysis results was secured by comparing the structural and theoretical results. In particular, the optimum support span of piping system was obtained by considering the effects of seismic load, and the optimal support span of pipe diameter and piping system tended to be proportional to each other. When considering the effects of earthquakes on different pipe diameters(300~2,500mm), the span length is reduced by up to 48% at the allowable stress criterion, and the pipe span length is reduced by up to 5.9% at the deflection criterion. It can be seen that the effect of the seismic load on the determination of the piping span length has a greater effect on the stress than the displacement.

• Journal of the Chungcheong Mathematical Society
• /
• v.18 no.1
• /
• pp.101-116
• /
• 2005

Using the iterative method, we derive an controller realization of the bilinear system, which is resulted from the system reformulation. We utilize Banach Fixed Point Theorem to support proposed controller, and the simulation results are also illustrated to verify usefulness of this technique.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1999.10a
• /
• pp.349.2-349
• /
• 1999

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.119-131
• /
• 2009

Existing proposals on route optimization for nested Network Mobility(NEMO) have a problem that it is difficult to optimize a route promptly in an environment where a MR moves frequently. Also, they have L3 handoff latency as well as route optimization latency until an optimized route is formed. In this paper, we propose a L3 handoff scheme that supports fast route optimization for nested NEMO without any additional optimization procedure. To achieve this, our proposed scheme is designed to include a procedure that an AR acquires address informations of a MR. After receiving binding update message from the MR, the AR performs the binding update procedure with the MR's HA on behalf of the MR. Packets are delivered to the AR only passing by the MR's HA after a bi-directional tunnel is formed between the AR and the HA. The result of our performance evaluation has shown that the proposed scheme could provide excellent performance compared with the RRH and the ONEMO.