• Journal of Korea Society of Industrial Information Systems
• /
• v.25 no.1
• /
• pp.89-99
• /
• 2020

In this paper, we consider a dyadic server control policy that combines workload control and single vacation. Customer arrives at the system with Bernoulli process, waits until his or her turn, and then receives service on FCFS(First come first served) discipline. If there is no customer to serve in the system, the idle single server spends a vacation of discrete random variable V. If the total service times of the waiting customers at the end of vacation exceeds predetermined workload threshold D, the server starts service immediately, and if the total workload of the system at the end of the vacation is less than or equal to D, the server stands by until the workload exceeds threshold and becomes busy. For the discrete-time Geo/G/1 queueing system operated under this dyadic server control policy, an idle period is analyzed and the steady-state queue length distribution is derived in a form of generating function.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.1
• /
• pp.102-109
• /
• 2018

This paper seeks to present a multi-control method that can contribute to effective control of the production line with multiple bottleneck processes. The multi-control method is the production system that complements shortcomings of CONWIP and DBR, and it is designed to determine the raw material input according to the WIP level of two bottleneck processes and WIP level of total process. The effectiveness of the production system developed by applying the multi-control method was verified by the following three procedures. Raw material input conditions of the multi-control method are as follows. First, raw materials are go into the production line when the number of the total process WIP is lower than established number of WIP in total process and first process is idle. Second, raw materials are introduced when the number of WIP of two bottleneck processes is lower than the established number of WIP of each bottleneck process. Third, raw materials are introduced when the first process and in front of bottleneck process are idle even if the number of WIP in the total process is less than established number of WIP of the total process. The production line with two bottleneck processes was selected as the condition for production environment, and the production process modeling of CONWIP, DBR and multi-control production method was defined according to the production condition. And the optimum limited WIP level suitable for each system was obtained by applying a genetic algorithm to determine the total limited number of WIP of CONWIP, the limited number of WIP of DBR bottleneck process, the number of WIP in the total process of multi-control method and the limited number of WIP of bottleneck process. The limited number of WIP of CONWIP, DBR and multi-control method obtained by the genetic algorithm were applied to ARENA modeling, which is simulation software, and a simulation was conducted to derive result values on the basis of three criteria such as production volume, lead time and number of goods in-progress.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.27-46
• /
• 1992

This paper considers an (r, Q) policy for operation of a multipurpose facility. It is assumed that whenever the inventory level falls below r, the model starts to produce the fixed amount of Q. The facility can be utilized for extra production during idle periods, that is, when the inventory level is still greater than r right after a main production operation is terminated or an extra production operation is finished. But, whenever the facility is in operation for an extra production, the operation can not be terminated for the main production even though the inventory level falls below r. In the model, the demand for the product is assumed to arrive according to a compound Poisson process and the processing time required to produce a product is assumed to follow an arbitary distribution. Similarly, the orders for the extra production is assumed to accur in a Poisson process are the extra production processing time is assumed to follow an arbitrary distribution. It is further assumed that unsatisfied demands are backordered and the expected comulative amount of demands is less than that of production during each production period. Under a cost structure which includes a setup/ production cost, a linear holding cost, a linear backorder cost, a linear extra production lost sale cost, and a linear extra production profit, an expression for the expected cost per unit time for a given (r, Q) policy is obtained, and using a convex property of the cost function, a procedure to find the optimal (r, Q) policy is presented.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.117-124
• /
• 2001

At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the $320{\times}320$ matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3638-3654
• /
• 2014

Cognitive Radio (CR) users need to sense the environment or channel at regular time interval for sharing the spectrum band of the primary users (PUs). Once find the spectrum idle, CR users start their transmission through it. Even while transmitting, they need to continue the sensing process so that they can leave the spectrum immediately whenever find a PU wanting to use the band. Therefore, detecting PUs is one of the main functions of cognitive radio before transmission and higher the detection probability ensures better protection to the primary users. However, it is not possible to attain a high detection probability (or a low miss detection probability) and low false alarm probability simultaneously as there is a tradeoff between false alarm probability ($P_{fa}$) and the probability of detection ($P_d$). In this paper, the author has provided a comprehensive study on different sensing techniques and discussed their advantages and disadvantages. Moreover, it is expected that, with this article, readers can have a through understanding of sensing techniques in CR and the current research trends in this area.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.656-665
• /
• 1992

