• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.187-197
• /
• 2005

In this paper, we propose a method to estimate camera motion parameter based on invariant point features, Typically, feature information of image has drawbacks, it is variable to camera viewpoint, and therefore information quantity increases after time, The LM(Levenberg-Marquardt) method using nonlinear minimum square evaluation for camera extrinsic parameter estimation also has a weak point, which has different iteration number for approaching the minimal point according to the initial values and convergence time increases if the process run into a local minimum, In order to complement these shortfalls, we, first proposed constructing feature models using invariant vector of geometry, Secondly, we proposed a two-stage calculation method to improve accuracy and convergence by using 2D homography and LM method, In the experiment, we compared and analyzed the proposed method with existing method to demonstrate the superiority of the proposed algorithms.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.2
• /
• pp.205-212
• /
• 2003

Recently, as electronic commerce service via the Internet has expanded over the world, the standardization for the e-commerce has been strongly required. Therefore UN/CEFACT and OASIS adopted ebXML standard for the purpose of creating single global electronic marketplace. New e-Business systems should require ebXMl- based messaging system for reliable messaging delivery. In this paper, we have implemented Message Service Handler(MSH) packaging, transporting and managing e-Business messages for supporting ebXML messaging service. The MSH supports various system environments and allows high-level applications running either local or remote hosts with Remote Method Invocation(RMI) interface. In addition, MSH guarantees reliable message delivery on internet since it retransmits message in case of delivery failure and handles duplicated message and applies acknowledgement message for secure message delivery. Nowadays MSH has applied to ebXML registry/repository.

• Advances in aircraft and spacecraft science
• /
• v.1 no.3
• /
• pp.311-330
• /
• 2014

Environmental impact of aircraft emissions can be addressed in two ways. Air quality impact occurs during landings and takeoffs while in-flight impact during climbs and cruises influences climate change, ozone and UV-radiation. The aim of this paper is to investigate airports related local emissions and fuel consumption (FC). It gives flight path optimization model linked to a dispersion model as well as numerical methods. Operational factors are considered and the cost function integrates objectives taking into account FC and induced pollutant concentrations. We have compared pollutants emitted and their reduction during LTO cycles, optimized flight path and with analysis by Dopelheuer. Pollutants appearing from incomplete and complete combustion processes have been discussed. Because of calculation difficulties, no assessment has been made for the soot, $H_2O$ and $PM_{2.5}$. In addition, because of the low reliability of models quantifying pollutant emissions of the APU, an empirical evaluation has been done. This is based on Benson's fuel flow method. A new model, giving FC and predicting the in-flight emissions, has been developed. It fits with the Boeing FC model. We confirm that FC can be reduced by 3% for takeoffs and 27% for landings. This contributes to analyze the intelligent fuel gauge computing the in-flight fuel flow. Further research is needed to define the role of $NO_x$ which is emitted during the combustion process derived from the ambient air, not the fuel. Models are needed for analyzing the effects of fleet composition and engine combinations on emission factors and fuel flow assessment.

• Journal of Korea Water Resources Association
• /
• v.49 no.6
• /
• pp.529-536
• /
• 2016

The existing methods to estimate the maximum scour depth in the bend of steep gravel bed channel have been evaluated by the hydraulic movable-bed experiments. In the $90^{\circ}$ bend steep-slope channel paved with the fluvial gravels which are uniform in size and have a mean diameter of 43mm, the maximum scour depths due to the flow discharge and the gradient of bed slope have been investigated and compared with the scour depth computed from the equations. The local scour has occurred in conditions that the bed slope is steeper than 0.02 and the $F_r$ is greater than 0.95. Except Lacey's equation and Zeller's equation, the existing methods computing the maximum scour depth overestimate the maximum scour depth in the steep channel with the very coarse gravel bed. However, Lacey's equation with the bed material size and Zeller's equation considering the approach channel gradient and the bend angle may be relatively used to estimate the scour depth in bend of the steep gravel-bed river.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.7
• /
• pp.515-519
• /
• 2009

