Search results for: positive lymph nodes number

Authors: Diya Kohli, Amalia Ardeljan, Lexi Frankel, Jose Garcia, Lokesh Manjani, Omar Rashid

Abstract:

Gonorrhea is the second most common sexually transmitted disease (STDs) in the United States of America. Gonorrhea affects the urethra, rectum, or throat and the cervix in females. Lymphoma is a cancer of the immune network called the lymphatic system that includes the lymph nodes/glands, spleen, thymus gland, and bone marrow. Lymphoma can affect many organs in the body. When a lymphocyte develops a genetic mutation, it signals other cells into rapid proliferation that causes many mutated lymphocytes. Multiple studies have explored the incidence of cancer in people infected with STDs such as Gonorrhea. For instance, the studies conducted by Wang Y-C and Co., as well as Caini, S and Co. established a direct co-relationship between Gonorrhea infection and incidence of prostate cancer. We hypothesize that Gonorrhea infection also increases the incidence of Lymphoma in patients. This research study aimed to evaluate the correlation between Gonorrhea infection and the incidence of Lymphoma. The data for the research was provided by a Health Insurance Portability and Accountability Act (HIPAA) compliant national database. This database was utilized to evaluate patients infected with Gonorrhea versus the ones who were not infected to establish a correlation with the prevalence of Lymphoma using ICD-10 and ICD-9 codes. Access to the database was granted by the Holy Cross Health, Fort Lauderdale for academic research. Standard statistical methods were applied throughout. Between January 2010 and December 2019, the query was analyzed and resulted in 254 and 808 patients in both the infected and control group, respectively. The two groups were matched by Age Range and CCI score. The incidence of Lymphoma was 0.998% (254 patients out of 25455) in the Gonorrhea group (patients infected with Gonorrhea that was Lymphoma Positive) compared to 3.174% and 808 patients in the control group (Patients negative for Gonorrhea but with Lymphoma). This was statistically significant by a p-value < 2.210-16 with an OR= 0.431 (95% CI 0.381-0.487). The patients were then matched by antibiotic treatment to avoid treatment bias. The incidence of Lymphoma was 1.215% (82 patients out of 6,748) in the Gonorrhea group compared to 2.949% (199 patients out of 6748) in the control group. This was statistically significant by a p-value <5.410-10 with an OR= 0.468 (95% CI 0.367-0.596). The study shows a statistically significant correlation between Gonorrhea and a reduced incidence of Lymphoma. Further evaluation is recommended to assess the potential of Gonorrhea in reducing Lymphoma.

Keywords: gonorrhea, lymphoma, STDs, cancer, ICD

Procedia PDF Downloads 173

Authors: Virender Ranga, Mayank Dave, Anil Kumar Verma

Abstract:

Recently wireless sensor networks (WSNs) are used in many real life applications like environmental monitoring, habitat monitoring, health monitoring etc. Due to power constraint cheaper devices used in these applications, the energy consumption of each device should be kept as low as possible such that network operates for longer period of time. One of the techniques to prolong the network lifetime is an intelligent grouping of sensor nodes such that they can perform their operation in cooperative and energy efficient manner. With this motivation, we propose a novel approach by organize the sensor nodes in cooperative multihop mini-groups so that the total global energy consumption of the network can be reduced and network lifetime can be improved. Our proposed approach also reduces the number of transmitted messages inside the WSNs, which further minimizes the energy consumption of the whole network. The experimental simulations show that our proposed approach outperforms over the state-of-the-art approach in terms of stability period and aggregated data.

Keywords: clustering, cluster-head, mini-group, stability period

Procedia PDF Downloads 326

Authors: Anu Malhotra

Abstract:

An Ad-hoc network is one that is an autonomous, self configuring network made up of mobile nodes connected via wireless links. Ad-hoc networks often consist of nodes, mobile hosts (MH) or mobile stations (MS, also serving as routers) connected by wireless links. Different routing protocols are used for data transmission in between the nodes in an adhoc network. In this paper two protocols (OLSR and AODV) are analyzed on the basis of two parameters i.e. time delay and throughput with different data rates. On the basis of these analysis, we observed that with same data rate, AODV protocol is having more time delay than the OLSR protocol whereas throughput for the OLSR protocol is less compared to the AODV protocol.

Keywords: routing adhoc, mobile hosts, mobile stations, OLSR protocol, AODV protocol

Procedia PDF Downloads 476

Authors: A. M. Almujalli, G. M. Al-Ghamdi

Abstract:

