• Title/Summary/Keyword: node position

Search Result 340, Processing Time 0.035 seconds

On the Modification of Gauss Integral Point of 6 Node Two Dimensional Isoparametric Element -Linear and Nonlinear Static and Dynamic Bending Analyses- (6절점 2차원 Isoparametric요소의 가우스적분점 수정에 관하여 -선형, 비선형의 정적 및 동적 굽힘해석-)

  • 김정운;정래훈;권영두
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.17 no.12
    • /
    • pp.3007-3019
    • /
    • 1993
  • For the same configuration, the stiffness of 6-node two dimensional isoparametric is stiffer than that of 8-node two dimensional isoparametric element. This phenomenon may be called 'Relative Stiffness Stiffening Phenomenon.' In this paper, the relative stiffness stiffening phenomenon was studied, and could be corrected by modifying the position of Gauss integral points used in the numerical integration of the stiffness matrix. For the same deformation (bending) energy of 6-node and 8-node two dimensional isoparametric elements, Gauss integral points of 6-node element have to move closer, in comparison with those of 8-node element, in the case of numerical integration along the thickness direction.

Development of Position Awareness Algorithm Using Improved Trilateration Measurement Method (개선된 삼변측량법을 이용한 위치인지 알고리즘 개발)

  • Sohn, Jong-Hoon;Hwang, Gi-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.473-480
    • /
    • 2013
  • In this paper, location recognition algorithm is developed to improve the accuracy using improve Trilateration. The location recognition algorithm is first calculate the location refer to the measured signal power. Error can be occurred when measure distance with arranged node in specific location. If the distance data is received from node (receiver, coordinator), Node selected for location calculation is defined through section. If the distance data is received from node (receiver, coordinator), Node selected for location calculation is defined through section. Second, we apply algorithm of section filtering. If there are 4 sections in node, we consider 1 section to 6 location recognition coordinates. A special characteristic drawback of RF is that the actual distance is actually farther than the calculated received distance data. This is error is incurred when the signal strength increases. We reduce the location recognition error by applying an improved algorithm as secondary after filtering primary through section filtering.

Design and Evaluation of a Fuzzy Hierarchical Location Service for Mobile Ad Hoc Networks

  • Bae, Ihn-Han;Kim, Yoon-Jeong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.18 no.3
    • /
    • pp.757-766
    • /
    • 2007
  • Location services are used in mobile ad hoc and hybrid networks to locate either the geographic position of a given node in the network or a data item. One of the main usages of position location services is presented in location based routing algorithms. In particular, geographic routing protocols can route messages more efficiently to their destinations based on the destination node's geographic position, which is provided by a location service. In this paper, we propose an adaptive location service on the basis of fuzzy logic called FHLS (Fuzzy Hierarchical Location Service) for mobile ad hoc networks. The adaptive location update scheme using the fuzzy logic on the basis of the mobility and the call preference of mobile nodes is used by the FHLS. The performance of the FHLS is to be evaluated by a simulation, and compared with that of existing HLS scheme.

  • PDF

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.

Influences by position of node and existence of leaf on microtuberization in node culture of potato (감자절간배양에서 마디위치 및 잎의 부착유무에 따른 소괴경형성의 차이)

  • Hwang, Hye-Yeon;Lee, Young-Bok
    • Journal of Plant Biotechnology
    • /
    • v.35 no.1
    • /
    • pp.63-68
    • /
    • 2008
  • Single-node stem pieces ca. 1 cm in length containing a axillary bud were obtained from in vitro plants of potato (Solanum tuberosum L.). The influences by a position of the node and the existence of a leaf at the node were observed in the single-node culture on the 8% sucrose MS medium. The effect of CCC was also investigated for the microtuberization. The apical part node was excellent in the tuberization not to mention shoot length, fresh weight, diameter, the number of node on the in vitro culture of a single-node than the lower part. The differences in the diameter of a tuber formed in the part of the axillary bud on all treatments including the cultivation of the apical part node were not recognized. However, the fresh weight of the tuber showed high value in the tuber formed at the axillary bud of shoot apex part. At 20 days after cultivation, tuberization was promoted in the new stolen that developed from the bud of node with a leaf under SD condition of 8 hours at $20^{\circ}C$. The tuberization from axillary bud of the single-node without leaf was inhibited at high temperature of $28^{\circ}C$ regardless of daylength. Whereas, tuberization at $20^{\circ}C$ and $28^{\circ}C$ was similar without the difference under SD condition but the tuber formation ratio were low. CCC 500 mg/L promoted tuberization and the effect was also showed even under LD condition at $28^{\circ}C$. The inhibiton of tuberization under LD and high temperature condition could be solved by treatment with CCC.

