• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.112-114
• /
• 1993

This paper presents a partitioning technique for equivalent models to large scale power system. The proposed partitioning technique is utilized by using a heuristic approach based on distributed array processor and the coherent groupings of generator buses. In this paper the reduced Ward-PV method considering the characteristics of buses is used to equivalent models of external system. The technique is demonstrated on New England system with 39 buses, 46 lines and 10 generators.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.4
• /
• pp.11-19
• /
• 2013

In this paper we present a reodered simulated-anealing algorithm which is capable of applying odering based k-way partitioned clusters. This method is used for improvement of the objectives of partitioning which are k-way partitioned by using odering algorithm. It changes the positions of the clusters and the vertices in each clusters. Reodered vertices are splitted by using DP-RP method and this process has an opportunity to improve the objective functions. This algorithm has advantages to improve the quality of the solutions for various purposes. Experimental results on several graphs demonstrate that proposed algorithm provides substantial enhancement.

• Journal of The Korean Astronomical Society
• /
• v.52 no.2
• /
• pp.49-55
• /
• 2019

The New Vacuum Solar Telescope (NVST) is the largest solar telescope in China. When using CCDs for imaging, equal-thickness fringes caused by thin-film interference can occur. Such fringes reduce the quality of NVST data but cannot be removed using standard flat fielding. In this paper, a correction method based on multi-scale decomposition and adaptive partitioning is proposed. The original image is decomposed into several sub-scales by multi-scale decomposition. The region containing fringes is found and divided by an adaptive partitioning method. The interference fringes are then filtered by a frequency-domain Gaussian filter on every partitioned image. Our analysis shows that this method can effectively remove the interference fringes from a solar image while preserving useful information.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.315-318
• /
• 2007

랜덤 테스트(RT)는 가능한 입력 도메인에서 임의의 입력 값을 선택하여 테스트 케이스를 생성하고 테스트를 수행하는 기본적인 블랙 박스 테스트 기법이다. 랜덤 테스트의 성능을 향상 시키기 위해서 오류 패턴을 고려한 다양한 Adaptive Random Testing (ART) 알고리즘들이 제안되어 왔다. 그 중 Distance-Based ART (D-ART), Restricted Random Testing (RRT)이 좋은 성능을 보이고 있지만, 수행시간이 너무 느리다는 단점이 있어, 이를 대체할 수 있는 여러 ART 방법들이 제안되고 있다. 그 중, Adaptive Random Testing through Iterative Partitioning (IP-ART)가 가장 좋은 성능과 빠른 수행시간을 보인다. 본 논문에서는 IP-ART 의 성능을 더욱 향상시킬 수 있는 방법을 제안하고, 시뮬레이션을 통하여 향상된 성능을 평가해 보았다.

• Journal of the Korean Applied Science and Technology
• /
• v.35 no.3
• /
• pp.643-653
• /
• 2018

This study was investigated the mechanism of action of n-6/n-3 fatty acid ratio on the metabolic partitioning of blood glycerolipids by in vivo monitoring technique in hyperlipidemic animal model rats. The ratio of cholesteryl 14C-oleate metabolized in the liver of total glycerolipids was lower in the order of n-6/n-3 ratios of 4:1, 15:1, 30:1 and control group (p<0.05). The secretion amount of phospholipid was higher in the order of n-6/n-3 ratio 4:1, 15:1, 30:1 than the control (p<0.05). The secretion amount of triglyceride was lower in especially 4:1, in order of n-6/n-3 4:1, 15:1 and 30:1 compared with the control. The ratio of phospholipid partitioning to total glycerolipid was high in orfer of n-6/n-3 ratio 4:1, 15:1, 30:1 and control (p<0.05). The triacylglycerol partitioning (%) via liver was higher 72.97, 75.93, 78.12% in n-6/n-3 4;1, 15:1, 30:1, respectively than the control of 82.25%, according to increased n-6/n-3 (p<0.05). The phospholipid partitioning (%) was lower 25.15, 18.87, 18.15% in n-6/n-3 4;1, 15:1, 30:1, respectively, compared to control 11.04%, according to increased n-6/n-3 (p<0.05).

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.8 no.1
• /
• pp.15-21
• /
• 2006

