• Title/Summary/Keyword: node number

Search Result 1,867, Processing Time 0.039 seconds

PSN: A Dynamic Numbering Scheme for W3C XQuery Update Facility

  • Hong, Dong-Kweon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.8 no.2
    • /
    • pp.121-125
    • /
    • 2008
  • It is essential to maintain hierarchical information properly for efficient XML query processing. Well known approach to represent hierarchical information of XML tree is assigning a specific node number to each node of XML tree. Insertion and deletion of XML node can occur at any position in a dynamic XML tree. A dynamic numbering scheme allows us to add nodes to or delete nodes from an XML tree without relabeling or with relabeling only a few existing nodes of XML tree while executing XML query efficiently. According to W3C XQuery update facility specifications a node can be added as first or last child of the existing node in XML tree. Generating new number for last child requires referencing the number of previous last child. Getting the number of last child is very costly with previous approaches. We have developed a new dynamic numbering scheme PSN which is very effective for insertion of a node as last child. Our approach reduces the time to find last child dramatically by removing sorting of children.

A Parent-controlled Collision Avoidance Scheme in GTS-based Wireless Sensor Network (GTS 기반 무선 센서 네트워크에서 부모 제어 충돌 회피 방안)

  • Lee, Kilhung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.13 no.5
    • /
    • pp.27-34
    • /
    • 2014
  • This paper presents a collision avoidance scheme for wireless sensor networks that use a GTS-based channel allocation scheme. Many sensor nodes can share a GTS channel for sending their data to the sink node. When a node tries to send a frame at a shared GTS channel, a collision can be occurred when there is a node that uses the same backoff number. For decreasing a wireless collision, the parent assigns a backoff number when a child node registers to it. Further, when a collision occurs during a data transfer, the parent node reassigns a new backoff number for the child node. Simulation results show that there is a decreased collision number with suggested parent-controlled collision avoidance scheme by effectively controlling the backoff number of the child.

Effects of feeding leaf positions on the growth and fruit quality in muskmelon plants showing leaf yellowing symptoms

  • Lee, Hee-Ju;Lee, Sang-Gyu;Park, Sung-Tae;Kim, Sung-Kyeom;Choi, Chang-Sun;Chun, Chang-Hoo
    • Korean Journal of Agricultural Science
    • /
    • v.42 no.4
    • /
    • pp.293-297
    • /
    • 2015
  • This study was conducted to evaluate the influence of feeding leaf positions on the growth, net formation of fruits, and occurrence of leaf yellowing symptoms (LYS) in muskmelon plants. Plants having five or ten more leaves above the fruit-bearing node produced the greater biomass than those of plants having equal or five less leaves above the fruit-bearing node. The number of leaves above the fruit-bearing node also influenced on the occurrence of LYS. The number of plants with LYS decreased as the number of leaves borne on the nodes above the fruit-bearing node increased. The LYS infected ratio of BL-5 treatment were the greatest, while fruit weight of BL+5 treatment were the greatest among all the tested treatments. In addition, the net formation of BL-5 treatment showed the poorest. Results indicated that maintaining the higher number of leaves over the fruit-bearing node might be feasible the practical method for coping physiological damages from yellowing symptoms.

The Low Power Algorithm using a Feasible Clustert Generation Method considered Glitch (글리치를 고려한 매핑가능 클러스터 생성 방법을 이용한 저전력 알고리즘)

  • Kim, Jaejin
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.12 no.2
    • /
    • pp.7-14
    • /
    • 2016
  • In this paper presents a low power algorithm using a feasible cluster generation method considered glitch. The proposed algorithm is a method for reducing power consumption of a given circuit. The algorithm consists of a feasible cluster generation process and glitches removal process. So that glitches are not generated for the node to which the switching operation occurs most frequently in order to reduce the power consumption is a method for generating a feasible cluster. A feasible cluster generation process consisted of a node value set, dividing the node, the node aligned with the feasible cluster generation. A feasible cluster generation procedure is produced from the highest number of nodes in the output. When exceeding the number of OR-terms of the inputs of the selected node CLB prevents the signal path is varied by the evenly divided. If there are nodes with the same number of outputs selected by the first highest number of nodes in the input produces a feasible cluster. Glitch removal process removes glitches through the path balancing in the same manner as [5]. Experimental results were compared with the proposed algorithm [5]. Number of blocks has been increased by 5%, the power consumption was reduced by 3%.

