• Title/Summary/Keyword: indistinguishable nodes

Search Result 4, Processing Time 0.018 seconds

Minimum Deficiency Ordering with the Clique Storage Structure (클릭저장구조에서 최소 부족수 순서화의 효율화)

  • Seol, Tong-Ryeol;Park, Chan-Kyoo;Park, Soon-Dal
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.3
    • /
    • pp.407-416
    • /
    • 1998
  • For fast Cholesky factorization, it is most important to reduce the number of nonzero elements by ordering methods. Generally, the minimum deficiency ordering produces less nonzero elements, but it is very slow. We propose an efficient implementation method. The minimum deficiency ordering requires much computations related to adjacent nodes. But, we reduce those computations by using indistinguishable nodes, the clique storage structures, and the explicit storage structures to compute deficiencies.

  • PDF

Compression of Normal Vectors using Octree Encoding (옥트리 인코딩을 이용한 법선 벡터의 압축)

  • Kim, Y.J.;Kim, J.J.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.2
    • /
    • pp.109-117
    • /
    • 2007
  • Three-dimensional mesh models have been widely used in various applications such as simulations, animations, and e-catalogs. In such applications the normal vectors of mesh models are used mainly for shading and take up the major portion of data size and transmission time paper over networks. Therefore a variety of techniques have been developed to compress them efficiently. In this paper, we propose the MOEC (Modified Octree Encoding Compression) algorithm, which allow multi lever compression ratios for 3D mesh models. In the algorithm, a modified octree has nodes representing their own positions and supporting a depth of the tree so that the normal vectors are compressed up to levels where the shading is visually indistinguishable. This approach provides efficient in compressing normals with multi-level ratios, without additional encoding when changing in compression ratio is required.

The Studies on Identification of Lophatherum gracile(淡竹葉) Using AFLP fingerprinting Methods (AFLP fingerprinting법을 이용한 담죽엽의 감별법 연구)

  • Shim, Young-Hoon;Seong, Rack-Seon;Park, Ju-Young;Kim, Ji-Yeon;Cho, Chang-Hee;Lee, Jong-Hwa;Hyeon, Seong-Ye;Kim, Sun-Ho;Kim, Dong-Sup;Jang, Seung-Yeup
    • Korean Journal of Pharmacognosy
    • /
    • v.41 no.4
    • /
    • pp.297-302
    • /
    • 2010
  • Lophatheri Herba is the aerial part of Lophatherum gracile Bronghiart(淡竹葉, Gramineae). 25~75 cm in length. Stem: cylindrical with nodes, empty inside, externally pale yellowish green. Leaf: dehiscent of lanceolate lamina, shrunken and rolled, 5~20 cm long, 10~35 mm wide; surface: pale green ~ yellowish green, parallel-formed with veins of square reticulate, more distinct of appearance on the lower surface. Banbusae Caulis In Taeniam is the stringy strip derived from the stem with the peeled-off epidermis of Phllostachys nigra Munro var. henosis Stapf, and Phllostachys bambusoides Siebold et Zuccarini(竹葉, Gramineae). Irregular in size and shape, thin plane ~ strip-shaped, sometimes powdery, sometimes 1~3 mm thick. Outer surface: pale green ~ yellowish green, sometimes grayish white L. gracile and P. nigra have different origins although they show similar morphologic features. We were able to distinguish between L. gracile and P. nigra which are almost indistinguishable through this study. AFLP(Amplifide Fragment Length Polymorphism) was more suitable for identifying differences between L. gracile and P. nigra in comparison with other genetic analysis using chemical analysis. Therefore. molecular biological methods are believed to be useful for discovering origins of herbal medicines.

Symbol Error Probability of a Physical Layer Network Coded System in Nakagami Fading Channels (나카가미 페이딩 채널에서 물리 계층 네트워크 부호화 시스템의 심볼 오류율)

  • Do, Phu Thinh;Wang, Jin-Soo;Park, Jin-Bae;Kim, Yun-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.8C
    • /
    • pp.645-654
    • /
    • 2012
  • In this paper, we consider a two-way relay (TWR) system, where two user nodes exchange their information within two transmission phases, by the help of a relay node adopting physical layer network coding. In the system, two users transmit their binary phase shift keying symbols simultaneously in the first phase, and the relay node decodes the XORed version of two user data and broadcasts it back to two users in the second phase. The performance of the system is analyzed in terms of the average end-to-end symbol error probability in Nakagami-m fading channels, for which a tight upper bound is derived in a closed form to provide an accurate and handy estimate on the performance. The results show that our upper bounds are almost indistinguishable from simulation results for various channel and system configurations. In addition, the optimal relay location and power allocation for various conditions can be obtained quickly with our analysis.