Search results for: arbitrary triangular-z node

Authors: Zhou Luchen, Wu Yubing, Burra Venkata Durga Kumar

Abstract:

As the scale of the network becomes larger and more complex than before, the density of user devices is also increasing. The development of Unmanned Aerial Vehicle (UAV) networks is able to collect and transform data in an efficient way by using software-defined networks (SDN) technology. This paper proposed a three-layer distributed and dynamic cluster architecture to manage UAVs by using an AI-based resource allocation calculation algorithm to address the overloading network problem. Through separating services of each UAV, the UAV hierarchical cluster system performs the main function of reducing the network load and transferring user requests, with three sub-tasks including data collection, communication channel organization, and data relaying. In this cluster, a head node and a vice head node UAV are selected considering the Central Processing Unit (CPU), operational (RAM), and permanent (ROM) memory of devices, battery charge, and capacity. The vice head node acts as a backup that stores all the data in the head node. The k-means clustering algorithm is used in order to detect high load regions and form the UAV layered clusters. The whole process of detecting high load areas, forming and selecting UAV clusters, and moving the selected UAV cluster to that area is proposed as offloading traffic algorithm.

Keywords: k-means, resource allocation, SDN, UAV network, unmanned aerial vehicles

Procedia PDF Downloads 84

Authors: Tao Feng, Xiaomei Ma, Xian Guo, Jing Wang

Abstract:

Named Data Network (NDN) is one of the future Internet architecture, all nodes (i.e., hosts, routers) are allowed to have a local cache, used to satisfy incoming requests for content. However, depending on caching allows an adversary to perform attacks that are very effective and relatively easy to implement, such as content pollution attack. In this paper, we use a method of secure network coding based on homomorphic signature system to solve this problem. Firstly ,we use a dynamic public key technique, our scheme for each generation authentication without updating the initial secret key used. Secondly, employing the homomorphism of hash function, intermediate node and destination node verify the signature of the received message. In addition, when the network topology of NDN is simple and fixed, the code coefficients in our scheme are generated in a pseudorandom number generator in each node, so the distribution of the coefficients is also avoided. In short, our scheme not only can efficiently prevent against Intra/Inter-GPAs, but also can against the content poisoning attack in NDN.

Keywords: named data networking, content polloution attack, network coding signature, internet architecture

Procedia PDF Downloads 313

Authors: Walid Abdallah, Noureddine Boudriga

Abstract:

Wireless sensor networks have shown their effectiveness in the deployment of many critical applications especially in the military domain. Border surveillance is one of these applications where a set of wireless sensors are deployed along a country border line to detect illegal intrusion attempts to the national territory and report this to a control center to undergo the necessary measures. Regarding its nature, this wireless sensor network can be the target of many security attacks trying to compromise its normal operation. Particularly, in this application the deployment and location of sensor nodes are of great importance for detecting and tracking intruders. This paper proposes a location-based authentication and key distribution mechanism to secure wireless sensor networks intended for border surveillance where the key establishment is performed using elliptic curve cryptography and identity-based public key scheme. In this scheme, the public key of each sensor node will be authenticated by keys that depend on its position in the monitored area. Before establishing a pairwise key between two nodes, each one of them must verify the neighborhood location of the other node using a message authentication code (MAC) calculated on the corresponding public key and keys derived from encrypted beacon messages broadcast by anchor nodes. We show that our proposed public key authentication and key distribution scheme is more resilient to node capture and node replication attacks than currently available schemes. Also, the achievement of the key distribution between nodes in our scheme generates less communication overhead and hence increases network performances.

Keywords: wireless sensor networks, border surveillance, security, key distribution, location-based

Procedia PDF Downloads 639

Authors: Ather Saeed, Arif Khan, Jeffrey Gosper

Abstract:

Sensor devices are prone to errors and sudden node failures, which are difficult to detect in a timely manner when deployed in real-time, hazardous, large-scale harsh environments and in medical emergencies. Therefore, the loss of data can be life-threatening when the sensed phenomenon is not disseminated due to sudden node failure, battery depletion or temporary malfunctioning. We introduce a set of partial differential equations for localizing faults, similar to Green’s and Maxwell’s equations used in Electrostatics and Electromagnetism. We introduce a node organization and clustering scheme for self-stabilizing sensor networks. Green’s theorem is applied to regions where the curve is closed and continuously differentiable to ensure network connectivity. Experimental results show that the proposed GTFD (Green’s Theorem fault-detection and Self-stabilization) protocol not only detects faulty nodes but also accurately generates network stability graphs where urgent intervention is required for dynamically self-stabilizing the network.

