• 한국재료학회지
• /
• 제24권11호
• /
• pp.617-624
• /
• 2014

To elucidate the effects of a pretreatment process on the uniformity of Ag electroless plating on Cu flakes, pretreatment time was mainly considered with a mixed solution of 0.15 M ammonium hydroxide and 0.0375 M ammonium sulphate. Optical inspection of Ag-coated Cu flakes determined that the optimal pretreatment time is 120 s. Repetition of the sequence in which Ag plating was done immediately after the pretreatment of 120 s clearly enhanced the plating uniformity. Scanning electron microscopy revealed that holes were formed irregularly on some Cu flakes during the period from the asdropping of an Ag precursor solution to 5 min. The hole formation was judged to be due to continuous removal of Cu on the local surfaces by the repetitive formation and elimination of $Cu_2O$ or $Cu(OH)_2$ layers. However, the increase of the amount of Ag coating suppressed the hole creation and increasingly enhanced the antioxidant property.

• 대한기계학회논문집A
• /
• 제26권2호
• /
• pp.406-414
• /
• 2002

A new approach, referred to as a successive zooming genetic algorithm (SZGA), is Proposed for identifying a global solution for continuous optimization problems. In order to improve the local fine-tuning capability of GA, we introduced a new method whereby the search space is zoomed around the design point with the best fitness per 100 generation. Furthermore, the reliability of the optimized solution is determined based on the theory of probability. To demonstrate the superiority of the proposed algorithm, a simple genetic algorithm, micro genetic algorithm, and the proposed algorithm were tested as regards for the minimization of a multiminima function as well as simple functions. The results confirmed that the proposed SZGA significantly improved the ability of the algorithm to identify a precise global minimum. As an example of structural optimization, the SZGA was applied to the optimal location of support points for weight minimization in the radial gate of a dam structure. The proposed algorithm identified a more exact optimum value than the standard genetic algorithms.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 B
• /
• pp.528-530
• /
• 1999

This paper addresses the analysis and design of fuzzy control systems for a class of complex single input single output nonlinear systems. Firstly, the nonlinear system is represented by well-known Takagai-Sugeno (TS) fuzzy model and the global controller is constructed by compensating each linear model in the rule of TS fuzzy model. The design of conventional TS fuzzy-model-based controller usually is composed of two processes. One is to determine static state feedback gain of each local model and the other is to validate the stability of the designed fuzzy controller. In this paper, we propose an alternative of the design of TS fuzzy-model-based controller. The design scheme is based on the extension of conventional optimal control theory to the design of TS fuzzy-model-based controller. By using the proposed method the design and stability analysis of the TS fuzzy model-based controller is reduced to the problem of finding the solution of a set of algebraic Riccati equations. And we use the recently developed interior point method to find the solution of AREs, where AREs are recast as the LMI formulation. One simulation example is given to show the effectiveness and feasibility of the proposed fuzzy controller design method.

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

With the recent popularity of smart terminals, the demand for high-data-rate transmission is growing rapidly, which brings a new challenge for the traditional cellular networks. Both device-to-device (D2D) communication and small cells are effective to improve the transmission efficiency of local communication. In this paper, we apply D2D communication into a small cell network system (SNets) and study about the optimization problem of resource allocation for D2D communication. The optimization problem includes system scheduling and resource allocation, which is exponentially complex and the optimal solution is infeasible to achieve. Therefore, in this paper, the optimization problem is decomposed into several smaller problems and a hierarchical scheme is proposed to obtain the solution. The proposed hierarchical scheme consists of three steps: D2D communication groups formation, the estimation of sub-channels needed by each D2D communication group and specific resource allocation. From numerical simulation results, we find that the proposed resource allocation scheme is effective in improving the spectral efficiency and reducing the outage probability of D2D communication.

• Journal of Communications and Networks
• /
• 제9권2호
• /
• pp.112-117
• /
• 2007

In this paper, we focus on the total transmission power minimization problem for downlink beamforming multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems while ensuring each user's QoS requirement. Although the linear integer programming (LIP) solution we formulate provides the performance upper bound of the margin adaptive (MA) optimization problem, it is hard to be implemented in practice due to its high computational complexity. By regarding each user's equivalent channel gain as approximate independent values and using iterative descent method, we present a heuristic MA resource allocation algorithm. Simulation results show that the proposed algorithm efficiently converges to the local optimum, which is very close to the performance of the optimal LIP solution. Compared with existing space division multiple access (SDMA) OFDM systems with or without adaptive resource allocation, the proposed algorithm achieves significant performance improvement by exploiting the frequency diversity and multi-user diversity in downlink multiple-input single-output (MISO) OFDM systems.

• Industrial Engineering and Management Systems
• /
• 제10권4호
• /
• pp.272-278
• /
• 2011

Decision tree as a classification tool is being used successfully in many areas such as medical diagnosis, customer churn prediction, signal detection and so on. The main advantage of decision tree classifiers is their capability to break down a complex structure into a collection of simpler structures, thus providing a solution that is easy to interpret. Since decision tree is a top-down algorithm using a divide and conquer induction process, there is a risk of reaching a local optimal solution. This paper proposes a procedure of optimally determining thresholds of the chosen variables for a decision tree using an adaptive particle swarm optimization (APSO). The proposed algorithm consists of two phases. First, we construct a decision tree and choose the relevant variables. Second, we find the optimum thresholds simultaneously using an APSO for those selected variables. To validate the proposed algorithm, several artificial and real datasets are used. We compare our results with the original CART results and show that the proposed algorithm is promising for improving prediction accuracy.

• 대한수학회지
• /
• 제54권5호
• /
• pp.1483-1504
• /
• 2017

