• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.13-21
• /
• 2010

The Optimal results of Kalman Filtering on the Inverted Pendulum System requires an effective factor such as the noise covariance matrix Q, the measurement noise covariance matrix R and the initial error covariance matrix $P_0$. We present a special case where the optimality of the filter is not destroyed and not sensitive to scaling of these covariance matrix because these factors are unknown or are known only approximately in the practical situation. Moreover, the error covariance matrices issued by this method predict errors in the state estimate consistent with the scaled covariance matrices and not the issued state estimates. Various results using the scalar gain $\delta$ are derived to described the relations among the three covariance matrices, Kalman Gain and the error covariance matrices. This paper is described as follows: Section III a brief overview of the Inverted Pendulum system. Section IV deals with the mathematical dynamic model of the system used for the computer simulation. Section V presents a various simulation results using the scalar gain.

• Journal of Korean Society of Forest Science
• /
• v.81 no.4
• /
• pp.363-371
• /
• 1992

This study was aimed at developing a computer model to determine rational road networks in mountainous forests. The computer model is composed of two major subroutines for digital terrain analyses and route selection. The digital terrain model(DTM) provides various information on topographic and vegetative characteristics of forest stands. The DTM also evaluates the effectiveness of road construction based on slope gradients. Using the results of digital terrain analyses, the route selection subroutine, heuristically, determines the optimal road layout satisfying the predefined road densities. The route selection subroutine uses the area-partitioning method in order to fully of roads. This method leads to unbiased road layouts in forest areas. The size of the unit partitiones area can be calculated as a function of the predefined road density. In addition, the user-defined road density of the area-partitioning method provides flexibility in applying the model to real situations. The rational road network can be easily achived for varying road densities, which would be an essential element for network design of forest roads. The optimality conditions are evaluated in conjuction with longitudinal gradients, investment efficiency earthwork quantity or the mixed criteria of these three. The performance of the model was measured and, then, compared with those of conventional ones in terns of average skidding distance, accessibility of stands, development index and circulated road network index. The results of the performance analysis indicate that selection of roading routes for network design using the digital terrain analysis and the area-partitioning method improves performance of the network design medel.

• Proceedings of the KSPS conference
• /
• 1996.10a
• /
• pp.109-116
• /
• 1996

