• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.307-312
• /
• 2002

In this paper we propose the efficient blind signature scheme based on Gap problem. We can find the short signature schemes for Weil pairing as the example of signature schemes based on Gap problem. Since short signature scheme is based on elliptic curve, our proposed signature scheme can be used in wireless PKI environment.

• Transactions of the Society of Information Storage Systems
• /
• v.3 no.1
• /
• pp.1-4
• /
• 2007

A high density optical data storage device has been required for many years. In the field of the optical data storage, a near-field recording (NFR) technology is considered as a next generation one for achieving the high data density. Due to an evanescent wave effect occurred under 100nm distance which is the excessively small distance between the SIL and the disc, the most significant and difficult problem in this technology is to maintain a gap between a solid immersion lens (SIL) and a disc. Also, maintaining the gap under at least 50nm is required in the NFR gap servo system to use the evanescent wave effect efficiently. There are some institutes that have shown the novel gap servo control. In general, they use a mode switching servo method which consists of approach, hand-over and gap control mode. However there is a critical problem such as an overshoot at the tuning point from the approach mode to the hand-over mode, which may cause a collision between the SIL and the disc. In this paper, we show our NFR system and an improved gap servo system using an exponential function as the approach mode which can reduce the overshoot.

• Journal of the Korean Home Economics Association
• /
• v.38 no.10
• /
• pp.97-115
• /
• 2000

This study stems from the speculation that consumer life will be limited if consumers are not involved in the cyberspace and focuses on the differences of consumer competence as a result of information gaps among consumers. A cluster analysis is applied for cortege students who are ahead of the rest of the society in terms of the information level. Over the half of the students is grouped as a general level of information, about one quarter of those as an advanced level, and about one tenth as a behind level. The levels of consumer competence are very much differed among the three groups of students. This result indicates that information gap will be another source of consumer problem in an information society. Therefore, much more attention should be focused on the information gaps among consumers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3831-3851
• /
• 2015

This paper is concerned with the problem of joint resource allocation and user-pairing in virtual MIMO SC-FDMA systems to improve service quality of experience (QoE). No-reference logarithmic model is introduced to quantify service experience for each user and the objective is to maximize sum of all user's mean of score (MOS). We firstly formulate the optimal problem into an S-dimensional (S-D) assignment problem. Then, to solve this problem, the modified Lagrangian relaxation algorithm is deduced to obtain the suboptimal result of joint user-paring and subchannel allocation. The merits of this solution are as follows. First, the gap between its results and the global optimal one can be quantified and controlled by balancing the complexity and accuracy, which merit the other suboptimal algorithms do not have. Secondly, it has the polynomial computational complexity and the worst case complexity is O(3LN³), where L is the maximum iteration time and N is the number of subchannels. Simulations also prove that our proposed algorithm can effectively improve quality of experience and the gap between our proposed and the optimal algorithms can be controlled below 8%.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.720-728
• /
• 2003

Blind signature is such a signature scheme that conceals the contents of signature itself and who is the user of the signature make user's anonymity possible. For this reason, they are used in security services such as electronic cashes and electronic votes in which the behavior of actor should not be exposed. In this paper we propose an ID-based blind signature scheme from Gap Diffie-Hellman group. Its security is based on the hardness of Computational Diffie-Hellman Problem. Proposed scheme efficiently improve against existing blind signature scheme by using two-pass protocol between two users and by reducing computation process. Therefore it can be used efficiently in wireless PKI environment.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.20 no.4
• /
• pp.109-118
• /
• 2012

Large number of part design for aircraft and automobile is preceded by functional or sectional design groups for efficiency. However, interferences and gaps can be found when the parts and sub-assemblies by those design groups are to be assembled. These interferences and gaps cause design changes and additional repair processes. While interference problem has been resolved by digital mockup and concurrent engineering methodology, gap problem has been covered by temporary treatment of filling gap with sealant. This kind of fast fix causes fatal problem of leakage when the gap is too big for filling or the treatment gets old. With this research, we have developed a program to find the gap automatically among parts of assembly so that users can find them to correct their design before manufacturing stage. By using decomposition model representation method, the developed program can search the gap among complex car body parts to be visualized with volumetric information. It can also define the boundary between the gap and exterior empty space automatically. Though we have proved the efficiency of the developed program by applying to automobile assembly, application of the program is not limited to car body only, but also can be extended to aircraft and ship design of large number of parts.

• Journal of Korea Society of Industrial Information Systems
• /
• v.28 no.1
• /
• pp.27-34
• /
• 2023

The optimal assignment problem between agents and tasks is known as one of the representative problems of combinatorial optimization and an NP-hard problem. This paper covers multi agent-multi task assignment problems with uncertain completion probability. The completion probabilities are generally uncertain due to endogenous (agent or task) or exogenous factors in the system. Assignment decisions without considering uncertainty can be ineffective in a real situation that has volatility. To consider uncertain completion probability mathematically, a mathematical formulation with stochastic programming is illustrated. We also present an algorithm by using the sample average approximation method to solve the problem efficiently. The algorithm can obtain an assignment decision and the upper and lower bounds of the assignment problem. Through numerical experiments, we present the optimality gap and the variance of the gap to confirm the performances of the results. This shows the excellence and robustness of the assignment decisions obtained by the algorithm in the problem with uncertainty.

• Korean Management Science Review
• /
• v.14 no.1
• /
• pp.31-52
• /
• 1997

The Generalized Assignment Problem(GAP) determines the minimum assignment of n tasks to m workstations such that each task is assigned to exactly one workstation, subject to the capacity of a workstation. In this paper, we presented a new heuristic search algorithm for GAPs. then we tested it on 4 different benchmark sample sets of random problems generated according to uniform distribution on a microcomputer.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.1044-1047
• /
• 2013

Wireless Mesh Network (WMN) provides effective Internet Service accesses to users by utilizing multi-rate and multi-channel. In multi-rate networks, the Rate Anomaly (RA) problem occurs, the problem that low-rate link degrades the performance of high-rate link. In this paper we propose Rate Gap Minimum Channel Assignment (RGM-CA) protocol that select the minimal rate gap parent node and assign the channel in order to mitigates the rate anomaly problem. RDM-CA protocol is efficient because it consider rate anomaly, channel diversity and node connectivity.

• International Journal of Computer Science & Network Security
• /
• v.24 no.3
• /
• pp.113-124
• /
• 2024

One of the goals of the Saudi Arabia 2030 vision is to ensure full employment of its citizens. Recruitment of graduates depends on the quality of skills that they may have gained during their study. Hence, the quality of education and ensuring that graduates have sufficient knowledge about the in-demand skills of the market are necessary. However, IT graduates are usually not aware of whether they are suitable for recruitment or not. This study builds a prediction model that can be deployed on the web, where users can input variables to generate predictions. Furthermore, it provides data-driven recommendations of the in-demand skills in the Saudi IT labor market to overcome the unemployment problem. Data were collected from two online job portals: LinkedIn and Bayt.com. Three machine learning algorithms, namely, Support Vector Machine, k-Nearest Neighbor, and Naïve Bayes were used to build the model. Furthermore, descriptive and data analysis methods were employed herein to evaluate the existing gap. Results showed that there existed a gap between labor market employers' expectations of Saudi workers and the skills that the workers were equipped with from their educational institutions. Planned collaboration between industry and education providers is required to narrow down this gap.