• Anatomy and Cell Biology
• /
• v.56 no.4
• /
• pp.428-434
• /
• 2023

Pulmonary veins (PVs) and their myocardial sleeves play an important role in the development of atrial fibrillation. Hence, detailed knowledge of PV anatomy is required to improve the procedural success rate and prevent complications during cardiac procedures. The aim of this study was to evaluate the PV anatomy along with anatomical variations in the Indian population. Total 100 formalin fixed cadaveric hearts were examined. The number and pattern of the PVs were observed along with the measurement of their horizontal and vertical diameters. The ovality index for each PV was calculated. Classical PV pattern was observed in 62% cases. Variant pattern like additional right middle PV pattern and left common PV pattern were found in 20% and 10% cases respectively. A separate pattern with presence of both right middle PV and left common PV was observed in 6% cases. In the classical pattern right superior PV was the largest followed by right inferior, left superior and left inferior PV. The additional right middle PV had the smallest diameter whereas the left common PV had the largest diameter. Almost all the veins had greater vertical diameters in comparison to horizontal diameters. The variant PVs were oval and had greater ovality index compared to the normal PVs. In classical pattern 54.8% hearts whereas in variant pattern 79% hearts had one or more oval PV. The given data can help clinicians for planning and execution of various interventional and electrophysiological procedures involving PVs.

• Journal of the Korea Society for Simulation
• /
• v.15 no.2
• /
• pp.1-12
• /
• 2006

As the needs of intelligent systems increase, there have been diverse approaches that combine artificial intelligence (AI) and simulation in the last decade. RG-DEVS, which is the basis for this paper, embedded AI planning techniques into the simulation modeling methodology of DEVS, in order to specify dynamically a simulation model. However, a hierarchy concept, which is used for various types of problem solving systems. is not included in the planning of RG-DEVS. The hierarchy concept reduces the computational cost of planning by reducing the search space, and also makes it easy to apply the hierarchical process flow of a target system to planning. This paper proposes Hierarchical RG-DEVS (HRG-DEVS) in an attempt to insert hierarchical planning capability into RG-DEVS. For the verification of the proposed modeling methodology, HRG-DEVS is applied to model the block's world problem of ABSTRIPS, which is a classical planning problem.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.215-215
• /
• 1988

This paper presents a fuzzy set theory based formulation and heuristic which will allow plant layout problems to be solved for more than two input goals with different weights. The heuristic combines a construction and improvement procedure to generate a good layout from the formulation. To test the effectiveness of the heuristic, a set of examples previously used by various authors is solved and the results are compared to those from other known heuristics. The comparison indicates that the proposed method performs well for each of seventeen classical test problems.

• Korean Management Science Review
• /
• v.13 no.2
• /
• pp.215-232
• /
• 1996

This paper presents a fuzzy set theory based formulation and heuristic which will allow plant layout problems to be solved for more than two input goals with different weights. The heuristic combines a construction and improvement procedure to generate a good layout from the formulation. To test the effectiveness of the heuristic, a set of examples previously used by various authors is solved and the results are compared to those from other known heuristics. The comparison indicates that the proposed method performs well for each of seventeen classical test problems.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.9
• /
• pp.6290-6296
• /
• 2015

More informative ones of heuristics can help to conduct search more efficiently to obtain solution plan. However, in general, to derive highly informative heuristics from problem specifications requires lots of computational effort. To address this problem, we propose an State-Action based Planning Graph(SAPG) and Action-based heuristics for solving planning problems more efficiently. The SAPG is an extended one to be applied to can find interactions between subgoal & goal conditions from the relaxed planning graph which is a common means to get heuristics for solving the planning problems, Action-based heuristics utilizing SAPG graphs can find interactions between subgoal & goal conditions in an effective way, and then consider them to estimate the goal distance. Therefore Action-based heuristics have more information than the existing max and additive heuristics, also requires less computational effort than the existing overlap heuristics. In this pager. we present the algorithm to compute Action-based heuristics, and then explain empirical analysis to investigate the accuracy and the efficiency of the Action-based heuristics.

• The KIPS Transactions:PartB
• /
• v.18B no.1
• /
• pp.29-38
• /
• 2011

