• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.27 no.6
• /
• pp.635-642
• /
• 2014

In this paper, an efficient technique is developed to predict failure probability of three failure modes(case rupture, fracture and bolt breakage) related to solid rocket motor case due to the inner pressure during the mission flight. The overall procedure consists of the steps: 1) design parameters affecting the case failure are identified and their uncertainties are modelled by probability distribution, 2) combustion analysis in the interior of the case is carried out to obtain maximum expected operating pressure(MEOP), 3) stress and other structural performances are evaluated by finite element analysis(FEA), and 4) failure probabilities are calculated for the above mentioned failure modes. Axi-symmetric assumption for FEA is employed for simplification while contact between bolted joint is accounted for. Efficient procedure is developed to evaluate failure probability which consists of finding first an Most Probable Failure Point(MPP) using First-Order Reliability Method(FORM), next making a response surface model around the MPP using Latin Hypercube Sampling(LHS), and finally calculating failure probability by employing Importance Sampling.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.5
• /
• pp.205-214
• /
• 2020

With the recent development of hardware and software technology, interest in the development of wearable devices is increasing. In particular, wearable devices require algorithms suitable for low-power and low-capacity embedded devices. Among them, there is an increasing demand for a signal compression algorithm that reduces communication overhead, in order to increase the efficiency of storage and transmission of electrocardiogram (ECG) signals requiring long-time measurement. Because normal beats occupy most of the signal with similar shapes, a high rate of signal compression is possible if normal beats are represented by a template. In this paper, we propose an algorithm for determining the normal beat template using the template cluster and Pearson similarity. Also, the template is expressed effectively as a few vertices through linear approximation algorithm. In experiment of Datum 234 of MIT-BIH arrhythmia database (MIT-BIH ADB) provided by Physionet, a compression ratio was 33.44:1, and an average distribution of root mean square error (RMSE) was 1.55%.

• International Journal of Highway Engineering
• /
• v.8 no.3 s.29
• /
• pp.63-76
• /
• 2006

For a private toll road project, deciding optimal toll is an important element of economic analysis for the project and a challengeable work. In this study, the optimal toll of a private toll bridge, Geoga Bridge which connects Geoje Island of Gyeongnam Province and Gaduk Island of Busan was estimated using Stated Preference (SP) data. The SP data were collected by interviewing the passenger car drivers travelling on the National Road 14. They are latent users of the bridge. A fuzzy approximate reasoning model to estimate the optimal toll was built using the SP data. For the input variable of the model, the saved travel time and toll level were employed and the diversion rate to the bridge was employed for the output variable. The diversion rates for each toll level and saved travel time were estimated and the toll level which had maximized the toll revenue was decided as optimal toll. The optimal toll was tested by comparing with the average pay rate of passenger car drivers. Since the optimal toll for passenger cars at one hour saving, the 6,250 won is about 50 % of the average pay rate of passenger car divers, the toll was evaluated not to be high. The technique employed in this study may be used for the estimation of the optimal tolls for other kinds of vehicles.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.8 no.1
• /
• pp.165-172
• /
• 1988

An optimal network design method using continuous form of design variables is considered. Modified Hooke-and-Jeeves algorithm has been implemented in order to solve nonlinear progamming problem which is approximately equivalent to the real network design problem (NDP) with system. efficiency criteria(i. e. travel time and costs) and construction cost as objective function. Various forms of construction cost function, locations of initial solution, and dimension of initial step size of link improvement are taken into account to show the validity of this approach. The results obtained are quite promising in terms of the numbers of evaluations in solving NDP, and the speed of convergence. Finally, some techniques in choosing efficient intial solution, initial step size and approximation are given.

• The KIPS Transactions:PartA
• /
• v.12A no.1 s.91
• /
• pp.13-22
• /
• 2005

Similarly to the edges defined in a 2D image, we can define the geometric features representing the boundary of the distinctive parts appearing on 3D meshes. The geometric features have been used as basic primitives in several applications such as mesh simplification, mesh deformation, and mesh editing. In this paper, we propose geometric livewire and geometric livelane for extracting geometric features in a 3D mesh, which are the extentions of livewire and livelane methods in images. In these methods, approximate curvatures are adopted to represent the geometric features in a 3D mesh and the 3D mesh itself is represented as a weighted directed graph in which cost functions are defined for the weights of edges. Using a well-known shortest path finding algorithm in the weighted directed graph, we extracted geometric features in the 3D mesh among points selected by a user. In this paper, we also visualize the results obtained from applying the techniques to extracting geometric features in the general meshes modeled after human faces, cows, shoes, and single teeth.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.42-53
• /
• 2000

