• Journal of Distribution Science
• /
• v.14 no.9
• /
• pp.25-29
• /
• 2016

Purpose - Finding top K persuaders in consumer network is an important problem in marketing. Recently, a new method of computing persuasion scores, interpreted as fixed point or stable distribution for given persuasion probabilities, was proposed. Top K persuaders are chosen according to the computed scores. This research proposed a new definition of persuasion scores relaxing some conditions on the matrix of probabilities, and a method to identify top K persuaders based on the defined scores. Research design, data, and methodology - A new method of computing top K persuaders is computed by singular value decomposition (SVD) of the matrix which represents persuasion probabilities between entities. Results - By testing a randomly generated instance, it turns out that the proposed method is essentially different from the previous study sharing a similar idea. Conclusions - The proposed method is shown to be valid with respect to both theoretical analysis and empirical test. However, this method is limited to the category of persuasion scores relying on the matrix-form of persuasion probabilities. In addition, the strength of the method should be evaluated via additional experiments, e.g., using real instances, different benchmark methods, efficient numerical methods for SVD, and other decomposition methods such as NMF.

• Korean Journal of Optics and Photonics
• /
• v.6 no.3
• /
• pp.178-187
• /
• 1995

The method that determines the appropriate damping factor is studied for a lens design. When suitable damping factor is applied to the additive damped least-squares (DLS) method, the convergence and the stability of the optimization process are examined in a triplet-type photographic lens design. We calculate eigenvalues of the product of the Jacobian matrix of error functions by using the singular value decomposition (SVD) method. We adopt the median of eigenvalues as an appropriate damping factor. The convergence and the stability of the optimization process are improved by choosing the adequate damping factor for the optimization of a photographic lens. It is known that the numerical inaccuracy in the calculation of normal equation is overcome by using the orthogonal transformations of the Jacobian matrix. Therefore, a combination of the method for setting a proper damping factor and the orthogonal transformations of the Jacobian matrix is good for application to the design of an aspheric lens with high-order terms. terms.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.9
• /
• pp.1524-1530
• /
• 2016

This paper deals with a robust $H_{\infty}$ sampled-data controller design problem for nonlinear systems in Takagi-Sugeno fuzzy form with singular perturbation. The employed controller takes a state-feedback form. The design condition is represented in terms of linear matrix inequalities. A numerical examples is included to show the effectiveness of the theoretical development.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2000.04a
• /
• pp.317-322
• /
• 2000

인터넷의 발달로 사용자들은 인터넷에서 필요한 정보를 습득할 수 있을 뿐만 아니라, 생활에 필요한 여러 가지 활동들을 할 수 있게 되었다. 특히 주목받는 부분은 구매 활동이다. 따라서 수많은 기업들이 사람들의 구매 활동에 관련된 전자상거래에 투자하고 있고, 현재 Amazon.com 등과 같은 세계적인 사이트들이 서비스를 실시하고 있다. 또한, 전자상거래 사이트들은 사용자들의 구매 활동을 도와주기 위해 추천 시스템의 도입을 추진하고 있다. 추천 시스템은 사용자들로부터 얻어진 정보를 학습하여 이용 가능한 상품 중에서 고객이 좋아할 만한 것은 추천해 주는 시스템이다. 본 논문에서는 추천 시스템에서 사용되는 주요한 방법인 협력적 여과방법에서 초기 rating 행렬의 희소성 문제를 해결하기 위하여 Singular Value decompositon의 적용 방법을 제안하고 있다.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.3
• /
• pp.171-178
• /
• 2013

In this paper, we implement the Faddev-Leverier algorithm using GPGPU (General-Purpose Graphics Processing Unit) to accelerate singular value decomposition. In addition, we compare the performance of the algorithm using CPU and CPU plus GPGPU for eleven ${\times}n$ matrix sizes in order to decompose singular values, where =4, 8, 16, 32, 64, 128, 256, 512, 1,024, 2,048, and 4,096. Experimental results indicate that CPU achieves better performance than CPU plus GPGPU for $n{\leq}64$ because of a large number of read and write operations between CPU and GPGPU. However, CPU plus GPGPU outperforms CPU exponentially in the execution time for $n{\geq}64$.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.467-469
• /
• 1989

A new singular value approach is presented and analized in order to determine the number of multi pie sinsoidal frequencies from the finite noisy data. Simulations are conducted for Akaike's information criterion(AIC), Rissanen's shortest data description(MDL) and a new singular value approach, in covariance matrix based methods. And then performances are compared.

• The Pure and Applied Mathematics
• /
• v.18 no.2
• /
• pp.97-111
• /
• 2011

We provide a semilocal convergence result for approximating a solution of a singular system with constant rank derivatives, using Newton's method in an Euclidean space setting. Our approach uses more precise estimates and a combination of two Lipschitz-type conditions leading to the following advantages over earlier works [13], [16], [17], [29]: tighter bounds on the distances involved, and a more precise information on the location of the solution. Numerical examples are also provided in this study.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.8
• /
• pp.1429-1433
• /
• 2008

In this paper, we consider the design method of robust guaranteed cost controller for discrete-time singular systems with norm-bounded time-varying parameter uncertainty. In order to get the optimum(minimum) value of guaranteed cost, an optimization problem is given by linear matrix inequality (LMI) approach. The sufficient condition for the existence of controller and the upper bound of guaranteed cost function are proposed in terms of strict LMIs without decompositions of system matrices. Numerical examples are provided to show the validity of the presented method.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.7-9
• /
• 2004

This paper provides an observer-based $H_{\infty}$ controller design method for singular systems with and without time-varying delay by just one LMI condition. The sufficient condition for the existence of controller and the controller design method are presented by perfect LMI (linear matrix inequality) approach. The design procedure involves solving an LMI. The observer-based $H_{\infty}$ controller in the existing results can be constructed from the coupled two or more conditions while the proposed controller design method can be obtained from an LMI condition, which can be solved efficiently by convex optimization. Since the obtained condition can be expressed as an LMI form, all variables including feedback gain and observer gain can be calculated simultaneously by Schur complement and changes of variables. An example is given to illustrate the results.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.5
• /
• pp.59-65
• /
• 2011

In this paper, we present a reduced-order parameter-dependent robust $H_{\infty}$ filter design method for discrete-time singular systems with polytopic uncertainties. A BRL(bounded real lemma) for parameter-dependent singular systems is derived from a parameter-dependent Lyapunov function. On the basis of the obtained BRL, low order robust $H_{\infty}$ filter design method is presented by polytopic approach, new reduced-order method, and LMI(linear matrix inequality) technique. Finally, a numerical example is presented to illustrated the feasibility of the proposed method.