• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.6
• /
• pp.1389-1398
• /
• 2009

This research suggests the calculation and analytic method of determining the proper numbers of manual workers with simulation and DEA methods. For this, first of all we designed and analysed the simulation model of real facility being built in Dea-Jun. Secondly, we find the solution with DEA among various alternatives built based on the results of the simulation analysis. In the simulation process, the waiting time, the number of painted trains, and utilization of main equipment are considered as main response variables. After simulation, we built DMUs(Decision Making Unit) consisting of combined results with the manpower assignment policies, the numbers of workers, and the rate of skilled operators, and calculated the efficiency of DMUs with the DEA method. Among 27 DMUs, 4 DMUs turned out efficient technically and on scale. In conclusion, through the suggested procedure, this research shows the way that decision makers can solve the problems with various factors they should concern, along the scientific process, when building a new facility.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.7
• /
• pp.1238-1244
• /
• 2001

Earlier efforts on optical access concentrated on the design of PONs for the collection and distribution portion of the access network. In these networks the optical hardware in the RN is very simple, but a multiple access protocol is needed for upstream traffic control. On the other hand, the role of communications is already well established in the office environment. With the advent of cheap, affordable broadband communications and the increasing complexity of consumer electronics, it seems natural to extend the network into the home. As the application of Home Area Network is ever increasing, we therefore consider connectivity between access network and home network which generates various traffic to design MAC protocol over residential network. Global-FIFO is quite simple and allows dynamic upstream bandwidth assignment on the basis of a request-and-permit mechanism. It has good bandwidth efficiency and being cell-based, it does not consider the various traffic from home network. In this paper, we design and analyze the new MAC resource assignment algorithm called MQ-FIFO (Multiple Queue-FIFO) that provides good performance under the environment of ATM-PON and Home Network.

• Journal of Korean Society of Transportation
• /
• v.18 no.5
• /
• pp.99-107
• /
• 2000

Path-based assignment(PBA) is valuable to dynamic traffic control and routing in integrated ITS framework. As one of widely studied PBA a1gorithms, Gradient Projection(GP) a1gorithm typically fields rapid convergence to a neighborhood of an optimal solution. But once it comes near a solution, it tends to slow down. To overcome this problem, we develop more efficient path-based assignment algorithm by combining Conjugate Gradient method with GP algorithm. It determines more accurate moving direction near a solution in order to gain a significant advantage in speed of convergence. Also this algorithm is applied to the Sioux-Falls network and verified its efficiency. Then we demonstrate that this type of method is very useful in improving speed of convergence in the case of user equilibrium problem.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.9
• /
• pp.668-676
• /
• 2018

In satellite communications, a modulation technique with a low peak-to-average power ratio, high transmission efficiency, and low bit error rate(BER) is required, and differential amplitude and phase shift keying(DAPSK) modulation technique has been appraised as a technology that meets these requirements. However, because conventional DAPSK modulation uses a regular constellation diagram, the Euclidean distance between the symbols in the inner concentric circles of the constellation are quite short. Such a characteristic degrades the BER. In this paper, we propose a DAPSK system that uses an efficient constellation assignment to improve the performance of existing DAPSK systems and evaluate the performance of the proposed scheme. From the simulation results, we confirm that the proposed 16-DAPSK system achieves an signal-to-noise ratio gain of 0.8 dB over the conventional approach at a BER condition of $10^{-4}$ when the number of symbols used in the symbol detector of the receiver is 2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.5
• /
• pp.410-415
• /
• 2013

Recently, as Internet enters WEB 2.0, many social network services through such as Facebook, Twitter and Youtube appeared. In these social network sites, users can easily make friends, join groups and access others personal information. Therefore, a malicious user can easily gather information of others. In order to protect user's personal information from the unauthenticated users, we propose privacy protection mechanism based on key assignment and user's trust level. A master-key is generated for each users and is segmented into a core-key and several sub-key. The master-key stores at the information owner's side and the sub-key will be distributed to requestor according to the relation and trust level. At last, in order to proof the efficiency, the performance of our proposed mechanism is compared with those of existing mechanisms.

