• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권5호
• /
• pp.1069-1084
• /
• 2011

This paper considers an optimal base station clustering problem for designing a mobile (wireless) communication network. For a given network with a set of nodes (base stations), the problem is to optimally partition the set of nodes into subsets (each called a cluster) such that the associated inter-cluster traffic is minimized under certain topological constraints and cluster capacity constraints. In the problem analysis, the problem is formulated as an integer programming problem. The integer programming problem is then transformed into a binary integer programming problem, for which the associated linear programming relaxation is solved in a column generation approach assisted by a branch-and-bound procedure. For the column generation, both a heuristic algorithm and a valid inequality approach are exploited. Various numerical examples are solved to evaluate the effectiveness of the LP (Linear Programming) based branch-and-bound algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4305-4323
• /
• 2014

In this paper, we investigate the degrees of freedom (DOF) of the Y channel consisting of three single-antenna users and a two-antenna common access relay, where each user intends to exchange independent messages with the other two users with the assistance of the relay. We show that the DOF of this particular scenario is 1.5. In order to prove this result, we firstly derive a DOF upper bound based on cut-set bound by allowing cooperation among users, which shows that the total DOF is upper bounded by 1.5. Then we propose a novel transmission scheme based on asymmetric signal space alignment (ASSA) to demonstrate the achievability of the upper bound. Theoretical evaluation and numerical results confirm that the upper bound can be achieved by utilizing ASSA, which also proves the optimality of the ASSA-based scheme in terms of DOF. Combining the upper bound and achievability, we conclude that the exact DOF is 1.5. Moreover, we present a novel iterative joint beamforming optimization (I-JBO) algorithm to further improve the sum rate. Numerical simulations have been provided to demonstrate the convergence speed and performance advantage of the I-JBO algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권6호
• /
• pp.2074-2093
• /
• 2022

RSA is known as one of the best techniques for securing secret information across an unsecured network. The private key which is one of private parameters is the aim for attackers. However, it is exceedingly impossible to derive this value without disclosing all unknown parameters. In fact, many methods to recover the private key were proposed, the performance of each algorithm is acceptable for the different cases. For example, Wiener's attack is extremely efficient when the private key is very small. On the other hand, Fermat's factoring can quickly break RSA when the difference between two large prime factors of the modulus is relatively small. In general, if all private parameters are not disclosed, attackers will be able to confirm that the private key is unquestionably inside the scope [3, n - 2], where n is the modulus. However, this scope has already been reduced by increasing the greatest lower bound to [d_il, n - 2], where d_il ≥ 3. The aim of this paper is to decrease the least upper bound to narrow the scope that the private key will remain within this boundary. After finishing the proposed method, the new scope of the private key can be allocated as [d_il, d_ir], where d_ir ≤ n - 2. In fact, if the private key is extremely close to the new greatest lower bound, it can be retrieved quickly by performing a brute force attack, in which d_ir is decreased until it is equal to the private key. The experimental results indicate that the proposed method is extremely effective when the difference between prime factors is close to each other and one of two following requirement holds: the first condition is that the multiplier of Euler totient function is very close to the public key's small value whereas the second condition is that the public key should be large whenever the multiplier is far enough.

• 한국통신학회논문지
• /
• 제31권2A호
• /
• pp.138-143
• /
• 2006

본 논문은 특정한 LDPC 코드와 특정한 인터리버를 가진 터보 코드의 맥시멈 라이클리후드(maximum-likelihood) 디코딩 성능의 상향 한계를 보인다. 현재까지의 연구는 균등 인터리버의 가정을 하거나 또는 앙상블 코드를 사용하여 LDPC 코드와 터보 코드의 성능 상향 한계를 계산하였다. 이러한 성능 상향 한계는 모든 코드 또는 모든 인터리버에 대한 평균 성능만을 표시하게 된다. 제안된 성능 상향 한계는 단순 한계(simple bound)와 정확한 짧은 거리의 항들을 포함하는 추정된 무게 분포를 기초하고 있다. 만약 둘 중에 하나만 사용하게 되면 정확한 성능 상향 한계를 얻을 수 가 없다.