This study was conducted to understand the regulation mechanism of carbohydrate allocation and partitioning of one-year-old seedlings of Betula schmidtii with Cd treatment, and to assess tolerance against Cd toxicity among five half-sib families on the basis of carbon allocation and partitioning. Seedlings were treated with $CdSO_4$ solution of 0, 0.2, 0.4, and 0.6 mM for two months. After harvesting, carbohydrate concentrations were analyzed for leaves, stems and roots of seedlings. Carbohydrate concentration for Cd-treated seedlings decreased in comparison with control plants, even though Cd effects were significantly different among five families. Meanwhile, Cd treatment decreased carbohydrate allocation in leaves and increased allocation in roots. In addition, partitioning of glucose in leaves was increased by Cd treatment, but partitioning of sucrose and starch in leaves decreased. In Cd-treated roots, partitioning of glucose, sucrose and starch increased. On the basis of carbohydrate allocation patterns, 'Family No. 7' (of the five families studied) was considered as the most sensitive family to Cd toxicity because the decrease of carbohydrate concentration and the change of carbohydrate allocation pattern after Cd treatment were relatively greater.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.7
• /
• pp.291-298
• /
• 2024

Despite its wide application, cloud computing raises privacy leakage concerns because users should send their private data to the cloud. Homomorphic encryption (HE) can resolve the concerns by allowing cloud servers to compute on encrypted data without decryption. However, due to the huge computation overhead of HE, simply executing an entire cloud program with HE causes significant computation. Manually partitioning the program and applying HE only to the partitioned program for the cloud can reduce the computation overhead. However, the manual code partitioning and HE-transformation are time-consuming and error-prone. This work proposes a new homomorphic encryption enabled annotation-guided code partitioning compiler, called Heapa, for privacy preserving cloud computing. Heapa allows programmers to annotate a program about the code region for cloud computing. Then, Heapa analyzes the annotated program, makes a partition plan with a variable list that requires communication and encryption, and generates a homomorphic encryptionenabled partitioned programs. Moreover, Heapa provides not only two region-level partitioning annotations, but also two instruction-level annotations, thus enabling a fine-grained partitioning and achieving better performance. For six machine learning and deep learning applications, Heapa achieves a 3.61 times geomean performance speedup compared to the non-partitioned cloud computing scheme.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.125-128
• /
• 2001

본 논문은 파동분할(Wave partitioning) 방식을 이용한 순차적(Sequential) 메쉬 부호화 방식을 제안한다. 파동분할 방식은 호수에 물방울이 퍼져 나가는 자연 원리를 이용하여 초기 삼각형의 주위에 삼각형을 덧붙여 가면서 하나의 SPB(Small Processing Block)을 만들어내는 방식이다. 이 방식을 이용하여 하나의 모델을 서로 독립적인 SPB로 분할하고, 각각의 SPB 내에서 초기 삼각형을 중심으로 그것에 덧붙여진 삼각형에 의해 만들어진 원 또는 반원을 찾는다. 또한 그 원주를 따라 순차적으로 꼭지점을 구하면 각각의 꼭지점들은 일정한 패턴으로 늘어서게 되고, 이를 이용하여 연결성 정보 없이 부가 정보만 이용하여 모델을 순차적으로 무손실 부호화한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.718-721
• /
• 2004

This paper introduces a novel method of partitioning a cyclic workflow graph into the subgraphs of acyclic flows. The way of iterative classification of nodes according to feedback structures and deriving subgraphs of acyclic flows is described with illustrative examples. The proposed method allows a cyclic workflow model to be analyzed further, if necessary, with several smaller subflows, which are all acyclic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.215-224
• /
• 1997

This paper addresses the vertical class fragmentation in distributed object-oriented databases. In the proposed vertical fragmentation, after producing the attribute fragment by partitioning attributes, then the method fragment is produced by gathering methods referring the attribute in each fragment. For partitioning attributes, we define query access matrix(QAM) and method access matrix(MAM) to express attributes that method refers, and extend QAM, MAM and attribute usage matrix(AUM) to universal class environment for representing relationship among other classes through class hierarchy and class composite hierarchy.