• Journal of The Korean Society of Agricultural Engineers
• /
• 제52권2호
• /
• pp.27-34
• /
• 2010

The PERT is one form of probabilistic network and can have many critical paths in the concept of each work has dispersed complete time. Here we propose two operators to estimate the probabilistic complete time about serial and parallel connections, and in each junction node, probability of critical path is estimated by new operator. Then we compare the estimated results with robability of critical path with deterministic CPM and Monte Carlo simulation (MCS). Our results show that all paths in PERT can be critical path, and proposed operators are efficient and accurate probabilistic calculators compare MCS result.

• Journal of the Korean Operations Research and Management Science Society
• /
• 제33권1호
• /
• pp.35-49
• /
• 2008

To load a container in a yard block onto a ship, a Transfer Crane (TC) moves to a target yard bay, then its hoist picks up a selected container and loads it onto a waiting Yard Truck (YT). An optimal routing problem of Transfer Crane is a decision problem which determines a given TC's the visiting sequence of yard-bays and the number of containers to transfer from each yard-bay. The objective is to minimize the travel time of the TC between yard-bays and setup time for the TC in a visiting yard. In this paper, we shows that the problem is NP-complete, and suggests a new formulation for it. Using the new formulation for the problem, we investigate some characteristics of solutions, a lower and upper bounds for it. Moreover, our lower and upper bound is very efficient to applying some instances suggested in a previous work.

• Journal of the military operations research society of Korea
• /
• 제17권1호
• /
• pp.146-158
• /
• 1991

In this paper, we deal with the TSP (Traveling Salesperson Problem) which is well-known as NP-complete optimization problem. the TSP is applicable to network routing. task allocation or scheduling. and VLSI wiring. Well known numerical methods such as Newton's Metheod. Gradient Method, Simplex Method can not be applicable to find Global Solution but the just give Local Minimum. Exhaustive search over all cyclic paths requires 1/2 (n-1) ! paths, so there is no computer to solve more than 15-cities. Heuristic algorithm. Simulated Annealing, Artificial Neural Net method can be used to get reasonable near-optimum with polynomial execution time on problem size. Therefore, we are able to select the fittest one according to the environment of problem domain. Three methods are simulated about symmetric TSP with 30 and 50-city samples and are compared by means of the quality of solution and the running time.

• Journal of Positioning, Navigation, and Timing
• /
• 제9권2호
• /
• pp.139-147
• /
• 2020

In this paper, design measure were proposed for the construction of terminal systems for airborne platforms, which are key element in the Joint Tactical Data Link System (JTDLS) complete system. The Korean perfect tactical data link (JTDLS) is a communication system to establish an independent tactical data link network and needs to develop a MIDS-LVT (Link-16) communication terminal for datalink. Once a Ground/Navy JTDLS terminal system is established around airborne platform, it will be possible to break away from reliance on NATO-based tactical data link joint operations and establish independent Korean surveillance reconnaissance real-time data sharing and tactical data link operations concepts. in this paper, the essential development elements of airborne platform mounting and operable JTDLS terminals are presented, and the concept of system design is proposed to embody them. Further, improved system performance was analyzed by applying the concepts of complex relative navigation system and Advanced TDMA protocol for the deployment of airborne tactical datalink networks.

• Proceedings of the Korea Society for Energy Engineering kosee Conference
• /
• 한국에너지공학회 1997년도 추계학술발표회 논문집
• /
• pp.47-53
• /
• 1997

Dynamic models have been developed for the coal gasification process by using a modular approach method. The complete unit is divided, for the convenience of the analysis, into several sections, viz. the coal feeding system, the gasifier, the gas cooler, the valves, the pumps, etc. The dynamic behaviour of each section is described in mathematical terms and each term is modulized into several submodels consisting of the complete process. To represent the behaviour of the fluid flow, the hydraulic network is proposed. Results for the more important system variables are presented and discussed. There dynamic models enable process and control engineers to quickly review a wide range of alternative operating and control strategies and help operators to easily understand the process dynamics and eventually can be applied to the design of commercial scale IGCC plants.

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2003년도 추계학술발표논문집 (중)
• /
• pp.911-914
• /
• 2003