• Journal of Information Technology Applications and Management
• /
• 제22권2호
• /
• pp.1-17
• /
• 2015

In this research, we develop and suggest branch and bound algorithms for a two-machine permutation flowshop scheduling problem with the objective of minimizing makespan. In this scheduling problem, after each job is operated on the machine 1 (first machine), the job has to start its second operation on machine 2 (second machine) within its corresponding limited waiting time. In addition, each job has its corresponding ready time at the machine 1. For this scheduling problem, we develop various dominance properties and three lower bounding schemes, which are used for the suggested branch and bound algorithm. In the results of computational tests, the branch and bound algorithms with dominance properties and lower bounding schemes, which are suggested in this paper, can give optimal solution within shorter CPU times than the branch and bound algorithms without those. Therefore, we can say that the suggested dominance properties and lower bounding schemes are efficient.

• 대한수학회보
• /
• 제54권3호
• /
• pp.1081-1094
• /
• 2017

For a poset $P=(X,{\leq}_P)$, the linear discrepancy of P is the minimum value of maximal differences of all incomparable elements for all possible labelings. In this paper, we find a lower bound and an upper bound of the linear discrepancy of a product of two posets. In order to give a lower bound, we use the known result, $ld({\mathbf{m}}{\times}{\mathbf{n}})={\lceil}{\frac{mn}{2}}{\rceil}-2$. Next, we use Dilworth's chain decomposition to obtain an upper bound of the linear discrepancy of a product of a poset and a chain. Finally, we give an example touching this upper bound.

• 한국통신학회논문지
• /
• 제22권6호
• /
• pp.1178-1184
• /
• 1997

Encoding of segment contours is a critical part of a region-based coding system especially at low bit rates where the contour information occupies a majority of the bit rate. When approximating contours with polygons, a fixed upper bound on the distortion is set for the approximation process. Instead of using this fixed bound, adaptive approximation bound for a lossy coding of contourts is proposed in this paper. A function representing the relative importance of the contour segmentis defined to take into account the spatial content of the image. By using this function, the contour can be approximated adaptively. This allows a more general approach than the methods with the fixed distortion measure. The effectiveness of the adaptive contour coding approach is verified through experiments.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.635-638
• /
• 1998

This paper proposes a simple method to measure system's performance in target tracking problems. Essentially employing the Cramer-Rao lower bound (CRLB) on trakcing accuracy, an algorithm of predicting system's performance under various scenarios is developed. The input data is a collection of measurements over time fromsensors embedded in gaussian noise. The target of interest may not maneuver over the processing time interval while the own ship observing platform may maneuver in an arbitrary fashion. Th eproposed approach is demonstrated and discussed through simulation results.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2001년도 춘계학술대회 논문집
• /
• pp.259-262
• /
• 2001

An improved robust hybrid control law is proposed. This law used the separated bounding function and the stiffness bound. It satisfied the performance though we don't know precise information of contact environments. It guarantees the practical stability in sense of Lyapunov. Simulation was performed to validate this law using a four-axis SCARA type robot manipulator.

• Bulletin of the Korean Chemical Society
• /
• 제30권2호
• /
• pp.315-318
• /
• 2009

Some particular bound state energies of an electron, under Coulomb potential field, confined in a two-dimensional circle and a three-dimensional sphere are analytically derived. The derivation shows that the electron cannot be bound in a negative energy state when the circle (or sphere) is smaller than a certain critical size. The critical size dependency on the strength of Coulomb potential and the angular momentum of the electron is also analytically derived. This system mimics quantum dots. Therefore the derivation provides new information on a minimum critical size of quantum dots with hydrogenic impurity.