• Title/Summary/Keyword: Node Number

Search Result 1,871, Processing Time 0.03 seconds

On the set up to the Number of Hidden Node of Adaptive Back Propagation Neural Network (적응 역전파 신경회로망의 은닉 층 노드 수 설정에 관한 연구)

  • Hong, Bong-Wha
    • The Journal of Information Technology
    • /
    • v.5 no.2
    • /
    • pp.55-67
    • /
    • 2002
  • This paper presents an adaptive back propagation algorithm that update the learning parameter by the generated error, adaptively and varies the number of hidden layer node. This algorithm is expected to escaping from the local minimum and make the best environment for convergence to be change the number of hidden layer node. On the simulation tested this algorithm on two learning pattern. One was exclusive-OR learning and the other was $7{\times}5$ dot alphabetic font learning. In both examples, the probability of becoming trapped in local minimum was reduce. Furthermore, in alphabetic font learning, the neural network enhanced to learning efficient about 41.56%~58.28% for the conventional back propagation. and HNAD(Hidden Node Adding and Deleting) algorithm.

  • PDF

Prognostic Value of Lymph Node Ratios in Node Positive Rectal Cancer Treated with Preoperative Chemoradiation

  • Nadoshan, Jamal Jafari;Omranipour, Ramesh;Beiki, Omid;Zendedel, Kazem;Alibakhshi, Abbas;Mahmoodzadeh, Habibollah
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.14 no.6
    • /
    • pp.3769-3772
    • /
    • 2013
  • Background: To investigate the impact of the lymph node ratio (LNR) on the prognosis of patients with locally advanced rectal cancer undergoing pre-operative chemoradiation. Methods: Clinicopathologic and follow up data of 128 patients with stage III rectal cancer who underwent curative resection from 1996 to 2007 were reviewed. The patients were divided into two groups according to the lymph node ratio: LNR ${\leq}$ 0.2 (n=28), and >0.2 (n=100). Kaplan-Meier and the Cox proportional hazard regression models were used to evaluate the prognostic effects according to LNR. Results: Median numbers of lymph nodes examined and lymph nodes involved by tumour were 10.3 (range 2-28) and 5.8 (range 1-25), respectively, and the median LNR was 0.5 (range, 0-1.6). The 5-year survival rate significantly differed by LNR (${\leq}$ 0.2, 69%; >0.2, 19%; Log-rank p value < 0.001). LNR was also a significant prognostic factor of survival adjusted for age, sex, post-operative chemotherapy, total number of examined lymph nodes, metastasis and local recurrence (${\leq}$ 0.2, HR=1; >0.2, HR=4.8, 95%CI=2.1-11.1) and a significant predictor of local recurrence and distant metastasis during follow-up independently of total number of examined lymph node. Conclusions: Total number of examined lymph nodes and LNR were significant prognostic factors for survival in patients with stage III rectal cancer undergoing pre-operative chemoradiotherapy.

Protecting the iTrust Information Retrieval Network against Malicious Attacks

  • Chuang, Yung-Ting;Melliar-Smith, P. Michael;Moser, Louise E.;Lombera, Isai Michel
    • Journal of Computing Science and Engineering
    • /
    • v.6 no.3
    • /
    • pp.179-192
    • /
    • 2012
  • This paper presents novel statistical algorithms for protecting the iTrust information retrieval network against malicious attacks. In iTrust, metadata describing documents, and requests containing keywords, are randomly distributed to multiple participating nodes. The nodes that receive the requests try to match the keywords in the requests with the metadata they hold. If a node finds a match, the matching node returns the URL of the associated information to the requesting node. The requesting node then uses the URL to retrieve the information from the source node. The novel detection algorithm determines empirically the probabilities of the specific number of matches based on the number of responses that the requesting node receives. It also calculates the analytical probabilities of the specific numbers of matches. It compares the observed and the analytical probabilities to estimate the proportion of subverted or non-operational nodes in the iTrust network using a window-based method and the chi-squared statistic. If the detection algorithm determines that some of the nodes in the iTrust network are subverted or non-operational, then the novel defensive adaptation algorithm increases the number of nodes to which the requests are distributed to maintain the same probability of a match when some of the nodes are subverted or non-operational as compared to when all of the nodes are operational. Experimental results substantiate the effectiveness of the detection and defensive adaptation algorithms for protecting the iTrust information retrieval network against malicious attacks.

An Analysis of the Secret Routing Algorithm for Secure Communications (안전한 통신을 위한 비밀 경로 알고리즘의 분석)

  • Yongkeun Bae;Ilyong Chung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.7 no.3
    • /
    • pp.105-116
    • /
    • 1997
  • Routing security is related to the confidentiality of the route taken by the data transmitted over the network. If the route is detected by the adversary, the probability is higher that the data are lost or the data can be intercepted by the adversary. Therefore, the route must be protected. To accomplish this, we select an intermediate node secretly and transmit the data using this intermediate node, instead of sending the data to the destination node using the shortest path. Furthermore, if we use a number of secret routes from the starting node to the destination node, data security is much stronger since we can transmit partial data rather than the entire data along a secret route. In this paper, the routing algorithm for multiple secret paths on MRNS(Mixed Radix Number System) Network, which requires O(1) for the time complexity where is the number of links on a node, is presented employing the HCLS(Hamiltonian Circuit Latin Square) and is analyzed in terms of entropy.

