• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.63-66
• /
• 2001

In this paper, We propose the new interconnection network which is designed to edge numbering labeling using postorder traversal which can reduce diameter when it has same node number with Hypercube, which can reduce total node numbers considering node degree and diameter on Fibonacci trees and its jump sequence of circulant is Fibonacci numbers. It has a simple (shortest oath)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded to Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube.

• Journal of Korean Society of Forest Science
• /
• v.34 no.1
• /
• pp.21-30
• /
• 1977

Japanese larch (Larix leptolepis) is one of main timber species in Korea that could find much plantation and growing stands on all over the country. It is thought to be in meaningful that a guiding diagram for density control of Japanese larch stands is made to estimate easily the density conditions in the quantitaive, ecological and economic viewpoint. Sample plots for this study are selected from the stands that have not been thinned in recent years, and mean height, mean diameter, dominant height, tree numbers per hectare and stem volume of mean tree are calculated from the each sample plots among total 165 plots In this study, especially, the theory of slenderness of mean tree are applied, that have been identified through the results of the spacing trial. Relative growth characteristics of this species are calculated from the general logistic curve and its formula is $Y=ax^b$. Relatwion between the measured items are found out as follows: 1. Relation between the mean height and tree numbers per hectare by slender class is showing the high correlation as table 1 and fig. 2, and between mean diameter and tree numbers per hectare is also high correlation as table 1 and fig 3. 2. The stem volume can be correctly estimated from height in case that slender class may be known, as showing in table 3 and fig. 4. 3. The stem volume can be more correctly estimated from the relation with $D^2H$ as formula, $Log_e\;V=0.9569\;Log_eD^2H-9.8431$, and relation between stem volume of single tree or volume per hectare and tree numbers per hectare are as following formulas: $Log_e$ stem volume=9.5026-1.6800 $Log_e$ tree numbers per hectare $Log_e$ stem volume per hectare=9.4911-0.6784 $Log_e$ tree numbers per hectare. Stem volume of mean tree, tree numbers per hectare and stem volume per hectare correspond to the mean tree height are calculated to slender class as table 5, 6, 7. Through the above steps, the diagram for density control of Japanese larch are produced as fig. 9. It is thought that this diagram could be applied to control the density of Japanese larch stands.

• Communications of the Korean Mathematical Society
• /
• v.18 no.1
• /
• pp.181-192
• /
• 2003

We count the numbers of independent dominating sets of rooted labeled trees, ordinary labeled trees, and recursive trees, respectively.

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.573-589
• /
• 2017

Cloud computing is an attractive solution that can provide low cost storage and powerful processing capabilities for government agencies or enterprises of small and medium size. Yet the confidentiality of information should be considered by any organization migrating to cloud, which makes the research on relational database system based on encryption schemes to preserve the integrity and confidentiality of data in cloud be an interesting subject. So far there have been various solutions for realizing SQL queries on encrypted data in cloud without decryption in advance, where generally homomorphic encryption algorithm is applied to support queries with aggregate functions or numerical computation. But the existing homomorphic encryption algorithms cannot encrypt floating-point numbers. So in this paper, we present a mechanism to enable the trusted party to encrypt the floating-points by homomorphic encryption algorithm and partial trusty server to perform summation on their ciphertexts without revealing the data itself. In the first step, we encode floating-point numbers to hide the decimal points and the positive or negative signs. Then, the codes of floating-point numbers are encrypted by homomorphic encryption algorithm and stored as sequences in cloud. Finally, we use the data structure of DoubleListTree to implement the aggregate function of SUM and later do some extra processes to accomplish the summation.

• Journal of the Korean Mathematical Society
• /
• v.39 no.2
• /
• pp.205-219
• /
• 2002

We deride formulas for the expected values $\mu$(n) of the independent domination numbers of a random planted plane tree and a random trivalent tree with n vertices, respectively, and we determine the asymptotic behavior of $\mu$(n) as n goes to infinity.

• Journal of Fashion Business
• /
• v.5 no.3
• /
• pp.63-71
• /
• 2001

The symbol of the sacred tree represents the world tree. They were influenced by Tree worship in Northern mounted nomadic groups, and the first is quite obvious, that the sacred tree is a palm tree. The Assyrian sacred tree possesses characteristics, making the tree iconographic and rather artificial. The tree typically has a thin trunk arranged in two or three tiers. Each tier is separated by horizontal plates or bands. The top of the tree is crowned with a palmette form. Wavy streamers emanate from the tree abd terminate in palmettes in a criss cross fashion. The central trunk is topped with a palmette and surrounded the trunk with palmettes emphasizing a link to date trees. The number of branches on the tree is limited, and there are usually seven, fifteen or thirty branches. The connection of these numbers with those of the week, and of the lunar wax and wane is so obvious. The branches on the tree may have indeed represented a calender of some sort. Mainly based on the excavated tomb articles of the three kingdoms and referred to Chinese and Japanese ones, Sacred Tree pattern showed that was lightly influenced by the times and area, but was slowly changed and developed to different types through those each ages generally. The Sacred Tree type was three part in according to the wavy streamers emanate from the tree abd, Sacred tree type I, Sacred tree type II, Sacred tree type III[the Mountain(; 山)-typed piled up Sacred Tree].

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.8-16
• /
• 2022

In this paper, we propose a method of reconstructing the file system to obtain digital forensics information from the APFS file system when meta information that can know the structure of the file system is deleted due to partial damage to the disk. This method is to reconstruct the tree structure of the file system by only retrieving the B-tree node where file/directory information is stored. This method is not a method of constructing nodes based on structural information such as Container Superblock (NXSB) and Volume Checkpoint Superblock (APSB), and B-tree root and leaf node information. The entire disk cluster is traversed to find scattered B-tree leaf nodes and to gather all the information in the file system to build information. It is a method of reconstructing a tree structure of a file/directory based on refined essential data by removing duplicate data. We demonstrate that the proposed method is valid through the results of applying the proposed method by generating numbers of user files and directories.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.59-62
• /
• 2000

In this paper, We propose the new interconnection network which is designed to edge numbering method using inorder traversal a Fibonacci trees and its jump sequence is Fibonacci numbers. It has a simple (shortest path)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube on interconnection network measrtes.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.371-374
• /
• 2000

This paper proposes a 16-bit ${\times}$ 16-bit multiplier for 2 twos-complement binary numbers with tree-like structure and implements it on a FPGA. The space and time complexity analysis shows that the 16-bit Tree-like multiplier represents lower circuit complexity and computes more quickly than both Booth array multiplier md Modified array multiplier.

• Journal of Korean Society of Forest Science
• /
• v.22 no.1
• /
• pp.67-70
• /
• 1974

Experiments were carried out to find the difference of resin canal numbers by tree age and topophysis of crown of black pine needles, and the results were summarized as follows. 1. The average numbers of resin canal by tree age were increased from the age of 5 years were not difference between 10 and thereafter years significantly. 2. In this observation, the range of resin canal number was 2 to 9. 3. The numbers by the topophysis of crown did not show significant differences but the individual trees showed significant variations in the canal number in younger trees.