• Journal of Korean Society of Forest Science
• /
• v.82 no.3
• /
• pp.292-304
• /
• 1993

This research developed a forest-level harvest scheduling model using linear programming (LP). The formulations of the LP model include timber production schemes with constraints of nondecling yield forest conversion strategies, the minimum timber supply, levels and the maximum cut acrages. The model is able to generate both Model I and Model II types of input matrix in MPS format. In this paper, use of LP in building the framework of the strategic forest planning model was justified by comparing the algorithmic characteristics of LP with those of Gentan probability and binary search approaches through literature reviews. In order to demonstrate the field applicability of the model proposed. (1) the harvest scheduling problem for about 11,000-hectare case study area (Mt. Baekun area in Southern Experimental Forest of Seoul National University) was formulated and soloed and (2) the effects of the change in task regulatory timber production constraints or. optimal harvesting schedules here investigated.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.460-468
• /
• 2004

Quality of Service (QoS)-constrained policy has an advantage to guarantee QoS requirements requested by users. Quorum systems can ensure the consistency and availability of replicated data despite the benign failure of data repositories. We propose a Quorum based resource management scheme, which includes a system resource and network resource, both of which can satisfy the requirements of application QoS. We also propose the resource reconfiguration algorithm based on temporal execution time estimation method. Resource reconfiguration means that reshuffling the current available resource set for maintaining the quality level of the resources. We evaluate the effectiveness of resource reconfiguration mechanism with a Heart Hemodynamics analysis. Our approach shows the increase of the stability of execution environment as well as decrease the completion time compare to the method that is not adapted the resource reconfiguration.

• Journal of Digital Contents Society
• /
• v.3 no.2
• /
• pp.221-233
• /
• 2002

In this paper, we present integer programming models and algorithms for the Capacitated Facility Location-Allocation Problem (CFLP). The models and algorithms can be used for the design of logistics networks and for the location of telecommunication facilities. We are given a set of candidate facility installation sites, one type of facility for each candidate site with its capacity and installation cost, a set of customers with their demand requirement, and flow cost for one unit of demand flow from each customer to each candidate site. (CFLP) is to determine the number of facilities for each candidate site and the set of customers which are connected to each site with minimum cost, while satisfying the demand requirement of each customer and constraints imposed on the allocation of customers to facilities. We present two integer programming models for (CFLP), and devise a branch-and-cut algorithm and a branch-and-price algorithm for the problem.

• The KIPS Transactions:PartA
• /
• v.19A no.2
• /
• pp.101-112
• /
• 2012

In recently years, distributed real-time software has performed important roles in various areas. Real-time applications should be performed with satisfying strict constraints on response time. Usually real-time applications are developed on the real-time supporting middleware such as TMO(Time-triggered, Message-triggered Object), CORBA/RT, and RTAI. However, it is not easy to develop applications using them since these real-time middleware are unfamiliar to programmers. In this paper, we propose an automatic code generator for real-time application based on TMO in order to reduce development costs. For increasing or reflecting the characteristics of TMO into the design model, SpM and SvM methods are added into the class diagram, which have time constraints as their properties. And behaviors of them are represented as separated regions on state machine diagram in different abstract level. These diagrams are inputted into TMO-based code automatic generator, which generates details of the TMO class. Our approach has advantages for decreasing effort and time for making real time software by automatically generating TMO codes without detailed knowledge of TMO.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.81-92
• /
• 2006

This paper proposes a robustness watermarking for 3D mesh model based on projection onto convex sets (POCS). After designing the convex sets for robustness and invisibility among some requirements for watermarking system, a 3D-mesh model is projected alternatively onto two constraints convex sets until the convergence condition is satisfied. The robustness convex set are designed for embedding the watermark into the distance distribution of the vertices to robust against the attacks, such as mesh simplification, cropping, rotation, translation, scaling, and vertex randomization. The invisibility convex set are designed for the embedded watermark to be invisible. The decision values and index that the watermark was embedded with are used to extract the watermark without the original model. Experimental results verify that the watermarked mesh model has invisibility and robustness against the attacks, such as translation, scaling, mesh simplification, cropping, and vertex randomization.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.6
• /
• pp.315-320
• /
• 2017