The prevention of D-Dos Attack requires to install filters at As border routers. This follows that finding minimum number of filters - VC(Vertex Cover), which is NP-complete problem. So, We propose improved 'Approximate VC' which is more efficient to real AS topology using topology property. Simulation shows that our algorithm, improved 'Approximated VC' enables us to reduce 25% VC nodes in comparison with 'Approximated VC'.

• Journal of Korean Society of Transportation
• /
• 제23권4호
• /
• pp.81-91
• /
• 2005

The Traveling Salesman Problem(TSP) is one of the NP-complete (None-deterministic Polynomial time complete) route optimization problems. Its calculation time increases very rapidly as the number of nodes does. Therefore, the near optimum solution has been searched by heuristic algorithms rather than the real optimum has. This paper reviews the Ant System Algorithm(ANS), an heuristic algorithm of TSP and its applicability in the parcel delivery service in Korea. ASA, which is an heuristic algorithm of NP-complete has been studied by M. Dorigo in the early 1990. ASA finds the optimum route by the probabilistic method based on the cumulated pheromone on the links by ants. ASA has been known as one of the efficient heuristic algorithms in terms of its calculation time and result. Its applications have been expanded to vehicle routing problems, network management and highway alignment planning. The precise criteria for vehicle routing has not been set up in the parcel delivery service of Korea. Vehicle routing has been determined by the vehicle deriver himself or herself. In this paper the applicability of ASA to the parcel delivery service has been reviewed. When the driver s vehicle routing is assumed to follow the Nearest Neighbor Algorithm (NNA) with 20 nodes (pick-up and drop-off places) in $10Km{\times}10Km$ service area, his or her decision was compared with ASA's one. Also, ASA showed better results than NNA as the number of nodes increases from 10 to 200. If ASA is applied, the transport cost savings could be expected in the parcel delivery service in Korea.

• Journal of KIISE:Information Networking
• /
• 제37권5호
• /
• pp.327-338
• /
• 2010

Complete Subtree scheme(CS) is a well known broadcast encryption scheme to perform group rekeying in a stateless manner. However, statelessness comes at a cost in terms of storage and message overhead in transmitting key material. We propose a Merged Complete Subtree scheme(MCS) to reduce the communication overhead. It is more practical to make broadcast encryption schemes in network environments with limited bandwidth resources. We define all possible subset unions for ever two subsets of CS as new subsets having own key. The modification causes more storage overhead. Nevertheless, it is possible to make the size of a header, including key materials, half using subset unions of MCS, because the size of a header depends on the number of used subsets. Our evaluation therefore shows that the proposed scheme significantly improves the communication overhead of CS, reducing by half the rekey communication cost. The proposed scheme has the advantage of rekey communication cost when the number of revoked users is significant percentage of the number of potential users. The proposed scheme is fully collusion resistant.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5546-5559
• /
• 2019

Facial action units (AUs) have recently drawn increased attention because they can be used to recognize facial expressions. A variety of methods have been designed for frontal-view AU detection, but few have been able to handle multi-view face images. In this paper we propose a method for multi-view facial AU detection using a fused multilayer, multi-task, and multi-label deep learning network. The network can complete two tasks: AU detection and facial view detection. AU detection is a multi-label problem and facial view detection is a single-label problem. A residual network and multilayer fusion are applied to obtain more representative features. Our method is effective and performs well. The F1 score on FERA 2017 is 13.1% higher than the baseline. The facial view recognition accuracy is 0.991. This shows that our multi-task, multi-label model could achieve good performance on the two tasks.

• Korean Management Science Review
• /
• 제29권1호
• /
• pp.143-152
• /
• 2012

Location area planning (LAP) problem is to partition the cellular/mobile network into location areas with the objective of minimizing the total cost in location management. The minimum cost has two components namely location update cost and searching cost. Location update cost is incurred when the user changes itself from one location area to another in the network. The searching cost incurred when a call arrives, the search is done only in the location area to find the user. Hence, it is important to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking cost is a minimum. The complete mobile network is divided into location areas. Each location area consists of a group of cells. This partitioning problem is a difficult combinatorial optimization problem. In this paper, we use particle swarm optimization (PSO) to obtain the best/optimal group of cells for 16, 36, 49, and 64 cells network. Experimental studies illustrate that PSO is more efficient and surpasses those of precious studies for these benchmarking problems.