• Title/Summary/Keyword: total graph

Search Result 245, Processing Time 0.039 seconds

$K^4$-chain Reductions for Computing 2-terminal Reliability in an Undirected Network (무방향 네트워크의 2-터미날 신뢰성 계산을 위한 $K^4$-chain 축소)

  • 홍정식
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.21 no.3
    • /
    • pp.215-225
    • /
    • 1996
  • For an undirected stochastic network G, the 2-terminal reliability of G, R(G) is the probability that the specific two nodes (called as terminal nodes) are connected in G. A. typical network reliability problem is to compute R(G). It has been shown that the computation problem of R(G) is NP-hard. So, any algorithm to compute R(G) has a runngin time which is exponential in the size of G. If by some means, the problem size, G is reduced, it can result in immense savings. The means to reduce the size of the problem are the reliability preserving reductions and graph decompositions. We introduce a net set of reliability preserving reductions : the $K^{4}$ (complete graph of 4-nodes)-chain reductions. The total number of the different $K^{4}$ types in R(G), is 6. We present the reduction formula for each $K^{4}$ type. But in computing R(G), it is possible that homeomorphic graphs from $K^{4}$ occur. We devide the homemorphic graphs from $K^{4}$ into 3 types. We develop the reliability preserving reductions for s types, and show that the remaining one is divided into two subgraphs which can be reduced by $K^{4}$-chain reductions 7 polygon-to-chain reductions.

  • PDF

Structural Analysis of Cooking Recipe Texts - Based on Kimchi Jjigae Recipe - (요리레시피의 텍스트 구조해석 - 김치찌개 레시피 중심으로 -)

  • Choi, Jiyu;Han, Gyusang
    • The Korean Journal of Community Living Science
    • /
    • v.28 no.2
    • /
    • pp.191-201
    • /
    • 2017
  • This study compared and analyzed the structures of cooking recipes in order to identify the overall cooking method and develop an efficient method for analyzing cooking recipes. We present procedural texts using a flow graph, which can be referred to as a recipe tree, to represent cooking recipes and the database. A total of 110 kimchi jjigae recipes were identified and classified as 'portion', 'kinds of ingredients', and 'number of cooking deployment'. Recipes for two persons were the most common (43.6%), and 7-13 kinds of ingredients accounted for 50% of kimchi jjigae recipes. Kimchi presented the highest frequency at 78 cases, and pork showed the high frequency at 30 cases. To identify cooking deployment, step 6 was the highest, followed by step 5 (17.3%), step 7 (17.3%), step 4 (11.8%), and step 3 (9.1%). When analyzing the frequency of the relationship between ingredients and action in a recipe expression, Food (F) and Action by the chef (Ac) showed the highest rates at 11.29 and 12.30, respectively, in the cooking process. For frequencies of dependency relation expression in recipes, d-obj (direct object) was the highest at 13.56. The proposed method provides users more efficient and easier access to recipes suitable for their cooking skills.

Optimizing Bi-Objective Multi-Echelon Multi-Product Supply Chain Network Design Using New Pareto-Based Approaches

  • Jafari, Hamid Reza;Seifbarghy, Mehdi
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.4
    • /
    • pp.374-384
    • /
    • 2016
  • The efficiency of a supply chain can be extremely affected by its design which includes determining the flow pattern of material from suppliers to costumers, selecting the suppliers, and defining the opened facilities in network. In this paper, a multi-objective multi-echelon multi-product supply chain design model is proposed in which several suppliers, several manufacturers, several distribution centers as different stages of supply chain cooperate with each other to satisfy various costumers' demands. The multi-objectives of this model which considered simultaneously are 1-minimize the total cost of supply chain including production cost, transportation cost, shortage cost, and costs of opening a facility, 2-minimize the transportation time from suppliers to costumers, and 3-maximize the service level of the system by minimizing the maximum level of shortages. To configure this model a graph theoretic approach is used by considering channels among each two facilities as links and each facility as the nodes in this configuration. Based on complexity of the proposed model a multi-objective Pareto-based vibration damping optimization (VDO) algorithm is applied to solve the model and finally non-dominated sorting genetic algorithm (NSGA-II) is also applied to evaluate the performance of MOVDO. The results indicated the effectiveness of the proposed MOVDO to solve the model.

