• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(3)
• /
• 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.

• 한국산림과학회지
• /
• 제34권1호
• /
• pp.21-30
• /
• 1977

일본잎갈나무는 우리나라의 주요조림수종(主要造林樹種)으로 전국각지(全國各地)에 많은 조림지(造林地)와 임분(林分)이 있다. 이 수종(樹種)의 임분밀도관리(林分密度管理)의 지침(指針)을 마련하여 생산력예측(生產力豫則), 간벌계획(間伐計劃)과 수확량(收穫量) 사정(査定)을 용이하게 하는 일은 임업기술(林業技術)의 계량적(計量的), 생태적(生態的) 및 경제적(經濟的) 관점(觀點)에 대단(大端)이 의의있는 일로 생각 되었다. 이 연구(硏究)를 위해 정상적(正常的)으로 관리(管理)되고 있든 비정상적(非正常的)으로 관리(管理)되고 있든 최근(最近)에 간벌(間伐)한 흔적이 없는 임분(林分)에서 165개(個)의 표본(標本)을 조사(調査)하여 평균수고(平均樹高), 평균직경(平均直徑) 우세목수고(優勢木樹高), ha당(當) 본수(本數)와 1평균목(平均木)의 간재적(幹材積)을 산출(算出) 하였다. 이 연구(硏究)에 특(特)히 세장도이론(細長度理論)을 새로 도입(導入) 하였다. 이 이론(理論)에 대(對)한 실험적(實驗的) 검토(檢討)는 마(馬)와 Wardle, Shantz, Harms & Colline의 밀도시험결과(密度試驗結果)를 인용(引用)하여 증명한 바 있다. 임목(林木)의 상대생장(相對生長)은 일반적(一般的)인 logistic cnrve를 인용(引用)하고 공식(公式)은 모두 $Y=a{\times}b$를 대입(代入) 하였다. 각측정인자간(各測定因子間)의 관계(關係)는 아래와 같았다. 1. 세장도별(細長度別) 수고(樹高)와 밀고(密度)와의 관계(關係)-표(表) 1과 그림2 2. 세장도별(細長度別) 직경(直徑)과 밀도(密度)와의 관계(關係)-표(表) 1과 그림3 3. 세장도별(細長度別) 수고(樹高)와 단목간재적(單木幹材積)과의 관계(關係)-표(表) 3과 그림4 4. $D^2H$와 단목(單木) 간재적(幹材積)-$Log_eV=0.9569\;Log_eD^2H-9.8431$ 5. 밀도(密度)와 간재적(幹材積)-$Log_eV=9.5026-1.6800\;Log_eD$ 6. 밀도(密度)와 간재적(幹材積)-$Log_eV_{ha}=9.4911-0.6784\;Log_eD$ 7. 세장도별(細長度別) 수고계급(首告階級)에 응대(應對)한 간재적(幹材積)-표(表) 5 8. 세장도별(細長度別) 수고계급(首告階級)에 응대(應對)한 Ha당(當) 본수(本數)-표(表) 6 9. 세장도별(細長度別) 수고계급(首告階級)에 응대(應對)한 Ha당(當) 간재적(幹材積)-표(表) 7 이상(以上)의 과정(過程)을 거쳐 일본잎갈나무 임분밀도관리도표(林分密度管理圖表)를 제작(製作)하였다(그림 9). 이 관리표(管理表)의 정확도(正確度)를 검정하기 위하여 실측치(實測値)와 추정치(推定値)와의 관계(關係)를 보니 표(表) 8의 내용과 같이 오차(誤差)가 낮은편이었다. 이 도표(圖表)는 일본잎갈나무 임분(林分)의 밀도관리(密度管理)의 지침(指針)이 되리라 생각 된다.

• 대한수학회논문집
• /
• 제18권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
• /
• 제13권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.

• 대한수학회지
• /
• 제39권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.

• 패션비즈니스
• /
• 제5권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
• /
• 제14권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(3)
• /
• 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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• 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.

• 한국산림과학회지
• /
• 제22권1호
• /
• pp.67-70
• /
• 1974

수령별(樹齡別) 수관(樹冠)에 착생(着生)된 부위(部位)와 방법(方法)에 따른 해송 침엽(針葉)의 수지구수(樹脂溝數)를 알고자 실험(實驗)을 수행(遂行)하였든바 그 결과(結果)를 요약(要約)하면 다음과 같다. 1. 수령별(樹齡別) 평균(平均) 수지구수(樹脂溝數)는 5년생이후(年生以後)에서는 증가(增加)되고 10년생이후(年生以後) 부터는 차이(差異)를 보이지 않는다. 2. 엽장(葉長)의 수지구수(樹脂溝數)는 2~9의 Range를 보였고 그 이상(以上)은 발견(發見)되지 못하였다. 3. 방위(方位) 및 수관(樹冠) 부위별(部位別)에 의한 수지구수(樹脂溝數)를 분산분석(分散分析)한 결과(結果) 유의차(有意差)는 없었으며 5년생(年生)의 것은 개체간(個體間)에 유의성(有意性)을 보였으며 10년생(年生)은 낮은 유의성(有意性)을 보였다. 이상(以上)의 결과(結果)로 보아 해송 침엽(針葉)의 수지구수(樹脂溝數)는 방위(方位) 및 착생부위(着生部位)에 의한 차이(差異)는 없는 것으로 추정(推定)된다.