Mycobacterium avium subspecies paratuberculosis causes paratuberculosis, a chronic debilitating granulomatous enteritis, in camels as well as domestic and wild ruminants. The clinical manifestation of the disease in camel is not well characterized, therefore this study was aimed to investigate the clinical and pathological pictures of camels that are suffering from partuberculosis. Twelve young camels that were presented to the Veterinary Teaching Hospital, King Faisal University were investigated. Clinical and pathological examination were performed. The results revealed highly significant increase in creatinine, blood urea nitrogen, magnesium, AST and ALT in diseased camels, while glucose, total protein and albumin were highly significantly decreased in diseased camels when compared to healthy ones. Post-mortem testing indicated thickening, corrugation of the intestinal wall, folded mucosa, enlarged and oedemated ileocaecal and mesenteric lymph nodes. The microscopic findings detected short, blunt and distorted intestinal villi with hyperactive goblet cells of the villi and the crypts of lieberkuhn contained mucin droplets. The lamina propria was heavily infiltrated with mononuclear cells mostly macrophages. This clinical picture of paratuberculosis may be used to initiate control strategy to limit the spread of the disease in camel herds.

Keywords: camel, partuberclosis, control, Saudi Arabia

Procedia PDF Downloads 169

Authors: María Dolores Caro, Eugenio M. Fedriani, Ángel F. Tenorio

Abstract:

The transportation of dangerous goods by lorries throughout Europe must be done by using the roads conforming the European Road Transport Network. In this network, there are several parking areas where lorry drivers can park to rest according to the regulations. According to the "European Agreement concerning the International Carriage of Dangerous Goods by Road", parking areas where lorries transporting dangerous goods can park to rest, must follow several security stipulations to keep safe the rest of road users. At this respect, these lorries must be parked in adapted areas with strict and permanent surveillance measures. Moreover, drivers must satisfy several restrictions about resting and driving time. Under these facts, one may expect that there exist enough parking areas for the transport of this type of goods in order to obey the regulations prescribed by the European Union and its member countries. However, the already-existing parking areas are not sufficient to cover all the stops required by drivers transporting dangerous goods. Our main goal is, starting from the already-existing parking areas and the loading-and-unloading location, to provide an optimal answer to the following question: how many additional parking areas must be built and where must they be located to assure that lorry drivers can transport dangerous goods following all the stipulations about security and safety for their stops? The sense of the word “optimal” is due to the fact that we give a global solution for the location of parking areas throughout the whole European Road Transport Network, adjusting the number of additional areas to be as lower as possible. To do so, we have modeled the problem using graph theory since we are working with a road network. As nodes, we have considered the locations of each already-existing parking area, each loading-and-unloading area each road bifurcation. Each road connecting two nodes is considered as an edge in the graph whose weight corresponds to the distance between both nodes in the edge. By applying a new efficient algorithm, we have found the additional nodes for the network representing the new parking areas adapted for dangerous goods, under the fact that the distance between two parking areas must be less than or equal to 400 km.

Keywords: trans-european transport network, dangerous goods, parking areas, graph-based modeling

Procedia PDF Downloads 256

Authors: Majid Etaati, Hamid Majedi

Abstract:

Relational planning approach proposed by Patsy Healey goes beyond the physical proximity and emphasizes social proximity. This approach stresses the importance of nodes and flows between nodes. Current plans in European cities have incrementally incorporated this approach, but urban plans in Iran have still stayed very detailed and rigid. In response to the weak evaluation results of the comprehensive planning approach in Qazvin, the local authorities applied the City Development Strategy (CDS) to cope with new urban challenges. The paper begins with an explanation of relational planning and suggests that Healey gives urban planners about spatial strategies and then it surveys relational factors in CDS of Qazvin. This study analyzes the extent which CDS of Qazvin have highlighted nodes, flows, and dynamics. In the end, the study concludes that there is a relational understanding of urban dynamics in the plan, but it is weak.

Keywords: relational, dynamics, city development strategy, urban planning, Qazvin

Procedia PDF Downloads 118

Authors: Patricia Abigail B. Miranda, Imelda A. Luna

Abstract:

Introduction: COVID-19 infection is a novel viral illness that began as a local epidemic in December 2019 in Wuhan, China which quickly emerged into a pandemic by February 2020. The virus causes a spectrum of signs and symptoms, ranging from mild upper respiratory symptoms to acute respiratory distress syndrome, which may lead to death. Among children and neonates, those afflicted with the disease may present asymptomatically or with mild symptoms. To date, there has been limited local data that describes the outcomes of the growing number of COVID-19 cases, specifically in neonates. Methods: A cross-sectional study was conducted to determine the outcomes of neonates born to COVID-19 Positive Mothers from March 2020 until June 2022. The prevalence of COVID-19 among these neonates was also determined. Results: COVID-positive prevalence after 24 hours of life is at 8%, while prevalence after 48 hours among those who still underwent testing was at 13.51%. Moreover, among those COVID-19-negative neonates who had symptoms, they mostly presented with tachypnea (5.7%). The prevalence of complications among COVID-19-negative neonates delivered to COVID-19-positive mothers is 22.7%. Conclusion: Neonates born to COVID-19-positive mothers who yielded positive COVID-19 results are generally asymptomatic. Moreover, there are no associated mortalities among those who yielded positive results.

