• 제목/요약/키워드: Virtual Nodes

검색결과 222건 처리시간 0.027초

Energy release rate for kinking crack using mixed finite element

  • Salah, Bouziane;Hamoudi, Bouzerd;Noureddine, Boulares;Mohamed, Guenfoud
    • Structural Engineering and Mechanics
    • /
    • 제50권5호
    • /
    • pp.665-677
    • /
    • 2014
  • A numerical method, using a special mixed finite element associated with the virtual crack extension technique, has been developed to evaluate the energy release rate for kinking cracks. The element is two dimensional 7-node mixed finite element with 5 displacement nodes and 2 stress nodes. The mixed finite element ensures the continuity of stress and displacement vectors on the coherent part and the free edge effect. This element has been formulated starting from a parent element in a natural plane with the aim to model different types of cracks with various orientations. Example problems with kinking cracks in a homogeneous material and bimaterial are presented to assess the computational accuracies.

Quantitative Analysis of Enlarged Cervical Lymph Nodes with Ultrasound Elastography

  • Zhang, Jun-Peng;Liu, Hua-Yan;Ning, Chun-Ping;Chong, Jing;Sun, Yong-Mei
    • Asian Pacific Journal of Cancer Prevention
    • /
    • 제16권16호
    • /
    • pp.7291-7294
    • /
    • 2015
  • Purpsoe: To investigate the diagnostic value of quantitative analysis of a tissue diffusion and virtual touch tissue imaging quantification (VTIQ) technique with acoustic radiation force impulse (ARFI) elastography for assessing enlarged cervical lymph nodes. Materials and Methods: Fifty-six enlarged cervical lymph nodes confirmed by pathologic diagnoses were covered in the study. According to the results of pathologic diagnosis, patients were classified into benign and malignant groups. All the patients were examined by both conventional ultrasonography and elastography. AREA% and shear wave velocity (SWV) in ROI of different groups were calculated and compared using ROC curves. Cut-off points of AREA% and SWV were determined with receiver operating characteristic curves. Results: Final histopathological results revealed 21 cases of benign and 35 cases of malignant lymph nodes. The mean values of AREA% and SWV in benign and malignant groups were $45.0{\pm}17.9%$ and $2.32{\pm}0.57m/s$, and $61.3{\pm}21.29%$ and $4.36{\pm}1.25$)m/s, respectively. For the parameters of elastography, "AREA%" and SWV demonstrated significant differences between groups (p=0.002). AREA% was positively correlated with SWV with a correlation coefficient of 0.809 (P<0.001). Conclusions: Stiffness of different lymph node diseases in patients may differ. Elastography can evaluate changes sensitively and provide valuable information to doctors. The study proved that the VTIQ elastography technique can play an important role in differential diagnosis of lymph nodes.

An Efficient Flash Memory B-Tree Supporting Very Cheap Node Updates (플래시 메모리 B-트리를 위한 저비용 노드 갱신 기법)

  • Lim, Seong-Chae
    • The Journal of the Korea Contents Association
    • /
    • 제16권8호
    • /
    • pp.706-716
    • /
    • 2016
  • Because of efficient space utilization and fast key search times, B-trees have been widely accepted for the use of indexes in HDD-based DBMSs. However, when the B-ree is stored in flash memory, its costly operations of node updates may impair the performance of a DBMS. This is because the random updates in B-tree's leaf nodes could tremendously enlarge I/O costs for the garbage collecting actions of flash storage. To solve the problem, we make all the parents of leaf nodes the virtual nodes, which are not stored physically. Rather than, those nodes are dynamically generated and buffered by referring to their child nodes, at their access times during key searching. By performing node updates and tree reconstruction within a single flash block, our proposed B-tree can reduce the I/O costs for garbage collection and update operations in flash. Moreover, our scheme provides the better performance of key searches, compared with earlier flash-based B-trees. Through a mathematical performance model, we verify the performance advantages of the proposed flash B-tree.

