• Structural Engineering and Mechanics
• /
• 제43권1호
• /
• pp.31-51
• /
• 2012

This paper presents a computational study that explores the design of rigid steel frames by considering construction related costs. More specifically, two different aspects are investigated in this study focusing on the effects of (a) reducing the number of labor intensive rigid connections within a frame of given geometric layout, and (b) reducing the number of different member section types used in the frame. A genetic algorithm based optimization framework searches design space for these objectives. Unlike some studies that express connection cost as a factor of the entire frame weight, here connections and their associated cost factors are explicitly represented at the member level to evaluate the cost of connections associated with each beam. In addition, because variety in member section types can drive up construction related costs, its effects are evaluated implicitly by generating curves that show the trade off between cost and different numbers of section types used within the frame. Our results show that designs in which all connections are considered to be rigid can be excessively conservative: rigid connections can often be eliminated without any appreciable increase in frame weight, resulting in a reduction in overall cost. Eliminating additional rigid connections leads to further reductions in cost, even as frame weight increases, up to a certain point. These complex relationships between overall cost, rigid connections, and member section types are presented for a representative five-story steel frame.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1195-1211
• /
• 2016

The emerging video coding standard High Efficiency Video Coding (HEVC) has shown almost 40% bit-rate reduction over the state-of-the-art Advanced Video Coding (AVC) standard but at about 40% computational complexity overhead. The main reason for HEVC computational complexity is the inter prediction that accounts for 60%-70% of the whole encoding time. In this paper, we propose several fast coding unit (CU) encoding schemes based on the Merge mode and motion estimation information to reduce the computational complexity caused by the HEVC inter prediction. Firstly, an early Merge mode decision method based on motion estimation (EMD) is proposed for each CU size. Then, a Merge mode based early termination method (MET) is developed to determine the CU size at an early stage. To provide a better balance between computational complexity and coding efficiency, several fast CU encoding schemes are surveyed according to the rate-distortion-complexity characteristics of EMD and MET methods as a function of CU sizes. These fast CU encoding schemes can be seamlessly incorporated in the existing control structures of the HEVC encoder without limiting its potential parallelization and hardware acceleration. Experimental results demonstrate that the proposed schemes achieve 19%-46% computational complexity reduction over the HEVC test model reference software, HM 16.4, at a cost of 0.2%-2.4% bit-rate increases under the random access coding configuration. The respective values under the low-delay B coding configuration are 17%-43% and 0.1%-1.2%.

• 전자공학회논문지B
• /
• 제32B권8호
• /
• pp.1091-1098
• /
• 1995

This paper proposes an efficient noiseless encoding method of vector quantization(VQ) index using a dynamic index mapping. Using high interblock correlation, the proposed index mapper transforms an index into a new one with lower entropy. In order to achieve good performance with low computational complexity, we adopt 'the sum of differences in pixel values on the block boundaries' as the cost function for index mapping. Simulation results show that the proposed scheme reduces the average bitrate by 40 - 50 % in ordinary VQ system for image compression. In addition, it is shown that the proposed index mapping method can be also applied to mean-residual VQ system, which allows the reduction of bitrate for VQ index by 20 - 30 %(10 - 20 % reduction in total bitrate). Since the proposed scheme is one for noiseless encoding of VQ index, it provides the same quality of the reconstructed image as the conventional VQ system.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2011년도 추계학술대회 논문집
• /
• pp.764-765
• /
• 2011

In this paper, rotordynamic analyses of the Campbell diagram, critical speeds, and harmonic responses for a TMP rotor system are performed. Since the finite element model of the TMP rotor system has a very large number of degrees of freedom because of its complex geometry, and dynamic analyses for investigating the critical speeds, stability, and harmonic response are repeated for various design parameters, model order reduction (MOR) is necessary to reduce the computational cost. The Krylov-based model order reduction via moment matching significantly speeds up the rotordynamic analyses for the TMP rotor system.

• International Journal of Automotive Technology
• /
• 제5권3호
• /
• pp.189-194
• /
• 2004

The viscoelastic layer material is widely used to control the noise and vibration characteristics of the panel structure. This paper describes the design technology of the effective vibration damping treatment using the concept of the equivalent parameter of viscoelastic layer materials. Applying the equivalent parameter concepts based on theories of shell, it is possible to simulate the finite element analysis of damping layer panel treatments on the vibration characteristics of the structure. And it is achieved the reduced computational cost and the optimal design of topological distribution for the reduction of vibration effect.