Approximate Analysis of MAC Protocol with Multiple Self-tokens in a Slotted Ring

  • Sakuta, Makoto;Sasase, Iwao
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.249-257
    • /
    • 2003
  • Ring networks are very commonly exploited among local area and metropolitan area networks (LAN/MAN), whereas cells or small fixed-size packets are widely used in synchronized ring networks. In this paper, we present an analytical method for evaluating the delay-throughput performance of a MAC protocol with multiple self-tokens in a slotted ring network under uniform traffic. In our analysis, we introduce the stationary probability, which indicates the number of packets in a node. Also, it is assumed that each node has a sufficiently large amount of self-tokens, and a slotted ring has the symmetry. The analytical results with respect to delay-throughput performance have similar values to computer simulated ones. Furthermore, in order to achieve fair access under non-uniform traffic, we propose an adaptive MAC protocol, where the number of self-tokens in a node dynamically varies, based on the number of packets transmitted within a specified period. In the proposed protocol, when the number of packets transmitted by a node within a specified period is larger than a specified threshold, the node decreases the number of self-tokens in a per-node distributed method. That results in creating free slots in the ring, thus all nodes can obtain an equal opportunity to transmit into the ring. Performance results obtained by computer simulation show that our proposed protocol can maintain throughput fairness under non-uniform traffic.

A Study on performance increment of routing protocol using fixed node at mobile ad.hoc network (노드 예측을 통한 mobile ad.hoc 네트워크의 라우팅 프로토콜 성능 개선에 관한 연구)

  • Oh, Kyu-Tae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.917-918
    • /
    • 2009
  • This study evaluated the level of performance improvement in the form of a simulated experiment by adding fixed node in the middle of the network as a way to improve mobile ad.hoc network performance. The result showed that the performance level was much higher when fixed node was used together than when mobile node was used only, and the comparison of the mobile speed of mobile node also showed that use of fixed node together had higher performance. Moreover, the evaluation in accordance with the number of fixed node showed that more number of fixed node had shorter time delay. Further study following this on how many fixed node should be added on the ad.hoc network will ensure establishment of more reliable ad.hoc network.

Chaos Based Random Number Generation In Tiny MCU (소형마이콤에서의 카오스난수 발생 함수구현)

  • Hyun, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.47 no.3
    • /
    • pp.1-4
    • /
    • 2010
  • RS-485, communication bases from small network system must prepare in collision. The collision is that mean the data transfer breaks. For a stabilized communication chooses 1:N polling methods. But polling is low speed in addition to maybe overload Master device. So, usual N:N Prefers a communication. In this case, must be preparing to avoid collision or some solutions. Generally, to after collision retransmits after short time. It's called delay time for short time. When making a delay time, uses address of each systems. (Address of each node) If the many nodes collided, the each node has different delay time. When making a delay time, uses a usual random number. Making a random number is hard job. So uses a usual pseudorandom number. It is more difficult from small size MCU. The Chaos random number provides stabled value. Finally, when uses the Chaos random number, the stability and reliability of system get better.

