• 한국통신학회논문지
• /
• 제30권9C호
• /
• pp.877-886
• /
• 2005

Various frame recovery algorithms have been suggested to overcome the communication quality degradation problem due to Internet-typical impairments on Voice over IP(VoIP) communications. In this paper, we propose a new receiver-based recovery method which is able to enhance recovered speech quality with almost free computational cost and without an additional increment of delay and bandwidth consumption. Most conventional recovery algorithms try to recover the lost or erroneous speech frames by reconstructing missing coefficients or speech signal during speech decoding process. Thus they eventually need to modify the decoder software. The proposed frame recovery algorithm tries to reconstruct the missing frame itself, and does not require the computational burden of modifying the decoder. In the proposed scheme, the Vector Quantization(VQ) codebook indices of the erased frame are directly estimated by referring the pre-computed VQ Codebook Index Interpolation Tables(VCIIT) using the VQ indices from the adjacent(previous and next) frames. We applied the proposed scheme to the ITU-T G.723.1 speech coder and found that it improved reconstructed speech quality and outperforms conventional G.723.1 loss recovery algorithm. Moreover, the suggested simple scheme can be easily applicable to practical VoIP systems because it requires a very small amount of additional computational cost and memory space.

• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2004년도 제22회 춘계학술대회논문집
• /
• pp.142-147
• /
• 2004

The flow in the LOX manifold of liquid rocket has been investigated using a CAE technique with an objective of economical modeling of injection holes in order to reduce the overall computational cost of flow analysis during the optimal rocket design procedure. The computational geometry is very close to that of the actual rocket design and the flow condition through the injection holes resembles that in the actual manifold of the liquid rocket. The result shows that the flow in the plane just above the injection holes is not uniformly distributed in terms of pressure and mass flow rate and this is attributed to the large-scale flow patterns present the LOX manifold. Thus, the flow physics should be understood correctly before making any attempt to model the injection holes. In the present study, several boundary conditions which were designed to effectively replace the presence of injection holes have been tested and it was found that a simple modeling can be possible by mimicking the actual geometry of the injection holes. By using this simple injection hole modeling, it was able to obtain about 30% reduction in computational cost but it was still able to reproduce the flow patterns correctly. Also the flow has been analyzed after incorporating a couple of different types of pre-distributors in LOX manifold and the effect of those will be discussed.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제12권1호
• /
• pp.455-467
• /
• 2020

Shape design optimization for Blended-wing-body Underwater Gliders (BWBUGs) is usually computationally expensive. In our previous work, a simplified shape optimization (SSO) strategy is proposed to alleviate the computational burden, which optimizes some of the Sectional Airfoils (SAs) instead of optimizing the 3-D shape of the BWBUG directly. Test results show that SSO can obtain a good result at a much smaller computational cost when three SAs are adopted. In this paper, the performance of SSO is investigated with a different number of SAs selected from the BWBUG, and the results are compared with that of the Direct Shape Optimization (DSO) strategy. Results indicate that SSO tends to perform better with more SAs or even outperforms the DSO strategy in some cases, and the amount of saved computational cost also increases when more SAs are adopted, which provides some reference significance and enlarges the applicability range of SSO.

• Management Science and Financial Engineering
• /
• 제22권1호
• /
• pp.5-12
• /
• 2016

We consider a time-cost tradeoff problem with multiple milestones under a chain precedence graph. In the problem, some penalty occurs unless a milestone is completed before its appointed date. This can be avoided through compressing the processing time of the jobs with additional costs. We describe the compression cost as the convex or the concave function. The objective is to minimize the sum of the total penalty cost and the total compression cost. It has been known that the problems with the concave and the convex cost functions for the compression are NP-hard and polynomially solvable, respectively. Thus, we consider the special cases such that the cost functions or maximal compression amounts of each job are identical. When the cost functions are convex, we show that the problem with the identical costs functions can be solved in strongly polynomial time. When the cost functions are concave, we show that the problem remains NP-hard even if the cost functions are identical, and develop the strongly polynomial approach for the case with the identical maximal compression amounts.

• Journal of Mechanical Science and Technology
• /
• 제16권8호
• /
• pp.1033-1038
• /
• 2002

