• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제12권3호
• /
• pp.51-61
• /
• 2012

This paper suggests an algorithm that obtains Directed Graph Minimum Spanning Tree (DMST), using Prim MST algorithm which is Minimum Spanning Tree (MST) of undirected graph. At first, I suggested the Prim DMST algorithm that chooses Minimum Weight Arc(MWA) from out-going nodes from each node, considering differences between undirected graph and directed graph. Next, I proved a disadvantage of Prim DMST algorithm and Chu-Liu/Edmonds DMST (typical representative DMST) of not being able to find DMST, applying them to 3 real graphs. Last, as an algorithm that can always find DMST, an advanced Prim DMST is suggested. The Prim DMST algorithm uses a method of choosing MWA among out-going arcs of each node. On the other hand, the advanced Prim DMST algorithm uses a method of choosing a coinciding arc from the out-going and in-going arcs of each node. And if there is no coinciding arc, it chooses MWA from the out-going arcs from each node. Applying the suggested algorithm to 17 different graphs, it succeeded in finding the same DMST as that found by Chu-Liu/Edmonds DMST algorithm. Also, it does not require such a complicated calculation as that of Chu-Liu/Edmonds DMST algorithm to delete the cycle, and it takes less time for process than Prim DMST algorithm.

• Koreanishche Zeitschrift fur Deutsche Sprachwissenschaft
• /
• 제9집
• /
• pp.153-168
• /
• 2004

Unsere moderne Gesellschaft ist kaum noch ohne Computernutzung vorstellbar. Dank der enormen Fortschritte von Naturwissenschaft und Technik, insbesondere der Mikroelektronik, finden Computer verschiedener Typen und $Gr\"{o}{\ss}en$ in allen Bereichen der Technik, Wissenschaft, Verwaltung, Wirtschaft und des $t\"{a}glichen$ Lebens Verwendung. Und auch in der Sprache findet diese wissenschaftlich-technische Revolution ihren Niederschlag. Zur Befriedigung des Benennungsbedarfs in den Fachsprachen steht neben Wortbildung und Entlehnung die $Terminologisierungsm\"{o}glichkeit$ zur $Verf\"{u}gung$. Bei der Terminologiebildung greifen viele Fachsprachen auf den Wortschatz der Gemeinsprache $zur\"{u}ck$ und entnehmen ihr Ausdrucke. Im Allgemeinen kann jedes Wort der Gemeinsprache terminologisiert werden. Dabei entsteht keine neue Wortform, nur die semantische Seite des Lexems wird neu fixiert. Die zu terminologisierenden $Gemeinw\"{o}rter$ sind im Allgemeinen polysemantisch. Durch die selektive Terminologisierung werden die Termini semantisch und funktionell von den $urspr\"{u}nglichen$ $Gemeinw\"{o}rtern$ differenziert. Nach den $prim\"{a}ren$ semantischen Merkmalen werden die terminologisierten Computertechnik-Termini vor allem in folgende Gruppen unterschieden: a. Terminologisierung durch die geometrische Form als $prim\"{a}res$ Merkmal; b. Terminologisierung durch die Funktion als $prim\"{a}res$ Merkmal; c. Terminologisierung durch die Bewegungsart als $prim\"{a}res$ Merkmal; d. Terminologisierung durch die Lage als $prim\"{a}res$ Merkmal. Das mit neuer Begriffsbedeutung versehene Gemeinwort wird in das begriffliche und terminologische System der jeweiligen Fachsprache eingeordnet. $Fachausdr\"{u}cke$ im Bereich der Computertechnik zeigen ihre Beziehungen zu den anderen Fachgebieten, da der Begriff Computertechnik nicht nur den Gegenstand, Computer, betrifft, sondern auch noch die gesamte Technik, die der Datenverarbeitung heute zur Verfugung steht. Viele Termini, die aus anderen Fachgebieten stammen, werden auch als Computertechnik-Termini angesehen, solange sie von der Computertechnik verwendet werden.

