• Title/Summary/Keyword: Tree Topology

Search Result 180, Processing Time 0.03 seconds

A Relative for Finite Element Nonlinear Structural Analysis (상대절점좌표를 이용한 비선형 유한요소해석법)

  • Kang, Ki-Rang;Cho, Heui-Je;Bae, Dae-Sung
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2005.11a
    • /
    • pp.788-791
    • /
    • 2005
  • Nodal displacements are referred to the Initial configuration in the total Lagrangian formulation and to the last converged configuration in the updated Lagrangian formulation. This research proposes a relative nodal displacement method to represent the position and orientation for a node in truss structures. Since the proposed method measures the relative nodal displacements relative to its adjacent nodal reference frame, they are still small for a truss structure undergoing large deformations for the small size elements. As a consequence, element formulations developed under the small deformation assumption are still valid fer structures undergoing large deformations, which significantly simplifies the equations of equilibrium. A structural system is represented by a graph to systematically develop the governing equations of equilibrium for general systems. A node and an element are represented by a node and an edge in graph representation, respectively. Closed loops are opened to form a spanning tree by cutting edges. Two computational sequences are defined in the graph representation. One is the forward path sequence that is used to recover the Cartesian nodal displacements from relative nodal displacements and traverses a graph from the base node towards the terminal nodes. The other is the backward path sequence that is used to recover the nodal forces in the relative coordinate system from the known nodal forces in the absolute coordinate system and traverses from the terminal nodes towards the base node. One closed loop structure undergoing large deformations is analyzed to demonstrate the efficiency and validity of the proposed method.

  • PDF

Robustness Evaluation of Tactical Network based on SNA

  • Park, Ji-Hye;Yoon, Soung-woong;Lee, Sang-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.10
    • /
    • pp.205-213
    • /
    • 2019
  • Network robustness is one of the most important characteristics needed as the network. Over the military tactical communication network, robustness is a key function for maintaining attack phase constantly. Tactical Information Communication Network, called TICN, has mixed characteristics of lattice- and tree-type network topology, which looks somewhat weak in the viewpoint of network robustness. In this paper, we search articulation points and bridges in a current Tactical Information Communication Network using graph theory. To improve the weak points empirically searched, we try to add links to create the concrete network and then observe the change of network-based verification values through diminishing nodes. With these themes, we evaluate the generated networks through SNA techniques. Experimental results show that the generated networks' robustness is improved compared with current network structure.

Characterization of Phylogenetic Incongruence among Protein Coding Genes of Vibrio Strains Pathogenic to Humans (인체 병원성 비브리오 균주간 유전자 계통의 불일치성 분석)

  • Zo, Young-Gun
    • Korean Journal of Microbiology
    • /
    • v.49 no.4
    • /
    • pp.383-390
    • /
    • 2013
  • Lateral gene transfer (LGT) of genes from other bacteria into Vibrio cholerae is expectable because of the pronounced natural competence of the bacterium. In this study, quantitative aspects of LGT among the three species of Vibrio pathogenic to humans were characterized. Genome sequences of V. cholerae N16961, V. parahaemolyticus RIMD2210633, V. vulnificus CMCP6, and Escherichia coli K12 substrain MG1655 were analyzed to determine orthologous quartets of protein coding genes present in all four genomes. Phylogenetic analyses on the quartets were conducted to resolve vertical versus lateral patterns of gene polymorphisms based on congruence versus incongruence of phylogenetic trees. About 70% of the quartets could be resolved as either cohesive topology (75%) or LGT tree topologies (25%). The amount of LGT genes in Vibrio spp. appeared to be abnormally high for a genus and comparable to those of families. Patched distributions of LGT from different donors were observed on a chromosome. In the small chromosome of V. cholerae, physical linkages among LGT loci spanned half the length of the chromosome. Either accumulative selection for the donor alleles in LGT or presence of large-scale LGT events was hypothesized. These findings warrant further studies on the nature of donor-specificity of LGT alleles and its influence on evolution of Vibrio virulence to humans.

Edge Property of 2n-square Meshes as a Base Graphs of Pyramid Interconnection Networks (피라미드 상호연결망의 기반 그래프로서의 2n-정방형 메쉬 그래프의 간선 특성)

  • Chang, Jung-Hwan
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.12
    • /
    • pp.582-591
    • /
    • 2009
  • The pyramid graph is an interconnection network topology based on regular square mesh and tree structures. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square mesh as a base sub-graph constituting of each layer in the pyramid graph. Edge set in the mesh can be divided into two disjoint sub-sets called as NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or shared in the upper layer of pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges in the original graph within the shrunk super-vertex on the resulting graph. In this paper, we analyze that the lower and upper bound on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n\times2^n$ mesh is $2^{2n-2}$ and $3*(2^{2n-2}-2^{n-1})$ respectively. By expanding this result into the pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}-3*2^{n-1}$-2n+7 in the n-dimensional pyramid.