Implementation of a TDMA-based Bidirectional Linear Wireless Sensor Network (양방향 통신을 지원하는 시분할 기반 무선 센서 네트워크의 구현)

  • Lee, Hyung-Bong;Park, Lae-Jeong;Moon, Jung-Ho;Chung, Tae-Yun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • 제14권4호
    • /
    • pp.341-351
    • /
    • 2008
  • Communication in wireless sensor networks comprising a plurality of sensor nodes located in an ad hoc environment is unidirectional in that data gathered by sensor nodes are transmitted to a sink node and not vice versa. In those networks, it is not possible for a server or a gateway to send commands to the sensor nodes to determine whether some previously received data are valid when the data indicate unusual conditions, which makes it difficult to make appropriate reactions to the unusual situations. This paper proposes and implements a TDMA-based sensor network communication protocol named BiWSLP(Bidirectional Wireless Sensor Line Protocol) supporting bidirectional communication capability. The BiWSLP is an extension of the WSLP, a unidirectional sensor network communication protocol based on the TDMA protocol. To test the feasibility of the proposed BiWSLP, we construct a virtual bridge management system capable of sending commands to sensor nodes as well as collecting data from the sensor nodes. Based on the test results of the virtual bridge management system, we show the applicability and advantages of the BiWSLP in terms of energy efficiency and bidirectional communication capability.

The development of asynchronous ranging scheme based on the virtual slot (가상슬롯 기반의 비동기 거리 추정 기법 개발)

  • Ko, Young-Wook;Kim, Hwan-Yong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • 제17권8호
    • /
    • pp.31-37
    • /
    • 2016
  • Ranging is divided into a synchronous scheme and an asynchronous scheme according to the presence of global synchronization between nodes. In general, the asynchronous ranging is preferred over synchronous ranging because it does not require an expensive high-precision oscillator for the global synchronization. On the other hand, in a conventional asynchronous ranging scheme, the packets, which are generated by all nodes in a positioning system of a large-scale infrastructure and need to be sent for localization by reference nodes, are considerable, which cause an increase in network traffic as the number of nodes increases. The traffic congestion lowers the throughput of the network leading to a considerable loss of energy. To solve this problem, this paper proposes a ranging scheme, in which virtual transmission slots randomly and discretely selected by a plurality of nodes are used to reduce the overheads needed in synchronizing the nodes, and the ranging is performed asynchronously based on the virtual transmission slots, thereby decreasing the network traffic. In addition, a performance test proved that the proposed ranging scheme was stronger than the TWR and SDS-TWR on an error range, even though the intensity of traffic was very low.

Practical Node Deployment Scheme Based on Virtual Force for Wireless Sensor Networks in Complex Environment

  • Lu, Wei;Yang, Yuwang;Zhao, Wei;Wang, Lei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권3호
    • /
    • pp.990-1013
    • /
    • 2015
  • Deploying sensors into a target region is a key issue to be solved in building a wireless sensor network. Various deployment algorithms have been proposed by the researchers, and most of them are evaluated under the ideal conditions. Therefore, they cannot reflect the real environment encountered during the deployment. Moreover, it is almost impossible to evaluate an algorithm through practical deployment. Because the deployment of sensor networks require a lot of nodes, and some deployment areas are dangerous for human. This paper proposes a deployment approach to solve the problems mentioned above. Our approach relies on the satellite images and the Virtual Force Algorithm (VFA). It first extracts the topography and elevation information of the deployment area from the high resolution satellite images, and then deploys nodes on them with an improved VFA. The simulation results show that the coverage rate of our method is approximately 15% higher than that of the classical VFA in complex environment.