• Communications of the Korean Mathematical Society
• /
• 제13권4호
• /
• pp.759-764
• /
• 1998

We define the rational lens algebra (equation omitted)(n) as the crossed product by an action of Z on C( $S^{2n＋l}$). Assume the fibres are $M_{ k}$/(C). We prove that (equation omitted)(n) $M_{p}$ (C) is not isomorphic to C(Prim((equation omitted)(n))) $M_{kp}$ /(C) if k > 1, and that (equation omitted)(n) $M_{p{\infty}}$ is isomorphic to C(Prim((equation omitted)(n))) $M_{k}$ /(C) $M_{p{\infty}}$ if and only if the set of prime factors of k is a subset of the set of prime factors of p. It is moreover shown that if k > 1 then (equation omitted)(n) is not stably isomorphic to C(Prim(equation omitted)(n))) $M_{k}$ (c).

• Journal of the Korean Mathematical Society
• /
• 제35권2호
• /
• pp.331-340
• /
• 1998

We define the spherical non-commutative torus $L_{\omega}$/ as the crossed product obtained by an iteration of l crossed products by actions of, the first action on C( $S^{2n＋l}$). Assume the fibres are isomorphic to the tensor product of a completely irrational non-commutative torus $A_{p}$ with a matrix algebra $M_{m}$ ( ) (m > 1). We prove that $L_{\omega}$/ $M_{p}$ (C) is not isomorphic to C(Prim( $L_{\omega}$/)) $A_{p}$ $M_{mp}$ (C), and that the tensor product of $L_{\omega}$/ with a UHF-algebra $M_{p{\infty}}$ of type $p^{\infty}$ is isomorphic to C(Prim( $L_{\omega}$/)) $A_{p}$ $M_{m}$ (C) $M_{p{\infty}}$ if and only if the set of prime factors of m is a subset of the set of prime factors of p. Furthermore, it is shown that the tensor product of $L_{\omega}$/, with the C＊-algebra K(H) of compact operators on a separable Hilbert space H is not isomorphic to C(Prim( $L_{\omega}$/)) $A_{p}$ $M_{m}$ (C) K(H) if Prim( $L_{\omega}$/) is homeomorphic to $L^{k}$ (n)$\times$ $T^{l'}$ for k and l' non-negative integers (k > 1), where $L^{k}$ (n) is the lens space.$T^{l'}$ for k and l' non-negative integers (k > 1), where $L^{k}$ (n) is the lens space.e.

• Journal of the Korea Society of Computer and Information
• /
• 제17권1호
• /
• pp.161-169
• /
• 2012

In general, Euclidean minimum spanning tree is a tree connecting input nodes with minimum connecting cost. But the tree may not be optimal when applied to real world problems of three dimension. In this paper, three dimension Euclidean minimum spanning tree is proposed, connecting all input nodes of 3-dimensional space with minimum cost. In experiments for 30,000 input nodes with 100% space ratio, the tree produced by the proposed method can reduce 90.0% connection cost tree, compared with the tree by two dimension Prim's minimum spanning tree. In two dimension plane, the proposed tree increases 251.2% connecting cost, which is pointless in 3-dimensional real world. Therefore, the proposed method can work well for many connecting problems in real world space of three dimensions.

• Journal of the Korea Society of Computer and Information
• /
• 제19권1호
• /
• pp.57-64
• /
• 2014

As Steiner minimum tree building belongs to NP-Complete problem domain, heuristics for the problem ask for immense amount execution time and computations in numerous inputs. In this paper, we propose an efficient mechanism of euclidean Steiner minimum tree construction for numerous inputs using combination of Delaunay triangulation and Prim's minimum spanning tree algorithm. Trees built by proposed mechanism are compared respectively with the Prim's minimum spanning tree and minimums spanning tree based Steiner minimum tree. For 30,000 input nodes, Steiner minimum tree by proposed mechanism shows about 2.1% tree length less and 138.2% execution time more than minimum spanning tree, and does about 0.013% tree length less and 18.9% execution time less than minimum spanning tree based Steiner minimum tree in experimental results. Therefore the proposed mechanism can work moderately well to many useful applications where execution time is not critical but reduction of tree length is a key factor.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제14권1호
• /
• pp.51-59
• /
• 2014

This paper suggests a method of lessening number of a graph's edges population in order to rapidly obtain the minimum spanning tree. The present minimum spanning tree algorithm works on all the edges of the graph. However, the suggested algorithm reduces the edges population size by means of applying a method of deleting maximum weight edges in advance from vertices with more than 2 valencies. Next, it applies a stopping criterion which ideally terminates Borůvka, Prim, Kruskal and Reverse-Delete algorithms for reduced edges population. On applying the suggested algorithm to 9 graphs, it was able to minimize averagely 83% of the edges that do not become MST. In addition, comparing to the original graph, edges are turned out to be lessened 38% by Borůvka, 37% by Prim, 39% by Kruskal and 73% by Reverse-Delete algorithm, and thereby the minimum spanning tree is obtained promptly.

• Journal of the Korea Society of Computer and Information
• /
• 제19권6호
• /
• pp.71-80
• /
• 2014

Employing PTAS to building minimum spanning tree for a large number of equal distribution input terminal nodes can be a effective way in execution time. But applying PTAS to building minimum spanning tree for tremendous unequal distribution node may lead to performance degradation. In this paper, a partial PTAS reflecting the scheme into specific node dense area is presented. In the environment where 90% of 50,000 input terminal nodes stand close together in specific area, approximate minimum spanning tree by our proposed scheme can show about 88.49% execution time less and 0.86%tree length less than by existing PTAS, and about 87.57%execution time less and 1.18% tree length more than by Prim's naive scheme. Therefore our scheme can go well to many useful applications where a multitude of nodes gathered around specific area should be connected efficiently as soon as possible.

• Biomolecules & Therapeutics
• /
• 제24권4호
• /
• pp.418-425
• /
• 2016

We measured anti-nociceptive activity of prim-o-glucosylcimifugin (POG), a molecule from Saposhnikovia divaricate (Turcz) Schischk. Anti-nociceptive or anti-inflammatory effects of POG on a formalin-induced tonic nociceptive response and a complete Freund's adjuvant (CFA) inoculation-induced rat arthritis pain model were studied. Single subcutaneous injections of POG produced potent anti-nociception in both models that was comparable to indomethacin analgesia. Anti-nociceptive activity of POG was dose-dependent, maximally reducing pain 56.6% with an $ED_{50}$ of 1.6 mg. Rats given POG over time did not develop tolerance. POG also time-dependently reduced serum TNF${\alpha}$, IL-$1{\beta}$ and IL-6 in arthritic rats and both POG and indomethacin reduced spinal prostaglandin E2 ($PGE_2$). Like indomethacin which inhibits cyclooxygenase-2 (COX-2) activity, POG dose-dependently decreased spinal COX-2 content in arthritic rats. Additionally, POG, and its metabolite cimifugin, downregulated COX-2 expression in vitro. Thus, POG produced potent anti-nociception by downregulating spinal COX-2 expression.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제8권5호
• /
• pp.1089-1095
• /
• 2004

The genetic algorithms have been used to take a near optimal solution because The generation of the optimal Steiner tree from a given network is NP-hard problem,. The chromosomes in genetic algorithm are represented with the floating point representation instead of the existing binary string for solving this problem. A spanning tree was obtained from a given network using Prim's algorithm. Then, the new Steiner point was computed using genetic algorithm with the chromosomes in the floating point representation, and it was added to the tree for approaching the result. After repeating these evolving steps, the near optimal Steiner tree was obtained. Using this method, the tree is quickly and exactly approached to the near optimal Steiner tree compared with the existing genetic algorithms using binary string.