The Parameter Identification for Localization Scheme of the Optics-Based Micro Sensor Node (광신호 기반의 마이크로 센서 노드 위치 인식 시스템을 위한 파라미터 식별)

  • Jeon, Ji-Hun;Lee, Min-Su;Park, Chan-Gook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.2
    • /
    • pp.81-86
    • /
    • 2013
  • In this paper, the parameter identification for localization scheme for the optics-based micro sensor node is conducted. We analyzed short measurement range problem which can be occurred in optical based micro sensor node localization method using a time of flight. And we set up the theory for distance and maximum reflected laser power to overcome the problem by identifying hardware parameters like laser power, effective area of MEMS CCR, sensitivity of photodetector, and so on. Experimental results of measurement of maximum reflected laser power were compared with results of the theory. By using the theory, we can identify hardware parameters of localization scheme to measure particular position of the optics-based micro sensor node.

Visual Servoing of Robot Manipulators using Pruned Recurrent Neural Networks (저차원화된 리커런트 뉴럴 네트워크를 이용한 비주얼 서보잉)

  • 김대준;이동욱;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.11a
    • /
    • pp.259-262
    • /
    • 1997
  • This paper presents a visual servoing of RV-M2 robot manipulators to track and grasp moving object, using pruned dynamic recurrent neural networks(DRNN). The object is stationary in the robot work space and the robot is tracking and grasping the object by using CCD camera mounted on the end-effector. In order to optimize the structure of DRNN, we decide the node whether delete or add, by mutation probability, first in case of delete node, the node which have minimum sum of input weight is actually deleted, and then in case of add node, the weight is connected according to the number of case which added node can reach the other nodes. Using evolutionary programming(EP) that search the struture and weight of the DRNN, and evolution strategies(ES) which train the weight of neuron, we pruned the net structure of DRNN. We applied the DRNN to the Visual Servoing of a robot manipulators to control position and orientation of end-effector, and the validity and effectiveness of the pro osed control scheme will be verified by computer simulations.

  • PDF

Routing in Vehicular Ad Hoc Networks: Issues and Protocols

  • Shrestha, Raj K.;Moh, Sang-Man;Chung, Il-Yong
    • Korea Multimedia Society
    • /
    • v.12 no.4
    • /
    • pp.28-40
    • /
    • 2008
  • Vehicular ad hoc networks (VANETs) are a practical application class of wireless ad hoc networks, which consist of moving vehicles equipped with radio communication capabilities that collaborate to form a temporary network. This paper addresses issues and protocols of multihop routing in such emerging networks in the context of safety and infotainment applications. Due to the highly dynamic mobility of vehicles, frequent link breakage and short connection time are inevitable and, thus, the routing is a challenging task and interest for many researchers and industrial community. The frequent and dynamic change of topology makes the topology-based routing unreliable but the position-based routing more effective. The position-based routing consists of the location service which maps a node id to a geo-graphical position and the forwarding scheme which selects the next hop based on geo-graphical information of the node, its neighbors and the destination. The routing techniques are further categorized into geographical forwarding, trajectory forwarding and opportunistic forwarding based on the forwarding scheme. In this paper, we first present the distinguished properties of VANETs and the challenges and intractable issues posed in designing the routing protocols, followed by the comprehensive survey of existing routing protocols. Then, the different routing protocols designed for VANETs are compared in terms of characteristics, performance and application domains.

  • PDF

An Efficient Core-Based Multicast Tree using Weighted Clustering in Ad-hoc Networks (애드혹 네트워크에서 가중치 클러스터링을 이용한 효율적인 코어-기반 멀티캐스트 트리)

  • Park, Yang-Jae;Han, Seung-Jin;Lee, Jung-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.10C no.3
    • /
    • pp.377-386
    • /
    • 2003
  • This study suggested a technique to maintain an efficient core-based multicast tree using weighted clustering factors in mobile Ad-hoc networks. The biggest problem with the core-based multicast tree routing is to decide the position of core node. The distance of data transmission varies depending on the position of core node. The overhead's effect on the entire network is great according to the recomposition of the multicast tree due to the movement of core node, clustering is used. A core node from cluster head nodes on the multicast tree within core area whose weighted factor is the least is chosen as the head core node. Way that compose multicast tree by weighted clustering factors thus and propose keeping could know that transmission distance and control overhead according to position andmobility of core node improve than existent multicast way, and when select core node, mobility is less, and is near in center of network multicast tree could verification by simulation stabilizing that transmission distance is short.