Improving User Satisfaction in Adaptive Multicast Video

  • de Amorim, Marcelo Dias;Duarte, Otto Carlos M.B.;Pujolle, Guy
    • Journal of Communications and Networks
    • /
    • 제4권3호
    • /
    • pp.221-229
    • /
    • 2002
  • Adaptability is the most promising feature to be applied in future robust multimedia applications. In this paper, we propose the Direct Algorithm to improve the degree of satisfaction at heterogeneous receivers in multi-layered multicast video environments. The algorithm relies on a mechanism that dynamically controls the rates of the video layers and is based on feedback control packets sent by the receivers. The algorithm also addresses scalability issues by implementing a merging procedure at intermediate nodes in order to avoid packet implosion at the source in the case of large multicast groups. The proposed scheme is optimized to achieve high global video quality and reduced bandwidth requirements. We also propose the Direct Algorithm with a virtual number of layers. The virtual layering scheme induces intermediate nodes to keep extra states of the multicast session, which reduces the video degradation for all the receivers. The results show that the proposed scheme leads to improved global video quality at heterogeneous receivers with no cost of extra bandwidth.

Routing Protocol for Wireless Sensor Networks Based on Virtual Force Disturbing Mobile Sink Node

  • Yao, Yindi;Xie, Dangyuan;Wang, Chen;Li, Ying;Li, Yangli
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권4호
    • /
    • pp.1187-1208
    • /
    • 2022
  • One of the main goals of wireless sensor networks (WSNs) is to utilize the energy of sensor nodes effectively and maximize the network lifetime. Thus, this paper proposed a routing protocol for WSNs based on virtual force disturbing mobile Sink node (VFMSR). According to the number of sensor nodes in the cluster, the average energy and the centroid factor of the cluster, a new cluster head (CH) election fitness function was designed. At the same time, a hexagonal fixed-point moving trajectory model with the best radius was constructed, and the virtual force was introduced to interfere with it, so as to avoid the frequent propagation of sink node position information, and reduce the energy consumption of CH. Combined with the improved ant colony algorithm (ACA), the shortest transmission path to Sink node was constructed to reduce the energy consumption of long-distance data transmission of CHs. The simulation results showed that, compared with LEACH, EIP-LEACH, ANT-LEACH and MECA protocols, VFMSR protocol was superior to the existing routing protocols in terms of network energy consumption and network lifetime, and compared with LEACH protocol, the network lifetime was increased by more than three times.

Application of Virtual SEA for the Prediction of Acoustic Performance of Cockpit (칵핏 흡차음 성능 예측을 위한 Virtual SEA 의 활용)

  • Jeong, Won-Tae;Ko, Chang-Sung;Park, Hyung-Hwan
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 한국소음진동공학회 2007년도 추계학술대회논문집
    • /
    • pp.903-912
    • /
    • 2007
  • One of the crucial factors which determine the quality and the accuracy of SEA model is how subsystems are defined. Experimental SEA technique had been a unique way to divide entire systems accurately for mid-frequency range, until FEA based virtual FRF response technique, virtual SEA method presented. Virtaul SEA has been developed for predictive SEA tool in early design process. In this study, Modal analysis results from modified crash FE model is used for Statistical transfer matrix. Observation nodes on the cockpit are grouped by attractive substructuring method based on point to point transfer and correlation matrix. Complex cockpit structure is divided into subsystems by automatic substructuring. Comparison with experimental SEA results validates the application of Virtual SEA to cockpit.

  • PDF

Context-Driven Framework for High Level Configuration of Virtual Businesses (가상기업의 형성을 위한 컨텍스트 기반 프레임워크)

  • Lee, Kyung-Huy;Oh, Sang-Bong
    • Journal of Information Technology Applications and Management
    • /
    • 제14권2호
    • /
    • pp.11-26
    • /
    • 2007
  • In this paper we suggest a context-driven configuration model of virtual businesses to form a business network model consisting of role-based, interaction-centered business partners. The model makes use of the subcontext concept which explicitly represents actors and interactions in virtual business (VB) context. We separate actors who have capacities on tasks in a specific kind of role and actor subcontext which models requirements in specific interaction subcontext. Three kinds of actors are defined in virtual service chains, service user, service provider, and external service supporter. Interaction subcontext models a service exchange process between two actor subcontexts with consideration of context dependencies like task and quality dependencies. Each subcontext may be modeled in the form of a situation network which consists of a finite set of situation nodes and transitions. A specific situation is given in a corresponding context network of actors and interactions. It is illustrated with a simple example.

  • PDF