The Genetic Variations of Pleurotus spp. on Subculture (느타리버섯 속(Pleurotus spp.)의 계대배양에 따른 유전적 변이)

  • Kang, Kyung-Hong;Song, Ju-Hee;Kim, Hong-Nam
    • The Korean Journal of Mycology
    • /
    • v.30 no.1
    • /
    • pp.23-30
    • /
    • 2002
  • The genetic variations and the rate of mycelial growth in the dikaryon and the monokaryon stages of Pleurotus spp. were surveyed during their subcultures. The highest growth rate was observed on both the 3rd and the 4th subcultures. The remarkably rapid growth rate was detected in P. ostreatus dikaryon. Genetic similarities in the dikaryon and the monokaryon of P. ostreatus were more than 57.5% and 85.7%, respectively, and those of P. eryngii were more than 85.2% and 84.8%, respectively. The genetic similarities of monokaryotic P. ostreatus were higher than those of dikaryotic. The topology of phylogenetic trees showed that the divergence and the clustering patterns of branch did not correlated with the number of subcultures. This suggests that genetic variations occur very randomly on mycelial cultures. These results suggest that the monokaryotic mycelia is genetically more stable than the dikaryotic in subcultures, and that it is very useful to stock monokaryotic mycelia for making spawns and breeding of Pleurotus spp.

Cycle Extendability of Torus Sub-Graphs in the Enhanced Pyramid Network (개선된 피라미드 네트워크에서 토러스 부그래프의 사이클 확장성)

  • Chang, Jung-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.8
    • /
    • pp.1183-1193
    • /
    • 2010
  • The pyramid graph is well known in parallel processing as a interconnection network topology based on regular square mesh and tree architectures. The enhanced pyramid graph is an alternative architecture by exchanging mesh into the corresponding torus on the base for upgrading performance than the pyramid. In this paper, we adopt a strategy of classification into two disjoint groups of edges in regular square torus as a basic sub-graph constituting of each layer in the enhanced pyramid graph. Edge set in the torus graph is considered as two disjoint sub-sets called NPC(represents candidate edge for neighbor-parent) and SPC(represents candidate edge for shared-parent) whether the parents vertices adjacent to two end vertices of the corresponding edge have a relation of neighbor or sharing in the upper layer of the enhanced pyramid graph. In addition, we also introduce a notion of shrink graph to focus only on the NPC-edges by hiding SPC-edges within the shrunk super-vertex on the resulting shrink graph. In this paper, we analyze that the lower and upper bounds on the number of NPC-edges in a Hamiltonian cycle constructed on $2^n{\times}2^n$ torus is $2^{2n-2}$ and $3{\cdot}2^{2n-2}$ respectively. By expanding this result into the enhanced pyramid graph, we also prove that the maximum number of NPC-edges containable in a Hamiltonian cycle is $4^{n-1}$-2n+1 in the n-dimensional enhanced pyramid.

A Multicast Delivery Technique for VCR-like Interactions in Collaborative P2P Environment (협력 P2P 환경에서 VCR 기능을 위한 멀티캐스트 전송 기법)

  • Kim Jong-Gyung;Kim Jin-Hyuk;Park Seung-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.7B
    • /
    • pp.679-689
    • /
    • 2006
  • Delivering multicast stream is one of the cost-saving approach in the large scale VOD environment. Because implementing VCR-like interactions for user's convenience in the multicast streaming system involves complex problems, we need the proper solutions for them. In this paper, we propose a hybrid scheme which uses the general P2P and the patching scheme with the Collaborative Interaction Streaming Scheme(CISS). CISS provides jumping functionability to the appropriate multicast session after VCR-like interaction in the environment in which multiple peers transmit VCR-like interaction streams to the VCR-like functionability request node to reduce the loads generated by frequent join or departure of peers at the multicast tree during providing VCR-like functionability. Therefore, with the proposed scheme we can distribute network traffic and reduce control overhead and latency. And to evaluate the performance of proposed scheme we compare it in the aspect of the performance of streaming delivery topology, control overhead and streaming quality with P2Cast[10] and DSL[11]. The simulation result shows that proposed P2Patching reduces about 30% of process overhead and enhances about $25{\sim}30%$ of streaming quality compared with DSL.