Test Scheduling Algorithm of System-on-a-Chip Using Extended Tree Growing Graph (확장 나무성장 그래프를 이용한 시스템 온 칩의 테스트 스케줄링 알고리듬)

  • 박진성;이재민
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.3
    • /
    • pp.93-100
    • /
    • 2004
  • Test scheduling of SoC (System-on-a-chip) is very important because it is one of the prime methods to minimize the testing time under limited power consumption of SoC. In this paper, a heuristic algorithm, in which test resources are selected for groups and arranged based on the size of product of power dissipation and test time together with total power consumption in core-based SoC is proposed. We select test resource groups which has maximum power consumption but does not exceed the constrained power consumption and make the testing time slot of resources in the test resource group to be aligned at the initial position in test space to minimize the idling test time of test resources. The efficiency of proposed algorithm is confirmed by experiment using ITC02 benchmarks.

A Study on State Analysis of Substation Using PMU (PMU를 이용한 변전소 상태 해석에 관한 연구)

  • Tae-Hee Kim;Kyung-Min Lee;Cheol-Won Park;Dong-Hoon Jeon;Dae-Yoon Kwon;Yong-Sung Choi
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.37 no.3
    • /
    • pp.304-308
    • /
    • 2024
  • In this paper, in order to analyze the PMU data of the accident section, we collected the raw data of a total of 35 PMU installed at the Yeonggwang substation and tried to find a way to analyze the data, and analyzed the data using Excel format and formula. As a result, the three-phase voltage and current data of the PMU were calculated using formulas in Excel and interpreted as effective and reactive power, and it was possible to check the effective and reactive power of the accident section through the graph to see why it was different from before the accident. As a result, it was confirmed that each power was greatly reduced in the graph of the effective and reactive power of the accident section, and it was confirmed that the loss occurred as the power of the accident section was greatly reduced.

Graphs Used in ASEAN Trading Link's Annual Reports: Evidence from Thailand, Malaysia, and Singapore

  • Kurusakdapong, Jitsama;Tanlamai, Uthai
    • Journal of Information Technology Applications and Management
    • /
    • v.22 no.3
    • /
    • pp.65-81
    • /
    • 2015
  • This study reports a preliminary finding of the types and numbers of graphs being presented in the annual reports of about thirty top listed companies trading publicly in the stock markets of three countries-Thailand (SET), Malaysia (BM), and Singapore (SGX)-that were chosen based on their inclusion in the ASEAN Stars Index under the ASEAN Trading Link project. A total of 6,753 graphs from nineteen sectors were extracted and examined. Banking, real estate, and telecommunications are ranked the three most condense sectors, accounting for 50.2% of the total number of graphs observed. The three most used graphs are the Conservative Bar, Donut graph and Stack Bar. Less than one percent of Infographic type graphs were used. The five most depicted graphed variables are Asset, Revenue, Net profit, Liability, and Dividend. Using rudimentary framework to detect distorted or misleading statistical graphs, the study found 60.6% of the graphs distorted across the three markets, SET, BM, and SGX. BM ranked first in percentages of graphs being distortedly presented (73%). The other two markets, SET and SGX, have about the same proportions, 53.88% and 53.03%, respectively. Likewise, the proportions of Well-designed versus Inappropriate-designed graphs of the latter two markets are a little over one time (SET = 1 : 1.17; SGX = 1 : 1.13), whereas the proportion is almost triple for the BM market (BM = 1 : 2.70). In addition, the trend of distorted graphs found is slightly increasing as the longevity of the ASEAN Stars Index increases. One possible explanation for the relatively equal proportion of inappropriate graphs found is that SET is the smallest market and SGX, though the largest, is the most regulated market. BM, on the other hand, may want to present their financial data in the most attractive manner to prospective investors, thus, regulatory constraints and governance structure are still lenient.