Efficient implementation of pre-filtering has been an important issue in video sequence coding, because it can remove camera noise and improve coding efficiency dramatically This paper introduces a novel pre-filtering scheme that is performed inside a video encoder The proposed pre-filtering is based on the approximated generalized Wiener filtering and two-dimensional discrete cosine transform (DCT) factorization. and is achieved by scaling the DCT coefficients of original image blocks for intra block coding and those of motion-compensated error blocks for inter block coding, respectively Even though the pre-filtering operation is embedded in a video encoder, its additional computational complexity is marginal compared to the encoding process, and the overall architecture of the conventional video encoder is maintained In spite of its simplicity, the proposed pre-filtering scheme provides good filtering and coding performance for noisy video sequences.

• Journal of the Korea Computer Graphics Society
• /
• v.2 no.1
• /
• pp.7-14
• /
• 1996

A particle system is defined as a collection of primitive particles that together represent irregular and ever-changing objects such as smoke, clouds, waterfalls, and explosions. A particle system can be a powerful tool for modeling a deformable object's motion and change of form since it has dynamic properties with time. As an object becomes more complicated and shows more chaotic behavior, however, we need much more parameters for describing its characteristics completely. Consequently, the conventional particle system leads to difficulty in managing all of the parameters properly since one parameter can affect the others. Moreover, motion equations for representing particles' behavior are usually approximated to gain speed-ups. The inevitable errors in calculating the equations can cause an unexpected outcome. In this paper, we present a new approach of applying fuzzy contol to mage particles' motion and attributes changes over time. We also give an implementation result of a fuzzy particle system to show the feasibility of the proposed method. Applications of the system to explosions, nebulae, volcanos, and grass are presented.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.10
• /
• pp.1012-1015
• /
• 2011

The decision-directed blind equalization algorithm is often used due to its simplicity and good convergence property when the eye pattern is open. However, in a channel where the eye pattern is closed, the decision-directed algorithm is not guaranteed to converge. Hence, a modified Bussgang-type algorithm using a hyperbolic tangent function for zero-memory nonlinear(ZNL) function has been proposed and applied to avoid this problem by Filho et al. But application of this algorithm includes the calculation of hyperbolic tangent function and its derivative or a look-up table which may need a large amount of memory due to channel variations. To reduce the computational and/or hardware complexity of Filho's algorithm, in this paper, an improved method for the decision-directed algorithm is proposed. In the proposed scheme, the ZNL function and its derivative are respectively set to be the original signum function and a narrow rectangular pulse which is an approximation of Dirac delta function. It is shown that the proposed scheme, when it is combined with decision-directed algorithm, reduces the computational complexity drastically while it retains the convergence and steady-state performance of the Filho's algorithm.

• Science of Emotion and Sensibility
• /
• v.7 no.4
• /
• pp.57-65
• /
• 2004

In this paper, we present a hybrid approach which incorporates color, texture and shape in content-based image retrieval. Colors in each image are clustered into a small number of representative colors. The feature descriptor consists of the representative colors and their percentages in the image. A similarity measure similar to the cumulative color histogram distance measure is defined for this descriptor. The co-occurrence matrix as a statistical method is used for texture analysis. An optimal set of five statistical functions are extracted from the co-occurrence matrix of each image, in order to render the feature vector for eachimage maximally informative. The edge information captured within edge histograms is extracted after a pre-processing phase that performs color transformation, quantization, and filtering. The features where thus extracted and stored within feature vectors and were later compared with an intersection-based method. The content-based retrieval system is tested to be effective in terms of retrieval and scalability through experimental results and precision-recall analysis.

• Journal of Korean Society of Steel Construction
• /
• v.10 no.4 s.37
• /
• pp.657-666
• /
• 1998

This study presents an effective dual algorithm for the optimal design of steel structures with displacement constraints. The dual method can replace a primary optimization problem with a sequence of approximate explicit subproblems with a simple algebraic structure. Since being convex and separable, each subproblem can be solved efficiently by the dual method. Specifically, this study uses the principle of virtual work to obtain the displacement constraint equations with an explicit form and adds the linear regression equation expressing the relationships between the cross-section properties to the dual algorithm to reduce the number of design variables. Furthermore, this study deals with the discrete optimization problem to select members with the standard steel sections. Through numerical analyses, the proposed method will be compared with the conventional optimality criteria method.