Clinicopathologic Features Predicting Involvement of Nonsentinel Axillary Lymph Nodes in Iranian Women with Breast Cancer

  • Moosavi, Seyed Alireza;Abdirad, Afshin;Omranipour, Ramesh;Hadji, Maryam;Razavi, Amirnader Emami;Najafi, Massoome
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.17
    • /
    • pp.7049-7054
    • /
    • 2014
  • Background: Almost half of the breast cancer patients with positive sentinel lymph nodes have no additional disease in the remaining axillary lymph nodes. This group of patients do not benefit from complete axillary lymph node dissection. This study was designed to assess the clinicopathologic factors that predict non-sentinel lymph node metastasis in Iranian breast cancer patients with positive sentinel lymph nodes. Materials and Methods: The records of patients who underwent sentinel lymph node biopsy, between 2003 and 2012, were reviewed. Patients with at least one positive sentinel lymph node who underwent completion axillary lymph node dissection were enrolled in the present study. Demographic and clinicopathologic characteristics including age, primary tumor size, histological and nuclear grade, lymphovascular invasion, perineural invasion, extracapsular invasion, and number of harvested lymph nodes, were evaluated. Results: The data of 167 patients were analyzed. A total of 92 (55.1%) had non-sentinel lymph node metastasis. Univariate analysis of data revealed that age, primary tumor size, histological grade, lymphovascular invasion, perineural invasion, extracapsular invasion, and the number of positive sentinel lymph nodes to the total number of harvested sentinel lymph nodes ratio, were associated with non-sentinel lymph node metastasis. After logistic regression analysis, age (OR=0.13; 95% CI, 0.02-0.8), primary tumor size (OR=7.7; 95% CI, 1.4-42.2), lymphovascular invasion (OR=19.4; 95% CI, 1.4-268.6), extracapsular invasion (OR=13.3; 95% CI, 2.3-76), and the number of positive sentinel lymph nodes to the total number of harvested sentinel lymph nodes ratio (OR=20.2; 95% CI, 3.4-121.9), were significantly associated with non-sentinel lymph node metastasis. Conclusions: According to this study, age, primary tumor size, lymphovascular invasion, extracapsular invasion, and the ratio of positive sentinel lymph nodes to the total number of harvested sentinel lymph nodes, were found to be independent predictors of non-sentinel lymph node metastasis.

Growth Properties of Central and Peripheral Ramets in a Zoysia sinica's Clone

  • Min, Byeong-Mee
    • Journal of Ecology and Environment
    • /
    • v.29 no.2
    • /
    • pp.105-111
    • /
    • 2006
  • A natural, tidal-flat clone of Zoysia sinica was studied to compare ramet growth properties in central area with in peripheral area. In new stolon and rhizome, internode length, weight, shoot height and weight, and spike production were monitored on July 25, 2004. The weight/height rate of shoot between stolon and rhizome, the shoot/stolon (or rhizome) rate in weight between central and peripheral area were not different. However, other properties differed in stolon from rhizome or between central and peripheral area significantly differed: 1. The rhizome in central area had a larger node number, shorter internode length, higher shoot height, larger shoot biomass, and higher rate of non-shoot nodes than that in peripheral area. 2. The stolon in central area had a smaller node number, shorter internode length, and smaller biomass than that in peripheral area. 3. In the same area, the rhizome had a larger node number (except for central area), shorter internode, higher shoot height, larger shoot biomass, higher rate of non-shoot node, and higher rate of node having over two shoots than the stolon. No relationship could be found between shoot size and spike production in shoot on vertical rhizome (lower node of old shoot).

The Influence of Weight Adjusting Method and the Number of Hidden Layer있s Node on Neural Network있s Performance (인공 신경망의 학습에 있어 가중치 변화방법과 은닉층의 노드수가 예측정확성에 미치는 영향)

  • 김진백;김유일
    • The Journal of Information Systems
    • /
    • v.9 no.1
    • /
    • pp.27-44
    • /
    • 2000
  • The structure of neural networks is represented by a weighted directed graph with nodes representing units and links representing connections. Each link is assigned a numerical value representing the weight of the connection. In learning process, the values of weights are adjusted by errors. Following experiment results, the interval of adjusting weights, that is, epoch size influenced neural networks' performance. As epoch size is larger than a certain size, neural networks'performance decreased drastically. And the number of hidden layer's node also influenced neural networks'performance. The networks'performance decreased as hidden layers have more nodes and then increased at some number of hidden layer's node. So, in implementing of neural networks the epoch size and the number of hidden layer's node should be decided by systematic methods, not empirical or heuristic methods.

  • PDF