• Title/Summary/Keyword: cost matrix

Search Result 642, Processing Time 0.038 seconds

Relay Selection Based on Rank-One Decomposition of MSE Matrix in Multi-Relay Networks

  • Bae, Young-Taek;Lee, Jung-Woo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2010.07a
    • /
    • pp.9-11
    • /
    • 2010
  • Multiple-input multiple-output (MIMO) systems assisted by multi-relays with single antenna are considered. Signal transmission consists of two hops. In the first hop, the source node broadcasts the vector symbols to all relays, then all relays forward the received signals multiplied by each power gain to the destination simultaneously. Unlike the case of full cooperation between relays such as single relay with multiple antennas, in our case there is no closed form solution for optimal relay power gain with respect to minimum mean square error (MMSE). Thus we propose an alternative approach in which we use an approximation of the cost function based on rank-one matrix decomposition. As a cost function, we choose the trace of MSE matrix. We give several simulation results to validate that our proposed method obtains a negligible performance loss compared to optimal solution obtained by exhaustive search.

  • PDF

Receding Horizon $H_{\infty}$ Predictive Control for Linear State-delay Systems

  • Lee, Young-Sam
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.2081-2086
    • /
    • 2005
  • This paper proposes the receding horizon $H_{\infty}$ predictive control (RHHPC) for systems with a state-delay. We first proposes a new cost function for a finite horizon dynamic game problem. The proposed cost function includes two terminal weighting terns, each of which is parameterized by a positive definite matrix, called a terminal weighting matrix. Secondly, we derive the RHHPC from the solution to the finite dynamic game problem. Thirdly, we propose an LMI condition under which the saddle point value satisfies the well-known nonincreasing monotonicity. Finally, we shows the asymptotic stability and $H_{\infty}$-norm boundedness of the closed-loop system controlled by the proposed RHHPC. Through a numerical example, we show that the proposed RHHC is stabilizing and satisfies the infinite horizon $H_{\infty}$-norm bound.

  • PDF

Feasibility Study to Apply Automated Trench Cutter (지하연속벽 공법 자동화 도입 타당성 검토)

  • Park, Kyoung-Soon;Koo, Ja-Kyung;Lee, Tai-Sik
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • 2007.11a
    • /
    • pp.364-367
    • /
    • 2007
  • According to increase of construction projects which is accomplished in the town, diaphragm wall method was proposed. This method diminished noise and vibration. And it is able to excavate deeper than other methods. But excavation work is difficult to maintain vertical and requires much time to work. Also the work result depends on know-how, experience and intuition of excavating machine operator. We interviewed technical experts related with slurry wall method and find equipment's characteristics. We used cost-concern matrix to investigate the propriety for the introduction of trench cutter automation. Through the research, it is proper to apply trench cutter automation.

  • PDF

Design of Ternary Logic Circuits Based on Reed-Muller Expansions (Reed-Muller 전개식에 의한 3치 논리회로의 설계)

  • Seong, Hyeon-Kyeong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.3
    • /
    • pp.491-499
    • /
    • 2007
  • In this paper, we present a design method of the ternary logic circuits based on Reed-Muller expansions. The design method of the presented ternary logic circuits checks the degree of each variable for the coefficients of Reed-Holler Expansions(RME) and determines the order of optimal control input variables that minimize the number of Reed-Muller Expansions modules. The order of optimal control input variables is utilized the computation of circuit cost matrix. The ternary logic circuits of the minimized tree structures to be constructed by RME modules based on Reed-Muller Expansions are realized using the computation results of its circuit cost matrix. This method is only performed under unit time in order to search for the optimal control input variables. Also, this method is able to be programmed by computer and the run time on programming is $3^n$.

Robust Non-negative Matrix Factorization with β-Divergence for Speech Separation

  • Li, Yinan;Zhang, Xiongwei;Sun, Meng
    • ETRI Journal
    • /
    • v.39 no.1
    • /
    • pp.21-29
    • /
    • 2017
  • This paper addresses the problem of unsupervised speech separation based on robust non-negative matrix factorization (RNMF) with ${\beta}$-divergence, when neither speech nor noise training data is available beforehand. We propose a robust version of non-negative matrix factorization, inspired by the recently developed sparse and low-rank decomposition, in which the data matrix is decomposed into the sum of a low-rank matrix and a sparse matrix. Efficient multiplicative update rules to minimize the ${\beta}$-divergence-based cost function are derived. A convolutional extension of the proposed algorithm is also proposed, which considers the time dependency of the non-negative noise bases. Experimental speech separation results show that the proposed convolutional RNMF successfully separates the repeating time-varying spectral structures from the magnitude spectrum of the mixture, and does so without any prior training.

Vibration analysis of rotating beam with variable cross section using Riccati transfer matrix method

  • Feyzollahzadeh, Mahdi;Bamdad, Mahdi
    • Structural Engineering and Mechanics
    • /
    • v.70 no.2
    • /
    • pp.199-207
    • /
    • 2019
  • In this paper, a semi-analytical method will be discussed for free vibration analysis of rotating beams with variable cross sectional area. For this purpose, the rotating beam is discretized through applying the transfer matrix method and assumed the axial force is constant for each element. Then, the transfer matrix is derived based on Euler-Bernoulli's beam differential equation and applying boundary conditions. In the following, the frequencies of the rotating beam with constant and variable cross sections are determined using the transfer matrix method in several case studies. In order to eliminate numerical difficulties in the transfer matrix method, the Riccati transfer matrix is employed for high rotation speed and high modes. The results are compared with the results of the finite elements method and Rayleigh-Ritz method which show good agreement in spite of low computational cost.