In this paper, I would like to explore the possibility that the nature of place assimilation can be captured in terms of the OCP within the Optimality Theory (Mccarthy & Prince 1999. 1995; Prince & Smolensky 1993). In derivational models, each assimilatory process would be expressed through a different autosegmental rule. However, what any such model misses is a clear generalization that all of those processes have the effect of avoiding a configuration in which two consonantal place nodes are adjacent across a syllable boundary, as illustrated in (1):(equation omitted) In a derivational model, it is a coincidence that across languages there are changes that have the result of modifying a structure of the form (1a) into the other structure that does not have adjacent consonantal place nodes (1b). OT allows us to express this effect through a constraint given in (2) that forbids adjacent place nodes: (2) OCP(PL): Adjacent place nodes are prohibited. At this point, then, a question arises as to how consonantal and vocalic place nodes are formally distinguished in the output for the purpose of applying the OCP(PL). Besides, the OCP(PL) would affect equally complex onsets and codas as well as coda-onset clusters in languages that have them such as English. To remedy this problem, following Mccarthy (1994), I assume that the canonical markedness constraint is a prohibition defined over no more than two segments, $\alpha$ and $\beta$: that is, $^{*}\{{\alpha, {\;}{\beta{\}$ with appropriate conditions imposed on $\alpha$ and $\beta$. I propose the OCP(PL) again in the following format (3) OCP(PL) (table omitted) $\alpha$ and $\beta$ are the target and the trigger of place assimilation, respectively. The '*' is a reminder that, in this format, constraints specify negative targets or prohibited configurations. Any structure matching the specifications is in violation of this constraint. Now, in correspondence terms, the meaning of the OCP(PL) is this: the constraint is violated if a consonantal place $\alpha$ is immediately followed by a consonantal place $\bebt$ in surface. One advantage of this format is that the OCP(PL) would also be invoked in dealing with place assimilation within complex coda (e.g., sink [si(equation omitted)k]): we can make the constraint scan the consonantal clusters only, excluding any intervening vowels. Finally, the onset clusters typically do not undergo place assimilation. I propose that the onsets be protected by certain constraint which ensures that the coda, not the onset loses the place feature.

• Journal of Intelligence and Information Systems
• /
• v.16 no.2
• /
• pp.129-141
• /
• 2010

An Internet shopping mall for clothing operates a warehouse for packing and shipping products to fulfill its orders. All the products in the warehouse are put into the boxes of same brands and the boxes are stored in a row on shelves equiped in the warehouse. To make picking and managing easy, boxes of the same brands are located side by side on the shelves. When new products arrive to the warehouse for storage, the products of a brand are put into boxes and those boxes are located adjacent to the boxes of the same brand. If there is not enough space for the new coming boxes, however, some boxes of other brands should be moved away and then the new coming boxes are located adjacent in the resultant vacant spaces. We want to minimize the movement of the existing boxes of other brands to another places on the shelves during the warehousing of new coming boxes, while all the boxes of the same brand are kept side by side on the shelves. Firstly, we define the adjacency of boxes by looking the shelves as an one dimensional series of spaces to store boxes, i.e. cells, tagging the series of cells by a series of numbers starting from one, and considering any two boxes stored in the cells to be adjacent to each other if their cell numbers are continuous from one number to the other number. After that, we tried to formulate the problem into an integer programming model to obtain an optimal solution. An integer programming formulation and Branch-and-Bound technique for this problem may not be tractable because it would take too long time to solve the problem considering the number of the cells or boxes in the warehouse and the computing power of the Internet shopping mall. As an alternative approach, we designed a fast heuristic method for this reallocation problem by focusing on just the unused spaces-empty cells-on the shelves, which results in an assignment problem model. In this approach, the new coming boxes are assigned to each empty cells and then those boxes are reorganized so that the boxes of a brand are adjacent to each other. The objective of this new approach is to minimize the movement of the boxes during the reorganization process while keeping the boxes of a brand adjacent to each other. The approach, however, does not ensure the optimality of the solution in terms of the original problem, that is, the problem to minimize the movement of existing boxes while keeping boxes of the same brands adjacent to each other. Even though this heuristic method may produce a suboptimal solution, we could obtain a satisfactory solution within a satisfactory time, which are acceptable by real world experts. In order to justify the quality of the solution by the heuristic approach, we generate 100 problems randomly, in which the number of cells spans from 2,000 to 4,000, solve the problems by both of our heuristic approach and the original integer programming approach using a commercial optimization software package, and then compare the heuristic solutions with their corresponding optimal solutions in terms of solution time and the number of movement of boxes. We also implement our heuristic approach into a storage location assignment system for the Internet shopping mall.

• Explosives and Blasting
• /
• v.30 no.2
• /
• pp.29-42
• /
• 2012

Variables influencing the free face movement due to rock blasting include the physical and mechanical properties, in particular the discontinuity characteristics, explosive type, charge weight, burden, blast-hole spacing, delay time between blast-holes or rows, stemming conditions. These variables also affects the blast vibration, air blast and size of fragmentation. For the design of surface blasting, the priority is given to the safety of nearby buildings. Therefore, blast vibration has to be controlled by analyzing the free face movement at the surface blasting sites and also blasting operation needs to be optimized to improve the fragmentation size. High-speed digital image analysis enables the analyses of the initial movement of free face of rock, stemming optimality, fragment trajectory, face movement direction and velocity as well as the optimal detonator initiation system. Even though The high-speed image analysis technique has been widely used in foreign countries, its applications can hardly be found in Korea. This thesis aims at carrying out a fundamental study for optimizing the blast design and evaluation using the high-speed digital image analysis. A series of experimentation were performed at two large surface blasting sites with the rock type of shale and granite, respectively. Emulsion and ANFO were the explosives used for the study. Based on the digital images analysis, displacement and velocity of the free face were scrutinized along with the analysis fragment size distribution. In addition, AUTODYN, 2-D FEM model, was applied to simulate detonation pressure, detonation velocity, response time for the initiation of the free face movement and face movement shape. The result show that regardless of the rock type, due to the displacement and the movement velocity have the maximum near the center of charged section the free face becomes curved like a bow. Compared with ANFO, the cases with Emulsion result in larger detonation pressure and velocity and faster reaction for the displacement initiation.