• Title/Summary/Keyword: minimizing matrix

Search Result 144, Processing Time 0.023 seconds

A Greedy Algorithm for Minimum Power Broadcast in Wireless Networks (무선 네트워크에서 최소전력 브로드캐스트를 위한 탐욕 알고리즘)

  • Lee, Dong-ho;Jang, Kil-woong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.641-644
    • /
    • 2016
  • Unlike wired networks, broadcasting in wireless networks can transmit data at once to several nodes with a single transmission. For omnidirectional broadcast to a node in wireless networks, all adjacent nodes receive the data at the same time. In this paper, we propose a greedy algorithm to solve the minimum power broadcasting problem of minimizing the total transmit power on broadcasting in wireless networks. We apply two matrices to the proposed algorithm: one is a distance matrix that represents the distance between each node, the other is an adjacency matrix having the number of adjacency nodes. Among the nodes that receive the data, a node that has the greatest number of the adjacent node transmits data to neighbor preferential. We compare the performance of the proposed algorithm with random method through computer simulation in terms of transmitting power of nodes. Experiment results show that the proposed algorithm outperforms better than the random method.

  • PDF

An Investigation of Interfacial Strength in Epoxy-based Solid Polymer Electrolytes for Structural Composite Batteries

  • Mohamad A. Raja;Su Hyun Lim;Doyun Jeon;Hyunsoo Hong;Inyeong Yang;Sanha Kim;Seong Su Kim
    • Composites Research
    • /
    • v.36 no.6
    • /
    • pp.416-421
    • /
    • 2023
  • Multifunctional composite materials capable of both load-carrying and energy functions are promising innovative candidates for the advancement of contemporary technologies owing to their relative feasibility, cost-effectiveness, and optimized performance. Carbon fiber (CF)-based structural batteries utilize the graphitic inherent structure to enable the employment of carbon fibers as electrodes, current collectors, and reinforcement, while the matrix system is an ion-conduction and load transfer medium. Although it is possible to enhance performance through the modification of constituents, there remains a need for a systematic design methodology scheme to streamline the commercialization of structural batteries. In this work, a bi-phasic epoxy-based ionic liquid (IL) modified structural battery electrolyte (SBE) was developed via thermally initiated phase separation. The polymer's morphological, mechanical, and electrochemical characteristics were studied. In addition, the interfacial shear strength (IFSS) between CF/SBE was investigated via microdroplet tests. The results accentuated the significance of considering IFSS and matrix plasticity in designing composite structural batteries. This approach is expected to lay the foundation for realizing smart structures with optimized performance while minimizing the need for extensive trial and error, by paving the way for a streamlined computational design scheme in the future.

The Estimation Model of an Origin-Destination Matrix from Traffic Counts Using a Conjugate Gradient Method (Conjugate Gradient 기법을 이용한 관측교통량 기반 기종점 OD행렬 추정 모형 개발)

  • Lee, Heon-Ju;Lee, Seung-Jae
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.1 s.72
    • /
    • pp.43-62
    • /
    • 2004
  • Conventionally the estimation method of the origin-destination Matrix has been developed by implementing the expansion of sampled data obtained from roadside interview and household travel survey. In the survey process, the bigger the sample size is, the higher the level of limitation, due to taking time for an error test for a cost and a time. Estimating the O-D matrix from observed traffic count data has been applied as methods of over-coming this limitation, and a gradient model is known as one of the most popular techniques. However, in case of the gradient model, although it may be capable of minimizing the error between the observed and estimated traffic volumes, a prior O-D matrix structure cannot maintained exactly. That is to say, unwanted changes may be occurred. For this reason, this study adopts a conjugate gradient algorithm to take into account two factors: estimation of the O-D matrix from the conjugate gradient algorithm while reflecting the prior O-D matrix structure maintained. This development of the O-D matrix estimation model is to minimize the error between observed and estimated traffic volumes. This study validates the model using the simple network, and then applies it to a large scale network. There are several findings through the tests. First, as the consequence of consistency, it is apparent that the upper level of this model plays a key role by the internal relationship with lower level. Secondly, as the respect of estimation precision, the estimation error is lied within the tolerance interval. Furthermore, the structure of the estimated O-D matrix has not changed too much, and even still has conserved some attributes.

Documents recommendation using large citation data (거대 인용 자료를 이용한 문서 추천 방법)

  • Chae, Minwoo;Kang, Minsoo;Kim, Yongdai
    • Journal of the Korean Data and Information Science Society
    • /
    • v.24 no.5
    • /
    • pp.999-1011
    • /
    • 2013
  • In this research, we propose a document recommendation method which can find documents that are relatively important to a specific document based on citation information. The key idea is parameter tuning in the Neumann kernal which is an intermediate between a measure of importance (HITS) and of relatedness (co-citation). Our method properly selects the tuning parameter ${\gamma}$ in the Neumann kernal minimizing the prediction error in future citation. We also discuss some comutational issues needed for analysing large citation data. Finally, results of analyzing patents data from the US Patent Office are given.