Frequency domain elastic full waveform inversion using the new pseudo-Hessian matrix: elastic Marmousi-2 synthetic test (향상된 슈도-헤시안 행렬을 이용한 탄성파 완전 파형역산)

  • Choi, Yun-Seok;Shin, Chang-Soo;Min, Dong-Joo
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.329-336
    • /
    • 2007
  • For scaling of the gradient of misfit function, we develop a new pseudo-Hessian matrix constructed by combining amplitude field and pseudo-Hessian matrix. Since pseudo- Hessian matrix neglects the calculation of the zero-lag auto-correlation of impulse responses in the approximate Hessian matrix, the pseudo-Hessian matrix has a limitation to scale the gradient of misfit function compared to the approximate Hessian matrix. To validate the new pseudo- Hessian matrix, we perform frequency-domain elastic full waveform inversion using this Hessian matrix. By synthetic experiments, we show that the new pseudo-Hessian matrix can give better convergence to the true model than the old one does. Furthermore, since the amplitude fields are intrinsically obtained in forward modeling procedure, we do not have to pay any extra cost to compute the new pseudo-Hessian. We think that the new pseudo-Hessian matrix can be used as an alternative of the approximate Hessian matrix of the Gauss-Newton method.

  • PDF

One-to-One Mapping Algorithm between Matrix Star Graphs and Half Pancake Graphs (행렬스타 그래프와 하프 팬케익 그래프 사이의 일대일 사상 알고리즘)

  • Kim, Jong-Seok;Yoo, Nam-Hyun;Lee, Hyeong-Ok
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.4
    • /
    • pp.430-436
    • /
    • 2014
  • Matrix-star and Half-Pancake graphs are modified versions of Star graphs, and has some good characteristics such as node symmetry and fault tolerance. This paper analyzes embedding between Matrix-star and Half-Pancake graphs. As a result, Matrix-star graphs $MS_{2,n}$ can be embedded into Half-Pancake graphs $HP_{2n}$ with dilation 5 and expansion 1. Also, Half Pancake Graphs, $HP_{2n}$ can be embedded into Matrix Star Graphs, $MS_{2,n}$ with the expansion cost, O(n). This result shows that algorithms developed from Star Graphs can be applied at Half Pancake Graphs with additional constant cost because Star Graphs, $S_n$ is a part graph of Matrix Star Graphs, $MS_{2,n}$.

Fire District Adjustment for Improving Fire Service Vulnerable Areas in Jinju (진주시 소방서비스 취약지역 개선을 위한 소방권역 조정)

  • Yoo, Hwan Hee;Koo, Seul
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.21 no.1
    • /
    • pp.19-26
    • /
    • 2013
  • This study analyzed the vulnerable areas to the fire service in regard to 119 safety centers, currently established in Jinju city. In this study, the district of fire was examined through the analysis of the OD cost matrix to find the transference or increase methods of the existing centers for improving the fire services. The study results demonstrate that the numbers of 119 safety centers were lacking in comparison with the areas of the administrative district in Jinju. In particular, relocation and the transference or increase of centers were required for the Cheonjeon 119 safety centers, which is the creation area of the National Industrial Complex among five 119 safety centers located in Jinju, and the fire service jurisdiction of Munsan 119 safety centers (including Banseong 119 regional unit), which is the location of a big fire risk due to the increase of population according to the development of the new town. In addition, the OD cost matrix analysis in this study reveals the fact that the time of fire service in the Jeonchon Industrial Complex, which is the significantly vulnerable area, will be reduced from 8 minutes to 3.3 minutes if the current Cheonjeon 119 safety center is moved to Gaho-dong. It indicates that the increase of safety centers in Geumsan-myeon areas, where the population has increased rapidly in recent days due to the development of the new town, is keenly needed.

Application of Systems Engineering based Design Structure Matrix Methodology for Optimizing the Concept Design Process of Naval Ship (함정 개념설계 프로세스 최적화를 위한 시스템엔지니어링 기반의 설계구조행렬 방법론 적용)

  • Park, Jinwon
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.56 no.1
    • /
    • pp.1-10
    • /
    • 2019
  • Naval ship design and related other activities can be characterized by the complexity of the interactions among products, activities, and disciplines. Such complexities often result in inferior designs, cost overrun, and late-delivery. Hence there exist tremendous interests in both improving the design process itself and optimizing the interactions among design activities. This paper looks at the complexity of designing naval ships thereby leading to the innovation of current ship design practices using design structure matrix. It can be used to induce the optimal ordering of design activities as well as identify sources of complexities. The method presented here identifies coupled design activities useful for reducing the complexity of naval ship design as well as optimally reordering design activities. This paper recommends the use of design structure matrix method suitable for numerically optimizing the concept design process of naval ship, and reducing cost and time required in designing naval ships by modeling and analyzing the design activities and engineering tasks, defined in systems engineering planning documents.