• International Journal of Computer Science & Network Security
• /
• v.24 no.10
• /
• pp.97-104
• /
• 2024

This paper proposed n approaches to designing local area networks using Prim's MST Algorithm of an organization. Designing the local area network of an organization is a typical problem faced with how we optimally arrange the networks between computers nodes while faced the imperative of area and installment cost. One of the cost parts that value to be considered is the local network cable price. The shorter the aggregate link length of the network, obviously the installation cost will be less. The MST problem has essential applications in network design which is broadly concentrated in the study of literature. The MST problem shows up in the local area network design where computers and other nodes connect them and must be picked most gainfully. The application of Prim's algorithms is shown to the outline design of local area networks in an organization. This Prim's algorithm works by picking the shortest path beginning from the first node until all nodes in the graph are linked. The following research is planned to design a prims algorithm to solve local area network design problems. Our research is analyzed, and intriguing results are gotten. The outcomes got to justify the need to apply this sort of algorithm for benefit and efficiency.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.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.

• Communications of the Korean Mathematical Society
• /
• v.13 no.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 Korea Institute of Information and Communication Engineering
• /
• v.8 no.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.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.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
• /
• v.19 no.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.

• Biomolecules & Therapeutics
• /
• v.24 no.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.

• Geomechanics and Engineering
• /
• v.14 no.3
• /
• pp.257-269
• /
• 2018

Analysis of slope stability failures, as one of the complex natural hazards, is one of the important research issues in the field of civil engineering. Present paper adopts and investigates four soft computing-based techniques for this problem: Patient Rule-Induction Method (PRIM), M5' algorithm, Group Method of data Handling (GMDH) and Multivariate Adaptive Regression Splines (MARS). A comprehensive database consisting of 168 case histories is used to calibrate and test the developed models. Six predictive variables including slope height, slope angle, bulk density, cohesion, angle of internal friction, and pore water pressure ratio were considered to generate new models. The results of test studies are used for feasibility, effectiveness and practicality comparison of techniques with each other, and with the other available well-known methods in the literature. Results show that all methods not only are feasible but also result in better performance than previously developed soft computing based predictive models and tools. It is shown that M5' and PRIM algorithms are the most effective and practical prediction models.

• Journal of the Korean Mathematical Society
• /
• v.35 no.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.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.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.