• Journal of IKEEE
• /
• v.16 no.3
• /
• pp.258-264
• /
• 2012

Although linear channel estimation for the frequency selective fading channel has been widely deployed, its accuracy depends on the number of pilots to probe the channel. Thus, it is unavoidable to employ large number of pilots to enhance the channel estimation performance, which essentially leads to the degradation of the transmission efficiency. It even does not utilize the sparseness of the multipath channel. In this paper a sparse channel estimation scheme based on the matching pursuit algorithm and a pilot assignment method, which minimizes the coherence, are proposed. The simulation results reveal that the proposed algorithm shows superior channel estimation performance with fewer pilots to the LS based ones.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3654-3659
• /
• 2011

The MAC protocol of HiperLAN/2 is based on TDMA/TDD. The radio channels are assigned by AP(Access Point) that is centrally operated. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channels. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Therefore, number of RCH should be allocated properly according to traffic. From these viewpoints, this paper proposes an advanced scheme that dynamically changed the number of RCH which is based on the number of success and collision of RR message in previous MAC frame. To prove efficiency of proposed scheme, lots of simulations are conducted and analyzed.

• Korean Management Science Review
• /
• v.16 no.1
• /
• pp.157-171
• /
• 1999

In a increasingly competitive marketplace, the manufacturing companies have no choice but looking for ways to improve productivity to sustain their competitiveness and survive in the industry. Recently cellular manufacturing has been under discussion as an option to be easily implemented without burdensome capital investment. The objective of cellular manufacturing is to realize many aspects of efficiencies associated with mass production in the less repetitive job-shop production systems. The very first step for cellular manufacturing is to group the sets of parts having similar processing requirements into part families, and the equipment needed to process a particular part family into machine cells. The underlying problem to determine the part and machine assignments to each manufacturing cell is called the cell formation. The purpose of this study is to develop a clustering algorithm based on the neural network approach which overcomes the drawbacks of ART1 algorithm for cell formation problems. In this paper, a generalized learning vector quantization(GLVQ) algorithm was devised in order to transform a 0/1 part-machine assignment matrix into the matrix with diagonal blocks in such a way to increase clustering performance. Furthermore, an assignment problem model and a rearrangement procedure has been embedded to increase efficiency. The performance of the proposed algorithm has been evaluated using data sets adopted by prior studies on cell formation. The proposed algorithm dominates almost all the cell formation reported so far, based on the grouping index($\alpha$ = 0.2). Among 27 cell formation problems investigated, the result by the proposed algorithm was superior in 11, equal 15, and inferior only in 1.

• Journal of KIISE:Software and Applications
• /
• v.32 no.5
• /
• pp.335-345
• /
• 2005

In personalized marketing, it is important to maximize customer satisfaction and marketing efficiency. As personalized campaigns are frequently performed, several campaigns are frequently run simultaneously. The multiple recommendation problem occurs when we perform several personalized campaigns simultaneously. This implies that some customers may be bombarded with a considerable number of campaigns. We raise this issue and formulate the multi-campaign assignment problem to solve the issue. We propose dynamic programming method and various heuristic algorithms for solving the problem. With field data, we also present experimental results to verify the importance of the problem formulation and the effectiveness of the proposed algorithms.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.1
• /
• pp.382-389
• /
• 2012

The fabricated report attack will not only cause false alarms that waste real-world response efforts such as sending response teams to the event location, but also drains the finite amount of energy in a wireless sensor network. In this paper, we propose a probabilistic filtering method for sensor network security (PFSS) to deal with filtering for the fabricated report. On the basis of filtering scheme, PFSS combines cluster-based organization and probabilistic verification node assignment using distance of from cluster head to base station for energy efficiency and hot spot problem. Through both analysis and simulation, we demonstrate that PFSS could achieve efficient protection against fabricated report attack while maintaining a sufficiently high filtering power.