As the application fields of sensor nodes are getting diverse these days, it is required to have a way of collecting various data that is suitable for these application fields. In the case that the real-time surveillance over the data is unnecessary, present data collecting methods, which collect and transfer the data directly, can cause a waste of energy and data loss, A new method that store the collected data in a local storage and acquire them by query later on is required for nonreal-time applications. NAND flash has energy efficiency and large capacity so it is suitable for sensor nodes, Sensor nodes support 4-10 KBytes small sized memory and it is hard to build an effective file system since NAND Flash doesn't support overwriting NAND flash. This paper discusses an implementation of NAND Flash file system in sensor node environments. The file system makes long-term data collecting possible by reducing transmission cost. It is expected that this file system will play a central role in sensor network environments as it can be applied to various fields which call for long term data collecting.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.19-28
• /
• 2000

The scheduling problem in parallel processing systems has been a challenging research issue for decades. The problem is defined as finding an optimal schedule which minimizes the parallel execution time of an application on a target multiprocessor system. Duplication Based Scheduling (DBS) is a relatively new approach for solving the problem. The DBS algorithms are capable of reducing communication overhead by duplicating remote parent tasks on local processors. Most of DBS algorithms assume an availability of the unlimited number of processors in the system. Since the assumption may net hold in practice, the paper proposes a new scalable DBS algorithm for a target system with limited number of processors. It Is shown that the proposed algorithm with N available processors generates the same schedule as that obtained by the algorithm with unlimited number of processors, where N is the number of input tasks. Also, the performance evaluation reveals that the proposed algorithm shows a graceful performance degradation as the number of available processors in the system is decreased.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1090-1098
• /
• 2014

In this paper, an improved ACDE (Adaptive Cauchy Differential Evolution) algorithm with faster convergence speed, called ACDE2, is suggested. The baseline ACDE algorithm uses a "DE/rand/1" mutation strategy to provide good population diversity, and it is appropriate for solving multimodal optimization problems. However, the convergence speed of the mutation strategy is slow, and it is therefore not suitable for solving unimodal optimization problems. The ACDE2 algorithm uses a "DE/current-to-best/1" mutation strategy in order to provide a fast convergence speed, where a control parameter initialization operator is used to avoid converging to local optimization. The operator is executed after every predefined number of generations or when every individual fails to evolve, which assigns a value with a high level of exploration property to the control parameter of each individual, providing additional population diversity. Our experimental results show that the ACDE2 algorithm performs better than some state-of-the-art DE algorithms, particularly in unimodal optimization problems.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.35-44
• /
• 2006

Grid accounting model is necessary to support the demand and supply of id resource. Most grid accounting systems currently in use intrude upon site autonomy by modifying local accounting systems or calculate the cost of grid service without regard to site price policy. In this paper we propose and design Grid accounting model based on site price policy. This model assures autonomy of sites participating in gird computing and be able to actively cope with diverse billing services. Also this proposed model enables to provide RUS to Grid entities by transforming basic accounting information into GGF-UR format and allows this entities to exchange resource usage information. In this paper, proposed Grid accounting model enables sites to have autonomy of them and is evaluated for business model to enforce elaborate charging policy, compared with other systems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.4
• /
• pp.410-419
• /
• 2003

The buffer cache of general operating systems such as Linux manages file data by using global block replacement policy and read ahead. As a result, multimedia data with a low locality of reference and various consumption rate have low cache hit ratio and consume additional buffers because of read ahead. In this paper we have designed and implemented a new buffer allocation algorithm for multimedia data on Linux. Our approach keeps one read-ahead cache per every opened multimedia file and dynamically changes the read-ahead group size based on the buffer consumption rate of the file. This distributes resources fairly and optimizes the buffer consumption. This paper compares the system performance with that of Linux 2.4.17 in terms of buffer consumption and buffer hit ratio.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.9
• /
• pp.675-684
• /
• 2009

Internet worm can cause a traffic problem through DDoS(Distributed Denial of Services) or other kind of attacks. In those manners, it can compromise the internet infrastructure. In addition to this, it can intrude to important server and expose personal information to attacker. However, current detection and response mechanisms to worm have many vulnerabilities, because they only use local characteristic of worm or can treat known worms. In this paper, we propose a new framework to detect unknown worms. It uses macroscopic characteristic of worm to detect unknown worm early. In proposed idea, we define the macroscopic behavior of worm, propose a worm detection method to detect worm flow directly in IP packet networks, and show the performance of our system with simulations. In IP based method, we implement the proposed system and measure the time overhead to execute our system. The measurement shows our system is not too heavy to normal host users.