In this paper, the performance of the various multiple access techniques for the mobile computer network has been studiedi in the consideration of the charactersitics of the mobile cimmunication channel. In the case of the hidden node occurring. It could be seen that the performance of the code division multiple access (CDMA) technique with simultaneous access function is better than that of the other packet access methods such as carrier sendsed multiple access (CDMA), busy tone multiple access (BTMA) and idle signal multiple access (ISMA) in the view of the throughput and mean delay time. Also, it has been shown that the performance of the CDMA method is superior to that of other packet access techniques such as multiple access (CSMA), etc. when the fading effect or impulsive noise exists in the mobile channel, Especially, in the case of the distributed mobile network it has been shown that the receivertransmitter based CDMA method using the characteristics of CDMA effectively has better throughput and less mean delay time than the commontransmitter based CDMA technique.

• Journal of IKEEE
• /
• v.23 no.3
• /
• pp.762-767
• /
• 2019

The plane-wave shielding effectiveness is typically measured for horizontal and vertical polarizations using a linearly polarized antenna. However, this typical measurement method results in big evaluation fees due to very long measurement time as well as huge idle space for maintenance, these problems is more severe especially in large shielded enclosures such as EMP protection facilities to be built in indoor buildings and underground. This paper describes the design and fabrication process and results of a planar log-spiral antenna applicable to the evaluation of the electromagnetic shielding effectiveness of a large EMP protection facility. Since the proposed antenna has a circular polarization, there is no need to separately measure the horizontal and vertical polarizations. Therefore, the measurement time can be shortened by more than 1/2, and further, its small volume with a planar structure can reduce greatly idle space required for the maintenance.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.9
• /
• pp.49-61
• /
• 1996

Back-propagation(BP) algorithm needs a lot of time to train the artificial neural network (ANN) to get high accuracy level in classification tasks. So there have been extensive researches to process back-propagation algorithm on parallel processors. This paper prsents a linear systolic array which calculates forward-backward propagation of BP algorithm at the same time using effective space-time transformation and PE structure. First, we analyze data flow of forwared and backward propagations and then, represent the BP algorithm into data dapendency graph (DG) which shows parallelism inherent in the BP algorithm. Next, apply space-time transformation on the DG of ANN is turn with orthogonal direction projection. By doing so, we can get a snakelike systolic array. Also we calculate the interval of input for parallel processing, calculate the indices to make the right datas be used at the right PE when forward and bvackward propagations are processed in the same PE. And then verify the correctness of output when forward and backward propagations are executed at the same time. By doing so, the proposed system maximizes parallelism of BP algorithm, minimizes th enumber of PEs. And it reduces the execution time by 2 times through making idle PEs participate in forward-backward propagation at the same time.

• Industrial Engineering and Management Systems
• /
• v.14 no.4
• /
• pp.372-378
• /
• 2015

In labor-intensive enterprise, such as garment factory, assembly line is widely used as a manufacturing process for reducing costs and production time. However, for the sake of the various working capacity of worker, idle or delay may happen and influence the rear processes. If these unforeseeable delay happened continuously, it may influence the whole manufacturing process and a model, which is called limited-cycle model with multiple periods (LCMwMP), is assumed to evaluate the influence risk. In order to minimize the risk, the assignment of the workers is focused on. In this paper, we deal with an assembly line as LCMwMP model when two kinds of workers exist, whose efficiency is assumed to two different groups. We consider an optimization problem for finding an assignment of workers to the line that minimizes total expected risk, which is exchanged to expected cost by reset model of LCMwMP. First, reset model as a simple model of LCMwMP is introduced. Then, some hypotheses of the rules of the optimal worker assignment are proposed and some numerical experiments are researched assuming the processing time as Erlang distribution. Finally, the other rules on other certain conditions are discussed.

• International Journal of Automotive Technology
• /
• v.8 no.5
• /
• pp.629-636
• /
• 2007

This paper describes the process of analyzing vehicle stiffness in terms of frequency band in order to improve vehicle handling. Vehicle handling and ride comfort are highly related to the systems such as suspension, seat, steering, and the car body design. In existing analytical processes, the resonance frequency of a car body is designed to be greater than 25 Hz in order to increase the stiffness of the body against idle vibration. This paper introduces a method for using a band with a frequency lower than 20 Hz to analyze how stiffness affects vehicle handling. Accordingly, static stiffness analysis of a 1g cornering force was conducted to minimize the deformation of vehicle components derived from a load on parts attached to the suspension. In addition, this technology is capable of achieving better performance than older technology. Analysis of how body attachment stiffness affects the dynamic stiffness of a bushing in the attachment parts of the suspension is expected to lead to improvements with respect to vehicle handling and road noise. The process of developing a car body with a high degree of stiffness, which was accomplished in the preliminary stage of this study, confirms the possibility of improving the stability performance and of designing a lightweight prototype car. These improvements can reduce the time needed to develop better vehicles.