Keywords: Green’s Theorem, self-stabilization, fault-localization, RSSI, WSN, clustering

Procedia PDF Downloads 52

Authors: Keunhong Chae, Seokho Yoon

Abstract:

This paper proposes a cooperative Alamouti space time transmission scheme with low relay complexity for the cooperative communication systems. In the proposed scheme, the source node combines the data symbols to construct the Alamouti-coded form at the destination node, while the conventional scheme performs the corresponding operations at the relay nodes. In simulation results, it is shown that the proposed scheme achieves the second order cooperative diversity while maintaining the same bit error rate (BER) performance as that of the conventional scheme.

Keywords: Space-time transmission, cooperative communication system, MIMO.

Procedia PDF Downloads 328

Authors: K. Thiagarajan, K. Saranya, A. Veeraiah, B. Sudha

Abstract:

This paper presents a novel algorithm for secure, reliable and flexible transmission of big data in two hop wireless networks using cooperative jamming scheme. Two hop wireless networks consist of source, relay and destination nodes. Big data has to transmit from source to relay and from relay to destination by deploying security in physical layer. Cooperative jamming scheme determines transmission of big data in more secure manner by protecting it from eavesdroppers and malicious nodes of unknown location. The novel algorithm that ensures secure and energy balance transmission of big data, includes selection of data transmitting region, segmenting the selected region, determining probability ratio for each node (capture node, non-capture and eavesdropper node) in every segment, evaluating the probability using binary based evaluation. If it is secure transmission resume with the two- hop transmission of big data, otherwise prevent the attackers by cooperative jamming scheme and transmit the data in two-hop transmission.

Keywords: big data, two-hop transmission, physical layer wireless security, cooperative jamming, energy balance

Procedia PDF Downloads 461

Authors: Mehdi Assefi, Keihan Hataminezhad

Abstract:

One of the efficient architectures for exploring the resources in wireless ad-hoc networks is contact-based architecture. In this architecture, each node assigns a unique zone for itself and each node keeps all information from inside the zone, as well as some from outside the zone, which is called contact. Reducing the overlap between different zones of a node and its contacts increases its performance, therefore Edge Method (EM) is designed for this purpose. Contacts selected by EM do not have any overlap with their sources, but for choosing the contact a vast amount of information must be transmitted. In this article, we will offer a new protocol for contact selection, which is called PEM. The objective would be reducing the volume of transmitted information, using Non-Uniform Dissemination Probabilistic Protocols. Consumed energy for contact selection is a function of the size of transmitted information between nodes. Therefore, by reducing the content of contact selection message using the PEM will decrease the consumed energy. For evaluation of the PEM we applied the simulation method. Results indicated that PEM consumes less energy compared to EM, and by increasing the number of nodes (level of nodes), performance of PEM will improve in comparison with EM.

Keywords: wireless ad-hoc networks, contact selection, method for CARD, energy-efficient

Procedia PDF Downloads 268

Authors: Tallataf Rasheed, Adnan Rashdi, Ahmad Naeem Akhtar

Abstract:

The accurate spectrum sensing is a fundamental requirement of dynamic spectrum access for deployment of Cognitive Radio Network (CRN). To acheive this requirement a Reliability factors based Fuzzy Logic (RFL) Scheme for Spectrum Sensing has been proposed in this paper. Cognitive Radio User (CRU) predicts the presence or absence of Primary User (PU) using energy detector and calculates the Reliability factors which are SNR of sensing node, threshold of energy detector and decision difference of each node with other nodes in a cooperative spectrum sensing environment. Then the decision of energy detector is combined with Reliability factors of sensing node using Fuzzy Logic. These Reliability Factors used in RFL Scheme describes the reliability of decision made by a CRU to improve the local spectrum sensing. This Fuzzy combining scheme provides the accuracy of decision made by sensornode. The simulation results have shown that the proposed technique provide better PU detection probability than existing Spectrum Sensing Techniques.

Keywords: cognitive radio, spectrum sensing, energy detector, reliability factors, fuzzy logic

Procedia PDF Downloads 459

Authors: Ehsan Saghehei, Mahdi Eghbali

Abstract:

The maximal covering location problem (MCLP) was originally developed to determine a set of facility locations which would maximize the total customers' demand serviced by the facilities within a predetermined critical service criterion. However, on some problems that differences between the demand nodes are covered or the number of nodes each node is large, the method of solving MCLP may ignore these differences. In this paper, Heuristic solution based on the ranking of demands in each node and the number of nodes covered by each node according to a predetermined critical value is proposed. The output of this method is to maximize total demands of nodes and number of covered nodes, simultaneously. Furthermore, by providing an example, the solution algorithm is described and its results are compared with Greedy and Lagrange algorithms. Also, the results of the algorithm to solve the larger problem sizes that compared with other methods are provided. A summary and future works conclude the paper.

Keywords: heuristic solution, maximal covering location problem, ranking, set covering

Procedia PDF Downloads 550

Authors: Denis Spirjakin, Alexander Baranov, Saba Akbari, Natalia Kalenova, Vladimir Sleptsov

Abstract:

In this paper we propose the approach to power management in wireless combustible gas sensors. This approach makes possible drastically prolong sensor nodes autonomous lifetime. That is necessary to tie battery replacement to every year technical service procedures which are claimed by safety standards. Using this approach the current consumption of the wireless combustible gas sensor node was decreased from 80 mA to less than 2 mA and the power consumption from more than 220 mW to 4.6 mW. These values provide autonomous lifetime of the node more than one year.

Keywords: Gas sensors, power management, wireless sensor network

Procedia PDF Downloads 703

Authors: Sara Pereira-Nogueira, Tim Worbs, Marc Permanyer-Bosser, Reinhold Förster

Abstract:

While the entry mechanism of lymphocytes into the lymph node via the blood are well described, it is still largely unknown how cells enter lymph nodes that arrive via afferent lymphatics. In order to address this, our group has established a micro-injection technique in mice through which cells are delivered directly into the lymphatic vessel immediately afferent to the popliteal lymph node. Injected cells can then be tracked via multi-colour fluorescence or 2-photon microscopy, and their localization can be analysed within the popliteal or downstream lymph nodes by immunohistology. Since naïve B cells express the chemokine receptor CXCR5 we intra-lymphatically co-injected B cells derived from wildtype and Cxcr5-deficient mice. While CXCR5 does not play a role in guiding B cells out of the subcapsular sinus, it affects their positioning within the lymph node parenchyma, since CXCR5-deficient B cells are impaired in migrating into the B cell follicle. The knowledge obtained by studying B-cell migration may prove beneficial in clinical settings regarding tumor metastasis or autoimmune diseases.

Keywords: afferent lymphatics, B cell migration, chemokine, intra-lymphatic injection

Procedia PDF Downloads 240

Authors: Alireza Lohrasbi, Alireza Lavaei, Mohammadali M. Shahlaei

Abstract:

The liquid flow and the free surface shape during the initial stage of dam breaking are investigated. A numerical scheme is developed to predict the wave of an unsteady, incompressible viscous flow with free surface. The method involves a two dimensional finite element (2D), in a vertical plan. The Naiver-Stokes equations for conservation of momentum and mass for Newtonian fluids, continuity equation, and full nonlinear kinematic free-surface equation were used as the governing equations. The mapping developed to solve highly deformed free surface problems common in waves formed during wave propagation, transforms the run up model from the physical domain to a computational domain with Arbitrary Lagrangian Eulerian (ALE) finite element modeling technique.

Keywords: dam break, Naiver-Stokes equations, free-surface flows, Arbitrary Lagrangian-Eulerian

Procedia PDF Downloads 306

Authors: Shu-Yen Wang, Shyh-Huei Hwang

Abstract:

Designated as an important architectural complex of settlement by the Ministry of Culture, Hua-Zhai Settlement located in Wang-An Township, Peng-Hu County, of Taiwan has been progressively restored year by year and is now at the revitalization and reutilization stage. Over the last 5 years, YunTech has participated in the restoration project while being in compliance with the Bureau of Cultural Heritage’s spirit of 'Living Heritage Conservation'. In this study, reflections have been made to evaluate the contemporariness of traditional settlement development from the aspects of revitalization and reutilization. On the one hand, the connection between settlers’ experiences and emotions have been clarified through the living nodes, collective memory, and social-cultural connotation. On the other hand, activity design has promoted the reconstruction of living nodes and facilitated the reconnection of collective memory, enabling us to explore the contemporariness of living nodes after the reconstruction. With the adoption of literature review, participant observation, and interview analysis methods, this study concludes the following results: 1) The node reconstruction brings back the memories and makes emotional connections: the spatial collective memory is composed of different components. During the reconstruction of node space, villagers participated not only in the narration of the history but also in the restoration of the space. This process enables villagers to bring back their memories and make emotional connections thereto. 2) Villagers’ understanding towards revitalization has been facilitated through node reconstruction: as a medium of this project, activity design has facilitated node reconstruction by offering villagers a natural environment to build up emotional connections to the settlement. This also enables us to better understand the meaning of settlement activation for the local community. 3) New connections are established in life between villagers and the university through the construction of living nodes: through the local implementation of node reconstruction, new connections have been established in life between villagers who participated in the project and the university. In the meantime, the university’s entrance to the community has also been revalued.