A Study on the generator Planning of GENCO in the competitive power markets (경쟁시장에서 발전업자의 발전설비계획에 관한 연구)

  • Kim, Tae-Young;Kim, Kang-Won;Han, Seok-Man;Kang, Dong-Joo;H. Kim, Bal-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2008.11a
    • /
    • pp.418-420
    • /
    • 2008
  • The GENCO of competition in the market for profit maximization of business development for the study of how to build a facility plan. The total revenue for this thesis may be deducted from the total cost calculations and the cumulative profit, the result of cumulative profit through the profit and loss, and up to the turn-off to find a generator of canonicalization. Fortran, using a model to formally implement the program, and a graph that displays the results to build any power plants is the most efficient visibility of the eye can see.

  • PDF

A Heuristic Scheduling Algorithm for Reducing the Total Error of an Imprecise Multiprocessor System with 0/1 Constraint

  • Song, Ki-Hyun;Park, Kyung-Hee;Park, Seung-Kyu;Park, Dug-Kyoo;Yun, Kyong-Ok
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.6
    • /
    • pp.1-6
    • /
    • 1997
  • The scheduling problem of satisfying both 0/1 constraint and the timing constraint while minimizing the total error is NP-complete when the optional parts have arbitrary processing times. In this paper, we present a heuristic scheduling algorithm for 0/1 constraint imprecise systems which consist of communicating tasks running on multiple processors. The algorithm is based on the program graph which is similar to the one presented in[4]. To check the schedulability, we apply Lawler and Moore's theorem. To analyze the performance of the proposed algorithm, intensive simulation is done. The results of the simulation shows that the longest processing first selection strategy outperforms random or minimal laxity policies.

  • PDF

Terminal-Pair Availability Evaluation in Irreducible Structure Communication Networks (비가략(非可略) 구조를 갖는 네트워크의 단점간 가용도 평가)

  • Lee, Jun-Hyuk;Kim, Kyoung-Mok;Oh, Young-Hwan
    • Journal of Applied Reliability
    • /
    • v.8 no.4
    • /
    • pp.181-192
    • /
    • 2008
  • In this paper, we proposed effective algorithm that do Availability of communication network account using total probability formula. Use path tracing method about PSTN linked with MSC in WCDMA considering occasion that do not consider mobility of terminal and Availability did account. First, express minimum path series gathering by structure function after network that do modeling by stochastic graph for communication network saves all minimal path sets between particular two abutments and we gain Availability value in angular variable after express structure function by Boolean operation form and Availability between two abutments did account.

  • PDF

Factors Affecting Liquidity Risks of Joint Stock Commercial Banks in Vietnam

  • NGUYEN, Hoang Chung
    • The Journal of Asian Finance, Economics and Business
    • /
    • v.9 no.4
    • /
    • pp.197-212
    • /
    • 2022
  • The study uses the audited financial statements of 26 Vietnamese commercial banks listed on the Ho Chi Minh City Stock Exchange (HOSE) and Hanoi Stock Exchange (HOSE) during the 2008-2018 period to estimate the system GMM model, which provides empirical evidence on the effect of the variables of customer deposit to total assets (DEPO) ratio, loan to assets (LTA) ratio, liquidity of commercial banks (LIQ), credit development (CRD) ratio, external funding (EFD) ratio, and credit loss provision (LLP) ratio on liquidity risk. The study confirms that commercial banks' internal factors play the most important role, and there is no empirical evidence on macro variables that affect liquidity risk. Finally, in accordance with the theoretical framework, the study uses an estimation method with the R language and the bootstrap methodology to give empirical proof of the nonlinear correlation and U-shaped graph between commercial bank size and liquidity risk. The importance of commercial bank size in absorbing and moderating the effects of liquidity shocks is demonstrated, however, excessive growth in commercial bank size would increase liquidity risk in commercial bank operations.