Genetic alsorithm (GA) , compared to the gradient-based optimization, has advantages of convergence to a global optimized solution. The genetic algorithm requires so many number of analyses that may cause high computational cost for genetic search. This paper proposes a personal computer network programming based on TCP/IP protocol and client-server model using socket, to improve processing speed of the genetic algorithm for optimization of composite laminated structures. By distributed processing for the generated population, improvement in processing speed has been obtained. Consequently, usage of network-based genetic algorithm with the faster network communication speed will be a very valuable tool for the discrete optimization of large scale and complex structures requiring high computational cost.

• 한국CDE학회논문집
• /
• 제20권2호
• /
• pp.114-123
• /
• 2015

The BIM libraries and technical contents in order to develop common technical standards that reflect the contents for a BIM design support should be based. It is essential to redress the technological burden on design office requirements. The technical contents consisted of Material Information, Standard Details and Cost Information are made by system of standard classification. By connecting BIM libraries with each of information including the contents, it derives the consistent BIM data application through the integrated model. In addition, we look forward to introducing and applying BIM more easily through securing common technical contents which remove the pressure of engineering developments of each individual architectural design office and prevent overlapping investments.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2000년도 봄 학술발표회논문집
• /
• pp.379-388
• /
• 2000

This paper describes the application of discretized continuum-type optimality criteria (DCOC) for design of the reinforced concrete T-beams. The cost of construction as objective function which includes the costs of concrete, reinforced steel and formwork is minimized. The design constraints include limits on the maximum deflection in a given span on bending and shear strengths and optimality criteria is given based on the well blown Kuhn-Tucker necessary conditions, followed by an iterative procedure for designs when the design variables are the depth and the steel ratio. The versatility of the DCOC technique has been demonstrated by considering numerical examples which have one and five span RC T-beams.

• 한국CDE학회논문집
• /
• 제9권2호
• /
• pp.148-157
• /
• 2004

Interactive simulators that simulate mechanical systems are being developed for the purpose of performance evaluation of product design, replacement of physical training, and entertainment game. Use of flight simulator is increasing to reduce risk and cost of physical training, and we need virtual environment which covers large area terrain. We need a method that can reduce development cost and construction time of virtual environment that simulate the real environment. There have been attempts to link GIS or remote sensing field with virtual reality. This paper examines a method that helps to construct virtual environment, and attempts to link geographic information with virtual reality. A construction method of virtual environment based on digital map and satellite image has been studied.

• 한국CDE학회논문집
• /
• 제16권4호
• /
• pp.292-299
• /
• 2011

Han-ok has a long history and cultural traditions. It has green and healthy and culture but high construction costs, thermal insulation performance of residential and vulnerable to fires and have a weakness for maintenance. However, modernized resident housing, Han-ok is required to improve in terms of environmental aspect due to its weakness for insulating and inconvenience for modem era. Also Han-Ok's building is criticized as a huge dependence on subjective building experiences. This is pointed to be the biggest problem, Han-ok has. Traditionally it does not have a scientific and specific manual for construction. In this research, process simulation was adopted to develop Han-Ok's environmental improvements. In terms of LCC (Life Cycle Cost) aspect, however, Han-Ok's environmental characteristics are examined to suggest an appropriate Han-Ok construction method. Also the result of this research would be utilized to base the information database for efficient constructing and its management in new Han-Ok constructing industry.

• Journal of Computational Design and Engineering
• /
• 제1권2호
• /
• pp.88-95
• /
• 2014

Because the cost of performance testing using actual products is expensive, manufacturers use lower-cost computer-aided design simulations for this function. In this paper, we propose using hexahedral meshes, which are more accurate than tetrahedral meshes, for finite element analysis. We propose automatic hexahedral mesh generation with sharp features to precisely represent the corresponding features of a target shape. Our hexahedral mesh is generated using a voxel-based algorithm. In our previous works, we fit the surface of the voxels to the target surface using Laplacian energy minimization. We used normal vectors in the fitting to preserve sharp features. However, this method could not represent concave sharp features precisely. In this proposal, we improve our previous Laplacian energy minimization by adding a term that depends on multi-normal vectors instead of using normal vectors. Furthermore, we accentuate a convex/concave surface subset to represent concave sharp features.