Estimating the correct pose of augmented objects on the real camera view efficiently is one of the most important questions in image tracking area. In computer vision, Homography is used for camera pose estimation in augmented reality system with markerless. To estimating Homography, several algorithm like SURF features which extracted from images are used. Based on extracted features, Homography is estimated. For this purpose, RANSAC algorithm is well used to estimate homography and DCS-RANSAC algorithm is researched which apply constraints dynamically based on Constraint Satisfaction Problem to improve performance. In DCS-RANSAC, however, the dataset is based on pattern of feature distribution of images manually, so this algorithm cannot classify the input image, pattern of feature distribution is not recognized in DCS-RANSAC algorithm, which lead to reduce it's performance. To improve this problem, we suggest the KCS-RANSAC algorithm using K-means clustering in CS-RANSAC to cluster the images automatically based on pattern of feature distribution and apply constraints to each image groups. The suggested algorithm cluster the images automatically and apply the constraints to each clustered image groups. The experiment result shows that our KCS-RANSAC algorithm outperformed the DCS-RANSAC algorithm in terms of speed, accuracy, and inlier rate.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.1
• /
• pp.53-63
• /
• 2009

Use of high-strength steel members in building of high-rise buildings and large scale structures is expected to increase the effectiveness of structural design by reducing the weight and cost of structures. So far, high-strength steel members have been used in a very limited way because it is hard to select the proper strengths of steel members in a systematic way with the consideration of the structural cost. In this paper, therefore, a structural optimization technique based on Genetic algorithm is developed for effective use of high-strength steel members in structural design of high-rise buildings with the form of building frame system. The stability and efficiency of the technique is evaluated by using to a 35-story building. As a result, a stable and reliable optimal solution was obtained with a difference of 2.63% between individual and mean optimal structural costs.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.4
• /
• pp.195-204
• /
• 2010

Due to improved wireless communication technologies, it is possible to provide multimedia streaming service for mobile device clients like PDAs and cellphones. Wireless networks are serviced on low bandwidth channels and mobile devices work on limited hardware specifications. In these conditions, transcoding technologies are needed to adapt the media for streaming services to given mobile environments. To transcode from the source media to the target media for corresponding grades, transcoding servers perform transcoding jobs as exhausting their resources. Since various transcoding loads occur according to the target transconding grades, an effective transcoding load balancing policy is required among transcoding servers. In addition to transcoding process, servers should maintain QoS streams for mobile clients for total serviced times. It requires real-time requirements to support QoS for various mobile clients. In this paper, a new transcoding load distribution method is proposed. The proposed method can be driven for fair load balance between distributed transcoding servers. Based on estimated transcoding time, movie information and target transcoding bit-rate, it provides fair transcoding load distribution and also performs admission control to support QoS streams for mobile clients.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1418-1432
• /
• 1996

In addition t improved availability, replication of data can enhance performance of distributed real-time transaction processing system by allowing transactions initiated at multiple node to be processed concurrently. To satisfy both the consistency and real-time constraints, it is necessary to integrate concurrency control and atomic commitment protocols with time-driven scheduling methods. blocking caused by existing concurrency control protocols is incompatible with time-driven scheduling because they cannot schedule transactions to meet given deadlines. To maintain consistency of replicated data and to provide a high degree of schedulability and predictability , the proposed time-driven scheduling methods integrate optimistic concurrency control protocols that minimize the duration of blocking and produce the serialization by reflecting the priority transactions. The atomicity of transactions is maintained to ensure successful commitment in distributed environment. Specific time-driven scheduling techniqueare discussed, together with an analysis of the performance of this scheduling.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.49 no.8
• /
• pp.637-648
• /
• 2021

This paper aims to propose new reentry guidance for Korean Space plane (KSP). Similar to the Space Shuttle guidance concept, a reference drag profile is first determined to satisfy several flight path constraints and boundary conditions, and the proposed guidance commands are realized in a way to track the predetermined reference drag profile. To this end, the drag dynamics is examined. The investigation uncovers that the dynamics characteristics of the drag and the flight path angle are considerably different. Based on this fact, the proposed guidance commands are determined using the time-scale separation technique and the feedback linearization methodology. The key feature of the proposed guidance lies in its simple structure and a clear working mechanism. Therefore, the proposed method is simple to implement compared to existing methods. Numerical simulations are performed to investigate the performance of the proposed method.