• 소성∙가공
• /
• 제26권1호
• /
• pp.28-34
• /
• 2017

Multi-pass shape rolling is performed to produce long products of arbitrary cross-sectional shapes. In the past, the multi-pass shape rolling process has been designed by the trial and error method or the experience of experts based on the empirical approach. Particularly, the design of roll caliber in shape rolling is important to improve product quality and dimensional accuracy. In this paper, the caliber design and pass schedule of multi-pass shape rolling were proposed for manufacturing piston ring wire. In order to design roll caliber, major shape parameter and dimension was determined by analysis of various caliber design. FE-simulation was conducted to verify effectiveness of proposed process design. At first, forming simulation was performed to predict shape of the product. Then, fracture of the wire was evaluated by critical damage value using normalized Cockcroft-Latham criteria. The experiment was carried out and the results are within the allowable tolerance.

• Smart Structures and Systems
• /
• 제25권3호
• /
• pp.345-368
• /
• 2020

The present work proposes a self-controlled multi-stage optimization method for damage identification of structures utilizing standard particle swarm optimization (PSO) algorithm. Damage identification problem is formulated as an inverse optimization problem where damage severity in each element of the structure is considered as optimization variables. An efficient objective function is formed using the first few frequencies and mode shapes of the structure. This objective function is minimized by a self-controlled multi-stage strategy to identify and quantify the damage extent of the structural members. In the first stage, standard PSO is utilized to get an initial solution to the problem. Subsequently, the algorithm identifies the most damage-prone elements of the structure using an adaptable threshold value of damage severity. These identified elements are included in the search space of the standard PSO at the next stage. Thus, the algorithm reduces the dimension of the search space and subsequently increases the accuracy of damage prediction with a considerable reduction in computational cost. The efficiency of the proposed method is investigated and compared with available results through three numerical examples considering both with and without noise. The obtained results demonstrate the accuracy of the present method can accurately estimate the location and severity of multi-damage cases in the structural systems with less computational cost.

• 정보처리학회논문지B
• /
• 제16B권1호
• /
• pp.63-70
• /
• 2009

BCI 기술은 생체신호인 뇌파를 수집하여 신호처리를 거친 후 실질적인 기기제어 및 통신 시스템 등을 제어하는 시스템 관련 기술이다. BCI 시스템 구현을 위해서는 뇌파의 특성을 실시간으로 분석하여 학습 시키고 학습된 뇌파의 특성을 적용하는 단계가 요구된다. 본 논문에서는 EEG 데이터를 효율적으로 분석하기 위해 점진적으로 갱신되는 주성분 분석을 이용하여 왼손/오른손 동작에 영향을 미치는 EEG 신호의 특징을 찾고, 이를 반영하여 데이터의 차원을 축소한다. 입력 자료의 특징을 충분히 포함하면서 낮은 차원을 가지는 데이터를 이용한다면 분류를 위한 계산량을 감소시킬 수 있을 뿐만 아니라 불필요한 특징을 제거함으로써 분류 성능을 향상 시킬 수 있다. 본 논문에서는 점진적으로 갱신되는 주성분 분석을 이용하여 데이터의 차원을 축소하고 이에 대한 효율성을 검증하기 위해 K-NN분류기를 이용하여 분류 정확도 측정을 수행하였다. 그 결과 주성분 분석을 이용하여 특징을 추출하고 분류율을 측정한 경우보다 평균 5% 높은 분류 정확율을 보였다.

• 대한한의진단학회지
• /
• 제11권2호
• /
• pp.96-115
• /
• 2007

Background and Purpose: Electroencephalogram(EEG) is a multi-scaled signal consisting of several components of time series with different origins. Recently, because of the absence of an identified metric which quantifies the complex amount of information, there are many limitations in using such a linear method. According to chaos theory, irregular signals of EEG can also result from low dimensional deterministic chaos. Chaotic nonlinear dynamics in the EEG can be studied by calculating the correlation dimension. The aim of this study is to analyze correlation between the correlation dimension of EEG and psychological Test (TCI). Methods: Before and after moxibustion treatment, EEG raw data were measured by moving windows during 15 minutes. The correlation dimension(D2) was calculated from stabilized 40 seconds in 15 minutes data. 8 channels EEG study on the Fp, F, T, P was carried out in 30 subjects. Results: Correlation analysis of TCI test is calculated with deterministic non-linear data and stochastic non-linear data. 1. Novelty seeking in temperament is positive correlated with D2 of EEG on Fp. 2. reward dependence in temperament is positive correlated with D2 of EEG on T3,T4 and negative correlated with D2 of EEG on P3,P4. 3. self directedness in character is positive correlated with D2 of EEG on F4, P3. 4. Harm avoidance is negative correlated with D2 of EEG on Fp2, T3, P3. Conclusion: These results suggest that nonlinear analysis of EEG can quantify dynamic state of brain abolut psychological Test (TCI).

• Journal of Computing Science and Engineering
• /
• 제1권2호
• /
• pp.177-194
• /
• 2007

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1693-1713
• /
• 2018