A dual approach to perform geometrically nonlinear analysis of plane truss structures

  • Habibi, AliReza;Bidmeshki, Shaahin
    • Steel and Composite Structures
    • /
    • v.27 no.1
    • /
    • pp.13-25
    • /
    • 2018
  • The main objective of this study is to develop a dual approach for geometrically nonlinear finite element analysis of plane truss structures. The geometric nonlinearity is considered using the Total Lagrangian formulation. The nonlinear solution is obtained by introducing and minimizing an objective function subjected to displacement-type constraints. The proposed method can fully trace the whole equilibrium path of geometrically nonlinear plane truss structures not only before the limit point but also after it. No stiffness matrix is used in the main approach and the solution is acquired only based on the direct classical stress-strain formulations. As a result, produced errors caused by linearization and approximation of the main equilibrium equation will be eliminated. The suggested algorithm can predict both pre- and post-buckling behavior of the steel plane truss structures as well as any arbitrary point of equilibrium path. In addition, an equilibrium path with multiple limit points and snap-back phenomenon can be followed in this approach. To demonstrate the accuracy, efficiency and robustness of the proposed procedure, numerical results of the suggested approach are compared with theoretical solution, modified arc-length method, and those of reported in the literature.

A Solution for Sourcing Decisions under Supply Capacity Risk (공급능력 리스크를 고려한 최적 구매계획 해법)

  • Jang, Won-Jun;Park, Yang-Byung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.42 no.1
    • /
    • pp.38-49
    • /
    • 2016
  • This paper proposes a mathematical model-based solution for sourcing decisions with an objective of minimizing the manufacturer's total cost in the two-echelon supply chain with supply capacity risk. The risk impact is represented by uniform, beta, and triangular distributions. For the mathematical model, the probability vector of normal, risk, and recovery statuses are developed by using the status transition probability matrix and the equations for estimating the supply capacity under risk and recovery statuses are derived for each of the three probability distributions. Those formulas derived are validated using the sampling method. The results of the simulation study on the test problem show that the sourcing decisions using the proposed solution reduce the total cost by 1.6~3.7%, compared with the ones without a consideration of supply capacity risk. The total cost reduction increases approximately in a linear fashion as the probability of risk occurrence or reduction rate of supply capacity due to risk events is increased.

Multirate Sampled-Data Control System: Optimal Digital Redesign Approach (멀티레이트 샘플치 시스템: 최적 디지털 재설계 기법)

  • Kim, Do-Wan;Park, Jin-Bae;Jang, Kwon-Kyu;Joo, Young-Hoon
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.708-710
    • /
    • 2004
  • This paper studies a multirate sampled-data control for LTI systems by using the digital redesign (DR) method. In this note, to well tackle the problem associated with both the state matching and the stabilization, our nobel strategy is to minimize the linear quadratic cost function. The main features of the proposed method are that i) the delta-operator-based descretization method is applied to improve the state-matching performance in the fast sampling limit and/or the large input multiplicity; ii) the proposed multirate control scheme can improve the state-matching performance in the long sampling limit; iii) some sufficient conditions that guarantee the stability of the closed-loop discrete-time system and provide a guarantee cost for the cost function can be formulated in the LMIs format; and iv) an optimal sampled-data controller in the sense of minimizing the upper bound of the cost function is also given by means of an LMI optimization procedure.

  • PDF

ARMA System identification Using GTLS method and Recursive GTLS Algorithm (GTLS의 ARMA시트템식별에의 적용 및 적응 GTLS 알고리듬에 관한 연구)

  • Kim, Jae-In;Kim, Jin-Young;Rhee, Tae-Won
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.3
    • /
    • pp.37-48
    • /
    • 1995
  • This paper presents an sstimation of ARMA coefficients of noisy ARMA system using generalized total least square (GTLS) method. GTLS problem for ARMA system is defined as minimizing the errors between the noisy output vectors and estimated noisy-free output. The GTLS problem is solved in closed form by eigen-problem and the perturbation analysis of GTLS is presented. Also its recursive solution (recursive GTLS) is proposed using the power method and the covariance formula of the projected output error vector into the input vector space. The simulation results show that GTLS ARMA coefficients estimator is an unbiased estimator and that recursive GTLS achieves fast convergence.

  • PDF

Fast Sequential Optimal Normal Bases Multipliers over Finite Fields (유한체위에서의 고속 최적정규기저 직렬 연산기)

  • Kim, Yong-Tae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.8
    • /
    • pp.1207-1212
    • /
    • 2013
  • Arithmetic operations over finite fields are widely used in coding theory and cryptography. In both of these applications, there is a need to design low complexity finite field arithmetic units. The complexity of such a unit largely depends on how the field elements are represented. Among them, representation of elements using a optimal normal basis is quite attractive. Using an algorithm minimizing the number of 1's of multiplication matrix, in this paper, we propose a multiplier which is time and area efficient over finite fields with optimal normal basis.

A Maintenance Design of Connected-(r, s)-out-of-(m, n) F System Using Simulated Annealing (시뮬레이티드 어닐링을 이용한(m, n)중 연속(r,s) : F 시스템의 정비모형)

  • Lee, Sangheon;Kang, Youngtai;Shin, Dongyeul
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.34 no.1
    • /
    • pp.98-107
    • /
    • 2008
  • The purpose of this paper is to present an optimization scheme that aims at minimizing the expected cost per unittime. This study considers a linear connected-(r, s)-ouI-of-(m, n):f lattice system whose components are orderedlike the elements of a linear (m, n)-matrix. We assume that all components are in the state 1 (operating) or 0(failed) and identical and s-independent. The system fails whenever at least one connected (r, s)-submatrix offailed components occurs. To find the optimal threshold of maintenance intervention, we use a simulatedannealing(SA) algorithm for the cost optimization procedure. The expected cost per unit time is obtained byMonte Carlo simulation. We also has made sensitivity analysis to the different cost parameters. In this study,utility maintenance model is constructed so that minimize the expense under full equipment policy throughcomparison for the full equipment policy and preventive maintenance policy. The full equipment cycle and unitcost rate are acquired by simulated annealing algorithm. The SA algorithm is appeared to converge fast inmulti-component system that is suitable to optimization decision problem.