• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4680-4700
• /
• 2015

Broadcast encryption is an efficient way to distribute confidential information to a set of receivers using broadcast channel. It allows the broadcaster to dynamically choose the receiver set during each encryption. However, most broadcast encryption schemes in the literature haven't taken into consideration the receiver's privacy protection, and the scanty privacy preserving solutions are often less efficient, which are not suitable for practical scenarios. In this paper, we propose an efficient dynamic anonymous broadcast encryption scheme that has the shortest ciphertext length. The scheme is constructed over the composite order bilinear groups, and adopts the Lagrange interpolation polynomial to hide the receivers' identities, which yields efficient decryption algorithm. Security proofs show that, the proposed scheme is both secure and anonymous under the threat of adaptive adversaries in standard model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1586-1591
• /
• 2022

Kirchhoff-Love plate (KLP) equation is a well established theory for a description of a deformation of a thin plate under certain outer source. Meanwhile, analysis of a vibrating plate in a frequency domain is important in terms of obtaining the main frequency/eigenfunctions and predicting the vibration of plate. Among various modal analysis methods, dynamic mode decomposition (DMD) is one of the efficient data-driven methods. In this work, we carry out DMD based modal analysis for KLP where thin plate is under effects of sine-type outer force. We first construct discrete time series of KLP solutions based on a finite difference method (FDM). Over 720,000 number of FDM-generated solutions, we select only 500 number of solutions for the DMD implementation. We report the resulting DMD-modes for KLP. Also, we show how DMD can be used to predict KLP solutions in an efficient way.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.97-101
• /
• 1991

A three-dimensional magnetostatic problem is analyzed using the boundary element method and the magnetic scalar potential are employed in order to reduce the size of system matrix. Although the total magnetic scalar potential gives very accurate solutions in inner and outer regions of magnetic material, it has limitation on application because the magnetic scalar potential due to applied magnetic field sources is hard to be obtained. The reduced magnetic scalar potential gives more or less inaccurate solutions inside the magnetic material but very accurate solutions outside. Hence it can be concluded that the reduced magnetic scalar potential is very useful when the magnetic fields of outside magnetic material only are interested. It is also shown, from the numerical results, that the linear shape function gives more efficient solutions than the constant shape functions because the former gives more accurate solutions in spite of relatively fewer unknowns than the latter.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.3
• /
• pp.25-43
• /
• 2010

We consider a multi-objective balancing and sequencing problem in mixed model assembly lines, which is important for an efficient use of the assembly lines. In this paper, we present a neighborhood symbiotic evolutionary algorithm to simultaneously solve the two problems of balancing and model sequencing under multiple objectives. We aim to find a set of well-distributed solutions close to the true Pareto optimal solutions for decision makers. The proposed algorithm has a two-leveled structure. At Level 1, two populations are operated : One consists of individuals each of which represents a partial solution to the balancing problem and the other consists of individuals for the sequencing problem. Level 2, which is an upper level, works one population whose individuals represent the combined entire solutions to the two problems. The process of Level 1 imitates a neighborhood symbiotic evolution and that of Level 2 simulates an endosymbiotic evolution together with an elitist strategy to promote the capability of solution search. The performance of the proposed algorithm is compared with those of the existing algorithms in convergence, diversity and computation time of nondominated solutions. The experimental results show that the proposed algorithm is superior to the compared algorithms in all the three performance measures.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.217-220
• /
• 2000

With the expansion of E-commerce, Public Key Infrastructure (PKI) solutions are requited to resolve Internet security problems. But the certification mechanism for each organization has been independently developed under its own circumstances, so the cooperation of heterogeneous certification mechanisms must be carefully taken into account. In this paper, we propose an efficient protocol for the cross certification based on the path validation. The proposed “cross certification gateway” provides flexibility and convenience with the initial establishment protocol for the cross certification among different certification domains.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.506-511
• /
• 1998

In this paper we consider multiobjective linear programming problems with coefficients of the objective functions specified by possibility distributions. Possibly and necessarily efficient solution sets are defined as funny solution sets whose membership grades represent possibility and necessity degrees to which a feasible solution is efficient. Considering efficiency condition and its dual condition in ordinary multiobjective linear programming problem, we propose efficiency test methods based on an extreme ray generation method. Since the proposed methods can be put in the part of a bi-section method, we can develop calculation and methods of the degree of possible and necessary efficiency for feasible solutions.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.863-875
• /
• 2010

In this paper we apply the martingale approach, which has been widely used in mathematical finance, to investigate the optimal investment problem for an insurer under the criterion of mean-variance. When the risk and security assets are described by the L$\acute{e}$vy processes, the closed form solutions to the maximization problem are obtained. The mean-variance efficient strategies and frontier are also given.

• International journal of advanced smart convergence
• /
• v.7 no.3
• /
• pp.61-65
• /
• 2018

A Location Register(LR) system manages each subscriber's location information, which continuously changes in mobile cellular network. For this purpose, the LR database system provides backup management facilities. The objectives of this paper are to identify the problems of the current LR system through rigorous analysis, to suggest solutions to them. I proposed efficient backup methods that takes into account the characteristics of LR database transactions. In the proposed backup method, I use two kinds of dirty flags in order to solve the performance degradation problem caused by frequent registration- location operations.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.2
• /
• pp.41-51
• /
• 1988

In this paper an efficient heuristic for the generalized assignment problem(GAP) is presented. A new lower bound that is slightly improved by adding the feasibility constraint is used to measure the quality of solutions obtained by the heuristic. The heuristic was tested on a number of large-scale random problems and a large sample of small problems. The heuristic appears to be better than the best previously existing heuristic for GAP. Its effectiveness in comparison of running times and closenesses to lower bound is discussed.

• Proceedings of the KSME Conference
• /
• 2001.06e
• /
• pp.422-429
• /
• 2001

A two dimensional hierarchical elements are investigated for a use on the incompressible flow computation. The construction of hierarchical elements are explained through the tensor product of 1-D hierarchical functions, and a systematic treatment of essential boundary values has been developed for the degrees of freedom corresponding to higher order terms. The numerical study for the poisson problem showed that the present scheme can increase the convergence and accuracy of finite element solutions, and can be more efficient than the standard first order with many elements. Also, for Stokes and cavity flow cases, solutions from hierarchical elements showed better resolutions and future promises for higher order solutions.