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

The size of time constaints is the critical bottleneck of the Crew Scheduling Problem (CSP). This paper deals with a method to extract the minimum required time constraints by k-shortest path algorithm. These time constraints are added as the "insurance constraints" to avoid the unnecessary tree search, which are very time-consuming procedures, for the integer solutions. The computational results show that the problem size in LP formulation could be reduced by our method.

• Proceedings of the KIEE Conference
• /
• 1998.11a
• /
• pp.201-203
• /
• 1998

This paper presents the framework for analysis of small-signal stabili1ty. In this framework the equilibrium points of system DAE model are traced using continuation method and instability points are determined on the solution path. Especially Implicit shift QR-modified ARnoldi method is utilized to calculated the rightmost eigenvalues. ISPS measure is utilized to determine critical parameters.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1892-1897
• /
• 2012

In this paper, efficient CNU(Check Node Update) algorithms are analyzed for high speed LDPC decoding in DVB-S2 standard. In aspect to CNU methods, there are some kinds of CNU methods. Among of them, MP (Min Product) method is quite often used in LDPC decoding. However MP needs LUT (Look Up Table) that is critical path in LDPC decoding speed. A new SC-NMS (Self-Corrected Normalized Min-Sum) method is proposed in the paper. NMS needs only normalized scaling factor instead of LUT and compensates the overestimation of MP approximation. In addition, SC method is proposed. It gives a faster convergence toward a decoded codeword. If a message change its sign between two iterations, it is not reliable and to avoid to propagate noisy information, its module is set to 0. The performance of SC-NMS has a little degrade compare to MP by 0.1 dB, however considering computational complexity and decoding speed, SC-NMS algorithm is optimal method for CNU algorithm.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.121-131
• /
• 2004

The K-shortest path algorithms are largely classified into two groups: oneis for finding loopless path (simple path), another loop paths. In terms of cimputational complexities, in general the loop-paths-finding ones are considered more efficient and easier to be handled than the loopless-paths-finding. The entire path deletion methods have been known as the best efficient algorithms among the proposed K-shortest path algorithms. These algorithms exploit the K-th network transformation to prevent the same path, which was already selected as the (K-1)th path, from being redetected. Nevertheless, these algorithms have a critical limitationto be applied in the practical traffic networks because the loops, in which the same modes and links can be unlimitedly repeated, are not preventable. This research develops a way to be able to selectively control loop-paths by applying link-label. This research takes an advantage of the link-based shortest path algorithms that since the algorithms can take care of two links simultaneouslyin the searching process, the generation of loops can be controlled in the concatenation process of the searched link and the preceded link. In concatenation of two links, since the precede link can be treated a sub-shortest to this link from the origination, whether both the node and the link of the searched link were already existed or not can be evaluated. Terefore, both the node-loopless path, in which the same node is not appeared, and the link-loopless, in which the same link is not appeared, can be separately controlled. Especially, the concept of the link-loopless path is expended to take into consideration reasonable route choice behaviors such as U-Turn, P-Turn, and Turn-Penalty, which are frequently witnessed in urban traffic network with intersections. The applicability of the proposed method is verified through case studies.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.203-214
• /
• 2004

This paper presents a practical application of possibilistic programming in a information system projects planning model. The estimate of the parameters of the model is often a problematic task for the decision maker(DM), Who has imprecise information or express his considerations subjectively. In this case. possibilistic decision making models can provide an important aspect in handling practical decision making problems. We suggest CPM(Critical Path Method) applying possibilistic programming. CPM is an approach to planning and coordinating large projects by directing managerial focus to the project's most critical aspects and providing completion time of project and beginning time of each activity. This model is an aid in the control of considering aspiration levels by the DM, the fuzziness of decision making, and computational efficiency. The problem is solved by using GINO computer package and the best compromised solution is found.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1281-1286
• /
• 2010

Ant-based routing methods belong to a class of ant colony optimization algorithms which apply the behavior of ants in nature to routing mechanism. Since the topology of mobile ad-hoc network(MANET) changes dynamically, it is needed to establish paths based on the local information. Subsequently, it is known that routing in MANET is one of applications of ant colony optimization. In this paper, we propose a routing method, namely EPMAR, which enhances SIR in terms of route selection method and the process upon link failure. The performance of the proposed method is compared with those of AntHocNet and SIR. Based on he analysis, it is proved that the proposed method provided higher packet delivery ratio and less critical link failure than AntHocNet and SIR.

• Journal of the Korea Institute of Building Construction
• /
• v.12 no.6
• /
• pp.558-565
• /
• 2012

Schedule management of construction work is critical to completing construction projects within a given period of time. Many efforts have been made and multiple tools have been developed to support the management of construction projects using smart devices such as smartphones and tablet PCs. This study proposed a method for managing construction schedules via a smart device using Flash. The interactive and graphic properties of Flash enable the development of an app that can allow a field manager to manage schedules easily and efficiently. A prototype was implemented using Adobe Flex Builder, and a sample network was applied in a smartphone. It is convenient for a construction manager to manage construction schedules using the tool because Flash controls graphic components easily. In further studies, network diagrams such as CPM (Critical Path Method) should be developed and applied to the app.

• Geotechnical Engineering
• /
• v.5 no.2
• /
• pp.45-56
• /
• 1989

The influence of stress path on the deformation characteristics of clay has been studied through a series of stress-path controlled triaxial tests on artificially sedimented and normally con- solidated Kaolinite. It has been found that there exists a critical stress increment ratio, Kc, in which stress·strain characteristics possesses a linear relationships and beyond Kc, strain hardening. A modified hyperbolic constitutive model for the strain hardening behavior has been formulated based on the Drnevich's hyperbolic function. And, a method of settlement analyses has been Proposed wherein the effect of stress path during consolidation is taken into account.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.430-448
• /
• 2001

In navigation system, a primary task is to compute the minimum cost route from the current location to the destination. One of major problems for navigation systems is that a significant amount of computation time is required when the digital road map is large. Since navigation systems are real time systems, it is critical that the path be computed while satisfying a time constraint. In this paper, we have developed a HiTi(Hierarchical MulTi) graph model for hierarchically structuring large digital road maps to speedup the minimum cost path computation. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a digital road map for its computation. We prove that the shortest path computed by SPAH is the optimal. Our performance analysis of SPAH also showed that it significantly reduces the computation time over exiting methods. We present an in-depth experimental analysis of HiTi graph method by comparing it with other similar works.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.514-515
• /
• 2021

This paper presents a method to find a target using UAVs in LoRa communication environment. The proposed method proposes a UAV flight path so that the target signal can be found without blind spots. The flight path was changed by using the intensity of the transmitted signal during the flight using the variation of the signal strength. We verified the proposed method by simulation and confirmed that it takes a long time to track the target, although the efficiency of the 3 flights is high. It is best to fly three UAVs to reduce time to find target and increase efficiency when the time is a critical factor. The LoRa communication lowers the production cost and makes it possible to construct the system at low cost.