Keywords: COVID-19, neonates, outcomes, clinical profile

Procedia PDF Downloads 52

Authors: T. S. Bubuche, L. Abubakar, N.D. Ibrahim, A. A. Aliero, H. M. Sama, B. S. Haliru

Abstract:

A two-year study was conducted at the Fadama farm of Usmanu Danfodiyo University Sokoto, Nigeria. Correlations and path coefficients analysis were used to determine the interrelationship and importance of various characters as components of yield in sugarcane during 20011-012 and 2012-013 growing seasons. Fourteen sugarcane hybrids and a local check were evaluated. The experiment was laid out in a randomized complete block design (RCBD) and replicated three times. Significant and positive correlation were recorded between total cane weight/ha and single stalk weight, between single stalk weight and final brix and between stalk girth and stalk length while final brix and number of milliable cane/ha recorded no significant correlation. Traits that had high direct contribution to the final yield were number of stalk/stool, number of milliable cane/ha, single stalk weight and brix content while high indirect positive contributions were observed in growth habit, number of internode per stalk and stalk length..

Keywords: correlation, path analysis, sugarcane, yield components

Procedia PDF Downloads 225

Authors: Angela U. Makolo, Temitayo A. Olagunju

Abstract:

The knowledge of signaling pathways is central to understanding the biological mechanisms of organisms since it has been identified that in eukaryotic organisms, the number of signaling pathways determines the number of ways the organism will react to external stimuli. Signaling pathways are studied using protein interaction networks constructed from protein-protein interaction data obtained using high throughput experimental procedures. However, these high throughput methods are known to produce very high rates of false positive and negative interactions. In order to construct a useful protein interaction network from this noisy data, computational methods are applied to validate the protein-protein interactions. In this study, a computational technique to identify signaling pathways from a protein interaction network constructed using validated protein-protein interaction data was designed. A weighted interaction graph of the Saccharomyces cerevisiae (Baker’s Yeast) organism using the proteins as the nodes and interactions between them as edges was constructed. The weights were obtained using Bayesian probabilistic network to estimate the posterior probability of interaction between two proteins given the gene expression measurement as biological evidence. Only interactions above a threshold were accepted for the network model. A pathway was formalized as a simple path in the interaction network from a starting protein and an ending protein of interest. We were able to identify some pathway segments, one of which is a segment of the pathway that signals the start of the process of meiosis in S. cerevisiae.

Keywords: Bayesian networks, protein interaction networks, Saccharomyces cerevisiae, signalling pathways

Procedia PDF Downloads 512

Authors: Wasfi Al Salamat, Shaker Al-Kharouf

Abstract:

This study aims to examine the determinants of financial stability for 13 commercial banks listed on the Amman stock exchange (ASE) over the period (2007-2016) after controlling for the independent variables: return on equity (ROE), return on assets (ROA), earnings per share (EPS), growth in gross domestic product (GDP), inflation rate and debt ratio to measure the financial stability by three main variables: capital adequacy, non-performing loans and the number of returned checks. The balanced panel data statistical approach has been used for data analysis. Results are estimated by using multiple regression models. The empirical results suggested that there is statistically significant negative effect of inflation rate and debt ratio on the capital adequacy while there is statistically significant positive effect of growth in gross domestic product on capital adequacy. In contrast, there is statistically significant negative effect of return on equity and growth in gross domestic product on the non-performing loans while there is statistically significant positive effect of inflation rate on non-performing loans. Finally, there is statistically significant negative effect of growth in gross domestic product on the number of returned checks while there is statistically significant positive effect of inflation rate on the number of returned checks.

Keywords: capital adequacy, financial stability, non-performing loans, number of returned checks, ASE

Procedia PDF Downloads 191

Authors: Sumanpreet Kaur, Harjit Pal Singh, Vikas Khullar

Abstract:

In Wireless Sensor Network (WSN), the sensor containing motes (nodes) incorporate batteries that can lament at some extent. To upgrade the energy utilization, clustering is one of the prototypical approaches for split sensor motes into a number of clusters where one mote (also called as node) proceeds as a Cluster Head (CH). CH selection is one of the optimization techniques for enlarging stability and network lifespan. Deterministic Stable Election Protocol (DSEP) is an effectual clustering protocol that makes use of three kinds of nodes with dissimilar residual energy for CH election. Fuzzy Logic technology is used to expand energy level of DSEP protocol by using fuzzy inference system. This paper presents protocol DSEP using Fuzzy Logic (DSEP-FL) CH by taking into account four linguistic variables such as energy, concentration, centrality and distance to base station. Simulation results show that our proposed method gives more effective results in term of a lifespan of network and stability as compared to the performance of other clustering protocols.