Keywords: collective memory, local sense of belonging, reconstruction of living nodes, the important architectural complex of Wang-An Hua-Zhai settlement

Procedia PDF Downloads 117

Authors: Asma Ben Yaghlane, Mohamed Naceur Azaiez

Abstract:

We consider the problem of attacks on networks. We define the concept of system survivability in networks in the presence of intelligent threats. Our setting of the problem assumes a flow to be sent from one source node to a destination node. The attacker attempts to disable the network by preventing the flow to reach its destination while the defender attempts to identify the best path-set to use to maximize the chance of arrival of the flow to the destination node. Our concept is shown to be different from the classical concept of network reliability. We distinguish two types of network survivability related to the defender and to the attacker of the network, respectively. We prove that the defender-based-network survivability plays the role of a lower bound while the attacker-based-network survivability plays the role of an upper bound of network reliability. We also prove that both concepts almost never agree nor coincide with network reliability. Moreover, we use the shortest-path problem to determine the defender-based-network survivability and the min-cut problem to determine the attacker-based-network survivability. We extend the problem to a variety of models including the minimum-spanning-tree problem and the multiple source-/destination-network problems.

Keywords: defense/attack strategies, information, networks, reliability, survivability

Procedia PDF Downloads 366

Authors: Hyungoo Kang, Minsung Kim, Jinkoo Kim

Abstract:

This study investigates the performance of a 2D and 3D steel moment frame subjected to vehicle collision at a first story column using LS-DYNA. The finite element models of vehicles provided by the National Crash Analysis Center (NCAC) are used for numerical analysis. Nonlinear dynamic time history analysis of the 2D and 3D model structures are carried out based on the arbitrary column removal scenario, and the vertical displacement of the damaged structures are compared with that obtained from collision analysis. The analysis results show that the model structure remains stable when the speed of the vehicle is 40km/h. However, at the speed of 80 and 120km/h both the 2D and 3D structures collapse by progressive collapse. The vertical displacement of the damaged joint obtained from collision analysis is significantly larger than the displacement computed based on the arbitrary column removal scenario.

Keywords: vehicle collision, progressive collapse, FEM, LS-DYNA

Procedia PDF Downloads 319

Authors: Hanieh Tarbiat Khosrowshahi, Mojtaba Shakeri

Abstract:

Wireless Sensor Networks (WSNs) consist of a set of sensor nodes with limited capability. WSNs may suffer from multiple node failures when they are exposed to harsh environments such as military zones or disaster locations and lose connectivity by getting partitioned into disjoint segments. Relay nodes (RNs) are alternatively introduced to restore connectivity. They cost more than sensors as they benefit from mobility, more power and more transmission range, enforcing a minimum number of them to be used. This paper addresses the problem of RN placement in a multiple disjoint network by developing a genetic algorithm (GA). The problem is reintroduced as the Steiner tree problem (which is known to be an NP-hard problem) by the aim of finding the minimum number of Steiner points where RNs are to be placed for restoring connectivity. An upper bound to the number of RNs is first computed to set up the length of initial chromosomes. The GA algorithm then iteratively reduces the number of RNs and determines their location at the same time. Experimental results indicate that the proposed GA is capable of establishing network connectivity using a reasonable number of RNs compared to the best existing work.

Keywords: connectivity restoration, genetic algorithms, multiple-node failure, relay nodes, wireless sensor networks

Procedia PDF Downloads 219

Authors: Shouta Sora, Shizuki Kuriu, Radhika Mishra, Ariunbuyan Sukhbaatar, Maya Sakamoto, Shiro Mori, Tetsuya Kodama

Abstract:

Lymph node (LN) metastasis accounts for 20 - 30 % of all deaths in patients with head and neck cancer. Therefore, the control of metastatic lymph nodes (MLNs) is necessary to improve the life prognosis of patients with cancer. In a classical metastatic theory, tumor cells are thought to metastasize hematogenously through a bead-like network of lymph nodes. Recently, a lymph node-mediated hematogenous metastasis theory has been proposed, in which sentinel LNs are regarded as a source of distant metastasis. Therefore, the treatment of MLNs at the early stage is essential to prevent distant metastasis. Radiation therapy is one of the primary therapeutic modalities in cancer treatment. In addition, total body irradiation (TBI) has been reported to act as activation of natural killer cells and increase of infiltration of CD4+ T-cells to tumor tissues. However, the treatment effect of TBI for MLNs remains unclear. This study evaluated the possibilities of low-dose total body irradiation (L-TBI) and middle-dose total body irradiation (M-TBI) for the treatment of MLNs. Mouse breast cancer FM3A-Luc cells were injected into subiliac lymph node (SiLN) of MXH10/Mo/LPR mice to induce the metastasis to the proper axillary lymph node (PALN) and lung. Mice were irradiated for the whole body on 4 days after tumor injection. The L-TBI and M-TBI were defined as irradiations to the whole body at 0.2 Gy and 1.0 Gy, respectively. Tumor growth was evaluated by in vivo bioluminescence imaging system. In the non-irradiated group, tumor activities on SiLN and PALN significantly increased over time, and the metastasis to the lung from LNs was confirmed 28 days after tumor injection. The L-TBI led to a tumor growth delay in PALN but did not control tumor growth in SiLN and metastasis to the lung. In contrast, it was found that the M-TBI significantly delayed the tumor growth of both SiLN and PALN and controlled the distant metastasis to the lung compared with non-irradiated and L-TBI groups. These results suggest that the M-TBI is an effective treatment method for MLNs in the early stage and distant metastasis from lymph nodes via blood vessels connected with LNs.

Keywords: metastatic lymph node, lung metastasis, radiation therapy, total body irradiation, lymphatic system

Procedia PDF Downloads 164

Authors: Kazeem Adesina Dauda, Waheed Babatunde Yahya

Abstract:

To design a tree that maximizes within-node homogeneity, there is a need for a homogeneity measure that is appropriate for event history data with multiple risks. We consider the use of Deviance and Modified Cox-Snell residuals as a measure of impurity in Classification Regression Tree (CART) and compare our results with the results of Fiona (2008) in which homogeneity measures were based on Martingale Residual. Data structure approach was used to validate the performance of our proposed techniques via simulation and real life data. The results of univariate competing risk revealed that: using Deviance and Cox-Snell residuals as a response in within node homogeneity classification tree perform better than using other residuals irrespective of performance techniques. Bone marrow transplant data and double-blinded randomized clinical trial, conducted in other to compare two treatments for patients with prostate cancer were used to demonstrate the efficiency of our proposed method vis-à-vis the existing ones. Results from empirical studies of the bone marrow transplant data showed that the proposed model with Cox-Snell residual (Deviance=16.6498) performs better than both the Martingale residual (deviance=160.3592) and Deviance residual (Deviance=556.8822) in both event of interest and competing risks. Additionally, results from prostate cancer also reveal the performance of proposed model over the existing one in both causes, interestingly, Cox-Snell residual (MSE=0.01783563) outfit both the Martingale residual (MSE=0.1853148) and Deviance residual (MSE=0.8043366). Moreover, these results validate those obtained from the Monte-Carlo studies.

Keywords: within-node homogeneity, Martingale residual, modified Cox-Snell residual, classification and regression tree

Procedia PDF Downloads 251

Authors: J. R. Wang, H. T. Lin, Y. S. Tseng, W. Y. Li, H. C. Chen, S. W. Chen, C. Shih

Abstract:

TRACE is developed by U.S. NRC for the nuclear power plants (NPPs) safety analysis. We focus on the establishment and application of TRACE/FRAPTRAN/SNAP models for Chinshan NPP (BWR/4) spent fuel pool in this research. The geometry is 12.17 m × 7.87 m × 11.61 m for the spent fuel pool. In this study, there are three TRACE/SNAP models: one-channel, two-channel, and multi-channel TRACE/SNAP model. Additionally, the cooling system failure of the spent fuel pool was simulated and analyzed by using the above models. According to the analysis results, the peak cladding temperature response was more accurate in the multi-channel TRACE/SNAP model. The results depicted that the uncovered of the fuels occurred at 2.7 day after the cooling system failed. In order to estimate the detailed fuel rods performance, FRAPTRAN code was used in this research. According to the results of FRAPTRAN, the highest cladding temperature located on the node 21 of the fuel rod (the highest node at node 23) and the cladding burst roughly after 3.7 day.

