• Title/Summary/Keyword: number of nodes

Search Result 2,162, Processing Time 0.027 seconds

Studies on the Fruiting Phase of Rape Under the Different Cultural Conditions

  • Kae, B.M.
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.12
    • /
    • pp.77-87
    • /
    • 1972
  • The fruiting phase of rape under transplanting and direct-sowing conditions has been studied at Mokpo during the 2 years period from 1970 to 1971. Two varieties, Yudal and Miyuki were used in this study. The planting space and sowing time were also incorporated into this study. The results could be summarized as follows: 1. The plant tape of rape was nearly umbrella-shaped of all, but has changed to the laid elliptical-shaped, broadly ovate and spindle-shaped under different varieties and cultural conditions in the plant diagram(Fig. 2). 2. The length of the primary branches for each nodes had a tendency to the symmetric apical curve with the apex at the upper 10-12th node in the transplanting. but to the upper bias apical curve with the apex at the upper 5-7th node in the dense-sowing(Fig.3). 3. The ear of main stem was longer, more pods, heavier 1, 000 grains and more grain yield than ear of primary branches of all, Especially, as for that, the rate of yield constitution per plant in the direct-sowing was higher than in the transplanting(Fig. 4, 5, 6, 7, 8, 9). 4. The ear-length of the primary branches for each nodes had a tendency to the relatively slowly apical curve with the apex at the upper 3-4th node in the transplanting, but to the lower bias apical curve with the apex at the upper 2nd node in the dense-sowing. Especially, the possibility of growth at the lower ears was few in the early variety (Fig. 4). 5. The number of pod per ear on the primary branches for each nodes had a .tendency to the curve of ear-length with the apex at the upper 5-8thnode in the transplanting and at the upper 4-5th node in the dense-sowing (Fig. 5). Accordingly, a high positive correlation was found between the ear-length and number of pod per ear (Table 2) 6. In the transplanting, the high rate of effective ear was from the upper nods to the 12th node, but below the 16-17th nodes was ineffective. However, in the early dense-sowing the high rate of effective was to the 7th node. but below the 10th nodes was. ineffective. Especially, in the early variety has difficult to secure of poi-numbers for ineffective of the lower nodes(Fig. 6.). 7. The density of pod setting of the ear of main stem was the longest of all ears, and the lower nods were, the shorter it became. That had a tendency to the evidently apical growth. However. in the early variety, it was lengthened according to growth of ear-length(Fig.7). 8. The pod-length of the medium nodes was longer than the upper and lower, and the possitive correlation between pod-length and number of grain per poi was very high(Table 2.). 9. In the grain yield per node of primary branches, the most yielding node of transplanting was the upper 9th node, of dense-sowing 4-5th node(Fig 8.), and the possitive correlation between grain yield per node and ear-length or number of pod per ear was very high(Table 2). 10. The grain yield of ear of main stem was higher than that of primary branches in the percentage of dependence for grain yield per plant. The limint node of 50% of dependence to cumulative grain yield per plant was the upper 7-8th node in tranplanting, in the early dense-sowing 4-5th node, and in tke late dense-sowing-3th node(Fig. 9). 11. In the weight of 1, 000 grains the lower nodes were, the lighter it becames in dense-sowing. Therefore, this was also lighter than in the transplanting to the (Fig. 10.). 12. The oil content of grain at the medium nodes was low in the early variety, but at the ear of main stem and upper 1st node it was extremely high(Fig. 11.).

  • PDF

Increasing Output Nodes for Performance Improvement of Multilayer Perceptrons (다층퍼셉트론의 성능향상을 위한 출력노드 수 증가)

  • Oh, Sang-Hoon
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2006.11a
    • /
    • pp.13-15
    • /
    • 2006
  • When we use multilayer perceptron model for pattern classification probmems, we allocate one output node for each class. In this paper, we increase the number of output nodes for each class and investigate the performance of multilayer perceptrons through the simulation of isolated-word recognition problems.

  • PDF

A Fibonacci Posterorder Circulants (피보나치 후위순회 원형군)

  • Kim Yong-Seok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.743-746
    • /
    • 2006
  • In this paper, we propose and analyze a new parallel computer topology, called the Fibonacci posterorder circulants. It connects ${\Large f}_x,\;n{\geq}2$ processing nodes, same the number of nodes used in a comparable Fibonacci cube. Yet its diameter is only ${\lfloor}\frac{n}{3}{\rfloor}$ almost one third that of the Fibonacci cube. Fibonacci cube is asymmetric, but it is a regular and symmetric static interconnection networks for large-scale, loosely coupled systems. It includes scalability and Fibonacci cube as a spanning subgraph.

  • PDF

Location-based Support Multi-path Multi-rate Routing for Grid Mesh Networks

  • Hieu, Cao Trong;Hong, Choong Seon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.1264-1266
    • /
    • 2009
  • We introduce a location-based routing model applied for grid backbone nodes in wireless mesh network. The number of paths with nearest distance between two nodes is calculated and used as key parameter to execute routing algorithm. Node will increase the transmission range that makes a trade off with data rate to reach its neighbors when node itself is isolated. The routing model is lightweight and oriented thanks to the simple but efficient routing algorithm.