In order to derive domain-independent heuristics from the specification of a planning problem, it is required to relax the given problem and then solve the relaxed one. In this paper, we present a new planning graph, Merged Planning Graph(MPG), and GD heuristics for solving contingent planning problems with both uncertainty about the initial state and non-deterministic action effects. The merged planning graph is an extended one to be applied to the contingent planning problems from the relaxed planning graph, which is a common means to get effective heuristics for solving the classical planning problems. In order to get heuristics for solving the contingent planning problems with sensing actions and non-deterministic actions, the new graph utilizes additionally the effect-merge relaxations of these actions as well as the traditional delete relaxations. Proceeding parallel to the forward expansion of the merged planning graph, the computation of GD heuristic excludes the unnecessary redundant cost from estimating the minimal reachability cost to achieve the overall set of goals by analyzing interdependencies among goals or subgoals. Therefore, GD heuristics have the advantage that they usually require less computation time than the overlap heuristics, but are more informative than the max and the additive heuristics. In this paper, we explain the experimental analysis to show the accuracy and the search efficiency of the GD heuristics.

• The KIPS Transactions:PartB
• /
• v.16B no.6
• /
• pp.489-496
• /
• 2009

Hierarchical Task Network(HTN) planning, a typical planning method for effectively taking advantage of domain-specific control knowledge, has been widely used in complex real applications for a long time. However, it still lacks theoretical formalization and standardization, and so there are some differences among existing HTN planners in terms of principle and performance. In this paper, we present an effective way to translate a HTN planning domain specification into the corresponding standard PDDL specification. Its main advantage is to allow even many domain-independent classical planners to utilize domain-specific control knowledge contained in the HTN specifications. In this paper, we try our translation-based approach to three different domains such as Blocks World, Office Delivery, Hanoi Tower, and then conduct some experiments with a forward-chaining heuristic state-space planner, FF, to analyze the efficiency of our approach.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.419-427
• /
• 2007

In wavelength-division-multiplexing(WDM) networks a link failure may cause the failure of several high-bit-rate optical channels, thereby leading to large data loss. Recently, various protection and restoration mechanisms have been proposed to efficiently deal with this problem in mesh networks. Among them, dedicated path protection(DPP) is a promising candidate because of its ultra-fast restoration time and robustness. In this work we investigate the issue of planning and optimization of WDM networks with DPP. Integer linear programming(ILP), in particular, is one of the most common exact method to solve the design optimization problem for protected WDM networks. Traditional ILP formalizations to solve this problem rely on the classical flow or route formulation approaches, but both these approaches suffer from a excessively high computational burden. In this paper, we present a variable-aggregation method that has the ability of significantly reducing the complexity of the traditional flow formulation. We compare also the computational burden of flow formulation with variable aggregation both with the classical flow and route formulations. The comparison is carried out by applying the three alternative methods to the optimization of two case-study networks.

• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.35 no.4
• /
• pp.115-126
• /
• 2019

Construction of the Pyongyang Railroad Station began in 1907 as an important foothold for the Japanese colonization of the Korean Peninsula and the further invasion of Manchuria. As Pyongyang gradually grew in size and political significance, the Pyongyang Station came to have two responsibilities: Fulfill its functional role and serve as a monument to the growing dignity of the city. This study argues that the Pyongyang Station, newly rebuilt in 1958, was the first building to solve the demands for both functional expansion and the pursuit of monumentality. Stylistically, the original single-story wooden building became a three-story classical masonry building. The stylistic change symbolizes the political shift by which the building was reconstructed. The simple wooden building built by the Japanese, representing Pyongyang's status as a colonial provincial town, was transformed into an imposing gateway for the capital city of a newly born socialist state. Socialist Realism, correctly described by its slogan "socialist in content and national in form," harmoniously blended classical architecture, socialist symbols, and Korean local motifs. This study is significant in that it illustrates the historical changes and continuity of the Pyongyang Station from 1907, when it was first built, through the "liberated space" to the postwar reconstruction period of the 1950s.

• Journal of Digital Convergence
• /
• v.11 no.7
• /
• pp.173-184
• /
• 2013

Quantum Information Processing and Communication, based on the physical laws of Quantum mechanics, exploits fundamentally new modes of computation and communication and holds the promise of immense computing power beyond the capabilities of any classical computer. In Quantum Information Processing, replacing bits with qubits, one makes two-state quantum systems that do not possess in general the definite values of 0 or 1 of classical bits, but rather are in a so-called. "coherent superposition", of the two. Full exploitation of this additional freedom implies that new processing devices need to be designed and implemented, and that a large scale quantum computer can in principle be built. New discoveries will enable a range of exciting new possibilities including: greatly improved sensors with potential impact for mineral exploration and improved medical imaging and a revolutionary new computational paradigm that will likely lead to the creation of computing devices capable of efficiently solving problems that cannot be solved on a classical computer. In short, Quantum computing is an economy game changer, with a potential of disrupting entire industries and creating new ones.