We consider weak solutions of the instationary Navier-Stokes system in a smooth bounded domain ${\Omega}{\subset}{\mathbb{R}}^3$ with initial value $u_0{\in}L^2_{\sigma}({\Omega})$. It is known that a weak solution is a local strong solution in the sense of Serrin if $u_0$ satisfies the optimal initial value condition $u_0{\in}B^{-1+3/q}_{q,s_q}$ with Serrin exponents $s_q$ > 2, q > 3 such that ${\frac{2}{s_q}}+{\frac{3}{q}}=1$. This result has recently been generalized by the authors to weighted Serrin conditions such that u is contained in the weighted Serrin class ${{\int}_0^T}({\tau}^{\alpha}{\parallel}u({\tau}){\parallel}_q)^s$ $d{\tau}$ < ${\infty}$ with ${\frac{2}{s}}+{\frac{3}{q}}=1-2{\alpha}$, 0 < ${\alpha}$ < ${\frac{1}{2}}$. This regularity is guaranteed if and only if $u_0$ is contained in the Besov space $B^{-1+3/q}_{q,s}$. In this article we consider the limit case of initial values in the Besov space $B^{-1+3/q}_{q,{\infty}}$ and in its subspace ${{\circ}\atop{B}}^{-1+3/q}_{q,{\infty}}$ based on the continuous interpolation functor. Special emphasis is put on questions of uniqueness within the class of weak solutions.

• 정보처리학회논문지B
• /
• 제11B권7호
• /
• pp.841-848
• /
• 2004

진화 알고리즘은 여러 개의 상충하는 목적을 갖는 다목적 최적화 문제를 해결하기에 적합한 방법이다. 특히, 파레토 지배관계에 기초하여 개체의 적합도를 평가하는 파레토 기반 진화알고리즘들은 그 성능에 있어서 비교적 우수한 평가를 받고 있다. 그러나 일반화된 다목적 최적화 진화알고리즘은 복잡한 문제들에서 찾아진 해들의 분포가 전체 파레토 경계면에 대하여 균일하지 못하고 특정 지역에서 집중적으로 해를 생성하는 문제점을 가지고 있다. 본 논문에서 우리는 이러한 문제점을 보완하기 위한 다목적 최적화 진화알고리즘을 제안한다. 제안한 알고리즘은 현재까지 찾아진 최적해들 중 특정 지역에 관중되지 않은 해를 우수 종자로 복제 연산에 참여시킨다. 따라서 특별한 지역탐색 기법을 사용하지 않아도 종자가 되는 개체 주위에 새로운 개체를 생성할 확률이 높기 때문에 지역탐색의 효과를 가질 수 있고, 비교적 고른 분포의 파레토 최적 해를 생성한 수 있다. 5개의 테스트 함수에 대한 실험 결과, 제안한 알고리즘은 모든 문제에서 전체 파레토 경계면에 균일한 분포의 해들을 생성할 수 있었으며, 많은 지역해를 가지는 문제를 제외한 모든 문제에서 NSGA-II보다 우수한 수렴 결과를 보였다.

• 대한전자공학회논문지SD
• /
• 제40권5호
• /
• pp.298-311
• /
• 2003

Iterative Fourier transform algorithm (IFTA)은 회절광학소자 (DOE)의 위상 분포를 구하기 위한 반복적 수치 해석 알고리즘으로서 회절광학소자의 위상 분포는 반복 과정을 통하여 국소 최적해로 수렴하게 된다. Ink의 수렴은 위상 분포 초기치, 관측면에서의 자유도의 허용 범위 및 알고리즘에 내재된 매개 변수들의 설정 값에 영향을 받는다. 본 논문에서는 IFTA의 내부적 매개 변수인 완화 변수(relaxation parameter)가 IFTA의 수렴에 미치는 영향을 분석하고 이를 토대로 보다 정확한 최적화 해를 얻기 위한 유전 알고리즘과 IFTA의 하이브리드 알고리즘을 제안한다.

• 전자공학회논문지CI
• /
• 제41권3호
• /
• pp.11-16
• /
• 2004

최근 이질적인 분산 컴퓨팅 환경 상에서의 공동 작업들이 나날이 늘어나고 있다. 고속의 원거리 네트워크의 유용성 (availability)은 화상 회의, 분산된 대화식의 시뮬레이션, 그리고 공동의 시각화(collaborative visualization)와 같은 공동의 멀티미디어 응용들을 가능하게 하였다. 이와 같은 응용들과 분산된 고성능 컴퓨팅에서의, 효율적인 그룹 통신은 매우 중요하다. 일반적인 그룹 통신으로는 브로드캐스트, 멀티캐스트 등이 있다. 기존의 FEF, ECEF, look-ahead 와 같은 휴리스틱 알고리즘들은 이러한 이질적 분산 시스템에서의 브로드캐스트와 멀티캐스트를 위한 메시지 전송 트리를 구성하여 준다. 하지만 이러한 알고리즘들은 각 단계에서의 최적의 해를 선택하기 때문에 지역적 최적해(local optimum)에 빠질 수 있는 단점이 있다. 본 논문에서는 노드와 네트워크 모두가 이질적인 기존의 통신 모델 상에서 보다 효율적인 집합적 연산을 위한 트리를 구성해주는 개선된 브로드캐스트 알고리즘을 제안한다. 기존의 휴리스틱 알고리즘들이 지역적 최적해에 빠질 수 있는 점을 감안하여, 보다 합리적이고, 유용성 있는 edge 선택 기준을 제시하였다. 여러 가지 통신비용에 대한 성능 평가를 통하여, 개선된 휴리스틱 알고리즘은 기존의 알고리즘보다 적은 완료 시간을 가지며, 특히 look-ahead 알고리즘보다 낮은 계산 복잡도를 가지는 장점을 가짐을 알 수 있다.