An important technique used by database administrators (DBAs) is to improve performance in decision-support workloads associated with a Star schema is multi-level partitioning. Queries will then benefit from performance improvements via partition elimination, due to constraints on queries expressed on the dimension tables. As the task of multi-level partitioning can be overwhelming for a DBA we are proposing a wizard that facilitates the task by calculating a partitioning scheme for a particular workload. The system resides completely on a client and interacts with the costing estimation subsystem of the query optimizer via an API over the network, thereby eliminating any need to make changes to the optimizer. In addition, since only cost estimates are needed the wizard overhead is very low. By using a greedy algorithm for search space enumeration over the query predicates in the workload the wizard is efficient with worst-case polynomial complexity. The technology proposed can be applied to any clustering or partitioning scheme in any database management system that provides an interface to the query optimizer. Applied to the Teradata database the technology provides recommendations that outperform a human expert's solution as measured by the total execution time of the workload. We also demonstrate the scalability of our approach when the fact table (and workload) size increases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.921-940
• /
• 2015

In this paper, we investigate the multi-resource allocation problem, a unique feature of which is that the multiple resources can compensate each other while achieving the desired system performance. In particular, power and time allocations are jointly optimized with the target of energy efficiency under the resource-limited constraints. Different from previous studies on the power-time tradeoff, we consider a multi-server case where the concurrent serving users are quantitatively restricted. Therefore user selection is investigated accompanying the resource allocation, making the power-time tradeoff occur not only between the users in the same server but also in different servers. The complex multivariate optimization problem can be modeled as a variant of 2-Dimension Bin Packing Problem (V2D-BPP), which is a joint non-linear and integer programming problem. Though we use state decomposition model to transform it into a convex optimization problem, the variables are still coupled. Therefore, we propose an Iterative Dual Optimization (IDO) algorithm to obtain its optimal solution. Simulations show that the joint multi-resource allocation algorithm outperforms two existing non-joint algorithms from the perspective of energy efficiency.

• 한국산학기술학회논문지
• /
• 제11권4호
• /
• pp.1278-1284
• /
• 2010

이 논문에서는 TFT-LCD의 제조공정에서 발생하는 mura를 효율적으로 검출하는 multi-point FFT를 기반으로 한, 2차원 FFT를 이용하는 새로운 전기적인 검출 방식을 제안한다. TFT-LCD의 mura 패턴은 어느 일정한 영역을 갖고 있으므로 어느 한 라인에서 관찰하면 sin 파의 모양으로 관찰된다. Mura의 모양은 원, 가로 타원, 세로 타원으로 분류할 수 있으며 2-D FFT 변환을 통하여 일정한 문턱치와 비교하면 mura를 쉽게 검출할 수 있음을 보인다. 실험영상의 simulation을 통하여 제안 알고리즘이 다양한 크기의 mura 패턴을 효과적으로 검출할 수 있음을 보였다. 따라서 제안된 알고리즘은 TFT-LCD mura의 자동 검사 시스템에 이용될 수 있을 것이다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권5호
• /
• pp.2275-2293
• /
• 2020

This paper focuses on the simplified receiver design for multi-user circular block oversampled filter bank (CB-OSFB) uplink systems. Through application of discrete Fourier transform (DFT), the special banded structure and circular properties of the modulation matrix in the frequency domain of each user are derived. By exploiting the newly derived properties, a simplified zero-forcing (ZF) receiver is proposed for multi-user CB-OSFB uplink systems in the multipath channels. In the proposed receiver, the matrix inversion operation of the large dimension multi-user equivalent channel matrix is transformed into DFTs and smaller size matrix inversion operations. Simulation is given to show that the proposed ZF receiver can dramatically reduce the computational complexity while with almost the same symbol error rate as that of the traditional ZF receiver.

• Nuclear Engineering and Technology
• /
• 제41권10호
• /
• pp.1347-1360
• /
• 2009

A multi-dimensional component for the thermal-hydraulic system analysis code, MARS, was developed for a more realistic three-dimensional analysis of nuclear systems. A three-dimensional and two-fluid model for a two-phase flow in Cartesian and cylindrical coordinates was employed. The governing equations and physical constitutive relationships were extended from those of a one-dimensional version. The numerical solution method adopted a semi-implicit and finite-difference method based on a staggered-grid mesh and a donor-cell scheme. The relevant length scale was very coarse compared to commercial computational fluid dynamics tools. Thus a simple Prandtl's mixing length turbulence model was applied to interpret the turbulent induced momentum and energy diffusivity. Non drag interfacial forces were not considered as in the general nuclear system codes. Several conceptual cases with analytic solutions were chosen and analyzed to assess the fundamental terms. RPI air-water and UPTF 7 tests were simulated and compared to the experimental data. The simulation results for the RPI air-water two-phase flow experiment showed good agreement with the measured void fraction. The simulation results for the UPTF downcomer test 7 were compared to the experiment data and the results from other multi-dimensional system codes for the ECC delivery flow.