Keywords: DSEP, fuzzy logic, energy model, WSN

Procedia PDF Downloads 173

Authors: Ruvaitha Banu, Amaladhithyan Krishnamoorthy

Abstract:

IoT networks today solve various consumer problems, from home automation systems to aiding in driving autonomous vehicles with the exploration of multiple devices. For example, in an autonomous vehicle environment, multiple sensors are available on roads to monitor weather and road conditions and interact with each other to aid the vehicle in reaching its destination safely and timely. IoT systems are predominantly dependent on the cloud environment for data storage, and computing needs that result in latency problems. With the advent of Fog networks, some of this storage and computing is pushed to the edge/fog nodes, saving the network bandwidth and reducing the latency proportionally. Managing the data stored in these fog nodes becomes crucial as it might also store sensitive information required for a certain application. Data management in fog nodes is strenuous because Fog networks are dynamic in terms of their availability and hardware capability. It becomes more challenging when the nodes in the network also live a short span, detaching and joining frequently. When an end-user or Fog Node wants to access, read, or write data stored in another Fog Node, then a new protocol becomes necessary to access/manage the data stored in the fog devices as a conventional static way of managing the data doesn’t work in Fog Networks. The proposed solution discusses a protocol that acts by defining sensitivity levels for the data being written and read. Additionally, a distinct data distribution and replication model among the Fog nodes is established to decentralize the access mechanism. In this paper, the proposed model implements stewardship towards the data stored in the Fog node using the application of Reinforcement Learning so that access to the data is determined dynamically based on the requests.

Keywords: IoT, fog networks, data stewardship, dynamic access policy

Procedia PDF Downloads 31

Authors: Shatha A. Yousif, Qasim M. Zamil, Hasan Y. Al Muhi, Jamal A. Al Shammari

Abstract:

Potato (Solanum tuberosum L.) is one of the major vegetable crops that are grown world wide because of its economic importance. This experiment investigated the effect of local sands (River Base, Al-Ekader and Karbala) on number and total weight of mini tubers. Statistical analysis revealed that there were no significant differences among sand cultures in number of stem/plant, chlorophyll index and tubers dry weight. River Base sand had the highest plant height (74.9 cm), leaf number/plant number (39.3), leaf area (84.4 dcm2⁄plant), dry weight/plant (26.31), tubers number/plant (8.5), tubers weight/plant (635.53 gm) and potato tuber yields/trove (28.60 kg), whereas the Karbala sand had lower performance. All the characters had positive and significant correlation with yields except the traits number of stem and tuber dry weight.

Keywords: correlation, potato, sand culture, yield

Procedia PDF Downloads 451

Authors: Chia-Chi Chang, Chuan-Bi Lin, Chia-Min Chan

Abstract:

Most ZigBee sensor networks to date make use of nodes with limited processing, communication, and energy capabilities. Energy consumption is of great importance in wireless sensor applications as their nodes are commonly battery-driven. Once ZigBee nodes are deployed outdoors, limited power may make a sensor network useless before its purpose is complete. At present, there are two strategies for long node and network lifetime. The first strategy is saving energy as much as possible. The energy consumption will be minimized through switching the node from active mode to sleep mode and routing protocol with ultra-low energy consumption. The second strategy is to evaluate the energy consumption of sensor applications as accurately as possible. Erroneous energy model may render a ZigBee sensor network useless before changing batteries. In this paper, we present a ZigBee wireless sensor node with four key modules: a processing and radio unit, an energy harvesting unit, an energy storage unit, and a sensor unit. The processing unit uses CC2530 for controlling the sensor, carrying out routing protocol, and performing wireless communication with other nodes. The harvesting unit uses a 2W solar panel to provide lasting energy for the node. The storage unit consists of a rechargeable 1200 mAh Li-ion battery and a battery charger using a constant-current/constant-voltage algorithm. Our solution to extend node lifetime is implemented. Finally, a long-term sensor network test is used to exhibit the functionality of the solar powered system.

Keywords: ZigBee, Li-ion battery, solar panel, CC2530

Procedia PDF Downloads 349

Authors: Wenjun Hou, Marek Perkowski

Abstract:

The Traveling Salesman problem is famous in computing and graph theory. In short, it asks for the Hamiltonian cycle of the least total weight in a given graph with N nodes. All variations on this problem, such as those with K-bounded-degree nodes, are classified as NP-complete in classical computing. Although several papers propose theoretical high-level designs of quantum algorithms for the Traveling Salesman Problem, no quantum circuit implementation of these algorithms has been created up to our best knowledge. In contrast to previous papers, the goal of this paper is not to optimize some abstract complexity measures based on the number of oracle iterations, but to be able to evaluate the real circuit and time costs of the quantum computer. Using the emerging quantum programming language Q# developed by Microsoft, which runs quantum circuits in a quantum computer simulation, an implementation of the bounded-degree problem and its respective quantum circuit were created. To apply Grover’s algorithm to this problem, a quantum oracle was designed, evaluating the cost of a particular set of edges in the graph as well as its validity as a Hamiltonian cycle. Repeating the Grover algorithm with an oracle that finds successively lower cost each time allows to transform the decision problem to an optimization problem, finding the minimum cost of Hamiltonian cycles. N log₂ K qubits are put into an equiprobablistic superposition by applying the Hadamard gate on each qubit. Within these N log₂ K qubits, the method uses an encoding in which every node is mapped to a set of its encoded edges. The oracle consists of several blocks of circuits: a custom-written edge weight adder, node index calculator, uniqueness checker, and comparator, which were all created using only quantum Toffoli gates, including its special forms, which are Feynman and Pauli X. The oracle begins by using the edge encodings specified by the qubits to calculate each node that this path visits and adding up the edge weights along the way. Next, the oracle uses the calculated nodes from the previous step and check that all the nodes are unique. Finally, the oracle checks that the calculated cost is less than the previously-calculated cost. By performing the oracle an optimal number of times, a correct answer can be generated with very high probability. The oracle of the Grover Algorithm is modified using the recalculated minimum cost value, and this procedure is repeated until the cost cannot be further reduced. This algorithm and circuit design have been verified, using several datasets, to generate correct outputs.

Keywords: quantum computing, quantum circuit optimization, quantum algorithms, hybrid quantum algorithms, quantum programming, Grover’s algorithm, traveling salesman problem, bounded-degree TSP, minimal cost, Q# language

Procedia PDF Downloads 153

Authors: Hee Soo Kim, Ha Young Kyung

Abstract:

This paper examines the role of positive emotions in human psychology. By understanding Fredrickson and Lyubomirsky et al.’s on positive emotions, one can better understand people’s intuitive understanding, mental health and well-being. Fredrickson asserts that positive emotions create positive affects and personal resources, and Lyubomirsky et al. relate such positive resources to the creation of happiness and personal development. This paper finds that positive emotions play a significant role in the learning process, and they are instrumental in creating a long-lasting repertoire of personal resources and play an essential role in the development of the intuitive understanding of life variables, resilience in coping with life challenges, and ability to build more successful lives.

Keywords: Positive emotions, positive affects, personal resources, negative emotions, development

Procedia PDF Downloads 275

Authors: Sena Park

Abstract:

Background: The concurrent presentation with colorectal cancer in the inguinal hernia has been extremely rare. Due to its rarity, its presentation may lead to diagnostic and therapeutic dilemmas. We aim to review all the reported cases on colorectal cancer incarcerated in the inguinal hernia in the last 20 years, and discuss the operative approaches. Methods: We identified all case reports on colorectal cancer within inguinal hernia using PUBMED (2002-2022) and MEDLINE (2002-2022). The search strategy included the following keywords: colorectal cancer (title/abstract) AND inguinal hernia (title/abstract) OR incarceration (title/abstract). The search did not include letters, book chapters, systemic reviews, meta-analysis and editorials. Results: In the last 20 years, a total of 19 cases on colorectal cancer within the inguinal hernia were identified. The age of the patients ranged between 48 and 89. Majority of the patients were male (95%). Most commonly involved part of the large intestine was sigmoid colon (79%). Of all the cases, 79 percent of patients received open procedure and 21 percent had laparoscopic procedure. Discussion: Inguinal hernias are common with an incidence of approximately 1.7 percent. Colorectal cancer is the one of the leading causes of cancer-related mortality worldwide. However, their concurrent presentation has been extremely rare. In the last 20 years, 19 cases on concurrent presentation of colorectal cancer and inguinal hernia have been reported. Most patients who had open procedures had two incisions of groin incision and a midline laparotomy. There were 4 cases where the oncological resection was performed laparoscopically. The advantages of laparoscopic resection include reduced blood lost, reduced post-operative pain, reduced length of hospital stay and similar number of lymph nodes taken. From the review of the cases in the last 20 years, both open and laparoscopic approaches seemed to be safe and achieve adequate oncological resections. Conclusion: This is a brief overview of reported cases of colorectal cancer presenting with inguinal hernia concurrently. Due to its rarity, there are no current guidelines on operative approach in clinical practice. The experience in the last 20 years supports both open and laparoscopic approach.

Keywords: colorectal cancer, inguinal hernia, incarceration, operative approach

Procedia PDF Downloads 76

Authors: Surinder Singh, Meenakshi

Abstract:

In this paper MZI-FBG based optical add drop multiplexer is designed and its performance is analyzed in the ring network. In the ring network nodes are composed of optical add drop multiplexer, transmitter and receiver. OADM is used to add or drop any frequency at intermediate nodes without affecting other channels. In this paper the performance of the ring network is carried out by varying various kinds of fiber with or without amplifiers.

Keywords: OADM, ring network, MZI-FBG, transmitter

Procedia PDF Downloads 545

Authors: Beth Taylor, Kojima Mituaki, Atsushi Senda, Koji Morishita, Yasuhiro Otomo

Abstract:

Intestinal ischaemia-reperfusion injury drives systemic inflammation and organ failure following trauma/haemorrhagic shock (T/HS), through the release of pro-inflammatory mediators into the mesenteric lymph (ML). However, changes in the biological function of ML are not fully understood, and therefore, a specific model of intestinal ischaemia-reperfusion injury is required to obtain ML for the study of its biological function upon inflammatory cells. ML obtained from a model of intestinal ischaemia-reperfusion injury was used to assess biological function upon inflammatory cells and investigate changes in the biological function of individual ML components. An additional model was used to determine the effect of vagal nerve stimulation (VNS) upon biological function. Rat ML was obtained by mesenteric lymphatic duct cannulation before and after occlusion of the superior mesenteric artery (SMAO). ML was incubated with human polymorphonuclear neutrophils (PMNs), monocytes and lymphocytes, and the biological function of these cells was assessed. ML was then separated into supernatant, exosome and micro-vesicle components, and biological activity was compared in monocytes. A model with an additional VNS phase was developed, in which the right cervical vagal nerve was exposed and stimulated, and ML collected for comparison of biological function with the conventional model. The biological function of ML was altered by intestinal ischaemia-reperfusion injury, increasing PMN activation, monocyte activation, and lymphocyte apoptosis. Increased monocyte activation was only induced by the exosome component of ML, with no significant changes induced by the supernatant or micro-vesicle components. VNS partially attenuated monocyte activation, but no attenuation of PMN activation was observed. Intestinal ischaemia-reperfusion injury induces changes in the biological function of ML upon both innate and adaptive inflammatory cells, supporting the role of intestinal ischaemia-reperfusion injury in driving systemic inflammation following T/HS. The exosome component of ML appears to be critical to the transport of pro-inflammatory mediators in ML. VNS partially attenuates changes in innate inflammatory cell biological activity observed, presenting possibilities for future novel treatment development in multiple organ failure patients.

Keywords: exosomes, inflammation, intestinal ischaemia, mesenteric lymph, vagal stimulation

Procedia PDF Downloads 106

Authors: Masood Ahmad, Ataul Aziz Ikram, Ishtiaq Wahid

Abstract:

Wireless sensor network (WSN) is the interconnection of mobile wireless nodes with limited energy and memory. These networks can be deployed formany critical applications like military operations, rescue management, fire detection and so on. In flat routing structure, every node plays an equal role of sensor and router. The topology may change very frequently due to the mobile nature of nodes in WSNs. The topology maintenance may produce more overhead messages. To avoid topology maintenance overhead messages, an optimized cluster based mobile wireless sensor network using memetic algorithm is proposed in this paper. The nodes in this network are first divided into clusters. The cluster leaders then transmit data to that base station. The network is validated through extensive simulation study. The results show that the proposed technique has superior results compared to existing techniques.

Keywords: WSN, routing, cluster based, meme, memetic algorithm

Procedia PDF Downloads 449

Authors: Ji Eun Shin, Byung Ho Jung, Dong Hoon Lim

Abstract:

It is almost impossible to store or analyze big data increasing exponentially with traditional technologies. Hadoop is a new technology to make that possible. R programming language is by far the most popular statistical tool for big data analysis based on distributed processing with Hadoop technology. With RHadoop that integrates R and Hadoop environment, we implemented parallel multiple regression analysis with different sizes of actual data. Experimental results showed our RHadoop system was much faster as the number of data nodes increases. We also compared the performance of our RHadoop with lm function and big lm packages available on big memory. The results showed that our RHadoop was faster than other packages owing to paralleling processing with increasing the number of map tasks as the size of data increases.

Keywords: big data, Hadoop, parallel regression analysis, R, RHadoop

Procedia PDF Downloads 411

Authors: Kumar Divyendra

Abstract:

Underwater Sensor Networks (UWSNs) have wide applications in areas such as water quality monitoring, marine wildlife management etc. A typical UWSN system consists of a set of sensors deployed randomly underwater which communicate with each other using acoustic links. RF communication doesn't work underwater, and GPS too isn't available underwater. Additionally Automated Underwater Vehicles (AUVs) are deployed to collect data from some special nodes called Cluster Heads (CHs). These CHs aggregate data from their neighboring nodes and forward them to the AUVs using optical links when an AUV is in range. This helps reduce the number of hops covered by data packets and helps conserve energy. We consider the three-dimensional model of the UWSN. Nodes are initially deployed randomly underwater. They attach themselves to the surface using a rod and can only move upwards or downwards using a pump and bladder mechanism. We use graph theory concepts to maximize the coverage volume while every node maintaining connectivity with at least one surface node. We treat the surface nodes as landmarks and each node finds out its hop distance from every surface node. We treat these hop-distances as coordinates and use them for AUV navigation. An AUV intending to move closer to a node with given coordinates moves hop by hop through nodes that are closest to it in terms of these coordinates. In absence of GPS, multiple different approaches like Inertial Navigation System (INS), Doppler Velocity Log (DVL), computer vision-based navigation, etc., have been proposed. These systems have their own drawbacks. INS accumulates error with time, vision techniques require prior information about the environment. We propose a method that makes use of the earth's magnetic field values for navigation and combines it with other methods that simultaneously increase the coverage volume under the UWSN. The AUVs are fitted with magnetometers that measure the magnetic intensity (I), horizontal inclination (H), and Declination (D). The International Geomagnetic Reference Field (IGRF) is a mathematical model of the earth's magnetic field, which provides the field values for the geographical coordinateson earth. Researchers have developed an inverse deep learning model that takes the magnetic field values and predicts the location coordinates. We make use of this model within our work. We combine this with with the hop-by-hop movement described earlier so that the AUVs move in such a sequence that the deep learning predictor gets trained as quickly and precisely as possible We run simulations in MATLAB to prove the effectiveness of our model with respect to other methods described in the literature.

Keywords: clustering, deep learning, network backbone, parallel computing

Procedia PDF Downloads 66

Authors: Meng-Jou Chien, Jheng-Cheng Chen, Chang-Hsiung Tsai

Abstract:

Let maxζG(m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. The n-dimensional augmented cube, denoted as AQn, a variation of the hypercube, possesses some properties superior to those of the hypercube. We study the cases when G is the augmented cube AQn.

Keywords: interconnection network, augmented cube, induced subgraph, bisection width

Procedia PDF Downloads 371

Authors: Qiuxiao Chen, Yan Hou, Ning Wu

Abstract:

As there are deficiencies of the classic Douglas-Peucker Algorithm (DPA), such as high risks of deleting key nodes by mistake, high complexity, time consumption and relatively slow execution speed, a new Deletion-Cost Based Compression Algorithm (DCA) for linear vector data was proposed. For each curve — the basic element of linear vector data, all the deletion costs of its middle nodes were calculated, and the minimum deletion cost was compared with the pre-defined threshold. If the former was greater than or equal to the latter, all remaining nodes were reserved and the curve’s compression process was finished. Otherwise, the node with the minimal deletion cost was deleted, its two neighbors' deletion costs were updated, and the same loop on the compressed curve was repeated till the termination. By several comparative experiments using different types of linear vector data, the comparison between DPA and DCA was performed from the aspects of compression quality and computing efficiency. Experiment results showed that DCA outperformed DPA in compression accuracy and execution efficiency as well.

Keywords: Douglas-Peucker algorithm, linear vector data, compression, deletion cost

Procedia PDF Downloads 215

Authors: R. M. López-Gutiérrez, L. Cardoza-Avendaño, H. Cervantes-de Ávila, J. A. Michel-Macarty, C. Cruz-Hernández, A. Arellano-Delgado, R. Carmona-Rodríguez

Abstract:

In this paper, synchronization of multiple chaotic semiconductor lasers is achieved by appealing to complex system theory. In particular, we consider dynamical networks composed by semiconductor laser, as interconnected nodes, where the interaction in the networks are defined by coupling the first state of each node. An interesting case is synchronized with master-slave configuration in star topology. Nodes of these networks are modeled for the laser and simulated by Matlab. These results are applicable to private communication.

Keywords: chaotic laser, network, star topology, synchronization

Procedia PDF Downloads 536

Authors: C. N. Vanitha, M. Usha

Abstract:

In a real world scenario, the viability of the sensor networks has been proved by standardizing the technologies. Wireless sensor networks are vulnerable to both electronic and physical security breaches because of their deployment in remote, distributed, and inaccessible locations. The compromised sensor nodes send malicious data to the base station, and thus, the total network effectiveness will possibly be compromised. To detect and seclude the Route modifiers, a neural network based Pattern Learning predictor (PLP) is presented. This algorithm senses data at any node on present and previous patterns obtained from the en-route nodes. The eminence of any node is upgraded by their predicted and reported patterns. This paper propounds a solution not only to detect the route modifiers, but also to seclude the malevolent nodes from the network. The simulation result proves the effective performance of the network by the presented methodology in terms of energy level, routing and various network conditions.

Keywords: neural networks, pattern learning, security, wireless sensor networks

Procedia PDF Downloads 381

Authors: Alaa Eddien Abdallah, Bajes Yousef Alskarnah

Abstract:

Ant colony based routing algorithms are known to grantee the packet delivery, but they suffer from the huge overhead of control messages which are needed to discover the route. In this paper we utilize the network nodes positions to group the nodes in connected clusters. We use clusters-heads only on forwarding the route discovery control messages. Our simulations proved that the new algorithm has decreased the overhead dramatically without affecting the delivery rate.

Keywords: ad-hoc network, MANET, ant colony routing, position based routing

Procedia PDF Downloads 397

Authors: Luiz G. Véras, Felipe L. Medeiros, Lamartine F. Guimarães

Abstract:

This work approaches the automatic planning of paths for Unmanned Aerial Vehicles (UAVs) through the application of the Rapidly Exploring Random Tree Star-Smart (RRT*-Smart) algorithm. RRT*-Smart is a sampling process of positions of a navigation environment through a tree-type graph. The algorithm consists of randomly expanding a tree from an initial position (root node) until one of its branches reaches the final position of the path to be planned. The algorithm ensures the planning of the shortest path, considering the number of iterations tending to infinity. When a new node is inserted into the tree, each neighbor node of the new node is connected to it, if and only if the extension of the path between the root node and that neighbor node, with this new connection, is less than the current extension of the path between those two nodes. RRT*-smart uses an intelligent sampling strategy to plan less extensive routes by spending a smaller number of iterations. This strategy is based on the creation of samples/nodes near to the convex vertices of the navigation environment obstacles. The planned paths are smoothed through the application of the method called quintic pythagorean hodograph curves. The smoothing process converts a route into a dynamically-viable one based on the kinematic constraints of the vehicle. This smoothing method models the hodograph components of a curve with polynomials that obey the Pythagorean Theorem. Its advantage is that the obtained structure allows computation of the curve length in an exact way, without the need for quadratural techniques for the resolution of integrals.

Keywords: path planning, path smoothing, Pythagorean hodograph curve, RRT*-Smart

Procedia PDF Downloads 148

Authors: Frodouard Minani

Abstract:

Since last decade, wireless sensor networks (WSNs) have been used in many areas like health care, agriculture, defense, military, disaster hit areas and so on. Wireless Sensor Networks consist of a Base Station (BS) and more number of wireless sensors in order to monitor temperature, pressure, motion in different environment conditions. The key parameter that plays a major role in designing a protocol for Wireless Sensor Networks is energy efficiency which is a scarcest resource of sensor nodes and it determines the lifetime of sensor nodes. Maximizing sensor node’s lifetime is an important issue in the design of applications and protocols for Wireless Sensor Networks. Clustering sensor nodes mechanism is an effective topology control approach for helping to achieve the goal of this research. In this paper, the researcher presents an energy efficiency protocol to prolong the network lifetime based on Energy efficient clustering algorithm. The Low Energy Adaptive Clustering Hierarchy (LEACH) is a routing protocol for clusters which is used to lower the energy consumption and also to improve the lifetime of the Wireless Sensor Networks. Maximizing energy dissipation and network lifetime are important matters in the design of applications and protocols for wireless sensor networks. Proposed system is to maximize the lifetime of the Wireless Sensor Networks by choosing the farthest cluster head (CH) instead of the closest CH and forming the cluster by considering the following parameter metrics such as Node’s density, residual-energy and distance between clusters (inter-cluster distance). In this paper, comparisons between the proposed protocol and comparative protocols in different scenarios have been done and the simulation results showed that the proposed protocol performs well over other comparative protocols in various scenarios.

Keywords: base station, clustering algorithm, energy efficient, sensors, wireless sensor networks

Procedia PDF Downloads 111

Authors: Dae Il Kim, Jungho Moon, Tae Yun Chung

Abstract:

This paper presents a car parking monitoring system using a wireless sensor network. The presented sensor network has a line-shaped topology and adopts a TDMA-based protocol for allowing multi-hop communications. Sensor nodes are deployed in the ground of an outdoor parking lot in such a way that a sensor node monitors a parking space. Each sensor node detects the availability of the associated parking space and transmits the detection result to a sink node via intermediate sensor nodes existing between the source sensor node and the sink node. We evaluate the feasibility of the presented sensor network and the TDMA-based communication protocol through experiments using 11 sensor nodes deployed in a real parking lot. The result shows that the presented car parking monitoring system is robust to changes in the communication environments and efficient for monitoring parking spaces of outdoor parking lots.

Keywords: multi-hop communication, parking monitoring system, TDMA, wireless sensor network

Procedia PDF Downloads 281