Keywords: TRACE, FRAPTRAN, BWR, spent fuel pool

Procedia PDF Downloads 334

Authors: Muhammad Umar Kiani, Waseem Sakawat

Abstract:

This study presents the development of FEM code using Quadrilateral 4-Node (Q4) and Triangular 3-Node (T3) elements. Code is formulated using MATLAB language. Instead of using both elements in the same code, two separate codes are written. Quadrilateral element is difficult to handle directly, that is why natural coordinates (eta, ksi) are used. Due to this, Q4 code includes numerical integration (Gauss quadrature). In this case, complete numerical integration is performed using 2 points. On the other hand, T3 element can be modeled directly, by using direct stiffness approach. Axially loaded element, cantilever (special constraints) and Patch test cases were analyzed using both codes and the results were verified by using Ansys.

Keywords: FEM code, MATLAB, numerical integration, ANSYS

Procedia PDF Downloads 397

Authors: Soroush Maddah, Houra Asgarian, Mahdi Navidbakhsh

Abstract:

In the present paper, the problem of pulsatile micropolar blood flow through an elastic artery has been studied. An arbitrary Lagrangian-Eulerian (ALE) formulation for the governing equations has been produced to model the fully-coupled fluid-structure interaction (FSI) and has been solved numerically using finite difference scheme by exploiting a mesh generation technique which leads to a uniformly spaced grid in the computational plane. Effect of the variations of cardiac output and wall artery module of elasticity on blood pressure with blood-pressure regulating drugs like Atenolol has been determined. Also, a numerical model has been produced to define precisely the effects of various dosages of a drug on blood flow in arteries without the numerous experiments that have many mistakes and expenses.

Keywords: arbitrary Lagrangian-Eulerian, Atenolol, fluid structure interaction, micropolar fluid, pulsatile blood flow

Procedia PDF Downloads 404

Authors: Mona Almansoori, Ahmed Mustafa, Ahmad Elshamy

Abstract:

Wireless nodes in a sensor network gather and process critical information designed to process and communicate, information flooding through such network is critical for decision making and data processing, the integrity of such data is one of the most critical factors in wireless security without compromising the processing and transmission capability of the network. This paper presents mechanism to securely transmit data over a chain of sensor nodes without compromising the throughput of the network utilizing available battery resources available at the sensor node.

Keywords: hybrid protocol, data integrity, lightweight encryption, neighbor based key sharing, sensor node data processing, Z-MAC

Procedia PDF Downloads 128

Authors: Lijuan Zhou, Mengqi Wu, Changyong Niu

Abstract:

Attributed graph clustering can utilize the graph topology and node attributes to uncover hidden community structures and patterns in complex networks, aiding in the understanding and analysis of complex systems. Utilizing contrastive learning for attributed graph clustering can effectively exploit meaningful implicit relationships between data. However, existing attributed graph clustering methods based on contrastive learning suffer from the following drawbacks: 1) Complex data augmentation increases computational cost, and inappropriate data augmentation may lead to semantic drift. 2) The selection of positive and negative samples neglects the intrinsic cluster structure learned from graph topology and node attributes. Therefore, this paper proposes a method called self-supervised Attributed Graph Clustering with Dual Contrastive Loss constraints (AGC-DCL). Firstly, Siamese Multilayer Perceptron (MLP) encoders are employed to generate two views separately to avoid complex data augmentation. Secondly, the neighborhood contrastive loss is introduced to constrain node representation using local topological structure while effectively embedding attribute information through attribute reconstruction. Additionally, clustering-oriented contrastive loss is applied to fully utilize clustering information in global semantics for discriminative node representations, regarding the cluster centers from two views as negative samples to fully leverage effective clustering information from different views. Comparative clustering results with existing attributed graph clustering algorithms on six datasets demonstrate the superiority of the proposed method.

Keywords: attributed graph clustering, contrastive learning, clustering-oriented, self-supervised learning

Procedia PDF Downloads 21

Authors: Chin-Chia Jane

Abstract:

In a transportation network, travel time refers to the transmission time from source node to destination node, whereas reliability refers to the probability of a successful connection from source node to destination node. With an increasing emphasis on quality of service (QoS), both performance indexes are significant in the design and analysis of transportation systems. In this work, we extend the well-known flow network model for transportation networks so that travel time and reliability are integrated into the QoS measurement simultaneously. In the extended model, in addition to the general arc capacities, each intermediate node has a time weight which is the travel time for per unit of commodity going through the node. Meanwhile, arcs and nodes are treated as binary random variables that switch between operation and failure with associated probabilities. For pre-specified travel time limitation and demand requirement, the QoS of a transportation network is the probability that source can successfully transport the demand requirement to destination while the total transmission time is under the travel time limitation. This work is pioneering, since existing literatures that evaluate travel time reliability via a single optimization path, the proposed QoS focuses the performance of the whole network system. To compute the QoS of transportation networks, we first transfer the extended network model into an equivalent min-cost max-flow network model. In the transferred network, each arc has a new travel time weight which takes value 0. Each intermediate node is replaced by two nodes u and v, and an arc directed from u to v. The newly generated nodes u and v are perfect nodes. The new direct arc has three weights: travel time, capacity, and operation probability. Then the universal set of state vectors is recursively decomposed into disjoint subsets of reliable, unreliable, and stochastic vectors until no stochastic vector is left. The decomposition is made possible by applying existing efficient min-cost max-flow algorithm. Because the reliable subsets are disjoint, QoS can be obtained directly by summing the probabilities of these reliable subsets. Computational experiments are conducted on a benchmark network which has 11 nodes and 21 arcs. Five travel time limitations and five demand requirements are set to compute the QoS value. To make a comparison, we test the exhaustive complete enumeration method. Computational results reveal the proposed algorithm is much more efficient than the complete enumeration method. In this work, a transportation network is analyzed by an extended flow network model where each arc has a fixed capacity, each intermediate node has a time weight, and both arcs and nodes are independent binary random variables. The quality of service of the transportation network is an integration of customer demands, travel time, and the probability of connection. We present a decomposition algorithm to compute the QoS efficiently. Computational experiments conducted on a prototype network show that the proposed algorithm is superior to existing complete enumeration methods.

Keywords: quality of service, reliability, transportation network, travel time

Procedia PDF Downloads 196

Authors: Farshad Ghassemi Toosi, Nikola S. Nikolov

Abstract:

We present a visualization technique for radial drawing of trees consisting of two slightly different algorithms. Both of them make use of node-link diagrams for visual encoding. This visualization creates clear drawings without edge crossing. One of the algorithms is suitable for real-time visualization of large trees, as it requires minimal recalculation of the layout if leaves are inserted or removed from the tree; while the other algorithm makes better utilization of the drawing space. The algorithms are very similar and follow almost the same procedure but with different parameters. Both algorithms assign angular coordinates for all nodes which are then converted into 2D Cartesian coordinates for visualization. We present both algorithms and discuss how they compare to each other.

Keywords: Radial drawing, Visualization, Algorithm, Use of node-link diagrams

Procedia PDF Downloads 314

Authors: Nalinee Sophatsathit

Abstract:

This paper presents a variation of navigation systems which tallies every node along the shortest path from start to destination nodes. The underlying technique rests on the well-established Dijkstra Algorithm. The ultimate goal is to serve as a user navigation guide that furnishes stop over cost of every node along this shortest path, whereby users can decide whether or not to visit any specific nodes. The output is an implementable module that can be further refined to run on the Internet and smartphone technology. This will benefit large organizations having physical installations spreaded over wide area such as hospitals, universities, etc. The savings on service personnel, let alone lost time and unproductive work, are attributive to innovative navigation system management.

Keywords: navigation systems, shortest path, smartphone technology, user navigation guide

Procedia PDF Downloads 311

Authors: Raghavi C. Janaswamy

Abstract:

In the healthcare sector, heterogenous data elements such as patients, diagnosis, symptoms, conditions, observation text from physician notes, and prescriptions form the essentials of the Electronic Health Record (EHR). The data in the form of clear text and images are stored or processed in a relational format in most systems. However, the intrinsic structure restrictions and complex joins of relational databases limit the widespread utility. In this regard, the design and development of realistic mapping and deep connections as real-time objects offer unparallel advantages. Herein, a graph neural network-based classification of EHR data has been developed. The patient conditions have been predicted as a node classification task using a graph-based open source EHR data, Synthea Database, stored in Tigergraph. The Synthea DB dataset is leveraged due to its closer representation of the real-time data and being voluminous. The graph model is built from the EHR heterogeneous data using python modules, namely, pyTigerGraph to get nodes and edges from the Tigergraph database, PyTorch to tensorize the nodes and edges, PyTorch-Geometric (PyG) to train the Graph Neural Network (GNN) and adopt the self-supervised learning techniques with the AutoEncoders to generate the node embeddings and eventually perform the node classifications using the node embeddings. The model predicts patient conditions ranging from common to rare situations. The outcome is deemed to open up opportunities for data querying toward better predictions and accuracy.

Keywords: electronic health record, graph neural network, heterogeneous data, prediction

Procedia PDF Downloads 69

Authors: Julio Vega

Abstract:

Expression recognition is a field of Artificial Intelligence whose main objectives are to recognize basic forms of affective expression that appear on people’s faces and contributing to behavioral studies. In this work, a ROS node has been developed that, based on Deep Learning techniques, is capable of detecting the facial expressions of the people that appear in the image. These algorithms were optimized so that they can be executed in real time on an embedded platform. The experiments were carried out in a PC with a USB camera and in a Raspberry Pi 4 with a PiCamera. The final results shows a plausible system, which is capable to work in real time even in an embedded platform.

Keywords: python, low-cost, raspberry pi, emotion detection, human-robot interaction, ROS node

Procedia PDF Downloads 103

Authors: Amira E. Derbalah, Doaa M. Zaghloul

Abstract:

10 clinically healthy hemal nodes were collected from male bulls aged 2-3 years. Light microscopy revealed a capsule of connective tissue consisted mainly of collagen fiber surrounding hemal node, numerous erythrocytes were found in wide subcapsular sinus under the capsule. The parenchyma of the hemal node was divided into cortex and medulla. Diffused lymphocytes, and lymphoid follicles, having germinal centers were the main components of the cortex, while in the medulla there was wide medullary sinus, diffused lymphocytes and few lymphoid nodules. The area occupied with lymph nodules was larger than that occupied with non-nodular structure of lymphoid cords and blood sinusoids. Electron microscopy revealed the cellular components of hemal node including elements of circulating erythrocytes intermingled with lymphocytes, plasma cells, mast cells, reticular cells, macrophages, megakaryocytes and endothelial cells lining the blood sinuses. The lymphocytes were somewhat triangular in shape with cytoplasmic processes extending between adjacent erythrocytes. Nuclei were triangular to oval in shape, lightly stained with clear nuclear membrane indentation and clear nucleoli. The reticular cells were elongated in shape with cytoplasmic processes extending between adjacent lymphocytes, rough endoplasmic reticulum, ribosomes and few lysosomes were seen in their cytoplasm. Nucleus was elongated in shape with less condensed chromatin. Plasma cells were oval to irregular in shape with numerous dilated rough endoplasmic reticulum containing electron lucent material occupying the whole cytoplasm and few mitochondria were found. Nuclei were centrally located and oval in shape with heterochromatin emarginated and often clumped near the nuclear membrane. Occasionally megakaryocytes and mast cells were seen among lymphocytes. Megakaryocytes had multilobulated nucleus and free ribosomes often appearing as small aggregates in their cytoplasm, while mast cell had their characteristic electron dense granule in the cytoplasm, few electron lucent granules were found also, we conclude that, the main function of the hemal node of cattle is proliferation of lymphocytes. No role for plasma cell in erythrophagocytosis could be suggested.

Keywords: cattle, electron microscopy, hemal node, histology, immune system

Procedia PDF Downloads 380

Authors: Rishabh Sharma

Abstract:

The main design parameter of WSN (wireless sensor network) is the energy consumption. To compensate this parameter, hierarchical clustering is a technique that assists in extending duration of the networks life by efficiently consuming the energy. This paper focuses on dealing with the WSNs and the FIS (fuzzy interface system) which are deployed to enhance the BEENISH protocol. The node energy, mobility, pause time and density are considered for the selection of CH (cluster head). The simulation outcomes exhibited that the projected system outperforms the traditional system with regard to the energy utilization and number of packets transmitted to sink.

Keywords: wireless sensor network, sink, sensor node, routing protocol, fuzzy rule, fuzzy inference system

Procedia PDF Downloads 80