Estimation of performance for random binary search trees (확률적 이진 검색 트리 성능 추정)

  • 김숙영
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.2
    • /
    • pp.203-210
    • /
    • 2001
  • To estimate relational models and test the theoretical hypotheses of binary tree search algorithms, we built binary search trees with random permutations of n (number of nodes) distinct numbers, which ranged from three to seven. Probabilities for building binary search trees corresponding to each possible height and balance factor were estimated. Regression models with variables of number of nodes, height, and average number of comparisons were estimated and the theorem of O(1g(n)) was accepted experimentally by a Lack of Test procedure. Analysis of Variance model was applied to compare the average number of comparisons with three groups by height and balance factor of the trees to test theoretical hypotheses of a binary search tree performance statistically.

  • PDF

Development of Halfway Station Recommendation Application Using Dijkstra's Algorithm (다익스트라 알고리즘을 활용한 중간지점 추천 애플리케이션 개발)

  • Park, Naeun;Mun, Jiyeon;Jeoung, Yuna;Cho, Seoyeon;Huh, Won Whoi
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.2
    • /
    • pp.312-319
    • /
    • 2021
  • This study aims to help users to have a more satisfying encounter based on the problems found by comparing and analyzing similar applications. That is, an application that derives intermediate points through the subway, which is a public transportation means, and provides information on nearby convenience facilities was proposed. The middle point calculation process uses the dijkstra algorithm, which stores the minimum number of nodes in the stored path from the first input location to the last location. The stack and arraylist are used to search all paths from the first input position to the last position, and then the path with the smallest number of nodes is selected. After that, the number of stations in the route is divided in half and the resulting station is output. In addition, this study provides information on convenience facilities near intermediate points in order to have differences from similar applications. It categorizes within a 1km radius of the point and provides a function that helps to conveniently identify only facilities around the middle point. In particular, by visualizing the number of convenience facilities with radar charts and numbers, it is possible to grasp the commercial district around the midpoint at a glance.

Development of CPLD Technology Mapping Algorithm Improving Run-Time under Time Constraint (시간제약 조건하에서 수행시간을 개선한 CPLD 기술 매핑 알고리즘 개발)

  • 윤충모;김희석
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.4
    • /
    • pp.15-24
    • /
    • 1999
  • In this paper, we propose a new CPLD technology mapping algorithm improving run-time under time constraint. In our technology mapping algorithm, a given logic equation is constructed as the DAG type, then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result. it makes delay time and the number of CLBs, run-time to be minimized. Also, after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within CLB. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB.

  • PDF

Improvement of Energy Efficiency of LEACH Protocol for Wireless Sensor Networks (무선센서 네트워크를 위한 LEACH 프로토콜의 에너지 효율 향상 방안)

  • Lee, Sang-Hoon;Suk, Jung-Bong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.2B
    • /
    • pp.76-81
    • /
    • 2008
  • LEACH (Low Energy Adaptive Clustering Hierarchy) has been proposed as a routing protocol with a hierarchical structure, in order to achieve the energy efficiency that is of primary importance in the wireless sensor networks. A wireless sensor network adopting LEACH is composed of a few clusters, each of which consists of member nodes that sense the data, and head nodes that deliver the collected data from member nodes to a sink node that is connected to a backbone network. A head node in a cluster allocates TDMA slots to its member nodes without taking into account whether they have data to transmit or not, thus resulting in inefficiency of energy usage of head node that remains in active mode during the entire round time. This motivates us to propose a scheme to improve the energy efficiency of LEACH, by assigning TDMA slots only to those member nodes who have data to send. As a result, the head node can remain sleep during the period of no data transmission from member nodes, leading to the substantial energy saving. By using the ns-2 simulator, we evaluate the performance of the proposed scheme in comparison with the original LEACH. Experimental results validate our scheme, showing a better performance than original LEACH in terms of the number of outliving nodes and the quantity of energy consumption as time evolves.

Measuring the Connectivity of Nodes in Road Networks (도로 네트워크의 노드 연계성 산정에 관한 연구)

  • Park, Jun-Sik;Gang, Seong-Cheol
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.4
    • /
    • pp.129-139
    • /
    • 2010
  • This study proposes a model for measuring the connectivity of nodes in road networks. The connectivity index between two nodes is characterized by the number of routes, degree of circuitousness, design speed, and route capacity between the nodes. The connectivity index of a node is then defined as the weighted average of the connectivity indexes between the node and other nodes under consideration. The weighting factor between two nodes is determined by the travel demand and distance between them. The application of the model to a toy network shows that it reasonably well quantifies the level of connectivity of nodes in the network. If flow of rail networks can be measured in the same scale as that of road networks and the capacity of rail links can be estimated, the model proposed in this paper could be applied to intermodal transportation networks as well.

A Study on the Application of Block Chain to Ensure Data Integrity in MANET Environment (MANET 환경에서 데이터 무결성 보장을 위한 블록체인 적용에 관한 연구)

  • Yang, Hwanseok;Choi, Daesoo
    • Convergence Security Journal
    • /
    • v.18 no.5_1
    • /
    • pp.53-58
    • /
    • 2018
  • MANET transmits data by hop-by-hop method because it is composed of mobile nodes without support of any infrastructure. Its structure is very similar to a block chain. However, it is exposed to various threats such as data tampering or destruction by malicious nodes because of transmission method. So, ensuring the integrity of transmitted data is an important complement to MANET. In this paper, we propose a method to apply the block chain technique in order to protect the reliability value of the nodes consisting the network from malicious nodes. For this, hierarchical structure of a cluster type is used. Only cluster head stores the reliability information of the nodes in a block and then, this can be spread. In addition, we applied block generation difficulty automatic setting technique using the number of nodes selecting cluster head and the reliability of cluster head to prevent the spread of wrong blocks. This can prevent block generation and spread by malicious nodes. The superior performance of the proposed technique can be verified by comparing experiments with the SAODV technique.

  • PDF