The Beacon Frame-Based Node Grouping Algorithm for Improving the Performance between MCT devices in the Home Wireless Network (가정 무선 네트워크 내 MCT 디바이스 간 성능 향상을 위한 Beacon frame 기반 노드 그룹화 알고리즘)

  • Kim, Gyu-Do;Kown, Young-Ho;Rhee, Byung-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.787-790
    • /
    • 2015
  • Recently, M2M (Machine to Machine) communication is possible the development of MTC (Machine Type Communication) devices becomes active. MCT devices in the form of home appliances have a low power consumption, low cost, short-range wireless communication in wireless home network. For purpose, MTC devices based on IEEE 802.15.4/Zigbee are composed in the form of cluster-tree topology, which consists of one PAN (Personal Area Network), one or other router and end of nodes. It happens that transmission delay, packet drop, and lacking data resulted from collision originated by a competition for allocating channels among MTC devices that greatly increased. At last performance of entire network can be degradated. This paper proposes that the beacon frame-based grouping algorithm using multiple channels in a MTC devices in the presence of wireless home network interference. The proposed algorithm decreases the transmission delay, dropped packet and throughput is more increase, so the proposal algorithm is more efficient than the IEEE 802.15.4/ Zigbee standard.

  • PDF

Cuticle micromorphology of leaves of Quercus L. (Fagaceae) and its taxonomic implications (참나무속(Quercus L.) 식물 잎의 큐티클 미세형태의 분류학적 의미)

  • Cho, Seong-Ho;Kim, Ki-Joong;Park, Chong-Wook;Sun, Byung-Yun;Chung, Myong-Gi;Pak, Jae-Hong
    • Korean Journal of Plant Taxonomy
    • /
    • v.38 no.4
    • /
    • pp.405-431
    • /
    • 2008
  • Cuticle micromorphology of 22 species of Quercus and outgroup were examined by the SEM. Twenty-two species selected each two or three species in all section of the genus Quercus. The genus Trigonobalanus and Alnus are selected as outgroups. Ten characters of the inner surface and eight characters of the outer surface of the cuticle have been described. Some characters, such as the present of papillae, arrangement of subsidiary cell, shape of anticlinal cell wall are considered important character for infrageneric classification. A parsimony analysis of 18 characters resulted in 72 most parsimonious trees with its lengths of 66 steps. The topology obtained from the analysis showed two major lineages. Subgenus Cyclobalanopsis formed one clade by 75% and subgenus Quercus formed another clade by 57% bootstrap value. Based on the cuticle morphology, the two subgenus delimitation of Camus was supported. However, sect. Erythrobalanus and sect. Cerris formed one group, and sect. Lepidobalanus formed polytomy.

Phylogenetic analysis of the genera Azorhizobium, Bradyrhizobium, Mesorhizobium, Rhizobum and Sinorhizobium on the basis of internally transcribed spacer region (ITS 영역의 염기서열을 이용한 근류형성 질소고정균의 계통분류)

  • Kwon, Soon-Wo;Kim, Chang-Yung;Ryu, Jin-Chang;Go, Seung-Joo
    • Korean Journal of Soil Science and Fertilizer
    • /
    • v.35 no.1
    • /
    • pp.12-26
    • /
    • 2002
  • The phylogenetic relationships for 33 strains belonging to the genera Azorhizobium, Bradyrhizobium, Mesorhizobium, Rhizobium and Sinorhizobium were conducted by the sequence analyses of the ITS regions. The sequence homologies of these strains showed the high variations(28.0 - 94.9%). According to the phylogenetic analysis of ITS regions. 37 ITS clones from 33 strains of 32 species were classified into four groups. Group I included all strains of the genus Sinorhizobium as core members and R. giardinii as a peripheral member. The genus Rhizobium strains were clustered into group II which was very heterogeneous and the tree toplogy of this group were very unstable. Among the members of group II. the taxonomic position of R. radiobacter and R. rubi was not clearly identified on the basis of ITS I regions. R. undicola and R. vitis were remotely related with other Rhizobium strains including R. leguminosarum, R. galegae, R. gallicum, R. mongolense, R. tropici, R. hainanense, R. rhizogense and R. huautlense of group II were supposed to be loosely related to R. leguminosarum. While the stains of the genera Bradyrhizobium constituted group III with Azorhizobium caulindans, the strains of the genus Mesorhizobium formed group IV on the relatively high sequence homology level.