• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5616-5630
• /
• 2019

Fully homomorphic encryption allows a third-party to perform arbitrary computation over encrypted data and is especially suitable for secure outsourced computation. This paper investigates secure outsourced computation of multiple matrix multiplication based on fully homomorphic encryption. Our work significantly improves the latest Mishra et al.'s work. We improve Mishra et al.'s matrix encoding method by introducing a column-order matrix encoding method which requires smaller parameter. This enables us to develop a binary multiplication method for multiple matrix multiplication, which multiplies pairwise two adjacent matrices in the tree structure instead of Mishra et al.'s sequential matrix multiplication from left to right. The binary multiplication method results in a logarithmic-depth circuit, thus is much more efficient than the sequential matrix multiplication method with linear-depth circuit. Experimental results show that for the product of ten 32×32 (64×64) square matrices our method takes only several thousand seconds while Mishra et al.'s method will take about tens of thousands of years which is astonishingly impractical. In addition, we further generalize our result from square matrix to non-square matrix. Experimental results show that the binary multiplication method and the classical dynamic programming method have a similar performance for ten non-square matrices multiplication.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.917-920
• /
• 2016

SpSF algorithm is direction-of-arrival estimation algorithm based on sparse representation of incident signlas. Cost function to be optimized for DOA estimation is multi-dimensional nonlinear function, which is hard to handle for optimization. After some manipulation, the problem can be cast into convex optimiztion problem. Convex optimization problem tuns out to be constrained optimization problem, where the parameter in the constraint has to be determined. The solution of the convex optimization problem is dependent on the specific parameter value in the constraint. In this paper, we propose a rule-of-thumb for determining the parameter value in the constraint. Based on the fact that the noise in the array elements is complex Gaussian distributed with zero mean, the average of the Frobenius norm of the matrix in the constraint can be rigorously derived. The parameter in the constrint is set to be two times the average of the Frobenius norm of the matrix in the constraint. It is shown that the SpSF algorithm actually works with the parameter value set by the method proposed in this paper.

• Journal of IKEEE
• /
• v.19 no.1
• /
• pp.33-40
• /
• 2015

Inverse problem in electrical impedance tomography (EIT) is highly ill-posed therefore prior information is used to mitigate the ill-posedness. Regularization methods are often adopted in solving EIT inverse problem to have satisfactory reconstruction performance. In solving the EIT inverse problem, iterative Gauss-Newton method is generally used due to its accuracy and fast convergence. However, its performance is still suboptimal and mainly depends on the selection of regularization parameter. Although, there are few methods available to determine the regularization parameter such as L-curve method they are sometimes not applicable for all cases. Moreover, regularization parameter is a scalar and it is fixed during iteration process. Therefore, in this paper, a novel method is used to determine the regularization parameter to improve reconstruction performance. Conductivity norm is calculated at each iteration step and it used to obtain the regularization parameter which is a diagonal matrix in this case. The proposed method is applied to human thorax imaging and the reconstruction performance is compared with traditional methods. From numerical results, improved performance of proposed method is seen as compared to conventional methods.

• The Korean Journal of Applied Statistics
• /
• v.20 no.2
• /
• pp.373-385
• /
• 2007

The solution of the normal equation arising in a general linear model by the least square methods is not unique in general. Conventionally, SAS IML and G-inverse matrices are considered for such problems. In this paper, we provide a systematic solution procedures for SAS IML.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.53 no.8
• /
• pp.500-508
• /
• 2004

This paper presents a new sensorless vector control system for high performance induction motor drives fed by a matrix converter with non-linearity compensation and disturbance observer. The nonlinear voltage distortion that is caused by commutation delay and on-state voltage drop in switching device is corrected by a new matrix converter modeling. The lumped disturbances such as parameter variation and load disturbance of the system are estimated by the radial basis function network (RBFN). An adaptive observer is also employed to bring better responses at the low speed operation. Experimental results are shown to illustrate the performance of the proposed system.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.1
• /
• pp.445-450
• /
• 2018

Reliable detection and parameter estimation of a radar cross section(RCS) fluctuating target have been known as a difficult task. To reduce the effect of RCS fluctuation, various diversity techniques have been considered. This paper presents a new method for synthesizing a covariance matrix applicable to a coherent multi-input multi-output(MIMO) radar with frequency diversity. It is achieved by efficiently combining covariance matrices corresponding to different carrier frequencies such that the signal-to-noise ratio(SNR) in the combined covariance matrix is maximized. The value of a synthesized covariance matrix is assessed by examining the phase curves of its entries and the improvement on direction of arrival(DOA) estimation.

• Proceedings of the KIEE Conference
• /
• 1990.11a
• /
• pp.421-424
• /
• 1990

An iterative learning control scheme for exact-tracking control and parameter estimation of uncertain robotic systems is presented. In the learning control structure, tracking and feedforward input converge globally and asymptotically as iteration increases. Since convergence of parameter errors depends only on the persistent exciting condition of system trajectories along the iteration independently of length of trajectories, it may be achieved with only system trajectories of small duration. In addition, these learning control schemes are expected to be effectively applicable to time-varying parametric systems as well as time-invariant systems, for the parameter estimation is performed at each fixed time along the iteration. Finally, no usage of acceleration signal and no in version of estimated inertia matrix in the parameter estimator makes these learning control schemes more feasible.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.2
• /
• pp.170-183
• /
• 2007

This paper presents a delay-dependent approach to robust filtering for linear parameter-varying (LPV) systems with discrete and distributed time-invariant delays in the states and outputs. It is assumed that the state-space matrices affinely depend on parameters that are measurable in real-time. Some new parameter-dependent delay-dependent stability conditions are established in terms of linear matrix inequalities (LMIs) such that the filtering process remains asymptotically stable and satisfies a prescribed $H_{\infty}$ performance level. Using polynomially parameter-dependent quadratic (PPDQ) functions and some Lagrange multiplier matrices, we establish the parameter-independent delay-dependent conditions with high precision under which the desired robust $H_{\infty}$ filters exist and derive the explicit expression of these filters. A numerical example is provided to demonstrate the validity of the proposed design approach.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.4
• /
• pp.1-6
• /
• 2010

In this paper, we present a new delay-dependent and parameter-dependent robust stability condition for uncertain singular systems with polytopic parameter uncertainties and time-varying delay. The robust stability criterions based on parameter-dependent Lyapunov function are expressed as LMI (linear matrix inequality). Moreover, the proposed robust stability condition is a general algorithm for both singular systems and non-singular systems. Finally, numerical examples are presented to illustrate the feasibility and less conservativeness of the proposed method.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.7
• /
• pp.740-748
• /
• 1990

In this paper, we consider the problem of parameter estimation, i.e., definding the internal structure of a linear distribution parameter system from its input/output data. First, a linear partial differential equation describing the system is double-integrated with respect to two variables and then transformed into an integral equation. Next the Walsh Operation Matrix for Walsh function and their integration are introduced to transform the integral equation into algebraic simultaneous equations. Finally, we develop an algorithm to estimate the parameters of the linear distributed parameter system from the simple linear algebraic simultaneous equations. It is also shown that our algorithm could be effective in real time data processing since it uses the Fast Walsh Transform.