Processing-Node Status-based Message Scattering and Gathering for Multi-processor Systems on Chip

  • Park, Jongsu
    • Journal of information and communication convergence engineering
    • /
    • v.17 no.4
    • /
    • pp.279-284
    • /
    • 2019
  • This paper presents processing-node status-based message scattering and gathering algorithms for multi-processor systems on chip to reduce the communication time between processors. In the message-scattering part of the message-passing interface (MPI) scatter function, data transmissions are ordered according to the proposed linear algorithm, based on the processor status. The MPI hardware unit in the root processing node checks whether each processing node's status is 'free' or 'busy' when an MPI scatter message is received. Then, it first transfers the data to a 'free' processing node, thereby reducing the scattering completion time. In the message-gathering part of the MPI gather function, the data transmissions are ordered according to the proposed linear algorithm, and the gathering is performed. The root node receives data from the processing node that wants to transfer first, and reduces the completion time during the gathering. The experimental results show that the performance of the proposed algorithm increases at a greater rate as the number of processing nodes increases.

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

Performance Analysis of Optimal Neural Network structural BPN based on character value of Hidden node (은닉노드의 특징 값을 기반으로 한 최적신경망 구조의 BPN성능분석)

  • 강경아;이기준;정채영
    • Journal of the Korea Society of Computer and Information
    • /
    • v.5 no.2
    • /
    • pp.30-36
    • /
    • 2000
  • The hidden node plays a role of the functional units that classifies the features of input pattern in the given question. Therefore, a neural network that consists of the number of a suitable optimum hidden node has be on the rise as a factor that has an important effect upon a result. However there is a problem that decides the number of hidden nodes based on back-propagation learning algorithm. If the number of hidden nodes is designated very small perfect learning is not done because the input pattern given cannot be classified enough. On the other hand, if designated a lot, overfitting occurs due to the unnecessary execution of operation and extravagance of memory point. So, the recognition rate is been law and the generality is fallen. Therefore, this paper suggests a method that decides the number of neural network node with feature information consisted of the parameter of learning algorithm. It excludes a node in the Pruning target, that has a maximum value among the feature value obtained and compares the average of the rest of hidden node feature value with the feature value of each hidden node, and then would like to improve the learning speed of neural network deciding the optimum structure of the multi-layer neural network as pruning the hidden node that has the feature value smaller than the average.

  • PDF

A Block-based Uniformly Distributed Random Node Arrangement Method Enabling to Wirelessly Link Neighbor Nodes within the Communication Range in Free 3-Dimensional Network Spaces (장애물이 없는 3차원 네트워크 공간에서 통신 범위 내에 무선 링크가 가능한 블록 기반의 균등 분포 무작위 노드 배치 방법)

  • Lim, DongHyun;Kim, Changhwa
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.10
    • /
    • pp.1404-1415
    • /
    • 2022
  • The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

An Adaptive AODV Algorithm for Considering Node Mobility (노드 이동성을 고려한 적응형 AODV 알고리즘)

  • Hong, Youn-Sik;Hong, Jun-Sik;Lim, Hwa-Seok
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.6
    • /
    • pp.529-537
    • /
    • 2008
  • AODV routing protocol is intended for use by mobile' nodes in an ad-hoc network. In AODV nodes create routes on an on-demand basis. As the degree of node mobility becomes high, however, the number of the control packets, RREQ and RREP messages, have increased so rapidly. The unexpected increases in the number of the control packets cause the destination node to decrease the packet receiving rate and also to increase the overall energy consumption of such a network. In this paper, we propose a novel method of adaptively controlling the occurrences of such RREQ messages based on AIAD (additive increase additive decrease) under a consideration of the current network status. We have tested our proposed method with the conventional AODV and the method using timestamp based on the three performance metrics, i.e.. how long does node moves, node velocity, and node density, to compare their performance.

A Stable Clustering Scheme Based on Node Mobility for Mobile Ad Hoc Networks (모바일 애드 혹 네트워크에서 이동성을 고려한 안정적인 클러스터링 기법)

  • Kim, Hyek-Su;Hwang, Jun-Ho;Yoo, Myung-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5B
    • /
    • pp.480-488
    • /
    • 2009
  • A mobile ad-hoc network is an autonomous collection of wireless mobile nodes that organizes a temporary network without any network infrastructure. Due to node mobility, it is a challenging task to maintain the network topology. In this paper, we propose a stable clustering algorithm that uses node mobility for cluster formation. In the proposed algorithm, the node mobility is measured by counting the number of nodes entering into/leaving from its transmission range. The node having the lowest mobility is selected as a cluster head. For topology maintenance with reduced control overhead, the cluster head adaptively controls the broadcasting period of hello message to the measured node mobility. Through computer simulations, it is verified that the proposed algorithm outperforms previous clustering algorithms in terms of control overhead, the rate of node mobility changes and the number of cluster head changes.