• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.2
• /
• pp.104-110
• /
• 2006

When a new facility such as automobile assembly line is designed, computer simulation is often used to estimate its actual throughput level. If it falls short of the target throughput level, then the design must be modified to increase the throughput capacity. For complex facilities having parallel processes and network of material flows, the modification procedure is not trivial. Even if the capacity of a particular bottleneck process is increased, the target throughput may not be achieved because the bottleneck may move to another process. Furthermore, each process has a different set of options with different cost to increase the capacity. In this study, we present a systematic procedure of determining the cost-effective set of options which achieves the target throughput.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• pp.315-318
• /
• 1996

The machine-part cell formation means the grouping of similar parts and similar machines into families in order to minimize bottleneck machines, bottleneck parts, and inter-cell part movements in cellular manufacturing systems and flexible manufacturing systems. The cell formation problem is knows as a kind of NP complete problems. This paper briefly introduces the cell-formation problem and proposes a cell formation method based on the Kohonen's self-organizing feature map which is a neural network model. It also shows some experiment results using the proposed method. The proposed method can be easily applied to the cell formation problem compared to other meta-heuristic based methods. In addition, it can be used to solve large-scale cell formation problems.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.799-807
• /
• 2000

In this paper, object replication Client/server under distributed computing system is design and implementation. Today many end-users have a computer communication by using internet in the distributed system of client/server. If many users request services to a specific remote server, the server should have got a overhead for hat service processing, delayed the speed for replay, and bring a bottleneck in communication network. Therefore object replication method was proposed to solve this problems. The growth of internet works and distributed applications has increased the need for large scale replicated systems. However, existing replication protocols do not address scale and autonomy issues adequately. Further, current application protocol require consistency of different levels, and therefore should be the selection function of consistency in them, in order to have particular semantics of each level. In this paper, server overhead and bottleneck happening in remote procedure call be using server object replication. Therefore access transparency can be improved by sharing object duplicately. So it will Keep up with the consistency within the replicated objects.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.687-689
• /
• 2004

As using of network increases rapidly, performance of system has been deteriorating because of the overhead and bottleneck. Nowadays, High speed I/O network standard, that is a sort of PCI Express, HyperTransport, InfiniBand, and so on, has come out to improve the limites of traditional I/O bus. The InfiniBand Architecture(IBA) provides some protocols to service the applications such as SDP, SRP and IPoIB. In our paper, We explain the architecture of IPoIB (IP over InfiniBand) and its features in channel based I/O network. And so we provide a performance evaluation result of IPoIB which is compared with current network protocol. Our experimental results also show that IPoIB is batter than TCP/IP protocol. For this test, We use the dual processor server systems and Linux Redhat 9.0 operating system.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1253-1261
• /
• 1996

The base station (BS) of CDMA mobile system (CMS) provides mobile call services by controlling call processing functions. The call Processing part of the BS is divided into two components; the base station transceiver subsystem (BTS) and the base station controller (BSC). In this paper, we present the call capacity estimation of the BS about control signals and traffic data of calls by the simulation, and find the bottleneck points and problems which may occur in the BS. In order to estimate the call capacity, first we extract the major parameters for the modeling the BS. Second, we suggest the simulation model for the BS. Third, we estimate the simulation results by finding major objective factors such that the call blocking probability, the utilization ratio and the delay time in the traffic channel elements (TCEs), the BTS interconnection network (BIN)-COMA interconnection network (CIN) trunks, the transcoding channels and the CIN packet router.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.20 no.1
• /
• pp.70-85
• /
• 2021

Deep learning methodology, which has been actively studied in recent years, has improved the performance of artificial intelligence. Accordingly, systems utilizing deep learning have been proposed in various industries. In traffic systems, spatio-temporal graph modeling using GNN was found to be effective in predicting traffic speed. Still, it has a disadvantage that the model is trained inefficiently due to the memory bottleneck. Therefore, in this study, the road network is clustered through the graph clustering algorithm to reduce memory bottlenecks and simultaneously achieve superior performance. In order to verify the proposed method, the similarity of road speed distribution was measured using Jensen-Shannon divergence based on the analysis result of Incheon UTIC data. Then, the road network was clustered by spectrum clustering based on the measured similarity. As a result of the experiments, it was found that when the road network was divided into seven networks, the memory bottleneck was alleviated while recording the best performance compared to the baselines with MAE of 5.52km/h.

• Journal of radiological science and technology
• /
• v.46 no.4
• /
• pp.277-285
• /
• 2023

In this study, pneumonia identification networks with the small number of layers were constructed by using chest X-ray images. The networks had similar trainable-parameters, and the performance of the trained models was quantitatively evaluated with the modification of the network architectures. A total of 6 networks were constructed: convolutional neural network (CNN), VGGNet, GoogleNet, residual network with identity blocks, ResNet with bottleneck blocks and ResNet with identity and bottleneck blocks. Trainable parameters for the 6 networks were set in a range of 273,921-294,817 by adjusting the output channels of convolution layers. The network training was implemented with binary cross entropy (BCE) loss function, sigmoid activation function, adaptive moment estimation (Adam) optimizer and 100 epochs. The performance of the trained models was evaluated in terms of training time, accuracy, precision, recall, specificity and F1-score. The results showed that the trained models with the small number of layers precisely detect pneumonia from chest X-ray images. In particular, the overall quantitative performance of the trained models based on the ResNets was above 0.9, and the performance levels were similar or superior to those based on the CNN, VGGNet and GoogleNet. Also, the residual blocks affected the performance of the trained models based on the ResNets. Therefore, in this study, we demonstrated that the object detection networks with the small number of layers are suitable for detecting pneumonia using chest X-ray images. And, the trained models based on the ResNets can be optimized by applying appropriate residual-blocks.

• ETRI Journal
• /
• v.34 no.1
• /
• pp.102-105
• /
• 2012

To serve the growing demand of the bidirectional information exchange, we propose a single relay selection (RS) scheme for physical-layer network coding (PNC) in a bidirectional cooperative network consisting of two sources and multiple relays. This RS scheme selects a single best relay by maximizing the bottleneck of the capacity region of both information flows in the bidirectional network. We show that the proposed RS rule minimizes the outage probability and that it can be used as a performance benchmark for any RS rules with PNC. We derive a closed-form exact expression of the outage probability for the proposed RS rule and show that it achieves full diversity gain. Finally, numerical results demonstrate the validity of our analysis.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.3 no.2
• /
• pp.18-25
• /
• 2004

As using of network Increases rapidly, performance of system has been deteriorating because of the overhead and bottleneck. Nowadays, high speed I/O network standard, that is a sort of InfiniBand, PCI Express and so on, has come out to improve the limites of traditional I/O bus. The InfiniBand provides some protocols to service the applications such as SDP, SRP and IPoIB. In our paper, We explain the architecture of SDP(Socket Direct Protocol) and its features in channel based I/O network. And so, we provide a result of performance evaluation of SDP which is compared with current network protocol. Our experimental results also show that SDP is better than TCP/IP protocol.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1012-1015
• /
• 2008

The packet capturing becomes a bottleneck in the network intrusion detection and monitoring system as the network performance developing. Many approaches, zero copy, interrupt coalescing and NAPI which attempt to improve packet capturing performance of Linux, are inefficient. PF_RING is a new type of network socket that dramatically improves the packet capture speed, but not perfect. This paper proposes some solutions which can improve the memory utilization and save some data copy time based on the commodity network adapters rather than on the commercial network adapters.