• 한국CDE학회지
• /
• 제4권2호
• /
• pp.36-41
• /
• 1998

To survive in the intensive world wide automotive market, more and more automotive companies are investing their resources into concurrent engineering systems (CE) based on the combined CAD/CAM/CAE/ PDM technology. The main objectives of CE in automotive companies are the quality improvement of products and the reduction of cost and time to market. Remarkable effects are appearing from some of these companies. As shown in this paper, these successful automotive companies have been focusing on establishing the new process and methodology in applying CE into their car development process.

• ETRI Journal
• /
• 제32권4호
• /
• pp.596-602
• /
• 2010

This paper proposes a computationally efficient learning-based super-resolution algorithm using k-means clustering. Conventional learning-based super-resolution requires a huge dictionary for reliable performance, which brings about a tremendous memory cost as well as a burdensome matching computation. In order to overcome this problem, the proposed algorithm significantly reduces the size of the trained dictionary by properly clustering similar patches at the learning phase. Experimental results show that the proposed algorithm provides superior visual quality to the conventional algorithms, while needing much less computational complexity.

• 한국통신학회논문지
• /
• 제25권9B호
• /
• pp.1604-1608
• /
• 2000

The three-step search (TSS) algorithm for block motion estimation has been widely used in real-time video coding due to the simplicity of the algorithm significant reduction of computationl cost and good performance. In this paper an improved three-step search (ITS) algorithm is proposed to improve the performance of the TSS algorithm. Simulation results show that in terms of motion compensation errors the proposed ITSS outperforms some popular fast search algorithms while it has the lower computational complexity.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2009년도 정기 학술대회
• /
• pp.139-145
• /
• 2009

축소시스템은 반복적인 계산이 요구되는 문제에서 매우 유용하게 적용될 수 있는 해석 기법이다. 최근에는 영역분할 기법과의 연동을 통해 축소시스템의 효율성이 향상되었다. 그러나, 전체 도메인이 몇 개의 영역으로 분할될 때 구속조건이 부과되지않는 영역이 만들어지게 된다. 각 부영역의 축소시스템을 구축하기 위해서는 리츠벡터를 추출해야 하는데, 구속조건이 부과된 부영역에서는 일반적인 정적해석을 통해 가능하다. 그러나, 경계조건이 부과되지 않은 부영역에서는 리츠벡터 추출을 위해 의사역행렬을 이용해야 한다. 일반적으로, 의사역행렬의 사용은 상당한 계산시간과 전산자원을 필요로 하는 문제점이 있다. 본 연구에서는 이 문제점을 개선하기 위해 축소 의사역행렬 도입을 제안한다. 이 방법은 정적 축소방법을 기초로 축소 의사역행렬을 구축하여 축소된 리츠벡터 정보를 추출한 후, 변환관계를 이용하여 전체 리츠벡터 정보를 구하게 된다. 수치예제에서는 고유치 해석을 통해 제안방법의 신뢰성을 검증하고, 전체시스템 계산시간과 비교하여 그 효율성을 검증한다.

• 한국전산구조공학회논문집
• /
• 제22권2호
• /
• pp.173-179
• /
• 2009

축소시스템은 반복적인 계산이 요구되는 문제에서 매우 유용하게 적용될 수 있는 해석 기법이다. 최근에는 영역분할 기법과의 연동을 통해 축소시스템의 효율성이 향상되었다. 그러나 전체 도메인이 몇 개의 영역으로 분할될 때 구속조건이 부과되지 않는 영역이 만들어지게 된다. 각 부영역에서 축소시스템을 구축하기 위해서는 주자유도가 선정되어야 하고, 이를 위해서는 리츠벡터를 추출해야 한다. 리츠벡터 계산은 구속조건이 부과된 부영역에서는 일반적인 정적해석을 통해 가능하나, 경계조건이 부과되지 않은 부영역에서는 의사역행렬을 이용해야 한다. 일반적으로 의사역행렬의 사용은 상당한 계산시간과 전산자원을 필요로 하는 문제점이 있다. 본 연구에서는 이 문제점을 개선하기 위해 축소 의사역행렬 도입을 제안한다. 이 방법은 정적 축소방법을 기초로 축소 의사역행렬을 구축하여 축소된 리츠벡터 정보를 추출하고, 변환관계를 통해 전체 리츠벡터 정보를 구한다. 수치예제에서는 일반적인 의사역행렬 계산시간 및 고유치 해석 결과의 비교를 통해 제안방법의 효율성과 신뢰성을 검증한다.