Altered network topology in pediatric traumatic brain injury

NASA Astrophysics Data System (ADS)

Dennis, Emily L.; Rashid, Faisal; Babikian, Talin; Mink, Richard; Babbitt, Christopher; Johnson, Jeffrey; Giza, Christopher C.; Asarnow, Robert F.; Thompson, Paul M.

2017-11-01

Outcome after a traumatic brain injury (TBI) is quite variable, and this variability is not solely accounted for by severity or demographics. Identifying sub-groups of patients who recover faster or more fully will help researchers and clinicians understand sources of this variability, and hopefully lead to new therapies for patients with a more prolonged recovery profile. We have previously identified two subgroups within the pediatric TBI patient population with different recovery profiles based on an ERP-derived (event-related potential) measure of interhemispheric transfer time (IHTT). Here we examine structural network topology across both patient groups and healthy controls, focusing on the `rich-club' - the core of the network, marked by high degree nodes. These analyses were done at two points post-injury - 2-5 months (post-acute), and 13-19 months (chronic). In the post-acute time-point, we found that the TBI-slow group, those showing longitudinal degeneration, showed hyperconnectivity within the rich-club nodes relative to the healthy controls, at the expense of local connectivity. There were minimal differences between the healthy controls and the TBI-normal group (those patients who show signs of recovery). At the chronic phase, these disruptions were no longer significant, but closer analysis showed that this was likely due to the loss of power from a smaller sample size at the chronic time-point, rather than a sign of recovery. We have previously shown disruptions to white matter (WM) integrity that persist and progress over time in the TBI-slow group, and here we again find differences in the TBI-slow group that fail to resolve over the first year post-injury.

[Ambulatory surgical treatment for breast carcinoma].

PubMed

Barillari, P; Leuzzi, R; Bassiri-Gharb, A; D'Angelo, F; Aurello, P; Naticchioni, E

2001-02-01

The aim of the study is to demonstrate the feasibility and the oncologic effectiveness of quadrantectomy plus sentinel node biopsy performed under local anesthesia, and to demonstrate the economic and psychologic advantages. From October 1996 to March 2000, 71 patients affected with clinical T1 N0 breast cancer, underwent quadrantectomy or tumor resection plus sentinel node biopsy and clinically suspicion axillary nodes biopsy, under local anesthesia at the Casa di Cura "Villa Mafalda" in Rome. Twenty tumors were T1a, 26 T1b e 25 T1c. A mean of 2 sentinel nodes (range 1-4) and a mean of 8 axillary nodes were removed during the procedure. In 2 cases sentinel nodes were not identified. Intraoperative histologic examination showed metastatic sentinel nodes in 11 cases. An axillary node dissection was performed in all cases (>12 nodes) and no other metastatic nodes were found. In all patients clinically suspected nodes were removed. In two cases no evidence of metastasis was found in sentinel nodes, while histologic examination revealed in a patient micrometastasis in one node, and in another patient two metastatic nodes. Fifty-three patients rated the overall surgical, anesthetic and recovery experience as "very satisfactory", 13 "satisfactory" and 5 "unsatisfactory". Patients typically expressed their pleasure at the possibility to return home and stressed the ease of recovery.

Trust recovery model of Ad Hoc network based on identity authentication scheme

NASA Astrophysics Data System (ADS)

Liu, Jie; Huan, Shuiyuan

2017-05-01

Mobile Ad Hoc network trust model is widely used to solve mobile Ad Hoc network security issues. Aiming at the problem of reducing the network availability caused by the processing of malicious nodes and selfish nodes in mobile Ad Hoc network routing based on trust model, an authentication mechanism based on identity authentication mobile Ad Hoc network is proposed, which uses identity authentication to identify malicious nodes, And trust the recovery of selfish nodes in order to achieve the purpose of reducing network congestion and improving network quality. The simulation results show that the implementation of the mechanism can effectively improve the network availability and security.

[Atypical sinus node dysfunction. Usefulness of implantable Holter. A case report].

PubMed

Martí Almor, J; Delclòs Urgell, J; Bruguera Cortada, J

2001-12-01

We present an 84 year-old female patient with repeated syncopes/presyncopes in the last nine years. All diagnosis tests were negative, including ECG, 24-hour Holter, tilt table test and EP study. Therefore, a subcutaneous insertable loop recorder was implanted (Reveal). The recording of three episodes showed the association of presyncope with the onset of atrial fibrilation and, in two syncopes, with an atrial pause between AF episodes. Probably an abnormal prolonged sinus node recovery time (more than 6 s) allowed AF to restart before the sinus rhythm.

Microfluidic ultrasonic particle separators with engineered node locations and geometries

DOEpatents

Rose, Klint A.; Fisher, Karl A.; Wajda, Douglas A.; Mariella, Jr., Raymond P.; Bailey, Christopher; Dehlinger, Dietrich; Shusteff, Maxim; Jung, Byoungsok; Ness, Kevin D.

2016-04-26

An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic transducer produces an ultrasound standing wave, that generates a pressure field having at least one node of minimum pressure amplitude. An acoustic extension structure is located proximate to said separation channel for positioning said acoustic node off center in said acoustic area and concentrating the large particles in said recovery fluid stream.

Microfluidic ultrasonic particle separators with engineered node locations and geometries

DOEpatents

Rose, Klint A; Fisher, Karl A; Wajda, Douglas A; Mariella, Jr., Raymond P; Bailey, Christopher; Dehlinger, Dietrich; Shusteff, Maxim; Jung, Byoungsok; Ness, Kevin D

2015-03-31

An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic transducer produces an ultrasound standing wave, that generates a pressure field having at least one node of minimum, pressure amplitude. An acoustic extension structure is located proximate to said separation channel for positioning said acoustic node off center in said acoustic area and concentrating the large particles in said recovery fluid stream.

Microfluidic ultrasonic particle separators with engineered node locations and geometries

DOEpatents

Rose, Klint A; Fisher, Karl A; Wajda, Douglas A; Mariella, Jr., Raymond P; Bailey, Christoppher; Dehlinger, Dietrich; Shusteff, Maxim; Jung, Byoungsok; Ness, Kevin D

2014-05-20

An ultrasonic microfluidic system includes a separation channel for conveying a sample fluid containing small particles and large particles, flowing substantially parallel, adjacent to a recovery fluid, with which it is in contact. An acoustic transducer produces an ultrasound standing wave, that generates a pressure field having at least one node of minimum pressure amplitude. An acoustic extension structure is located proximate to said separation channel for positioning said acoustic node off center in said acoustic area and concentrating the large particles in said recovery fluid stream.

A Tree Based Broadcast Scheme for (m, k)-firm Real-Time Stream in Wireless Sensor Networks.

PubMed

Park, HoSung; Kim, Beom-Su; Kim, Kyong Hoon; Shah, Babar; Kim, Ki-Il

2017-11-09

Recently, various unicast routing protocols have been proposed to deliver measured data from the sensor node to the sink node within the predetermined deadline in wireless sensor networks. In parallel with their approaches, some applications demand the specific service, which is based on broadcast to all nodes within the deadline, the feasible real-time traffic model and improvements in energy efficiency. However, current protocols based on either flooding or one-to-one unicast cannot meet the above requirements entirely. Moreover, as far as the authors know, there is no study for the real-time broadcast protocol to support the application-specific traffic model in WSN yet. Based on the above analysis, in this paper, we propose a new ( m , k )-firm-based Real-time Broadcast Protocol (FRBP) by constructing a broadcast tree to satisfy the ( m , k )-firm, which is applicable to the real-time model in resource-constrained WSNs. The broadcast tree in FRBP is constructed by the distance-based priority scheme, whereas energy efficiency is improved by selecting as few as nodes on a tree possible. To overcome the unstable network environment, the recovery scheme invokes rapid partial tree reconstruction in order to designate another node as the parent on a tree according to the measured ( m , k )-firm real-time condition and local states monitoring. Finally, simulation results are given to demonstrate the superiority of FRBP compared to the existing schemes in terms of average deadline missing ratio, average throughput and energy consumption.

A Novel Loss Recovery and Tracking Scheme for Maneuvering Target in Hybrid WSNs.

PubMed

Qian, Hanwang; Fu, Pengcheng; Li, Baoqing; Liu, Jianpo; Yuan, Xiaobing

2018-01-25

Tracking a mobile target, which aims to timely monitor the invasion of specific target, is one of the most prominent applications in wireless sensor networks (WSNs). Traditional tracking methods in WSNs only based on static sensor nodes (SNs) have several critical problems. For example, to void the loss of mobile target, many SNs must be active to track the target in all possible directions, resulting in excessive energy consumption. Additionally, when entering coverage holes in the monitoring area, the mobile target may be missing and then its state is unknown during this period. To tackle these problems, in this paper, a few mobile sensor nodes (MNs) are introduced to cooperate with SNs to form a hybrid WSN due to their stronger abilities and less constrained energy. Then, we propose a valid target tracking scheme for hybrid WSNs to dynamically schedule the MNs and SNs. Moreover, a novel loss recovery mechanism is proposed to find the lost target and recover the tracking with fewer SNs awakened. Furthermore, to improve the robustness and accuracy of the recovery mechanism, an adaptive unscented Kalman filter (AUKF) algorithm is raised to dynamically adjust the process noise covariance. Simulation results demonstrate that our tracking scheme for maneuvering target in hybrid WSNs can not only track the target effectively even if the target is lost but also maintain an excellent accuracy and robustness with fewer activated nodes.

A Novel Loss Recovery and Tracking Scheme for Maneuvering Target in Hybrid WSNs

PubMed Central

Liu, Jianpo; Yuan, Xiaobing

2018-01-01

Tracking a mobile target, which aims to timely monitor the invasion of specific target, is one of the most prominent applications in wireless sensor networks (WSNs). Traditional tracking methods in WSNs only based on static sensor nodes (SNs) have several critical problems. For example, to void the loss of mobile target, many SNs must be active to track the target in all possible directions, resulting in excessive energy consumption. Additionally, when entering coverage holes in the monitoring area, the mobile target may be missing and then its state is unknown during this period. To tackle these problems, in this paper, a few mobile sensor nodes (MNs) are introduced to cooperate with SNs to form a hybrid WSN due to their stronger abilities and less constrained energy. Then, we propose a valid target tracking scheme for hybrid WSNs to dynamically schedule the MNs and SNs. Moreover, a novel loss recovery mechanism is proposed to find the lost target and recover the tracking with fewer SNs awakened. Furthermore, to improve the robustness and accuracy of the recovery mechanism, an adaptive unscented Kalman filter (AUKF) algorithm is raised to dynamically adjust the process noise covariance. Simulation results demonstrate that our tracking scheme for maneuvering target in hybrid WSNs can not only track the target effectively even if the target is lost but also maintain an excellent accuracy and robustness with fewer activated nodes. PMID:29370103

Characterizing cellular mechanical phenotypes with mechano-node-pore sensing

PubMed Central

Kim, Junghyun; Han, Sewoon; Lei, Andy; Miyano, Masaru; Bloom, Jessica; Srivastava, Vasudha; Stampfer, Martha M.; Gartner, Zev J.; LaBarge, Mark A.; Sohn, Lydia L.

2018-01-01

The mechanical properties of cells change with their differentiation, chronological age, and malignant progression. Consequently, these properties may be useful label-free biomarkers of various functional or clinically relevant cell states. Here, we demonstrate mechano-node-pore sensing (mechano-NPS), a multi-parametric single-cell-analysis method that utilizes a four-terminal measurement of the current across a microfluidic channel to quantify simultaneously cell diameter, resistance to compressive deformation, transverse deformation under constant strain, and recovery time after deformation. We define a new parameter, the whole-cell deformability index (wCDI), which provides a quantitative mechanical metric of the resistance to compressive deformation that can be used to discriminate among different cell types. The wCDI and the transverse deformation under constant strain show malignant MCF-7 and A549 cell lines are mechanically distinct from non-malignant, MCF-10A and BEAS-2B cell lines, and distinguishes between cells treated or untreated with cytoskeleton-perturbing small molecules. We categorize cell recovery time, ΔTr, as instantaneous (ΔTr ~ 0 ms), transient (ΔTr ≤ 40ms), or prolonged (ΔTr > 40ms), and show that the composition of recovery types, which is a consequence of changes in cytoskeletal organization, correlates with cellular transformation. Through the wCDI and cell-recovery time, mechano-NPS discriminates between sub-lineages of normal primary human mammary epithelial cells with accuracy comparable to flow cytometry, but without antibody labeling. Mechano-NPS identifies mechanical phenotypes that distinguishes lineage, chronological age, and stage of malignant progression in human epithelial cells. PMID:29780657

International Space Station Environmental Control and Life Support System Acceptance Testing for Node 1 Temperature and Humidity Control Subsystem

NASA Technical Reports Server (NTRS)

Williams, David E.

2011-01-01

The International Space Station (ISS) Node 1 Environmental Control and Life Support (ECLS) System is comprised of five subsystems: Atmosphere Control and Storage (ACS), Atmosphere Revitalization (AR), Fire Detection and Suppression (FDS), Temperature and Humidity Control (THC), and Water Recovery and Management (WRM). This paper will provide a summary of the Node 1 ECLS THC subsystem design and a detailed discussion of the ISS ECLS Acceptance Testing methodology utilized for this subsystem.The International Space Station (ISS) Node 1 Environmental Control and Life Support (ECLS) System is comprised of five subsystems: Atmosphere Control and Storage (ACS), Atmosphere Revitalization (AR), Fire Detection and Suppression (FDS), Temperature and Humidity Control (THC), and Water Recovery and Management (WRM). This paper will provide a summary of the Node 1 ECLS THC subsystem design and a detailed discussion of the ISS ECLS Acceptance Testing methodology utilized for this subsystem.

A Tree Based Broadcast Scheme for (m, k)-firm Real-Time Stream in Wireless Sensor Networks

PubMed Central

Park, HoSung; Kim, Beom-Su; Kim, Kyong Hoon; Shah, Babar; Kim, Ki-Il

2017-01-01

Recently, various unicast routing protocols have been proposed to deliver measured data from the sensor node to the sink node within the predetermined deadline in wireless sensor networks. In parallel with their approaches, some applications demand the specific service, which is based on broadcast to all nodes within the deadline, the feasible real-time traffic model and improvements in energy efficiency. However, current protocols based on either flooding or one-to-one unicast cannot meet the above requirements entirely. Moreover, as far as the authors know, there is no study for the real-time broadcast protocol to support the application-specific traffic model in WSN yet. Based on the above analysis, in this paper, we propose a new (m, k)-firm-based Real-time Broadcast Protocol (FRBP) by constructing a broadcast tree to satisfy the (m, k)-firm, which is applicable to the real-time model in resource-constrained WSNs. The broadcast tree in FRBP is constructed by the distance-based priority scheme, whereas energy efficiency is improved by selecting as few as nodes on a tree possible. To overcome the unstable network environment, the recovery scheme invokes rapid partial tree reconstruction in order to designate another node as the parent on a tree according to the measured (m, k)-firm real-time condition and local states monitoring. Finally, simulation results are given to demonstrate the superiority of FRBP compared to the existing schemes in terms of average deadline missing ratio, average throughput and energy consumption. PMID:29120404

Sick sinus syndrome in HCN1-deficient mice.

PubMed

Fenske, Stefanie; Krause, Stefanie C; Hassan, Sami I H; Becirovic, Elvir; Auer, Franziska; Bernard, Rebekka; Kupatt, Christian; Lange, Philipp; Ziegler, Tilman; Wotjak, Carsten T; Zhang, Henggui; Hammelmann, Verena; Paparizos, Christos; Biel, Martin; Wahl-Schott, Christian A

2013-12-17

Sinus node dysfunction (SND) is a major clinically relevant disease that is associated with sudden cardiac death and requires surgical implantation of electric pacemaker devices. Frequently, SND occurs in heart failure and hypertension, conditions that lead to electric instability of the heart. Although the pathologies of acquired SND have been studied extensively, little is known about the molecular and cellular mechanisms that cause congenital SND. Here, we show that the HCN1 protein is highly expressed in the sinoatrial node and is colocalized with HCN4, the main sinoatrial pacemaker channel isoform. To characterize the cardiac phenotype of HCN1-deficient mice, a detailed functional characterization of pacemaker mechanisms in single isolated sinoatrial node cells, explanted beating sinoatrial node preparation, telemetric in vivo electrocardiography, echocardiography, and in vivo electrophysiology was performed. On the basis of these experiments we demonstrate that mice lacking the pacemaker channel HCN1 display congenital SND characterized by bradycardia, sinus dysrhythmia, prolonged sinoatrial node recovery time, increased sinoatrial conduction time, and recurrent sinus pauses. As a consequence of SND, HCN1-deficient mice display a severely reduced cardiac output. We propose that HCN1 stabilizes the leading pacemaker region within the sinoatrial node and hence is crucial for stable heart rate and regular beat-to-beat variation. Furthermore, we suggest that HCN1-deficient mice may be a valuable genetic disease model for human SND.

Adaptive Connectivity Restoration from Node Failure(s) in Wireless Sensor Networks

PubMed Central

Wang, Huaiyuan; Ding, Xu; Huang, Cheng; Wu, Xiaobei

2016-01-01

Recently, there is a growing interest in the applications of wireless sensor networks (WSNs). A set of sensor nodes is deployed in order to collectively survey an area of interest and/or perform specific surveillance tasks in some of the applications, such as battlefield reconnaissance. Due to the harsh deployment environments and limited energy supply, nodes may fail, which impacts the connectivity of the whole network. Since a single node failure (cut-vertex) will destroy the connectivity and divide the network into disjoint blocks, most of the existing studies focus on the problem of single node failure. However, the failure of multiple nodes would be a disaster to the whole network and must be repaired effectively. Only few studies are proposed to handle the problem of multiple cut-vertex failures, which is a special case of multiple node failures. Therefore, this paper proposes a comprehensive solution to address the problems of node failure (single and multiple). Collaborative Single Node Failure Restoration algorithm (CSFR) is presented to solve the problem of single node failure only with cooperative communication, but CSFR-M, which is the extension of CSFR, handles the single node failure problem more effectively with node motion. Moreover, Collaborative Connectivity Restoration Algorithm (CCRA) is proposed on the basis of cooperative communication and node maneuverability to restore network connectivity after multiple nodes fail. CSFR-M and CCRA are reactive methods that initiate the connectivity restoration after detecting the node failure(s). In order to further minimize the energy dissipation, CCRA opts to simplify the recovery process by gridding. Moreover, the distance that an individual node needs to travel during recovery is reduced by choosing the nearest suitable candidates. Finally, extensive simulations validate the performance of CSFR, CSFR-M and CCRA. PMID:27690030

Traffic protection in MPLS networks using an off-line flow optimization model

NASA Astrophysics Data System (ADS)

Krzesinski, Anthony E.; Muller, Karen E.

2002-07-01

MPLS-based recovery is intended to effect rapid and complete restoration of traffic affected by a fault in an MPLS network. Two MPLS-based recovery models have been proposed: IP re-routing which establishes recovery paths on demand, and protection switching which works with pre-established recovery paths. IP re-routing is robust and frugal since no resources are pre-committed but is inherently slower than protection switching which is intended to offer high reliability to premium services where fault recovery takes place at the 100 ms time scale. We present a model of protection switching in MPLS networks. A variant of the flow deviation method is used to find and capacitate a set of optimal label switched paths. The traffic is routed over a set of working LSPs. Global repair is implemented by reserving a set of pre-established recovery LSPs. An analytic model is used to evaluate the MPLS-based recovery mechanisms in response to bi-directional link failures. A simulation model is used to evaluate the MPLS recovery cycle in terms of the time needed to restore the traffic after a uni-directional link failure. The models are applied to evaluate the effectiveness of protection switching in networks consisting of between 20 and 100 nodes.

Achieving fast and stable failure detection in WDM Networks

NASA Astrophysics Data System (ADS)

Gao, Donghui; Zhou, Zhiyu; Zhang, Hanyi

2005-02-01

In dynamic networks, the failure detection time takes a major part of the convergence time, which is an important network performance index. To detect a node or link failure in the network, traditional protocols, like Hello protocol in OSPF or RSVP, exchanges keep-alive messages between neighboring nodes to keep track of the link/node state. But by default settings, it can get a minimum detection time in the measure of dozens of seconds, which can not meet the demands of fast network convergence and failure recovery. When configuring the related parameters to reduce the detection time, there will be notable instability problems. In this paper, we analyzed the problem and designed a new failure detection algorithm to reduce the network overhead of detection signaling. Through our experiment we found it is effective to enhance the stability by implicitly acknowledge other signaling messages as keep-alive messages. We conducted our proposal and the previous approaches on the ASON test-bed. The experimental results show that our algorithm gives better performances than previous schemes in about an order magnitude reduction of both false failure alarms and queuing delay to other messages, especially under light traffic load.

Understanding of Materials State and its Degradation using Non-Linear Ultrasound (NLU) Approaches - Phase 3

DTIC Science & Technology

2013-05-31

j] (11) A MATLAB code was written for finding the displacement at each node for all time steps. Material selected for the study was steel with 1 m...some of the dislocations are annihilated or rearranged. Various stages in the recovery are, entanglement of dislocations, cell formation, annihilation...frequency domain using an in-house pro- gram written in MATLAB . A time-domain signal obtained from nonlinear measurement and its corresponding fast

Recovery of Ventriculo-Atrial Conduction after Adrenaline in Patients Implanted with Pacemakers.

PubMed

Cismaru, Gabriel; Gusetu, Gabriel; Muresan, Lucian; Rosu, Radu; Andronache, Marius; Matuz, Roxana; Puiu, Mihai; Mester, Petru; Miclaus, Maria; Pop, Dana; Mircea, Petru Adrian; Zdrenghea, Dumitru

2015-07-01

Ventriculo-atrial (VA) conduction can have negative consequences for patients with implanted pacemakers and defibrillators. There is concern whether impaired VA conduction could recover during stressful situations. Although the influence of isoproterenol and atropine are well established, the effect of adrenaline has not been studied systematically. The objective of this study was to determine if adrenaline can facilitate recovery of VA conduction in patients implanted with pacemakers. A prospective study was conducted on 61 consecutive patients during a 4-month period (April-July 2014). The presence of VA conduction was assessed during the pacemaker implantation procedure. In case of an impaired VA conduction, adrenaline infusio was used as a stress surrogate to test conduction recovery. The indications for pacemaker implantation were: sinus node dysfunction in 18 patients, atrioventricular (AV) block in 40 patients, binodal dysfunction (sinus node+ AV node) in two patients and other (carotid sinus syndrome) in one patient. In the basal state, 15/61 (24.6%) presented spontaneous VA conduction and 46/61 (75.4%) had no VA conduction. After administration of adrenaline, there was VA conduction recovery in 5/46 (10.9%) patients. Adrenaline infusion produced recovery of VA conduction in 10.9% of patients with absent VA conduction in a basal state. Recovery of VA conduction during physiological or pathological stresses could be responsible for the pacemaker syndrome, PMT episodes, or certain implantable cardiac defibrillator detection issues. © 2015 Wiley Periodicals, Inc.

A distributed geo-routing algorithm for wireless sensor networks.

PubMed

Joshi, Gyanendra Prasad; Kim, Sung Won

2009-01-01

Geographic wireless sensor networks use position information for greedy routing. Greedy routing works well in dense networks, whereas in sparse networks it may fail and require a recovery algorithm. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costly for resource constrained position-based wireless sensor networks (WSNs). In this paper, we propose a void avoidance algorithm (VAA), a novel idea based on upgrading virtual distance. VAA allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forwarding packets using only greedy routing. In VAA, the stuck node upgrades distance unless it finds a next hop node that is closer to the destination than it is. VAA guarantees packet delivery if there is a topologically valid path. Further, it is completely distributed, immediately responds to node failure or topology changes and does not require planarization of the network. NS-2 is used to evaluate the performance and correctness of VAA and we compare its performance to other protocols. Simulations show our proposed algorithm consumes less energy, has an efficient path and substantially less control overheads.

Burbank performs in-flight maintenance on the WRS-2 in the Node 3

NASA Image and Video Library

2012-01-28

ISS030-E-051116 (28 Jan. 2012) --- NASA astronaut Dan Burbank, Expedition 30 commander, performs in-flight maintenance on the Water Recovery System 2 (WRS-2) in the Tranquility node of the International Space Station.

Response to phytohaemagglutinin of lymphocytes from mice treated with anti-lymphocyte globulin

PubMed Central

Tursi, A.; Greaves, M. F.; Torrigiani, G.; Playfair, J. H. L.; Roitt, I. M.

1969-01-01

Thymus, spleen, lymph node and peripheral blood lymphocytes taken from mice treated with anti-lymphocyte globulin (ALG) showed a greatly diminished response to PHA in vitro. Recovery of circulating lymphocyte levels preceded recovery of responsiveness to PHA. The latter could be prevented by reinjection of ALG or by thymectomy. Grafts were rejected within a period equal to the normal rejection time after PHA responsiveness had recovered to a value of approximately 20 per cent of the normal. Thus the effect of ALG on thymus dependent lymphocytes in mice can be monitored by assessing the PHA sensitivity of peripheral white blood cells. ImagesFIG. 1 PMID:4900922

Alternative Opportunistic Alert Diffusion to Support Infrastructure Failure during Disasters

PubMed Central

Mezghani, Farouk; Mitton, Nathalie

2017-01-01

Opportunistic communications present a promising solution for disaster network recovery in emergency situations such as hurricanes, earthquakes, and floods, where infrastructure might be destroyed. Some recent works in the literature have proposed opportunistic-based disaster recovery solutions, but they have omitted the consideration of mobile devices that come with different network technologies and various initial energy levels. This work presents COPE, an energy-aware Cooperative OPportunistic alErt diffusion scheme for trapped survivors to use during disaster scenarios to report their position and ease their rescue operation. It aims to maintain mobile devices functional for as long as possible for maximum network coverage until reaching proximate rescuers. COPE deals with mobile devices that come with an assortment of networks and aims to perform systematic network interface selection. Furthermore, it considers mobile devices with various energy levels and allows low-energy nodes to hold their charge for longer time with the support of high-energy nodes. A proof-of-concept implementation has been performed to study the doability and efficiency of COPE, and to highlight the lessons learned. PMID:29039770

International Space Station Temperature and Humidity Control Subsystem Verification for Node 1

NASA Technical Reports Server (NTRS)

Williams, David E.

2007-01-01

The International Space Station (ISS) Node 1 Environmental Control and Life Support (ECLS) System is comprised of five subsystems: Atmosphere Control and Supply (ACS), Atmosphere Revitalization (AR), Fire Detection and Suppression (FDS), Temperature and Humidity Control (THC), and Water Recovery and Management (WRM). This paper provides a summary of the nominal operation of the Node 1 THC subsystem design. The paper will also provide a discussion of the detailed Element Verification methodologies for nominal operation of the Node 1 THC subsystem operations utilized during the Qualification phase.

Discordance in lymphoid tissue recovery following stem cell transplantation in rhesus macaques: an in vivo imaging study.

PubMed

Donahue, Robert E; Srinivasula, Sharat; Uchida, Naoya; Kim, Insook; St Claire, Alexis; Duralde, Gorka; DeGrange, Paula; St Claire, Marisa; Reba, Richard C; Bonifacino, Aylin C; Krouse, Allen E; Metzger, Mark E; Paik, Chang H; Lane, H Clifford; Tisdale, John F; Di Mascio, Michele

2015-12-10

Ionizing irradiation is used routinely to induce myeloablation and immunosuppression. However, it has not been possible to evaluate the extent of ablation without invasive biopsy. For lymphoid recovery, peripheral blood (PB) lymphocytes (PBLs) have been used for analysis, but they represent <2% of cells in lymphoid tissues (LTs). Using a combination of single-photon emission computed tomography imaging and a radiotracer ((99m)Tc-labeled rhesus immunoglobulin G1 anti-CD4R1 (Fab')2), we sequentially imaged CD4(+) cell recovery in rhesus macaques following total body irradiation (TBI) and reinfusion of vector-transduced, autologous CD34(+) cells. Our results present for the first time a sequential, real-time, noninvasive method to evaluate CD4(+) cell recovery. Importantly, despite myeloablation of circulating leukocytes following TBI, total depletion of CD4(+) lymphocytes in LTs such as the spleen is not achieved. The impact of TBI on LTs and PBLs is discordant, in which as few as 32.4% of CD4(+) cells were depleted from the spleen. In addition, despite full lymphocyte recovery in the spleen and PB, lymph nodes have suboptimal recovery. This highlights concerns about residual disease, endogenous contributions to recovery, and residual LT damage following ionizing irradiation. Such methodologies also have direct application to immunosuppressive therapy and other immunosuppressive disorders, such as those associated with viral monitoring.

Discordance in lymphoid tissue recovery following stem cell transplantation in rhesus macaques: an in vivo imaging study

PubMed Central

Srinivasula, Sharat; Uchida, Naoya; Kim, Insook; St. Claire, Alexis; Duralde, Gorka; DeGrange, Paula; St. Claire, Marisa; Reba, Richard C.; Bonifacino, Aylin C.; Krouse, Allen E.; Metzger, Mark E.; Paik, Chang H.; Lane, H. Clifford; Tisdale, John F.; Di Mascio, Michele

2015-01-01

Ionizing irradiation is used routinely to induce myeloablation and immunosuppression. However, it has not been possible to evaluate the extent of ablation without invasive biopsy. For lymphoid recovery, peripheral blood (PB) lymphocytes (PBLs) have been used for analysis, but they represent <2% of cells in lymphoid tissues (LTs). Using a combination of single-photon emission computed tomography imaging and a radiotracer (99mTc-labeled rhesus immunoglobulin G1 anti-CD4R1 (Fab′)2), we sequentially imaged CD4+ cell recovery in rhesus macaques following total body irradiation (TBI) and reinfusion of vector-transduced, autologous CD34+ cells. Our results present for the first time a sequential, real-time, noninvasive method to evaluate CD4+ cell recovery. Importantly, despite myeloablation of circulating leukocytes following TBI, total depletion of CD4+ lymphocytes in LTs such as the spleen is not achieved. The impact of TBI on LTs and PBLs is discordant, in which as few as 32.4% of CD4+ cells were depleted from the spleen. In addition, despite full lymphocyte recovery in the spleen and PB, lymph nodes have suboptimal recovery. This highlights concerns about residual disease, endogenous contributions to recovery, and residual LT damage following ionizing irradiation. Such methodologies also have direct application to immunosuppressive therapy and other immunosuppressive disorders, such as those associated with viral monitoring. PMID:26492933

Lessons Learned from the Node 1 Atmosphere Control and Storage and Water Recovery and Management Subsystem Design

NASA Technical Reports Server (NTRS)

Williams, David E.

2010-01-01

Node 1 flew to the International Space Station (ISS) on Flight 2A during December 1998. To date the National Aeronautics and Space Administration (NASA) has learned a lot of lessons from this module based on its history of approximately two years of acceptance testing on the ground and currently its twelve years on-orbit. This paper will provide an overview of the ISS Environmental Control and Life Support (ECLS) design of the Node 1 Atmosphere Control and Storage (ACS) and Water Recovery and Management (WRM) subsystems and it will document some of the lessons that have been learned to date for these subsystems based on problems prelaunch, problems encountered on-orbit, and operational problems/concerns. It is hoped that documenting these lessons learned from ISS will help in preventing them in future Programs.

Lessons Learned from the Node 1 Atmosphere Control and Storage and Water Recovery and Management Subsystem Design

NASA Technical Reports Server (NTRS)

Williams, David E.

2011-01-01

Node 1 flew to the International Space Station (ISS) on Flight 2A during December 1998. To date the National Aeronautics and Space Administration (NASA) has learned a lot of lessons from this module based on its history of approximately two years of acceptance testing on the ground and currently its twelve years on-orbit. This paper will provide an overview of the ISS Environmental Control and Life Support (ECLS) design of the Node 1 Atmosphere Control and Storage (ACS) and Water Recovery and Management (WRM) subsystems and it will document some of the lessons that have been learned to date for these subsystems based on problems prelaunch, problems encountered on-orbit, and operational problems/concerns. It is hoped that documenting these lessons learned from ISS will help in preventing them in future Programs.

Path Network Recovery Using Remote Sensing Data and Geospatial-Temporal Semantic Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

William C. McLendon III; Brost, Randy C.

Remote sensing systems produce large volumes of high-resolution images that are difficult to search. The GeoGraphy (pronounced Geo-Graph-y) framework [2, 20] encodes remote sensing imagery into a geospatial-temporal semantic graph representation to enable high level semantic searches to be performed. Typically scene objects such as buildings and trees tend to be shaped like blocks with few holes, but other shapes generated from path networks tend to have a large number of holes and can span a large geographic region due to their connectedness. For example, we have a dataset covering the city of Philadelphia in which there is a singlemore » road network node spanning a 6 mile x 8 mile region. Even a simple question such as "find two houses near the same street" might give unexpected results. More generally, nodes arising from networks of paths (roads, sidewalks, trails, etc.) require additional processing to make them useful for searches in GeoGraphy. We have assigned the term Path Network Recovery to this process. Path Network Recovery is a three-step process involving (1) partitioning the network node into segments, (2) repairing broken path segments interrupted by occlusions or sensor noise, and (3) adding path-aware search semantics into GeoQuestions. This report covers the path network recovery process, how it is used, and some example use cases of the current capabilities.« less

Cascading Failures and Recovery in Networks of Networks

NASA Astrophysics Data System (ADS)

Havlin, Shlomo

Network science have been focused on the properties of a single isolated network that does not interact or depends on other networks. In reality, many real-networks, such as power grids, transportation and communication infrastructures interact and depend on other networks. I will present a framework for studying the vulnerability and the recovery of networks of interdependent networks. In interdependent networks, when nodes in one network fail, they cause dependent nodes in other networks to also fail. This is also the case when some nodes like certain locations play a role in two networks -multiplex. This may happen recursively and can lead to a cascade of failures and to a sudden fragmentation of the system. I will present analytical solutions for the critical threshold and the giant component of a network of n interdependent networks. I will show, that the general theory has many novel features that are not present in the classical network theory. When recovery of components is possible global spontaneous recovery of the networks and hysteresis phenomena occur and the theory suggests an optimal repairing strategy of system of systems. I will also show that interdependent networks embedded in space are significantly more vulnerable compared to non embedded networks. In particular, small localized attacks may lead to cascading failures and catastrophic consequences.Thus, analyzing data of real network of networks is highly required to understand the system vulnerability. DTRA, ONR, Israel Science Foundation.

Enhancing the Reliability of Head Nodes in Underwater Sensor Networks

PubMed Central

Min, Hong; Cho, Yookun; Heo, Junyoung

2012-01-01

Underwater environments are quite different from terrestrial environments in terms of the communication media and operating conditions associated with those environments. In underwater sensor networks, the probability of node failure is high because sensor nodes are deployed in harsher environments than ground-based networks. The sensor nodes are surrounded by salt water and moved around by waves and currents. Many studies have focused on underwater communication environments in an effort to improve the data transmission throughput. In this paper, we present a checkpointing scheme for the head nodes to quickly recover from a head node failure. Experimental results show that the proposed scheme enhances the reliability of the networks and makes them more efficient in terms of energy consumption and the recovery latency compared to the previous scheme without checkpointing. PMID:22438707

International Space Station Environmental Control and Life Support System Acceptance Testing for Node 1 Atmosphere Control and Supply Subsystem

NASA Technical Reports Server (NTRS)

Williams, David E.

2009-01-01

The International Space Station (ISS) Node 1 Environmental Control and Life Support (ECLS) System is comprised of five subsystems: Atmosphere Control and Supply (ACS), Atmosphere Revitalization (AR), Fire Detection and Suppression (FDS), Temperature and Humidity Control (THC), and Water Recovery and Management (WRM). This paper provides a summary of the Node 1 ECLS ACS subsystem design and a detailed discussion of the ISS ECLS Acceptance Testing methodology utilized for that subsystem.

Mechanical diagnosis of human erythrocytes by ultra-high speed manipulation unraveled critical time window for global cytoskeletal remodeling

NASA Astrophysics Data System (ADS)

Ito, Hiroaki; Murakami, Ryo; Sakuma, Shinya; Tsai, Chia-Hung Dylan; Gutsmann, Thomas; Brandenburg, Klaus; Pöschl, Johannes M. B.; Arai, Fumihito; Kaneko, Makoto; Tanaka, Motomu

2017-02-01

Large deformability of erythrocytes in microvasculature is a prerequisite to realize smooth circulation. We develop a novel tool for the three-step “Catch-Load-Launch” manipulation of a human erythrocyte based on an ultra-high speed position control by a microfluidic “robotic pump”. Quantification of the erythrocyte shape recovery as a function of loading time uncovered the critical time window for the transition between fast and slow recoveries. The comparison with erythrocytes under depletion of adenosine triphosphate revealed that the cytoskeletal remodeling over a whole cell occurs in 3 orders of magnitude longer timescale than the local dissociation-reassociation of a single spectrin node. Finally, we modeled septic conditions by incubating erythrocytes with endotoxin, and found that the exposure to endotoxin results in a significant delay in the characteristic transition time for cytoskeletal remodeling. The high speed manipulation of erythrocytes with a robotic pump technique allows for high throughput mechanical diagnosis of blood-related diseases.

Automatic Camera Orientation and Structure Recovery with Samantha

NASA Astrophysics Data System (ADS)

Gherardi, R.; Toldo, R.; Garro, V.; Fusiello, A.

2011-09-01

SAMANTHA is a software capable of computing camera orientation and structure recovery from a sparse block of casual images without human intervention. It can process both calibrated images or uncalibrated, in which case an autocalibration routine is run. Pictures are organized into a hierarchical tree which has single images as leaves and partial reconstructions as internal nodes. The method proceeds bottom up until it reaches the root node, corresponding to the final result. This framework is one order of magnitude faster than sequential approaches, inherently parallel, less sensitive to the error accumulation causing drift. We have verified the quality of our reconstructions both qualitatively producing compelling point clouds and quantitatively, comparing them with laser scans serving as ground truth.

Thyroglobulin assay in fluids from lymph node fine needle-aspiration washout: influence of pre-analytical conditions.

PubMed

Casson, Florence Boux de; Moal, Valérie; Gauchez, Anne-Sophie; Moineau, Marie-Pierre; Sault, Corinne; Schlageter, Marie-Hélène; Massart, Catherine

2017-04-01

The aim of this study was to evaluate the pre-analytical factors contributing to uncertainty in thyroglobulin measurement in fluids from fine-needle aspiration (FNA) washout of cervical lymph nodes. We studied pre-analytical stability, in different conditions, of 41 samples prepared with concentrated solutions of thyroglobulin (FNA washout or certified standard) diluted in physiological saline solution or buffer containing 6% albumin. In this buffer, over time, no changes in thyroglobulin concentrations were observed in all storage conditions tested. In albumin free saline solution, thyroglobulin recovery rates depended on initial sample concentrations and on modalities of their conservation (in conventional storage tubes, recovery mean was 56% after 3 hours-storage at room temperature and 19% after 24 hours-storage for concentrations ranged from 2 to 183 μg/L; recovery was 95%, after 3 hours or 24 hours-storage at room temperature, for a concentration of 5,656 μg/L). We show here that these results are due to non-specific adsorption of thyroglobulin in storage tubes, which depends on sample protein concentrations. We also show that possible contamination of fluids from FNA washout by plasma proteins do not always adequately prevent this adsorption. In conclusion, non-specific adsorption in storage tubes strongly contributes to uncertainty in thyroglobulin measurement in physiological saline solution. It is therefore recommended, for FNA washout, to use a buffer containing proteins provided by the laboratory.

Physics of Financial Markets: Can we Understand the Unpredictable Phenomenon of Flash Crashes

NASA Astrophysics Data System (ADS)

Stanley, H. Eugene

2015-03-01

Dangerous vulnerability is hiding in complex systems. Indeed, disasters ranging from abrupt financial ``flash crashes'' and large-scale power outages to sudden death among the elderly dramatically exemplify this fact. While we can understand the cause of most events in complex systems, sudden unexpected ``black swans'' whether in economics or in the ``physicists world'' cry out for insight. To design more resilient systems we will describe recent results seeking understanding of these black swans. In many real-world phenomena, such as brain seizures in neuroscience or sudden market crashes in finance, after an inactive period of time a significant part of the damaged network is capable of spontaneously becoming active again. The process often occurs repeatedly. To model this marked network recovery, we examine the effect of local node recoveries and stochastic contiguous spreading, and find that they can lead to the spontaneous emergence of macroscopic ``phase-flipping'' phenomena. The fraction of active nodes switches back and forth between the two network collective modes characterized by high network activity and low network activity. Furthermore, the system exhibits a strong hysteresis behavior analogous to phase transitions near a critical point [A. Majdandzic, B. Podobnik, S. V. Buldyrev, D. Y. Kenett, S. Havlin, and H. E. Stanley, ``Spontaneous Recovery in Dynamic Networks,'' Nature Physics 10, 34 (2014)]. This work was carried out in collaboration with a number of colleagues, chief among whom are A. Majdanzic, B. Podobnik, S. V. Buldyrev, D. Y. Kenett, and S. Havlin.

Wireless Power Transfer to Millimeter-Sized Nodes Using Airborne Ultrasound.

PubMed

Rekhi, Angad S; Khuri-Yakub, Butrus T; Arbabian, Amin

2017-10-01

We propose the use of airborne ultrasound for wireless power transfer to mm-sized nodes, with intended application in the next generation of the Internet of Things (IoT). We show through simulation that ultrasonic power transfer can deliver 50 [Formula: see text] to a mm-sized node 0.88 m away from a ~ 50-kHz, 25-cm 2 transmitter array, with the peak pressure remaining below recommended limits in air, and with load power increasing with transmitter area. We report wireless power recovery measurements with a precharged capacitive micromachined ultrasonic transducer, demonstrating a load power of 5 [Formula: see text] at a simulated distance of 1.05 m. We present aperture efficiency, dynamic range, and bias-free operation as key metrics for the comparison of transducers meant for wireless power recovery. We also argue that long-range wireless charging at the watt level is extremely challenging with existing technology and regulations. Finally, we compare our acoustic powering system with cutting edge electromagnetically powered nodes and show that ultrasound has many advantages over RF as a vehicle for power delivery. Our work sets the foundation for further research into ultrasonic wireless power transfer for the IoT.

Single site laparoscopic right hemicolectomy: an oncological feasible option

PubMed Central

2010-01-01

Introduction We present the first 7 cases of single site right hemicolectomy in Asia using the new Single Site Laparoscopy (SSL) access system from Ethicon Endo-surgery. Methods Right hemicolectomy was performed using the new Single Site Laparoscopy (SSL) access system. Patient demographics, operative time, histology and post operative recovery and complications were collected and analysed. Results The median operative time was 90 mins (range 60 - 150 mins) and a median wound size of 2.5 cm (range 2 to 4.5 cm). The median number of lymph nodes harvested was 24 (range 20 to 34 lymph nodes). The median length of proximal margin was 70 mm (range 30 to 145 mm) and that of distal margin was 50 mm (35 to 120 mm). All patients had a median hospital stay of 7 days (range 5 to 11) and there were no significant perioperative complications except for 1 patient who had a minor myocardial event. Conclusion Right hemicolectomy using SSL access system is feasible and safe for oncologic surgery. PMID:20825658

A model of partial differential equations for HIV propagation in lymph nodes

NASA Astrophysics Data System (ADS)

Marinho, E. B. S.; Bacelar, F. S.; Andrade, R. F. S.

2012-01-01

A system of partial differential equations is used to model the dissemination of the Human Immunodeficiency Virus (HIV) in CD4+T cells within lymph nodes. Besides diffusion terms, the model also includes a time-delay dependence to describe the time lag required by the immunologic system to provide defenses to new virus strains. The resulting dynamics strongly depends on the properties of the invariant sets of the model, consisting of three fixed points related to the time independent and spatial homogeneous tissue configurations in healthy and infected states. A region in the parameter space is considered, for which the time dependence of the space averaged model variables follows the clinical pattern reported for infected patients: a short scale primary infection, followed by a long latency period of almost complete recovery and third phase characterized by damped oscillations around a value with large HIV counting. Depending on the value of the diffusion coefficient, the latency time increases with respect to that one obtained for the space homogeneous version of the model. It is found that same initial conditions lead to quite different spatial patterns, which depend strongly on the latency interval.

International Space Station Environmental Control and Life Support Emergency Response Verification for Node 1

NASA Technical Reports Server (NTRS)

Williams, David E.

2008-01-01

The International Space Station (ISS) Node 1 Environmental Control and Life Support (ECLS) System is comprised of five subsystems: Atmosphere Control and Supply (ACS), Atmosphere Revitalization (AR), Fire Detection and Suppression (FDS), Temperature and Humidity Control (THC), and Water Recovery and Management (WRM). This paper provides a summary of the Node 1 Emergency Response capability, which includes nominal and off-nominal FDS operation, off nominal ACS operation, and off-nominal THC operation. These subsystems provide the capability to help aid the crew members during an emergency cabin depressurization, a toxic spill, or a fire. The paper will also provide a discussion of the detailed Node 1 ECLS Element Verification methodologies for operation of the Node 1 Emergency Response hardware operations utilized during the Qualification phase.

A smart checkpointing scheme for improving the reliability of clustering routing protocols.

PubMed

Min, Hong; Jung, Jinman; Kim, Bongjae; Cho, Yookun; Heo, Junyoung; Yi, Sangho; Hong, Jiman

2010-01-01

In wireless sensor networks, system architectures and applications are designed to consider both resource constraints and scalability, because such networks are composed of numerous sensor nodes with various sensors and actuators, small memories, low-power microprocessors, radio modules, and batteries. Clustering routing protocols based on data aggregation schemes aimed at minimizing packet numbers have been proposed to meet these requirements. In clustering routing protocols, the cluster head plays an important role. The cluster head collects data from its member nodes and aggregates the collected data. To improve reliability and reduce recovery latency, we propose a checkpointing scheme for the cluster head. In the proposed scheme, backup nodes monitor and checkpoint the current state of the cluster head periodically. We also derive the checkpointing interval that maximizes reliability while using the same amount of energy consumed by clustering routing protocols that operate without checkpointing. Experimental comparisons with existing non-checkpointing schemes show that our scheme reduces both energy consumption and recovery latency.

A Smart Checkpointing Scheme for Improving the Reliability of Clustering Routing Protocols

PubMed Central

Min, Hong; Jung, Jinman; Kim, Bongjae; Cho, Yookun; Heo, Junyoung; Yi, Sangho; Hong, Jiman

2010-01-01

In wireless sensor networks, system architectures and applications are designed to consider both resource constraints and scalability, because such networks are composed of numerous sensor nodes with various sensors and actuators, small memories, low-power microprocessors, radio modules, and batteries. Clustering routing protocols based on data aggregation schemes aimed at minimizing packet numbers have been proposed to meet these requirements. In clustering routing protocols, the cluster head plays an important role. The cluster head collects data from its member nodes and aggregates the collected data. To improve reliability and reduce recovery latency, we propose a checkpointing scheme for the cluster head. In the proposed scheme, backup nodes monitor and checkpoint the current state of the cluster head periodically. We also derive the checkpointing interval that maximizes reliability while using the same amount of energy consumed by clustering routing protocols that operate without checkpointing. Experimental comparisons with existing non-checkpointing schemes show that our scheme reduces both energy consumption and recovery latency. PMID:22163389

Laparoscopic colorectal surgery in learning curve: Role of implementation of a standardized technique and recovery protocol. A cohort study

PubMed Central

Luglio, Gaetano; De Palma, Giovanni Domenico; Tarquini, Rachele; Giglio, Mariano Cesare; Sollazzo, Viviana; Esposito, Emanuela; Spadarella, Emanuela; Peltrini, Roberto; Liccardo, Filomena; Bucci, Luigi

2015-01-01

Background Despite the proven benefits, laparoscopic colorectal surgery is still under utilized among surgeons. A steep learning is one of the causes of its limited adoption. Aim of the study is to determine the feasibility and morbidity rate after laparoscopic colorectal surgery in a single institution, “learning curve” experience, implementing a well standardized operative technique and recovery protocol. Methods The first 50 patients treated laparoscopically were included. All the procedures were performed by a trainee surgeon, supervised by a consultant surgeon, according to the principle of complete mesocolic excision with central vascular ligation or TME. Patients underwent a fast track recovery programme. Recovery parameters, short-term outcomes, morbidity and mortality have been assessed. Results Type of resections: 20 left side resections, 8 right side resections, 14 low anterior resection/TME, 5 total colectomy and IRA, 3 total panproctocolectomy and pouch. Mean operative time: 227 min; mean number of lymph-nodes: 18.7. Conversion rate: 8%. Mean time to flatus: 1.3 days; Mean time to solid stool: 2.3 days. Mean length of hospital stay: 7.2 days. Overall morbidity: 24%; major morbidity (Dindo–Clavien III): 4%. No anastomotic leak, no mortality, no 30-days readmission. Conclusion Proper laparoscopic colorectal surgery is safe and leads to excellent results in terms of recovery and short term outcomes, even in a learning curve setting. Key factors for better outcomes and shortening the learning curve seem to be the adoption of a standardized technique and training model along with the strict supervision of an expert colorectal surgeon. PMID:25859386

Inferring Broad Regulatory Biology from Time Course Data: Have We Reached an Upper Bound under Constraints Typical of In Vivo Studies?

PubMed Central

Craddock, Travis J. A.; Fletcher, Mary Ann; Klimas, Nancy G.

2015-01-01

There is a growing appreciation for the network biology that regulates the coordinated expression of molecular and cellular markers however questions persist regarding the identifiability of these networks. Here we explore some of the issues relevant to recovering directed regulatory networks from time course data collected under experimental constraints typical of in vivo studies. NetSim simulations of sparsely connected biological networks were used to evaluate two simple feature selection techniques used in the construction of linear Ordinary Differential Equation (ODE) models, namely truncation of terms versus latent vector projection. Performance was compared with ODE-based Time Series Network Identification (TSNI) integral, and the information-theoretic Time-Delay ARACNE (TD-ARACNE). Projection-based techniques and TSNI integral outperformed truncation-based selection and TD-ARACNE on aggregate networks with edge densities of 10-30%, i.e. transcription factor, protein-protein cliques and immune signaling networks. All were more robust to noise than truncation-based feature selection. Performance was comparable on the in silico 10-node DREAM 3 network, a 5-node Yeast synthetic network designed for In vivo Reverse-engineering and Modeling Assessment (IRMA) and a 9-node human HeLa cell cycle network of similar size and edge density. Performance was more sensitive to the number of time courses than to sample frequency and extrapolated better to larger networks by grouping experiments. In all cases performance declined rapidly in larger networks with lower edge density. Limited recovery and high false positive rates obtained overall bring into question our ability to generate informative time course data rather than the design of any particular reverse engineering algorithm. PMID:25984725

Assessing the State-of-the-Art in Dynamic Discovery of Ad Hoc Network Services

DTIC Science & Technology

2001-07-18

directed -- discovery mode. It is part of the SCM_Discovery -- Module. Sends Unicast messages to SCMs on list of -- SCMS to be discovered until all... SCMS are found. -- Receives updates from SCM DB of discovered SCMs and -- removes SCMs accordingly -- NOTE: Failure and recovery behavior are not...ALLFindService10 SM4 GROUP1GroupJoin10 SCM1 SM4LinkFail5 SM4NodeFail5 ParametersCommandTime TopologyScenario Execute with Rapide For All (SM, SD, SCM

A Novel Four-Node Quadrilateral Smoothing Element for Stress Enhancement and Error Estimation

NASA Technical Reports Server (NTRS)

Tessler, A.; Riggs, H. R.; Dambach, M.

1998-01-01

A four-node, quadrilateral smoothing element is developed based upon a penalized-discrete-least-squares variational formulation. The smoothing methodology recovers C1-continuous stresses, thus enabling effective a posteriori error estimation and automatic adaptive mesh refinement. The element formulation is originated with a five-node macro-element configuration consisting of four triangular anisoparametric smoothing elements in a cross-diagonal pattern. This element pattern enables a convenient closed-form solution for the degrees of freedom of the interior node, resulting from enforcing explicitly a set of natural edge-wise penalty constraints. The degree-of-freedom reduction scheme leads to a very efficient formulation of a four-node quadrilateral smoothing element without any compromise in robustness and accuracy of the smoothing analysis. The application examples include stress recovery and error estimation in adaptive mesh refinement solutions for an elasticity problem and an aerospace structural component.

Message Efficient Checkpointing and Rollback Recovery in Heterogeneous Mobile Networks

NASA Astrophysics Data System (ADS)

Jaggi, Parmeet Kaur; Singh, Awadhesh Kumar

2016-06-01

Heterogeneous networks provide an appealing way of expanding the computing capability of mobile networks by combining infrastructure-less mobile ad-hoc networks with the infrastructure-based cellular mobile networks. The nodes in such a network range from low-power nodes to macro base stations and thus, vary greatly in their capabilities such as computation power and battery power. The nodes are susceptible to different types of transient and permanent failures and therefore, the algorithms designed for such networks need to be fault-tolerant. The article presents a checkpointing algorithm for the rollback recovery of mobile hosts in a heterogeneous mobile network. Checkpointing is a well established approach to provide fault tolerance in static and cellular mobile distributed systems. However, the use of checkpointing for fault tolerance in a heterogeneous environment remains to be explored. The proposed protocol is based on the results of zigzag paths and zigzag cycles by Netzer-Xu. Considering the heterogeneity prevalent in the network, an uncoordinated checkpointing technique is employed. Yet, useless checkpoints are avoided without causing a high message overhead.

Toward real-time diffuse optical tomography: accelerating light propagation modeling employing parallel computing on GPU and CPU

NASA Astrophysics Data System (ADS)

Doulgerakis, Matthaios; Eggebrecht, Adam; Wojtkiewicz, Stanislaw; Culver, Joseph; Dehghani, Hamid

2017-12-01

Parameter recovery in diffuse optical tomography is a computationally expensive algorithm, especially when used for large and complex volumes, as in the case of human brain functional imaging. The modeling of light propagation, also known as the forward problem, is the computational bottleneck of the recovery algorithm, whereby the lack of a real-time solution is impeding practical and clinical applications. The objective of this work is the acceleration of the forward model, within a diffusion approximation-based finite-element modeling framework, employing parallelization to expedite the calculation of light propagation in realistic adult head models. The proposed methodology is applicable for modeling both continuous wave and frequency-domain systems with the results demonstrating a 10-fold speed increase when GPU architectures are available, while maintaining high accuracy. It is shown that, for a very high-resolution finite-element model of the adult human head with ˜600,000 nodes, consisting of heterogeneous layers, light propagation can be calculated at ˜0.25 s/excitation source.

Distributed C2 System Recovery Mechanisms

DTIC Science & Technology

1988-07-01

Systems," Proceedings of IEEE, Vol. 63, No. 6, 1975. (COHE75] Cohen, Ellis, David Jefferson, "Protection in the Hydra Operating System," Fifth...ideas in a real system. Distributed Operating System. Minn ACM Symposium an Operating SY’st*m Principles, October 1983, PP. 4~9-0. [REDEMo] Redell, David ...A transaction soy spawn a musher of node where it was interrupted with a now phase assigned children transactions at a PORK node. end the children

Central FPGA-based destination and load control in the LHCb MHz event readout

NASA Astrophysics Data System (ADS)

Jacobsson, R.

2012-10-01

The readout strategy of the LHCb experiment is based on complete event readout at 1 MHz. A set of 320 sub-detector readout boards transmit event fragments at total rate of 24.6 MHz at a bandwidth usage of up to 70 GB/s over a commercial switching network based on Gigabit Ethernet to a distributed event building and high-level trigger processing farm with 1470 individual multi-core computer nodes. In the original specifications, the readout was based on a pure push protocol. This paper describes the proposal, implementation, and experience of a non-conventional mixture of a push and a pull protocol, akin to credit-based flow control. An FPGA-based central master module, partly operating at the LHC bunch clock frequency of 40.08 MHz and partly at a double clock speed, is in charge of the entire trigger and readout control from the front-end electronics up to the high-level trigger farm. One FPGA is dedicated to controlling the event fragment packing in the readout boards, the assignment of the farm node destination for each event, and controls the farm load based on an asynchronous pull mechanism from each farm node. This dynamic readout scheme relies on generic event requests and the concept of node credit allowing load control and trigger rate regulation as a function of the global farm load. It also allows the vital task of fast central monitoring and automatic recovery in-flight of failing nodes while maintaining dead-time and event loss at a minimum. This paper demonstrates the strength and suitability of implementing this real-time task for a very large distributed system in an FPGA where no random delays are introduced, and where extreme reliability and accurate event accounting are fundamental requirements. It was in use during the entire commissioning phase of LHCb and has been in faultless operation during the first two years of physics luminosity data taking.

Status of the Node 3 Regenerative Environmental Cpntrol& Life Support System Water Recovery & Oxygen Generation Systems

NASA Technical Reports Server (NTRS)

Carrasquillo, Robyn L.

2003-01-01

NASA s Marshall Space Flight Center is providing three racks containing regenerative water recovery and oxygen generation systems (WRS and OGS) for flight on the lnternational Space Station s (ISS) Node 3 element. The major assemblies included in these racks are the Water Processor Assembly (WPA), Urine Processor Assembly (UPA), Oxygen Generation Assembly (OGA), and the Power Supply Module (PSM) supporting the OGA. The WPA and OGA are provided by Hamilton Sundstrand Space Systems lnternational (HSSSI), while the UPA and PSM are being designed and manufactured in-house by MSFC. The assemblies are currently in the manufacturing and test phase and are to be completed and integrated into flight racks this year. This paper gives an overview of the technologies and system designs, technical challenges encountered and solved, and the current status.

Induction of a glucocorticoid-sensitive F1-anti-parental mechanism that affects engraftment during graft-versus-host disease.

PubMed

You-Ten, K E; Seemayer, T A; Wisse, B; Bertley, F M; Lapp, W S

1995-07-01

Studies have shown that graft-vs-host disease (GVHD) in animal models induces persistent elevated levels of circulating adrenal glucocorticoids. In this report, we investigated the effects of endogenous glucocorticoids on the outcome of GVHD by adrenalectomizing (ADX) unirradiated (C57BL/6 x A)F1 (B6AF1) mice before GVHD induction. GVHD was induced by injection of 20 x 10(6) A strain parental lymphoid cells into B6AF1 mice. Our results demonstrated that non-ADX recipient mice experienced features characteristic of GVHD on day 13, which became progressively more severe by days 18 to 21. The GVHD features included severe immunosuppression, reversal in the host splenic CD4+/CD8+ ratio, histopathologic lesions in different tissues, and high parental cell chimerism in the spleens and lymph nodes. In contrast, ADX F1 recipient mice experienced GVHD features on day 13 similar to their non-ADX counterparts; however, ADX animals recovered rapidly from GVHD by days 18 to 21. Flow cytometry showed that, although a relatively high frequency of parental cells was detected in the spleens and lymph nodes of ADX mice on day 13, nearly all of the parental cells in the peripheral lymphoid organs disappeared on days 18 to 21, the time of recovery from GVHD. The marked reduction of parental cells and recovery from GVHD were prevented by treating ADX F1 mice with either exogenous glucocorticoid, anti-asialoGM1, or anti-CD8, but not anti-NK1.1 Ab. These results suggest that a dramatic recovery from GVHD was induced by a cell-mediated, steroid-sensitive F1-anti-parental mechanism. The F1-anti-parental phenomenon described herein is different from classical hybrid resistance.

Design and development of compact monitoring system for disaster remote health centres.

PubMed

Santhi, S; Sadasivam, G S

2015-02-01

To enhance speedy communication between the patient and the doctor through newly proposed routing protocol at the mobile node. The proposed model is applied for a telemedicine application during disaster recovery management. In this paper, Energy Efficient Link Stability Routing Protocol (EELSRP) has been developed by simulation and real time. This framework is designed for the immediate healing of affected persons in remote areas, especially at the time of the disaster where there is no hospital proximity. In case of disasters, there might be an outbreak of infectious diseases. In such cases, the patient's medical record is also transferred by the field operator from disaster place to the hospital to facilitate the identification of the disease-causing agent and to prescribe the necessary medication. The heterogeneous networking framework provides reliable, energy efficientand speedy communication between the patient and the doctor using the proposed routing protocol at the mobile node. The performance of the simulation and real time versions of the Energy Efficient Link Stability Routing Protocol (EELSRP) protocol has been analyzed. Experimental results prove the efficiency of the real-time version of EESLRP protocol. The packet delivery ratio and throughput of the real time version of EELSRP protocol is increased by 3% and 10%, respectively, when compared to the simulated version of EELSRP. The end-to-end delay and energy consumption are reduced by 10% and 2% in the real time version of EELSRP.

Acupuncture Induces Time-Dependent Remodelling Brain Network on the Stable Somatosensory First-Ever Stroke Patients: Combining Diffusion Tensor and Functional MR Imaging.

PubMed

Bai, Lijun; Tao, Yin; Wang, Dan; Wang, Jing; Sun, Chuanzhu; Hao, Nongxiao; Chen, Shangjie; Lao, Lixing

2014-01-01

Different treatment interventions induce distinct remodelling of network architecture of entire motor system. Acupuncture has been proved to be of a promising efficacy in motor recovery. However, it is still unclear whether the reorganization of motor-related brain network underlying acupuncture is related with time since stroke and severity of deficit at baseline. The aim of study was to characterize the relation between motor-related brain organization following acupuncture and white matter microstructural changes at an interval of two weeks. We demonstrated that acupuncture induced differential reorganization of motor-related network for stroke patients as time-lapse since stroke. At the baseline, acupuncture can induce the increased functional connectivity between the left primary motor cortex (M1) and the right M1, premotor cortex, supplementary motor area (SMA), thalamus, and cerebellum. After two-week recovery, the increased functional connectivity of the left M1 was more widely distributed and primarily located in the insula, cerebellum, basal ganglia, and SMA. Furthermore, a significant negative relation existed between the FA value in the left M1 at the baseline scanning and node centrality of this region following acupuncture for both baseline and two-week recovery. Our findings may shed a new insight on understanding the reorganization of motor-related theory underlying motor impairments after brain lesions in stroke patients.

Routing Based on Length of Time of Available Connection

NASA Technical Reports Server (NTRS)

Anandappan, Thanga (Inventor); Roy, Aloke (Inventor); Malve, Sharath Babu (Inventor); Toth, Louis T. (Inventor)

2016-01-01

In an embodiment, a method of routing packets at a first node in an ad-hoc network is provided. The method includes receiving, at the first node, a plurality of route-alive messages corresponding to a destination, each of the plurality of route-alive messages including a route time indicating a length of time in which a communicative connection is available between the second node that sent the respective route-alive message and the destination. The method also includes determining an updated route time for each second node. The updated route time corresponds to a length of time in which a communication connection is available between the first node and the destination through the respective second node. A second node is selected for sending a packet to based on the updated route time for each of the second nodes, wherein a node having a longer updated route time is given higher priority for selection.

Complex networks repair strategies: Dynamic models

NASA Astrophysics Data System (ADS)

Fu, Chaoqi; Wang, Ying; Gao, Yangjun; Wang, Xiaoyang

2017-09-01

Network repair strategies are tactical methods that restore the efficiency of damaged networks; however, unreasonable repair strategies not only waste resources, they are also ineffective for network recovery. Most extant research on network repair focuses on static networks, but results and findings on static networks cannot be applied to evolutionary dynamic networks because, in dynamic models, complex network repair has completely different characteristics. For instance, repaired nodes face more severe challenges, and require strategic repair methods in order to have a significant effect. In this study, we propose the Shell Repair Strategy (SRS) to minimize the risk of secondary node failures due to the cascading effect. Our proposed method includes the identification of a set of vital nodes that have a significant impact on network repair and defense. Our identification of these vital nodes reduces the number of switching nodes that face the risk of secondary failures during the dynamic repair process. This is positively correlated with the size of the average degree 〈 k 〉 and enhances network invulnerability.

Undermining and Strengthening Social Networks through Network Modification

PubMed Central

Mellon, Jonathan; Yoder, Jordan; Evans, Daniel

2016-01-01

Social networks have well documented effects at the individual and aggregate level. Consequently it is often useful to understand how an attempt to influence a network will change its structure and consequently achieve other goals. We develop a framework for network modification that allows for arbitrary objective functions, types of modification (e.g. edge weight addition, edge weight removal, node removal, and covariate value change), and recovery mechanisms (i.e. how a network responds to interventions). The framework outlined in this paper helps both to situate the existing work on network interventions but also opens up many new possibilities for intervening in networks. In particular use two case studies to highlight the potential impact of empirically calibrating the objective function and network recovery mechanisms as well as showing how interventions beyond node removal can be optimised. First, we simulate an optimal removal of nodes from the Noordin terrorist network in order to reduce the expected number of attacks (based on empirically predicting the terrorist collaboration network from multiple types of network ties). Second, we simulate optimally strengthening ties within entrepreneurial ecosystems in six developing countries. In both cases we estimate ERGM models to simulate how a network will endogenously evolve after intervention. PMID:27703198

Undermining and Strengthening Social Networks through Network Modification.

PubMed

Mellon, Jonathan; Yoder, Jordan; Evans, Daniel

2016-10-05

Social networks have well documented effects at the individual and aggregate level. Consequently it is often useful to understand how an attempt to influence a network will change its structure and consequently achieve other goals. We develop a framework for network modification that allows for arbitrary objective functions, types of modification (e.g. edge weight addition, edge weight removal, node removal, and covariate value change), and recovery mechanisms (i.e. how a network responds to interventions). The framework outlined in this paper helps both to situate the existing work on network interventions but also opens up many new possibilities for intervening in networks. In particular use two case studies to highlight the potential impact of empirically calibrating the objective function and network recovery mechanisms as well as showing how interventions beyond node removal can be optimised. First, we simulate an optimal removal of nodes from the Noordin terrorist network in order to reduce the expected number of attacks (based on empirically predicting the terrorist collaboration network from multiple types of network ties). Second, we simulate optimally strengthening ties within entrepreneurial ecosystems in six developing countries. In both cases we estimate ERGM models to simulate how a network will endogenously evolve after intervention.

Undermining and Strengthening Social Networks through Network Modification

NASA Astrophysics Data System (ADS)

Mellon, Jonathan; Yoder, Jordan; Evans, Daniel

2016-10-01

Social networks have well documented effects at the individual and aggregate level. Consequently it is often useful to understand how an attempt to influence a network will change its structure and consequently achieve other goals. We develop a framework for network modification that allows for arbitrary objective functions, types of modification (e.g. edge weight addition, edge weight removal, node removal, and covariate value change), and recovery mechanisms (i.e. how a network responds to interventions). The framework outlined in this paper helps both to situate the existing work on network interventions but also opens up many new possibilities for intervening in networks. In particular use two case studies to highlight the potential impact of empirically calibrating the objective function and network recovery mechanisms as well as showing how interventions beyond node removal can be optimised. First, we simulate an optimal removal of nodes from the Noordin terrorist network in order to reduce the expected number of attacks (based on empirically predicting the terrorist collaboration network from multiple types of network ties). Second, we simulate optimally strengthening ties within entrepreneurial ecosystems in six developing countries. In both cases we estimate ERGM models to simulate how a network will endogenously evolve after intervention.

Bayesian estimation of post-Messinian divergence times in Balearic Island lizards.

PubMed

Brown, R P; Terrasa, B; Pérez-Mellado, V; Castro, J A; Hoskisson, P A; Picornell, A; Ramon, M M

2008-07-01

Phylogenetic relationships and timings of major cladogenesis events are investigated in the Balearic Island lizards Podarcislilfordi and P.pityusensis using 2675bp of mitochondrial and nuclear DNA sequences. Partitioned Bayesian and Maximum Parsimony analyses provided a well-resolved phylogeny with high node-support values. Bayesian MCMC estimation of node dates was investigated by comparing means of posterior distributions from different subsets of the sequence against the most robust analysis which used multiple partitions and allowed for rate heterogeneity among branches under a rate-drift model. Evolutionary rates were systematically underestimated and thus divergence times overestimated when sequences containing lower numbers of variable sites were used (based on ingroup node constraints). The following analyses allowed the best recovery of node times under the constant-rate (i.e., perfect clock) model: (i) all cytochrome b sequence (partitioned by codon position), (ii) cytochrome b (codon position 3 alone), (iii) NADH dehydrogenase (subunits 1 and 2; partitioned by codon position), (iv) cytochrome b and NADH dehydrogenase sequence together (six gene-codon partitions), (v) all unpartitioned sequence, (vi) a full multipartition analysis (nine partitions). Of these, only (iv) and (vi) performed well under the rate-drift model. These findings have significant implications for dating of recent divergence times in other taxa. The earliest P.lilfordi cladogenesis event (divergence of Menorcan populations), occurred before the end of the Pliocene, some 2.6Ma. Subsequent events led to a West Mallorcan lineage (2.0Ma ago), followed 1.2Ma ago by divergence of populations from the southern part of the Cabrera archipelago from a widely-distributed group from north Cabrera, northern and southern Mallorcan islets. Divergence within P.pityusensis is more recent with the main Ibiza and Formentera clades sharing a common ancestor at about 1.0Ma ago. Climatic and sea level changes are likely to have initiated cladogenesis, with lineages making secondary contact during periodic landbridge formation. This oscillating cross-archipelago pattern in which ancient divergence is followed by repeated contact resembles that seen between East-West refugia populations from mainland Europe.

Determining collective barrier operation skew in a parallel computer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Faraj, Daniel A.

2015-11-24

Determining collective barrier operation skew in a parallel computer that includes a number of compute nodes organized into an operational group includes: for each of the nodes until each node has been selected as a delayed node: selecting one of the nodes as a delayed node; entering, by each node other than the delayed node, a collective barrier operation; entering, after a delay by the delayed node, the collective barrier operation; receiving an exit signal from a root of the collective barrier operation; and measuring, for the delayed node, a barrier completion time. The barrier operation skew is calculated by:more » identifying, from the compute nodes' barrier completion times, a maximum barrier completion time and a minimum barrier completion time and calculating the barrier operation skew as the difference of the maximum and the minimum barrier completion time.« less

Determining collective barrier operation skew in a parallel computer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Faraj, Daniel A.

Determining collective barrier operation skew in a parallel computer that includes a number of compute nodes organized into an operational group includes: for each of the nodes until each node has been selected as a delayed node: selecting one of the nodes as a delayed node; entering, by each node other than the delayed node, a collective barrier operation; entering, after a delay by the delayed node, the collective barrier operation; receiving an exit signal from a root of the collective barrier operation; and measuring, for the delayed node, a barrier completion time. The barrier operation skew is calculated by:more » identifying, from the compute nodes' barrier completion times, a maximum barrier completion time and a minimum barrier completion time and calculating the barrier operation skew as the difference of the maximum and the minimum barrier completion time.« less

System and method for time synchronization in a wireless network

DOEpatents

Gonia, Patrick S.; Kolavennu, Soumitri N.; Mahasenan, Arun V.; Budampati, Ramakrishna S.

2010-03-30

A system includes multiple wireless nodes forming a cluster in a wireless network, where each wireless node is configured to communicate and exchange data wirelessly based on a clock. One of the wireless nodes is configured to operate as a cluster master. Each of the other wireless nodes is configured to (i) receive time synchronization information from a parent node, (ii) adjust its clock based on the received time synchronization information, and (iii) broadcast time synchronization information based on the time synchronization information received by that wireless node. The time synchronization information received by each of the other wireless nodes is based on time synchronization information provided by the cluster master so that the other wireless nodes substantially synchronize their clocks with the clock of the cluster master.

Toward real-time diffuse optical tomography: accelerating light propagation modeling employing parallel computing on GPU and CPU.

PubMed

Doulgerakis, Matthaios; Eggebrecht, Adam; Wojtkiewicz, Stanislaw; Culver, Joseph; Dehghani, Hamid

2017-12-01

Parameter recovery in diffuse optical tomography is a computationally expensive algorithm, especially when used for large and complex volumes, as in the case of human brain functional imaging. The modeling of light propagation, also known as the forward problem, is the computational bottleneck of the recovery algorithm, whereby the lack of a real-time solution is impeding practical and clinical applications. The objective of this work is the acceleration of the forward model, within a diffusion approximation-based finite-element modeling framework, employing parallelization to expedite the calculation of light propagation in realistic adult head models. The proposed methodology is applicable for modeling both continuous wave and frequency-domain systems with the results demonstrating a 10-fold speed increase when GPU architectures are available, while maintaining high accuracy. It is shown that, for a very high-resolution finite-element model of the adult human head with ∼600,000 nodes, consisting of heterogeneous layers, light propagation can be calculated at ∼0.25  s/excitation source. (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE).

Real-time CARS imaging reveals a calpain-dependent pathway for paranodal myelin retraction during high-frequency stimulation.

PubMed

Huff, Terry B; Shi, Yunzhou; Sun, Wenjing; Wu, Wei; Shi, Riyi; Cheng, Ji-Xin

2011-03-03

High-frequency electrical stimulation is becoming a promising therapy for neurological disorders, however the response of the central nervous system to stimulation remains poorly understood. The current work investigates the response of myelin to electrical stimulation by laser-scanning coherent anti-Stokes Raman scattering (CARS) imaging of myelin in live spinal tissues in real time. Paranodal myelin retraction at the nodes of Ranvier was observed during 200 Hz electrical stimulation. Retraction was seen to begin minutes after the onset of stimulation and continue for up to 10 min after stimulation was ceased, but was found to reverse after a 2 h recovery period. The myelin retraction resulted in exposure of Kv 1.2 potassium channels visualized by immunofluorescence. Accordingly, treating the stimulated tissue with a potassium channel blocker, 4-aminopyridine, led to the appearance of a shoulder peak in the compound action potential curve. Label-free CARS imaging of myelin coupled with multiphoton fluorescence imaging of immuno-labeled proteins at the nodes of Ranvier revealed that high-frequency stimulation induced paranodal myelin retraction via pathologic calcium influx into axons, calpain activation, and cytoskeleton degradation through spectrin break-down.

Building SDN-Based Agricultural Vehicular Sensor Networks Based on Extended Open vSwitch.

PubMed

Huang, Tao; Yan, Siyu; Yang, Fan; Pan, Tian; Liu, Jiang

2016-01-19

Software-defined vehicular sensor networks in agriculture, such as autonomous vehicle navigation based on wireless multi-sensor networks, can lead to more efficient precision agriculture. In SDN-based vehicle sensor networks, the data plane is simplified and becomes more efficient by introducing a centralized controller. However, in a wireless environment, the main controller node may leave the sensor network due to the dynamic topology change or the unstable wireless signal, leaving the rest of network devices without control, e.g., a sensor node as a switch may forward packets according to stale rules until the controller updates the flow table entries. To solve this problem, this paper proposes a novel SDN-based vehicular sensor networks architecture which can minimize the performance penalty of controller connection loss. We achieve this by designing a connection state detection and self-learning mechanism. We build prototypes based on extended Open vSwitch and Ryu. The experimental results show that the recovery time from controller connection loss is under 100 ms and it keeps rule updating in real time with a stable throughput. This architecture enhances the survivability and stability of SDN-based vehicular sensor networks in precision agriculture.

Building SDN-Based Agricultural Vehicular Sensor Networks Based on Extended Open vSwitch

PubMed Central

Huang, Tao; Yan, Siyu; Yang, Fan; Pan, Tian; Liu, Jiang

2016-01-01

Software-defined vehicular sensor networks in agriculture, such as autonomous vehicle navigation based on wireless multi-sensor networks, can lead to more efficient precision agriculture. In SDN-based vehicle sensor networks, the data plane is simplified and becomes more efficient by introducing a centralized controller. However, in a wireless environment, the main controller node may leave the sensor network due to the dynamic topology change or the unstable wireless signal, leaving the rest of network devices without control, e.g., a sensor node as a switch may forward packets according to stale rules until the controller updates the flow table entries. To solve this problem, this paper proposes a novel SDN-based vehicular sensor networks architecture which can minimize the performance penalty of controller connection loss. We achieve this by designing a connection state detection and self-learning mechanism. We build prototypes based on extended Open vSwitch and Ryu. The experimental results show that the recovery time from controller connection loss is under 100 ms and it keeps rule updating in real time with a stable throughput. This architecture enhances the survivability and stability of SDN-based vehicular sensor networks in precision agriculture. PMID:26797616

Synchronizing compute node time bases in a parallel computer

DOEpatents

Chen, Dong; Faraj, Daniel A; Gooding, Thomas M; Heidelberger, Philip

2015-01-27

Synchronizing time bases in a parallel computer that includes compute nodes organized for data communications in a tree network, where one compute node is designated as a root, and, for each compute node: calculating data transmission latency from the root to the compute node; configuring a thread as a pulse waiter; initializing a wakeup unit; and performing a local barrier operation; upon each node completing the local barrier operation, entering, by all compute nodes, a global barrier operation; upon all nodes entering the global barrier operation, sending, to all the compute nodes, a pulse signal; and for each compute node upon receiving the pulse signal: waking, by the wakeup unit, the pulse waiter; setting a time base for the compute node equal to the data transmission latency between the root node and the compute node; and exiting the global barrier operation.

Synchronizing compute node time bases in a parallel computer

DOEpatents

Chen, Dong; Faraj, Daniel A; Gooding, Thomas M; Heidelberger, Philip

2014-12-30

Synchronizing time bases in a parallel computer that includes compute nodes organized for data communications in a tree network, where one compute node is designated as a root, and, for each compute node: calculating data transmission latency from the root to the compute node; configuring a thread as a pulse waiter; initializing a wakeup unit; and performing a local barrier operation; upon each node completing the local barrier operation, entering, by all compute nodes, a global barrier operation; upon all nodes entering the global barrier operation, sending, to all the compute nodes, a pulse signal; and for each compute node upon receiving the pulse signal: waking, by the wakeup unit, the pulse waiter; setting a time base for the compute node equal to the data transmission latency between the root node and the compute node; and exiting the global barrier operation.

The diagnostic value of thyroglobulin concentration in fine-needle aspiration of the cervical lymph nodes in patients with differentiated thyroid cancer.

PubMed

Mikosiński, Sławomir; Pomorski, Lech; Oszukowska, Lidia; Makarewicz, Jacek; Adamczewski, Zbigniew; Sporny, Stanisław; Lewiński, Andrzej

2006-01-01

Recurrent differentiated thyroid cancer generally occurs first in the neck. Ultrasound is sensitive in detecting enlarged cervical lymph nodes but is not specific enough. Ultrasound-guided fine-needle biopsy increases the specificity but still may fail to detect a recurrence of the disease in the cystic metastatic lymph nodes. The aim of the study was to estimate the value of Tg concentration in the needle washout after fine-needle aspiration of suspicious lymph nodes. The 105 patients studied had presented one or more enlarged suspicious cervical lymph nodes. All had undergone total thyroidectomy and (131)I ablative therapy. Serum thyroglobulin (Tg) concentration was within the 0.15-711.5 ng/ml range (mean 22.24 ng/ml) and Tg recovery range 94-100%. The positive Tg washout concentration cut-off value was established as equal to the mean plus two standard deviations of the Tg washout concentration of patients with negative cytology. Lymph node involvement was diagnosed by cytology in 15 patients and in 28 lymph nodes. Positive Tg washout concentration was found in 22 patients and in 48 lymph nodes. All the lymph nodes which turned out to have positive cytology had a positive Tg washout concentration. All lymph nodes with positive cytology were positive in pathology. Seven patients and 20 lymph nodes with negative cytology were positive in the Tg washout concentration test. All but one patients and all but two lymph nodes with a positive Tg washout concentration had positive pathology. 1. Ultrasound-guided fine-needle biopsy is not sensitive enough to detect all metastatic lymph nodes. 2. The Tg washout concentration test is 100% sensitive in the detection of metastatic lymph nodes. 3. Cytology in ultrasound- guided fine-needle biopsy is 100% specific. 4. The Tg washout concentration test carries a risk of false-positive results. 5. Both methods should be used for early detection of metastatic lymph nodes in patients with differentiated thyroid cancer.

Kuipers performs Water Sample Analysis

NASA Image and Video Library

2012-05-15

ISS031-E-084619 (15 May 2012) --- After collecting samples from the Water Recovery System (WRS), European Space Agency astronaut Andre Kuipers, Expedition 31 flight engineer, processes the samples for chemical and microbial analysis in the Unity node of the International Space Station.

Dedicated heterogeneous node scheduling including backfill scheduling

DOEpatents

Wood, Robert R [Livermore, CA; Eckert, Philip D [Livermore, CA; Hommes, Gregg [Pleasanton, CA

2006-07-25

A method and system for job backfill scheduling dedicated heterogeneous nodes in a multi-node computing environment. Heterogeneous nodes are grouped into homogeneous node sub-pools. For each sub-pool, a free node schedule (FNS) is created so that the number of to chart the free nodes over time. For each prioritized job, using the FNS of sub-pools having nodes useable by a particular job, to determine the earliest time range (ETR) capable of running the job. Once determined for a particular job, scheduling the job to run in that ETR. If the ETR determined for a lower priority job (LPJ) has a start time earlier than a higher priority job (HPJ), then the LPJ is scheduled in that ETR if it would not disturb the anticipated start times of any HPJ previously scheduled for a future time. Thus, efficient utilization and throughput of such computing environments may be increased by utilizing resources otherwise remaining idle.

β1-Adrenergic blocker bisoprolol reverses down-regulated ion channels in sinoatrial node of heart failure rats.

PubMed

Du, Yuan; Zhang, Junbo; Xi, Yutao; Wu, Geru; Han, Ke; Huang, Xin; Ma, Aiqun; Wang, Tingzhong

2016-06-01

Bisoprolol, an antagonist of β1-adrenergic receptors, is effective in reducing the morbidity and mortality in patients with heart failure (HF). It has been found that HF is accompanied with dysfunction of the sinoatrial node (SAN). However, whether bisoprolol reverses the decreased SAN function in HF and how the relevant ion channels in SAN change were relatively less studied. SAN function and messenger RNA (mRNA) expression of sodium channels and hyperpolarization-activated cyclic nucleotide-gated (HCN) channel subunits were assessed in sham-operated rats, abdominal arterio-venous shunt (volume overload)-induced HF rats, and bisoprolol- treated HF rats. SAN cells of rats were isolated by laser capture microdissection. Quantitative real-time PCR analysis was used to quantify mRNA expression of sodium channels and HCN channel subunits in SAN. Intrinsic heart rate declined and sinus node recovery time prolonged in HF rats, indicating the suppressed SAN function, which could be improved by bisoprolol treatment. Nav1.1, Nav1.6, and HCN4 mRNA expressions were reduced in SAN in HF rats compared with that in control rats. Treatment with bisoprolol could reverse both the SAN function and the Nav1.1, Nav1.6, and HCN4 mRNA expression partially. These data indicated that bisoprolol is effective in HF treatment partially due to improved SAN function by reversing the down-regulation of sodium channels (Nav1.1 and Nav1.6) and HCN channel (HCN4) subunits in SAN in failing hearts.

Long-term recovery of normal sexual function in testicular cancer survivors.

PubMed

Capogrosso, Paolo; Boeri, Luca; Ferrari, Matteo; Ventimiglia, Eugenio; La Croce, Giovanni; Capitanio, Umberto; Briganti, Alberto; Damiano, Rocco; Montorsi, Francesco; Salonia, Andrea

2016-01-01

Testicular cancer (TC) is the most common solid cancer in men between the third and fourth decade of life. Due to successful treatment approaches, TC survivors (TCSs) have long life expectancy, but with numerous potential long-term sequelae, including sexual dysfunction. We investigated predictors of long-term normal sexual function (SF) recovery in TCSs. Sociodemographic, medical, and psychometric data were analyzed in 143 Caucasian-European TCSs, who underwent orchiectomy at a single institution. Health-significant comorbidities were scored with the Charlson Comorbidity Index (CCI). Patients completed the International Index of Erectile Function (IIEF). Statistical models tested the association between predictors (including age at surgery, body mass index, CCI, and adjuvant therapy: radiotherapy [RT], chemotherapy [CT], CT followed by retroperitoneal lymph node dissection [RPLND] and RPLND alone) and the long-term recovery of normal SF (defined as IIEF-erectile function [EF] ≥26, and sexual desire [SD], intercourse satisfaction [IS] orgasmic function [OF], and overall satisfaction [OS] domain scores in the upper tertiles). At a mean follow-up of 86 months, 35 (25.5%) TCSs had erectile dysfunction (ED), with 16 (11.2%) experiencing severe ED. Median time of EF recovery was 60, 60, and 70 months after CT, RT, and RPLND, respectively. Only adjuvant RT emerged as an independent predictor of nonrecovery of normal EF (HR: 0.55, P= 0.01). Neither adjuvant CT nor CT plus RPLND or RPLND alone significantly impaired the recovery of normal erections. Adjuvant therapy was not associated with impaired recovery of normal sexuality as a whole, considering the IIEF-SD, -OF, -IS, and OS domains.

PeerShield: determining control and resilience criticality of collaborative cyber assets in networks

NASA Astrophysics Data System (ADS)

Cam, Hasan

2012-06-01

As attackers get more coordinated and advanced in cyber attacks, cyber assets are required to have much more resilience, control effectiveness, and collaboration in networks. Such a requirement makes it essential to take a comprehensive and objective approach for measuring the individual and relative performances of cyber security assets in network nodes. To this end, this paper presents four techniques as to how the relative importance of cyber assets can be measured more comprehensively and objectively by considering together the main variables of risk assessment (e.g., threats, vulnerabilities), multiple attributes (e.g., resilience, control, and influence), network connectivity and controllability among collaborative cyber assets in networks. In the first technique, a Bayesian network is used to include the random variables for control, recovery, and resilience attributes of nodes, in addition to the random variables of threats, vulnerabilities, and risk. The second technique shows how graph matching and coloring can be utilized to form collaborative pairs of nodes to shield together against threats and vulnerabilities. The third technique ranks the security assets of nodes by incorporating multiple weights and thresholds of attributes into a decision-making algorithm. In the fourth technique, the hierarchically well-separated tree is enhanced to first identify critical nodes of a network with respect to their attributes and network connectivity, and then selecting some nodes as driver nodes for network controllability.

Diagram of the Water Recovery and Management for the International Space Station

NASA Technical Reports Server (NTRS)

2000-01-01

This diagram shows the flow of water recovery and management in the International Space Station (ISS). The Environmental Control and Life Support System (ECLSS) Group of the Flight Projects Directorate at the Marshall Space Flight Center is responsible for the regenerative ECLSS hardware, as well as providing technical support for the rest of the system. The regenerative ECLSS, whose main components are the Water Recovery System (WRS), and the Oxygen Generation System (OGS), reclaims and recycles water oxygen. The ECLSS maintains a pressurized habitation environment, provides water recovery and storage, maintains and provides fire detection/ suppression, and provides breathable air and a comfortable atmosphere in which to live and work within the ISS. The ECLSS hardware will be located in the Node 3 module of the ISS.

A novel lost packets recovery scheme based on visual secret sharing

NASA Astrophysics Data System (ADS)

Lu, Kun; Shan, Hong; Li, Zhi; Niu, Zhao

2017-08-01

In this paper, a novel lost packets recovery scheme which encrypts the effective parts of an original packet into two shadow packets based on (2, 2)-threshold XOR-based visual Secret Sharing (VSS) is proposed. The two shadow packets used as watermarks would be embedded into two normal data packets with digital watermarking embedding technology and then sent from one sensor node to another. Each shadow packet would reveal no information of the original packet, which can improve the security of original packet delivery greatly. The two shadow packets which can be extracted from the received two normal data packets delivered from a sensor node can recover the original packet lossless based on XOR-based VSS. The Performance analysis present that the proposed scheme provides essential services as long as possible in the presence of selective forwarding attack. The proposed scheme would not increase the amount of additional traffic, namely, lower energy consumption, which is suitable for Wireless Sensor Network (WSN).

Network Management and FDIR for SpaceWire Networks (N-MaSS)

NASA Astrophysics Data System (ADS)

Montano, Giuseppe; Jameux, David; Cook, Barry; Peel, Rodger; McCormick, Ecaterina; Walker, Paul; Kollias, Vangelis; Pogkas, Nikos

2014-08-01

The SpaceWire network management layer, which manages network topology and routing, is not yet standardised. This paper presents the European Space Agency (ESA) N-MaSS study, which focuses on implementation and standardisation of Fault Detection, Isolation and Recovery (FDIR) functions within the SpaceWire network management layer. N-MaSS provides an autonomous FDIR solution. It is defined at the SpaceWire network layer in order to achieve efficient re-use for heterogeneous missions, allowing for the incorporation of legacy equipment. The N-MaSS FDIR functions identify SpaceWire link and node failures and provide recovery using redundant nodes.This paper provides an overview of the overall N- MaSS study. In particular, the following topics are discussed: (a) how user requirements have been captured from the industry, SpaceWire Working Group and ESA; (b) how the N-MaSS architecture was organically shaped on the basis of the requirements captured; (c) how the N-MaSS concept is currently being implemented in a demonstrator and verified.

Function Allocation in a Robust Distributed Real-Time Environment

DTIC Science & Technology

1991-12-01

fundamental characteristic of a distributed system is its ability to map individual logical functions of an application program onto many physical nodes... how much of a node’s processor time is scheduled for function processing. IMC is the function- to -function communication required to facilitate...indicator of how much excess processor time a node has. The reconfiguration algorithms use these variables to determine the most appropriate node(s) to

Dataset for forensic analysis of B-tree file system.

PubMed

Wani, Mohamad Ahtisham; Bhat, Wasim Ahmad

2018-06-01

Since B-tree file system (Btrfs) is set to become de facto standard file system on Linux (and Linux based) operating systems, Btrfs dataset for forensic analysis is of great interest and immense value to forensic community. This article presents a novel dataset for forensic analysis of Btrfs that was collected using a proposed data-recovery procedure. The dataset identifies various generalized and common file system layouts and operations, specific node-balancing mechanisms triggered, logical addresses of various data structures, on-disk records, recovered-data as directory entries and extent data from leaf and internal nodes, and percentage of data recovered.

Single-incision laparoscopic distal gastrectomy for early gastric cancer through a homemade single port access device.

PubMed

Jiang, Zhi-Wei; Zhang, Shu; Wang, Gang; Zhao, Kun; Liu, Jiang; Ning, Li; Li, Jieshou

2015-01-01

We presented a series of single-incision laparoscopic distal gastrectomies for early gastric cancer patients through a type of homemade single port access device and some other conventional laparoscopic instruments. A single-incision laparoscopic distal gastrectomy with D1 + α lymph node dissection was performed on a 46 years old male patient who had an early gastric cancer. This single port access device has facilitated the conventional laparoscopic instruments to accomplish the surgery and we made in only 6 minutes. Total operating time for this surgery was 240 minutes. During the operation, there were about 100 milliliters of blood loss, and 17 lymph-nodes were retrieved. This homemade single port access device shows its superiority in economy and convenience for complex single-incision surgeries. Single-incision laparoscopic distal gastrectomy for early gastric cancer can be conducted by experienced laparoscopic surgeons. Fully take advantage of both SILS and fast track surgery plan can bring to successful surgeries with minimal postoperative pain, quicker mobilization, early recovery of intestinal function, and better cosmesis effect for the patients.

A Wireless Sensor Network approach for distributed in-line chemical analysis of water.

PubMed

Capella, J V; Bonastre, A; Ors, R; Peris, M

2010-03-15

In this work we propose the implementation of a distributed system based on a Wireless Sensor Network for the control of a chemical analysis system for fresh water. This implementation is presented by describing the nodes that form the distributed system, the communication system by wireless networks, control strategies, and so on. Nitrate, ammonium, and chloride are measured in-line using appropriate ion selective electrodes (ISEs), the results obtained being compared with those provided by the corresponding reference methods. Recovery analyses with ISEs and standard methods, study of interferences, and evaluation of major sensor features have also been carried out. The communication among the nodes that form the distributed system is implemented by means of the utilization of proprietary wireless networks, and secondary data transmission services (GSM or GPRS) provided by a mobile telephone operator. The information is processed, integrated and stored in a control center. These data can be retrieved--through the Internet--so as to know the real-time system status and its evolution. Copyright (c) 2009 Elsevier B.V. All rights reserved.

Method and computer product to increase accuracy of time-based software verification for sensor networks

DOEpatents

Foo Kune, Denis [Saint Paul, MN; Mahadevan, Karthikeyan [Mountain View, CA

2011-01-25

A recursive verification protocol to reduce the time variance due to delays in the network by putting the subject node at most one hop from the verifier node provides for an efficient manner to test wireless sensor nodes. Since the software signatures are time based, recursive testing will give a much cleaner signal for positive verification of the software running on any one node in the sensor network. In this protocol, the main verifier checks its neighbor, who in turn checks its neighbor, and continuing this process until all nodes have been verified. This ensures minimum time delays for the software verification. Should a node fail the test, the software verification downstream is halted until an alternative path (one not including the failed node) is found. Utilizing techniques well known in the art, having a node tested twice, or not at all, can be avoided.

System and method for merging clusters of wireless nodes in a wireless network

DOEpatents

Budampati, Ramakrishna S [Maple Grove, MN; Gonia, Patrick S [Maplewood, MN; Kolavennu, Soumitri N [Blaine, MN; Mahasenan, Arun V [Kerala, IN

2012-05-29

A system includes a first cluster having multiple first wireless nodes. One first node is configured to act as a first cluster master, and other first nodes are configured to receive time synchronization information provided by the first cluster master. The system also includes a second cluster having one or more second wireless nodes. One second node is configured to act as a second cluster master, and any other second nodes configured to receive time synchronization information provided by the second cluster master. The system further includes a manager configured to merge the clusters into a combined cluster. One of the nodes is configured to act as a single cluster master for the combined cluster, and the other nodes are configured to receive time synchronization information provided by the single cluster master.

MPH-M, AODV-M and DSR-M Performance Evaluation under Jamming Attacks.

PubMed

Del-Valle-Soto, Carolina; Mex-Perera, Carlos; Monroy, Raul; Nolazco-Flores, Juan A

2017-07-05

In this work, we present the design of a mitigation scheme for jamming attacks integrated to the routing protocols MPH, AODV, and DSR. The resulting protocols are named MPH-M (Multi-Parent Hierarchical - Modified), AODV-M (Ad hoc On Demand Distance Vector - Modified), and DSR-M (Dynamic Source Routing - Modified). For the mitigation algorithm, if the detection algorithm running locally in each node produces a positive result then the node is isolated; second, the routing protocol adapts their paths avoiding the isolated nodes. We evaluated how jamming attacks affect different metrics for all these modified protocols. The metrics we employ to detect jamming attack are number of packet retransmissions, number of CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) retries while waiting for an idle channel and the energy wasted by the node. The metrics to evaluate the performance of the modified routing protocols are the throughput and resilience of the system and the energy used by the nodes. We evaluated all the modified protocols when the attacker position was set near, middle and far of the collector node. The results of our evaluation show that performance for MPH-M is much better than AODV-M and DSR-M. For example, the node energy for MPH-M is 138.13% better than AODV-M and 126.07% better than DSR-M. Moreover, we also find that MPH-M benefits much more of the mitigation scheme than AODV-M and DSR-M. For example, the node energy consumption is 34.61% lower for MPH-M and only 3.92% and 3.42% for AODV-M and DSR-M, respectively. On throughput, the MPH protocol presents a packet reception efficiency at the collector node of 16.4% on to AODV and DSR when there is no mitigation mechanism. Moreover, MPH-M has an efficiency greater than 7.7% with respect to AODV-M and DSR-M when there is a mitigation scheme. In addition, we have that with the mitigation mechanism AODV-M and DSR-M do not present noticeable modification. However, MPH-M improves its efficiency by 8.4%. We also measure the resilience of these algorithms from the average packet re-transmissions perspective, and we find that MPH-M has around a 15% lower change rate than AODV-M and DSR-M. The MPH-M recovery time is 5 s faster than AODV-M and 2 s faster than DSR-M.

MPH-M, AODV-M and DSR-M Performance Evaluation under Jamming Attacks

PubMed Central

Del-Valle-Soto, Carolina

2017-01-01

In this work, we present the design of a mitigation scheme for jamming attacks integrated to the routing protocols MPH, AODV, and DSR. The resulting protocols are named MPH-M (Multi-Parent Hierarchical - Modified), AODV-M (Ad hoc On Demand Distance Vector - Modified), and DSR-M (Dynamic Source Routing - Modified). For the mitigation algorithm, if the detection algorithm running locally in each node produces a positive result then the node is isolated; second, the routing protocol adapts their paths avoiding the isolated nodes. We evaluated how jamming attacks affect different metrics for all these modified protocols. The metrics we employ to detect jamming attack are number of packet retransmissions, number of CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) retries while waiting for an idle channel and the energy wasted by the node. The metrics to evaluate the performance of the modified routing protocols are the throughput and resilience of the system and the energy used by the nodes. We evaluated all the modified protocols when the attacker position was set near, middle and far of the collector node. The results of our evaluation show that performance for MPH-M is much better than AODV-M and DSR-M. For example, the node energy for MPH-M is 138.13% better than AODV-M and 126.07% better than DSR-M. Moreover, we also find that MPH-M benefits much more of the mitigation scheme than AODV-M and DSR-M. For example, the node energy consumption is 34.61% lower for MPH-M and only 3.92% and 3.42% for AODV-M and DSR-M, respectively. On throughput, the MPH protocol presents a packet reception efficiency at the collector node of 16.4% on to AODV and DSR when there is no mitigation mechanism. Moreover, MPH-M has an efficiency greater than 7.7% with respect to AODV-M and DSR-M when there is a mitigation scheme. In addition, we have that with the mitigation mechanism AODV-M and DSR-M do not present noticeable modification. However, MPH-M improves its efficiency by 8.4%. We also measure the resilience of these algorithms from the average packet re-transmissions perspective, and we find that MPH-M has around a 15% lower change rate than AODV-M and DSR-M. The MPH-M recovery time is 5 s faster than AODV-M and 2 s faster than DSR-M. PMID:28678180

Right Hemisphere Remapping of Naming Functions Depends on Lesion Size and Location in Poststroke Aphasia

PubMed Central

Skipper-Kallal, Laura M.; Lacey, Elizabeth H.; Xing, Shihui

2017-01-01

The study of language network plasticity following left hemisphere stroke is foundational to the understanding of aphasia recovery and neural plasticity in general. Damage in different language nodes may influence whether local plasticity is possible and whether right hemisphere recruitment is beneficial. However, the relationships of both lesion size and location to patterns of remapping are poorly understood. In the context of a picture naming fMRI task, we tested whether lesion size and location relate to activity in surviving left hemisphere language nodes, as well as homotopic activity in the right hemisphere during covert name retrieval and overt name production. We found that lesion size was positively associated with greater right hemisphere activity during both phases of naming, a pattern that has frequently been suggested but has not previously been clearly demonstrated. During overt naming, lesions in the inferior frontal gyrus led to deactivation of contralateral frontal areas, while lesions in motor cortex led to increased right motor cortex activity. Furthermore, increased right motor activity related to better naming performance only when left motor cortex was lesioned, suggesting compensatory takeover of speech or language function by the homotopic node. These findings demonstrate that reorganization of language function, and the degree to which reorganization facilitates aphasia recovery, is dependent on the size and site of the lesion. PMID:28168061

An SEU immune logic family

NASA Technical Reports Server (NTRS)

Canaris, J.

1991-01-01

A new logic family, which is immune to single event upsets, is described. Members of the logic family are capable of recovery, regardless of the shape of the upsetting event. Glitch propagation from an upset node is also blocked. Logic diagrams for an Inverter, Nor, Nand, and Complex Gates are provided. The logic family can be implemented in a standard, commercial CMOS process with no additional masks. DC, transient, static power, upset recovery and layout characteristics of the new family, based on a commercial 1 micron CMOS N-Well process, are described.

Resource utilization model for the algorithm to architecture mapping model

NASA Technical Reports Server (NTRS)

Stoughton, John W.; Patel, Rakesh R.

1993-01-01

The analytical model for resource utilization and the variable node time and conditional node model for the enhanced ATAMM model for a real-time data flow architecture are presented in this research. The Algorithm To Architecture Mapping Model, ATAMM, is a Petri net based graph theoretic model developed at Old Dominion University, and is capable of modeling the execution of large-grained algorithms on a real-time data flow architecture. Using the resource utilization model, the resource envelope may be obtained directly from a given graph and, consequently, the maximum number of required resources may be evaluated. The node timing diagram for one iteration period may be obtained using the analytical resource envelope. The variable node time model, which describes the change in resource requirement for the execution of an algorithm under node time variation, is useful to expand the applicability of the ATAMM model to heterogeneous architectures. The model also describes a method of detecting the presence of resource limited mode and its subsequent prevention. Graphs with conditional nodes are shown to be reduced to equivalent graphs with time varying nodes and, subsequently, may be analyzed using the variable node time model to determine resource requirements. Case studies are performed on three graphs for the illustration of applicability of the analytical theories.

Telmisartan Therapy Does Not Improve Lymph Node or Adipose Tissue Fibrosis More Than Continued Antiretroviral Therapy Alone.

PubMed

Utay, Netanya S; Kitch, Douglas W; Yeh, Eunice; Fichtenbaum, Carl J; Lederman, Michael M; Estes, Jacob D; Deleage, Claire; Magyar, Clara; Nelson, Scott D; Klingman, Karen L; Bastow, Barbara; Luque, Amneris E; McComsey, Grace A; Douek, Daniel C; Currier, Judith S; Lake, Jordan E

2018-05-05

Fibrosis in lymph nodes may limit CD4+ T-cell recovery, and lymph node and adipose tissue fibrosis may contribute to inflammation and comorbidities despite antiretroviral therapy (ART). We hypothesized that the angiotensin receptor blocker and peroxisome proliferator-activated receptor γ agonist telmisartan would decrease lymph node or adipose tissue fibrosis in treated human immunodeficiency virus type 1 (HIV) infection. In this 48-week, randomized, controlled trial, adults continued HIV-suppressive ART and received telmisartan or no drug. Collagen I, fibronectin, and phosphorylated SMAD3 (pSMAD3) deposition in lymph nodes, as well as collagen I, collagen VI, and fibronectin deposition in adipose tissue, were quantified by immunohistochemical analysis at weeks 0 and 48. Two-sided rank sum and signed rank tests compared changes over 48 weeks. Forty-four participants enrolled; 35 had paired adipose tissue specimens, and 29 had paired lymph node specimens. The median change overall in the percentage of the area throughout which collagen I was deposited was -2.6 percentage points (P = 0.08) in lymph node specimens and -1.3 percentage points (P = .001) in adipose tissue specimens, with no between-arm differences. In lymph node specimens, pSMAD3 deposition changed by -0.5 percentage points overall (P = .04), with no between-arm differences. Telmisartan attenuated increases in fibronectin deposition (P = .06). In adipose tissue, changes in collagen VI deposition (-1.0 percentage point; P = .001) and fibronectin deposition (-2.4 percentage points; P < .001) were observed, with no between-arm differences. In adults with treated HIV infection, lymph node and adipose tissue fibrosis decreased with continued ART alone, with no additional fibrosis reduction with telmisartan therapy.

Complex Network Simulation of Forest Network Spatial Pattern in Pearl River Delta

NASA Astrophysics Data System (ADS)

Zeng, Y.

2017-09-01

Forest network-construction uses for the method and model with the scale-free features of complex network theory based on random graph theory and dynamic network nodes which show a power-law distribution phenomenon. The model is suitable for ecological disturbance by larger ecological landscape Pearl River Delta consistent recovery. Remote sensing and GIS spatial data are available through the latest forest patches. A standard scale-free network node distribution model calculates the area of forest network's power-law distribution parameter value size; The recent existing forest polygons which are defined as nodes can compute the network nodes decaying index value of the network's degree distribution. The parameters of forest network are picked up then make a spatial transition to GIS real world models. Hence the connection is automatically generated by minimizing the ecological corridor by the least cost rule between the near nodes. Based on scale-free network node distribution requirements, select the number compared with less, a huge point of aggregation as a future forest planning network's main node, and put them with the existing node sequence comparison. By this theory, the forest ecological projects in the past avoid being fragmented, scattered disorderly phenomena. The previous regular forest networks can be reduced the required forest planting costs by this method. For ecological restoration of tropical and subtropical in south China areas, it will provide an effective method for the forest entering city project guidance and demonstration with other ecological networks (water, climate network, etc.) for networking a standard and base datum.

Data driven CAN node reliability assessment for manufacturing system

NASA Astrophysics Data System (ADS)

Zhang, Leiming; Yuan, Yong; Lei, Yong

2017-01-01

The reliability of the Controller Area Network(CAN) is critical to the performance and safety of the system. However, direct bus-off time assessment tools are lacking in practice due to inaccessibility of the node information and the complexity of the node interactions upon errors. In order to measure the mean time to bus-off(MTTB) of all the nodes, a novel data driven node bus-off time assessment method for CAN network is proposed by directly using network error information. First, the corresponding network error event sequence for each node is constructed using multiple-layer network error information. Then, the generalized zero inflated Poisson process(GZIP) model is established for each node based on the error event sequence. Finally, the stochastic model is constructed to predict the MTTB of the node. The accelerated case studies with different error injection rates are conducted on a laboratory network to demonstrate the proposed method, where the network errors are generated by a computer controlled error injection system. Experiment results show that the MTTB of nodes predicted by the proposed method agree well with observations in the case studies. The proposed data driven node time to bus-off assessment method for CAN networks can successfully predict the MTTB of nodes by directly using network error event data.

Long-Term Effects of Atrial Ganglionated Plexi Ablation on Function and Structure of Sinoatrial and Atrioventricular Node in Canine.

PubMed

Zhang, Ming; Wang, Ximin; Xie, Xinxing; Wang, Zhongsu; Liu, Xiaoyan; Guan, Juan; Wang, Weizong; Li, Zhan; Wang, Jiangrong; Gao, Mei; Hou, Yinglong

2015-10-01

Long-term effects of ganglionated plexi (GP) ablation on sinoatrial node (SAN) and atrioventricular node (AVN) remain unclear. This study is to investigate the long-term effects of ablation of cardiac anterior right GP (ARGP) and inferior right GP (IRGP) on function and structure of SAN and AVN in canine. Thirty-two dogs were randomly divided into an operated group (n = 24) and sham-operated group (n = 8). ARGP and IRGP were ablated in operated group which was randomly divided into three subgroups according to the period of evaluation after operation (1 month, 6 months, 12 months). The functional and histological characteristics of SAN and AVN, as well as the expression of connexin (Cx) 43 and Cx 45 in SAN and AVN, were evaluated before and after ablation. Resting heart rate was increased and AVN effective refractory period was prolonged and sinus node recovery time (SNRT) and corrected SNRT were shortened immediately after ablation. These changes were reverted to preablation level after 1 month. At 1 month, ventricular rate during atrial fibrillation was slowed, atria-His intervals were prolonged, and Cx43 and Cx45 expression in SAN and AVN were downregulated. At 6 months, all changes were reverted to preablation level. The histological characteristics of SAN and AVN did not change. Ablation of ARGP and IRGP has short-term effects on function and structure of SAN and AVN rather than long-term effects, which suggests that ablation of ARGP and IRGP is safe. Atrioventricular conduction dysfunction after ablation may be related to downregulated Cx43 and Cx45 expression in AVN. © 2015 Wiley Periodicals, Inc.

Dynamical jumping real-time fault-tolerant routing protocol for wireless sensor networks.

PubMed

Wu, Guowei; Lin, Chi; Xia, Feng; Yao, Lin; Zhang, He; Liu, Bing

2010-01-01

In time-critical wireless sensor network (WSN) applications, a high degree of reliability is commonly required. A dynamical jumping real-time fault-tolerant routing protocol (DMRF) is proposed in this paper. Each node utilizes the remaining transmission time of the data packets and the state of the forwarding candidate node set to dynamically choose the next hop. Once node failure, network congestion or void region occurs, the transmission mode will switch to jumping transmission mode, which can reduce the transmission time delay, guaranteeing the data packets to be sent to the destination node within the specified time limit. By using feedback mechanism, each node dynamically adjusts the jumping probabilities to increase the ratio of successful transmission. Simulation results show that DMRF can not only efficiently reduce the effects of failure nodes, congestion and void region, but also yield higher ratio of successful transmission, smaller transmission delay and reduced number of control packets.

Prospective computerized analyses of sensibility in breast reconstruction with non-reinnervated DIEP flap.

PubMed

Santanelli, Fabio; Longo, Benedetto; Angelini, Matteo; Laporta, Rosaria; Paolini, Guido

2011-05-01

The deep inferior epigastric perforator (DIEP) flap is considered the definitive standard for autologous breast reconstruction because of its ability to restore shape, its consistency, and its static and dynamic symmetry, but the degree of spontaneous sensory recovery is still widely discussed. To clarify the real need for sensitive nerve coaptation, return of sensibility in DIEP flaps was investigated using a pressure-specifying sensory device. Thirty consecutive patients with breast cancer scheduled for modified radical mastectomy, axillary node dissection, and immediate reconstruction with cutaneous-adipose DIEP flaps without nerve repair were enrolled in the study. Sensibility for one and two points, static and moving, was tested preoperatively on the breasts and abdomen, and postoperatively at 6 and 12 months on the DIEP flaps. A t test was used for comparison of paired data and to investigate which factors affected sensory recovery. Preoperative healthy breast and abdomen pressure thresholds were lower for two-point than one-point discrimination and for moving discriminations compared with static ones at 6 and 12 months. Although they were significantly higher than those for contralateral healthy breasts (p < 0.05), pressure thresholds in DIEP flaps at 12 months were lower than at 6 months, showing a significant progressive sensory recovery (p < 0.05). At 12 months postoperatively, the best sensibility recovery was found at the inferior lateral quadrant, the worst at the superior medial quadrant. Age and flap weight were factors related to the performance of sensory recovery. DIEP flap transfer for immediate breast reconstruction undergoes satisfactory progressive spontaneous sensitive recovery at 6 and 12 months after surgery, and operative time spent dissecting sensitive perforator branches and their coaptation in recipient site could be spared.

Implementation of bipartite or remote unitary gates with repeater nodes

NASA Astrophysics Data System (ADS)

Yu, Li; Nemoto, Kae

2016-08-01

We propose some protocols to implement various classes of bipartite unitary operations on two remote parties with the help of repeater nodes in-between. We also present a protocol to implement a single-qubit unitary with parameters determined by a remote party with the help of up to three repeater nodes. It is assumed that the neighboring nodes are connected by noisy photonic channels, and the local gates can be performed quite accurately, while the decoherence of memories is significant. A unitary is often a part of a larger computation or communication task in a quantum network, and to reduce the amount of decoherence in other systems of the network, we focus on the goal of saving the total time for implementing a unitary including the time for entanglement preparation. We review some previously studied protocols that implement bipartite unitaries using local operations and classical communication and prior shared entanglement, and apply them to the situation with repeater nodes without prior entanglement. We find that the protocols using piecewise entanglement between neighboring nodes often require less total time compared to preparing entanglement between the two end nodes first and then performing the previously known protocols. For a generic bipartite unitary, as the number of repeater nodes increases, the total time could approach the time cost for direct signal transfer from one end node to the other. We also prove some lower bounds of the total time when there are a small number of repeater nodes. The application to position-based cryptography is discussed.

Comparison of the recovery of Mycobacterium bovis isolates using the BACTEC MGIT 960 system, BACTEC 460 system, and Middlebrook 7H10 and 7H11 solid media.

PubMed

Hines, Nichole; Payeur, Janet B; Hoffman, Lorraine J

2006-05-01

The BACTEC Microbacteria Growth Indicator Tube (MGIT) 960 system was evaluated to determine how it compares with the BACTEC 460 radiometric system and solid media for recovery of Mycobacterium bovis from tissue samples. A total of 506 bovine lymph node samples were collected from abattoirs in the United States and Mexico between November 2003 and September 2004. Processed samples were inoculated into an MGIT 960 tube, BACTEC 460 vial, and Middlebrook 7H10 and Middlebrook 7H11 solid media. Ziehl-Neelsen slides were prepared to check for contaminants and confirm the presence of acid-fast positive bacilli. Samples containing acid-fast bacilli were confirmed as members of the Mycobacterium tuberculosis complex by a nucleic acid assay. Niacin and nitrate biochemical tests were used to distinguish M. bovis from M. tuberculosis isolates. Statistical analyses were performed to compare recovery rate, mean time to detection, contamination rates, as well as pair-wise comparisons in each category. The results showed that the MGIT 960 system had a higher recovery rate of M. bovis (122/129) than did the BACTEC 460 (102/129) and solid media system (96/129). The average time to detection was 15.8 days for the MGIT 960 system, 28.2 days for the BACTEC 460 system, and 43.4 days for solid media. Contamination rates were 6.9% for the MGIT 960 system, 3.4% for the BACTEC 460 system, and 21.7% for solid media. These results indicate the MGIT 960 system can be used as an alternative to the BACTEC 460 system for recovering M. bovis from tissue samples.

Determining a bisection bandwidth for a multi-node data communications network

DOEpatents

Faraj, Ahmad A.

2010-01-26

Methods, systems, and products are disclosed for determining a bisection bandwidth for a multi-node data communications network that include: partitioning nodes in the network into a first sub-network and a second sub-network in dependence upon a topology of the network; sending, by each node in the first sub-network to a destination node in the second sub-network, a first message having a predetermined message size; receiving, by each node in the first sub-network from a source node in the second sub-network, a second message; measuring, by each node in the first sub-network, the elapsed communications time between the sending of the first message and the receiving of the second message; selecting the longest elapsed communications time; and calculating the bisection bandwidth for the network in dependence upon the number of the nodes in the first sub-network, the predetermined message size of the first test message, and the longest elapsed communications time.

International Space Station (ISS)

NASA Image and Video Library

2000-01-01

This diagram shows the flow of water recovery and management in the International Space Station (ISS). The Environmental Control and Life Support System (ECLSS) Group of the Flight Projects Directorate at the Marshall Space Flight Center is responsible for the regenerative ECLSS hardware, as well as providing technical support for the rest of the system. The regenerative ECLSS, whose main components are the Water Recovery System (WRS), and the Oxygen Generation System (OGS), reclaims and recycles water oxygen. The ECLSS maintains a pressurized habitation environment, provides water recovery and storage, maintains and provides fire detection/ suppression, and provides breathable air and a comfortable atmosphere in which to live and work within the ISS. The ECLSS hardware will be located in the Node 3 module of the ISS.

Evidence based medicine and surgical approaches for colon cancer: evidences, benefits and limitations of the laparoscopic vs open resection.

PubMed

Lorenzon, Laura; La Torre, Marco; Ziparo, Vincenzo; Montebelli, Francesco; Mercantini, Paolo; Balducci, Genoveffa; Ferri, Mario

2014-04-07

To report a meta-analysis of the studies that compared the laparoscopic with the open approach for colon cancer resection. Forty-seven manuscripts were reviewed, 33 of which employed for meta-analysis according to the PRISMA guidelines. The results were differentiated according to the study design (prospective randomized trials vs case-control series) and according to the tumor's location. Outcome measures included: (1) short-term results (operating times, blood losses, bowel function recovery, post-operative pain, return to the oral intake, complications and hospital stay); (2) oncological adequateness (number of nodes harvested in the surgical specimens); and (3) long-term results (including the survivals' rates and incidence of incisional hernias) and (4) costs. Meta-analysis of trials provided evidences in support of the laparoscopic procedures for a several short-term outcomes including: a lower blood loss, an earlier recovery of the bowel function, an earlier return to the oral intake, a shorter hospital stay and a lower morbidity rate. Opposite the operating time has been confirmed shorter in open surgery. The same trend has been reported investigating case-control series and cancer by sites, even though there are some concerns regarding the power of the studies in this latter field due to the small number of trials and the small sample of patients enrolled. The two approaches were comparable regarding the mean number of nodes harvested and long-term results, even though these variables were documented reviewing the literature but were not computable for meta-analysis. The analysis of the costs documented lower costs for the open surgery, however just few studies investigated the incidence of post-operative hernias. Laparoscopy is superior for the majority of short-term results. Future studies should better differentiate these approaches on the basis of tumors' location and the post-operative hernias.

Is preoperative physical activity related to post-surgery recovery? A cohort study of patients with breast cancer.

PubMed

Nilsson, Hanna; Angerås, Ulf; Bock, David; Börjesson, Mats; Onerup, Aron; Fagevik Olsen, Monika; Gellerstedt, Martin; Haglind, Eva; Angenete, Eva

2016-01-14

The aim of our study is to assess the association between preoperative level of activity and recovery after breast cancer surgery measured as hospital stay, length of sick leave and self-assessed physical and mental recovery. A prospective cohort study. Patients included were those scheduled to undergo breast cancer surgery, between February and November 2013, at two participating hospitals in the Western Region of Sweden. Patients planned for breast cancer surgery filled out a questionnaire before, as well as at 3 and 6 weeks after the operation. The preoperative level of activity was self-assessed and categorised into four categories by the participants using the 4-level Saltin-Grimby Physical Activity Level Scale (SGPALS). Our main outcome was postoperative recovery measured as length of sick leave, in-hospital stay and self-assessed physical and mental recovery. 220 patients were included. Preoperatively, 14% (31/220) of participants assessed themselves to be physically inactive, 61% (135/220) to exert some light physical activity (PA) and 20% (43/220) to be more active (level 3+4). Patients operated with mastectomy versus partial mastectomy and axillary lymph node dissection versus sentinel node biopsy were less likely to have a short hospital stay, relative risk (RR) 0.88 (0.78 to 1.00) and 0.82 (0.70 to 0.96). More active participants (level 3 or 4) had an 85% increased chance of feeling physically recovered at 3 weeks after the operation, RR 1.85 (1.20 to 2.85). No difference was seen after 6 weeks. The above study shows that a higher preoperative level of PA is associated with a faster physical recovery as reported by the patients 3 weeks post breast cancer surgery. After 6 weeks, most patients felt physically recovered, diminishing the association above. No difference was seen in length of sick leave or self-assessed mental recovery between inactive or more active patients. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/

Is preoperative physical activity related to post-surgery recovery? A cohort study of patients with breast cancer

PubMed Central

Nilsson, Hanna; Angerås, Ulf; Bock, David; Börjesson, Mats; Onerup, Aron; Fagevik Olsen, Monika; Gellerstedt, Martin; Haglind, Eva; Angenete, Eva

2016-01-01

Objective The aim of our study is to assess the association between preoperative level of activity and recovery after breast cancer surgery measured as hospital stay, length of sick leave and self-assessed physical and mental recovery. Design A prospective cohort study. Setting Patients included were those scheduled to undergo breast cancer surgery, between February and November 2013, at two participating hospitals in the Western Region of Sweden. Participants Patients planned for breast cancer surgery filled out a questionnaire before, as well as at 3 and 6 weeks after the operation. The preoperative level of activity was self-assessed and categorised into four categories by the participants using the 4-level Saltin-Grimby Physical Activity Level Scale (SGPALS). Main outcome measure Our main outcome was postoperative recovery measured as length of sick leave, in-hospital stay and self-assessed physical and mental recovery. Results 220 patients were included. Preoperatively, 14% (31/220) of participants assessed themselves to be physically inactive, 61% (135/220) to exert some light physical activity (PA) and 20% (43/220) to be more active (level 3+4). Patients operated with mastectomy versus partial mastectomy and axillary lymph node dissection versus sentinel node biopsy were less likely to have a short hospital stay, relative risk (RR) 0.88 (0.78 to 1.00) and 0.82 (0.70 to 0.96). More active participants (level 3 or 4) had an 85% increased chance of feeling physically recovered at 3 weeks after the operation, RR 1.85 (1.20 to 2.85). No difference was seen after 6 weeks. Conclusions The above study shows that a higher preoperative level of PA is associated with a faster physical recovery as reported by the patients 3 weeks post breast cancer surgery. After 6 weeks, most patients felt physically recovered, diminishing the association above. No difference was seen in length of sick leave or self-assessed mental recovery between inactive or more active patients. PMID:26769776

Uncovering hidden nodes in complex networks in the presence of noise

PubMed Central

Su, Ri-Qi; Lai, Ying-Cheng; Wang, Xiao; Do, Younghae

2014-01-01

Ascertaining the existence of hidden objects in a complex system, objects that cannot be observed from the external world, not only is curiosity-driven but also has significant practical applications. Generally, uncovering a hidden node in a complex network requires successful identification of its neighboring nodes, but a challenge is to differentiate its effects from those of noise. We develop a completely data-driven, compressive-sensing based method to address this issue by utilizing complex weighted networks with continuous-time oscillatory or discrete-time evolutionary-game dynamics. For any node, compressive sensing enables accurate reconstruction of the dynamical equations and coupling functions, provided that time series from this node and all its neighbors are available. For a neighboring node of the hidden node, this condition cannot be met, resulting in abnormally large prediction errors that, counterintuitively, can be used to infer the existence of the hidden node. Based on the principle of differential signal, we demonstrate that, when strong noise is present, insofar as at least two neighboring nodes of the hidden node are subject to weak background noise only, unequivocal identification of the hidden node can be achieved. PMID:24487720

Potential for bias and low precision in molecular divergence time estimation of the Canopy of Life: an example from aquatic bird families

PubMed Central

van Tuinen, Marcel; Torres, Christopher R.

2015-01-01

Uncertainty in divergence time estimation is frequently studied from many angles but rarely from the perspective of phylogenetic node age. If appropriate molecular models and fossil priors are used, a multi-locus, partitioned analysis is expected to equally minimize error in accuracy and precision across all nodes of a given phylogeny. In contrast, if available models fail to completely account for rate heterogeneity, substitution saturation and incompleteness of the fossil record, uncertainty in divergence time estimation may increase with node age. While many studies have stressed this concern with regard to deep nodes in the Tree of Life, the inference that molecular divergence time estimation of shallow nodes is less sensitive to erroneous model choice has not been tested explicitly in a Bayesian framework. Because of available divergence time estimation methods that permit fossil priors across any phylogenetic node and the present increase in efficient, cheap collection of species-level genomic data, insight is needed into the performance of divergence time estimation of shallow (<10 MY) nodes. Here, we performed multiple sensitivity analyses in a multi-locus data set of aquatic birds with six fossil constraints. Comparison across divergence time analyses that varied taxon and locus sampling, number and position of fossil constraint and shape of prior distribution showed various insights. Deviation from node ages obtained from a reference analysis was generally highest for the shallowest nodes but determined more by temporal placement than number of fossil constraints. Calibration with only the shallowest nodes significantly underestimated the aquatic bird fossil record, indicating the presence of saturation. Although joint calibration with all six priors yielded ages most consistent with the fossil record, ages of shallow nodes were overestimated. This bias was found in both mtDNA and nDNA regions. Thus, divergence time estimation of shallow nodes may suffer from bias and low precision, even when appropriate fossil priors and best available substitution models are chosen. Much care must be taken to address the possible ramifications of substitution saturation across the entire Tree of Life. PMID:26106406

A subchronic inhalation toxicity study in rats exposed to silicon carbide whiskers.

PubMed

Lapin, C A; Craig, D K; Valerio, M G; McCandless, J B; Bogoroch, R

1991-01-01

To determine whether inhaled silicon carbide whiskers (SiC) cause lung damage in rats, four groups (50 males/50 females each) of rats were exposed to air only or to one of three concentrations of SiC 6 hr/day, 5 days/week for 13 weeks. Half (25 males/25 females/group) were euthanized at the end of exposure, the remainder 26 weeks later. Mean concentrations were 0, 630, 1746, and 7276 SiC whiskers/ml (0.09, 3.93, 10.7, and 60.5 mg/m3). Although there were no concentration-related changes in body weight, clinical chemistry, or hematological data attributable to SiC, lung weights were increased in the high concentration exposure group at both euthanization times. In all whisker-exposed groups, after 13 weeks of exposure, the incidence of the following lung and lymph node lesions was higher than in controls: inflammatory lesions; bronchiolar, alveolar, and pleural wall thickening; focal pleural fibrosis in lung; and reactive lymphoid hyperplasia in bronchial and mediastinal lymph nodes. After 26 weeks of recovery, lung inflammatory lesions had decreased and fewer rats had enlarged lymph nodes, but the incidence of alveolar wall thickening, focal pleural wall thickening, and adenomatous hyperplasia of lung had increased further. Incidence and severity appeared to be dose-related. Therefore, until longer term studies are undertaken and it is established whether the above observed lesions will progress to more severe pathological entities, it is prudent to adopt stringent handling procedures for silicon carbide whiskers.

A Stochastic Inversion Method for Potential Field Data: Ant Colony Optimization

NASA Astrophysics Data System (ADS)

Liu, Shuang; Hu, Xiangyun; Liu, Tianyou

2014-07-01

Simulating natural ants' foraging behavior, the ant colony optimization (ACO) algorithm performs excellently in combinational optimization problems, for example the traveling salesman problem and the quadratic assignment problem. However, the ACO is seldom used to inverted for gravitational and magnetic data. On the basis of the continuous and multi-dimensional objective function for potential field data optimization inversion, we present the node partition strategy ACO (NP-ACO) algorithm for inversion of model variables of fixed shape and recovery of physical property distributions of complicated shape models. We divide the continuous variables into discrete nodes and ants directionally tour the nodes by use of transition probabilities. We update the pheromone trails by use of Gaussian mapping between the objective function value and the quantity of pheromone. It can analyze the search results in real time and promote the rate of convergence and precision of inversion. Traditional mapping, including the ant-cycle system, weaken the differences between ant individuals and lead to premature convergence. We tested our method by use of synthetic data and real data from scenarios involving gravity and magnetic anomalies. The inverted model variables and recovered physical property distributions were in good agreement with the true values. The ACO algorithm for binary representation imaging and full imaging can recover sharper physical property distributions than traditional linear inversion methods. The ACO has good optimization capability and some excellent characteristics, for example robustness, parallel implementation, and portability, compared with other stochastic metaheuristics.

Field test of a practical secure communication network with decoy-state quantum cryptography.

PubMed

Chen, Teng-Yun; Liang, Hao; Liu, Yang; Cai, Wen-Qi; Ju, Lei; Liu, Wei-Yue; Wang, Jian; Yin, Hao; Chen, Kai; Chen, Zeng-Bing; Peng, Cheng-Zhi; Pan, Jian-Wei

2009-04-13

We present a secure network communication system that operated with decoy-state quantum cryptography in a real-world application scenario. The full key exchange and application protocols were performed in real time among three nodes, in which two adjacent nodes were connected by approximate 20 km of commercial telecom optical fiber. The generated quantum keys were immediately employed and demonstrated for communication applications, including unbreakable real-time voice telephone between any two of the three communication nodes, or a broadcast from one node to the other two nodes by using one-time pad encryption.

Simultaneous mapping of pan and sentinel lymph nodes for real-time image-guided surgery.

PubMed

Ashitate, Yoshitomo; Hyun, Hoon; Kim, Soon Hee; Lee, Jeong Heon; Henary, Maged; Frangioni, John V; Choi, Hak Soo

2014-01-01

The resection of regional lymph nodes in the basin of a primary tumor is of paramount importance in surgical oncology. Although sentinel lymph node mapping is now the standard of care in breast cancer and melanoma, over 20% of patients require a completion lymphadenectomy. Yet, there is currently no technology available that can image all lymph nodes in the body in real time, or assess both the sentinel node and all nodes simultaneously. In this study, we report an optical fluorescence technology that is capable of simultaneous mapping of pan lymph nodes (PLNs) and sentinel lymph nodes (SLNs) in the same subject. We developed near-infrared fluorophores, which have fluorescence emission maxima either at 700 nm or at 800 nm. One was injected intravenously for identification of all regional lymph nodes in a basin, and the other was injected locally for identification of the SLN. Using the dual-channel FLARE intraoperative imaging system, we could identify and resect all PLNs and SLNs simultaneously. The technology we describe enables simultaneous, real-time visualization of both PLNs and SLNs in the same subject.

Data-based reconstruction of complex geospatial networks, nodal positioning and detection of hidden nodes

PubMed Central

Su, Ri-Qi; Wang, Wen-Xu; Wang, Xiao; Lai, Ying-Cheng

2016-01-01

Given a complex geospatial network with nodes distributed in a two-dimensional region of physical space, can the locations of the nodes be determined and their connection patterns be uncovered based solely on data? We consider the realistic situation where time series/signals can be collected from a single location. A key challenge is that the signals collected are necessarily time delayed, due to the varying physical distances from the nodes to the data collection centre. To meet this challenge, we develop a compressive-sensing-based approach enabling reconstruction of the full topology of the underlying geospatial network and more importantly, accurate estimate of the time delays. A standard triangularization algorithm can then be employed to find the physical locations of the nodes in the network. We further demonstrate successful detection of a hidden node (or a hidden source or threat), from which no signal can be obtained, through accurate detection of all its neighbouring nodes. As a geospatial network has the feature that a node tends to connect with geophysically nearby nodes, the localized region that contains the hidden node can be identified. PMID:26909187

Increasing the Lifetime of Mobile WSNs via Dynamic Optimization of Sensor Node Communication Activity

PubMed Central

Guimarães, Dayan Adionel; Sakai, Lucas Jun; Alberti, Antonio Marcos; de Souza, Rausley Adriano Amaral

2016-01-01

In this paper, a simple and flexible method for increasing the lifetime of fixed or mobile wireless sensor networks is proposed. Based on past residual energy information reported by the sensor nodes, the sink node or another central node dynamically optimizes the communication activity levels of the sensor nodes to save energy without sacrificing the data throughput. The activity levels are defined to represent portions of time or time-frequency slots in a frame, during which the sensor nodes are scheduled to communicate with the sink node to report sensory measurements. Besides node mobility, it is considered that sensors’ batteries may be recharged via a wireless power transmission or equivalent energy harvesting scheme, bringing to the optimization problem an even more dynamic character. We report large increased lifetimes over the non-optimized network and comparable or even larger lifetime improvements with respect to an idealized greedy algorithm that uses both the real-time channel state and the residual energy information. PMID:27657075

Increasing the Lifetime of Mobile WSNs via Dynamic Optimization of Sensor Node Communication Activity.

PubMed

Guimarães, Dayan Adionel; Sakai, Lucas Jun; Alberti, Antonio Marcos; de Souza, Rausley Adriano Amaral

2016-09-20

In this paper, a simple and flexible method for increasing the lifetime of fixed or mobile wireless sensor networks is proposed. Based on past residual energy information reported by the sensor nodes, the sink node or another central node dynamically optimizes the communication activity levels of the sensor nodes to save energy without sacrificing the data throughput. The activity levels are defined to represent portions of time or time-frequency slots in a frame, during which the sensor nodes are scheduled to communicate with the sink node to report sensory measurements. Besides node mobility, it is considered that sensors' batteries may be recharged via a wireless power transmission or equivalent energy harvesting scheme, bringing to the optimization problem an even more dynamic character. We report large increased lifetimes over the non-optimized network and comparable or even larger lifetime improvements with respect to an idealized greedy algorithm that uses both the real-time channel state and the residual energy information.

Acquired toxoplasmosis of a submandibular lymph node in a 9-year-old boy diagnosed by fine-needle aspiration cytology.

PubMed

Macey-Dare, L V; Kocjan, G; Goodman, J R

1996-12-01

Toxoplasmosis is a parasitic infection which may be asymptomatic or produce lymphadenopathy, fever and malaise. In children the cervical lymph nodes are most commonly affected. This report describes a case of a 9-year-old boy who presented with submandibular lymphadenopathy associated with a non-vital primary tooth, which persisted following extraction of the tooth. A diagnosis of acquired toxoplasmosis was made on the findings of fine-needle aspiration cytology and subsequently confirmed by serological investigations, thus sparing the patient unnecessary hospitalization and surgery. The patient required amitryptyline as a nocturnal sedative and made a complete recovery within a few months without the need for further intervention.

Hysteresis in coral reefs under macroalgal toxicity and overfishing.

PubMed

Bhattacharyya, Joydeb; Pal, Samares

2015-03-01

Macroalgae and corals compete for the available space in coral reef ecosystems.While herbivorous reef fish play a beneficial role in decreasing the growth of macroalgae, macroalgal toxicity and overfishing of herbivores leads to proliferation of macroalgae. The abundance of macroalgae changes the community structure towards a macroalgae-dominated reef ecosystem. We investigate coral-macroalgal phase shifts by means of a continuous time model in a food chain. Conditions for local asymptotic stability of steady states are derived. It is observed that in the presence of macroalgal toxicity and overfishing, the system exhibits hysteresis through saddle-node bifurcation and transcritical bifurcation. We examine the effects of time lags in the liberation of toxins by macroalgae and the recovery of algal turf in response to grazing of herbivores on macroalgae by performing equilibrium and stability analyses of delay-differential forms of the ODE model. Computer simulations have been carried out to illustrate the different analytical results.

Distributive, Non-destructive Real-time System and Method for Snowpack Monitoring

NASA Technical Reports Server (NTRS)

Frolik, Jeff (Inventor); Skalka, Christian (Inventor)

2013-01-01

A ground-based system that provides quasi real-time measurement and collection of snow-water equivalent (SWE) data in remote settings is provided. The disclosed invention is significantly less expensive and easier to deploy than current methods and less susceptible to terrain and snow bridging effects. Embodiments of the invention include remote data recovery solutions. Compared to current infrastructure using existing SWE technology, the disclosed invention allows more SWE sites to be installed for similar cost and effort, in a greater variety of terrain; thus, enabling data collection at improved spatial resolutions. The invention integrates a novel computational architecture with new sensor technologies. The invention's computational architecture is based on wireless sensor networks, comprised of programmable, low-cost, low-powered nodes capable of sophisticated sensor control and remote data communication. The invention also includes measuring attenuation of electromagnetic radiation, an approach that is immune to snow bridging and significantly reduces sensor footprints.

Human Performance on Visually Presented Traveling Salesperson Problems with Varying Numbers of Nodes

ERIC Educational Resources Information Center

Dry, Matthew; Lee, Michael D.; Vickers, Douglas; Hughes, Peter

2006-01-01

We investigated the properties of the distribution of human solution times for Traveling Salesperson Problems (TSPs) with increasing numbers of nodes. New experimental data are presented that measure solution times for carefully chosen representative problems with 10, 20, . . . 120 nodes. We compared the solution times predicted by the convex hull…

Scalable asynchronous execution of cellular automata

NASA Astrophysics Data System (ADS)

Folino, Gianluigi; Giordano, Andrea; Mastroianni, Carlo

2016-10-01

The performance and scalability of cellular automata, when executed on parallel/distributed machines, are limited by the necessity of synchronizing all the nodes at each time step, i.e., a node can execute only after the execution of the previous step at all the other nodes. However, these synchronization requirements can be relaxed: a node can execute one step after synchronizing only with the adjacent nodes. In this fashion, different nodes can execute different time steps. This can be a notable advantageous in many novel and increasingly popular applications of cellular automata, such as smart city applications, simulation of natural phenomena, etc., in which the execution times can be different and variable, due to the heterogeneity of machines and/or data and/or executed functions. Indeed, a longer execution time at a node does not slow down the execution at all the other nodes but only at the neighboring nodes. This is particularly advantageous when the nodes that act as bottlenecks vary during the application execution. The goal of the paper is to analyze the benefits that can be achieved with the described asynchronous implementation of cellular automata, when compared to the classical all-to-all synchronization pattern. The performance and scalability have been evaluated through a Petri net model, as this model is very useful to represent the synchronization barrier among nodes. We examined the usual case in which the territory is partitioned into a number of regions, and the computation associated with a region is assigned to a computing node. We considered both the cases of mono-dimensional and two-dimensional partitioning. The results show that the advantage obtained through the asynchronous execution, when compared to the all-to-all synchronous approach is notable, and it can be as large as 90% in terms of speedup.

Spider Silk Constructs Enhance Axonal Regeneration and Remyelination in Long Nerve Defects in Sheep

PubMed Central

Radtke, Christine; Allmeling, Christina; Waldmann, Karl-Heinz; Reimers, Kerstin; Thies, Kerstin; Schenk, Henning C.; Hillmer, Anja; Guggenheim, Merlin; Brandes, Gudrun; Vogt, Peter M.

2011-01-01

Background Surgical reapposition of peripheral nerve results in some axonal regeneration and functional recovery, but the clinical outcome in long distance nerve defects is disappointing and research continues to utilize further interventional approaches to optimize functional recovery. We describe the use of nerve constructs consisting of decellularized vein grafts filled with spider silk fibers as a guiding material to bridge a 6.0 cm tibial nerve defect in adult sheep. Methodology/Principal Findings The nerve constructs were compared to autologous nerve grafts. Regeneration was evaluated for clinical, electrophysiological and histological outcome. Electrophysiological recordings were obtained at 6 months and 10 months post surgery in each group. Ten months later, the nerves were removed and prepared for immunostaining, electrophysiological and electron microscopy. Immunostaining for sodium channel (NaV 1.6) was used to define nodes of Ranvier on regenerated axons in combination with anti-S100 and neurofilament. Anti-S100 was used to identify Schwann cells. Axons regenerated through the constructs and were myelinated indicating migration of Schwann cells into the constructs. Nodes of Ranvier between myelin segments were observed and identified by intense sodium channel (NaV 1.6) staining on the regenerated axons. There was no significant difference in electrophysiological results between control autologous experimental and construct implantation indicating that our construct are an effective alternative to autologous nerve transplantation. Conclusions/Significance This study demonstrates that spider silk enhances Schwann cell migration, axonal regrowth and remyelination including electrophysiological recovery in a long-distance peripheral nerve gap model resulting in functional recovery. This improvement in nerve regeneration could have significant clinical implications for reconstructive nerve surgery. PMID:21364921

Clock Agreement Among Parallel Supercomputer Nodes

DOE Data Explorer

Jones, Terry R.; Koenig, Gregory A.

2014-04-30

This dataset presents measurements that quantify the clock synchronization time-agreement characteristics among several high performance computers including the current world's most powerful machine for open science, the U.S. Department of Energy's Titan machine sited at Oak Ridge National Laboratory. These ultra-fast machines derive much of their computational capability from extreme node counts (over 18000 nodes in the case of the Titan machine). Time-agreement is commonly utilized by parallel programming applications and tools, distributed programming application and tools, and system software. Our time-agreement measurements detail the degree of time variance between nodes and how that variance changes over time. The dataset includes empirical measurements and the accompanying spreadsheets.

Low Latency MAC Protocol in Wireless Sensor Networks Using Timing Offset

NASA Astrophysics Data System (ADS)

Choi, Seung Sik

This paper proposes a low latency MAC protocol that can be used in sensor networks. To extend the lifetime of sensor nodes, the conventional solution is to synchronize active/sleep periods of all sensor nodes. However, due to these synchronized sensor nodes, packets in the intermediate nodes must wait until the next node wakes up before it can forward a packet. This induces a large delay in sensor nodes. To solve this latency problem, a clustered sensor network which uses two types of sensor nodes and layered architecture is considered. Clustered heads in each cluster are synchronized with different timing offsets to reduce the sleep delay. Using this concept, the latency problem can be solved and more efficient power usage can be obtained.

Energy efficient sensor scheduling with a mobile sink node for the target tracking application.

PubMed

Maheswararajah, Suhinthan; Halgamuge, Saman; Premaratne, Malin

2009-01-01

Measurement losses adversely affect the performance of target tracking. The sensor network's life span depends on how efficiently the sensor nodes consume energy. In this paper, we focus on minimizing the total energy consumed by the sensor nodes whilst avoiding measurement losses. Since transmitting data over a long distance consumes a significant amount of energy, a mobile sink node collects the measurements and transmits them to the base station. We assume that the default transmission range of the activated sensor node is limited and it can be increased to maximum range only if the mobile sink node is out-side the default transmission range. Moreover, the active sensor node can be changed after a certain time period. The problem is to select an optimal sensor sequence which minimizes the total energy consumed by the sensor nodes. In this paper, we consider two different problems depend on the mobile sink node's path. First, we assume that the mobile sink node's position is known for the entire time horizon and use the dynamic programming technique to solve the problem. Second, the position of the sink node is varied over time according to a known Markov chain, and the problem is solved by stochastic dynamic programming. We also present sub-optimal methods to solve our problem. A numerical example is presented in order to discuss the proposed methods' performance.

Energy Efficient Sensor Scheduling with a Mobile Sink Node for the Target Tracking Application

PubMed Central

Maheswararajah, Suhinthan; Halgamuge, Saman; Premaratne, Malin

2009-01-01

Measurement losses adversely affect the performance of target tracking. The sensor network's life span depends on how efficiently the sensor nodes consume energy. In this paper, we focus on minimizing the total energy consumed by the sensor nodes whilst avoiding measurement losses. Since transmitting data over a long distance consumes a significant amount of energy, a mobile sink node collects the measurements and transmits them to the base station. We assume that the default transmission range of the activated sensor node is limited and it can be increased to maximum range only if the mobile sink node is out-side the default transmission range. Moreover, the active sensor node can be changed after a certain time period. The problem is to select an optimal sensor sequence which minimizes the total energy consumed by the sensor nodes. In this paper, we consider two different problems depend on the mobile sink node's path. First, we assume that the mobile sink node's position is known for the entire time horizon and use the dynamic programming technique to solve the problem. Second, the position of the sink node is varied over time according to a known Markov chain, and the problem is solved by stochastic dynamic programming. We also present sub-optimal methods to solve our problem. A numerical example is presented in order to discuss the proposed methods' performance PMID:22399934

Network robustness assessed within a dual connectivity framework: joint dynamics of the Active and Idle Networks.

PubMed

Tejedor, Alejandro; Longjas, Anthony; Zaliapin, Ilya; Ambroj, Samuel; Foufoula-Georgiou, Efi

2017-08-17

Network robustness against attacks has been widely studied in fields as diverse as the Internet, power grids and human societies. But current definition of robustness is only accounting for half of the story: the connectivity of the nodes unaffected by the attack. Here we propose a new framework to assess network robustness, wherein the connectivity of the affected nodes is also taken into consideration, acknowledging that it plays a crucial role in properly evaluating the overall network robustness in terms of its future recovery from the attack. Specifically, we propose a dual perspective approach wherein at any instant in the network evolution under attack, two distinct networks are defined: (i) the Active Network (AN) composed of the unaffected nodes and (ii) the Idle Network (IN) composed of the affected nodes. The proposed robustness metric considers both the efficiency of destroying the AN and that of building-up the IN. We show, via analysis of well-known prototype networks and real world data, that trade-offs between the efficiency of Active and Idle Network dynamics give rise to surprising robustness crossovers and re-rankings, which can have significant implications for decision making.

[Selective biopsy of the sentinel lymph node in patients with breast cancer and previous excisional biopsy: is there a change in the reliability of the technique according to time from surgery?].

PubMed

Sabaté-Llobera, A; Notta, P C; Benítez-Segura, A; López-Ojeda, A; Pernas-Simon, S; Boya-Román, M P; Bajén, M T

2015-01-01

To assess the influence of time on the reliability of sentinel lymph node biopsy (SLNB) in breast cancer patients with previous excisional biopsy (EB), analyzing both the sentinel lymph node detection and the lymph node recurrence rate. Thirty-six patients with cT1/T2 N0 breast cancer and previous EB of the lesion underwent a lymphoscintigraphy after subdermal periareolar administration of radiocolloid, the day before SLNB. Patients were classified into two groups, one including 12 patients with up to 29 days elapsed between EB and SLNB (group A), and another with the remaining 24 in which time between both procedures was of 30 days or more (group B). Scintigraphic and surgical detection of the sentinel lymph node, histological status of the sentinel lymph node and of the axillary lymph node dissection, if performed, and lymphatic recurrences during follow-up, were analyzed. Sentinel lymph node visualization at the lymphoscintigraphy and surgical detection were 100% in both groups. Histologically, three patients showed macrometastasis in the sentinel lymph node, one from group A and two from group B. None of the patients, not even those with malignancy of the sentinel lymph node, relapsed after a medium follow-up of 49.5 months (24-75). Time elapsed between EB and SLNB does not influence the reliability of this latter technique as long as a superficial injection of the radiopharmaceutical is performed, proving a very high detection rate of the sentinel lymph node without evidence of lymphatic relapse during follow-up. Copyright © 2014 Elsevier España, S.L.U. and SEMNIM. All rights reserved.

Impact of self-healing capability on network robustness

NASA Astrophysics Data System (ADS)

Shang, Yilun

2015-04-01

A wide spectrum of real-life systems ranging from neurons to botnets display spontaneous recovery ability. Using the generating function formalism applied to static uncorrelated random networks with arbitrary degree distributions, the microscopic mechanism underlying the depreciation-recovery process is characterized and the effect of varying self-healing capability on network robustness is revealed. It is found that the self-healing capability of nodes has a profound impact on the phase transition in the emergence of percolating clusters, and that salient difference exists in upholding network integrity under random failures and intentional attacks. The results provide a theoretical framework for quantitatively understanding the self-healing phenomenon in varied complex systems.

Impact of self-healing capability on network robustness.

PubMed

Shang, Yilun

2015-04-01

A wide spectrum of real-life systems ranging from neurons to botnets display spontaneous recovery ability. Using the generating function formalism applied to static uncorrelated random networks with arbitrary degree distributions, the microscopic mechanism underlying the depreciation-recovery process is characterized and the effect of varying self-healing capability on network robustness is revealed. It is found that the self-healing capability of nodes has a profound impact on the phase transition in the emergence of percolating clusters, and that salient difference exists in upholding network integrity under random failures and intentional attacks. The results provide a theoretical framework for quantitatively understanding the self-healing phenomenon in varied complex systems.

Service discovery with routing protocols for MANETs

NASA Astrophysics Data System (ADS)

Gu, Xuemai; Shi, Shuo

2005-11-01

Service discovery is becoming an important topic as its use throughout the Internet becomes more widespread. In Mobile Ad hoc Networks (MANETs), the routing protocol is very important because it is special network. To find a path for data, and destination nodes, nodes send packets to each node, creating substantial overhead traffic and consuming much time. Even though a variety of routing protocols have been developed for use in MANETs, they are insufficient for reducing overhead traffic and time. In this paper, we propose SDRP: a new service discovery protocol combined with routing policies in MANETs. The protocol is performed upon a distributed network. We describe a service by a unique ID number and use a group-cast routing policy in advertisement and request. The group-cast routing policy decreases the traffic in networks, and it is efficient to find destination node. In addition, the nodes included in the reply path also cache the advertisement information, and it means when each node finds a node next time, they can know where it is as soon as possible, so they minimize the time. Finally, we compare SDRP with both Flood and MAODV in terms of overload, and average delay. Simulation results show SDRP can spend less response time and accommodate even high mobility network environments.

Failure and recovery in dynamical networks.

PubMed

Böttcher, L; Luković, M; Nagler, J; Havlin, S; Herrmann, H J

2017-02-03

Failure, damage spread and recovery crucially underlie many spatially embedded networked systems ranging from transportation structures to the human body. Here we study the interplay between spontaneous damage, induced failure and recovery in both embedded and non-embedded networks. In our model the network's components follow three realistic processes that capture these features: (i) spontaneous failure of a component independent of the neighborhood (internal failure), (ii) failure induced by failed neighboring nodes (external failure) and (iii) spontaneous recovery of a component. We identify a metastable domain in the global network phase diagram spanned by the model's control parameters where dramatic hysteresis effects and random switching between two coexisting states are observed. This dynamics depends on the characteristic link length of the embedded system. For the Euclidean lattice in particular, hysteresis and switching only occur in an extremely narrow region of the parameter space compared to random networks. We develop a unifying theory which links the dynamics of our model to contact processes. Our unifying framework may help to better understand controllability in spatially embedded and random networks where spontaneous recovery of components can mitigate spontaneous failure and damage spread in dynamical networks.

Heart Block

MedlinePlus

... to begin a new heartbeat 60 to 100 times a minute. From the SA node, the signal travels through the right and left atria. This causes ... AV node. This slowing allows the ventricles enough time to finish filling with ... leaves the AV node and travels along a pathway called the bundle of His. ...

Rewiring the Brain: Potential Role of the Premotor Cortex in Motor Control, Learning, and Recovery of Function Following Brain Injury

PubMed Central

Kantak, Shailesh S.; Stinear, James W.; Buch, Ethan R.; Cohen, Leonardo G.

2016-01-01

The brain is a plastic organ with a capability to reorganize in response to behavior and/or injury. Following injury to the motor cortex or emergent corticospinal pathways, recovery of function depends on the capacity of surviving anatomical resources to recover and repair in response to task-specific training. One such area implicated in poststroke reorganization to promote recovery of upper extremity recovery is the premotor cortex (PMC). This study reviews the role of distinct subdivisions of PMC: dorsal (PMd) and ventral (PMv) premotor cortices as critical anatomical and physiological nodes within the neural networks for the control and learning of goal-oriented reach and grasp actions in healthy individuals and individuals with stroke. Based on evidence emerging from studies of intrinsic and extrinsic connectivity, transcranial magnetic stimulation, functional neuroimaging, and experimental studies in animals and humans, the authors propose 2 distinct patterns of reorganization that differentially engage ipsilesional and contralesional PMC. Research directions that may offer further insights into the role of PMC in motor control, learning, and poststroke recovery are also proposed. This research may facilitate neuroplasticity for maximal recovery of function following brain injury. PMID:21926382

Sentinel Node Biopsy for the Head and Neck Using Contrast-Enhanced Ultrasonography Combined with Indocyanine Green Fluorescence in Animal Models: A Feasibility Study.

PubMed

Kogashiwa, Yasunao; Sakurai, Hiroyuki; Akimoto, Yoshihiro; Sato, Dai; Ikeda, Tetsuya; Matsumoto, Yoshifumi; Moro, Yorihisa; Kimura, Toru; Hamanoue, Yasuhiro; Nakamura, Takehiro; Yamauchi, Koichi; Saito, Koichiro; Sugasawa, Masashi; Kohno, Naoyuki

2015-01-01

Sentinel node navigation surgery is gaining popularity in oral cancer. We assessed application of sentinel lymph node navigation surgery to pharyngeal and laryngeal cancers by evaluating the combination of contrast-enhanced ultrasonography and indocyanine green fluorescence in animal models. This was a prospective, nonrandomized, experimental study in rabbit and swine animal models. A mixture of indocyanine green and Sonazoid was used as the tracer. The tracer mixture was injected into the tongue, larynx, or pharynx. The sentinel lymph nodes were identified transcutaneously by infra-red camera and contrast-enhanced ultrasonography. Detection time and extraction time of the sentinel lymph nodes were measured. The safety of the tracer mixture in terms of mucosal reaction was evaluated macroscopically and microscopically. Sentinel lymph nodes were detected transcutaneously by contrast-enhanced ultrasonography alone. The number of sentinel lymph nodes detected was one or two. Despite observation of contrast enhancement of Sonazoid for at least 90 minutes, the number of sentinel lymph nodes detected did not change. The average extraction time of sentinel lymph nodes was 4.8 minutes. Indocyanine green fluorescence offered visual information during lymph node biopsy. The safety of the tracer was confirmed by absence of laryngeal edema both macro and microscopically. The combination method of indocyanine green fluorescence and contrast-enhanced ultrasonography for detecting sentinel lymph nodes during surgery for head and neck cancer seems promising, especially for pharyngeal and laryngeal cancer. Further clinical studies to confirm this are warranted.

Locating multiple diffusion sources in time varying networks from sparse observations.

PubMed

Hu, Zhao-Long; Shen, Zhesi; Cao, Shinan; Podobnik, Boris; Yang, Huijie; Wang, Wen-Xu; Lai, Ying-Cheng

2018-02-08

Data based source localization in complex networks has a broad range of applications. Despite recent progress, locating multiple diffusion sources in time varying networks remains to be an outstanding problem. Bridging structural observability and sparse signal reconstruction theories, we develop a general framework to locate diffusion sources in time varying networks based solely on sparse data from a small set of messenger nodes. A general finding is that large degree nodes produce more valuable information than small degree nodes, a result that contrasts that for static networks. Choosing large degree nodes as the messengers, we find that sparse observations from a few such nodes are often sufficient for any number of diffusion sources to be located for a variety of model and empirical networks. Counterintuitively, sources in more rapidly varying networks can be identified more readily with fewer required messenger nodes.

10 % fluorescein sodium vs 1 % isosulfan blue in breast sentinel lymph node biopsy.

PubMed

Ren, Lidong; Liu, Zhao; Liang, Mengdi; Wang, Li; Song, Xingli; Wang, Shui

2016-11-03

Sentinel lymph node biopsy (SLNB) is well accepted to be a standard procedure in breast cancer surgery with clinically negative lymph nodes. Isosulfan blue is the first dye approved by the USA Food and Drug Administration for the localization of the lymphatic system. Few alternative tracers have been investigated. In this study, we aimed to compare the differences between 10 % fluorescein sodium and 1 % isosulfan blue in breast sentinel lymph node biopsy and to investigate the feasibility of using 10 % fluorescein sodium as a new dye for breast sentinel lymph node biopsy. A total of 30 New Zealand rabbits were randomly divided into the fluorescein sodium group and the isosulfan blue group (15 rabbits per group). Fluorescein sodium or isosulfan blue was injected subcutaneously into the second pair of mammary areolas. The average fading time of the second lymph nodes in the isosulfan blue group was significantly shorter than that in the fluorescein sodium group. Moreover, the detection rates of SLNs were higher in the fluorescein sodium group than in the isosulfan blue group. No significant differences between the fluorescein sodium group and isosulfan blue group were observed regarding the distances between the detected sentinel lymph nodes and second pair of mammary areolas, the distances between the second lymph nodes and second pair of mammary areolas, the number of detected sentinel lymph nodes and second lymph nodes, the average dyeing time of the sentinel and the second lymph nodes, and the average fading time of the second lymph nodes. In summary, we first reported that fluorescein sodium is a potential new tracer for breast sentinel lymph node biopsy.

Distributed Time Synchronization Algorithms and Opinion Dynamics

NASA Astrophysics Data System (ADS)

Manita, Anatoly; Manita, Larisa

2018-01-01

We propose new deterministic and stochastic models for synchronization of clocks in nodes of distributed networks. An external accurate time server is used to ensure convergence of the node clocks to the exact time. These systems have much in common with mathematical models of opinion formation in multiagent systems. There is a direct analogy between the time server/node clocks pair in asynchronous networks and the leader/follower pair in the context of social network models.

Short-term memory capacity in networks via the restricted isometry property.

PubMed

Charles, Adam S; Yap, Han Lun; Rozell, Christopher J

2014-06-01

Cortical networks are hypothesized to rely on transient network activity to support short-term memory (STM). In this letter, we study the capacity of randomly connected recurrent linear networks for performing STM when the input signals are approximately sparse in some basis. We leverage results from compressed sensing to provide rigorous nonasymptotic recovery guarantees, quantifying the impact of the input sparsity level, the input sparsity basis, and the network characteristics on the system capacity. Our analysis demonstrates that network memory capacities can scale superlinearly with the number of nodes and in some situations can achieve STM capacities that are much larger than the network size. We provide perfect recovery guarantees for finite sequences and recovery bounds for infinite sequences. The latter analysis predicts that network STM systems may have an optimal recovery length that balances errors due to omission and recall mistakes. Furthermore, we show that the conditions yielding optimal STM capacity can be embodied in several network topologies, including networks with sparse or dense connectivities.

Simulation system of arrhythmia using ActiveX control.

PubMed

Takeuchi, Akihiro; Hirose, Minoru; Hamada, Atsushi; Ikeda, Noriaki

2005-07-01

A simulation system for arrhythmias has been developed using Windows-based software technology, ActiveX control. The cardiac module consists of six cells, the sinus, atrium, AV node, ventricle, and ectopic foci. The physiological properties of the cells, the automaticity and conduction delay, were modelled, respectively, by the phase response curve and the excitability recovery curve. Cell functions were implemented in the ActiveX control and incorporated into the cardiac module. The system draws the ECG sequence as a ladder diagram in real time. The system interactively shows diverse arrhythmias for various user settings of the cell function and bidirectional conduction between the cells. Users are able to experiment virtually by setting up a so-called electrophysiological stimulation. This system is useful for learning and for teaching the interaction between the cells and arrhythmias.

On the mixing time of geographical threshold graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bradonjic, Milan

In this paper, we study the mixing time of random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Wemore » specifically study the mixing times of random walks on 2-dimensional GTGs near the connectivity threshold. We provide a set of criteria on the distribution of vertex weights that guarantees that the mixing time is {Theta}(n log n).« less

Systems and Methods for Locating a Target in a GPS-Denied Environment

NASA Technical Reports Server (NTRS)

Mackay, John D. (Inventor); Murdock, Ronald G. (Inventor); Cummins, Douglas A. (Inventor)

2017-01-01

A system for locating an object in a GPS-denied environment includes first and second stationary nodes of a network and an object out of synchronization with a common time base of the network. The system includes one or more processors that are configured to estimate distances between the first stationary node and the object and a distance between the second stationary node and the object by comparing time-stamps of messages relayed between the object and the nodes. A position of the object can then be trilaterated using a location of each of the first and second stationary nodes and the measured distances between the object and each of the first and second stationary nodes.

Efficiency analysis of diffusion on T-fractals in the sense of random walks.

PubMed

Peng, Junhao; Xu, Guoai

2014-04-07

Efficiently controlling the diffusion process is crucial in the study of diffusion problem in complex systems. In the sense of random walks with a single trap, mean trapping time (MTT) and mean diffusing time (MDT) are good measures of trapping efficiency and diffusion efficiency, respectively. They both vary with the location of the node. In this paper, we analyze the effects of node's location on trapping efficiency and diffusion efficiency of T-fractals measured by MTT and MDT. First, we provide methods to calculate the MTT for any target node and the MDT for any source node of T-fractals. The methods can also be used to calculate the mean first-passage time between any pair of nodes. Then, using the MTT and the MDT as the measure of trapping efficiency and diffusion efficiency, respectively, we compare the trapping efficiency and diffusion efficiency among all nodes of T-fractal and find the best (or worst) trapping sites and the best (or worst) diffusing sites. Our results show that the hub node of T-fractal is the best trapping site, but it is also the worst diffusing site; and that the three boundary nodes are the worst trapping sites, but they are also the best diffusing sites. Comparing the maximum of MTT and MDT with their minimums, we find that the maximum of MTT is almost 6 times of the minimum of MTT and the maximum of MDT is almost equal to the minimum for MDT. Thus, the location of target node has large effect on the trapping efficiency, but the location of source node almost has no effect on diffusion efficiency. We also simulate random walks on T-fractals, whose results are consistent with the derived results.

Greedy data transportation scheme with hard packet deadlines for wireless ad hoc networks.

PubMed

Lee, HyungJune

2014-01-01

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

PubMed Central

Lee, HyungJune

2014-01-01

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services. PMID:25258736

Measures of node centrality in mobile social networks

NASA Astrophysics Data System (ADS)

Gao, Zhenxiang; Shi, Yan; Chen, Shanzhi

2015-02-01

Mobile social networks exploit human mobility and consequent device-to-device contact to opportunistically create data paths over time. While links in mobile social networks are time-varied and strongly impacted by human mobility, discovering influential nodes is one of the important issues for efficient information propagation in mobile social networks. Although traditional centrality definitions give metrics to identify the nodes with central positions in static binary networks, they cannot effectively identify the influential nodes for information propagation in mobile social networks. In this paper, we address the problems of discovering the influential nodes in mobile social networks. We first use the temporal evolution graph model which can more accurately capture the topology dynamics of the mobile social network over time. Based on the model, we explore human social relations and mobility patterns to redefine three common centrality metrics: degree centrality, closeness centrality and betweenness centrality. We then employ empirical traces to evaluate the benefits of the proposed centrality metrics, and discuss the predictability of nodes' global centrality ranking by nodes' local centrality ranking. Results demonstrate the efficiency of the proposed centrality metrics.

Diffusion in Colocation Contact Networks: The Impact of Nodal Spatiotemporal Dynamics.

PubMed

Thomas, Bryce; Jurdak, Raja; Zhao, Kun; Atkinson, Ian

2016-01-01

Temporal contact networks are studied to understand dynamic spreading phenomena such as communicable diseases or information dissemination. To establish how spatiotemporal dynamics of nodes impact spreading potential in colocation contact networks, we propose "inducement-shuffling" null models which break one or more correlations between times, locations and nodes. By reconfiguring the time and/or location of each node's presence in the network, these models induce alternative sets of colocation events giving rise to contact networks with varying spreading potential. This enables second-order causal reasoning about how correlations in nodes' spatiotemporal preferences not only lead to a given contact network but ultimately influence the network's spreading potential. We find the correlation between nodes and times to be the greatest impediment to spreading, while the correlation between times and locations slightly catalyzes spreading. Under each of the presented null models we measure both the number of contacts and infection prevalence as a function of time, with the surprising finding that the two have no direct causality.

GTRF: a game theory approach for regulating node behavior in real-time wireless sensor networks.

PubMed

Lin, Chi; Wu, Guowei; Pirozmand, Poria

2015-06-04

The selfish behaviors of nodes (or selfish nodes) cause packet loss, network congestion or even void regions in real-time wireless sensor networks, which greatly decrease the network performance. Previous methods have focused on detecting selfish nodes or avoiding selfish behavior, but little attention has been paid to regulating selfish behavior. In this paper, a Game Theory-based Real-time & Fault-tolerant (GTRF) routing protocol is proposed. GTRF is composed of two stages. In the first stage, a game theory model named VA is developed to regulate nodes' behaviors and meanwhile balance energy cost. In the second stage, a jumping transmission method is adopted, which ensures that real-time packets can be successfully delivered to the sink before a specific deadline. We prove that GTRF theoretically meets real-time requirements with low energy cost. Finally, extensive simulations are conducted to demonstrate the performance of our scheme. Simulation results show that GTRF not only balances the energy cost of the network, but also prolongs network lifetime.

Novel Indocyanine Green-Phytate Colloid Technique for Sentinel Node Detection in Head and Neck: Mouse Study.

PubMed

Araki, Koji; Mizokami, Daisuke; Tomifuji, Masayuki; Yamashita, Taku; Ohnuki, Kazunobu; Umeda, Izumi O; Fujii, Hirofumi; Kosuda, Shigeru; Shiotani, Akihiro

2014-08-01

Sentinel node navigation surgery using real-time, near-infrared imaging with indocyanine green is becoming popular by allowing head and neck surgeons to avoid unnecessary neck dissection. The major drawback of this method is its quick migration through the lymphatics, limiting the diagnostic time window and undesirable detection of downstream nodes. We resolved this problem by mixing indocyanine green (ICG) with phytate colloid to retard its migration and demonstrated its feasibility in a nude mouse study. Experimental prospective animal study. Animal laboratory. Indocyanine green at 3 concentrations was tested to determine the optimal concentration for sentinel lymph node detection in a mouse model. Effect of indocyanine green with phytate colloid mixture solutions was also analyzed. Indocyanine green or mixture solution at different mixing ratios were injected into the tongue of nude mice and near-infrared fluorescence images were captured sequentially for up to 48 hours. The brightness of fluorescence in the sentinel lymph node and lymph nodes further downstream were assessed. Indocyanine green concentration >50 μg/mL did not improve sentinel lymph node detection. The addition of phytate colloid to indocyanine green extended the period when sentinel lymph node was detectable. Second echelon lymph nodes were not imaged in mice injected with the mixture, while these were visualized in mice injected with indocyanine green alone. This novel technique of ICG-phytate colloid mixture allows prolonged diagnostic time window, prevention of downstream subsequent nodes detection, and improved accuracy for the detection of true sentinel lymph nodes. © American Academy of Otolaryngology—Head and Neck Surgery Foundation 2014.

Seawifs Technical Report Series. Volume 2: Analysis of Orbit Selection for Seawifs: Ascending Versus Descending Node

NASA Technical Reports Server (NTRS)

Hooker, Stanford B. (Editor); Firestone, Elaine R. (Editor); Gregg, Watson W.

1992-01-01

Due to range safety considerations, the Sea-viewing Wide Field-of-view Sensor (SeaWiFS) ocean color instrument may be required to be launched into a near-noon descending node, as opposed to the ascending node used by the predecessor sensor, the Coastal Zone Color Scanner (CZCS). The relative importance of ascending versus descending near-noon orbits was assessed here to determine if descending node will meet the scientific requirements of SeaWiFS. Analyses focused on ground coverage, local times of coverage, solar and viewing geometries (zenith and azimuth angles), and sun glint. Differences were found in the areas covered by individual orbits, but were not important when taken over a 16 day repeat time. Local time of coverage was also different: for ascending node orbits the Northern Hemisphere was observed in the morning and the Southern Hemisphere in the afternoon, while for descending node orbits the Northern Hemisphere was observed in the afternoon and the Southern in the morning. There were substantial differences in solar azimuth and spacecraft azimuth angles both at equinox and at the Northern Hemisphere summer solstice. Negligible differences in solar and spacecraft zenith angles, relative azimuth angles, and sun glint were obtained at the equinox. However, large differences were found in solar zenith angles, relative azimuths, and sun glint for the solstice. These differences appeared to compensate across the scan, however, an increase in sun glint in descending node over that in ascending node on the western part of the scan was compensated by a decrease on the eastern part of the scan. Thus, no advantage or disadvantage could be conferred upon either ascending node or descending node for noon orbits. Analyses were also performed for ascending and descending node orbits that deviated from a noon equator crossing time. For ascending node, afternoon orbits produced the lowest mean solar zenith angles in the Northern Hemisphere, and morning orbits produced the lowest angles for the Southern Hemisphere. For descending node, morning orbits produced the lowest mean solar zenith angles for the Northern Hemisphere; afternoon orbits produced the lowest angles for the Southern Hemisphere.

Distributed downhole drilling network

DOEpatents

Hall, David R.; Hall, Jr., H. Tracy; Fox, Joe; Pixton, David S.

2006-11-21

A high-speed downhole network providing real-time data from downhole components of a drilling strings includes a bottom-hole node interfacing to a bottom-hole assembly located proximate the bottom end of a drill string. A top-hole node is connected proximate the top end of the drill string. One or several intermediate nodes are located along the drill string between the bottom-hole node and the top-hole node. The intermediate nodes are configured to receive and transmit data packets transmitted between the bottom-hole node and the top-hole node. A communications link, integrated into the drill string, is used to operably connect the bottom-hole node, the intermediate nodes, and the top-hole node. In selected embodiments, a personal or other computer may be connected to the top-hole node, to analyze data received from the intermediate and bottom-hole nodes.

Patterns of a spatial exploration under time evolution of the attractiveness: Persistent nodes, degree distribution, and spectral properties

NASA Astrophysics Data System (ADS)

da Silva, Roberto

2018-06-01

This work explores the features of a graph generated by agents that hop from one node to another node, where the nodes have evolutionary attractiveness. The jumps are governed by Boltzmann-like transition probabilities that depend both on the euclidean distance between the nodes and on the ratio (β) of the attractiveness between them. It is shown that persistent nodes, i.e., nodes that never been reached by this special random walk are possible in the stationary limit differently from the case where the attractiveness is fixed and equal to one for all nodes (β = 1). Simultaneously, one also investigates the spectral properties and statistics related to the attractiveness and degree distribution of the evolutionary network. Finally, a study of the crossover between persistent phase and no persistent phase was performed and it was also observed the existence of a special type of transition probability which leads to a power law behaviour for the time evolution of the persistence.

Dynamic resource allocation scheme for distributed heterogeneous computer systems

NASA Technical Reports Server (NTRS)

Liu, Howard T. (Inventor); Silvester, John A. (Inventor)

1991-01-01

This invention relates to a resource allocation in computer systems, and more particularly, to a method and associated apparatus for shortening response time and improving efficiency of a heterogeneous distributed networked computer system by reallocating the jobs queued up for busy nodes to idle, or less-busy nodes. In accordance with the algorithm (SIDA for short), the load-sharing is initiated by the server device in a manner such that extra overhead in not imposed on the system during heavily-loaded conditions. The algorithm employed in the present invention uses a dual-mode, server-initiated approach. Jobs are transferred from heavily burdened nodes (i.e., over a high threshold limit) to low burdened nodes at the initiation of the receiving node when: (1) a job finishes at a node which is burdened below a pre-established threshold level, or (2) a node is idle for a period of time as established by a wakeup timer at the node. The invention uses a combination of the local queue length and the local service rate ratio at each node as the workload indicator.

Self-assembly of the yeast actomyosin contractile ring as an aggregation process: kinetics of formation and instability regimes

NASA Astrophysics Data System (ADS)

Ojkic, Nikola; Vavylonis, Dimitrios

2009-03-01

Fission yeast cells assemble an equatorial contractile ring for cytokinesis, the last step of mitosis. The ring assembles from ˜ 65 membrane-bound ``nodes''' containing myosin motors and other proteins. Actin filaments that grow out from the nodes establish transient connections among the nodes and aid in pulling them together in a process that appears as pair-wise attraction (Vavylonis et al. Science 97:319, 2008). We used scaling arguments, coarse grained stability analysis of homogeneous states, and Monte Carlo simulations of simple models, to explore the conditions that yield fast and efficient ring formation, as opposed to formation of isolated clumps. We described our results as a function of: number of nodes, rate of establishing connections, range of node interaction, distance traveled per node interaction and broad band width, w. Uniform cortical 2d distributions of nodes are stable over short times due to randomness of connections among nodes, but become unstable over long times due to fluctuations in the initial node distribution. Successful condensation of nodes into a ring requires sufficiently small w such that lateral contraction occurs faster then clump formation.

In transit sentinel node drainage as a prognostic factor for patients with cutaneous melanoma.

PubMed

Brandão, Paulo H D M; Bertolli, Eduardo; Doria-Filho, Eduardo; Santos Filho, Ivan D A O; de Macedo, Mariana P; Pinto, Clovis A L; Duprat Neto, João P

2018-02-26

Minor basin or in transit node drainage can be found in patients with cutaneous melanoma who undergo sentinel node biopsy. Its clinical impact is still unclear. Our objective is to evaluate clinical outcomes in patients who presented with in transit sentinel node (ITN) drainage. Retrospective analysis of patients who underwent sentinel node biopsy (SNB) in a single Brazilian institution between 2000 and 2015. Our cohort comprised 1223 SNB. There were 64 patients (5.2%) with ITN. Melanoma of the limbs (OR 10.61, P < 0.0001) and acral subtype (OR 3.49, P < 0.0001) were associated with ITN drainage. Among these 64 patients, 14 (21.9%) had a positive SNB. The ITN was positive for metastases in five patients, four in a popliteal basin and one on the trunk. Regarding completion node dissection (CND), two patients had positive non-sentinel nodes (NSN), both in major basins. In patients who developed recurrence, time to recurrence was shorter (mean time 18 vs 31.4 months, P = 0.001) and time to death was shorter (mean time 31.6 vs 40 months, P = 0.039) in those who had ITN drainage. ITN drainage was associated with earlier recurrences and deaths from melanoma. © 2018 Wiley Periodicals, Inc.

Inference for dynamics of continuous variables: the extended Plefka expansion with hidden nodes

NASA Astrophysics Data System (ADS)

Bravi, B.; Sollich, P.

2017-06-01

We consider the problem of a subnetwork of observed nodes embedded into a larger bulk of unknown (i.e. hidden) nodes, where the aim is to infer these hidden states given information about the subnetwork dynamics. The biochemical networks underlying many cellular and metabolic processes are important realizations of such a scenario as typically one is interested in reconstructing the time evolution of unobserved chemical concentrations starting from the experimentally more accessible ones. We present an application to this problem of a novel dynamical mean field approximation, the extended Plefka expansion, which is based on a path integral description of the stochastic dynamics. As a paradigmatic model we study the stochastic linear dynamics of continuous degrees of freedom interacting via random Gaussian couplings. The resulting joint distribution is known to be Gaussian and this allows us to fully characterize the posterior statistics of the hidden nodes. In particular the equal-time hidden-to-hidden variance—conditioned on observations—gives the expected error at each node when the hidden time courses are predicted based on the observations. We assess the accuracy of the extended Plefka expansion in predicting these single node variances as well as error correlations over time, focussing on the role of the system size and the number of observed nodes.

Squid - a simple bioinformatics grid.

PubMed

Carvalho, Paulo C; Glória, Rafael V; de Miranda, Antonio B; Degrave, Wim M

2005-08-03

BLAST is a widely used genetic research tool for analysis of similarity between nucleotide and protein sequences. This paper presents a software application entitled "Squid" that makes use of grid technology. The current version, as an example, is configured for BLAST applications, but adaptation for other computing intensive repetitive tasks can be easily accomplished in the open source version. This enables the allocation of remote resources to perform distributed computing, making large BLAST queries viable without the need of high-end computers. Most distributed computing / grid solutions have complex installation procedures requiring a computer specialist, or have limitations regarding operating systems. Squid is a multi-platform, open-source program designed to "keep things simple" while offering high-end computing power for large scale applications. Squid also has an efficient fault tolerance and crash recovery system against data loss, being able to re-route jobs upon node failure and recover even if the master machine fails. Our results show that a Squid application, working with N nodes and proper network resources, can process BLAST queries almost N times faster than if working with only one computer. Squid offers high-end computing, even for the non-specialist, and is freely available at the project web site. Its open-source and binary Windows distributions contain detailed instructions and a "plug-n-play" instalation containing a pre-configured example.

Patient-Specific B-Cell Antibody Factories to Treat Metastatic Disease

DTIC Science & Technology

2014-10-01

cryopreservative  medias  that  permit  storage  and  recovery   of   the   B-­‐cells   from   the   selected   lymph   node   sample...From   ten   cryopreserved   cores,  we   have   explanted   and   produced   pools   of   immortalized   B-­‐cells

Enabling Service Discovery in a Federation of Systems: WS-Discovery Case Study

DTIC Science & Technology

2014-06-01

found that Pastry [3] coupled with SCRIBE [4] provides everything we require from the overlay network: Pastry nodes form a decentralized, self...application-independent manner. Furthermore, Pastry provides mechanisms that support and facilitate application-specific object replication, caching, and fault...recovery. Add SCRIBE to Pastry , and you get a generic, scalable and efficient group communication and event notification system providing

An Algorithm for Timely Transmission of Solicitation Messages in RPL for Energy-Efficient Node Mobility.

PubMed

Park, Jihong; Kim, Ki-Hyung; Kim, Kangseok

2017-04-19

The IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) was proposed for various applications of IPv6 low power wireless networks. While RPL supports various routing metrics and is designed to be suitable for wireless sensor network environments, it does not consider the mobility of nodes. Therefore, there is a need for a method that is energy efficient and that provides stable and reliable data transmission by considering the mobility of nodes in RPL networks. This paper proposes an algorithm to support node mobility in RPL in an energy-efficient manner and describes its operating principle based on different scenarios. The proposed algorithm supports the mobility of nodes by dynamically adjusting the transmission interval of the messages that request the route based on the speed and direction of the motion of mobile nodes, as well as the costs between neighboring nodes. The performance of the proposed algorithm and previous algorithms for supporting node mobility were examined experimentally. From the experiment, it was observed that the proposed algorithm requires fewer messages per unit time for selecting a new parent node following the movement of a mobile node. Since fewer messages are used to select a parent node, the energy consumption is also less than that of previous algorithms.

An Algorithm for Timely Transmission of Solicitation Messages in RPL for Energy-Efficient Node Mobility

PubMed Central

Park, Jihong; Kim, Ki-Hyung; Kim, Kangseok

2017-01-01

The IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) was proposed for various applications of IPv6 low power wireless networks. While RPL supports various routing metrics and is designed to be suitable for wireless sensor network environments, it does not consider the mobility of nodes. Therefore, there is a need for a method that is energy efficient and that provides stable and reliable data transmission by considering the mobility of nodes in RPL networks. This paper proposes an algorithm to support node mobility in RPL in an energy-efficient manner and describes its operating principle based on different scenarios. The proposed algorithm supports the mobility of nodes by dynamically adjusting the transmission interval of the messages that request the route based on the speed and direction of the motion of mobile nodes, as well as the costs between neighboring nodes. The performance of the proposed algorithm and previous algorithms for supporting node mobility were examined experimentally. From the experiment, it was observed that the proposed algorithm requires fewer messages per unit time for selecting a new parent node following the movement of a mobile node. Since fewer messages are used to select a parent node, the energy consumption is also less than that of previous algorithms. PMID:28422084

Effect of node attributes on the temporal dynamics of network structure

NASA Astrophysics Data System (ADS)

Momeni, Naghmeh; Fotouhi, Babak

2017-03-01

Many natural and social networks evolve in time and their structures are dynamic. In most networks, nodes are heterogeneous, and their roles in the evolution of structure differ. This paper focuses on the role of individual attributes on the temporal dynamics of network structure. We focus on a basic model for growing networks that incorporates node attributes (which we call "quality"), and we focus on the problem of forecasting the structural properties of the network in arbitrary times for an arbitrary initial network. That is, we address the following question: If we are given a certain initial network with given arbitrary structure and known node attributes, then how does the structure change in time as new nodes with given distribution of attributes join the network? We solve the model analytically and obtain the quality-degree joint distribution and degree correlations. We characterize the role of individual attributes in the position of individual nodes in the hierarchy of connections. We confirm the theoretical findings with Monte Carlo simulations.

Cooperative wireless network control based health and activity monitoring system.

PubMed

Prakash, R; Ganesh, A Balaji; Girish, Siva V

2016-10-01

A real-time cooperative communication based wireless network is presented for monitoring health and activity of an end-user in their environment. The cooperative communication offers better energy consumption and also an opportunity to aware the current location of a user non-intrusively. The link between mobile sensor node and relay node is dynamically established by using Received Signal Strength Indicator (RSSI) and Link Quality Indicator (LQI) based on adaptive relay selection scheme. The study proposes a Linear Acceleration based Transmission Power Decision Control (LA-TPDC) algorithm to further enhance the energy efficiency of cooperative communication. Further, the occurrences of false alarms are carefully prevented by introducing three stages of sequential warning system. The real-time experiments are carried-out by using the nodes, namely mobile sensor node, relay nodes and a destination node which are indigenously developed by using a CC430 microcontroller integrated with an in-built transceiver at 868 MHz. The wireless node performance characteristics, such as energy consumption, Signal-Noise ratio (SNR), Bit Error Rate (BER), Packet Delivery Ratio (PDR) and transmission offset are evaluated for all the participated nodes. The experimental results observed that the proposed linear acceleration based transmission power decision control algorithm almost doubles the battery life time than energy efficient conventional cooperative communication.

Energy-Efficient Data Collection Method for Sensor Networks by Integrating Asymmetric Communication and Wake-Up Radio

PubMed Central

Iwata, Masanari; Tang, Suhua; Obana, Sadao

2018-01-01

In large-scale wireless sensor networks (WSNs), nodes close to sink nodes consume energy more quickly than other nodes due to packet forwarding. A mobile sink is a good solution to this issue, although it causes two new problems to nodes: (i) overhead of updating routing information; and (ii) increased operating time due to aperiodic query. To solve these problems, this paper proposes an energy-efficient data collection method, Sink-based Centralized transmission Scheduling (SC-Sched), by integrating asymmetric communication and wake-up radio. Specifically, each node is equipped with a low-power wake-up receiver. The sink node determines transmission scheduling, and transmits a wake-up message using a large transmission power, directly activating a pair of nodes simultaneously which will communicate with a normal transmission power. This paper further investigates how to deal with frame loss caused by fading and how to mitigate the impact of the wake-up latency of communication modules. Simulation evaluations confirm that using multiple channels effectively reduces data collection time and SC-Sched works well with a mobile sink. Compared with the conventional duty-cycling method, SC-Sched greatly reduces total energy consumption and improves the network lifetime by 7.47 times in a WSN with 4 data collection points and 300 sensor nodes. PMID:29642397

Network Robustness: the whole story

NASA Astrophysics Data System (ADS)

Longjas, A.; Tejedor, A.; Zaliapin, I. V.; Ambroj, S.; Foufoula-Georgiou, E.

2014-12-01

A multitude of actual processes operating on hydrological networks may exhibit binary outcomes such as clean streams in a river network that may become contaminated. These binary outcomes can be modeled by node removal processes (attacks) acting in a network. Network robustness against attacks has been widely studied in fields as diverse as the Internet, power grids and human societies. However, the current definition of robustness is only accounting for the connectivity of the nodes unaffected by the attack. Here, we put forward the idea that the connectivity of the affected nodes can play a crucial role in proper evaluation of the overall network robustness and its future recovery from the attack. Specifically, we propose a dual perspective approach wherein at any instant in the network evolution under attack, two distinct networks are defined: (i) the Active Network (AN) composed of the unaffected nodes and (ii) the Idle Network (IN) composed of the affected nodes. The proposed robustness metric considers both the efficiency of destroying the AN and the efficiency of building-up the IN. This approach is motivated by concrete applied problems, since, for example, if we study the dynamics of contamination in river systems, it is necessary to know both the connectivity of the healthy and contaminated parts of the river to assess its ecological functionality. We show that trade-offs between the efficiency of the Active and Idle network dynamics give rise to surprising crossovers and re-ranking of different attack strategies, pointing to significant implications for decision making.

Biological behavior of oral and perioral mast cell tumors in dogs: 44 cases (1996-2006).

PubMed

Hillman, Lorin A; Garrett, Laura D; de Lorimier, Louis-Philippe; Charney, Sarah C; Borst, Luke B; Fan, Timothy M

2010-10-15

To describe clinical outcome of dogs with mast cell tumors (MCTs) arising from the oral mucosa, oral mucocutaneous junction, or perioral region of the muzzle and evaluate the potential role of the chemokine receptor type 7 (CCR7) in the biological behavior of these tumors. Retrospective case series. 44 dogs with MCTs of the oral mucosa (n=14), oral mucocutaneous junction (19), or perioral region of the muzzle (11). Medical records were reviewed for information on signalment, regional metastasis, treatments, cause of death, and survival time. Twenty of the 44 cases had stored histologic samples available for immunohistochemical staining for CCR7 For all dogs, median survival time was 52 months. Twenty-six (59%) dogs had regional lymph node metastasis on admission. Median survival time for dogs with lymph node metastasis was 14 months, whereas median survival time was not reached for dogs without lymph node metastasis. Intensity of staining for CCR7 was not significantly associated with the presence of regional lymph node metastasis or survival time. Results suggested that in dogs with MCTs arising from the oral mucosa, oral mucocutaneous junction, or perioral region of the muzzle, the presence of regional lymph node metastasis at the time of diagnosis was a negative prognostic factor. However, prolonged survival times could be achieved with treatment. In addition, CCR7 expression in the primary tumor was not significantly associated with the presence of regional lymph node metastasis or survival time.

High resolution distributed time-to-digital converter (TDC) in a White Rabbit network

NASA Astrophysics Data System (ADS)

Pan, Weibin; Gong, Guanghua; Du, Qiang; Li, Hongming; Li, Jianmin

2014-02-01

The Large High Altitude Air Shower Observatory (LHAASO) project consists of a complex detector array with over 6000 detector nodes spreading over 1.2 km2 areas. The arrival times of shower particles are captured by time-to-digital converters (TDCs) in the detectors' frontend electronics, the arrival direction of the high energy cosmic ray are then to be reconstructed from the space-time information of all detector nodes. To guarantee the angular resolution of 0.5°, a time synchronization of 500 ps (RMS) accuracy and 100 ps precision must be achieved among all TDC nodes. A technology enhancing Gigabit Ethernet, called the White Rabbit (WR), has shown the capability of delivering sub-nanosecond accuracy and picoseconds precision of synchronization over the standard data packet transfer. In this paper we demonstrate a distributed TDC prototype system combining the FPGA based TDC and the WR technology. With the time synchronization and data transfer services from a compact WR node, separate FPGA-TDC nodes can be combined to provide uniform time measurement information for correlated events. The design detail and test performance will be described in the paper.

SU-E-T-222: Computational Optimization of Monte Carlo Simulation On 4D Treatment Planning Using the Cloud Computing Technology

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chow, J

Purpose: This study evaluated the efficiency of 4D lung radiation treatment planning using Monte Carlo simulation on the cloud. The EGSnrc Monte Carlo code was used in dose calculation on the 4D-CT image set. Methods: 4D lung radiation treatment plan was created by the DOSCTP linked to the cloud, based on the Amazon elastic compute cloud platform. Dose calculation was carried out by Monte Carlo simulation on the 4D-CT image set on the cloud, and results were sent to the FFD4D image deformation program for dose reconstruction. The dependence of computing time for treatment plan on the number of computemore » node was optimized with variations of the number of CT image set in the breathing cycle and dose reconstruction time of the FFD4D. Results: It is found that the dependence of computing time on the number of compute node was affected by the diminishing return of the number of node used in Monte Carlo simulation. Moreover, the performance of the 4D treatment planning could be optimized by using smaller than 10 compute nodes on the cloud. The effects of the number of image set and dose reconstruction time on the dependence of computing time on the number of node were not significant, as more than 15 compute nodes were used in Monte Carlo simulations. Conclusion: The issue of long computing time in 4D treatment plan, requiring Monte Carlo dose calculations in all CT image sets in the breathing cycle, can be solved using the cloud computing technology. It is concluded that the optimized number of compute node selected in simulation should be between 5 and 15, as the dependence of computing time on the number of node is significant.« less

The navigation system of the JPL robot

NASA Technical Reports Server (NTRS)

Thompson, A. M.

1977-01-01

The control structure of the JPL research robot and the operations of the navigation subsystem are discussed. The robot functions as a network of interacting concurrent processes distributed among several computers and coordinated by a central executive. The results of scene analysis are used to create a segmented terrain model in which surface regions are classified by traversibility. The model is used by a path planning algorithm, PATH, which uses tree search methods to find the optimal path to a goal. In PATH, the search space is defined dynamically as a consequence of node testing. Maze-solving and the use of an associative data base for context dependent node generation are also discussed. Execution of a planned path is accomplished by a feedback guidance process with automatic error recovery.

Influence of antiretroviral therapy on programmed death-1 (CD279) expression on T cells in lymph nodes of human immunodeficiency virus-infected individuals.

PubMed

Ehrhard, Simone; Wernli, Marion; Dürmüller, Ursula; Battegay, Manuel; Gudat, Fred; Erb, Peter

2009-10-01

Human immunodeficiency virus infection leads to T-cell exhaustion and involution of lymphoid tissue. Recently, the programmed death-1 pathway was found to be crucial for virus-specific T-cell exhaustion during human immunodeficiency virus infection. Programmed death-1 expression was elevated on human immunodeficiency virus-specific peripheral blood CD8+ and CD4+ T cells and correlated with disease severity. During human immunodeficiency infection, lymphoid tissue acts as a major viral reservoir and is an important site for viral replication, but it is also essential for regulatory processes important for immune recovery. We compared programmed death-1 expression in 2 consecutive inguinal lymph nodes of 14 patients, excised before antiretroviral therapy (antiretroviral therapy as of 1997-1999) and 16 to 20 months under antiretroviral therapy. In analogy to lymph nodes of human immunodeficiency virus-negative individuals, in all treated patients, the germinal center area decreased, whereas the number of germinal centers did not significantly change. Programmed death-1 expression was mostly found in germinal centers. The absolute extent of programmed death 1 expression per section was not significantly altered after antiretroviral therapy resulting in a significant-relative increase of programmed death 1 per shrunken germinal center. In colocalization studies, CD45R0+ cells that include helper/inducer T cells strongly expressed programmed death-1 before and during therapy, whereas CD8+ T cells, fewer in numbers, showed a weak expression for programmed death-1. Thus, although antiretroviral therapy seems to reduce the number of programmed death-1-positive CD8+ T lymphocytes within germinal centers, it does not down-regulate programmed death-1 expression on the helper/inducer T-cell subset that may remain exhausted and therefore unable to trigger immune recovery.

A Two-Phase Time Synchronization-Free Localization Algorithm for Underwater Sensor Networks.

PubMed

Luo, Junhai; Fan, Liying

2017-03-30

Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assistance. Sensor nodes location in UWSNs is an especially relevant topic. Global Positioning System (GPS) information is not suitable for use in UWSNs because of the underwater propagation problems. Hence, some localization algorithms based on the precise time synchronization between sensor nodes that have been proposed for UWSNs are not feasible. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme based on the Particle Swarm Optimization (PSO) algorithm to obtain the coordinates of the unknown sensor nodes. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence, in this algorithm, we use a small number of mobile beacons to help obtain the location information without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA achieved by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization.

A Two-Phase Time Synchronization-Free Localization Algorithm for Underwater Sensor Networks

PubMed Central

Luo, Junhai; Fan, Liying

2017-01-01

Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assistance. Sensor nodes location in UWSNs is an especially relevant topic. Global Positioning System (GPS) information is not suitable for use in UWSNs because of the underwater propagation problems. Hence, some localization algorithms based on the precise time synchronization between sensor nodes that have been proposed for UWSNs are not feasible. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme based on the Particle Swarm Optimization (PSO) algorithm to obtain the coordinates of the unknown sensor nodes. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence, in this algorithm, we use a small number of mobile beacons to help obtain the location information without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA achieved by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization. PMID:28358342

Takeover times for a simple model of network infection.

PubMed

Ottino-Löffler, Bertrand; Scott, Jacob G; Strogatz, Steven H

2017-07-01

We study a stochastic model of infection spreading on a network. At each time step a node is chosen at random, along with one of its neighbors. If the node is infected and the neighbor is susceptible, the neighbor becomes infected. How many time steps T does it take to completely infect a network of N nodes, starting from a single infected node? An analogy to the classic "coupon collector" problem of probability theory reveals that the takeover time T is dominated by extremal behavior, either when there are only a few infected nodes near the start of the process or a few susceptible nodes near the end. We show that for N≫1, the takeover time T is distributed as a Gumbel distribution for the star graph, as the convolution of two Gumbel distributions for a complete graph and an Erdős-Rényi random graph, as a normal for a one-dimensional ring and a two-dimensional lattice, and as a family of intermediate skewed distributions for d-dimensional lattices with d≥3 (these distributions approach the convolution of two Gumbel distributions as d approaches infinity). Connections to evolutionary dynamics, cancer, incubation periods of infectious diseases, first-passage percolation, and other spreading phenomena in biology and physics are discussed.

Takeover times for a simple model of network infection

NASA Astrophysics Data System (ADS)

Ottino-Löffler, Bertrand; Scott, Jacob G.; Strogatz, Steven H.

2017-07-01

We study a stochastic model of infection spreading on a network. At each time step a node is chosen at random, along with one of its neighbors. If the node is infected and the neighbor is susceptible, the neighbor becomes infected. How many time steps T does it take to completely infect a network of N nodes, starting from a single infected node? An analogy to the classic "coupon collector" problem of probability theory reveals that the takeover time T is dominated by extremal behavior, either when there are only a few infected nodes near the start of the process or a few susceptible nodes near the end. We show that for N ≫1 , the takeover time T is distributed as a Gumbel distribution for the star graph, as the convolution of two Gumbel distributions for a complete graph and an Erdős-Rényi random graph, as a normal for a one-dimensional ring and a two-dimensional lattice, and as a family of intermediate skewed distributions for d -dimensional lattices with d ≥3 (these distributions approach the convolution of two Gumbel distributions as d approaches infinity). Connections to evolutionary dynamics, cancer, incubation periods of infectious diseases, first-passage percolation, and other spreading phenomena in biology and physics are discussed.

The fastest spreader in SIS epidemics on networks

NASA Astrophysics Data System (ADS)

He, Zhidong; Van Mieghem, Piet

2018-05-01

Identifying the fastest spreaders in epidemics on a network helps to ensure an efficient spreading. By ranking the average spreading time for different spreaders, we show that the fastest spreader may change with the effective infection rate of a SIS epidemic process, which means that the time-dependent influence of a node is usually strongly coupled to the dynamic process and the underlying network. With increasing effective infection rate, we illustrate that the fastest spreader changes from the node with the largest degree to the node with the shortest flooding time. (The flooding time is the minimum time needed to reach all other nodes if the process is reduced to a flooding process.) Furthermore, by taking the local topology around the spreader and the average flooding time into account, we propose the spreading efficiency as a metric to quantify the efficiency of a spreader and identify the fastest spreader, which is adaptive to different infection rates in general networks.

Evidence for global processing of complex visual displays

NASA Technical Reports Server (NTRS)

Munson, Robert C.; Horst, Richard L.

1986-01-01

'Polar graphic' displays, in which changes in system status are represented by distortions in the form of a geometric figure, were presented to subjects, and reaction time (RT) to discriminate system status was recorded. Of interest was the extent to which reaction time showed evidence of global processing of these displays as the number of nodes and difficulty of discrimination were varied. When discrimination of system status was easy, RT showed no increase with increasing number of nodes, providing evidence of global processing. When discrimination was difficult, systematic differences in RT as a function of the number of nodes suggested the invocation of other (local) processes, although the data were not consistent with a node-by-node search process.

Directional Migration of Recirculating Lymphocytes through Lymph Nodes via Random Walks

PubMed Central

Thomas, Niclas; Matejovicova, Lenka; Srikusalanukul, Wichat; Shawe-Taylor, John; Chain, Benny

2012-01-01

Naive T lymphocytes exhibit extensive antigen-independent recirculation between blood and lymph nodes, where they may encounter dendritic cells carrying cognate antigen. We examine how long different T cells may spend in an individual lymph node by examining data from long term cannulation of blood and efferent lymphatics of a single lymph node in the sheep. We determine empirically the distribution of transit times of migrating T cells by applying the Least Absolute Shrinkage & Selection Operator () or regularised to fit experimental data describing the proportion of labelled infused cells in blood and efferent lymphatics over time. The optimal inferred solution reveals a distribution with high variance and strong skew. The mode transit time is typically between 10 and 20 hours, but a significant number of cells spend more than 70 hours before exiting. We complement the empirical machine learning based approach by modelling lymphocyte passage through the lymph node . On the basis of previous two photon analysis of lymphocyte movement, we optimised distributions which describe the transit times (first passage times) of discrete one dimensional and continuous (Brownian) three dimensional random walks with drift. The optimal fit is obtained when drift is small, i.e. the ratio of probabilities of migrating forward and backward within the node is close to one. These distributions are qualitatively similar to the inferred empirical distribution, with high variance and strong skew. In contrast, an optimised normal distribution of transit times (symmetrical around mean) fitted the data poorly. The results demonstrate that the rapid recirculation of lymphocytes observed at a macro level is compatible with predominantly randomised movement within lymph nodes, and significant probabilities of long transit times. We discuss how this pattern of migration may contribute to facilitating interactions between low frequency T cells and antigen presenting cells carrying cognate antigen. PMID:23028891

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path.

PubMed

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective.

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path

PubMed Central

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective. PMID:27490901

An evaluation of the state of time synchronization on leadership class supercomputers

DOE PAGES

Jones, Terry; Ostrouchov, George; Koenig, Gregory A.; ...

2017-10-09

We present a detailed examination of time agreement characteristics for nodes within extreme-scale parallel computers. Using a software tool we introduce in this paper, we quantify attributes of clock skew among nodes in three representative high-performance computers sited at three national laboratories. Our measurements detail the statistical properties of time agreement among nodes and how time agreement drifts over typical application execution durations. We discuss the implications of our measurements, why the current state of the field is inadequate, and propose strategies to address observed shortcomings.

An evaluation of the state of time synchronization on leadership class supercomputers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jones, Terry; Ostrouchov, George; Koenig, Gregory A.

We present a detailed examination of time agreement characteristics for nodes within extreme-scale parallel computers. Using a software tool we introduce in this paper, we quantify attributes of clock skew among nodes in three representative high-performance computers sited at three national laboratories. Our measurements detail the statistical properties of time agreement among nodes and how time agreement drifts over typical application execution durations. We discuss the implications of our measurements, why the current state of the field is inadequate, and propose strategies to address observed shortcomings.

Heterogeneous information sharing of sensor information in contested environments

NASA Astrophysics Data System (ADS)

Wampler, Jason A.; Hsieh, Chien; Toth, Andrew; Sheatsley, Ryan

2017-05-01

The inherent nature of unattended sensors makes these devices most vulnerable to detection, exploitation, and denial in contested environments. Physical access is often cited as the easiest way to compromise any device or network. A new mechanism for mitigating these types of attacks developed under the Assistant Secretary of Defense for Research and Engineering, ASD(R and E) project, "Smoke Screen in Cyberspace", was demonstrated in a live, over-the-air experiment. Smoke Screen encrypts, slices up, and disburses redundant fragments of files throughout the network. Recovery is only possible after recovering all fragments and attacking/denying one or more nodes does not limit the availability of other fragment copies in the network. This experiment proved the feasibility of redundant file fragmentation, and is the foundation for developing sophisticated methods to blacklist compromised nodes, move data fragments from risks of compromise, and forward stored data fragments closer to the anticipated retrieval point. This paper outlines initial results in scalability of node members, fragment size, file size, and performance in a heterogeneous network consisting of the Wireless Network after Next (WNaN) radio and Common Sensor Radio (CSR).

Opinion formation driven by PageRank node influence on directed networks

NASA Astrophysics Data System (ADS)

Eom, Young-Ho; Shepelyansky, Dima L.

2015-10-01

We study a two states opinion formation model driven by PageRank node influence and report an extensive numerical study on how PageRank affects collective opinion formations in large-scale empirical directed networks. In our model the opinion of a node can be updated by the sum of its neighbor nodes' opinions weighted by the node influence of the neighbor nodes at each step. We consider PageRank probability and its sublinear power as node influence measures and investigate evolution of opinion under various conditions. First, we observe that all networks reach steady state opinion after a certain relaxation time. This time scale is decreasing with the heterogeneity of node influence in the networks. Second, we find that our model shows consensus and non-consensus behavior in steady state depending on types of networks: Web graph, citation network of physics articles, and LiveJournal social network show non-consensus behavior while Wikipedia article network shows consensus behavior. Third, we find that a more heterogeneous influence distribution leads to a more uniform opinion state in the cases of Web graph, Wikipedia, and Livejournal. However, the opposite behavior is observed in the citation network. Finally we identify that a small number of influential nodes can impose their own opinion on significant fraction of other nodes in all considered networks. Our study shows that the effects of heterogeneity of node influence on opinion formation can be significant and suggests further investigations on the interplay between node influence and collective opinion in networks.

Performance Optimization of Priority Assisted CSMA/CA Mechanism of 802.15.6 under Saturation Regime

PubMed Central

Shakir, Mustafa; Rehman, Obaid Ur; Rahim, Mudassir; Alrajeh, Nabil; Khan, Zahoor Ali; Khan, Mahmood Ashraf; Niaz, Iftikhar Azim; Javaid, Nadeem

2016-01-01

Due to the recent development in the field of Wireless Sensor Networks (WSNs), the Wireless Body Area Networks (WBANs) have become a major area of interest for the developers and researchers. Human body exhibits postural mobility due to which distance variation occurs and the status of connections amongst sensors change time to time. One of the major requirements of WBAN is to prolong the network lifetime without compromising on other performance measures, i.e., delay, throughput and bandwidth efficiency. Node prioritization is one of the possible solutions to obtain optimum performance in WBAN. IEEE 802.15.6 CSMA/CA standard splits the nodes with different user priorities based on Contention Window (CW) size. Smaller CW size is assigned to higher priority nodes. This standard helps to reduce delay, however, it is not energy efficient. In this paper, we propose a hybrid node prioritization scheme based on IEEE 802.15.6 CSMA/CA to reduce energy consumption and maximize network lifetime. In this scheme, optimum performance is achieved by node prioritization based on CW size as well as power in respective user priority. Our proposed scheme reduces the average back off time for channel access due to CW based prioritization. Additionally, power based prioritization for a respective user priority helps to minimize required number of retransmissions. Furthermore, we also compare our scheme with IEEE 802.15.6 CSMA/CA standard (CW assisted node prioritization) and power assisted node prioritization under postural mobility in WBAN. Mathematical expressions are derived to determine the accurate analytical model for throughput, delay, bandwidth efficiency, energy consumption and life time for each node prioritization scheme. With the intention of analytical model validation, we have performed the simulations in OMNET++/MIXIM framework. Analytical and simulation results show that our proposed hybrid node prioritization scheme outperforms other node prioritization schemes in terms of average network delay, average throughput, average bandwidth efficiency and network lifetime. PMID:27598167

Deep radio imaging of the UKIDSS Ultra Deep Survey field : the nature of the faint radio population, and the star-formation history of the Universe

NASA Astrophysics Data System (ADS)

Arumugam, Vinodiran

2013-08-01

Breast cancer remains a significant cause of morbidity and mortality. Assessment of the axillary lymph nodes is part of the staging of the disease. Advances in surgical management of breast cancer have seen a move towards intra-operative lymph node assessment that facilitates an immediate axillary clearance if it is indicated. Raman spectroscopy, a technique based on the inelastic scattering of light, has previously been shown to be capable of differentiating between normal and malignant tissue. These results, based on the biochemical composition of the tissue, potentially allow for this technique to be utilised in this clinical context. The aim of this study was to evaluate the facility of Raman spectroscopy to both assess axillary lymph node tissue within the theatre setting and to achieve results that were comparable to other intra-operative techniques within a clinically relevant time frame. Initial experiments demonstrated that these aims were feasible within the context of both the theatre environment and current surgical techniques. A laboratory based feasibility study involving 17 patients and 38 lymph node samples achieved sensivities and specificities of >90% in unsupervised testing. 339 lymph node samples from 66 patients were subsequently assessed within the theatre environment. Chemometric analysis of this data demonstrated sensitivities of up to 94% and specificities of up to 99% in unsupervised testing. The best results were achieved when comparing negative nodes from N0 patients and nodes containing macrometastases. Spectral analysis revealed increased levels of lipid in the negative nodes and increased DNA and protein levels in the positive nodes. Further studies highlighted the reproducibility of these results using different equipment, users and time from excision. This study uses Raman spectroscopy for the first time in an operating theatre and demonstrates that the results obtained, in real-time, are comparable, if not superior, to current intra-operative techniques of lymph nodes assessment.

Characterizing SRAM Single Event Upset in Terms of Single and Double Node Charge Collection

NASA Technical Reports Server (NTRS)

Black, J. D.; Ball, D. R., II; Robinson, W. H.; Fleetwood, D. M.; Schrimpf, R. D.; Reed, R. A.; Black, D. A.; Warren, K. M.; Tipton, A. D.; Dodd, P. E.;

Lymph Nodes and Survival in Pancreatic Neuroendocrine Tumors (pNET)

PubMed Central

Krampitz, Geoffrey W.; Norton, Jeffrey A.; Poultsides, George A.; Visser, Brendan C.; Sun, Lixian; Jensen, Robert T.

2012-01-01

Background The significance of lymph node metastases on survival of patients with pNET is controversial. Hypothesis Lymph node metastases decrease survival in patients with pNET. Design Prospective databases of the National Institutes of Health (NIH) and Stanford University Hospital (SUH) were queried. Main Outcome Measures Overall survival, disease-related survival, and time to development of liver metastases Results 326 underwent surgical exploration for pNET at the NIH (n=216) and SUH (n=110). 40 (13%) and 305 (94%) underwent enucleation and resection, respectively. Of the patients who underwent resection, 117 (42%) had partial pancreatectomy and 30 (11%) had a Whipple procedure. 41 also had liver resections, 21 wedge resections and 20 lobectomies. Average follow-up was 8 years (range 0.3–28.6 years). The 10-year overall survival for patients with no metastases or lymph node metastases only was similar at 80%. As expected, patients with liver metastases had a significantly decreased 10-year survival of 30% (p<0.001). The time to development of liver metastases was significantly reduced for patients with lymph node metastases alone compared to those with none (p<0.001). For the NIH cohort with longer follow-up, disease-related survival was significantly different for those patients with no metastases, lymph node metastases alone, and liver metastases (p<0.0001). Extent of lymph node involvement in this subgroup showed that disease-related survival decreased as a function of number of lymph nodes involved (p=0.004). Conclusion As expected, liver metastases decrease survival of patients with pNET. Patients with lymph node metastases alone have a shorter time to development of liver metastases that is dependent on the number of lymph nodes involved. With sufficient long-term follow-up, lymph node metastases decrease disease-related survival. Careful evaluation of number and extent of lymph node involvement is warranted in all surgical procedures for pNET. PMID:22987171

Load sharing in distributed real-time systems with state-change broadcasts

NASA Technical Reports Server (NTRS)

Shin, Kang G.; Chang, Yi-Chieh

1989-01-01

A decentralized dynamic load-sharing (LS) method based on state-change broadcasts is proposed for a distributed real-time system. Whenever the state of a node changes from underloaded to fully loaded and vice versa, the node broadcasts this change to a set of nodes, called a buddy set, in the system. The performance of the method is evaluated with both analytic modeling and simulation. It is modeled first by an embedded Markov chain for which numerical solutions are derived. The model solutions are then used to calculate the distribution of queue lengths at the nodes and the probability of meeting task deadlines. The analytical results show that buddy sets of 10 nodes outperform those of less than 10 nodes, and the incremental benefit gained from increasing the buddy set size beyond 15 nodes is insignificant. These and other analytical results are verified by simulation. The proposed LS method is shown to meet task deadlines with a very high probability.

Multi-scale dynamics and relaxation of a tethered membrane in a solvent by Monte Carlo simulations

NASA Astrophysics Data System (ADS)

Pandey, Ras; Anderson, Kelly; Farmer, Barry

2006-03-01

A tethered membrane modeled by a flexible sheet dissipates entropy as it wrinkles and crumples. Nodes of a coarse grained membrane are connected via multiple pathways for dynamical modes to propagate. We consider a sheet with nodes connected by fluctuating bonds on a cubic lattice. The empty lattice sites constitute an effective solvent medium via node-solvent interaction. Each node execute its stochastic motion with the Metropolis algorithm subject to bond fluctuations, excluded volume constraints, and interaction energy. Dynamics and conformation of the sheet are examined at a low and a high temperature with attractive and repulsive node-node interactions for the contrast in an attractive solvent medium. Variations of the mean square displacement of the center node of the sheet and that of its center of mass with the time steps are examined in detail which show different power-law motion from short to long time regimes. Relaxation of the gyration radius and scaling of its asymptotic value with the molecular weight are examined.

Stress Recovery and Error Estimation for 3-D Shell Structures

NASA Technical Reports Server (NTRS)

Riggs, H. R.

2000-01-01

The C1-continuous stress fields obtained from finite element analyses are in general lower- order accurate than are the corresponding displacement fields. Much effort has focussed on increasing their accuracy and/or their continuity, both for improved stress prediction and especially error estimation. A previous project developed a penalized, discrete least squares variational procedure that increases the accuracy and continuity of the stress field. The variational problem is solved by a post-processing, 'finite-element-type' analysis to recover a smooth, more accurate, C1-continuous stress field given the 'raw' finite element stresses. This analysis has been named the SEA/PDLS. The recovered stress field can be used in a posteriori error estimators, such as the Zienkiewicz-Zhu error estimator or equilibrium error estimators. The procedure was well-developed for the two-dimensional (plane) case involving low-order finite elements. It has been demonstrated that, if optimal finite element stresses are used for the post-processing, the recovered stress field is globally superconvergent. Extension of this work to three dimensional solids is straightforward. Attachment: Stress recovery and error estimation for shell structure (abstract only). A 4-node, shear-deformable flat shell element developed via explicit Kirchhoff constraints (abstract only). A novel four-node quadrilateral smoothing element for stress enhancement and error estimation (abstract only).

Remote monitoring and fault recovery for FPGA-based field controllers of telescope and instruments

NASA Astrophysics Data System (ADS)

Zhu, Yuhua; Zhu, Dan; Wang, Jianing

2012-09-01

As the increasing size and more and more functions, modern telescopes have widely used the control architecture, i.e. central control unit plus field controller. FPGA-based field controller has the advantages of field programmable, which provide a great convenience for modifying software and hardware of control system. It also gives a good platform for implementation of the new control scheme. Because of multi-controlled nodes and poor working environment in scattered locations, reliability and stability of the field controller should be fully concerned. This paper mainly describes how we use the FPGA-based field controller and Ethernet remote to construct monitoring system with multi-nodes. When failure appearing, the new FPGA chip does self-recovery first in accordance with prerecovery strategies. In case of accident, remote reconstruction for the field controller can be done through network intervention if the chip is not being restored. This paper also introduces the network remote reconstruction solutions of controller, the system structure and transport protocol as well as the implementation methods. The idea of hardware and software design is given based on the FPGA. After actual operation on the large telescopes, desired results have been achieved. The improvement increases system reliability and reduces workload of maintenance, showing good application and popularization.

A regenerative microchannel neural interface for recording from and stimulating peripheral axons in vivo

NASA Astrophysics Data System (ADS)

FitzGerald, James J.; Lago, Natalia; Benmerah, Samia; Serra, Jordi; Watling, Christopher P.; Cameron, Ruth E.; Tarte, Edward; Lacour, Stéphanie P.; McMahon, Stephen B.; Fawcett, James W.

2012-02-01

Neural interfaces are implanted devices that couple the nervous system to electronic circuitry. They are intended for long term use to control assistive technologies such as muscle stimulators or prosthetics that compensate for loss of function due to injury. Here we present a novel design of interface for peripheral nerves. Recording from axons is complicated by the small size of extracellular potentials and the concentration of current flow at nodes of Ranvier. Confining axons to microchannels of ˜100 µm diameter produces amplified potentials that are independent of node position. After implantation of microchannel arrays into rat sciatic nerve, axons regenerated through the channels forming ‘mini-fascicles’, each typically containing ˜100 myelinated fibres and one or more blood vessels. Regenerated motor axons reconnected to distal muscles, as demonstrated by the recovery of an electromyogram and partial prevention of muscle atrophy. Efferent motor potentials and afferent signals evoked by muscle stretch or cutaneous stimulation were easily recorded from the mini-fascicles and were in the range of 35-170 µV. Individual motor units in distal musculature were activated from channels using stimulus currents in the microampere range. Microchannel interfaces are a potential solution for applications such as prosthetic limb control or enhancing recovery after nerve injury.

Broadband Control of Topological Nodes in Electromagnetic Fields

NASA Astrophysics Data System (ADS)

Song, Alex Y.; Catrysse, Peter B.; Fan, Shanhui

2018-05-01

We study topological nodes (phase singularities) in electromagnetic wave interactions with structures. We show that, when the nodes exist, it is possible to bind certain nodes to a specific plane in the structure by a combination of mirror and time-reversal symmetry. Such binding does not rely on any resonances in the structure. As a result, the nodes persist on the plane over a wide wavelength range. As an implication of such broadband binding, we demonstrate that the topological nodes can be used for hiding of metallic objects over a broad wavelength range.

Strategies for synchronisation in an evolving telecommunications network

NASA Astrophysics Data System (ADS)

Avery, Rob

1992-06-01

The achievement of precise synchronization in the telecommunications environment is addressed. Transmitting the timing from node to node has been the inherent problem for all digital networks. Traditional network equipment used to transfer synchronization, such as digital switching ststems, adds impairments to the once traceable signal. As the synchronization signals are passed from node to node, they lose stability by passing through intervening clocks. Timing would be an integrated part of all new network and service deployments. New transmission methods, such as the Synchronous Digital Hierarchy (SDH), survivable network topologies and the issues that arise from them, necessitate a review of current network synchronization strategies. Challenges that face the network are itemized. A demonstration of why localized Primary Reference Clocks (PRC) in key nodes and the Synchronization Supply Unit (SSU) clock architecture of transit and local node clocks is a technically and economically viable solution to the issues facing network planners today is given.

Analyzing the Effects of UAV Mobility Patterns on Data Collection in Wireless Sensor Networks.

PubMed

Rashed, Sarmad; Soyturk, Mujdat

2017-02-20

Sensor nodes in a Wireless Sensor Network (WSN) can be dispersed over a remote sensing area (e.g., the regions that are hardly accessed by human beings). In such kinds of networks, datacollectionbecomesoneofthemajorissues. Getting connected to each sensor node and retrieving the information in time introduces new challenges. Mobile sink usage-especially Unmanned Aerial Vehicles (UAVs)-is the most convenient approach to covering the area and accessing each sensor node in such a large-scale WSN. However, the operation of the UAV depends on some parameters, such as endurance time, altitude, speed, radio type in use, and the path. In this paper, we explore various UAV mobility patterns that follow different paths to sweep the operation area in order to seek the best area coverage with the maximum number of covered nodes in the least amount of time needed by the mobile sink. We also introduce a new metric to formulate the tradeoff between maximizing the covered nodes and minimizing the operation time when choosing the appropriate mobility pattern. A realistic simulation environment is used in order to compare and evaluate the performance of the system. We present the performance results for the explored UAV mobility patterns. The results are very useful to present the tradeoff between maximizing the covered nodes and minimizing the operation time to choose the appropriate mobility pattern.

Analyzing the Effects of UAV Mobility Patterns on Data Collection in Wireless Sensor Networks

PubMed Central

Rashed, Sarmad; Soyturk, Mujdat

2017-01-01

Sensor nodes in a Wireless Sensor Network (WSN) can be dispersed over a remote sensing area (e.g., the regions that are hardly accessed by human beings). In such kinds of networks, data collection becomes one of the major issues. Getting connected to each sensor node and retrieving the information in time introduces new challenges. Mobile sink usage—especially Unmanned Aerial Vehicles (UAVs)—is the most convenient approach to covering the area and accessing each sensor node in such a large-scale WSN. However, the operation of the UAV depends on some parameters, such as endurance time, altitude, speed, radio type in use, and the path. In this paper, we explore various UAV mobility patterns that follow different paths to sweep the operation area in order to seek the best area coverage with the maximum number of covered nodes in the least amount of time needed by the mobile sink. We also introduce a new metric to formulate the tradeoff between maximizing the covered nodes and minimizing the operation time when choosing the appropriate mobility pattern. A realistic simulation environment is used in order to compare and evaluate the performance of the system. We present the performance results for the explored UAV mobility patterns. The results are very useful to present the tradeoff between maximizing the covered nodes and minimizing the operation time to choose the appropriate mobility pattern. PMID:28230727

nodeGame: Real-time, synchronous, online experiments in the browser.

PubMed

Balietti, Stefano

2017-10-01

nodeGame is a free, open-source JavaScript/ HTML5 framework for conducting synchronous experiments online and in the lab directly in the browser window. It is specifically designed to support behavioral research along three dimensions: (i) larger group sizes, (ii) real-time (but also discrete time) experiments, and (iii) batches of simultaneous experiments. nodeGame has a modular source code, and defines an API (application programming interface) through which experimenters can create new strategic environments and configure the platform. With zero-install, nodeGame can run on a great variety of devices, from desktop computers to laptops, smartphones, and tablets. The current version of the software is 3.0, and extensive documentation is available on the wiki pages at http://nodegame.org .

Intraoperative Nerve Blocks Fail to Improve Quality of Recovery after Tissue Expander Breast Reconstruction: A Prospective, Double-Blinded, Randomized, Placebo-Controlled Clinical Trial.

PubMed

Lanier, Steven T; Lewis, Kevin C; Kendall, Mark C; Vieira, Brittany L; De Oliveira, Gildasio; Nader, Anthony; Kim, John Y S; Alghoul, Mohammed

2018-03-01

The authors' study represents the first level I evidence to assess whether intraoperative nerve blocks improve the quality of recovery from immediate tissue expander/implant breast reconstruction. A prospective, randomized, double-blinded, placebo-controlled clinical trial was conducted in which patients undergoing immediate tissue expander/implant breast reconstruction were randomized to either (1) intraoperative intercostal and pectoral nerve blocks with 0.25% bupivacaine with 1:200,000 epinephrine and 4 mg of dexamethasone or (2) sham nerve blocks with normal saline. The 40-item Quality of Recovery score, pain score, and opioid use in the postoperative period were compared statistically between groups. Power analysis ensured 80 percent power to detect a 10-point (clinically significant) difference in the 40-item Quality of Recovery score. Forty-seven patients were enrolled. Age, body mass index, laterality, mastectomy type, and lymph node dissection were similar between groups. There were no statistical differences in quality of recovery, pain burden as measured by visual analogue scale, opioid consumption, antiemetic use, or length of hospital stay between groups at 24 hours after surgery. Mean global 40-item Quality of Recovery scores were 169 (range, 155 to 182) for the treatment arm and 165 (range, 143 to 179) for the placebo arm (p = 0.36), indicating a high quality of recovery in both groups. Although intraoperative nerve blocks can be a safe adjunct to a comprehensive postsurgical recovery regimen, the authors' results indicate no effect on overall quality of recovery from tissue expander/implant breast reconstruction. Therapeutic, I.

Adaptive feedback synchronisation of complex dynamical network with discrete-time communications and delayed nodes

NASA Astrophysics Data System (ADS)

Wang, Tong; Ding, Yongsheng; Zhang, Lei; Hao, Kuangrong

2016-08-01

This paper considered the synchronisation of continuous complex dynamical networks with discrete-time communications and delayed nodes. The nodes in the dynamical networks act in the continuous manner, while the communications between nodes are discrete-time; that is, they communicate with others only at discrete time instants. The communication intervals in communication period can be uncertain and variable. By using a piecewise Lyapunov-Krasovskii function to govern the characteristics of the discrete communication instants, we investigate the adaptive feedback synchronisation and a criterion is derived to guarantee the existence of the desired controllers. The globally exponential synchronisation can be achieved by the controllers under the updating laws. Finally, two numerical examples including globally coupled network and nearest-neighbour coupled networks are presented to demonstrate the validity and effectiveness of the proposed control scheme.

Spaceflight Associated Apoptosis

NASA Technical Reports Server (NTRS)

Ichiki, Albert T.; Gibson, Linda A.; Allebban, Zuhair

1996-01-01

Lymphoid tissues have been shown to atrophy in rats flown on Russian spaceflights. Histological examination indicated evidence for cell degradation. Lymphoid tissues from rats flown on Spacelab Life Sciences-2 mission were analyzed for apoptosis by evidence of fragmented lymphocytes, which could be engulfed by macrophages, or DNA strand breaks using the terminal deoxynucleotidyl transferase-mediated dUTP nick end-labeling (TUNEL) assay. Apoptosis was not detected in the thymus and spleen collected inflight or from the synchronous ground rats but was detected in the thymus, spleen and inguinal lymph node of the flight animals on recovery. These results indicate that the apoptosis observed in the lymphatic tissues of the rats on recovery could have been induced by the gravitational stress of reentry, corroborating the findings from the early space-flight observations.

International Space Station (ISS)

NASA Image and Video Library

2000-01-01

This diagram shows the flow of recyclable resources in the International Space Station (ISS). The Environmental Control and Life Support System (ECLSS) Group of the Flight Projects Directorate at the Marshall Space Flight Center is responsible for the regenerative ECLSS hardware, as well as providing technical support for the rest of the system. The regenerative ECLSS, whose main components are the Water Recovery System (WRS), and the Oxygen Generation System (OGS), reclaims and recycles water and oxygen. The ECLSS maintains a pressurized habitation environment, provides water recovery and storage, maintains and provides fire detection / suppression, and provides breathable air and a comfortable atmosphere in which to live and work within the ISS. The ECLSS hardware will be located in the Node 3 module of the ISS.

Regenerative Environmental Control and Life Support System Diagram

NASA Technical Reports Server (NTRS)

2000-01-01

This diagram shows the flow of recyclable resources in the International Space Station (ISS). The Environmental Control and Life Support System (ECLSS) Group of the Flight Projects Directorate at the Marshall Space Flight Center is responsible for the regenerative ECLSS hardware, as well as providing technical support for the rest of the system. The regenerative ECLSS, whose main components are the Water Recovery System (WRS), and the Oxygen Generation System (OGS), reclaims and recycles water and oxygen. The ECLSS maintains a pressurized habitation environment, provides water recovery and storage, maintains and provides fire detection / suppression, and provides breathable air and a comfortable atmosphere in which to live and work within the ISS. The ECLSS hardware will be located in the Node 3 module of the ISS.

Network structures sustained by internal links and distributed lifetime of old nodes in stationary state of number of nodes

NASA Astrophysics Data System (ADS)

Ikeda, Nobutoshi

2017-12-01

In network models that take into account growth properties, deletion of old nodes has a serious impact on degree distributions, because old nodes tend to become hub nodes. In this study, we aim to provide a simple explanation for why hubs can exist even in conditions where the number of nodes is stationary due to the deletion of old nodes. We show that an exponential increase in the degree of nodes is a natural consequence of the balance between the deletion and addition of nodes as long as a preferential attachment mechanism holds. As a result, the largest degree is determined by the magnitude relationship between the time scale of the exponential growth of degrees and lifetime of old nodes. The degree distribution exhibits a power-law form ˜ k -γ with exponent γ = 1 when the lifetime of nodes is constant. However, various values of γ can be realized by introducing distributed lifetime of nodes.

An Energy Efficient Simultaneous-Node Repositioning Algorithm for Mobile Sensor Networks

PubMed Central

Hasbullah, Halabi; Nazir, Babar; Khan, Imran Ali

2014-01-01

Recently, wireless sensor network (WSN) applications have seen an increase in interest. In search and rescue, battlefield reconnaissance, and some other such applications, so that a survey of the area of interest can be made collectively, a set of mobile nodes is deployed. Keeping the network nodes connected is vital for WSNs to be effective. The provision of connectivity can be made at the time of startup and can be maintained by carefully coordinating the nodes when they move. However, if a node suddenly fails, the network could be partitioned to cause communication problems. Recently, several methods that use the relocation of nodes for connectivity restoration have been proposed. However, these methods have the tendency to not consider the potential coverage loss in some locations. This paper addresses the concerns of both connectivity and coverage in an integrated way so that this gap can be filled. A novel algorithm for simultaneous-node repositioning is introduced. In this approach, each neighbour of the failed node, one by one, moves in for a certain amount of time to take the place of the failed node, after which it returns to its original location in the network. The effectiveness of this algorithm has been verified by the simulation results. PMID:25152924

Saliency Detection via Absorbing Markov Chain With Learnt Transition Probability.

PubMed

Lihe Zhang; Jianwu Ai; Bowen Jiang; Huchuan Lu; Xiukui Li

2018-02-01

In this paper, we propose a bottom-up saliency model based on absorbing Markov chain (AMC). First, a sparsely connected graph is constructed to capture the local context information of each node. All image boundary nodes and other nodes are, respectively, treated as the absorbing nodes and transient nodes in the absorbing Markov chain. Then, the expected number of times from each transient node to all other transient nodes can be used to represent the saliency value of this node. The absorbed time depends on the weights on the path and their spatial coordinates, which are completely encoded in the transition probability matrix. Considering the importance of this matrix, we adopt different hierarchies of deep features extracted from fully convolutional networks and learn a transition probability matrix, which is called learnt transition probability matrix. Although the performance is significantly promoted, salient objects are not uniformly highlighted very well. To solve this problem, an angular embedding technique is investigated to refine the saliency results. Based on pairwise local orderings, which are produced by the saliency maps of AMC and boundary maps, we rearrange the global orderings (saliency value) of all nodes. Extensive experiments demonstrate that the proposed algorithm outperforms the state-of-the-art methods on six publicly available benchmark data sets.

Wireless Sensor Networks - Node Localization for Various Industry Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Derr, Kurt; Manic, Milos

Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothingmore » (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.« less

Wireless Sensor Networks - Node Localization for Various Industry Problems

DOE PAGES

Derr, Kurt; Manic, Milos

2015-06-01

Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothingmore » (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.« less

Network geometry inference using common neighbors

NASA Astrophysics Data System (ADS)

Papadopoulos, Fragkiskos; Aldecoa, Rodrigo; Krioukov, Dmitri

2015-08-01

We introduce and explore a method for inferring hidden geometric coordinates of nodes in complex networks based on the number of common neighbors between the nodes. We compare this approach to the HyperMap method, which is based only on the connections (and disconnections) between the nodes, i.e., on the links that the nodes have (or do not have). We find that for high degree nodes, the common-neighbors approach yields a more accurate inference than the link-based method, unless heuristic periodic adjustments (or "correction steps") are used in the latter. The common-neighbors approach is computationally intensive, requiring O (t4) running time to map a network of t nodes, versus O (t3) in the link-based method. But we also develop a hybrid method with O (t3) running time, which combines the common-neighbors and link-based approaches, and we explore a heuristic that reduces its running time further to O (t2) , without significant reduction in the mapping accuracy. We apply this method to the autonomous systems (ASs) Internet, and we reveal how soft communities of ASs evolve over time in the similarity space. We further demonstrate the method's predictive power by forecasting future links between ASs. Taken altogether, our results advance our understanding of how to efficiently and accurately map real networks to their latent geometric spaces, which is an important necessary step toward understanding the laws that govern the dynamics of nodes in these spaces, and the fine-grained dynamics of network connections.

Exploring the use of I/O nodes for computation in a MIMD multiprocessor

NASA Technical Reports Server (NTRS)

Kotz, David; Cai, Ting

1995-01-01

As parallel systems move into the production scientific-computing world, the emphasis will be on cost-effective solutions that provide high throughput for a mix of applications. Cost effective solutions demand that a system make effective use of all of its resources. Many MIMD multiprocessors today, however, distinguish between 'compute' and 'I/O' nodes, the latter having attached disks and being dedicated to running the file-system server. This static division of responsibilities simplifies system management but does not necessarily lead to the best performance in workloads that need a different balance of computation and I/O. Of course, computational processes sharing a node with a file-system service may receive less CPU time, network bandwidth, and memory bandwidth than they would on a computation-only node. In this paper we begin to examine this issue experimentally. We found that high performance I/O does not necessarily require substantial CPU time, leaving plenty of time for application computation. There were some complex file-system requests, however, which left little CPU time available to the application. (The impact on network and memory bandwidth still needs to be determined.) For applications (or users) that cannot tolerate an occasional interruption, we recommend that they continue to use only compute nodes. For tolerant applications needing more cycles than those provided by the compute nodes, we recommend that they take full advantage of both compute and I/O nodes for computation, and that operating systems should make this possible.

Comparison of short-term outcomes between laparoscopic-assisted and open complete mesocolic excision (CME) for the treatment of transverse colon cancer.

PubMed

Wang, Yong; Zhang, Chuan; Feng, Yi-Fei; Fu, Zan; Sun, Yue-Ming

2017-02-01

Colorectal cancer (CRC) is the third most common cancer worldwide. Although laparoscopic-assisted complete mesocolic excision (LCME) is a superior treatment, there are few studies available on it owe to the low incidence and technical difficulty of LCME in transverse colon cancer. The clinical data of 78 patients with transverse colon cancer who were treated by LCME and open complete mesocolic excision (OCME) were retrospectively analyzed. A total of 39 cases had been treated by LCME, compared with 39 cases treated by OCME. The patient characteristics and short-term outcomes including operation time, intra-operative blood loss, length of incision, time to first flatus, first postoperative ambulation, postoperative hospitalization time, number of harvested lymph nodes, length of resected specimen and incidence of complications were evaluated. There was no case converted to OCME in LCME group. LCME had significantly shorter length of incision, shorter operation time, less intra-operative blood loss, shorter postoperative hospitalization time (P<0.05). The length of resected specimen and the numbers of harvested lymph nodes were (26.5±5.4 cm) and (16.2±3.1) in LCME group, and (24.8±4.9 cm) and (15.1±3.5) in OCME group, with no differences between two groups. The incidence of wound infection was lower while the incidence of lymphatic leakage, anastomotic leakage, urinary tract infection and wound dehiscence had no significant differences between two groups. None of patients in these two groups developed urinary retention, anastomotic bleeding and postoperative intestinal obstruction. Our findings suggested that LCME is a safe, feasible and effective treatment method for the treatment of transverse colon cancer due to it can provide superior short-term outcomes including less intra-operative blood loss, faster recovery and lower incidence of wound infection.

Time and frequency transfer by the Master-Slave Returnable Timing System technique - Application to solar power transmission

NASA Technical Reports Server (NTRS)

Lindsey, W. C.; Kantak, A. V.

1979-01-01

The concept of the Master Slave Returnable Timing System (MSRTS) is presented which combines the advantages of the master slave (MS) and the Returnable Timing System (RTS) for time and frequency transfer. The basic idea of MSRTS is to send the time-frequency signal received at a particular node back to the sending node. The delay accumulated by this return signal is used to advance the phase of the master (sending) node thereby canceling the effect of the delay introduced by the path. The method can be used in highly accurate clock distribution systems required in avionics, computer communications, and large retrodirective phased arrays such as the Solar Power Satellite.

Fuzzy Logic-Based Guaranteed Lifetime Protocol for Real-Time Wireless Sensor Networks.

PubMed

Shah, Babar; Iqbal, Farkhund; Abbas, Ali; Kim, Ki-Il

2015-08-18

Few techniques for guaranteeing a network lifetime have been proposed despite its great impact on network management. Moreover, since the existing schemes are mostly dependent on the combination of disparate parameters, they do not provide additional services, such as real-time communications and balanced energy consumption among sensor nodes; thus, the adaptability problems remain unresolved among nodes in wireless sensor networks (WSNs). To solve these problems, we propose a novel fuzzy logic model to provide real-time communication in a guaranteed WSN lifetime. The proposed fuzzy logic controller accepts the input descriptors energy, time and velocity to determine each node's role for the next duration and the next hop relay node for real-time packets. Through the simulation results, we verified that both the guaranteed network's lifetime and real-time delivery are efficiently ensured by the new fuzzy logic model. In more detail, the above-mentioned two performance metrics are improved up to 8%, as compared to our previous work, and 14% compared to existing schemes, respectively.

Digital seismo-acoustic signal processing aboard a wireless sensor platform

NASA Astrophysics Data System (ADS)

Marcillo, O.; Johnson, J. B.; Lorincz, K.; Werner-Allen, G.; Welsh, M.

2006-12-01

We are developing a low power, low-cost wireless sensor array to conduct real-time signal processing of earthquakes at active volcanoes. The sensor array, which integrates data from both seismic and acoustic sensors, is based on Moteiv TMote Sky wireless sensor nodes (www.moteiv.com). The nodes feature a Texas Instruments MSP430 microcontroller, 48 Kbytes of program memory, 10 Kbytes of static RAM, 1 Mbyte of external flash memory, and a 2.4-GHz Chipcon CC2420 IEEE 802.15.4 radio. The TMote Sky is programmed in TinyOS. Basic signal processing occurs on an array of three peripheral sensor nodes. These nodes are tied into a dedicated GPS receiver node, which is focused on time synchronization, and a central communications node, which handles data integration and additional processing. The sensor nodes incorporate dual 12-bit digitizers sampling a seismic sensor and a pressure transducer at 100 samples per second. The wireless capabilities of the system allow flexible array geometry, with a maximum aperture of 200m. We have already developed the digital signal processing routines on board the Moteiv Tmote sensor nodes. The developed routines accomplish Real-time Seismic-Amplitude Measurement (RSAM), Seismic Spectral- Amplitude Measurement (SSAM), and a user-configured Short Term Averaging / Long Term Averaging (STA LTA ratio), which is used to calculate first arrivals. The processed data from individual nodes are transmitted back to a central node, where additional processing may be performed. Such processing will include back azimuth determination and other wave field analyses. Future on-board signal processing will focus on event characterization utilizing pattern recognition and spectral characterization. The processed data is intended as low bandwidth information which can be transmitted periodically and at low cost through satellite telemetry to a web server. The processing is limited by the computational capabilities (RAM, ROM) of the nodes. Nevertheless, we envision this product to be a useful tool for assessing the state of unrest at remote volcanoes.

Aquatic Debris Detection Using Embedded Camera Sensors

PubMed Central

Wang, Yong; Wang, Dianhong; Lu, Qian; Luo, Dapeng; Fang, Wu

2015-01-01

Aquatic debris monitoring is of great importance to human health, aquatic habitats and water transport. In this paper, we first introduce the prototype of an aquatic sensor node equipped with an embedded camera sensor. Based on this sensing platform, we propose a fast and accurate debris detection algorithm. Our method is specifically designed based on compressive sensing theory to give full consideration to the unique challenges in aquatic environments, such as waves, swaying reflections, and tight energy budget. To upload debris images, we use an efficient sparse recovery algorithm in which only a few linear measurements need to be transmitted for image reconstruction. Besides, we implement the host software and test the debris detection algorithm on realistically deployed aquatic sensor nodes. The experimental results demonstrate that our approach is reliable and feasible for debris detection using camera sensors in aquatic environments. PMID:25647741

The Carnegie Mellon University Insert Project

DTIC Science & Technology

1997-02-01

Real - Time Systems (INSERT) project under the DARPA Evolutionary Design for Complex Software (EDCS) Program. The INSERT team has completed an initial API definition and ported the existing real-time publication subscription group communication software to LynxOS 2.4, a POSIX.1b compliant OS. The distributed real-time publisher/subscriber communication model is now supported by a processor membership protocol which allows a node in the system to fail, or to rejoin the system later. When a node fails, all the publishers and subscribers on that node have to be

Collaborative Operations for Personnel Recovery

DTIC Science & Technology

2008-02-01

ADDRESS(ES) Artificial Intelligence Applications Institute The University of Edinburgh Appleton Tower, Crichton St. Edinburgh EH8 9LE, UK 8...this issue, • M is a symbol denoting a primitive plan modification activity, and • O1,…,On are plan-space objects, i.e. they are issues, nodes...of this type represents the fact that the plan-space object O was introduced into the plan as part of performing the plan modification activity M

Evaluation of lymphoma in a cat using 99mTc-sestamibi.

PubMed

Lenard, Zoe M; Zuber, Richard M; Nicoll, Robert G; O'Hara, Amanda J; Lester, Nola V

2005-01-01

This report describes the evaluation of cutaneous lymphoma in a cat using 99mTc-sestamibi. A mass in the left pes with extension to the left popliteal lymph node was diagnosed as B-cell lymphoma. Thoracic and abdominal radiography and abdominal ultrasound were unremarkable. Scintigraphy using 99mTc-sestamibi confirmed the lesion was confined to the left hind leg, and the leg was amputated. The cat made a full recovery.

Burbank performs Part 1 of the WRS-1 Repair

NASA Image and Video Library

2012-03-08

ISS030-E-128752 (8 March 2012) --- NASA astronaut Dan Burbank, Expedition 30 commander, performs part one of the Water Recovery System-1 (WRS-1) repair in the Tranquility node of the International Space Station. Burbank removed and replaced the failed Catalytic Reactor (CR), and installed a temporary filter kit between the new CR and the Microbial Check Valve (MCV) to support a system flush of the new Orbital Replacement Unit (ORU).

Effect of neonatal injection of sodium glutamate and diethylnitrosamine on hepatocarcinogenesis, reproductive and adrenocortical systems of male mice.

PubMed

Kuznetsova, E G; Amstislavskaya, T G; Bulygina, V V; Il'nitskaya, S I

2005-06-01

Neonatal injection of sodium glutamate before injection of diethylnitrosamine decreased the number of tumor nodes in the liver of male mice, decreased the weight of the testes and adrenals and blood level of testosterone (but increased blood level of corticosterone), impaired recovery of diethylnitrosamine-disturbed sexual motivation in half of males. Anticarcinogenic effect of sodium glutamate is explained by feminization of males under its effect.

Multi-agent grid system Agent-GRID with dynamic load balancing of cluster nodes

NASA Astrophysics Data System (ADS)

Satymbekov, M. N.; Pak, I. T.; Naizabayeva, L.; Nurzhanov, Ch. A.

2017-12-01

In this study the work presents the system designed for automated load balancing of the contributor by analysing the load of compute nodes and the subsequent migration of virtual machines from loaded nodes to less loaded ones. This system increases the performance of cluster nodes and helps in the timely processing of data. A grid system balances the work of cluster nodes the relevance of the system is the award of multi-agent balancing for the solution of such problems.

An Energy Scaled and Expanded Vector-Based Forwarding Scheme for Industrial Underwater Acoustic Sensor Networks with Sink Mobility.

PubMed

Wadud, Zahid; Hussain, Sajjad; Javaid, Nadeem; Bouk, Safdar Hussain; Alrajeh, Nabil; Alabed, Mohamad Souheil; Guizani, Nadra

2017-09-30

Industrial Underwater Acoustic Sensor Networks (IUASNs) come with intrinsic challenges like long propagation delay, small bandwidth, large energy consumption, three-dimensional deployment, and high deployment and battery replacement cost. Any routing strategy proposed for IUASN must take into account these constraints. The vector based forwarding schemes in literature forward data packets to sink using holding time and location information of the sender, forwarder, and sink nodes. Holding time suppresses data broadcasts; however, it fails to keep energy and delay fairness in the network. To achieve this, we propose an Energy Scaled and Expanded Vector-Based Forwarding (ESEVBF) scheme. ESEVBF uses the residual energy of the node to scale and vector pipeline distance ratio to expand the holding time. Resulting scaled and expanded holding time of all forwarding nodes has a significant difference to avoid multiple forwarding, which reduces energy consumption and energy balancing in the network. If a node has a minimum holding time among its neighbors, it shrinks the holding time and quickly forwards the data packets upstream. The performance of ESEVBF is analyzed through in network scenario with and without node mobility to ensure its effectiveness. Simulation results show that ESEVBF has low energy consumption, reduces forwarded data copies, and less end-to-end delay.

DE-Sync: A Doppler-Enhanced Time Synchronization for Mobile Underwater Sensor Networks.

PubMed

Zhou, Feng; Wang, Qi; Nie, DongHu; Qiao, Gang

2018-05-25

Time synchronization is the foundation of cooperative work among nodes of underwater sensor networks; it takes a critical role in the research and application of underwater sensor networks. Although numerous time synchronization protocols have been proposed for terrestrial wireless sensor networks, they cannot be directly applied to underwater sensor networks. This is because most of them typically assume that the propagation delay among sensor nodes is negligible, which is not the case in underwater sensor networks. Time synchronization is mainly affected by a long propagation delay among sensor nodes due to the low propagation speed of acoustic signals. Furthermore, sensor nodes in underwater tend to experience some degree of mobility due to wind or ocean current, or some other nodes are on self-propelled vehicles, such as autonomous underwater vehicles (AUVs). In this paper, we propose a Doppler-enhanced time synchronization scheme for mobile underwater sensor networks, called DE-Sync. Our new scheme considers the effect of the clock skew during the process of estimating the Doppler scale factor and directly substitutes the Doppler scale factor into linear regression to achieve the estimation of the clock skew and offset. Simulation results show that DE-Sync outperforms existing time synchronization protocols in both accuracy and energy efficiency.

Sentinel Node Detection in Head and Neck Malignancies: Innovations in Radioguided Surgery

PubMed Central

Vermeeren, L.; Klop, W. M. C.; van den Brekel, M. W. M.; Balm, A. J. M.; Nieweg, O. E.; Valdés Olmos, R. A.

2009-01-01

Sentinel node mapping is becoming a routine procedure for staging of various malignancies, because it can determine lymph node status more precisely. Due to anatomical problems, localizing sentinel nodes in the head and neck region on the basis of conventional images can be difficult. New diagnostic tools can provide better visualization of sentinel nodes. In an attempt to keep up with possible scientific progress, this article reviews new and innovative tools for sentinel node localization in this specific area. The overview comprises a short introduction of the sentinel node procedure as well as indications in the head and neck region. Then the results of SPECT/CT for sentinel node detection are described. Finally, a portable gamma camera to enable intraoperative real-time imaging with improved sentinel node detection is described. PMID:20016804

Coherent exciton transport in dendrimers and continuous-time quantum walks

NASA Astrophysics Data System (ADS)

Mülken, Oliver; Bierbaum, Veronika; Blumen, Alexander

2006-03-01

We model coherent exciton transport in dendrimers by continuous-time quantum walks. For dendrimers up to the second generation the coherent transport shows perfect recurrences when the initial excitation starts at the central node. For larger dendrimers, the recurrence ceases to be perfect, a fact which resembles results for discrete quantum carpets. Moreover, depending on the initial excitation site, we find that the coherent transport to certain nodes of the dendrimer has a very low probability. When the initial excitation starts from the central node, the problem can be mapped onto a line which simplifies the computational effort. Furthermore, the long time average of the quantum mechanical transition probabilities between pairs of nodes shows characteristic patterns and allows us to classify the nodes into clusters with identical limiting probabilities. For the (space) average of the quantum mechanical probability to be still or to be again at the initial site, we obtain, based on the Cauchy-Schwarz inequality, a simple lower bound which depends only on the eigenvalue spectrum of the Hamiltonian.

A Markovian model of evolving world input-output network

PubMed Central

Isacchini, Giulio

2017-01-01

The initial theoretical connections between Leontief input-output models and Markov chains were established back in 1950s. However, considering the wide variety of mathematical properties of Markov chains, so far there has not been a full investigation of evolving world economic networks with Markov chain formalism. In this work, using the recently available world input-output database, we investigated the evolution of the world economic network from 1995 to 2011 through analysis of a time series of finite Markov chains. We assessed different aspects of this evolving system via different known properties of the Markov chains such as mixing time, Kemeny constant, steady state probabilities and perturbation analysis of the transition matrices. First, we showed how the time series of mixing times and Kemeny constants could be used as an aggregate index of globalization. Next, we focused on the steady state probabilities as a measure of structural power of the economies that are comparable to GDP shares of economies as the traditional index of economies welfare. Further, we introduced two measures of systemic risk, called systemic influence and systemic fragility, where the former is the ratio of number of influenced nodes to the total number of nodes, caused by a shock in the activity of a node, and the latter is based on the number of times a specific economic node is affected by a shock in the activity of any of the other nodes. Finally, focusing on Kemeny constant as a global indicator of monetary flow across the network, we showed that there is a paradoxical effect of a change in activity levels of economic nodes on the overall flow of the world economic network. While the economic slowdown of the majority of nodes with high structural power results to a slower average monetary flow over the network, there are some nodes, where their slowdowns improve the overall quality of the network in terms of connectivity and the average flow of the money. PMID:29065145

Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem

NASA Astrophysics Data System (ADS)

Taoka, Satoshi; Takafuji, Daisuke; Watanabe, Toshimasa

A branch-and-bound algorithm (BB for short) is the most general technique to deal with various combinatorial optimization problems. Even if it is used, computation time is likely to increase exponentially. So we consider its parallelization to reduce it. It has been reported that the computation time of a parallel BB heavily depends upon node-variable selection strategies. And, in case of a parallel BB, it is also necessary to prevent increase in communication time. So, it is important to pay attention to how many and what kind of nodes are to be transferred (called sending-node selection strategy). In this paper, for the graph coloring problem, we propose some sending-node selection strategies for a parallel BB algorithm by adopting MPI for parallelization and experimentally evaluate how these strategies affect computation time of a parallel BB on a PC cluster network.

Single-agent parallel window search

NASA Technical Reports Server (NTRS)

Powley, Curt; Korf, Richard E.

1991-01-01

Parallel window search is applied to single-agent problems by having different processes simultaneously perform iterations of Iterative-Deepening-A(asterisk) (IDA-asterisk) on the same problem but with different cost thresholds. This approach is limited by the time to perform the goal iteration. To overcome this disadvantage, the authors consider node ordering. They discuss how global node ordering by minimum h among nodes with equal f = g + h values can reduce the time complexity of serial IDA-asterisk by reducing the time to perform the iterations prior to the goal iteration. Finally, the two ideas of parallel window search and node ordering are combined to eliminate the weaknesses of each approach while retaining the strengths. The resulting approach, called simply parallel window search, can be used to find a near-optimal solution quickly, improve the solution until it is optimal, and then finally guarantee optimality, depending on the amount of time available.

Dynamic Communicability Predicts Infectiousness

NASA Astrophysics Data System (ADS)

Mantzaris, Alexander V.; Higham, Desmond J.

Using real, time-dependent social interaction data, we look at correlations between some recently proposed dynamic centrality measures and summaries from large-scale epidemic simulations. The evolving network arises from email exchanges. The centrality measures, which are relatively inexpensive to compute, assign rankings to individual nodes based on their ability to broadcast information over the dynamic topology. We compare these with node rankings based on infectiousness that arise when a full stochastic SI simulation is performed over the dynamic network. More precisely, we look at the proportion of the network that a node is able to infect over a fixed time period, and the length of time that it takes for a node to infect half the network. We find that the dynamic centrality measures are an excellent, and inexpensive, proxy for the full simulation-based measures.

Lymph node segmentation on CT images by a shape model guided deformable surface methodh

NASA Astrophysics Data System (ADS)

Maleike, Daniel; Fabel, Michael; Tetzlaff, Ralf; von Tengg-Kobligk, Hendrik; Heimann, Tobias; Meinzer, Hans-Peter; Wolf, Ivo

2008-03-01

With many tumor entities, quantitative assessment of lymph node growth over time is important to make therapy choices or to evaluate new therapies. The clinical standard is to document diameters on transversal slices, which is not the best measure for a volume. We present a new algorithm to segment (metastatic) lymph nodes and evaluate the algorithm with 29 lymph nodes in clinical CT images. The algorithm is based on a deformable surface search, which uses statistical shape models to restrict free deformation. To model lymph nodes, we construct an ellipsoid shape model, which strives for a surface with strong gradients and user-defined gray values. The algorithm is integrated into an application, which also allows interactive correction of the segmentation results. The evaluation shows that the algorithm gives good results in the majority of cases and is comparable to time-consuming manual segmentation. The median volume error was 10.1% of the reference volume before and 6.1% after manual correction. Integrated into an application, it is possible to perform lymph node volumetry for a whole patient within the 10 to 15 minutes time limit imposed by clinical routine.

Determination of Algorithm Parallelism in NP Complete Problems for Distributed Architectures

DTIC Science & Technology

1990-03-05

12 structure STACK declare OpenStack (S-.NODE **TopPtr) -+TopPtrI FlushStack(S.-NODE **TopPtr) -*TopPtr PushOnStack(S-.NODE **TopPtr, ITEM *NewltemPtr...OfCoveringSets, CoveringSets, L, Best CoverTime, Vertex, Set3end SCND ADT B.26 structure STACKI declare OpenStack (S-NODE **TopPtr) -+TopPtr FlushStack(S

Optimising recovery after surgery: Predictors of early discharge and hospital readmission.

PubMed

Carter, Jonathan; Philp, Shannon; Wan, King M

2016-10-01

Fast track surgery (FTS) programs minimise the stress response after surgery and allow for enhanced recovery. To document the frequency and incidence of adverse events in patients enrolled on a FTS program and to investigate factors associated with shorter length of stay and readmission to hospital. A seven-year updated surgical audit of patients undergoing laparotomy for suspected or confirmed malignancy on a FTS program. Five hundred and fifty patients comprise the study group. Average age and body mass index (BMI) were 55 years and 28, respectively. Mean length of stay (LOS) was 3.4 days with 194 (35%) patients discharged on day 2. Six (1%) patients had confirmed venous thromboembolism (VTE), three of whom were diagnosed on pre-operative imaging. Overall, transfusion rate was 5%. Adverse events in decreasing frequency were hospital readmission (4%) and significant wound infection (3%). All other adverse events were uncommon with rates <0.5%. Factors associated with a discharge on or after day 3 include age, pathology, Eastern Cooperative Oncology Group performance status, incision type, operating time, blood transfusion and cyclo-oxygenase 2 inhibitors. Factors associated with hospital readmission include longer operating time, performance of lymph node sampling/dissection, longer LOS, development of wound infection, febrile morbidity, return to the operating room, unplanned intensive care unit admission and presence of other complications. Patients managed by a FTS protocol can expect enhanced outcomes when compared to historical controls. © 2016 The Royal Australian and New Zealand College of Obstetricians and Gynaecologists.

Intraoperative Fluorescence Imaging for Detection of Sentinel Lymph Nodes and Lymphatic Vessels during Open Prostatectomy using Indocyanine Green.

PubMed

Yuen, Keiji; Miura, Tetsuya; Sakai, Iori; Kiyosue, Akiko; Yamashita, Masuo

2015-08-01

We investigated the feasibility and validity of intraoperative fluorescence imaging using indocyanine green for the detection of sentinel lymph nodes and lymphatic vessels during open prostatectomy. Indocyanine green was injected into the prostate under transrectal ultrasound guidance just before surgery. Intraoperative fluorescence imaging was performed using a near-infrared camera system in 66 consecutive patients with clinically localized prostate cancer after a 10-patient pilot test to optimize indocyanine green dosing, observation timing and injection method. Lymphatic vessels were visualized and followed to identify the sentinel lymph nodes. Confirmatory pelvic lymph node dissection including all fluorescent nodes and open radical prostatectomy were performed in all patients. Lymphatic vessels were successfully visualized in 65 patients (98%) and sentinel lymph nodes in 64 patients (97%). Sentinel lymph nodes were located in the obturator fossa, internal and external iliac regions, and rarely in the common iliac and presacral regions. A median of 4 sentinel lymph nodes per patient was detected. Three lymphatic pathways, the paravesical, internal and lateral routes, were identified. Pathological examination revealed metastases to 9 sentinel lymph nodes in 6 patients (9%). All pathologically positive lymph nodes were detected as sentinel lymph nodes using this imaging. No adverse reactions due to the use of indocyanine green were observed. Intraoperative fluorescence imaging using indocyanine green during open prostatectomy enables the detection of lymphatic vessels and sentinel lymph nodes with high sensitivity. This novel method is technically feasible, safe and easy to apply with minimal additional operative time. Copyright © 2015 American Urological Association Education and Research, Inc. Published by Elsevier Inc. All rights reserved.

I-DWRL: Improved Dual Wireless Radio Localization Using Magnetometer.

PubMed

Aziz, Abdul; Kumar, Ramesh; Joe, Inwhee

2017-11-15

In the dual wireless radio localization (DWRL) technique each sensor node is equipped with two ultra-wide band (UWB) radios; the distance between the two radios is a few tens of centimeters. For localization, the DWRL technique must use at least two pre-localized nodes to fully localize an unlocalized node. Moreover, in the DWRL technique it is also not possible for two sensor nodes to properly communicate location information unless each of the four UWB radios of two communicating sensor nodes cannot approach the remaining three radios. In this paper, we propose an improved DWRL (I-DWRL) algorithm along with mounting a magnetometer sensor on one of the UWB radios of all sensor nodes. This addition of a magnetometer helps to improve DWRL algorithm such that only one localized sensor node is required for the localization of an unlocalized sensor node, and localization can also be achieved even when some of the four radios of two nodes are unable to communicate with the remaining three radios. The results show that with the use of a magnetometer a greater number of nodes can be localized with a smaller transmission range, less energy and a shorter period of time. In comparison with the conventional DWRL algorithm, our I-DWRL not only maintains the localization error but also requires around half of semi-localizations, 60% of the time, 70% of the energy and a shorter communication range to fully localize an entire network. Moreover, I-DWRL can even localize more nodes while transmission range is not sufficient for DWRL algorithm.

I-DWRL: Improved Dual Wireless Radio Localization Using Magnetometer

PubMed Central

Aziz, Abdul; Kumar, Ramesh; Joe, Inwhee

2017-01-01

In the dual wireless radio localization (DWRL) technique each sensor node is equipped with two ultra-wide band (UWB) radios; the distance between the two radios is a few tens of centimeters. For localization, the DWRL technique must use at least two pre-localized nodes to fully localize an unlocalized node. Moreover, in the DWRL technique it is also not possible for two sensor nodes to properly communicate location information unless each of the four UWB radios of two communicating sensor nodes cannot approach the remaining three radios. In this paper, we propose an improved DWRL (I-DWRL) algorithm along with mounting a magnetometer sensor on one of the UWB radios of all sensor nodes. This addition of a magnetometer helps to improve DWRL algorithm such that only one localized sensor node is required for the localization of an unlocalized sensor node, and localization can also be achieved even when some of the four radios of two nodes are unable to communicate with the remaining three radios. The results show that with the use of a magnetometer a greater number of nodes can be localized with a smaller transmission range, less energy and a shorter period of time. In comparison with the conventional DWRL algorithm, our I-DWRL not only maintains the localization error but also requires around half of semi-localizations, 60% of the time, 70% of the energy and a shorter communication range to fully localize an entire network. Moreover, I-DWRL can even localize more nodes while transmission range is not sufficient for DWRL algorithm. PMID:29140291

INDIRECT COMPUTED TOMOGRAPHIC LYMPHOGRAPHY FOR ILIOSACRAL LYMPHATIC MAPPING IN A COHORT OF DOGS WITH ANAL SAC GLAND ADENOCARCINOMA: TECHNIQUE DESCRIPTION.

PubMed

Majeski, Stephanie A; Steffey, Michele A; Fuller, Mark; Hunt, Geraldine B; Mayhew, Philipp D; Pollard, Rachel E

2017-05-01

Sentinel lymph node mapping can help to direct surgical oncologic staging and metastatic disease detection in patients with complex lymphatic pathways. We hypothesized that indirect computed tomographic lymphography (ICTL) with a water-soluble iodinated contrast agent would successfully map lymphatic pathways of the iliosacral lymphatic center in dogs with anal sac gland carcinoma, providing a potential preoperative method for iliosacral sentinel lymph node identification in dogs. Thirteen adult dogs diagnosed with anal sac gland carcinoma were enrolled in this prospective, pilot study, and ICTL was performed via peritumoral contrast injection with serial caudal abdominal computed tomography scans for iliosacral sentinel lymph node identification. Technical and descriptive details for ICTL were recorded, including patient positioning, total contrast injection volume, timing of contrast visualization, and sentinel lymph nodes and lymphatic pathways identified. Indirect CT lymphography identified lymphatic pathways and sentinel lymph nodes in 12/13 cases (92%). Identified sentinel lymph nodes were ipsilateral to the anal sac gland carcinoma in 8/12 and contralateral to the anal sac gland carcinoma in 4/12 cases. Sacral, internal iliac, and medial iliac lymph nodes were identified as sentinel lymph nodes, and patterns were widely variable. Patient positioning and timing of imaging may impact successful sentinel lymph node identification. Positioning in supported sternal recumbency is recommended. Results indicate that ICTL may be a feasible technique for sentinel lymph node identification in dogs with anal sac gland carcinoma and offer preliminary data to drive further investigation of iliosacral lymphatic metastatic patterns using ICTL and sentinel lymph node biopsy. © 2017 American College of Veterinary Radiology.

ALMA Correlator Real-Time Data Processor

NASA Astrophysics Data System (ADS)

Pisano, J.; Amestica, R.; Perez, J.

2005-10-01

The design of a real-time Linux application utilizing Real-Time Application Interface (RTAI) to process real-time data from the radio astronomy correlator for the Atacama Large Millimeter Array (ALMA) is described. The correlator is a custom-built digital signal processor which computes the cross-correlation function of two digitized signal streams. ALMA will have 64 antennas with 2080 signal streams each with a sample rate of 4 giga-samples per second. The correlator's aggregate data output will be 1 gigabyte per second. The software is defined by hard deadlines with high input and processing data rates, while requiring interfaces to non real-time external computers. The designed computer system - the Correlator Data Processor or CDP, consists of a cluster of 17 SMP computers, 16 of which are compute nodes plus a master controller node all running real-time Linux kernels. Each compute node uses an RTAI kernel module to interface to a 32-bit parallel interface which accepts raw data at 64 megabytes per second in 1 megabyte chunks every 16 milliseconds. These data are transferred to tasks running on multiple CPUs in hard real-time using RTAI's LXRT facility to perform quantization corrections, data windowing, FFTs, and phase corrections for a processing rate of approximately 1 GFLOPS. Highly accurate timing signals are distributed to all seventeen computer nodes in order to synchronize them to other time-dependent devices in the observatory array. RTAI kernel tasks interface to the timing signals providing sub-millisecond timing resolution. The CDP interfaces, via the master node, to other computer systems on an external intra-net for command and control, data storage, and further data (image) processing. The master node accesses these external systems utilizing ALMA Common Software (ACS), a CORBA-based client-server software infrastructure providing logging, monitoring, data delivery, and intra-computer function invocation. The software is being developed in tandem with the correlator hardware which presents software engineering challenges as the hardware evolves. The current status of this project and future goals are also presented.

Influence of Time-Series Normalization, Number of Nodes, Connectivity and Graph Measure Selection on Seizure-Onset Zone Localization from Intracranial EEG.

PubMed

van Mierlo, Pieter; Lie, Octavian; Staljanssens, Willeke; Coito, Ana; Vulliémoz, Serge

2018-04-26

We investigated the influence of processing steps in the estimation of multivariate directed functional connectivity during seizures recorded with intracranial EEG (iEEG) on seizure-onset zone (SOZ) localization. We studied the effect of (i) the number of nodes, (ii) time-series normalization, (iii) the choice of multivariate time-varying connectivity measure: Adaptive Directed Transfer Function (ADTF) or Adaptive Partial Directed Coherence (APDC) and (iv) graph theory measure: outdegree or shortest path length. First, simulations were performed to quantify the influence of the various processing steps on the accuracy to localize the SOZ. Afterwards, the SOZ was estimated from a 113-electrodes iEEG seizure recording and compared with the resection that rendered the patient seizure-free. The simulations revealed that ADTF is preferred over APDC to localize the SOZ from ictal iEEG recordings. Normalizing the time series before analysis resulted in an increase of 25-35% of correctly localized SOZ, while adding more nodes to the connectivity analysis led to a moderate decrease of 10%, when comparing 128 with 32 input nodes. The real-seizure connectivity estimates localized the SOZ inside the resection area using the ADTF coupled to outdegree or shortest path length. Our study showed that normalizing the time-series is an important pre-processing step, while adding nodes to the analysis did only marginally affect the SOZ localization. The study shows that directed multivariate Granger-based connectivity analysis is feasible with many input nodes (> 100) and that normalization of the time-series before connectivity analysis is preferred.

A distributed monitoring system for photovoltaic arrays based on a two-level wireless sensor network

NASA Astrophysics Data System (ADS)

Su, F. P.; Chen, Z. C.; Zhou, H. F.; Wu, L. J.; Lin, P. J.; Cheng, S. Y.; Li, Y. F.

2017-11-01

In this paper, a distributed on-line monitoring system based on a two-level wireless sensor network (WSN) is proposed for real time status monitoring of photovoltaic (PV) arrays to support the fine management and maintenance of PV power plants. The system includes the sensing nodes installed on PV modules (PVM), sensing and routing nodes installed on combiner boxes of PV sub-arrays (PVA), a sink node and a data management centre (DMC) running on a host computer. The first level WSN is implemented by the low-cost wireless transceiver nRF24L01, and it is used to achieve single hop communication between the PVM nodes and their corresponding PVA nodes. The second level WSN is realized by the CC2530 based ZigBee network for multi-hop communication among PVA nodes and the sink node. The PVM nodes are used to monitor the PVM working voltage and backplane temperature, and they send the acquired data to their PVA node via the nRF24L01 based first level WSN. The PVA nodes are used to monitor the array voltage, PV string current and environment irradiance, and they send the acquired and received data to the DMC via the ZigBee based second level WSN. The DMC is designed using the MATLAB GUIDE and MySQL database. Laboratory experiment results show that the system can effectively acquire, display, store and manage the operating and environment parameters of PVA in real time.

Assessment of Lymph Nodes and Prostate Status Using Early Dynamic Curves with (18)F-Choline PET/CT in Prostate Cancer.

PubMed

Mathieu, Cédric; Ferrer, Ludovic; Carlier, Thomas; Colombié, Mathilde; Rusu, Daniela; Kraeber-Bodéré, Françoise; Campion, Loic; Rousseau, Caroline

2015-01-01

Dynamic image acquisition with (18)F-Choline [fluorocholine (FCH)] PET/CT in prostate cancer is mostly used to overcome the bladder repletion, which could obstruct the loco-regional analysis. The aim of our study was to analyze early dynamic FCH acquisitions to define pelvic lymph node or prostate pathological status. Retrospective analysis was performed on 39 patients for initial staging (n = 18), or after initial treatment (n = 21). Patients underwent 10-min dynamic acquisitions centered on the pelvis, after injection of 3-4 MBq/kg of FCH. Whole-body images were acquired about 1 h after injection using a PET/CT GE Discovery LS (GE-LS) or Siemens Biograph mCT (mCT). Maximum and mean SUV according to time were measured on nodal and prostatic lesions. SUVmean was corrected for partial volume effect (PVEC) with suitable recovery coefficients. The status of each lesion was based on histological results or patient follow-up (>6 months). A Mann-Whitney test and ANOVA were used to compare mean and receiver operating characteristic (ROC) curve analysis. The median PSA was 8.46 ng/mL and the median Gleason score was 3 + 4. Ninety-two lesions (43 lymph nodes and 49 prostate lesions) were analyzed, including 63 malignant lesions. In early dynamic acquisitions, the maximum and mean SUV were significantly higher, respectively, on mCT and GE-LS, in malignant versus benign lesions (p < 0.001, p < 0.001). Mean SUV without PVEC, allowed better discrimination of benign from malignant lesions, in comparison with maximum and mean SUV (with PVEC), for both early and late acquisitions. For patients acquired on mCT, area under the ROC curve showed a trend to better sensitivity and specificity for early acquisitions, compared with late acquisitions (SUVmax AUC 0.92 versus 0.85, respectively). Assessment of lymph nodes and prostate pathological status with early dynamic imaging using PET/CT FCH allowed prostate cancer detection in situations where proof of malignancy is difficult to obtain.

Adaptive Data Gathering in Mobile Sensor Networks Using Speedy Mobile Elements

PubMed Central

Lai, Yongxuan; Xie, Jinshan; Lin, Ziyu; Wang, Tian; Liao, Minghong

2015-01-01

Data gathering is a key operator for applications in wireless sensor networks; yet it is also a challenging problem in mobile sensor networks when considering that all nodes are mobile and the communications among them are opportunistic. This paper proposes an efficient data gathering scheme called ADG that adopts speedy mobile elements as the mobile data collector and takes advantage of the movement patterns of the network. ADG first extracts the network meta-data at initial epochs, and calculates a set of proxy nodes based on the meta-data. Data gathering is then mapped into the Proxy node Time Slot Allocation (PTSA) problem that schedules the time slots and orders, according to which the data collector could gather the maximal amount of data within a limited period. Finally, the collector follows the schedule and picks up the sensed data from the proxy nodes through one hop of message transmissions. ADG learns the period when nodes are relatively stationary, so that the collector is able to pick up the data from them during the limited data gathering period. Moreover, proxy nodes and data gathering points could also be timely updated so that the collector could adapt to the change of node movements. Extensive experimental results show that the proposed scheme outperforms other data gathering schemes on the cost of message transmissions and the data gathering rate, especially under the constraint of limited data gathering period. PMID:26389903

Adaption of the temporal correlation coefficient calculation for temporal networks (applied to a real-world pig trade network).

PubMed

Büttner, Kathrin; Salau, Jennifer; Krieter, Joachim

2016-01-01

The average topological overlap of two graphs of two consecutive time steps measures the amount of changes in the edge configuration between the two snapshots. This value has to be zero if the edge configuration changes completely and one if the two consecutive graphs are identical. Current methods depend on the number of nodes in the network or on the maximal number of connected nodes in the consecutive time steps. In the first case, this methodology breaks down if there are nodes with no edges. In the second case, it fails if the maximal number of active nodes is larger than the maximal number of connected nodes. In the following, an adaption of the calculation of the temporal correlation coefficient and of the topological overlap of the graph between two consecutive time steps is presented, which shows the expected behaviour mentioned above. The newly proposed adaption uses the maximal number of active nodes, i.e. the number of nodes with at least one edge, for the calculation of the topological overlap. The three methods were compared with the help of vivid example networks to reveal the differences between the proposed notations. Furthermore, these three calculation methods were applied to a real-world network of animal movements in order to detect influences of the network structure on the outcome of the different methods.

Using LTI Dynamics to Identify the Influential Nodes in a Network

PubMed Central

Jorswieck, Eduard; Scheunert, Christian

2016-01-01

Networks are used for modeling numerous technical, social or biological systems. In order to better understand the system dynamics, it is a matter of great interest to identify the most important nodes within the network. For a large set of problems, whether it is the optimal use of available resources, spreading information efficiently or even protection from malicious attacks, the most important node is the most influential spreader, the one that is capable of propagating information in the shortest time to a large portion of the network. Here we propose the Node Imposed Response (NiR), a measure which accurately evaluates node spreading power. It outperforms betweenness, degree, k-shell and h-index centrality in many cases and shows the similar accuracy to dynamics-sensitive centrality. We utilize the system-theoretic approach considering the network as a Linear Time-Invariant system. By observing the system response we can quantify the importance of each node. In addition, our study provides a robust tool set for various protective strategies. PMID:28030548

Opinion formation on adaptive networks with intensive average degree

NASA Astrophysics Data System (ADS)

Schmittmann, B.; Mukhopadhyay, Abhishek

2010-12-01

We study the evolution of binary opinions on a simple adaptive network of N nodes. At each time step, a randomly selected node updates its state (“opinion”) according to the majority opinion of the nodes that it is linked to; subsequently, all links are reassigned with probability p˜ (q˜) if they connect nodes with equal (opposite) opinions. In contrast to earlier work, we ensure that the average connectivity (“degree”) of each node is independent of the system size (“intensive”), by choosing p˜ and q˜ to be of O(1/N) . Using simulations and analytic arguments, we determine the final steady states and the relaxation into these states for different system sizes. We find two absorbing states, characterized by perfect consensus, and one metastable state, characterized by a population split evenly between the two opinions. The relaxation time of this state grows exponentially with the number of nodes, N . A second metastable state, found in the earlier studies, is no longer observed.

Design and Implementation of a MAC Protocol for Timely and Reliable Delivery of Command and Data in Dynamic Wireless Sensor Networks

PubMed Central

Oh, Hoon; Van Vinh, Phan

2013-01-01

This paper proposes and implements a new TDMA-based MAC protocol for providing timely and reliable delivery of data and command for monitoring and control networks. In this kind of network, sensor nodes are required to sense data from the monitoring environment periodically and then send the data to a sink. The sink determines whether the environment is safe or not by analyzing the acquired data. Sometimes, a command or control message is sent from the sink to a particular node or a group of nodes to execute the services or request further interested data. The proposed MAC protocol enables bidirectional communication, controls active and sleep modes of a sensor node to conserve energy, and addresses the problem of load unbalancing between the nodes near a sink and the other nodes. It can improve reliability of communication significantly while extending network lifetime. These claims are supported by the experimental results. PMID:24084116

Design and implementation of a MAC protocol for timely and reliable delivery of command and data in dynamic wireless sensor networks.

PubMed

Oh, Hoon; Van Vinh, Phan

2013-09-30

This paper proposes and implements a new TDMA-based MAC protocol for providing timely and reliable delivery of data and command for monitoring and control networks. In this kind of network, sensor nodes are required to sense data from the monitoring environment periodically and then send the data to a sink. The sink determines whether the environment is safe or not by analyzing the acquired data. Sometimes, a command or control message is sent from the sink to a particular node or a group of nodes to execute the services or request further interested data. The proposed MAC protocol enables bidirectional communication, controls active and sleep modes of a sensor node to conserve energy, and addresses the problem of load unbalancing between the nodes near a sink and the other nodes. It can improve reliability of communication significantly while extending network lifetime. These claims are supported by the experimental results.

Mental disorder recovery correlated with centralities and interactions on an online social network

PubMed Central

Sayama, Hiroki

2015-01-01

Recent research has established both a theoretical basis and strong empirical evidence that effective social behavior plays a beneficial role in the maintenance of physical and psychological well-being of people. To test whether social behavior and well-being are also associated in online communities, we studied the correlations between the recovery of patients with mental disorders and their behaviors in online social media. As the source of the data related to the social behavior and progress of mental recovery, we used PatientsLikeMe (PLM), the world’s first open-participation research platform for the development of patient-centered health outcome measures. We first constructed an online social network structure based on patient-to-patient ties among 200 patients obtained from PLM. We then characterized patients’ online social activities by measuring the numbers of “posts and views” and “helpful marks” each patient obtained. The patients’ recovery data were obtained from their self-reported status information that was also available on PLM. We found that some node properties (in-degree, eigenvector centrality and PageRank) and the two online social activity measures were significantly correlated with patients’ recovery. Furthermore, we re-collected the patients’ recovery data two months after the first data collection. We found significant correlations between the patients’ social behaviors and the second recovery data, which were collected two months apart. Our results indicated that social interactions in online communities such as PLM were significantly associated with the current and future recoveries of patients with mental disorders. PMID:26312174

International Space Station United States Orbital Segment Oxygen Generation System On-Orbit Operational Experience

NASA Technical Reports Server (NTRS)

Erickson, Robert J.; Howe, John, Jr.; Kulp, Galen W.; VanKeuren, Steven P.

2008-01-01

The International Space Station (ISS) United States Orbital Segment (USOS) Oxygen Generation System (OGS) was originally intended to be installed in ISS Node 3. The OGS rack delivery was accelerated, and it was launched to ISS in July of 2006 and installed in the US Laboratory Module. Various modification kits were installed to provide its interfaces, and the OGS was first activated in July of 2007 for 15 hours, In October of 2007 it was again activated for 76 hours with varied production rates and day/night cycling. Operational time in each instance was limited by the quantity of feedwater in a Payload Water Reservoir (PWR) bag. Feedwater will be provided by PWR bag until the USOS Water Recovery System (WRS) is delivered to SS in fall of 2008. This paper will discuss operating experience and characteristics of the OGS, as well as operational issues and their resolution.

Compressed glassy carbon: An ultrastrong and elastic interpenetrating graphene network

PubMed Central

Hu, Meng; He, Julong; Zhao, Zhisheng; Strobel, Timothy A.; Hu, Wentao; Yu, Dongli; Sun, Hao; Liu, Lingyu; Li, Zihe; Ma, Mengdong; Kono, Yoshio; Shu, Jinfu; Mao, Ho-kwang; Fei, Yingwei; Shen, Guoyin; Wang, Yanbin; Juhl, Stephen J.; Huang, Jian Yu; Liu, Zhongyuan; Xu, Bo; Tian, Yongjun

2017-01-01

Carbon’s unique ability to have both sp2 and sp3 bonding states gives rise to a range of physical attributes, including excellent mechanical and electrical properties. We show that a series of lightweight, ultrastrong, hard, elastic, and conductive carbons are recovered after compressing sp2-hybridized glassy carbon at various temperatures. Compression induces the local buckling of graphene sheets through sp3 nodes to form interpenetrating graphene networks with long-range disorder and short-range order on the nanometer scale. The compressed glassy carbons have extraordinary specific compressive strengths—more than two times that of commonly used ceramics—and simultaneously exhibit robust elastic recovery in response to local deformations. This type of carbon is an optimal ultralight, ultrastrong material for a wide range of multifunctional applications, and the synthesis methodology demonstrates potential to access entirely new metastable materials with exceptional properties. PMID:28630918

Quantum secured gigabit optical access networks

PubMed Central

Fröhlich, Bernd; Dynes, James F.; Lucamarini, Marco; Sharpe, Andrew W.; Tam, Simon W.-B.; Yuan, Zhiliang; Shields, Andrew J.

2015-01-01

Optical access networks connect multiple endpoints to a common network node via shared fibre infrastructure. They will play a vital role to scale up the number of users in quantum key distribution (QKD) networks. However, the presence of power splitters in the commonly used passive network architecture makes successful transmission of weak quantum signals challenging. This is especially true if QKD and data signals are multiplexed in the passive network. The splitter introduces an imbalance between quantum signal and Raman noise, which can prevent the recovery of the quantum signal completely. Here we introduce a method to overcome this limitation and demonstrate coexistence of multi-user QKD and full power data traffic from a gigabit passive optical network (GPON) for the first time. The dual feeder implementation is compatible with standard GPON architectures and can support up to 128 users, highlighting that quantum protected GPON networks could be commonplace in the future. PMID:26656307

The use of multiple time point dynamic positron emission tomography/computed tomography in patients with oral/head and neck cancer does not predictably identify metastatic cervical lymph nodes.

PubMed

Carlson, Eric R; Schaefferkoetter, Josh; Townsend, David; McCoy, J Michael; Campbell, Paul D; Long, Misty

2013-01-01

To determine whether the time course of 18-fluorine fluorodeoxyglucose (18F-FDG) activity in multiple consecutively obtained 18F-FDG positron emission tomography (PET)/computed tomography (CT) scans predictably identifies metastatic cervical adenopathy in patients with oral/head and neck cancer. It is hypothesized that the activity will increase significantly over time only in those lymph nodes harboring metastatic cancer. A prospective cohort study was performed whereby patients with oral/head and neck cancer underwent consecutive imaging at 9 time points with PET/CT from 60 to 115 minutes after injection with (18)F-FDG. The primary predictor variable was the status of the lymph nodes based on dynamic PET/CT imaging. Metastatic lymph nodes were defined as those that showed an increase greater than or equal to 10% over the baseline standard uptake values. The primary outcome variable was the pathologic status of the lymph node. A total of 2,237 lymph nodes were evaluated histopathologically in the 83 neck dissections that were performed in 74 patients. A total of 119 lymph nodes were noted to have hypermetabolic activity on the 90-minute (static) portion of the study and were able to be assessed by time points. When we compared the PET/CT time point (dynamic) data with the histopathologic analysis of the lymph nodes, the sensitivity, specificity, positive predictive value, negative predictive value, and accuracy were 60.3%, 70.5%, 66.0%, 65.2%, and 65.5%, respectively. The use of dynamic PET/CT imaging does not permit the ablative surgeon to depend only on the results of the PET/CT study to determine which patients will benefit from neck dissection. As such, we maintain that surgeons should continue to rely on clinical judgment and maintain a low threshold for executing neck dissection in patients with oral/head and neck cancer, including those patients with N0 neck designations. Copyright © 2013 American Association of Oral and Maxillofacial Surgeons. Published by Elsevier Inc. All rights reserved.

An efficient grid layout algorithm for biological networks utilizing various biological attributes

PubMed Central

Kojima, Kaname; Nagasaki, Masao; Jeong, Euna; Kato, Mitsuru; Miyano, Satoru

2007-01-01

Background Clearly visualized biopathways provide a great help in understanding biological systems. However, manual drawing of large-scale biopathways is time consuming. We proposed a grid layout algorithm that can handle gene-regulatory networks and signal transduction pathways by considering edge-edge crossing, node-edge crossing, distance measure between nodes, and subcellular localization information from Gene Ontology. Consequently, the layout algorithm succeeded in drastically reducing these crossings in the apoptosis model. However, for larger-scale networks, we encountered three problems: (i) the initial layout is often very far from any local optimum because nodes are initially placed at random, (ii) from a biological viewpoint, human layouts still exceed automatic layouts in understanding because except subcellular localization, it does not fully utilize biological information of pathways, and (iii) it employs a local search strategy in which the neighborhood is obtained by moving one node at each step, and automatic layouts suggest that simultaneous movements of multiple nodes are necessary for better layouts, while such extension may face worsening the time complexity. Results We propose a new grid layout algorithm. To address problem (i), we devised a new force-directed algorithm whose output is suitable as the initial layout. For (ii), we considered that an appropriate alignment of nodes having the same biological attribute is one of the most important factors of the comprehension, and we defined a new score function that gives an advantage to such configurations. For solving problem (iii), we developed a search strategy that considers swapping nodes as well as moving a node, while keeping the order of the time complexity. Though a naïve implementation increases by one order, the time complexity, we solved this difficulty by devising a method that caches differences between scores of a layout and its possible updates. Conclusion Layouts of the new grid layout algorithm are compared with that of the previous algorithm and human layout in an endothelial cell model, three times as large as the apoptosis model. The total cost of the result from the new grid layout algorithm is similar to that of the human layout. In addition, its convergence time is drastically reduced (40% reduction). PMID:17338825

Distributed Dynamic Host Configuration Protocol (D2HCP)

PubMed Central

Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

2011-01-01

Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment. PMID:22163856

Distributed Dynamic Host Configuration Protocol (D2HCP).

PubMed

Villalba, Luis Javier García; Matesanz, Julián García; Orozco, Ana Lucila Sandoval; Díaz, José Duván Márquez

2011-01-01

Mobile Ad Hoc Networks (MANETs) are multihop wireless networks of mobile nodes without any fixed or preexisting infrastructure. The topology of these networks can change randomly due to the unpredictable mobility of nodes and their propagation characteristics. In most networks, including MANETs, each node needs a unique identifier to communicate. This work presents a distributed protocol for dynamic node IP address assignment in MANETs. Nodes of a MANET synchronize from time to time to maintain a record of IP address assignments in the entire network and detect any IP address leaks. The proposed stateful autoconfiguration scheme uses the OLSR proactive routing protocol for synchronization and guarantees unique IP addresses under a variety of network conditions, including message losses and network partitioning. Simulation results show that the protocol incurs low latency and communication overhead for IP address assignment.

Effect of time to sentinel-node biopsy on the prognosis of cutaneous melanoma.

PubMed

Tejera-Vaquerizo, Antonio; Nagore, Eduardo; Puig, Susana; Robert, Caroline; Saiag, Philippe; Martín-Cuevas, Paula; Gallego, Elena; Herrera-Acosta, Enrique; Aguilera, José; Malvehy, Josep; Carrera, Cristina; Cavalcanti, Andrea; Rull, Ramón; Vilalta-Solsona, Antonio; Lannoy, Emilie; Boutros, Celine; Benannoune, Naima; Tomasic, Gorana; Aegerte, Philippe; Vidal-Sicart, Sergi; Palou, Josep; Alos, L Lúcia; Requena, Celia; Traves, Víctor; Pla, Ángel; Bolumar, Isidro; Soriano, Virtudes; Guillén, Carlos; Herrera-Ceballos, Enrique

2015-09-01

In patients with primary cutaneous melanoma, there is generally a delay between excisional biopsy of the primary tumour and sentinel-node biopsy. The objective of this study is to analyse the prognostic implications of this delay. This was an observational, retrospective, cohort study in four tertiary referral hospitals. A total of 1963 patients were included. The factor of interest was the interval between the date of the excisional biopsy of the primary melanoma and the date of the sentinel-node biopsy (delay time) in the prognosis. The primary outcome was melanoma-specific survival and disease-free survival. A delay time of 40 days or less (hazard ratio (HR), 1.7; confidence interval (CI), 1.2-2.5) increased Breslow thickness (Breslow ⩾ 2 mm, HR, > 3.7; CI, 1.4-10.7), ulceration (HR, 1.6; CI, 1.1-2.3), sentinel-node metastasis (HR, 2.9; CI, 1.9-4.2), and primary melanoma localised in the head or neck were independently associated with worse melanoma-specific survival (all P < 0.03). The stratified analysis showed that the effect of delay time was at the expense of the patients with a negative sentinel-node biopsy and without regression. Early sentinel-node biopsy is associated with worse survival in patients with cutaneous melanoma. Copyright © 2015 Elsevier Ltd. All rights reserved.

Lymph node clearance of plutonium from subcutaneous wounds in beagles

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dagle, G.E.

1973-08-01

The lymph node clearance of /sup 239/Pu O/sub 2/ administered as insoluble particles from subcutaneous implants was studied in adult beagles to simulate accidental contamination of hand wounds. External scintillation data were collected from the popliteal lymph nodes of each dog after 9.2 to 39.4 mu Ci of plutonium oxide was subcutaneously implanted into the left or right hind paws. The left hind paw was armputated 4 weeks after implantation to prevent continued deposition of plutonium oxide particles in the left popliteal lymph node. Groups of 3 dogs were sacrificed 4, 8, 16, and 32 weeks after plutonium implantation formore » histopathologic, electron microscopic, and radiochemical analysis of regional lymph nodes. An additional group of dogs received treatment with the chelating agent diethyenetriaminepentaacetic acid (DTPA). Plutonium rapidly accumulated in the popliteal lymph nodes after subcutaneous injection into the hind paw, and 1 to 10% of the implant dose was present in the popliteal lymph nodes at the time of necropsy. Histopathologic changes in the popliteal lymph nodes with plutonium particles were characterized primarily by reticular cell hyperplasia, increased numbers of macrophages, necrosis, and fibroplasia. Eventually, the plutonium particles became sequestered by scar tissue that often replaced the entire architecture of the lymph node. Light microscopic autoradiographs of the popliteal lymph nodes showed a time-related increase in number of alpha tracks per plutonium source. Electron microscopy showed that the plutonium particles were aggregated in phagolysosomes of macrophages. There was slight clearance of plutonium from the popliteal lymph nodes of dogs monitored for 32 weeks. The clearance of plutonium particles from the popliteal lymph nodes was associated with necrosis of macrophages. The external iliac lymph nodes contained fewer plutonium particles than the popliteal lymph nodes and histopathologic changes were less severe. The superficial inguinal lymph nodes of one dog contained appreciable amounts of plutonium. Treatment with diethylenetriaminepentaacetic acid (DTPA) did not have a measurable effect on the clearance of plutonium from the popliteal lymph nodes. (60 references) (auth)« less

The impact of superficial injections of radiocolloids and dynamic lymphoscintigraphy on sentinel node identification in oral cavity cancer: a same-day protocol.

PubMed

Tartaglione, Girolamo; Vigili, Maurizio G; Rahimi, Siavash; Celebrini, Alessandra; Pagan, Marco; Lauro, Luigi; Al-Nahhas, Adil; Rubello, Domenico

2008-04-01

To evaluate the role of dynamic lymphoscintigraphy with a same-day protocol for sentinel node biopsy in oral cavity cancer. Twenty-two consecutive patients affected by cT1-2N0 squamous cell carcinoma of the oral cavity were enrolled between September 2001 and November 2005. After a local anaesthetic (10% lidocaine spray), a dose of 30-50 MBq of Tc human serum albumin nanocolloid, in ml saline, was injected superficially (1-2 mm subendothelial injection) into four points around the lesion. Dynamic lymphoscintigraphy was acquired immediately (256x256 matrix, 5 min pre-set time, LEGP collimator) in lateral and anterior projections. The imaging was prolonged until the lymph nodes of at least two neck levels were visualized (time required min). About 3 h later (same-day protocol) the patients had a radioguided sentinel node biopsy. Elective neck dissection was performed in the first 13 patients; whereas the last nine patients had elective neck dissection only if the sentinel node was positive. Sentinel nodes were dissected into 1 mm thick block sections and studied by haematoxylin & eosin staining and immunohistochemistry (anticytokeratin antibody). The sentinel nodes were found on the 1st neck level in 13 cases, on the 2nd neck level in eight cases, and on the 3rd neck level in one case (100% sensitivity). The average number of sentinel nodes was 2.2 for each patient. The sentinel node was positive in eight patients (36%); with six of them having the sentinel node as the exclusive site of metastasis. No skip metastases were found in the 14 patients with negative sentinel node (100% specificity). Our preliminary data indicate that superficial injections of radiocolloid and dynamic lymphoscintigraphy provide a high success rate in sentinel node identification in oral cavity cancers. Dynamic lymphoscintigraphy helps in distinguishing sentinel node from second-tier lymph nodes. The same-day protocol is advisable in order to correctly identify the first sentinel node, avoiding multiple and unnecessary node biopsies, without reducing sensitivity.

Role of near-infrared fluorescence imaging in the resection of metastatic lymph nodes in an optimized orthotopic animal model of HNSCC.

PubMed

Atallah, I; Milet, C; Quatre, R; Henry, M; Reyt, E; Coll, J-L; Hurbin, A; Righini, C A

2015-12-01

To study the role of near-infrared fluorescence imaging in the detection and resection of metastatic cervical lymph nodes in head and neck cancer. CAL33 head and neck cancer cells of human origin were implanted in the oral cavity of nude mice. The mice were followed up after tumor resection to detect the development of lymph node metastases. A specific fluorescent tracer for αvβ3 integrin expressed by CAL33 cells was injected intravenously in the surviving mice between the second and the fourth month following tumor resection. A near-infrared fluorescence-imaging camera was used to detect tracer uptake in metastatic cervical lymph nodes, to guide of lymph-node resection for histological analysis. Lymph node metastases were observed in 42.8% of surviving mice between the second and the fourth month following orthotopic tumor resection. Near-infrared fluorescence imaging provided real-time intraoperative detection of clinical and subclinical lymph node metastases. These results were confirmed histologically. Near infrared fluorescence imaging provides real-time contrast between normal and malignant tissue, allowing intraoperative detection of metastatic lymph nodes. This preclinical stage is essential before testing the technique in humans. Copyright © 2015 Elsevier Masson SAS. All rights reserved.

Three-dimensional Optical Coherence Tomography for Optical Biopsy of Lymph Nodes and Assessment of Metastatic Disease

PubMed Central

John, Renu; Adie, Steven G.; Chaney, Eric J.; Marjanovic, Marina; Tangella, Krishnarao V.; Boppart, Stephen A.

2013-01-01

Background Numerous techniques have been developed for localizing lymph nodes before surgical resection and for their histological assessment. Nondestructive high-resolution transcapsule optical imaging of lymph nodes offers the potential for in situ assessment of metastatic involvement, potentially during surgical procedures. Methods Three-dimensional optical coherence tomography (3-D OCT) was used for imaging and assessing resected popliteal lymph nodes from a preclinical rat metastatic tumor model over a 9-day time-course study after tumor induction. The spectral-domain OCT system utilized a center wavelength of 800 nm, provided axial and transverse resolutions of 3 and 12 µm, respectively, and performed imaging at 10,000 axial scans per second. Results OCT is capable of providing high-resolution labelfree images of intact lymph node microstructure based on intrinsic optical scattering properties with penetration depths of ~1–2 mm. The results demonstrate that OCT is capable of differentiating normal, reactive, and metastatic lymph nodes based on microstructural changes. The optical scattering and structural changes revealed by OCT from day 3 to day 9 after the injection of tumor cells into the lymphatic system correlate with inflammatory and immunological changes observed in the capsule, precortical regions, follicles, and germination centers found during histopathology. Conclusions We report for the first time a longitudinal study of 3-D transcapsule OCT imaging of intact lymph nodes demonstrating microstructural changes during metastatic infiltration. These results demonstrate the potential of OCT as a technique for intraoperative, real-time in situ 3-D optical biopsy of lymph nodes for the intraoperative staging of cancer. PMID:22688663

Representation of activity in images using geospatial temporal graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brost, Randolph; McLendon, III, William C.; Parekh, Ojas D.

Various technologies pertaining to modeling patterns of activity observed in remote sensing images using geospatial-temporal graphs are described herein. Graphs are constructed by representing objects in remote sensing images as nodes, and connecting nodes with undirected edges representing either distance or adjacency relationships between objects and directed edges representing changes in time. Activity patterns may be discerned from the graphs by coding nodes representing persistent objects like buildings differently from nodes representing ephemeral objects like vehicles, and examining the geospatial-temporal relationships of ephemeral nodes within the graph.

Speaking-related changes in cortical functional connectivity associated with assisted and spontaneous recovery from developmental stuttering.

PubMed

Kell, Christian A; Neumann, Katrin; Behrens, Marion; von Gudenberg, Alexander W; Giraud, Anne-Lise

2018-03-01

We previously reported speaking-related activity changes associated with assisted recovery induced by a fluency shaping therapy program and unassisted recovery from developmental stuttering (Kell et al., Brain 2009). While assisted recovery re-lateralized activity to the left hemisphere, unassisted recovery was specifically associated with the activation of the left BA 47/12 in the lateral orbitofrontal cortex. These findings suggested plastic changes in speaking-related functional connectivity between left hemispheric speech network nodes. We reanalyzed these data involving 13 stuttering men before and after fluency shaping, 13 men who recovered spontaneously from their stuttering, and 13 male control participants, and examined functional connectivity during overt vs. covert reading by means of psychophysiological interactions computed across left cortical regions involved in articulation control. Persistent stuttering was associated with reduced auditory-motor coupling and enhanced integration of somatosensory feedback between the supramarginal gyrus and the prefrontal cortex. Assisted recovery reduced this hyper-connectivity and increased functional connectivity between the articulatory motor cortex and the auditory feedback processing anterior superior temporal gyrus. In spontaneous recovery, both auditory-motor coupling and integration of somatosensory feedback were normalized. In addition, activity in the left orbitofrontal cortex and superior cerebellum appeared uncoupled from the rest of the speech production network. These data suggest that therapy and spontaneous recovery normalizes the left hemispheric speaking-related activity via an improvement of auditory-motor mapping. By contrast, long-lasting unassisted recovery from stuttering is additionally supported by a functional isolation of the superior cerebellum from the rest of the speech production network, through the pivotal left BA 47/12. Copyright © 2017 Elsevier Inc. All rights reserved.

[Volume changes to the neck lymph node metastases in head-neck tumors. The evaluation of radiotherapeutic treatment success].

PubMed

Liszka, G; Thalacker, U; Somogyi, A; Németh, G

1997-08-01

This work is engaged with the volume change of neck lymph node metastasis of malignant tumors in the head-neck region during radiotherapy. In 54 patients with head and neck tumors, the volume of neck lymph nodes before and after radiation was measured. The volumetry was done with CT planimetry. The total dose was 66 Gy (2 Gy/d) telecobalt from 2 lateral opponated fields. The time of volume change could be defined with measuring of the half-time and the doubling-time by the help of Schwartz formula. After 10 Gy the volume diminution was about 20% and half-time 24 to 26 days. Afterwards the time of volume diminution picked up speed and finally achieved 60 to 72%. Meanwhile the half-time decreased to the half value. The result was independent of the site of primary tumor, the patient's sex and age. In our opinion the effectivity of radiotherapy can best be judged with defining of the volume change of lymph nodes of the neck.

Supplemental dietary arginine accelerates intestinal mucosal regeneration and enhances bacterial clearance following radiation enteritis in rats.

PubMed

Gurbuz, A T; Kunzelman, J; Ratzer, E E

1998-02-01

Arginine is a dibasic amino acid with significant metabolic and immunologic, effects especially in trauma and stress situations. Arginine supplementation has been shown to promote wound healing and improve immune system. We designed a study to evaluate the effects of supplemental dietary arginine on intestinal mucosal recovery and bacterial translocation and bacterial clearance after induction of radiation injury in rats. Twenty-one male Sprague-Dawley rats were subjected to a single dose of 1100 rads of abdominal X radiation. Rats were divided into three groups; the first group received diet enriched with 2% arginine, the second group with 4% arginine, and the third group with isonitrogenous 4% glycine. Rats were sacrificed 7 days after the radiation. Blood was drawn for arginine levels and mesenteric lymph nodes were harvested for quantitative aerobic and anaerobic cultures. Segments of ileum and jejunum were evaluated for villous height, number of villi per centimeter of intestine, and the number of mucous cells per villous. Arginine is absorbed reliably from the gut following oral administration. Dietary 4% arginine supplementation enhanced bacterial clearance from mesenteric lymph nodes compared to 2% arginine and 4% glycine supplemented diet following radiation enteritis in rats. Four percent arginine resulted in clear improvement in intestinal mucosal recovery when compared to 2% arginine and 4% glycine after abdominal irradiation in rats.

Introduction of laparoscopic low anterior resection for rectal cancer early during residency: a single institutional study on short-term outcomes.

PubMed

Ogiso, Satoshi; Yamaguchi, Takashi; Hata, Hiroaki; Kuroyanagi, Hiroya; Sakai, Yoshiharu

2010-11-01

Laparoscopic surgery for rectal cancer is unpopular because it is technically challenging. Suitable training systems have not been widely studied or established despite the steep learning curve for this procedure. We developed a systematic training program that enables resident surgeons to perform laparoscopic low anterior resection (LLAR) for rectal cancer and evaluated the safety and feasibility of this training program. We analyzed prospectively gathered data on all LLARs for rectal cancer performed at a single center over a 7-year period. Patients were assessed for demographic characteristics, tumor characteristics, operative procedure, operative time, blood loss, conversion to open surgery, complications, time to bowel recovery, distal margin, and number of lymph nodes harvested. We compared the early surgical, oncological, and functional outcomes of LLARs performed by expert surgeons with those of LLARs performed by resident surgeons for both intraperitoneal and extraperitoneal rectal cancer. All analyses were performed on an intention-to-treat basis. A total of 137 patients met the inclusion criteria for this study. Of the 75 LLARs for intraperitoneal rectal cancer, 40 were performed by expert surgeons (I-E group) and 35 by resident surgeons (I-R group). Of the 62 LLARs for extraperitoneal rectal cancer, 51 were performed by expert surgeons (E-E group) and 11 by resident surgeons (E-R group). The operative time was longer in the E-R group than in the E-E group. The time to resumption of diet was longer in the I-E group than in the I-R group. The other early outcomes, including blood loss, anastomotic leakage, conversion to open surgery, and number of lymph nodes harvested, were similar in the I-E and I-R groups and in the E-E and E-R groups. Our systematic training program on LLAR for rectal cancer enables resident surgeons to perform this procedure safely early during residency, with acceptable short-term outcomes.

[Comparison of the application between circular stapler and linear stapler in Billroth II( anastomosis of distal gastrectomy].

PubMed

Zhang, Nan; Su, Xiangqian; Xu, Kai

2018-02-25

To compare the safety and effectiveness of circular stapler and linear stapler in Billroth II( anastomosis following distal gastrectomy for gastric cancer patients. Clinical data of gastric adenocarcinoma patients who received distal gastrectomy with Billroth II( anastomosis at Ward IIII( of Gastrointestinal Cancer Center of Peking University Cancer Hospital from January 2013 to April 2017 were collected retrospectively. (1) patients identified as stage IIII( gastric cancer by preoperative clinical and postoperative pathological staging. (2) patients undergoing emergency operation due to perforation, obstruction, or bleeding of digestive tract. (3) patients receiving chemotherapy before operation. (4) patients undergoing combined organ resection due to tumor involving other organs. (5) patients complicating with other malignancies. A total of 116 cases were enrolled and divided into circular stapler (CS, 61 cases) group and linear stapler (LS, 55 cases) group according to the application of mechanical stapler. Clinicopathological characteristics, operative conditions and postoperative recovery were compared between two groups. Differences in baseline data, such as tumor size, Lauren classification, differentiation grade, and pathologic stage, between two groups were not statistically significant (all P>0.05). The mean operative time (230 min vs. 234 min), median intra-operative blood loss (50.0 ml vs. 50.0 ml), median number of harvested lymph node (28.0 vs. 26.0) and median number of positive lymph node (1.0 vs. 2.0) between LS group and CS group were not significantly different (all P>0.05) As compared to CS group, LS group presented shorter median time to the first flatus (3.0 days vs. 4.0 days, P=0.038), shorter median time to the first liquid diet (7.0 days vs. 8.0 days, P=0.000), shorter median time to remove the first abdominal drainage tube (7.0 days vs. 9.0 days, P=0.000) and shorter median time of postoperative hospital stay (8.0 days vs. 10.0 days, P=0.000). The morbidity of postoperative complication was 11.5% and 1.8% in CS group and LS group respectively without significant difference (P=0.092). In CS group, 1 case (1.6%) developed anastomotic hemorrhage, 3 cases (4.9%) gastric emptying disorder and 3 cases (4.9%) abdominal infection after operation, who all were cured by conservative treatment without duodenal stump fistula and re-operation. In LS group, only 1 case (1.8%) developed duodenal stump fistula and was cured by re-operation. In distal gastrectomy with Billroth II( anastomosis for gastric cancer, the application of linear stapler results in faster recovery of gastrointestinal function and shorter hospital stay, indicating more advantages.

Exact analytical solution of irreversible binary dynamics on networks.

PubMed

Laurence, Edward; Young, Jean-Gabriel; Melnik, Sergey; Dubé, Louis J

2018-03-01

In binary cascade dynamics, the nodes of a graph are in one of two possible states (inactive, active), and nodes in the inactive state make an irreversible transition to the active state, as soon as their precursors satisfy a predetermined condition. We introduce a set of recursive equations to compute the probability of reaching any final state, given an initial state, and a specification of the transition probability function of each node. Because the naive recursive approach for solving these equations takes factorial time in the number of nodes, we also introduce an accelerated algorithm, built around a breath-first search procedure. This algorithm solves the equations as efficiently as possible in exponential time.

Exact analytical solution of irreversible binary dynamics on networks

NASA Astrophysics Data System (ADS)

Laurence, Edward; Young, Jean-Gabriel; Melnik, Sergey; Dubé, Louis J.

2018-03-01

In binary cascade dynamics, the nodes of a graph are in one of two possible states (inactive, active), and nodes in the inactive state make an irreversible transition to the active state, as soon as their precursors satisfy a predetermined condition. We introduce a set of recursive equations to compute the probability of reaching any final state, given an initial state, and a specification of the transition probability function of each node. Because the naive recursive approach for solving these equations takes factorial time in the number of nodes, we also introduce an accelerated algorithm, built around a breath-first search procedure. This algorithm solves the equations as efficiently as possible in exponential time.

Self-Organizing OFDMA System for Broadband Communication

NASA Technical Reports Server (NTRS)

Roy, Aloke (Inventor); Anandappan, Thanga (Inventor); Malve, Sharath Babu (Inventor)

2016-01-01

Systems and methods for a self-organizing OFDMA system for broadband communication are provided. In certain embodiments a communication node for a self organizing network comprises a communication interface configured to transmit data to and receive data from a plurality of nodes; and a processing unit configured to execute computer readable instructions. Further, computer readable instructions direct the processing unit to identify a sub-region within a cell, wherein the communication node is located in the sub-region; and transmit at least one data frame, wherein the data from the communication node is transmitted at a particular time and frequency as defined within the at least one data frame, where the time and frequency are associated with the sub-region.

Non-smooth saddle-node bifurcations III: Strange attractors in continuous time

NASA Astrophysics Data System (ADS)

Fuhrmann, G.

2016-08-01

Non-smooth saddle-node bifurcations give rise to minimal sets of interesting geometry built of so-called strange non-chaotic attractors. We show that certain families of quasiperiodically driven logistic differential equations undergo a non-smooth bifurcation. By a previous result on the occurrence of non-smooth bifurcations in forced discrete time dynamical systems, this yields that within the class of families of quasiperiodically driven differential equations, non-smooth saddle-node bifurcations occur in a set with non-empty C2-interior.

Implementation of Multiple Host Nodes in Wireless Sensing Node Network System for Landslide Monitoring

NASA Astrophysics Data System (ADS)

Abas, Faizulsalihin bin; Takayama, Shigeru

2015-02-01

This paper proposes multiple host nodes in Wireless Sensing Node Network System (WSNNS) for landslide monitoring. As landslide disasters damage monitoring system easily, one major demand in landslide monitoring is the flexibility and robustness of the system to evaluate the current situation in the monitored area. For various reasons WSNNS can provide an important contribution to reach that aim. In this system, acceleration sensors and GPS are deployed in sensing nodes. Location information by GPS, enable the system to estimate network topology and enable the system to perceive the location in emergency by monitoring the node mode. Acceleration sensors deployment, capacitate this system to detect slow mass movement that can lead to landslide occurrence. Once deployed, sensing nodes self-organize into an autonomous wireless ad hoc network. The measurement parameter data from sensing nodes is transmitted to Host System via host node and "Cloud" System. The implementation of multiple host nodes in Local Sensing Node Network System (LSNNS), improve risk- management of the WSNNS for real-time monitoring of landslide disaster.

Dynamical Response of Networks Under External Perturbations: Exact Results

NASA Astrophysics Data System (ADS)

Chinellato, David D.; Epstein, Irving R.; Braha, Dan; Bar-Yam, Yaneer; de Aguiar, Marcus A. M.

2015-04-01

We give exact statistical distributions for the dynamic response of influence networks subjected to external perturbations. We consider networks whose nodes have two internal states labeled 0 and 1. We let nodes be frozen in state 0, in state 1, and the remaining nodes change by adopting the state of a connected node with a fixed probability per time step. The frozen nodes can be interpreted as external perturbations to the subnetwork of free nodes. Analytically extending and to be smaller than 1 enables modeling the case of weak coupling. We solve the dynamical equations exactly for fully connected networks, obtaining the equilibrium distribution, transition probabilities between any two states and the characteristic time to equilibration. Our exact results are excellent approximations for other topologies, including random, regular lattice, scale-free and small world networks, when the numbers of fixed nodes are adjusted to take account of the effect of topology on coupling to the environment. This model can describe a variety of complex systems, from magnetic spins to social networks to population genetics, and was recently applied as a framework for early warning signals for real-world self-organized economic market crises.

DCS-Neural-Network Program for Aircraft Control and Testing

NASA Technical Reports Server (NTRS)

Jorgensen, Charles C.

2006-01-01

A computer program implements a dynamic-cell-structure (DCS) artificial neural network that can perform such tasks as learning selected aerodynamic characteristics of an airplane from wind-tunnel test data and computing real-time stability and control derivatives of the airplane for use in feedback linearized control. A DCS neural network is one of several types of neural networks that can incorporate additional nodes in order to rapidly learn increasingly complex relationships between inputs and outputs. In the DCS neural network implemented by the present program, the insertion of nodes is based on accumulated error. A competitive Hebbian learning rule (a supervised-learning rule in which connection weights are adjusted to minimize differences between actual and desired outputs for training examples) is used. A Kohonen-style learning rule (derived from a relatively simple training algorithm, implements a Delaunay triangulation layout of neurons) is used to adjust node positions during training. Neighborhood topology determines which nodes are used to estimate new values. The network learns, starting with two nodes, and adds new nodes sequentially in locations chosen to maximize reductions in global error. At any given time during learning, the error becomes homogeneously distributed over all nodes.

Comparison of different strategies for using fossil calibrations to generate the time prior in Bayesian molecular clock dating.

PubMed

Barba-Montoya, Jose; Dos Reis, Mario; Yang, Ziheng

2017-09-01

Fossil calibrations are the utmost source of information for resolving the distances between molecular sequences into estimates of absolute times and absolute rates in molecular clock dating analysis. The quality of calibrations is thus expected to have a major impact on divergence time estimates even if a huge amount of molecular data is available. In Bayesian molecular clock dating, fossil calibration information is incorporated in the analysis through the prior on divergence times (the time prior). Here, we evaluate three strategies for converting fossil calibrations (in the form of minimum- and maximum-age bounds) into the prior on times, which differ according to whether they borrow information from the maximum age of ancestral nodes and minimum age of descendent nodes to form constraints for any given node on the phylogeny. We study a simple example that is analytically tractable, and analyze two real datasets (one of 10 primate species and another of 48 seed plant species) using three Bayesian dating programs: MCMCTree, MrBayes and BEAST2. We examine how different calibration strategies, the birth-death process, and automatic truncation (to enforce the constraint that ancestral nodes are older than descendent nodes) interact to determine the time prior. In general, truncation has a great impact on calibrations so that the effective priors on the calibration node ages after the truncation can be very different from the user-specified calibration densities. The different strategies for generating the effective prior also had considerable impact, leading to very different marginal effective priors. Arbitrary parameters used to implement minimum-bound calibrations were found to have a strong impact upon the prior and posterior of the divergence times. Our results highlight the importance of inspecting the joint time prior used by the dating program before any Bayesian dating analysis. Copyright © 2017 The Authors. Published by Elsevier Inc. All rights reserved.

A data management approach to quality assurance using colorectal carcinoma reports from two institutions as a model.

PubMed

Sorge, John P; Harmon, C Reid; Sherman, Susan M; Baillie, E Eugene

2005-07-01

We used data management software to compare pathology report data concerning regional lymph node sampling for colorectal carcinoma from 2 institutions using different dissection methods. Data were retrieved from 2 disparate anatomic pathology information systems for all cases of colorectal carcinoma in 2003 involving the ascending and descending colon. Initial sorting of the data included overall lymph node recovery to assess differences between the dissection methods at the 2 institutions. Additional segregation of the data was used to challenge the application's capability of accurately addressing the complexity of the process. This software approach can be used to evaluate data from disparate computer systems, and we demonstrate how an automated function can enable institutions to compare internal pathologic assessment processes and the results of those comparisons. The use of this process has future implications for pathology quality assurance in other areas.

Sentinel lymph node biopsy in endometrial cancer-Feasibility, safety and lymphatic complications.

PubMed

Geppert, Barbara; Lönnerfors, Céline; Bollino, Michele; Persson, Jan

2018-03-01

To compare the rate of lymphatic complications in women with endometrial cancer undergoing sentinel lymph node biopsy versus a full pelvic and infrarenal paraaortic lymphadenectomy, and to examine the overall feasibility and safety of the former. A prospective study of 188 patients with endometrial cancer planned for robotic surgery. Indocyanine green was used to identify the sentinel lymph nodes. In low-risk patients the lymphadenectomy was restricted to removal of sentinel lymph nodes whereas in high-risk patients also a full lymphadenectomy was performed. The impact of the extent of the lymphadenectomy on the rate of complications was evaluated. The bilateral detection rate of sentinel lymph nodes was 96% after cervical tracer injection. No intraoperative complication was associated with the sentinel lymph node biopsy per se. Compared with hysterectomy alone, the additional average operative time for removal of sentinel lymph nodes was 33min whereas 91min were saved compared with a full pelvic and paraaortic lymphadenectomy. Sentinel lymph node biopsy alone resulted in a lower incidence of leg lymphedema than infrarenal paraaortic and pelvic lymphadenectomy (1.3% vs 18.1%, p=0.0003). The high feasibility, the absence of intraoperative complications and the low risk of lymphatic complications supports implementing detection of sentinel lymph nodes in low-risk endometrial cancer patients. Given that available preliminary data on sensitivity and false negative rates in high-risk patients are confirmed in further studies, we also believe that the reduction in lymphatic complications and operative time strongly motivates the sentinel lymph node concept in high-risk endometrial cancer. Copyright © 2017. Published by Elsevier Inc.

Sentinel node detection in early breast cancer with intraoperative portable gamma camera: UK experience.

PubMed

Ghosh, Debashis; Michalopoulos, Nikolaos V; Davidson, Timothy; Wickham, Fred; Williams, Norman R; Keshtgar, Mohammed R

2017-04-01

Access to nuclear medicine department for sentinel node imaging remains an issue in number of hospitals in the UK and many parts of the world. Sentinella ® is a portable imaging camera used intra-operatively to produce real time visual localisation of sentinel lymph nodes. Sentinella ® was tested in a controlled laboratory environment at our centre and we report our experience on the first use of this technology from UK. Moreover, preoperative scintigrams of the axilla were obtained in 144 patients undergoing sentinel node biopsy using conventional gamma camera. Sentinella ® scans were done intra-operatively to correlate with the pre-operative scintigram and to determine presence of any residual hot node after the axilla was deemed to be clear based on the silence of the hand held gamma probe. Sentinella ® detected significantly more nodes compared with CGC (p < 0.0001). Sentinella ® picked up extra nodes in 5/144 cases after the axilla was found silent using hand held gamma probe. In 2/144 cases, extra nodes detected by Sentinella ® confirmed presence of tumour cells that led to a complete axillary clearance. Sentinella ® is a reliable technique for intra-operative localisation of radioactive nodes. It provides increased nodal visualisation rates compared to static scintigram imaging and proves to be an important tool for harvesting all hot sentinel nodes. This portable gamma camera can definitely replace the use of conventional lymphoscintigrams saving time and money both for patients and the health system. Copyright © 2016 Elsevier Ltd. All rights reserved.

Mathematical Modeling Reveals Kinetics of Lymphocyte Recirculation in the Whole Organism

PubMed Central

Ganusov, Vitaly V.; Auerbach, Jeremy

2014-01-01

The kinetics of recirculation of naive lymphocytes in the body has important implications for the speed at which local infections are detected and controlled by immune responses. With a help of a novel mathematical model, we analyze experimental data on migration of 51Cr-labeled thoracic duct lymphocytes (TDLs) via major lymphoid and nonlymphoid tissues of rats in the absence of systemic antigenic stimulation. We show that at any point of time, 95% of lymphocytes in the blood travel via capillaries in the lung or sinusoids of the liver and only 5% migrate to secondary lymphoid tissues such as lymph nodes, Peyer's patches, or the spleen. Interestingly, our analysis suggests that lymphocytes travel via lung capillaries and liver sinusoids at an extremely rapid rate with the average residence time in these tissues being less than 1 minute. The model also predicts a relatively short average residence time of TDLs in the spleen (2.5 hours) and a longer average residence time of TDLs in major lymph nodes and Peyer's patches (10 hours). Surprisingly, we find that the average residence time of lymphocytes is similar in lymph nodes draining the skin (subcutaneous LNs) or the gut (mesenteric LNs) or in Peyer's patches. Applying our model to an additional dataset on lymphocyte migration via resting and antigen-stimulated lymph nodes we find that enlargement of antigen-stimulated lymph nodes occurs mainly due to increased entrance rate of TDLs into the nodes and not due to decreased exit rate as has been suggested in some studies. Taken together, our analysis for the first time provides a comprehensive, systems view of recirculation kinetics of thoracic duct lymphocytes in the whole organism. PMID:24830705

Vaccine draining lymph nodes are a source of antigen-specific B cells.

PubMed

Pero, Stephanie C; Sun, Yu-Jing; Shukla, Girja S; Carman, Chelsea L; Krag, Christopher C; Teuscher, Cory; Krementsov, Dimitry N; Krag, David N

2017-03-01

Our research is focused on using vaccine draining lymph nodes as a source of immune cells to better understand the immune response and to attempt to generate new anti-cancer reagents. Following a vaccine, harvesting the lymph node can only be done once. We endeavored to determine the range of times that B cells secreting anti-KLH antibodies were present in the node of KLH-vaccinated mice. Following vaccination the total number of mononuclear cells (MNCs) increased in the vaccine-draining lymph node (VDN). The percentage of MNCs that were B cells nearly doubled. B cells recovered from the node that secreted anti-KLH antibodies were evident by day 7. The number continued to increase and then slowly decreased over the observed time range to 28days after vaccination. The VDN, compared to the spleen, the bone marrow and the nonVDN, contained a higher percentage of B cells that secreted anti-KLH antibodies. After a vaccine, there is a multi-week window of time when an increasing number of B cells are present in a VDN that secrete anti-KLH antibodies. These results support using the VDN as a source for B cells that secrete anti-vaccine antibodies. Copyright © 2017 Elsevier Ltd. All rights reserved.

Magnetic resonance imaging provides evidence of glymphatic drainage from human brain to cervical lymph nodes.

PubMed

Eide, Per Kristian; Vatnehol, Svein Are Sirirud; Emblem, Kyrre Eeg; Ringstad, Geir

2018-05-08

Pre-clinical research in rodents provides evidence that the central nervous system (CNS) has functional lymphatic vessels. In-vivo observations in humans, however, are not demonstrated. We here show data on CNS lymphatic drainage to cervical lymph nodes in-vivo by magnetic resonance imaging (MRI) enhanced with an intrathecal contrast agent as a cerebrospinal fluid (CSF) tracer. Standardized MRI of the intracranial compartment and the neck were acquired before and up to 24-48 hours following intrathecal contrast agent administration in 19 individuals. Contrast enhancement was radiologically confirmed by signal changes in CSF nearby inferior frontal gyrus, brain parenchyma of inferior frontal gyrus, parahippocampal gyrus, thalamus and pons, and parenchyma of cervical lymph node, and with sagittal sinus and neck muscle serving as reference tissue for cranial and neck MRI acquisitions, respectively. Time series of changes in signal intensity shows that contrast enhancement within CSF precedes glymphatic enhancement and peaks at 4-6 hours following intrathecal injection. Cervical lymph node enhancement coincides in time with peak glymphatic enhancement, with peak after 24 hours. Our findings provide in-vivo evidence of CSF tracer drainage to cervical lymph nodes in humans. The time course of lymph node enhancement coincided with brain glymphatic enhancement rather than with CSF enhancement.

Time Series Analysis for Spatial Node Selection in Environment Monitoring Sensor Networks

PubMed Central

Bhandari, Siddhartha; Jurdak, Raja; Kusy, Branislav

2017-01-01

Wireless sensor networks are widely used in environmental monitoring. The number of sensor nodes to be deployed will vary depending on the desired spatio-temporal resolution. Selecting an optimal number, position and sampling rate for an array of sensor nodes in environmental monitoring is a challenging question. Most of the current solutions are either theoretical or simulation-based where the problems are tackled using random field theory, computational geometry or computer simulations, limiting their specificity to a given sensor deployment. Using an empirical dataset from a mine rehabilitation monitoring sensor network, this work proposes a data-driven approach where co-integrated time series analysis is used to select the number of sensors from a short-term deployment of a larger set of potential node positions. Analyses conducted on temperature time series show 75% of sensors are co-integrated. Using only 25% of the original nodes can generate a complete dataset within a 0.5 °C average error bound. Our data-driven approach to sensor position selection is applicable for spatiotemporal monitoring of spatially correlated environmental parameters to minimize deployment cost without compromising data resolution. PMID:29271880

One Year of Data of Scimpi Borehole Measurements

NASA Astrophysics Data System (ADS)

Insua, T. L.; Moran, K.; Kulin, I.; Farrington, S.; Newman, J. B.; Riedel, M.; Scherwath, M.; Heesemann, M.; Pirenne, B.; Iturrino, G. J.; Masterson, W.; Furman, C.

2014-12-01

The Simple Cabled Instrument for Measuring Parameters In-Situ (SCIMPI) is a new subseafloor observatory designed to study dynamic processes in the subseabed using a simple and low-cost approach compared to a Circulation Obviation Retrofit Kit (CORK). SCIMPI was successfully installed at the Integrated Ocean Drilling Program (IODP) Site U1416 during IODP Expedition 341S in May 2013. SCIMPI is designed to measure pore pressure, temperature and electrical resistivity over time in a borehole. The first SCIMPI prototype comprises nine modules joined in a single array by flexible cables. Multiple floats keep the system taut against a sinker bar weight located on SCIMPI and resting on the bottom of the borehole. All the modules record temperature and electrical resistivity, and three are also equipped with pressure sensors. Currently, SCIMPI operates as an autonomous instrument with a data logger that is recovered using an ROV. The second recovery of the SCIMPI data logger took place during the Ocean Networks Canada maintenance cruise, Wiring the Abyss 2014, on May 25th, 2014. The pressure sensor data show a stable trend in which tidal effects are observed in through the one year deployment. The temperature measurements in all the modules became stable over time with smaller variations over the last several months. The only temperature sensor differing from this trend is the shallowest, located at 8 meters below seafloor. This module shows a sudden spike of ~20°C that on April 5th, 2014, an event that was repeated several times from April 25th until recovery of modules. The electrical resistivity sensors show variations over time that could be related to gas hydrate dynamics at the Site. Interpretation of these data is speculative at this time but borehole-sealing processes as well as the formation of gas hydrate are potential processes influencing the recordings. SCIMPI will soon be connected to Ocean Networks Canada's NEPTUNE observatory at Clayoquot Slope node to provide real-time data from this subseafloor observatory.

A Simple Method for Estimating Informative Node Age Priors for the Fossil Calibration of Molecular Divergence Time Analyses

PubMed Central

Nowak, Michael D.; Smith, Andrew B.; Simpson, Carl; Zwickl, Derrick J.

2013-01-01

Molecular divergence time analyses often rely on the age of fossil lineages to calibrate node age estimates. Most divergence time analyses are now performed in a Bayesian framework, where fossil calibrations are incorporated as parametric prior probabilities on node ages. It is widely accepted that an ideal parameterization of such node age prior probabilities should be based on a comprehensive analysis of the fossil record of the clade of interest, but there is currently no generally applicable approach for calculating such informative priors. We provide here a simple and easily implemented method that employs fossil data to estimate the likely amount of missing history prior to the oldest fossil occurrence of a clade, which can be used to fit an informative parametric prior probability distribution on a node age. Specifically, our method uses the extant diversity and the stratigraphic distribution of fossil lineages confidently assigned to a clade to fit a branching model of lineage diversification. Conditioning this on a simple model of fossil preservation, we estimate the likely amount of missing history prior to the oldest fossil occurrence of a clade. The likelihood surface of missing history can then be translated into a parametric prior probability distribution on the age of the clade of interest. We show that the method performs well with simulated fossil distribution data, but that the likelihood surface of missing history can at times be too complex for the distribution-fitting algorithm employed by our software tool. An empirical example of the application of our method is performed to estimate echinoid node ages. A simulation-based sensitivity analysis using the echinoid data set shows that node age prior distributions estimated under poor preservation rates are significantly less informative than those estimated under high preservation rates. PMID:23755303

Preoperative ultrasound staging of the axilla make's peroperative examination of the sentinel node redundant in breast cancer: saving tissue, time and money.

PubMed

Van Berckelaer, Christophe; Huizing, Manon; Van Goethem, Mireille; Vervaecke, Andrew; Papadimitriou, Konstantinos; Verslegers, Inge; Trinh, Bich X; Van Dam, Peter; Altintas, Sevilay; Van den Wyngaert, Tim; Huyghe, Ivan; Siozopoulou, Vasiliki; Tjalma, Wiebren A A

2016-11-01

To evaluate the role of preoperative axillary staging with ultrasound (US) and fine needle aspiration cytology (FNAC). Can we avoid intraoperative sentinel lymph node (SLN) examination, with an acceptable revision rate by preoperative staging? This study is based on the retrospective data of 336 patients that underwent US evaluation of the axilla as part of their staging. A FNAC biopsy was performed when abnormal lymph nodes were visualized. Patients with normal appearing nodes on US or a benign diagnostic biopsy had removal of the SLNs without intraoperative pathological examination. We calculated the sensitivity, specificity and accuracy of US/FNAC in predicting the necessity of an axillary lymphadenectomy. Subsequently we looked at the total cost and the operating time of 3 models. Model A is our study protocol. Model B is a theoretical protocol based on the findings of the Z0011 trial with only clinical preoperative staging and in Model C preoperative staging and intraoperative pathological examination were both theoretically done. sentinel node, staging, ultrasound, preoperative axillary staging, FNAC, axilla RESULTS: The sensitivity, specificity and accuracy are respectively 0.75 (0.66-0.82), 1.00 (0.99-1.00) and 0.92 (0.88-0.94). Only 26 out of 317 (8.2%) patients that successfully underwent staging needed a revision. The total cost of Model A was 1.58% cheaper than Model C and resulted in a decrease in operation time by 9,46%. The benefits compared with Model B were much smaller. Preoperative US/FNAC staging of the axillary lymph nodes can avoid intraoperative examination of the sentinel node with an acceptable revision rate. It saves tissue, reduces operating time and decreases healthcare costs in general. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Noninvasive Electromagnetic Source Imaging and Granger Causality Analysis: An Electrophysiological Connectome (eConnectome) Approach

PubMed Central

Sohrabpour, Abbas; Ye, Shuai; Worrell, Gregory A.; Zhang, Wenbo

2016-01-01

Objective Combined source imaging techniques and directional connectivity analysis can provide useful information about the underlying brain networks in a non-invasive fashion. Source imaging techniques have been used successfully to either determine the source of activity or to extract source time-courses for Granger causality analysis, previously. In this work, we utilize source imaging algorithms to both find the network nodes (regions of interest) and then extract the activation time series for further Granger causality analysis. The aim of this work is to find network nodes objectively from noninvasive electromagnetic signals, extract activation time-courses and apply Granger analysis on the extracted series to study brain networks under realistic conditions. Methods Source imaging methods are used to identify network nodes and extract time-courses and then Granger causality analysis is applied to delineate the directional functional connectivity of underlying brain networks. Computer simulations studies where the underlying network (nodes and connectivity pattern) is known were performed; additionally, this approach has been evaluated in partial epilepsy patients to study epilepsy networks from inter-ictal and ictal signals recorded by EEG and/or MEG. Results Localization errors of network nodes are less than 5 mm and normalized connectivity errors of ~20% in estimating underlying brain networks in simulation studies. Additionally, two focal epilepsy patients were studied and the identified nodes driving the epileptic network were concordant with clinical findings from intracranial recordings or surgical resection. Conclusion Our study indicates that combined source imaging algorithms with Granger causality analysis can identify underlying networks precisely (both in terms of network nodes location and internodal connectivity). Significance The combined source imaging and Granger analysis technique is an effective tool for studying normal or pathological brain conditions. PMID:27740473

Noninvasive Electromagnetic Source Imaging and Granger Causality Analysis: An Electrophysiological Connectome (eConnectome) Approach.

PubMed

Sohrabpour, Abbas; Ye, Shuai; Worrell, Gregory A; Zhang, Wenbo; He, Bin

2016-12-01

Combined source-imaging techniques and directional connectivity analysis can provide useful information about the underlying brain networks in a noninvasive fashion. Source-imaging techniques have been used successfully to either determine the source of activity or to extract source time-courses for Granger causality analysis, previously. In this work, we utilize source-imaging algorithms to both find the network nodes [regions of interest (ROI)] and then extract the activation time series for further Granger causality analysis. The aim of this work is to find network nodes objectively from noninvasive electromagnetic signals, extract activation time-courses, and apply Granger analysis on the extracted series to study brain networks under realistic conditions. Source-imaging methods are used to identify network nodes and extract time-courses and then Granger causality analysis is applied to delineate the directional functional connectivity of underlying brain networks. Computer simulations studies where the underlying network (nodes and connectivity pattern) is known were performed; additionally, this approach has been evaluated in partial epilepsy patients to study epilepsy networks from interictal and ictal signals recorded by EEG and/or Magnetoencephalography (MEG). Localization errors of network nodes are less than 5 mm and normalized connectivity errors of ∼20% in estimating underlying brain networks in simulation studies. Additionally, two focal epilepsy patients were studied and the identified nodes driving the epileptic network were concordant with clinical findings from intracranial recordings or surgical resection. Our study indicates that combined source-imaging algorithms with Granger causality analysis can identify underlying networks precisely (both in terms of network nodes location and internodal connectivity). The combined source imaging and Granger analysis technique is an effective tool for studying normal or pathological brain conditions.

Comprehensive study of numerical anisotropy and dispersion in 3-D TLM meshes

NASA Astrophysics Data System (ADS)

Berini, Pierre; Wu, Ke

1995-05-01

This paper presents a comprehensive analysis of the numerical anisotropy and dispersion of 3-D TLM meshes constructed using several generalized symmetrical condensed TLM nodes. The dispersion analysis is performed in isotropic lossless, isotropic lossy and anisotropic lossless media and yields a comparison of the simulation accuracy for the different TLM nodes. The effect of mesh grading on the numerical dispersion is also determined. The results compare meshes constructed with Johns' symmetrical condensed node (SCN), two hybrid symmetrical condensed nodes (HSCN) and two frequency domain symmetrical condensed nodes (FDSCN). It has been found that under certain circumstances, the time domain nodes may introduce numerical anisotropy when modelling isotropic media.

Trade-offs between driving nodes and time-to-control in complex networks

PubMed Central

Pequito, Sérgio; Preciado, Victor M.; Barabási, Albert-László; Pappas, George J.

2017-01-01

Recent advances in control theory provide us with efficient tools to determine the minimum number of driving (or driven) nodes to steer a complex network towards a desired state. Furthermore, we often need to do it within a given time window, so it is of practical importance to understand the trade-offs between the minimum number of driving/driven nodes and the minimum time required to reach a desired state. Therefore, we introduce the notion of actuation spectrum to capture such trade-offs, which we used to find that in many complex networks only a small fraction of driving (or driven) nodes is required to steer the network to a desired state within a relatively small time window. Furthermore, our empirical studies reveal that, even though synthetic network models are designed to present structural properties similar to those observed in real networks, their actuation spectra can be dramatically different. Thus, it supports the need to develop new synthetic network models able to replicate controllability properties of real-world networks. PMID:28054597

Trade-offs between driving nodes and time-to-control in complex networks

NASA Astrophysics Data System (ADS)

Pequito, Sérgio; Preciado, Victor M.; Barabási, Albert-László; Pappas, George J.

2017-01-01

Recent advances in control theory provide us with efficient tools to determine the minimum number of driving (or driven) nodes to steer a complex network towards a desired state. Furthermore, we often need to do it within a given time window, so it is of practical importance to understand the trade-offs between the minimum number of driving/driven nodes and the minimum time required to reach a desired state. Therefore, we introduce the notion of actuation spectrum to capture such trade-offs, which we used to find that in many complex networks only a small fraction of driving (or driven) nodes is required to steer the network to a desired state within a relatively small time window. Furthermore, our empirical studies reveal that, even though synthetic network models are designed to present structural properties similar to those observed in real networks, their actuation spectra can be dramatically different. Thus, it supports the need to develop new synthetic network models able to replicate controllability properties of real-world networks.

Time Synchronization/Stamping Method with Visible Light Communication and Energy Harvesting Methods for Wireless Sensor Network Inside Ariane 5 Vehicle Equipment Bay

NASA Astrophysics Data System (ADS)

Kesuma, Hendra; Niederkleine, Kris; Schmale, Sebastian; Ahobala, Tejas; Paul, Steffen; Sebald, Johannes

2016-08-01

In this work we design and implement efficient time synchronization/stamping method for Wireless Sensor Network inside the Vehicle Equipment Bay (VEB) of the ARIANE 5. The sensor nodes in the network do not require real time clock (RTC) hardware to store and stamp each measurement data performed by the sensors. There will be only the measurement sequence information, previous time (clock) information, measurement data and its related data protocol information sent back to the Access Point (AP). This lead to less data transmission, less energy and less time required by the sensor nodes to operate and also leads to longer battery life time. The Visible Light Communication (VLC) is used, to provide energy, to synchronize time and to deliver the commands to the sensor nodes in the network. By employing star network topology, a part of solar cell as receiver, the conventional receiver (RF/Infrared) is neglected to reduce amount of hardware and energy consumption. The infrared transmitter on the sensor node is deployed to minimize the electromagnetic interference in the launcher and does not require a complicated circuit in comparison to a RF transmitter.

Neural networks for link prediction in realistic biomedical graphs: a multi-dimensional evaluation of graph embedding-based approaches.

PubMed

Crichton, Gamal; Guo, Yufan; Pyysalo, Sampo; Korhonen, Anna

2018-05-21

Link prediction in biomedical graphs has several important applications including predicting Drug-Target Interactions (DTI), Protein-Protein Interaction (PPI) prediction and Literature-Based Discovery (LBD). It can be done using a classifier to output the probability of link formation between nodes. Recently several works have used neural networks to create node representations which allow rich inputs to neural classifiers. Preliminary works were done on this and report promising results. However they did not use realistic settings like time-slicing, evaluate performances with comprehensive metrics or explain when or why neural network methods outperform. We investigated how inputs from four node representation algorithms affect performance of a neural link predictor on random- and time-sliced biomedical graphs of real-world sizes (∼ 6 million edges) containing information relevant to DTI, PPI and LBD. We compared the performance of the neural link predictor to those of established baselines and report performance across five metrics. In random- and time-sliced experiments when the neural network methods were able to learn good node representations and there was a negligible amount of disconnected nodes, those approaches outperformed the baselines. In the smallest graph (∼ 15,000 edges) and in larger graphs with approximately 14% disconnected nodes, baselines such as Common Neighbours proved a justifiable choice for link prediction. At low recall levels (∼ 0.3) the approaches were mostly equal, but at higher recall levels across all nodes and average performance at individual nodes, neural network approaches were superior. Analysis showed that neural network methods performed well on links between nodes with no previous common neighbours; potentially the most interesting links. Additionally, while neural network methods benefit from large amounts of data, they require considerable amounts of computational resources to utilise them. Our results indicate that when there is enough data for the neural network methods to use and there are a negligible amount of disconnected nodes, those approaches outperform the baselines. At low recall levels the approaches are mostly equal but at higher recall levels and average performance at individual nodes, neural network approaches are superior. Performance at nodes without common neighbours which indicate more unexpected and perhaps more useful links account for this.

A Very Low Power MAC (VLPM) Protocol for Wireless Body Area Networks

PubMed Central

Ullah, Niamat; Khan, Pervez; Kwak, Kyung Sup

2011-01-01

Wireless Body Area Networks (WBANs) consist of a limited number of battery operated nodes that are used to monitor the vital signs of a patient over long periods of time without restricting the patient’s movements. They are an easy and fast way to diagnose the patient’s status and to consult the doctor. Device as well as network lifetime are among the most important factors in a WBAN. Prolonging the lifetime of the WBAN strongly depends on controlling the energy consumption of sensor nodes. To achieve energy efficiency, low duty cycle MAC protocols are used, but for medical applications, especially in the case of pacemakers where data have time-limited relevance, these protocols increase latency which is highly undesirable and leads to system instability. In this paper, we propose a low power MAC protocol (VLPM) based on existing wakeup radio approaches which reduce energy consumption as well as improving the response time of a node. We categorize the traffic into uplink and downlink traffic. The nodes are equipped with both a low power wake-up transmitter and receiver. The low power wake-up receiver monitors the activity on channel all the time with a very low power and keeps the MCU (Micro Controller Unit) along with main radio in sleep mode. When a node [BN or BNC (BAN Coordinator)] wants to communicate with another node, it uses the low-power radio to send a wakeup packet, which will prompt the receiver to power up its primary radio to listen for the message that follows shortly. The wake-up packet contains the desired node’s ID along with some other information to let the targeted node to wake-up and take part in communication and let all other nodes to go to sleep mode quickly. The VLPM protocol is proposed for applications having low traffic conditions. For high traffic rates, optimization is needed. Analytical results show that the proposed protocol outperforms both synchronized and unsynchronized MAC protocols like T-MAC, SCP-MAC, B-MAC and X-MAC in terms of energy consumption and response time. PMID:22163818

Understanding the influence of all nodes in a network

PubMed Central

Lawyer, Glenn

2015-01-01

Centrality measures such as the degree, k-shell, or eigenvalue centrality can identify a network's most influential nodes, but are rarely usefully accurate in quantifying the spreading power of the vast majority of nodes which are not highly influential. The spreading power of all network nodes is better explained by considering, from a continuous-time epidemiological perspective, the distribution of the force of infection each node generates. The resulting metric, the expected force, accurately quantifies node spreading power under all primary epidemiological models across a wide range of archetypical human contact networks. When node power is low, influence is a function of neighbor degree. As power increases, a node's own degree becomes more important. The strength of this relationship is modulated by network structure, being more pronounced in narrow, dense networks typical of social networking and weakening in broader, looser association networks such as the Internet. The expected force can be computed independently for individual nodes, making it applicable for networks whose adjacency matrix is dynamic, not well specified, or overwhelmingly large. PMID:25727453

Lambda network having 2.sup.m-1 nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

DOEpatents

Napolitano, Jr., Leonard M.

1995-01-01

The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance.

Methods for operating parallel computing systems employing sequenced communications

DOEpatents

Benner, R.E.; Gustafson, J.L.; Montry, G.R.

1999-08-10

A parallel computing system and method are disclosed having improved performance where a program is concurrently run on a plurality of nodes for reducing total processing time, each node having a processor, a memory, and a predetermined number of communication channels connected to the node and independently connected directly to other nodes. The present invention improves performance of the parallel computing system by providing a system which can provide efficient communication between the processors and between the system and input and output devices. A method is also disclosed which can locate defective nodes with the computing system. 15 figs.

Methods for operating parallel computing systems employing sequenced communications

DOEpatents

Benner, Robert E.; Gustafson, John L.; Montry, Gary R.

1999-01-01

A parallel computing system and method having improved performance where a program is concurrently run on a plurality of nodes for reducing total processing time, each node having a processor, a memory, and a predetermined number of communication channels connected to the node and independently connected directly to other nodes. The present invention improves performance of performance of the parallel computing system by providing a system which can provide efficient communication between the processors and between the system and input and output devices. A method is also disclosed which can locate defective nodes with the computing system.

Method for simultaneous overlapped communications between neighboring processors in a multiple

DOEpatents

Benner, Robert E.; Gustafson, John L.; Montry, Gary R.

1991-01-01

A parallel computing system and method having improved performance where a program is concurrently run on a plurality of nodes for reducing total processing time, each node having a processor, a memory, and a predetermined number of communication channels connected to the node and independently connected directly to other nodes. The present invention improves performance of performance of the parallel computing system by providing a system which can provide efficient communication between the processors and between the system and input and output devices. A method is also disclosed which can locate defective nodes with the computing system.

An Algorithm for Critical Nodes Problem in Social Networks Based on Owen Value

PubMed Central

Wang, Xue-Guang

2014-01-01

Discovering critical nodes in social networks has many important applications. For finding out the critical nodes and considering the widespread community structure in social networks, we obtain each node's marginal contribution by Owen value. And then we can give a method for the solution of the critical node problem. We validate the feasibility and effectiveness of our method on two synthetic datasets and six real datasets. At the same time, the result obtained by using our method to analyze the terrorist network is in line with the actual situation. PMID:25006592

Stability of Gauss-Bonnet black holes in anti-de Sitter space-time against scalar field condensation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brihaye, Yves; Hartmann, Betti

We study the stability of static, hyperbolic Gauss-Bonnet black holes in (4+1)-dimensional anti-de Sitter (AdS) space-time against the formation of scalar hair. Close to extremality the black holes possess a near-horizon topology of AdS{sub 2}xH{sup 3} such that within a certain range of the scalar field mass one would expect that they become unstable to the condensation of an uncharged scalar field. We confirm this numerically and observe that there exists a family of hairy black hole solutions labeled by the number of nodes of the scalar field function. We construct explicit examples of solutions with a scalar field thatmore » possesses zero nodes, one node, and two nodes, respectively, and show that the solutions with nodes persist in the limit of Einstein gravity, i.e. for vanishing Gauss-Bonnet coupling. We observe that the interval of the mass for which scalar field condensation appears decreases with increasing Gauss-Bonnet coupling and/or with increasing node number.« less

Weyl magnons in noncoplanar stacked kagome antiferromagnets

NASA Astrophysics Data System (ADS)

Owerre, S. A.

2018-03-01

Weyl nodes have been experimentally realized in photonic, electronic, and phononic crystals. However, magnonic Weyl nodes are yet to be seen experimentally. In this paper, we propose Weyl magnon nodes in noncoplanar stacked frustrated kagome antiferromagnets, naturally available in various real materials. Most crucially, the Weyl nodes in the current system occur at the lowest excitation and possess a topological thermal Hall effect, therefore they are experimentally accessible at low temperatures due to the population effect of bosonic quasiparticles. In stark contrast to other magnetic systems, the current Weyl nodes do not rely on time-reversal symmetry breaking by the magnetic order. Rather, they result from explicit macroscopically broken time reversal symmetry by the scalar spin chirality of noncoplanar spin textures and can be generalized to chiral spin liquid states. Moreover, the scalar spin chirality gives a real space Berry curvature which is not available in previously studied magnetic Weyl systems. We show the existence of magnon arc surface states connecting projected Weyl magnon nodes on the surface Brillouin zone. We also uncover the first realization of triply-degenerate nodal magnon point in the noncollinear regime with zero scalar spin chirality.

The WS transform for the Kuramoto model with distributed amplitudes, phase lag and time delay

NASA Astrophysics Data System (ADS)

Lohe, M. A.

2017-12-01

We apply the Watanabe-Strogatz (WS) transform to a generalized Kuramoto model with distributed parameters describing the amplitude of oscillation, phase lag, and time delay at each node of the system. The model has global coupling and identical frequencies, but allows for repulsive interactions at arbitrary nodes leading to conformist-contrarian phenomena together with variable amplitude and time-delay effects. We show how to determine the initial values of the WS system for any initial conditions for the Kuramoto system, and investigate the asymptotic behaviour of the WS variables. For the case of zero time delay the possible asymptotic configurations are determined by the sign of a single parameter μ which measures whether or not the attractive nodes dominate the repulsive nodes. If μ>0 the system completely synchronizes from general initial conditions, whereas if μ<0 one of two types of phase-locked synchronization occurs, depending on the initial values, while for μ=0 periodic solutions can occur. For the case of arbitrary non-uniform time delays we derive a stability condition for completely synchronized solutions.

A Stirling engine analysis method based upon moving gas nodes

NASA Technical Reports Server (NTRS)

Martini, W. R.

1986-01-01

A Lagrangian nodal analysis method for Stirling engines (SEs) is described, validated, and applied to a conventional SE and an isothermalized SE (with fins in the hot and cold spaces). The analysis employs a constant-mass gas node (which moves with respect to the solid nodes during each time step) instead of the fixed gas nodes of Eulerian analysis. The isothermalized SE is found to have efficiency only slightly greater than that of a conventional SE.

A Localization Method for Underwater Wireless Sensor Networks Based on Mobility Prediction and Particle Swarm Optimization Algorithms

PubMed Central

Zhang, Ying; Liang, Jixing; Jiang, Shengming; Chen, Wei

2016-01-01

Due to their special environment, Underwater Wireless Sensor Networks (UWSNs) are usually deployed over a large sea area and the nodes are usually floating. This results in a lower beacon node distribution density, a longer time for localization, and more energy consumption. Currently most of the localization algorithms in this field do not pay enough consideration on the mobility of the nodes. In this paper, by analyzing the mobility patterns of water near the seashore, a localization method for UWSNs based on a Mobility Prediction and a Particle Swarm Optimization algorithm (MP-PSO) is proposed. In this method, the range-based PSO algorithm is used to locate the beacon nodes, and their velocities can be calculated. The velocity of an unknown node is calculated by using the spatial correlation of underwater object’s mobility, and then their locations can be predicted. The range-based PSO algorithm may cause considerable energy consumption and its computation complexity is a little bit high, nevertheless the number of beacon nodes is relatively smaller, so the calculation for the large number of unknown nodes is succinct, and this method can obviously decrease the energy consumption and time cost of localizing these mobile nodes. The simulation results indicate that this method has higher localization accuracy and better localization coverage rate compared with some other widely used localization methods in this field. PMID:26861348

Synchronous wearable wireless body sensor network composed of autonomous textile nodes.

PubMed

Vanveerdeghem, Peter; Van Torre, Patrick; Stevens, Christiaan; Knockaert, Jos; Rogier, Hendrik

2014-10-09

A novel, fully-autonomous, wearable, wireless sensor network is presented, where each flexible textile node performs cooperative synchronous acquisition and distributed event detection. Computationally efficient situational-awareness algorithms are implemented on the low-power microcontroller present on each flexible node. The detected events are wirelessly transmitted to a base station, directly, as well as forwarded by other on-body nodes. For each node, a dual-polarized textile patch antenna serves as a platform for the flexible electronic circuitry. Therefore, the system is particularly suitable for comfortable and unobtrusive integration into garments. In the meantime, polarization diversity can be exploited to improve the reliability and energy-efficiency of the wireless transmission. Extensive experiments in realistic conditions have demonstrated that this new autonomous, body-centric, textile-antenna, wireless sensor network is able to correctly detect different operating conditions of a firefighter during an intervention. By relying on four network nodes integrated into the protective garment, this functionality is implemented locally, on the body, and in real time. In addition, the received sensor data are reliably transferred to a central access point at the command post, for more detailed and more comprehensive real-time visualization. This information provides coordinators and commanders with situational awareness of the entire rescue operation. A statistical analysis of measured on-body node-to-node, as well as off-body person-to-person channels is included, confirming the reliability of the communication system.

Synchronous Wearable Wireless Body Sensor Network Composed of Autonomous Textile Nodes

PubMed Central

Vanveerdeghem, Peter; Van Torre, Patrick; Stevens, Christiaan; Knockaert, Jos; Rogier, Hendrik

2014-01-01

A novel, fully-autonomous, wearable, wireless sensor network is presented, where each flexible textile node performs cooperative synchronous acquisition and distributed event detection. Computationally efficient situational-awareness algorithms are implemented on the low-power microcontroller present on each flexible node. The detected events are wirelessly transmitted to a base station, directly, as well as forwarded by other on-body nodes. For each node, a dual-polarized textile patch antenna serves as a platform for the flexible electronic circuitry. Therefore, the system is particularly suitable for comfortable and unobtrusive integration into garments. In the meantime, polarization diversity can be exploited to improve the reliability and energy-efficiency of the wireless transmission. Extensive experiments in realistic conditions have demonstrated that this new autonomous, body-centric, textile-antenna, wireless sensor network is able to correctly detect different operating conditions of a firefighter during an intervention. By relying on four network nodes integrated into the protective garment, this functionality is implemented locally, on the body, and in real time. In addition, the received sensor data are reliably transferred to a central access point at the command post, for more detailed and more comprehensive real-time visualization. This information provides coordinators and commanders with situational awareness of the entire rescue operation. A statistical analysis of measured on-body node-to-node, as well as off-body person-to-person channels is included, confirming the reliability of the communication system. PMID:25302808

Compression in wearable sensor nodes: impacts of node topology.

PubMed

Imtiaz, Syed Anas; Casson, Alexander J; Rodriguez-Villegas, Esther

2014-04-01

Wearable sensor nodes monitoring the human body must operate autonomously for very long periods of time. Online and low-power data compression embedded within the sensor node is therefore essential to minimize data storage/transmission overheads. This paper presents a low-power MSP430 compressive sensing implementation for providing such compression, focusing particularly on the impact of the sensor node architecture on the compression performance. Compression power performance is compared for four different sensor nodes incorporating different strategies for wireless transmission/on-sensor-node local storage of data. The results demonstrate that the compressive sensing used must be designed differently depending on the underlying node topology, and that the compression strategy should not be guided only by signal processing considerations. We also provide a practical overview of state-of-the-art sensor node topologies. Wireless transmission of data is often preferred as it offers increased flexibility during use, but in general at the cost of increased power consumption. We demonstrate that wireless sensor nodes can highly benefit from the use of compressive sensing and now can achieve power consumptions comparable to, or better than, the use of local memory.

Operational resilience: concepts, design and analysis

NASA Astrophysics Data System (ADS)

Ganin, Alexander A.; Massaro, Emanuele; Gutfraind, Alexander; Steen, Nicolas; Keisler, Jeffrey M.; Kott, Alexander; Mangoubi, Rami; Linkov, Igor

2016-01-01

Building resilience into today’s complex infrastructures is critical to the daily functioning of society and its ability to withstand and recover from natural disasters, epidemics, and cyber-threats. This study proposes quantitative measures that capture and implement the definition of engineering resilience advanced by the National Academy of Sciences. The approach is applicable across physical, information, and social domains. It evaluates the critical functionality, defined as a performance function of time set by the stakeholders. Critical functionality is a source of valuable information, such as the integrated system resilience over a time interval, and its robustness. The paper demonstrates the formulation on two classes of models: 1) multi-level directed acyclic graphs, and 2) interdependent coupled networks. For both models synthetic case studies are used to explore trends. For the first class, the approach is also applied to the Linux operating system. Results indicate that desired resilience and robustness levels are achievable by trading off different design parameters, such as redundancy, node recovery time, and backup supply available. The nonlinear relationship between network parameters and resilience levels confirms the utility of the proposed approach, which is of benefit to analysts and designers of complex systems and networks.

Operational resilience: concepts, design and analysis

PubMed Central

Ganin, Alexander A.; Massaro, Emanuele; Gutfraind, Alexander; Steen, Nicolas; Keisler, Jeffrey M.; Kott, Alexander; Mangoubi, Rami; Linkov, Igor

2016-01-01

Building resilience into today’s complex infrastructures is critical to the daily functioning of society and its ability to withstand and recover from natural disasters, epidemics, and cyber-threats. This study proposes quantitative measures that capture and implement the definition of engineering resilience advanced by the National Academy of Sciences. The approach is applicable across physical, information, and social domains. It evaluates the critical functionality, defined as a performance function of time set by the stakeholders. Critical functionality is a source of valuable information, such as the integrated system resilience over a time interval, and its robustness. The paper demonstrates the formulation on two classes of models: 1) multi-level directed acyclic graphs, and 2) interdependent coupled networks. For both models synthetic case studies are used to explore trends. For the first class, the approach is also applied to the Linux operating system. Results indicate that desired resilience and robustness levels are achievable by trading off different design parameters, such as redundancy, node recovery time, and backup supply available. The nonlinear relationship between network parameters and resilience levels confirms the utility of the proposed approach, which is of benefit to analysts and designers of complex systems and networks. PMID:26782180

Operational resilience: concepts, design and analysis.

PubMed

Ganin, Alexander A; Massaro, Emanuele; Gutfraind, Alexander; Steen, Nicolas; Keisler, Jeffrey M; Kott, Alexander; Mangoubi, Rami; Linkov, Igor

2016-01-19

Building resilience into today's complex infrastructures is critical to the daily functioning of society and its ability to withstand and recover from natural disasters, epidemics, and cyber-threats. This study proposes quantitative measures that capture and implement the definition of engineering resilience advanced by the National Academy of Sciences. The approach is applicable across physical, information, and social domains. It evaluates the critical functionality, defined as a performance function of time set by the stakeholders. Critical functionality is a source of valuable information, such as the integrated system resilience over a time interval, and its robustness. The paper demonstrates the formulation on two classes of models: 1) multi-level directed acyclic graphs, and 2) interdependent coupled networks. For both models synthetic case studies are used to explore trends. For the first class, the approach is also applied to the Linux operating system. Results indicate that desired resilience and robustness levels are achievable by trading off different design parameters, such as redundancy, node recovery time, and backup supply available. The nonlinear relationship between network parameters and resilience levels confirms the utility of the proposed approach, which is of benefit to analysts and designers of complex systems and networks.

Data Access Based on a Guide Map of the Underwater Wireless Sensor Network

PubMed Central

Wei, Zhengxian; Song, Min; Yin, Guisheng; Wang, Hongbin; Cheng, Albert M. K.

2017-01-01

Underwater wireless sensor networks (UWSNs) represent an area of increasing research interest, as data storage, discovery, and query of UWSNs are always challenging issues. In this paper, a data access based on a guide map (DAGM) method is proposed for UWSNs. In DAGM, the metadata describes the abstracts of data content and the storage location. The center ring is composed of nodes according to the shortest average data query path in the network in order to store the metadata, and the data guide map organizes, diffuses and synchronizes the metadata in the center ring, providing the most time-saving and energy-efficient data query service for the user. For this method, firstly the data is stored in the UWSN. The storage node is determined, the data is transmitted from the sensor node (data generation source) to the storage node, and the metadata is generated for it. Then, the metadata is sent to the center ring node that is the nearest to the storage node and the data guide map organizes the metadata, diffusing and synchronizing it to the other center ring nodes. Finally, when there is query data in any user node, the data guide map will select a center ring node nearest to the user to process the query sentence, and based on the shortest transmission delay and lowest energy consumption, data transmission routing is generated according to the storage location abstract in the metadata. Hence, specific application data transmission from the storage node to the user is completed. The simulation results demonstrate that DAGM has advantages with respect to data access time and network energy consumption. PMID:29039757

Detection of breast cancer metastasis in sentinel lymph nodes using intra-operative real time GeneSearch BLN Assay in the operating room: results of the Cardiff study.

PubMed

Mansel, Robert E; Goyal, Amit; Douglas-Jones, Anthony; Woods, Victoria; Goyal, Sumit; Monypenny, Ian; Sweetland, Helen; Newcombe, Robert G; Jasani, Bharat

2009-06-01

Intra-operative assessment is not routinely performed in the UK due to poor sensitivity of available methods and overburdened pathology resources. We conducted a prospective clinical feasibility study of the GeneSearch Breast Lymph Node (BLN) Assay (Veridex, LLC, Warren, NJ) to confirm its potential usefulness within the UK healthcare system. In the assay 50% of the lymph node was processed to detect the presence of cytokeratin-19 and mammaglobin mRNA. The assay was calibrated to detect metastases >0.2 mm. Assay results were compared to H&E performed on each face of approximately 2 mm alternating node slabs and 3 additional sections cut at approximately 150 microm interval from each face of the node slab. 124 sentinel lymph nodes were removed from 82 breast cancer patients. The assay correctly identified all 6 patients with sentinel node macrometastases (>2.0 mm), and 2 of 3 patients with sentinel node micrometastases (0.2-2.0 mm). Sentinel lymph nodes in 4 patients were assay positive but histology negative. Two of these four patients had isolated tumor cells seen by histology. The overall concordance with histology was 93.9% (77/82), with sensitivity of 88.9% (8/9, 95% CI 56.5-98%), specificity of 94.6% (69/73, 95% CI 86.7-97.8%), positive predictive value of 66.7% (8/12, 95% CI 39.1-86.2%) and negative predictive value of 98.6% (69/70, 95% CI 92.3-99.7%). The assay was performed in a median time of 32 min (range 26-69 min). Intra-operative assessment of sentinel lymph node can be performed rapidly and accurately using the GeneSearch BLN Assay.

Data Access Based on a Guide Map of the Underwater Wireless Sensor Network.

PubMed

Wei, Zhengxian; Song, Min; Yin, Guisheng; Song, Houbing; Wang, Hongbin; Ma, Xuefei; Cheng, Albert M K

2017-10-17

Underwater wireless sensor networks (UWSNs) represent an area of increasing research interest, as data storage, discovery, and query of UWSNs are always challenging issues. In this paper, a data access based on a guide map (DAGM) method is proposed for UWSNs. In DAGM, the metadata describes the abstracts of data content and the storage location. The center ring is composed of nodes according to the shortest average data query path in the network in order to store the metadata, and the data guide map organizes, diffuses and synchronizes the metadata in the center ring, providing the most time-saving and energy-efficient data query service for the user. For this method, firstly the data is stored in the UWSN. The storage node is determined, the data is transmitted from the sensor node (data generation source) to the storage node, and the metadata is generated for it. Then, the metadata is sent to the center ring node that is the nearest to the storage node and the data guide map organizes the metadata, diffusing and synchronizing it to the other center ring nodes. Finally, when there is query data in any user node, the data guide map will select a center ring node nearest to the user to process the query sentence, and based on the shortest transmission delay and lowest energy consumption, data transmission routing is generated according to the storage location abstract in the metadata. Hence, specific application data transmission from the storage node to the user is completed. The simulation results demonstrate that DAGM has advantages with respect to data access time and network energy consumption.

An S N Algorithm for Modern Architectures

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baker, Randal Scott

2016-08-29

LANL discrete ordinates transport packages are required to perform large, computationally intensive time-dependent calculations on massively parallel architectures, where even a single such calculation may need many months to complete. While KBA methods scale out well to very large numbers of compute nodes, we are limited by practical constraints on the number of such nodes we can actually apply to any given calculation. Instead, we describe a modified KBA algorithm that allows realization of the reductions in solution time offered by both the current, and future, architectural changes within a compute node.

An Eccentricity Based Data Routing Protocol with Uniform Node Distribution in 3D WSN.

PubMed

Hosen, A S M Sanwar; Cho, Gi Hwan; Ra, In-Ho

2017-09-16

Due to nonuniform node distribution, the energy consumption of nodes are imbalanced in clustering-based wireless sensor networks (WSNs). It might have more impact when nodes are deployed in a three-dimensional (3D) environment. In this regard, we propose the eccentricity based data routing (EDR) protocol in a 3D WSN with uniform node distribution. It includes network partitions called 3D subspaces/clusters of equal member nodes, an energy-efficient routing centroid (RC) nodes election and data routing algorithm. The RC nodes election conducts in a quasi-static nature until a certain period unlike the periodic cluster heads election of typical clustering-based routing. It not only reduces the energy consumption of nodes during the election phase, but also in intra-communication. At the same time, the routing algorithm selects a forwarding node in such a way that balances the energy consumption among RC nodes and reduces the number of hops towards the sink. The simulation results validate and ensure the performance supremacy of the EDR protocol compared to existing protocols in terms of various metrics such as steady state and network lifetime in particular. Meanwhile, the results show the EDR is more robust in uniform node distribution compared to nonuniform.

An Eccentricity Based Data Routing Protocol with Uniform Node Distribution in 3D WSN

PubMed Central

Hosen, A. S. M. Sanwar; Cho, Gi Hwan; Ra, In-Ho

2017-01-01

Due to nonuniform node distribution, the energy consumption of nodes are imbalanced in clustering-based wireless sensor networks (WSNs). It might have more impact when nodes are deployed in a three-dimensional (3D) environment. In this regard, we propose the eccentricity based data routing (EDR) protocol in a 3D WSN with uniform node distribution. It includes network partitions called 3D subspaces/clusters of equal member nodes, an energy-efficient routing centroid (RC) nodes election and data routing algorithm. The RC nodes election conducts in a quasi-static nature until a certain period unlike the periodic cluster heads election of typical clustering-based routing. It not only reduces the energy consumption of nodes during the election phase, but also in intra-communication. At the same time, the routing algorithm selects a forwarding node in such a way that balances the energy consumption among RC nodes and reduces the number of hops towards the sink. The simulation results validate and ensure the performance supremacy of the EDR protocol compared to existing protocols in terms of various metrics such as steady state and network lifetime in particular. Meanwhile, the results show the EDR is more robust in uniform node distribution compared to nonuniform. PMID:28926958

Novel diagnostic procedure for determining metastasis to sentinel lymph nodes in breast cancer using a semi-dry dot-blot method.

PubMed

Otsubo, Ryota; Oikawa, Masahiro; Hirakawa, Hiroshi; Shibata, Kenichiro; Abe, Kuniko; Hayashi, Tomayoshi; Kinoshita, Naoe; Shigematsu, Kazuto; Hatachi, Toshiko; Yano, Hiroshi; Matsumoto, Megumi; Takagi, Katsunori; Tsuchiya, Tomoshi; Tomoshige, Koichi; Nakashima, Masahiro; Taniguchi, Hideki; Omagari, Takeyuki; Itoyanagi, Noriaki; Nagayasu, Takeshi

2014-02-15

We developed an easy, quick and cost-effective detection method for lymph node metastasis called the semi-dry dot-blot (SDB) method, which visualizes the presence of cancer cells with washing of sectioned lymph nodes by anti-pancytokeratin antibody, modifying dot-blot technology. We evaluated the validity and efficacy of the SDB method for the diagnosis of lymph node metastasis in a clinical setting (Trial 1). To evaluate the validity of the SDB method in clinical specimens, 180 dissected lymph nodes from 29 cases, including breast, gastric and colorectal cancer, were examined. Each lymph node was sliced at the maximum diameter and the sensitivity, specificity and accuracy of the SDB method were determined and compared with the final pathology report. Metastasis was detected in 32 lymph nodes (17.8%), and the sensitivity, specificity and accuracy of the SDB method were 100, 98.0 and 98.3%, respectively (Trial 2). To evaluate the efficacy of the SDB method in sentinel lymph node (SLN) biopsy, 174 SLNs from 100 cases of clinically node-negative breast cancer were analyzed. Each SLN was longitudinally sliced at 2-mm intervals and the sensitivity, specificity, accuracy and time required for the SDB method were determined and compared with the intraoperative pathology report. Metastasis was detected in 15 SLNs (8.6%), and the sensitivity, specificity, accuracy and mean required time of the SDB method were 93.3, 96.9, 96.6 and 43.3 min, respectively. The SDB method is a novel and reliable modality for the intraoperative diagnosis of SLN metastasis. © 2013 UICC.

Near infrared imaging to identify sentinel lymph nodes in invasive urinary bladder cancer

NASA Astrophysics Data System (ADS)

Knapp, Deborah W.; Adams, Larry G.; Niles, Jacqueline D.; Lucroy, Michael D.; Ramos-Vara, Jose; Bonney, Patty L.; deGortari, Amalia E.; Frangioni, John V.

2006-02-01

Approximately 12,000 people are diagnosed with invasive transitional cell carcinoma of the urinary bladder (InvTCC) each year in the United States. Surgical removal of the bladder (cystectomy) and regional lymph node dissection are considered frontline therapy. Cystectomy causes extensive acute morbidity, and 50% of patients with InvTCC have occult metastases at the time of diagnosis. Better staging procedures for InvTCC are greatly needed. This study was performed to evaluate an intra-operative near infrared fluorescence imaging (NIRF) system (Frangioni laboratory) for identifying sentinel lymph nodes draining InvTCC. NIRF imaging was used to map lymph node drainage from specific quadrants of the urinary bladder in normal dogs and pigs, and to map lymph node drainage from naturally-occurring InvTCC in pet dogs where the disease closely mimics the human condition. Briefly, during surgery NIR fluorophores (human serum albumen-fluorophore complex, or quantum dots) were injected directly into the bladder wall, and fluorescence observed in lymphatics and regional nodes. Conditions studied to optimize the procedure including: type of fluorophore, depth of injection, volume of fluorophore injected, and degree of bladder distention at the time of injection. Optimal imaging occurred with very superficial injection of the fluorophore in the serosal surface of the moderately distended bladder. Considerable variability was noted from dog to dog in the pattern of lymph node drainage. NIR fluorescence was noted in lymph nodes with metastases in dogs with InvTCC. In conclusion, intra-operative NIRF imaging is a promising approach to improve sentinel lymph node mapping in invasive urinary bladder cancer.

Latency-Efficient Communication in Wireless Mesh Networks under Consideration of Large Interference Range

NASA Astrophysics Data System (ADS)

Xin, Qin; Yao, Xiaolan; Engelstad, Paal E.

2010-09-01

Wireless Mesh Networking is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. We study here the minimum-latency communication primitive of gossiping (all-to-all communication) in multi-hop ad-hoc Wireless Mesh Networks (WMNs). Each mesh node in the WMN is initially given a message and the objective is to design a minimum-latency schedule such that each mesh node distributes its message to all other mesh nodes. Minimum-latency gossiping problem is well known to be NP-hard even for the scenario in which the topology of the WMN is known to all mesh nodes in advance. In this paper, we propose a new latency-efficient approximation scheme that can accomplish gossiping task in polynomial time units in any ad-hoc WMN under consideration of Large Interference Range (LIR), e.g., the interference range is much larger than the transmission range. To the best of our knowledge, it is first time to investigate such a scenario in ad-hoc WMNs under LIR, our algorithm allows the labels (e.g., identifiers) of the mesh nodes to be polynomially large in terms of the size of the WMN, which is the first time that the scenario of large labels has been considered in ad-hoc WMNs under LIR. Furthermore, our gossiping scheme can be considered as a framework which can be easily implied to the scenario under consideration of mobility-related issues since we assume that the mesh nodes have no knowledge on the network topology even for its neighboring mesh nodes.

IJA: an efficient algorithm for query processing in sensor networks.

PubMed

Lee, Hyun Chang; Lee, Young Jae; Lim, Ji Hyang; Kim, Dong Hwa

2011-01-01

One of main features in sensor networks is the function that processes real time state information after gathering needed data from many domains. The component technologies consisting of each node called a sensor node that are including physical sensors, processors, actuators and power have advanced significantly over the last decade. Thanks to the advanced technology, over time sensor networks have been adopted in an all-round industry sensing physical phenomenon. However, sensor nodes in sensor networks are considerably constrained because with their energy and memory resources they have a very limited ability to process any information compared to conventional computer systems. Thus query processing over the nodes should be constrained because of their limitations. Due to the problems, the join operations in sensor networks are typically processed in a distributed manner over a set of nodes and have been studied. By way of example while simple queries, such as select and aggregate queries, in sensor networks have been addressed in the literature, the processing of join queries in sensor networks remains to be investigated. Therefore, in this paper, we propose and describe an Incremental Join Algorithm (IJA) in Sensor Networks to reduce the overhead caused by moving a join pair to the final join node or to minimize the communication cost that is the main consumer of the battery when processing the distributed queries in sensor networks environments. At the same time, the simulation result shows that the proposed IJA algorithm significantly reduces the number of bytes to be moved to join nodes compared to the popular synopsis join algorithm.

IJA: An Efficient Algorithm for Query Processing in Sensor Networks

PubMed Central

Lee, Hyun Chang; Lee, Young Jae; Lim, Ji Hyang; Kim, Dong Hwa

2011-01-01

One of main features in sensor networks is the function that processes real time state information after gathering needed data from many domains. The component technologies consisting of each node called a sensor node that are including physical sensors, processors, actuators and power have advanced significantly over the last decade. Thanks to the advanced technology, over time sensor networks have been adopted in an all-round industry sensing physical phenomenon. However, sensor nodes in sensor networks are considerably constrained because with their energy and memory resources they have a very limited ability to process any information compared to conventional computer systems. Thus query processing over the nodes should be constrained because of their limitations. Due to the problems, the join operations in sensor networks are typically processed in a distributed manner over a set of nodes and have been studied. By way of example while simple queries, such as select and aggregate queries, in sensor networks have been addressed in the literature, the processing of join queries in sensor networks remains to be investigated. Therefore, in this paper, we propose and describe an Incremental Join Algorithm (IJA) in Sensor Networks to reduce the overhead caused by moving a join pair to the final join node or to minimize the communication cost that is the main consumer of the battery when processing the distributed queries in sensor networks environments. At the same time, the simulation result shows that the proposed IJA algorithm significantly reduces the number of bytes to be moved to join nodes compared to the popular synopsis join algorithm. PMID:22319375

Distribution of shortest path lengths in a class of node duplication network models

NASA Astrophysics Data System (ADS)

Steinbock, Chanania; Biham, Ofer; Katzav, Eytan

2017-09-01

We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social networks, acquaintance networks, and scientific citation networks, where duplication mechanisms play a major role. Starting from an initial seed network, at each time step a random node, referred to as a mother node, is selected for duplication. Its daughter node is added to the network, forming a link to the mother node, and with probability p to each one of its neighbors. The degree distribution of the resulting network turns out to follow a power-law distribution, thus the ND network is a scale-free network. To calculate the DSPL we derive a master equation for the time evolution of the probability Pt(L =ℓ ) , ℓ =1 ,2 ,⋯ , where L is the distance between a pair of nodes and t is the time. Finding an exact analytical solution of the master equation, we obtain a closed form expression for Pt(L =ℓ ) . The mean distance 〈L〉 t and the diameter Δt are found to scale like lnt , namely, the ND network is a small-world network. The variance of the DSPL is also found to scale like lnt . Interestingly, the mean distance and the diameter exhibit properties of a small-world network, rather than the ultrasmall-world network behavior observed in other scale-free networks, in which 〈L〉 t˜lnlnt .

Ultra-Low Power Event-Driven Wireless Sensor Node Using Piezoelectric Accelerometer for Health Monitoring

NASA Astrophysics Data System (ADS)

Okada, Hironao; Kobayashi, Takeshi; Masuda, Takashi; Itoh, Toshihiro

2009-07-01

We describe a low power consumption wireless sensor node designed for monitoring the conditions of animals, especially of chickens. The node detects variations in 24-h behavior patterns by acquiring the number of the movement of an animal whose acceleration exceeds a threshold measured in per unit time. Wireless sensor nodes when operated intermittently are likely to miss necessary data during their sleep mode state and waste the power in the case of acquiring useless data. We design the node worked only when required acceleration is detected using a piezoelectric accelerometer and a comparator for wake-up source of micro controller unit.

Lambda network having 2{sup m{minus}1} nodes in each of m stages with each node coupled to four other nodes for bidirectional routing of data packets between nodes

DOEpatents

Napolitano, L.M. Jr.

1995-11-28

The Lambda network is a single stage, packet-switched interprocessor communication network for a distributed memory, parallel processor computer. Its design arises from the desired network characteristics of minimizing mean and maximum packet transfer time, local routing, expandability, deadlock avoidance, and fault tolerance. The network is based on fixed degree nodes and has mean and maximum packet transfer distances where n is the number of processors. The routing method is detailed, as are methods for expandability, deadlock avoidance, and fault tolerance. 14 figs.

Robotic-assisted versus laparoscopic colorectal surgery: a meta-analysis of four randomized controlled trials

PubMed Central

2014-01-01

Background Robotic-assisted laparoscopy is popularly performed for colorectal disease. The objective of this meta-analysis was to compare the safety and efficacy of robotic-assisted colorectal surgery (RCS) and laparoscopic colorectal surgery (LCS) for colorectal disease based on randomized controlled trial studies. Methods Literature searches of electronic databases (Pubmed, Web of Science, and Cochrane Library) were performed to identify randomized controlled trial studies that compared the clinical or oncologic outcomes of RCS and LCS. This meta-analysis was performed using the Review Manager (RevMan) software (version 5.2) that is provided by the Cochrane Collaboration. The data used were mean differences and odds ratios for continuous and dichotomous variables, respectively. Fixed-effects or random-effects models were adopted according to heterogeneity. Results Four randomized controlled trial studies were identified for this meta-analysis. In total, 110 patients underwent RCS, and 116 patients underwent LCS. The results revealed that estimated blood losses (EBLs), conversion rates and times to the recovery of bowel function were significantly reduced following RCS compared with LCS. There were no significant differences in complication rates, lengths of hospital stays, proximal margins, distal margins or harvested lymph nodes between the two techniques. Conclusions RCS is a promising technique and is a safe and effective alternative to LCS for colorectal surgery. The advantages of RCS include reduced EBLs, lower conversion rates and shorter times to the recovery of bowel function. Further studies are required to define the financial effects of RCS and the effects of RCS on long-term oncologic outcomes. PMID:24767102

Dual time point 2-deoxy-2-[18F]fluoro-D-glucose PET/CT: nodal staging in locally advanced breast cancer.

PubMed

García Vicente, A M; Soriano Castrejón, A; Cruz Mora, M Á; Ortega Ruiperez, C; Espinosa Aunión, R; León Martín, A; González Ageitos, A; Van Gómez López, O

2014-01-01

To assess dual time point 2-deoxy-2-[(18)F]fluoro-D-glucose (18)(F)FDG PET-CT accuracy in nodal staging and in detection of extra-axillary involvement. Dual time point [(18)F] FDG PET/CT scan was performed in 75 patients. Visual and semiquantitative assessment of lymph nodes was performed. Semiquantitative measurement of SUV and ROC-analysis were carried out to calculate SUV(max) cut-off value with the best diagnostic performance. Axillary and extra-axillary lymph node chains were evaluated. Sensitivity and specificity of visual assessment was 87.3% and 75%, respectively. SUV(max) values with the best sensitivity were 0.90 and 0.95 for early and delayed PET, respectively. SUV(max) values with the best specificity were 1.95 and 2.75, respectively. Extra-axillary lymph node involvement was detected in 26.7%. FDG PET/CT detected extra-axillary lymph node involvement in one-fourth of the patients. Semiquantitative lymph node analysis did not show any advantage over the visual evaluation. Copyright © 2013 Elsevier España, S.L. and SEMNIM. All rights reserved.

Metropolitan all-pass and inter-city quantum communication network.

PubMed

Chen, Teng-Yun; Wang, Jian; Liang, Hao; Liu, Wei-Yue; Liu, Yang; Jiang, Xiao; Wang, Yuan; Wan, Xu; Cai, Wei-Qi; Ju, Lei; Chen, Luo-Kan; Wang, Liu-Jun; Gao, Yuan; Chen, Kai; Peng, Cheng-Zhi; Chen, Zeng-Bing; Pan, Jian-Wei

2010-12-20

We have demonstrated a metropolitan all-pass quantum communication network in field fiber for four nodes. Any two nodes of them can be connected in the network to perform quantum key distribution (QKD). An optical switching module is presented that enables arbitrary 2-connectivity among output ports. Integrated QKD terminals are worked out, which can operate either as a transmitter, a receiver, or even both at the same time. Furthermore, an additional link in another city of 60 km fiber (up to 130 km) is seamless integrated into this network based on a trusted relay architecture. On all the links, we have implemented protocol of decoy state scheme. All of necessary electrical hardware, synchronization, feedback control, network software, execution of QKD protocols are made by tailored designing, which allow a completely automatical and stable running. Our system has been put into operation in Hefei in August 2009, and publicly demonstrated during an evaluation conference on quantum network organized by the Chinese Academy of Sciences on August 29, 2009. Real-time voice telephone with one-time pad encoding between any two of the five nodes (four all-pass nodes plus one additional node through relay) is successfully established in the network within 60 km.

Unification of small and large time scales for biological evolution: deviations from power law.

PubMed

Chowdhury, Debashish; Stauffer, Dietrich; Kunwar, Ambarish

2003-02-14

We develop a unified model that describes both "micro" and "macro" evolutions within a single theoretical framework. The ecosystem is described as a dynamic network; the population dynamics at each node of this network describes the "microevolution" over ecological time scales (i.e., birth, ageing, and natural death of individual organisms), while the appearance of new nodes, the slow changes of the links, and the disappearance of existing nodes accounts for the "macroevolution" over geological time scales (i.e., the origination, evolution, and extinction of species). In contrast to several earlier claims in the literature, we observe strong deviations from power law in the regime of long lifetimes.

Fixed-time synchronization of complex networks with nonidentical nodes and stochastic noise perturbations

NASA Astrophysics Data System (ADS)

Zhang, Wanli; Li, Chuandong; Huang, Tingwen; Huang, Junjian

2018-02-01

This paper investigates the fixed-time synchronization of complex networks (CNs) with nonidentical nodes and stochastic noise perturbations. By designing new controllers, constructing Lyapunov functions and using the properties of Weiner process, different synchronization criteria are derived according to whether the node systems in the CNs or the goal system satisfies the corresponding conditions. Moreover, the role of the designed controllers is analyzed in great detail by constructing a suitable comparison system and a new method is presented to estimate the settling time by utilizing the comparison system. Results of this paper can be applied to both directed and undirected weighted networks. Numerical simulations are offered to verify the effectiveness of our new results.

Ad Hoc Access Gateway Selection Algorithm

NASA Astrophysics Data System (ADS)

Jie, Liu

With the continuous development of mobile communication technology, Ad Hoc access network has become a hot research, Ad Hoc access network nodes can be used to expand capacity of multi-hop communication range of mobile communication system, even business adjacent to the community, improve edge data rates. For mobile nodes in Ad Hoc network to internet, internet communications in the peer nodes must be achieved through the gateway. Therefore, the key Ad Hoc Access Networks will focus on the discovery gateway, as well as gateway selection in the case of multi-gateway and handover problems between different gateways. This paper considers the mobile node and the gateway, based on the average number of hops from an average access time and the stability of routes, improved gateway selection algorithm were proposed. An improved gateway selection algorithm, which mainly considers the algorithm can improve the access time of Ad Hoc nodes and the continuity of communication between the gateways, were proposed. This can improve the quality of communication across the network.

Improved knowledge diffusion model based on the collaboration hypernetwork

NASA Astrophysics Data System (ADS)

Wang, Jiang-Pan; Guo, Qiang; Yang, Guang-Yong; Liu, Jian-Guo

2015-06-01

The process for absorbing knowledge becomes an essential element for innovation in firms and in adapting to changes in the competitive environment. In this paper, we present an improved knowledge diffusion hypernetwork (IKDH) model based on the idea that knowledge will spread from the target node to all its neighbors in terms of the hyperedge and knowledge stock. We apply the average knowledge stock V(t) , the variable σ2(t) , and the variance coefficient c(t) to evaluate the performance of knowledge diffusion. By analyzing different knowledge diffusion ways, selection ways of the highly knowledgeable nodes, hypernetwork sizes and hypernetwork structures for the performance of knowledge diffusion, results show that the diffusion speed of IKDH model is 3.64 times faster than that of traditional knowledge diffusion (TKDH) model. Besides, it is three times faster to diffuse knowledge by randomly selecting "expert" nodes than that by selecting large-hyperdegree nodes as "expert" nodes. Furthermore, either the closer network structure or smaller network size results in the faster knowledge diffusion.

Analysis of power management and system latency in wireless sensor networks

NASA Astrophysics Data System (ADS)

Oswald, Matthew T.; Rohwer, Judd A.; Forman, Michael A.

2004-08-01

Successful power management in a wireless sensor network requires optimization of the protocols which affect energy-consumption on each node and the aggregate effects across the larger network. System optimization for a given deployment scenario requires an analysis and trade off of desired node and network features with their associated costs. The sleep protocol for an energy-efficient wireless sensor network for event detection, target classification, and target tracking developed at Sandia National Laboratories is presented. The dynamic source routing (DSR) algorithm is chosen to reduce network maintenance overhead, while providing a self-configuring and self-healing network architecture. A method for determining the optimal sleep time is developed and presented, providing reference data which spans several orders of magnitude. Message timing diagrams show, that a node in a five-node cluster, employing an optimal cyclic single-radio sleep protocol, consumes 3% more energy and incurs a 16-s increase latency than nodes employing the more complex dual-radio STEM protocol.

Dynamic node immunization for restraint of harmful information diffusion in social networks

NASA Astrophysics Data System (ADS)

Yang, Dingda; Liao, Xiangwen; Shen, Huawei; Cheng, Xueqi; Chen, Guolong

2018-08-01

To restrain the spread of harmful information is crucial for the healthy and sustainable development of social networks. We address the problem of restraining the spread of harmful information by immunizing nodes in the networks. Previous works have developed methods based on the network topology or studied how to immunize nodes in the presence of initial infected nodes. These static methods, in which nodes are immunized at once, may have poor performance in the certain situation due to the dynamics of diffusion. To tackle this problem, we introduce a new dynamic immunization problem of immunizing nodes during the process of the diffusion in this paper. We formulate the problem and propose a novel heuristic algorithm by dealing with two sub-problems: (1) how to select a node to achieve the best immunization effect at the present time? (2) whether the selected node should be immunized right now? Finally, we demonstrate the effectiveness of our algorithm through extensive experiments on various real datasets.

Efficiently sphere-decodable physical layer transmission schemes for wireless storage networks

NASA Astrophysics Data System (ADS)

Lu, Hsiao-Feng Francis; Barreal, Amaro; Karpuk, David; Hollanti, Camilla

2016-12-01

Three transmission schemes over a new type of multiple-access channel (MAC) model with inter-source communication links are proposed and investigated in this paper. This new channel model is well motivated by, e.g., wireless distributed storage networks, where communication to repair a lost node takes place from helper nodes to a repairing node over a wireless channel. Since in many wireless networks nodes can come and go in an arbitrary manner, there must be an inherent capability of inter-node communication between every pair of nodes. Assuming that communication is possible between every pair of helper nodes, the newly proposed schemes are based on various smart time-sharing and relaying strategies. In other words, certain helper nodes will be regarded as relays, thereby converting the conventional uncooperative multiple-access channel to a multiple-access relay channel (MARC). The diversity-multiplexing gain tradeoff (DMT) of the system together with efficient sphere-decodability and low structural complexity in terms of the number of antennas required at each end is used as the main design objectives. While the optimal DMT for the new channel model is fully open, it is shown that the proposed schemes outperform the DMT of the simple time-sharing protocol and, in some cases, even the optimal uncooperative MAC DMT. While using a wireless distributed storage network as a motivating example throughout the paper, the MAC transmission techniques proposed here are completely general and as such applicable to any MAC communication with inter-source communication links.

Using Trust to Establish a Secure Routing Model in Cognitive Radio Network.

PubMed

Zhang, Guanghua; Chen, Zhenguo; Tian, Liqin; Zhang, Dongwen

2015-01-01

Specific to the selective forwarding attack on routing in cognitive radio network, this paper proposes a trust-based secure routing model. Through monitoring nodes' forwarding behaviors, trusts of nodes are constructed to identify malicious nodes. In consideration of that routing selection-based model must be closely collaborative with spectrum allocation, a route request piggybacking available spectrum opportunities is sent to non-malicious nodes. In the routing decision phase, nodes' trusts are used to construct available path trusts and delay measurement is combined for making routing decisions. At the same time, according to the trust classification, different responses are made specific to their service requests. By adopting stricter punishment on malicious behaviors from non-trusted nodes, the cooperation of nodes in routing can be stimulated. Simulation results and analysis indicate that this model has good performance in network throughput and end-to-end delay under the selective forwarding attack.

Nodes packaging option for Space Station application

NASA Technical Reports Server (NTRS)

So, Kenneth T.; Hall, John B., Jr.

1988-01-01

Space Station nodes packaging analyses are presented relative to moving environmental control and life support system (ECLSS) equipment from the habitability (HAB) module to node 4, in order to provide more living space and privacy for the crew, remove inherently noisy equipment from the crew quarter, retain crew waste collection and processing equipment in one location, and keep objectionable odor away from the living quarters. In addition, options for moving external electronic equipment from the Space Station truss to pressurized node 3 were evaluated in order to reduce the crew extravehicular-activity time required to install and maintain the equipment. Node size considered in this analysis is 3.66 m in diameter and 5.38 m long. The analysis shows that significant external electronic equipment could be relocated from the Space Station truss structure to node 3, and nonlife critical ECLSS HAB module equipment could be moved to node 4.

Internode data communications in a parallel computer

DOEpatents

Archer, Charles J.; Blocksome, Michael A.; Miller, Douglas R.; Parker, Jeffrey J.; Ratterman, Joseph D.; Smith, Brian E.

2013-09-03

Internode data communications in a parallel computer that includes compute nodes that each include main memory and a messaging unit, the messaging unit including computer memory and coupling compute nodes for data communications, in which, for each compute node at compute node boot time: a messaging unit allocates, in the messaging unit's computer memory, a predefined number of message buffers, each message buffer associated with a process to be initialized on the compute node; receives, prior to initialization of a particular process on the compute node, a data communications message intended for the particular process; and stores the data communications message in the message buffer associated with the particular process. Upon initialization of the particular process, the process establishes a messaging buffer in main memory of the compute node and copies the data communications message from the message buffer of the messaging unit into the message buffer of main memory.

Internode data communications in a parallel computer

DOEpatents

Archer, Charles J; Blocksome, Michael A; Miller, Douglas R; Parker, Jeffrey J; Ratterman, Joseph D; Smith, Brian E

2014-02-11

Internode data communications in a parallel computer that includes compute nodes that each include main memory and a messaging unit, the messaging unit including computer memory and coupling compute nodes for data communications, in which, for each compute node at compute node boot time: a messaging unit allocates, in the messaging unit's computer memory, a predefined number of message buffers, each message buffer associated with a process to be initialized on the compute node; receives, prior to initialization of a particular process on the compute node, a data communications message intended for the particular process; and stores the data communications message in the message buffer associated with the particular process. Upon initialization of the particular process, the process establishes a messaging buffer in main memory of the compute node and copies the data communications message from the message buffer of the messaging unit into the message buffer of main memory.

A Time Tree Medium Access Control for Energy Efficiency and Collision Avoidance in Wireless Sensor Networks

PubMed Central

Lee, Kilhung

2010-01-01

This paper presents a medium access control and scheduling scheme for wireless sensor networks. It uses time trees for sending data from the sensor node to the base station. For an energy efficient operation of the sensor networks in a distributed manner, time trees are built in order to reduce the collision probability and to minimize the total energy required to send data to the base station. A time tree is a data gathering tree where the base station is the root and each sensor node is either a relaying or a leaf node of the tree. Each tree operates in a different time schedule with possibly different activation rates. Through the simulation, the proposed scheme that uses time trees shows better characteristics toward burst traffic than the previous energy and data arrival rate scheme. PMID:22319270

Improved Survival in Male Melanoma Patients in the Era of Sentinel Node Biopsy.

PubMed

Koskivuo, I; Vihinen, P; Mäki, M; Talve, L; Vahlberg, T; Suominen, E

2017-03-01

Sentinel node biopsy is a standard method for nodal staging in patients with clinically localized cutaneous melanoma, but the survival advantage of sentinel node biopsy remains unsolved. The aim of this case-control study was to investigate the survival benefit of sentinel node biopsy. A total of 305 prospective melanoma patients undergoing sentinel node biopsy were compared with 616 retrospective control patients with clinically localized melanoma whom have not undergone sentinel node biopsy. Survival differences were calculated with the median follow-up time of 71 months in sentinel node biopsy patients and 74 months in control patients. Analyses were calculated overall and separately in males and females. Overall, there were no differences in relapse-free survival or cancer-specific survival between sentinel node biopsy patients and control patients. Male sentinel node biopsy patients had significantly higher relapse-free survival ( P = 0.021) and cancer-specific survival ( P = 0.024) than control patients. In females, no differences were found. Cancer-specific survival rates at 5 years were 87.8% in sentinel node biopsy patients and 85.2% in controls overall with 88.3% in male sentinel node biopsy patients and 80.6% in male controls and 87.3% in female sentinel node biopsy patients and 89.8% in female controls. Sentinel node biopsy did not improve survival in melanoma patients overall. While females had no differences in survival, males had significantly improved relapse-free survival and cancer-specific survival following sentinel node biopsy.

Automatic identification of IASLC-defined mediastinal lymph node stations on CT scans using multi-atlas organ segmentation

NASA Astrophysics Data System (ADS)

Hoffman, Joanne; Liu, Jiamin; Turkbey, Evrim; Kim, Lauren; Summers, Ronald M.

2015-03-01

Station-labeling of mediastinal lymph nodes is typically performed to identify the location of enlarged nodes for cancer staging. Stations are usually assigned in clinical radiology practice manually by qualitative visual assessment on CT scans, which is time consuming and highly variable. In this paper, we developed a method that automatically recognizes the lymph node stations in thoracic CT scans based on the anatomical organs in the mediastinum. First, the trachea, lungs, and spines are automatically segmented to locate the mediastinum region. Then, eight more anatomical organs are simultaneously identified by multi-atlas segmentation. Finally, with the segmentation of those anatomical organs, we convert the text definitions of the International Association for the Study of Lung Cancer (IASLC) lymph node map into patient-specific color-coded CT image maps. Thus, a lymph node station is automatically assigned to each lymph node. We applied this system to CT scans of 86 patients with 336 mediastinal lymph nodes measuring equal or greater than 10 mm. 84.8% of mediastinal lymph nodes were correctly mapped to their stations.

An Extension of the Time-Spectral Method to Overset Solvers

NASA Technical Reports Server (NTRS)

Leffell, Joshua Isaac; Murman, Scott M.; Pulliam, Thomas

2013-01-01

Relative motion in the Cartesian or overset framework causes certain spatial nodes to move in and out of the physical domain as they are dynamically blanked by moving solid bodies. This poses a problem for the conventional Time-Spectral approach, which expands the solution at every spatial node into a Fourier series spanning the period of motion. The proposed extension to the Time-Spectral method treats unblanked nodes in the conventional manner but expands the solution at dynamically blanked nodes in a basis of barycentric rational polynomials spanning partitions of contiguously defined temporal intervals. Rational polynomials avoid Runge's phenomenon on the equidistant time samples of these sub-periodic intervals. Fourier- and rational polynomial-based differentiation operators are used in tandem to provide a consistent hybrid Time-Spectral overset scheme capable of handling relative motion. The hybrid scheme is tested with a linear model problem and implemented within NASA's OVERFLOW Reynolds-averaged Navier- Stokes (RANS) solver. The hybrid Time-Spectral solver is then applied to inviscid and turbulent RANS cases of plunging and pitching airfoils and compared to time-accurate and experimental data. A limiter was applied in the turbulent case to avoid undershoots in the undamped turbulent eddy viscosity while maintaining accuracy. The hybrid scheme matches the performance of the conventional Time-Spectral method and converges to the time-accurate results with increased temporal resolution.

Multiple Time Series Node Synchronization Utilizing Ambient Reference

DTIC Science & Technology

2014-12-31

assessment, is the need for fine scale synchronization among communicating nodes and across multiple domains. The severe requirements that Special...processing targeted to performance assessment, is the need for fine scale synchronization among communicating nodes and across multiple domains. The...research community and it is well documented and characterized. The datasets considered from this project (listed below) were used to derive the

Fine-Grained Parcellation of Brain Connectivity Improves Differentiation of States of Consciousness During Graded Propofol Sedation.

PubMed

Liu, Xiaolin; Lauer, Kathryn K; Ward, B Douglas; Roberts, Christopher J; Liu, Suyan; Gollapudy, Suneeta; Rohloff, Robert; Gross, William; Xu, Zhan; Chen, Guangyu; Binder, Jeffrey R; Li, Shi-Jiang; Hudetz, Anthony G

2017-08-01

Conscious perception relies on interactions between spatially and functionally distinct modules of the brain at various spatiotemporal scales. These interactions are altered by anesthesia, an intervention that leads to fading consciousness. Relatively little is known about brain functional connectivity and its anesthetic modulation at a fine spatial scale. Here, we used functional imaging to examine propofol-induced changes in functional connectivity in brain networks defined at a fine-grained parcellation based on a combination of anatomical and functional features. Fifteen healthy volunteers underwent resting-state functional imaging in wakeful baseline, mild sedation, deep sedation, and recovery of consciousness. Compared with wakeful baseline, propofol produced widespread, dose-dependent functional connectivity changes that scaled with the extent to which consciousness was altered. The dominant changes in connectivity were associated with the frontal lobes. By examining node pairs that demonstrated a trend of functional connectivity change between wakefulness and deep sedation, quadratic discriminant analysis differentiated the states of consciousness in individual participants more accurately at a fine-grained parcellation (e.g., 2000 nodes) than at a coarse-grained parcellation (e.g., 116 anatomical nodes). Our study suggests that defining brain networks at a high granularity may provide a superior imaging-based distinction of the graded effect of anesthesia on consciousness.

Permanent pacemaker implantation in octogenarians with unexplained syncope and positive electrophysiologic testing.

PubMed

Giannopoulos, Georgios; Kossyvakis, Charalampos; Panagopoulou, Vasiliki; Tsiachris, Dimitrios; Doudoumis, Konstantinos; Mavri, Maria; Vrachatis, Dimitrios; Letsas, Konstantinos; Efremidis, Michael; Katsivas, Apostolos; Lekakis, John; Deftereos, Spyridon

2017-05-01

Syncope is a common problem in the elderly, and a permanent pacemaker is a therapeutic option when a bradycardic etiology is revealed. However, the benefit of pacing when no association of symptoms to bradycardia has been shown is not clear, especially in the elderly. The aim of this study was to evaluate the effect of pacing on syncope-free mortality in patients aged 80 years or older with unexplained syncope and "positive" invasive electrophysiologic testing (EPT). This was an observational study. A positive EPT for the purposes of this study was defined by at least 1 of the following: a corrected sinus node recovery time of >525 ms, a basic HV interval of >55 ms, detection of infra-Hisian block, or appearance of second-degree atrioventricular block on atrial decremental pacing at a paced cycle length of >400 ms. Among the 2435 screened patients, 228 eligible patients were identified, 145 of whom were implanted with a pacemaker. Kaplan-Meier analysis determined that time to event (syncope or death) was 50.1 months (95% confidence interval 45.4-54.8 months) with a pacemaker vs 37.8 months (95% confidence interval 31.3-44.4 months) without a pacemaker (log-rank test, P = .001). The 4-year time-dependent estimate of the rate of syncope was 12% vs 44% (P < .001) and that of any-cause death was 41% vs 56% (P = .023), respectively. The multivariable odds ratio was 0.25 (95% confidence interval 0.15-0.40) after adjustment for potential confounders. In patients with unexplained syncope and signs of sinus node dysfunction or impaired atrioventricular conduction on invasive EPT, pacemaker implantation was independently associated with longer syncope-free survival. Significant differences were also shown in the individual components of the primary outcome measure (syncope and death from any cause). Copyright © 2017 Heart Rhythm Society. Published by Elsevier Inc. All rights reserved.

Reducing WBC background in cancer cell separation products by negative acoustic contrast particle immuno-acoustophoresis.

PubMed

Cushing, Kevin; Undvall, Eva; Ceder, Yvonne; Lilja, Hans; Laurell, Thomas

2018-02-13

Cancer cells display acoustic properties enabling acoustophoretic separation from white blood cells (WBCs) with 2-3 log suppression of the WBC background. However, a subset of WBCs has overlapping acoustic properties with cancer cells, which is why label-free acoustophoretic cancer cell isolation needs additional purification prior to analysis. This paper reports for the first time a proof of concept for continuous flow acoustophoretic negative selection of WBCs from cancer cells using negative acoustic contrast elastomeric particles (EPs) activated with CD45-antibodies that specifically bind to WBCs. The EP/WBC complexes align at the acoustic pressure anti-nodes along the channel walls while unbound cancer cells focus to the pressure node in the channel center, enabling continuous flow based depletion of WBC background in a cancer cell product. The method does not provide a single process solution for the CTC separation challenge, but provides an elegant part to a multi-step process by further reducing the WBC background in cancer cell separation products derived from an initial step of label-free acoustophoresis. We report the recorded performance of the negative selection immuno-acoustophoretic WBC depletion and cancer cell recovery. To eliminate the negative impact of the separation due to the known problems of aggregation of negative acoustic contrast particles along the sidewalls of the acoustophoresis channel and to enable continuous separation of EP/WBC complexes from cancer cells, a new acoustic actuation method has been implemented where the ultrasound frequency is scanned (1.991MHz ± 100 kHz, scan rate 200 kHz ms -1 ). Using this frequency scanning strategy EP/WBC complexes were acoustophoretically separated from mixtures of WBCs spiked with breast and prostate cancer cells (DU145 and MCF-7). An 86-fold (MCF-7) and 52-fold (DU145) reduction of WBCs in the cancer cell fractions were recorded with separation efficiencies of 98.6% (MCF-7) and 99.7% (DU145) and cancer cell recoveries of 89.8% (MCF-7) and 85.0% (DU145). Copyright © 2017 Elsevier B.V. All rights reserved.

Sentinel lymph node detection in patients with endometrial cancer.

PubMed

Niikura, Hitoshi; Okamura, Chikako; Utsunomiya, Hiroki; Yoshinaga, Kosuke; Akahira, Junichi; Ito, Kiyoshi; Yaegashi, Nobuo

2004-02-01

The purpose of this study was to examine the feasibility of sentinel lymph node (SLN) detection in patients with endometrial cancer using preoperative lymphoscintigraphy and an intraoperative gamma probe. Between June 2001 and January 2003, 28 consecutive patients with endometrial cancer who were scheduled for total abdominal hysterectomy, bilateral salpingo-oophorectomy, total pelvic lymphadenectomy, and paraaortic lymphadenectomy at Tohoku University School of Medicine underwent sentinel lymph node detection. On the day before surgery, preoperative lymphoscintigraphy was performed by injection of 99m-Technetium ((99m)Tc)-labeled phytate into the endometrium during hysteroscopy. At the time of surgery, a gamma-detecting probe was used to locate radioactive lymph nodes. At least one sentinel node was detected in each of 23 of the 28 patients (82%). The mean number of sentinel nodes detected was 3.1 (range, 1-9). Sentinel nodes could be identified in 21 of 22 patients (95%) whose tumor did not invade more than halfway into the myometrium. Eighteen patients had radioactive nodes in the paraaortic area. Most patients had a sentinel node in one of the following three sites: paraaortic, external iliac, and obturator. The sensitivity and specificity for detecting lymph node metastases were both 100%. The combination of preoperative lymphoscintigraphy with intraoperative gamma probe detection may be useful in identifying sentinel nodes in early-stage endometrial cancer.

Concurrent hypercube system with improved message passing

NASA Technical Reports Server (NTRS)

Peterson, John C. (Inventor); Tuazon, Jesus O. (Inventor); Lieberman, Don (Inventor); Pniel, Moshe (Inventor)

1989-01-01

A network of microprocessors, or nodes, are interconnected in an n-dimensional cube having bidirectional communication links along the edges of the n-dimensional cube. Each node's processor network includes an I/O subprocessor dedicated to controlling communication of message packets along a bidirectional communication link with each end thereof terminating at an I/O controlled transceiver. Transmit data lines are directly connected from a local FIFO through each node's communication link transceiver. Status and control signals from the neighboring nodes are delivered over supervisory lines to inform the local node that the neighbor node's FIFO is empty and the bidirectional link between the two nodes is idle for data communication. A clocking line between neighbors, clocks a message into an empty FIFO at a neighbor's node and vica versa. Either neighbor may acquire control over the bidirectional communication link at any time, and thus each node has circuitry for checking whether or not the communication link is busy or idle, and whether or not the receive FIFO is empty. Likewise, each node can empty its own FIFO and in turn deliver a status signal to a neighboring node indicating that the local FIFO is empty. The system includes features of automatic message rerouting, block message transfer and automatic parity checking and generation.

An Autonomous Connectivity Restoration Algorithm Based on Finite State Machine for Wireless Sensor-Actor Networks.

PubMed

Zhang, Ying; Wang, Jun; Hao, Guan

2018-01-08

With the development of autonomous unmanned intelligent systems, such as the unmanned boats, unmanned planes and autonomous underwater vehicles, studies on Wireless Sensor-Actor Networks (WSANs) have attracted more attention. Network connectivity algorithms play an important role in data exchange, collaborative detection and information fusion. Due to the harsh application environment, abnormal nodes often appear, and the network connectivity will be prone to be lost. Network self-healing mechanisms have become critical for these systems. In order to decrease the movement overhead of the sensor-actor nodes, an autonomous connectivity restoration algorithm based on finite state machine is proposed. The idea is to identify whether a node is a critical node by using a finite state machine, and update the connected dominating set in a timely way. If an abnormal node is a critical node, the nearest non-critical node will be relocated to replace the abnormal node. In the case of multiple node abnormality, a regional network restoration algorithm is introduced. It is designed to reduce the overhead of node movements while restoration happens. Simulation results indicate the proposed algorithm has better performance on the total moving distance and the number of total relocated nodes compared with some other representative restoration algorithms.

An Autonomous Connectivity Restoration Algorithm Based on Finite State Machine for Wireless Sensor-Actor Networks

PubMed Central

Zhang, Ying; Wang, Jun; Hao, Guan

2018-01-01

With the development of autonomous unmanned intelligent systems, such as the unmanned boats, unmanned planes and autonomous underwater vehicles, studies on Wireless Sensor-Actor Networks (WSANs) have attracted more attention. Network connectivity algorithms play an important role in data exchange, collaborative detection and information fusion. Due to the harsh application environment, abnormal nodes often appear, and the network connectivity will be prone to be lost. Network self-healing mechanisms have become critical for these systems. In order to decrease the movement overhead of the sensor-actor nodes, an autonomous connectivity restoration algorithm based on finite state machine is proposed. The idea is to identify whether a node is a critical node by using a finite state machine, and update the connected dominating set in a timely way. If an abnormal node is a critical node, the nearest non-critical node will be relocated to replace the abnormal node. In the case of multiple node abnormality, a regional network restoration algorithm is introduced. It is designed to reduce the overhead of node movements while restoration happens. Simulation results indicate the proposed algorithm has better performance on the total moving distance and the number of total relocated nodes compared with some other representative restoration algorithms. PMID:29316702

Dynamic actin filaments control the mechanical behavior of the human red blood cell membrane

PubMed Central

Gokhin, David S.; Nowak, Roberta B.; Khoory, Joseph A.; de la Piedra, Alfonso; Ghiran, Ionita C.; Fowler, Velia M.

2015-01-01

Short, uniform-length actin filaments function as structural nodes in the spectrin-actin membrane skeleton to optimize the biomechanical properties of red blood cells (RBCs). Despite the widespread assumption that RBC actin filaments are not dynamic (i.e., do not exchange subunits with G-actin in the cytosol), this assumption has never been rigorously tested. Here we show that a subpopulation of human RBC actin filaments is indeed dynamic, based on rhodamine-actin incorporation into filaments in resealed ghosts and fluorescence recovery after photobleaching (FRAP) analysis of actin filament mobility in intact RBCs (∼25–30% of total filaments). Cytochalasin-D inhibition of barbed-end exchange reduces rhodamine-actin incorporation and partially attenuates FRAP recovery, indicating functional interaction between actin subunit turnover at the single-filament level and mobility at the membrane-skeleton level. Moreover, perturbation of RBC actin filament assembly/disassembly with latrunculin-A or jasplakinolide induces an approximately twofold increase or ∼60% decrease, respectively, in soluble actin, resulting in altered membrane deformability, as determined by alterations in RBC transit time in a microfluidic channel assay, as well as by abnormalities in spontaneous membrane oscillations (flickering). These experiments identify a heretofore-unrecognized but functionally important subpopulation of RBC actin filaments, whose properties and architecture directly control the biomechanical properties of the RBC membrane. PMID:25717184

Water Distribution Analysis and Optimization (WADISO). User’s Guide and Documentation. Chapter 28, Parts 1 and 2, Change 6.

DTIC Science & Technology

1987-07-01

the initial tank water level in feet. If any fires were specified, TIMEOT prints the node number supplying the fire flow, NFIRE ; the starting time step...0 0 LPT Array 1 22 10 11 0.100000000E+04 NF, NFIRE , ITF, IDF. FF 3 25 0.130000000E+03 0.800000000E+02 0.20000000000E+04 0.1100000000E+03 NTN; UPL...of input error. ERROR NF RETIME Number of fires in system. STOTIM NFIRE (5) /TIME/ User node supplying fire flow. NFIRE (1)=6 indicates user node 6 is

Non-preconditioned conjugate gradient on cell and FPGA based hybrid supercomputer nodes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dubois, David H; Dubois, Andrew J; Boorman, Thomas M

2009-01-01

This work presents a detailed implementation of a double precision, non-preconditioned, Conjugate Gradient algorithm on a Roadrunner heterogeneous supercomputer node. These nodes utilize the Cell Broadband Engine Architecture{sup TM} in conjunction with x86 Opteron{sup TM} processors from AMD. We implement a common Conjugate Gradient algorithm, on a variety of systems, to compare and contrast performance. Implementation results are presented for the Roadrunner hybrid supercomputer, SRC Computers, Inc. MAPStation SRC-6 FPGA enhanced hybrid supercomputer, and AMD Opteron only. In all hybrid implementations wall clock time is measured, including all transfer overhead and compute timings.

Non-preconditioned conjugate gradient on cell and FPCA-based hybrid supercomputer nodes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dubois, David H; Dubois, Andrew J; Boorman, Thomas M

2009-03-10

This work presents a detailed implementation of a double precision, Non-Preconditioned, Conjugate Gradient algorithm on a Roadrunner heterogeneous supercomputer node. These nodes utilize the Cell Broadband Engine Architecture{trademark} in conjunction with x86 Opteron{trademark} processors from AMD. We implement a common Conjugate Gradient algorithm, on a variety of systems, to compare and contrast performance. Implementation results are presented for the Roadrunner hybrid supercomputer, SRC Computers, Inc. MAPStation SRC-6 FPGA enhanced hybrid supercomputer, and AMD Opteron only. In all hybrid implementations wall clock time is measured, including all transfer overhead and compute timings.

Tool wear modeling using abductive networks

NASA Astrophysics Data System (ADS)

Masory, Oren

1992-09-01

A tool wear model based on Abductive Networks, which consists of a network of `polynomial' nodes, is described. The model relates the cutting parameters, components of the cutting force, and machining time to flank wear. Thus real time measurements of the cutting force can be used to monitor the machining process. The model is obtained by a training process in which the connectivity between the network's nodes and the polynomial coefficients of each node are determined by optimizing a performance criteria. Actual wear measurements of coated and uncoated carbide inserts were used for training and evaluating the established model.

C-fuzzy variable-branch decision tree with storage and classification error rate constraints

NASA Astrophysics Data System (ADS)

Yang, Shiueng-Bien

2009-10-01

The C-fuzzy decision tree (CFDT), which is based on the fuzzy C-means algorithm, has recently been proposed. The CFDT is grown by selecting the nodes to be split according to its classification error rate. However, the CFDT design does not consider the classification time taken to classify the input vector. Thus, the CFDT can be improved. We propose a new C-fuzzy variable-branch decision tree (CFVBDT) with storage and classification error rate constraints. The design of the CFVBDT consists of two phases-growing and pruning. The CFVBDT is grown by selecting the nodes to be split according to the classification error rate and the classification time in the decision tree. Additionally, the pruning method selects the nodes to prune based on the storage requirement and the classification time of the CFVBDT. Furthermore, the number of branches of each internal node is variable in the CFVBDT. Experimental results indicate that the proposed CFVBDT outperforms the CFDT and other methods.

Channel and Timeslot Co-Scheduling with Minimal Channel Switching for Data Aggregation in MWSNs

PubMed Central

Yeoum, Sanggil; Kang, Byungseok; Lee, Jinkyu; Choo, Hyunseung

2017-01-01

Collision-free transmission and efficient data transfer between nodes can be achieved through a set of channels in multichannel wireless sensor networks (MWSNs). While using multiple channels, we have to carefully consider channel interference, channel and time slot (resources) optimization, channel switching delay, and energy consumption. Since sensor nodes operate on low battery power, the energy consumed in channel switching becomes an important challenge. In this paper, we propose channel and time slot scheduling for minimal channel switching in MWSNs, while achieving efficient and collision-free transmission between nodes. The proposed scheme constructs a duty-cycled tree while reducing the amount of channel switching. As a next step, collision-free time slots are assigned to every node based on the minimal data collection delay. The experimental results demonstrate that the validity of our scheme reduces the amount of channel switching by 17.5%, reduces energy consumption for channel switching by 28%, and reduces the schedule length by 46%, as compared to the existing schemes. PMID:28471416

A monitoring system for vegetable greenhouses based on a wireless sensor network.

PubMed

Li, Xiu-hong; Cheng, Xiao; Yan, Ke; Gong, Peng

2010-01-01

A wireless sensor network-based automatic monitoring system is designed for monitoring the life conditions of greenhouse vegetables. The complete system architecture includes a group of sensor nodes, a base station, and an internet data center. For the design of wireless sensor node, the JN5139 micro-processor is adopted as the core component and the Zigbee protocol is used for wireless communication between nodes. With an ARM7 microprocessor and embedded ZKOS operating system, a proprietary gateway node is developed to achieve data influx, screen display, system configuration and GPRS based remote data forwarding. Through a Client/Server mode the management software for remote data center achieves real-time data distribution and time-series analysis. Besides, a GSM-short-message-based interface is developed for sending real-time environmental measurements, and for alarming when a measurement is beyond some pre-defined threshold. The whole system has been tested for over one year and satisfactory results have been observed, which indicate that this system is very useful for greenhouse environment monitoring.

Channel and Timeslot Co-Scheduling with Minimal Channel Switching for Data Aggregation in MWSNs.

PubMed

Yeoum, Sanggil; Kang, Byungseok; Lee, Jinkyu; Choo, Hyunseung

2017-05-04

Collision-free transmission and efficient data transfer between nodes can be achieved through a set of channels in multichannel wireless sensor networks (MWSNs). While using multiple channels, we have to carefully consider channel interference, channel and time slot (resources) optimization, channel switching delay, and energy consumption. Since sensor nodes operate on low battery power, the energy consumed in channel switching becomes an important challenge. In this paper, we propose channel and time slot scheduling for minimal channel switching in MWSNs, while achieving efficient and collision-free transmission between nodes. The proposed scheme constructs a duty-cycled tree while reducing the amount of channel switching. As a next step, collision-free time slots are assigned to every node based on the minimal data collection delay. The experimental results demonstrate that the validity of our scheme reduces the amount of channel switching by 17.5%, reduces energy consumption for channel switching by 28%, and reduces the schedule length by 46%, as compared to the existing schemes.

High-frequency Ultrasound Imaging of Mouse Cervical Lymph Nodes.

PubMed

Walk, Elyse L; McLaughlin, Sarah L; Weed, Scott A

2015-07-25

High-frequency ultrasound (HFUS) is widely employed as a non-invasive method for imaging internal anatomic structures in experimental small animal systems. HFUS has the ability to detect structures as small as 30 µm, a property that has been utilized for visualizing superficial lymph nodes in rodents in brightness (B)-mode. Combining power Doppler with B-mode imaging allows for measuring circulatory blood flow within lymph nodes and other organs. While HFUS has been utilized for lymph node imaging in a number of mouse  model systems, a detailed protocol describing HFUS imaging and characterization of the cervical lymph nodes in mice has not been reported. Here, we show that HFUS can be adapted to detect and characterize cervical lymph nodes in mice. Combined B-mode and power Doppler imaging can be used to detect increases in blood flow in immunologically-enlarged cervical nodes. We also describe the use of B-mode imaging to conduct fine needle biopsies of cervical lymph nodes to retrieve lymph tissue for histological  analysis. Finally, software-aided steps are described to calculate changes in lymph node volume and to visualize changes in lymph node morphology following image reconstruction. The ability to visually monitor changes in cervical lymph node biology over time provides a simple and powerful technique for the non-invasive monitoring of cervical lymph node alterations in preclinical mouse models of oral cavity disease.

Voter model with arbitrary degree dependence: clout, confidence and irreversibility

NASA Astrophysics Data System (ADS)

Fotouhi, Babak; Rabbat, Michael G.

2014-03-01

The voter model is widely used to model opinion dynamics in society. In this paper, we propose three modifications to incorporate heterogeneity into the model. We address the corresponding oversimplifications of the conventional voter model which are unrealistic. We first consider the voter model with popularity bias. The influence of each node on its neighbors depends on its degree. We find the consensus probabilities and expected consensus times for each of the states. We also find the fixation probability, which is the probability that a single node whose state differs from every other node imposes its state on the entire system. In addition, we find the expected fixation time. Then two other extensions to the model are proposed and the motivations behind them are discussed. The first one is confidence, where in addition to the states of neighbors, nodes take their own state into account at each update. We repeat the calculations for the augmented model and investigate the effects of adding confidence to the model. The second proposed extension is irreversibility, where one of the states is given the property that once nodes adopt it, they cannot switch back. This is motivated by applications where, agents take an irreversible action such as seeing a movie, purchasing a music album online, or buying a new product. The dynamics of densities, fixation times and consensus times are obtained.

LPTA: Location Predictive and Time Adaptive Data Gathering Scheme with Mobile Sink for Wireless Sensor Networks

PubMed Central

Rodrigues, Joel J. P. C.

2014-01-01

This paper exploits sink mobility to prolong the lifetime of sensor networks while maintaining the data transmission delay relatively low. A location predictive and time adaptive data gathering scheme is proposed. In this paper, we introduce a sink location prediction principle based on loose time synchronization and deduce the time-location formulas of the mobile sink. According to local clocks and the time-location formulas of the mobile sink, nodes in the network are able to calculate the current location of the mobile sink accurately and route data packets timely toward the mobile sink by multihop relay. Considering that data packets generating from different areas may be different greatly, an adaptive dwelling time adjustment method is also proposed to balance energy consumption among nodes in the network. Simulation results show that our data gathering scheme enables data routing with less data transmission time delay and balance energy consumption among nodes. PMID:25302327

Peregrine Job Queues and Scheduling Policies | High-Performance Computing |

Science.gov Websites

batch batch-h long bigmem data-transfer feature Max wall time 1 hour 4 hours 2 days 2 days 10 days 10 # nodes per job 2 8 288 576 120 46 1 # of 24 core 64 GB Haswell nodes 2 8 0 1228 0 0 0 haswell # of 24core 32 GB nodes 2 16 576 0 126 0 0 24core # of 16core 32 GB nodes 2 8 195 0 162 0 5 16core, # of 24core

Integrated Social and QoS Trust-Based Routing in Mobile Ad Hoc Delay Tolerant Networks

DTIC Science & Technology

2010-11-15

d-connectivity, honesty, or unselfishness) with: encounter*,. , A ^// m = / (3) {•p ounter,x r. , . .-, ( Ti x m (t), ifm =j ^indirect. X, T...take into account node »’ s belief in node m in the calculation ofT(jreet’ x(t + At). This models the decay of trust as trust is derived from a distant...directly based on node /’ s past experiences with node m up to time t + At, including the current encounter. Taking the fact that /? a + /?2 = 1, we obtain

Low-Latency and Energy-Efficient Data Preservation Mechanism in Low-Duty-Cycle Sensor Networks.

PubMed

Jiang, Chan; Li, Tao-Shen; Liang, Jun-Bin; Wu, Heng

2017-05-06

Similar to traditional wireless sensor networks (WSN), the nodes only have limited memory and energy in low-duty-cycle sensor networks (LDC-WSN). However, different from WSN, the nodes in LDC-WSN often sleep most of their time to preserve their energies. The sleeping feature causes serious data transmission delay. However, each source node that has sensed data needs to quickly disseminate its data to other nodes in the network for redundant storage. Otherwise, data would be lost due to its source node possibly being destroyed by outer forces in a harsh environment. The quick dissemination requirement produces a contradiction with the sleeping delay in the network. How to quickly disseminate all the source data to all the nodes with limited memory in the network for effective preservation is a challenging issue. In this paper, a low-latency and energy-efficient data preservation mechanism in LDC-WSN is proposed. The mechanism is totally distributed. The data can be disseminated to the network with low latency by using a revised probabilistic broadcasting mechanism, and then stored by the nodes with LT (Luby Transform) codes, which are a famous rateless erasure code. After the process of data dissemination and storage completes, some nodes may die due to being destroyed by outer forces. If a mobile sink enters the network at any time and from any place to collect the data, it can recover all of the source data by visiting a small portion of survived nodes in the network. Theoretical analyses and simulation results show that our mechanism outperforms existing mechanisms in the performances of data dissemination delay and energy efficiency.

Robot-assisted Versus Laparoscopic Surgery for Rectal Cancer: A Phase II Open Label Prospective Randomized Controlled Trial.

PubMed

Kim, Min Jung; Park, Sung Chan; Park, Ji Won; Chang, Hee Jin; Kim, Dae Yong; Nam, Byung-Ho; Sohn, Dae Kyung; Oh, Jae Hwan

2018-02-01

The phase II randomized controlled trial aimed to compare the outcomes of robot-assisted surgery with those of laparoscopic surgery in the patients with rectal cancer. The feasibility of robot-assisted surgery over laparoscopic surgery for rectal cancer has not been established yet. Between February 21, 2012 and March 11, 2015, patients with rectal cancer (cT1-3NxM0) were enrolled. Patients were randomized 1:1 to either robot-assisted or laparoscopic surgery, and stratified per sex and administration of preoperative chemoradiotherapy. The primary outcome was the quality of total mesorectal excision (TME) specimen. Secondary outcomes were the circumferential and distal resection margins, the number of harvested lymph nodes, morbidity, bowel function recovery, and quality of life. A total of 163 patients were randomly assigned to the robot-assisted (n = 81) and laparoscopic (n = 82) surgery groups, and 139 patients were eligible for the analyses (73 vs 66, respectively). One patient (1.2%) in the robot-assisted group was converted to open surgery. The TME quality did not differ between the robot-assisted and laparoscopic groups (80.3% vs 78.1% complete TME, respectively; 18.2% vs 21.9% nearly complete TME, respectively; P = 0.599). The resection margins, number of harvested lymph nodes, morbidity, and bowel function recovery also were not significantly different. On analyzing quality of life, scores of the European Organization for Research and Treatment of Cancer Quality of Life (EORTC QLQ C30) and EORTC QLQ CR38 were similar in the 2 groups, but in the EORTC QLQ CR 38 questionnaire, sexual function 12 months postoperatively was better in the robot-assisted group than in the laparoscopic group (P = 0.03). Robot-assisted surgery in rectal cancer showed TME quality comparable with that of laparoscopic surgery, and it demonstrated similar postoperative morbidity, bowel function recovery, and quality of life.

Localization Algorithm Based on a Spring Model (LASM) for Large Scale Wireless Sensor Networks.

PubMed

Chen, Wanming; Mei, Tao; Meng, Max Q-H; Liang, Huawei; Liu, Yumei; Li, Yangming; Li, Shuai

2008-03-15

A navigation method for a lunar rover based on large scale wireless sensornetworks is proposed. To obtain high navigation accuracy and large exploration area, highnode localization accuracy and large network scale are required. However, thecomputational and communication complexity and time consumption are greatly increasedwith the increase of the network scales. A localization algorithm based on a spring model(LASM) method is proposed to reduce the computational complexity, while maintainingthe localization accuracy in large scale sensor networks. The algorithm simulates thedynamics of physical spring system to estimate the positions of nodes. The sensor nodesare set as particles with masses and connected with neighbor nodes by virtual springs. Thevirtual springs will force the particles move to the original positions, the node positionscorrespondingly, from the randomly set positions. Therefore, a blind node position can bedetermined from the LASM algorithm by calculating the related forces with the neighbornodes. The computational and communication complexity are O(1) for each node, since thenumber of the neighbor nodes does not increase proportionally with the network scale size.Three patches are proposed to avoid local optimization, kick out bad nodes and deal withnode variation. Simulation results show that the computational and communicationcomplexity are almost constant despite of the increase of the network scale size. The time consumption has also been proven to remain almost constant since the calculation steps arealmost unrelated with the network scale size.

Multi-petascale highly efficient parallel supercomputer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Asaad, Sameh; Bellofatto, Ralph E.; Blocksome, Michael A.

A Multi-Petascale Highly Efficient Parallel Supercomputer of 100 petaflop-scale includes node architectures based upon System-On-a-Chip technology, where each processing node comprises a single Application Specific Integrated Circuit (ASIC). The ASIC nodes are interconnected by a five dimensional torus network that optimally maximize the throughput of packet communications between nodes and minimize latency. The network implements collective network and a global asynchronous network that provides global barrier and notification functions. Integrated in the node design include a list-based prefetcher. The memory system implements transaction memory, thread level speculation, and multiversioning cache that improves soft error rate at the same time andmore » supports DMA functionality allowing for parallel processing message-passing.« less

On absence of steady state in the Bouchaud-Mézard network model

NASA Astrophysics Data System (ADS)

Liu, Zhiyuan; Serota, R. A.

2018-02-01

In the limit of infinite number of nodes (agents), the Itô-reduced Bouchaud-Mézard network model of economic exchange has a time-independent mean and a steady-state inverse gamma distribution. We show that for a finite number of nodes the mean is actually distributed as a time-dependent lognormal and inverse gamma is quasi-stationary, with the time-dependent scale parameter.

LEGION: Lightweight Expandable Group of Independently Operating Nodes

NASA Technical Reports Server (NTRS)

Burl, Michael C.

2012-01-01

LEGION is a lightweight C-language software library that enables distributed asynchronous data processing with a loosely coupled set of compute nodes. Loosely coupled means that a node can offer itself in service to a larger task at any time and can withdraw itself from service at any time, provided it is not actively engaged in an assignment. The main program, i.e., the one attempting to solve the larger task, does not need to know up front which nodes will be available, how many nodes will be available, or at what times the nodes will be available, which is normally the case in a "volunteer computing" framework. The LEGION software accomplishes its goals by providing message-based, inter-process communication similar to MPI (message passing interface), but without the tight coupling requirements. The software is lightweight and easy to install as it is written in standard C with no exotic library dependencies. LEGION has been demonstrated in a challenging planetary science application in which a machine learning system is used in closed-loop fashion to efficiently explore the input parameter space of a complex numerical simulation. The machine learning system decides which jobs to run through the simulator; then, through LEGION calls, the system farms those jobs out to a collection of compute nodes, retrieves the job results as they become available, and updates a predictive model of how the simulator maps inputs to outputs. The machine learning system decides which new set of jobs would be most informative to run given the results so far; this basic loop is repeated until sufficient insight into the physical system modeled by the simulator is obtained.

Celiac Node Failure Patterns After Definitive Chemoradiation for Esophageal Cancer in the Modern Era

DOE Office of Scientific and Technical Information (OSTI.GOV)

Amini, Arya; UC Irvine School of Medicine, Irvine, California; Xiao Lianchun

2012-06-01

Purpose: The celiac lymph node axis acts as a gateway for metastatic systemic spread. The need for prophylactic celiac nodal coverage in chemoradiation therapy for esophageal cancer is controversial. Given the improved ability to evaluate lymph node status before treatment via positron emission tomography (PET) and endoscopic ultrasound, we hypothesized that prophylactic celiac node irradiation may not be needed for patients with localized esophageal carcinoma. Methods and Materials: We reviewed the radiation treatment volumes for 131 patients who underwent definitive chemoradiation for esophageal cancer. Patients with celiac lymph node involvement at baseline were excluded. Median radiation dose was 50.4 Gy.more » The location of all celiac node failures was compared with the radiation treatment plan to determine whether the failures occurred within or outside the radiation treatment field. Results: At a median follow-up time of 52.6 months (95% CI 46.1-56.7 months), 6 of 60 patients (10%) without celiac node coverage had celiac nodal failure; in 5 of these patients, the failures represented the first site of recurrence. Of the 71 patients who had celiac coverage, only 5 patients (7%) had celiac region relapse. In multivariate analyses, having a pretreatment-to-post-treatment change in standardized uptake value on PET >52% (odds ratio [OR] 0.198, p = 0.0327) and having failure in the clinical target volume (OR 10.72, p = 0.001) were associated with risk of celiac region relapse. Of those without celiac coverage, the 6 patients that later developed celiac failure had a worse median overall survival time compared with the other 54 patients who did not fail (median overall survival time: 16.5 months vs. 31.5 months, p = 0.041). Acute and late toxicities were similar in both groups. Conclusions: Although celiac lymph node failures occur in approximately 1 of 10 patients, the lack of effective salvage treatments and subsequent low morbidity may justify prophylactic treatment in distal esophageal cancer patients.« less

Symmetry-Enforced Line Nodes in Unconventional Superconductors [Nodal-Line Superconductors and Band-Sticking

DOE PAGES

Micklitz, T.; Norman, M. R.

2017-05-18

We classify line nodes in superconductors with strong spin-orbit interactions and time-reversal symmetry, where the latter may include nonprimitive translations in the magnetic Brillouin zone to account for coexistence with antiferromagnetic order. We find four possible combinations of irreducible representations of the order parameter on high-symmetry planes, two of which allow for line nodes in pseudospin-triplet pairs and two that exclude conventional fully gapped pseudospin-singlet pairs. We show that the former can only be realized in the presence of band-sticking degeneracies, and we verify their topological stability using arguments based on Clifford algebra extensions. Lastly, our classification exhausts all possiblemore » symmetry protected line nodes in the presence of spin-orbit coupling and a (generalized) time-reversal symmetry. Implications for existing nonsymmorphic and antiferromagnetic superconductors are discussed.« less

Strength and fine dexterity recovery profiles after a primary motor cortex insult and effect of a neuronal cell graft.

PubMed

Vaysse, Laurence; Conchou, Fabrice; Demain, Boris; Davoust, Carole; Plas, Benjamin; Ruggieri, Cyrielle; Benkaddour, Mehdi; Simonetta-Moreau, Marion; Loubinoux, Isabelle

2015-08-01

The aim of this study was to set up (a) a large primary motor cortex (M1) lesion in rodent and (b) the conditions for evaluating a long-lasting motor deficit in order to propose a valid model to test neuronal replacement therapies aimed at improving motor deficit recovery. A mitochondrial toxin, malonate, was injected to induce extensive destruction of the forelimb M1 cortex. Three key motor functions that are usually evaluated following cerebral lesion in the clinic-strength, target reaching, and fine dexterity-were assessed in rats by 2 tests, a forelimb grip strength test and a skilled reaching task (staircase) for reaching and dexterity. The potential enhancement of postlesion recovery induced by a neuronal cell transplantation was then explored and confirmed by histological analyses. Both tests showed a severe functional impairment 2 days post lesion, however, reaching remained intact. Deficits in forelimb strength were long lasting (up to 3 months) but spontaneously recovered despite the extensive lesion size. This natural grip strength recovery could be enhanced by cell therapy. Histological analyses confirmed the presence of grafted cells 3 months postgraft and showed partial tissue reconstruction with some living neuronal cells in the graft. In contrast, fine dexterity never recovered in the staircase test even after grafting. These results suggest that cell replacement was only partially effective and that the forelimb M1 area may be a node of the sensorimotor network, where compensation from secondary pathways could account for strength recovery but recovery of forelimb fine dexterity requires extensive tissue reconstruction. (c) 2015 APA, all rights reserved).

Optimizing Retransmission Threshold in Wireless Sensor Networks

PubMed Central

Bi, Ran; Li, Yingshu; Tan, Guozhen; Sun, Liang

2016-01-01

The retransmission threshold in wireless sensor networks is critical to the latency of data delivery in the networks. However, existing works on data transmission in sensor networks did not consider the optimization of the retransmission threshold, and they simply set the same retransmission threshold for all sensor nodes in advance. The method did not take link quality and delay requirement into account, which decreases the probability of a packet passing its delivery path within a given deadline. This paper investigates the problem of finding optimal retransmission thresholds for relay nodes along a delivery path in a sensor network. The object of optimizing retransmission thresholds is to maximize the summation of the probability of the packet being successfully delivered to the next relay node or destination node in time. A dynamic programming-based distributed algorithm for finding optimal retransmission thresholds for relay nodes along a delivery path in the sensor network is proposed. The time complexity is OnΔ·max1≤i≤n{ui}, where ui is the given upper bound of the retransmission threshold of sensor node i in a given delivery path, n is the length of the delivery path and Δ is the given upper bound of the transmission delay of the delivery path. If Δ is greater than the polynomial, to reduce the time complexity, a linear programming-based (1+pmin)-approximation algorithm is proposed. Furthermore, when the ranges of the upper and lower bounds of retransmission thresholds are big enough, a Lagrange multiplier-based distributed O(1)-approximation algorithm with time complexity O(1) is proposed. Experimental results show that the proposed algorithms have better performance. PMID:27171092

A time reference distribution concept for a time division communication network

NASA Technical Reports Server (NTRS)

Stover, H. A.

1973-01-01

Starting with an assumed ideal network having perfect clocks at every node and known fixed transmission delays between nodes, the effects of adding tolerances to both transmission delays and nodal clocks is described. The advantages of controlling tolerances on time rather than frequency are discussed. Then a concept is presented for maintaining these tolerances on time throughout the network. This concept, called time reference distribution, is a systematic technique for distributing time reference to all nodes of the network. It is reliable, survivable and possesses many other desirable characteristics. Some of its features such as an excellent self monitoring capability will be pointed out. Some preliminary estimates of the accuracy that might be expected are developed and there is a brief discussion of the impact upon communication system costs. Time reference distribution is a concept that appears very attractive. It has not had experimental evaluation and has not yet been endorsed for use in any communication network.

Mathematical Analysis of Vehicle Delivery Scale of Bike-Sharing Rental Nodes

NASA Astrophysics Data System (ADS)

Zhai, Y.; Liu, J.; Liu, L.

2018-04-01

Aiming at the lack of scientific and reasonable judgment of vehicles delivery scale and insufficient optimization of scheduling decision, based on features of the bike-sharing usage, this paper analyses the applicability of the discrete time and state of the Markov chain, and proves its properties to be irreducible, aperiodic and positive recurrent. Based on above analysis, the paper has reached to the conclusion that limit state (steady state) probability of the bike-sharing Markov chain only exists and is independent of the initial probability distribution. Then this paper analyses the difficulty of the transition probability matrix parameter statistics and the linear equations group solution in the traditional solving algorithm of the bike-sharing Markov chain. In order to improve the feasibility, this paper proposes a "virtual two-node vehicle scale solution" algorithm which considered the all the nodes beside the node to be solved as a virtual node, offered the transition probability matrix, steady state linear equations group and the computational methods related to the steady state scale, steady state arrival time and scheduling decision of the node to be solved. Finally, the paper evaluates the rationality and accuracy of the steady state probability of the proposed algorithm by comparing with the traditional algorithm. By solving the steady state scale of the nodes one by one, the proposed algorithm is proved to have strong feasibility because it lowers the level of computational difficulty and reduces the number of statistic, which will help the bike-sharing companies to optimize the scale and scheduling of nodes.

[Application of subserosal injection of carbon nanoparticles via infusion needle to label lymph nodes in laparoscopic radical gastrectomy].

PubMed

Chen, Hongyuan; Wang, Yanan; Xue, Fangqin; Yu, Jiang; Hu, Yanfeng; Liu, Hao; Yan, Jun; Li, Guoxin

2014-05-01

To explore the feasibility of subserosal injection of carbon nanoparticle via venous infusion needle to label lymph node and its application value in laparoscopic radical gastrectomy. Forty patients with gastric cancer were randomly divided into two groups (carbon nanoparticle group and control group). Subserosal injection of carbon nanoparticle around the tumor was performed via venous infusion needle laparoscopically at the beginning of surgery in carbon nanoparticles group, while the patients routinely underwent laparoscopic radical gastrectomy in control group. Results of harvested lymph nodes were compared between the two groups. The perioperative complications and the side effect of carbon nanoparticle were also evaluated. The average number of harvested lymph node in carbon nanoparticle group (31.7±7.6) was significantly higher than that in control group (19.8±6.1, P<0.05). The proportion of harvested small node (< 5 mm) in carbon nanoparticles group(61.0%) was higher than that in control group(43.3%, P<0.01). The mean harvest time in carbon nanoparticle group [(23.5±4.8) min] was shorter than that in control group [(32.6±5.5) min, P<0.05]. The rate of black-dyed harvested lymph node was 61.9% and the metastasis rate of black-dyed lymph node was 23.0% in carbon nanoparticle group, which were significantly higher than those without black-dyed(6.2%, P<0.05) and those in control group (15.7%, P<0.05). The operative time and perioperative complications were not significantly different between the two groups, and no serious side effect caused by carbon nanoparticle was observed. Subserosal injection of carbon nanoparticle via venous infusion needle to label lymph nodes during laparoscopic radical gastrectomy is safe and feasible. It can increase the number of harvested lymph node, especially the small node.

Design of a Base Station for MEMS CCR Localization in an Optical Sensor Network

PubMed Central

Park, Chan Gook; Jeon, Hyun Cheol; Kim, Hyoun Jin; Kim, Jae Yoon

2014-01-01

This paper introduces a design and implementation of a base station, capable of positioning sensor nodes using an optical scheme. The base station consists of a pulse laser module, optical detectors and beam splitter, which are mounted on a rotation-stage, and a Time to Digital Converter (TDC). The optical pulse signal transmitted to the sensor node with a Corner Cube Retro-reflector (CCR) is reflected to the base station, and the Time of Flight (ToF) data can be obtained from the two detectors. With the angle and flight time data, the position of the sensor node can be calculated. The performance of the system is evaluated by using a commercial CCR. The sensor nodes are placed at different angles from the base station and scanned using the laser. We analyze the node position error caused by the rotation and propose error compensation methods, namely the outlier sample exception and decreasing the confidence factor steadily using the recursive least square (RLS) methods. Based on the commercial CCR results, the MEMS CCR is also tested to demonstrate the compatibility between the base station and the proposed methods. The result shows that the localization performance of the system can be enhanced with the proposed compensation method using the MEMS CCR. PMID:24815681

Design of a base station for MEMS CCR localization in an optical sensor network.

PubMed

Park, Chan Gook; Jeon, Hyun Cheol; Kim, Hyoun Jin; Kim, Jae Yoon

2014-05-08

This paper introduces a design and implementation of a base station, capable of positioning sensor nodes using an optical scheme. The base station consists of a pulse laser module, optical detectors and beam splitter, which are mounted on a rotation-stage, and a Time to Digital Converter (TDC). The optical pulse signal transmitted to the sensor node with a Corner Cube Retro-reflector (CCR) is reflected to the base station, and the Time of Flight (ToF) data can be obtained from the two detectors. With the angle and flight time data, the position of the sensor node can be calculated. The performance of the system is evaluated by using a commercial CCR. The sensor nodes are placed at different angles from the base station and scanned using the laser. We analyze the node position error caused by the rotation and propose error compensation methods, namely the outlier sample exception and decreasing the confidence factor steadily using the recursive least square (RLS) methods. Based on the commercial CCR results, the MEMS CCR is also tested to demonstrate the compatibility between the base station and the proposed methods. The result shows that the localization performance of the system can be enhanced with the proposed compensation method using the MEMS CCR.

Scaling of Average Weighted Receiving Time on Double-Weighted Koch Networks

NASA Astrophysics Data System (ADS)

Dai, Meifeng; Ye, Dandan; Hou, Jie; Li, Xingyi

2015-03-01

In this paper, we introduce a model of the double-weighted Koch networks based on actual road networks depending on the two weight factors w,r ∈ (0, 1]. The double weights represent the capacity-flowing weight and the cost-traveling weight, respectively. Denote by wFij the capacity-flowing weight connecting the nodes i and j, and denote by wCij the cost-traveling weight connecting the nodes i and j. Let wFij be related to the weight factor w, and let wCij be related to the weight factor r. This paper assumes that the walker, at each step, starting from its current node, moves to any of its neighbors with probability proportional to the capacity-flowing weight of edge linking them. The weighted time for two adjacency nodes is the cost-traveling weight connecting the two nodes. We define the average weighted receiving time (AWRT) on the double-weighted Koch networks. The obtained result displays that in the large network, the AWRT grows as power-law function of the network order with the exponent, represented by θ(w,r) = ½ log2(1 + 3wr). We show that the AWRT exhibits a sublinear or linear dependence on network order. Thus, the double-weighted Koch networks are more efficient than classic Koch networks in receiving information.

Modeling Temporal Behavior in Large Networks: A Dynamic Mixed-Membership Model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rossi, R; Gallagher, B; Neville, J

Given a large time-evolving network, how can we model and characterize the temporal behaviors of individual nodes (and network states)? How can we model the behavioral transition patterns of nodes? We propose a temporal behavior model that captures the 'roles' of nodes in the graph and how they evolve over time. The proposed dynamic behavioral mixed-membership model (DBMM) is scalable, fully automatic (no user-defined parameters), non-parametric/data-driven (no specific functional form or parameterization), interpretable (identifies explainable patterns), and flexible (applicable to dynamic and streaming networks). Moreover, the interpretable behavioral roles are generalizable, computationally efficient, and natively supports attributes. We applied ourmore » model for (a) identifying patterns and trends of nodes and network states based on the temporal behavior, (b) predicting future structural changes, and (c) detecting unusual temporal behavior transitions. We use eight large real-world datasets from different time-evolving settings (dynamic and streaming). In particular, we model the evolving mixed-memberships and the corresponding behavioral transitions of Twitter, Facebook, IP-Traces, Email (University), Internet AS, Enron, Reality, and IMDB. The experiments demonstrate the scalability, flexibility, and effectiveness of our model for identifying interesting patterns, detecting unusual structural transitions, and predicting the future structural changes of the network and individual nodes.« less

Tetrahedral node for Transmission-Line Modeling (TLM) applied to Bio-heat Transfer.

PubMed

Milan, Hugo F M; Gebremedhin, Kifle G

2016-12-01

Transmission-Line Modeling (TLM) is a numerical method used to solve complex and time-domain bio-heat transfer problems. In TLM, parallelepipeds are used to discretize three-dimensional problems. The drawback in using parallelepiped shapes is that instead of refining only the domain of interest, a large additional domain would also have to be refined, which results in increased computational time and memory space. In this paper, we developed a tetrahedral node for TLM applied to bio-heat transfer that does not have the drawback associated with the parallelepiped node. The model includes heat source, blood perfusion, boundary conditions and initial conditions. The boundary conditions could be adiabatic, temperature, heat flux, or convection. The predicted temperature and heat flux were compared against results from an analytical solution and the results agreed within 2% for a mesh size of 69,941 nodes and a time step of 5ms. The method was further validated against published results of maximum skin-surface temperature difference in a breast with and without tumor and the results agreed within 6%. The published results were obtained from a model that used parallelepiped TLM node. An open source software, TLMBHT, was written using the theory developed herein and is available for download free-of-charge. Copyright © 2016 Elsevier Ltd. All rights reserved.

Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs

PubMed Central

Kim, Sang-Ha

2017-01-01

Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult. For message forwarding in networks, a planar graph is used to prevent looping, and because long edges are removed by planarization and the resulting planar graph is composed of short edges, and messages are forwarded along multiple nodes connected by them even though they can be forwarded directly. To solve this, face routing using information on all nodes within 2-hop range was adopted to forward messages directly to the farthest node within radio range. However, as the density of the nodes increases, network performance plunges because message transfer nodes receive and process increased node information. To deal with this problem, we propose a new face routing using the planar graphs of neighboring nodes to improve transfer efficiency. It forwards a message directly to the farthest neighbor and reduces loads and processing time by distributing network graph construction and planarization to the neighbors. It also decreases the amount of location information to be transmitted by sending information on the planar graph nodes rather than on all neighboring nodes. Simulation results show that it significantly improves transfer efficiency. PMID:29053623

Distributed Sensor Nodes Charged by Mobile Charger with Directional Antenna and by Energy Trading for Balancing.

PubMed

Moraes, Celso; Myung, Sunghee; Lee, Sangkeum; Har, Dongsoo

2017-01-10

Provision of energy to wireless sensor networks is crucial for their sustainable operation. Sensor nodes are typically equipped with batteries as their operating energy sources. However, when the sensor nodes are sited in almost inaccessible locations, replacing their batteries incurs high maintenance cost. Under such conditions, wireless charging of sensor nodes by a mobile charger with an antenna can be an efficient solution. When charging distributed sensor nodes, a directional antenna, rather than an omnidirectional antenna, is more energy-efficient because of smaller proportion of off-target radiation. In addition, for densely distributed sensor nodes, it can be more effective for some undercharged sensor nodes to harvest energy from neighboring overcharged sensor nodes than from the remote mobile charger, because this reduces the pathloss of charging signal due to smaller distances. In this paper, we propose a hybrid charging scheme that combines charging by a mobile charger with a directional antenna, and energy trading, e.g., transferring and harvesting, between neighboring sensor nodes. The proposed scheme is compared with other charging scheme. Simulations demonstrate that the hybrid charging scheme with a directional antenna achieves a significant reduction in the total charging time required for all sensor nodes to reach a target energy level.

Distributed Sensor Nodes Charged by Mobile Charger with Directional Antenna and by Energy Trading for Balancing

PubMed Central

Moraes, Celso; Myung, Sunghee; Lee, Sangkeum; Har, Dongsoo

2017-01-01

Provision of energy to wireless sensor networks is crucial for their sustainable operation. Sensor nodes are typically equipped with batteries as their operating energy sources. However, when the sensor nodes are sited in almost inaccessible locations, replacing their batteries incurs high maintenance cost. Under such conditions, wireless charging of sensor nodes by a mobile charger with an antenna can be an efficient solution. When charging distributed sensor nodes, a directional antenna, rather than an omnidirectional antenna, is more energy-efficient because of smaller proportion of off-target radiation. In addition, for densely distributed sensor nodes, it can be more effective for some undercharged sensor nodes to harvest energy from neighboring overcharged sensor nodes than from the remote mobile charger, because this reduces the pathloss of charging signal due to smaller distances. In this paper, we propose a hybrid charging scheme that combines charging by a mobile charger with a directional antenna, and energy trading, e.g., transferring and harvesting, between neighboring sensor nodes. The proposed scheme is compared with other charging scheme. Simulations demonstrate that the hybrid charging scheme with a directional antenna achieves a significant reduction in the total charging time required for all sensor nodes to reach a target energy level. PMID:28075372

Collaborative Localization Algorithms for Wireless Sensor Networks with Reduced Localization Error

PubMed Central

Sahoo, Prasan Kumar; Hwang, I-Shyan

2011-01-01

Localization is an important research issue in Wireless Sensor Networks (WSNs). Though Global Positioning System (GPS) can be used to locate the position of the sensors, unfortunately it is limited to outdoor applications and is costly and power consuming. In order to find location of sensor nodes without help of GPS, collaboration among nodes is highly essential so that localization can be accomplished efficiently. In this paper, novel localization algorithms are proposed to find out possible location information of the normal nodes in a collaborative manner for an outdoor environment with help of few beacons and anchor nodes. In our localization scheme, at most three beacon nodes should be collaborated to find out the accurate location information of any normal node. Besides, analytical methods are designed to calculate and reduce the localization error using probability distribution function. Performance evaluation of our algorithm shows that there is a tradeoff between deployed number of beacon nodes and localization error, and average localization time of the network can be increased with increase in the number of normal nodes deployed over a region. PMID:22163738

Node Immunization with Time-Sensitive Restrictions.

PubMed

Cui, Wen; Gong, Xiaoqing; Liu, Chen; Xu, Dan; Chen, Xiaojiang; Fang, Dingyi; Tang, Shaojie; Wu, Fan; Chen, Guihai

2016-12-15

When we encounter a malicious rumor or an infectious disease outbreak, immunizing k nodes of the relevant network with limited resources is always treated as an extremely effective method. The key challenge is how we can insulate limited nodes to minimize the propagation of those contagious things. In previous works, the best k immunised nodes are selected by learning the initial status of nodes and their strategies even if there is no feedback in the propagation process, which eventually leads to ineffective performance of their solutions. In this paper, we design a novel vaccines placement strategy for protecting much more healthy nodes from being infected by infectious nodes. The main idea of our solution is that we are not only utilizing the status of changing nodes as auxiliary knowledge to adjust our scheme, but also comparing the performance of vaccines in various transmission slots. Thus, our solution has a better chance to get more benefit from these limited vaccines. Extensive experiments have been conducted on several real-world data sets and the results have shown that our algorithm has a better performance than previous works.

Heterogeneous delays making parents synchronized: A coupled maps on Cayley tree model

NASA Astrophysics Data System (ADS)

Singh, Aradhana; Jalan, Sarika

2014-06-01

We study the phase synchronized clusters in the diffusively coupled maps on the Cayley tree networks for heterogeneous delay values. Cayley tree networks comprise of two parts: the inner nodes and the boundary nodes. We find that heterogeneous delays lead to various cluster states, such as; (a) cluster state consisting of inner nodes and boundary nodes, and (b) cluster state consisting of only boundary nodes. The former state may comprise of nodes from all the generations forming self-organized cluster or nodes from few generations yielding driven clusters depending upon on the parity of heterogeneous delay values. Furthermore, heterogeneity in delays leads to the lag synchronization between the siblings lying on the boundary by destroying the exact synchronization among them. The time lag being equal to the difference in the delay values. The Lyapunov function analysis sheds light on the destruction of the exact synchrony among the last generation nodes. To the end we discuss the relevance of our results with respect to their applications in the family business as well as in understanding the occurrence of genetic diseases.

Node Immunization with Time-Sensitive Restrictions

PubMed Central

Cui, Wen; Gong, Xiaoqing; Liu, Chen; Xu, Dan; Chen, Xiaojiang; Fang, Dingyi; Tang, Shaojie; Wu, Fan; Chen, Guihai

2016-01-01

When we encounter a malicious rumor or an infectious disease outbreak, immunizing k nodes of the relevant network with limited resources is always treated as an extremely effective method. The key challenge is how we can insulate limited nodes to minimize the propagation of those contagious things. In previous works, the best k immunised nodes are selected by learning the initial status of nodes and their strategies even if there is no feedback in the propagation process, which eventually leads to ineffective performance of their solutions. In this paper, we design a novel vaccines placement strategy for protecting much more healthy nodes from being infected by infectious nodes. The main idea of our solution is that we are not only utilizing the status of changing nodes as auxiliary knowledge to adjust our scheme, but also comparing the performance of vaccines in various transmission slots. Thus, our solution has a better chance to get more benefit from these limited vaccines. Extensive experiments have been conducted on several real-world data sets and the results have shown that our algorithm has a better performance than previous works. PMID:27983680

Proposal for optimal placement platform of bikes using queueing networks.

PubMed

Mizuno, Shinya; Iwamoto, Shogo; Seki, Mutsumi; Yamaki, Naokazu

2016-01-01

In recent social experiments, rental motorbikes and rental bicycles have been arranged at nodes, and environments where users can ride these bikes have been improved. When people borrow bikes, they return them to nearby nodes. Some experiments have been conducted using the models of Hamachari of Yokohama, the Niigata Rental Cycle, and Bicing. However, from these experiments, the effectiveness of distributing bikes was unclear, and many models were discontinued midway. Thus, we need to consider whether these models are effectively designed to represent the distribution system. Therefore, we construct a model to arrange the nodes for distributing bikes using a queueing network. To adopt realistic values for our model, we use the Google Maps application program interface. Thus, we can easily obtain values of distance and transit time between nodes in various places in the world. Moreover, we apply the distribution of a population to a gravity model and we compute the effective transition probability for this queueing network. If the arrangement of the nodes and number of bikes at each node is known, we can precisely design the system. We illustrate our system using convenience stores as nodes and optimize the node configuration. As a result, we can optimize simultaneously the number of nodes, node places, and number of bikes for each node, and we can construct a base for a rental cycle business to use our system.

AND/OR graph representation of assembly plans

NASA Astrophysics Data System (ADS)

Homem de Mello, Luiz S.; Sanderson, Arthur C.

1990-04-01

A compact representation of all possible assembly plans of a product using AND/OR graphs is presented as a basis for efficient planning algorithms that allow an intelligent robot to pick a course of action according to instantaneous conditions. The AND/OR graph is equivalent to a state transition graph but requires fewer nodes and simplifies the search for feasible plans. Three applications are discussed: (1) the preselection of the best assembly plan, (2) the recovery from execution errors, and (3) the opportunistic scheduling of tasks. An example of an assembly with four parts illustrates the use of the AND/OR graph representation in assembly-plan preselection, based on the weighting of operations according to complexity of manipulation and stability of subassemblies. A hypothetical error situation is discussed to show how a bottom-up search of the AND/OR graph leads to an efficient recovery.

AND/OR graph representation of assembly plans

NASA Technical Reports Server (NTRS)

Homem De Mello, Luiz S.; Sanderson, Arthur C.

1990-01-01

A compact representation of all possible assembly plans of a product using AND/OR graphs is presented as a basis for efficient planning algorithms that allow an intelligent robot to pick a course of action according to instantaneous conditions. The AND/OR graph is equivalent to a state transition graph but requires fewer nodes and simplifies the search for feasible plans. Three applications are discussed: (1) the preselection of the best assembly plan, (2) the recovery from execution errors, and (3) the opportunistic scheduling of tasks. An example of an assembly with four parts illustrates the use of the AND/OR graph representation in assembly-plan preselection, based on the weighting of operations according to complexity of manipulation and stability of subassemblies. A hypothetical error situation is discussed to show how a bottom-up search of the AND/OR graph leads to an efficient recovery.

Infected colonic mass revealing a lung adenocarcinoma.

PubMed

Doussot, Alexandre; Chalumeau, Claire; Combier, Christophe; Cheynel, Nicolas; Facy, Olivier

2013-12-01

We report the case of lung adenocarcinoma revealed by infected colonic tumor in a 62-year-old man. An en bloc surgical resection was performed with uneventful recovery. The pathologic report concluded in a right mesocolic lymph node metastases from a mildly differentiated adenocarcinoma from pulmonary origin. GI metastases of lung cancer are described in the literature and are frequently asymptomatic in patient with a known primary cancer. In this patient, the complication of the metastases revealed the primary and immunochemistry permitted to adapt the systemic chemotherapy. Copyright © 2012. Published by Elsevier Masson SAS.

Ultrascalable Techniques Applied to the Global Intelligence Community Information Awareness Common Operating Picture (IA COP)

DTIC Science & Technology

2005-11-01

more random. Autonomous systems can exchange entropy statistics for packet streams with no confidentiality concerns, potentially enabling timely and... analysis began with simulation results, which were validated by analysis of actual data from an Autonomous System (AS). A scale-free network is one...traffic—for example, time series of flux at given nodes and mean path length Outputs the time series from any node queried Calculates

Energy-efficient boarder node medium access control protocol for wireless sensor networks.

PubMed

Razaque, Abdul; Elleithy, Khaled M

2014-03-12

This paper introduces the design, implementation, and performance analysis of the scalable and mobility-aware hybrid protocol named boarder node medium access control (BN-MAC) for wireless sensor networks (WSNs), which leverages the characteristics of scheduled and contention-based MAC protocols. Like contention-based MAC protocols, BN-MAC achieves high channel utilization, network adaptability under heavy traffic and mobility, and low latency and overhead. Like schedule-based MAC protocols, BN-MAC reduces idle listening time, emissions, and collision handling at low cost at one-hop neighbor nodes and achieves high channel utilization under heavy network loads. BN-MAC is particularly designed for region-wise WSNs. Each region is controlled by a boarder node (BN), which is of paramount importance. The BN coordinates with the remaining nodes within and beyond the region. Unlike other hybrid MAC protocols, BN-MAC incorporates three promising models that further reduce the energy consumption, idle listening time, overhearing, and congestion to improve the throughput and reduce the latency. One of the models used with BN-MAC is automatic active and sleep (AAS), which reduces the ideal listening time. When nodes finish their monitoring process, AAS lets them automatically go into the sleep state to avoid the idle listening state. Another model used in BN-MAC is the intelligent decision-making (IDM) model, which helps the nodes sense the nature of the environment. Based on the nature of the environment, the nodes decide whether to use the active or passive mode. This decision power of the nodes further reduces energy consumption because the nodes turn off the radio of the transceiver in the passive mode. The third model is the least-distance smart neighboring search (LDSNS), which determines the shortest efficient path to the one-hop neighbor and also provides cross-layering support to handle the mobility of the nodes. The BN-MAC also incorporates a semi-synchronous feature with a low duty cycle, which is advantageous for reducing the latency and energy consumption for several WSN application areas to improve the throughput. BN-MAC uses a unique window slot size to enhance the contention resolution issue for improved throughput. BN-MAC also prefers to communicate within a one-hop destination using Anycast, which maintains load balancing to maintain network reliability. BN-MAC is introduced with the goal of supporting four major application areas: monitoring and behavioral areas, controlling natural disasters, human-centric applications, and tracking mobility and static home automation devices from remote places. These application areas require a congestion-free mobility-supported MAC protocol to guarantee reliable data delivery. BN-MAC was evaluated using network simulator-2 (ns2) and compared with other hybrid MAC protocols, such as Zebra medium access control (Z-MAC), advertisement-based MAC (A-MAC), Speck-MAC, adaptive duty cycle SMAC (ADC-SMAC), and low-power real-time medium access control (LPR-MAC). The simulation results indicate that BN-MAC is a robust and energy-efficient protocol that outperforms other hybrid MAC protocols in the context of quality of service (QoS) parameters, such as energy consumption, latency, throughput, channel access time, successful delivery rate, coverage efficiency, and average duty cycle.

Energy-Efficient Boarder Node Medium Access Control Protocol for Wireless Sensor Networks

PubMed Central

Razaque, Abdul; Elleithy, Khaled M.

2014-01-01

This paper introduces the design, implementation, and performance analysis of the scalable and mobility-aware hybrid protocol named boarder node medium access control (BN-MAC) for wireless sensor networks (WSNs), which leverages the characteristics of scheduled and contention-based MAC protocols. Like contention-based MAC protocols, BN-MAC achieves high channel utilization, network adaptability under heavy traffic and mobility, and low latency and overhead. Like schedule-based MAC protocols, BN-MAC reduces idle listening time, emissions, and collision handling at low cost at one-hop neighbor nodes and achieves high channel utilization under heavy network loads. BN-MAC is particularly designed for region-wise WSNs. Each region is controlled by a boarder node (BN), which is of paramount importance. The BN coordinates with the remaining nodes within and beyond the region. Unlike other hybrid MAC protocols, BN-MAC incorporates three promising models that further reduce the energy consumption, idle listening time, overhearing, and congestion to improve the throughput and reduce the latency. One of the models used with BN-MAC is automatic active and sleep (AAS), which reduces the ideal listening time. When nodes finish their monitoring process, AAS lets them automatically go into the sleep state to avoid the idle listening state. Another model used in BN-MAC is the intelligent decision-making (IDM) model, which helps the nodes sense the nature of the environment. Based on the nature of the environment, the nodes decide whether to use the active or passive mode. This decision power of the nodes further reduces energy consumption because the nodes turn off the radio of the transceiver in the passive mode. The third model is the least-distance smart neighboring search (LDSNS), which determines the shortest efficient path to the one-hop neighbor and also provides cross-layering support to handle the mobility of the nodes. The BN-MAC also incorporates a semi-synchronous feature with a low duty cycle, which is advantageous for reducing the latency and energy consumption for several WSN application areas to improve the throughput. BN-MAC uses a unique window slot size to enhance the contention resolution issue for improved throughput. BN-MAC also prefers to communicate within a one-hop destination using Anycast, which maintains load balancing to maintain network reliability. BN-MAC is introduced with the goal of supporting four major application areas: monitoring and behavioral areas, controlling natural disasters, human-centric applications, and tracking mobility and static home automation devices from remote places. These application areas require a congestion-free mobility-supported MAC protocol to guarantee reliable data delivery. BN-MAC was evaluated using network simulator-2 (ns2) and compared with other hybrid MAC protocols, such as Zebra medium access control (Z-MAC), advertisement-based MAC (A-MAC), Speck-MAC, adaptive duty cycle SMAC (ADC-SMAC), and low-power real-time medium access control (LPR-MAC). The simulation results indicate that BN-MAC is a robust and energy-efficient protocol that outperforms other hybrid MAC protocols in the context of quality of service (QoS) parameters, such as energy consumption, latency, throughput, channel access time, successful delivery rate, coverage efficiency, and average duty cycle. PMID:24625737

Aspect Ratio of Receiver Node Geometry based Indoor WLAN Propagation Model

NASA Astrophysics Data System (ADS)

Naik, Udaykumar; Bapat, Vishram N.

2017-08-01

This paper presents validation of indoor wireless local area network (WLAN) propagation model for varying rectangular receiver node geometry. The rectangular client node configuration is a standard node arrangement in computer laboratories of academic institutes and research organizations. The model assists to install network nodes for the better signal coverage. The proposed model is backed by wide ranging real time received signal strength measurements at 2.4 GHz. The shadow fading component of signal propagation under realistic indoor environment is modelled with the dependency on varying aspect ratio of the client node geometry. The developed new model is useful in predicting indoor path loss for IEEE 802.11b/g WLAN. The new model provides better performance in comparison to well known International Telecommunication Union and free space propagation models. It is shown that the proposed model is simple and can be a useful tool for indoor WLAN node deployment planning and quick method for the best utilisation of the office space.

A Self-Stabilizing Byzantine-Fault-Tolerant Clock Synchronization Protocol

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2009-01-01

This report presents a rapid Byzantine-fault-tolerant self-stabilizing clock synchronization protocol that is independent of application-specific requirements. It is focused on clock synchronization of a system in the presence of Byzantine faults after the cause of any transient faults has dissipated. A model of this protocol is mechanically verified using the Symbolic Model Verifier (SMV) [SMV] where the entire state space is examined and proven to self-stabilize in the presence of one arbitrary faulty node. Instances of the protocol are proven to tolerate bursts of transient failures and deterministically converge with a linear convergence time with respect to the synchronization period. This protocol does not rely on assumptions about the initial state of the system other than the presence of sufficient number of good nodes. All timing measures of variables are based on the node s local clock, and no central clock or externally generated pulse is used. The Byzantine faulty behavior modeled here is a node with arbitrarily malicious behavior that is allowed to influence other nodes at every clock tick. The only constraint is that the interactions are restricted to defined interfaces.

Pattern of node metastases in patients treated with radical cystectomy and extended or superextended pelvic lymph node dissection due to bladder cancer.

PubMed

Moschini, Marco; Arbelaez, Emilio; Cornelius, Julian; Mattei, Agostino; Shariat, Shahrokh F; Dell Oglio, Paolo; Zaffuto, Emanuele; Salonia, Andrea; Montorsi, Francesco; Briganti, Alberto; Colombo, Renzo; Gallina, Andrea

2018-06-01

Pelvic lymph node dissection (PLND) has a diagnostic and therapeutic role during radical cystectomy in bladder cancer patients. However, at the time, no prospective data supports the value of extended PLND in improving survival expectances. We sought to describe incidence and location of node metastases in patients treated with extended and superextended PLND. We evaluated 653 contemporary patients with clinically nonmetastatic high risk nonmuscle invasive or muscle-invasive bladder cancer treated with radical cystectomy and extended or superextended PLND without neoadjuvant chemotherapy at a single tertiary referral center between 1990 and 2013. Limited PLND is defined as the removal of obturator and internal iliac nodes. Standard included also the external iliac nodes. Extended includes also common and presacral nodes. Finally, superextended PLND includes all the nodes removed along the inferior mesenteric artery. We evaluated incidence of pathologically node metastases. Logistic regression analyses evaluate preoperative and pathologic characteristics to the risk of harboring node metastases in the extended and superextended template. Overall, 191 (29.3%) patients were found with pathologically node confirmed metastases. Of these, 56 (29.3%) patients were found with a single node metastasis, while 135 (70.7%) had multiple node metastases. The vast majority of patients were found with node metastases standard template (n = 172, 26.3%), on the other hand 30 (4.6%) and 21 (3.2%) patients had node metastases in extended and superextended templates, respectively. However, of these only 2 patients were found without concomitant lymph node metastases in the limited or standard templates. On multivariable analyses, cN+ status (odds ratio = 4.40, P<0.001) and cT3-4 vs. cT1-2 (odds ratio = 2.25, P<0.001) were associated with an increased risk of harboring node metastases in the extended or superextended template. We found that the majority of patients harbored node disease in the limited or standard node dissection pattern. On the other hand, only a minority of patient were found with a disease in extended or superextended template without harboring a concomitant node disease in the limited pattern. Copyright © 2018 Elsevier Inc. All rights reserved.

[On the relation between encounter rate and population density: Are classical models of population dynamics justified?].

PubMed

Nedorezov, L V

2015-01-01

A stochastic model of migrations on a lattice and with discrete time is considered. It is assumed that space is homogenous with respect to its properties and during one time step every individual (independently of local population numbers) can migrate to nearest nodes of lattice with equal probabilities. It is also assumed that population size remains constant during certain time interval of computer experiments. The following variants of estimation of encounter rate between individuals are considered: when for the fixed time moments every individual in every node of lattice interacts with all other individuals in the node; when individuals can stay in nodes independently, or can be involved in groups in two, three or four individuals. For each variant of interactions between individuals, average value (with respect to space and time) is computed for various values of population size. The samples obtained were compared with respective functions of classic models of isolated population dynamics: Verhulst model, Gompertz model, Svirezhev model, and theta-logistic model. Parameters of functions were calculated with least square method. Analyses of deviations were performed using Kolmogorov-Smirnov test, Lilliefors test, Shapiro-Wilk test, and other statistical tests. It is shown that from traditional point of view there are no correspondence between the encounter rate and functions describing effects of self-regulatory mechanisms on population dynamics. Best fitting of samples was obtained with Verhulst and theta-logistic models when using the dataset resulted from the situation when every individual in the node interacts with all other individuals.

Surgical excision of anal sac apocrine gland adenocarcinomas with and without adjunctive chemotherapy in dogs: 42 cases (2005-2011).

PubMed

Potanas, Christopher P; Padgett, Sheldon; Gamblin, Rance M

2015-04-15

Objective-To identify variables associated with prognosis in dogs undergoing surgical excision of anal sac apocrine gland adenocarcinomas (ASACs) with and without adjunctive chemotherapy. Design-Retrospective case series. Animals-42 dogs with ASACs. Procedures-Information on signalment, clinical signs, diagnostic procedures, surgical procedures, adjunctive therapies, survival time, and disease-free interval was obtained from the medical records. Results-Survival time was significantly associated with the presence of sublumbar lymphadenopathy and sublumbar lymph node extirpation, with median survival time significantly shorter for dogs with sublumbar lymphadenopathy (hazard ratio, 2.31) than for those without and for dogs that underwent lymph node extirpation (hazard ratio, 2.31) than for those that did not. Disease-free interval was significantly associated with the presence of sublumbar lymphadenopathy, lymph node extirpation, and administration of platinum-containing chemotherapeutic agents, with median disease-free interval significantly shorter for dogs with sublumbar lymphadenopathy (hazard ratio, 2.47) than for those without, for dogs that underwent lymph node extirpation (hazard ratio, 2.47) than for those that did not, and for dogs that received platinum-containing chemotherapeutic agents (hazard ratio, 2.69) than for those that did not. Survival time and disease-free interval did not differ among groups when dogs were grouped on the basis of histopathologic margins (complete vs marginal vs incomplete excision). Conclusions and Clinical Relevance-Results suggested that in dogs with ASAC undergoing surgical excision, the presence of sublumbar lymphadenopathy and lymph node extirpation were both negative prognostic factors. However, completeness of surgical excision was not associated with survival time or disease-free interval.

A dual-modal magnetic nanoparticle probe for preoperative and intraoperative mapping of sentinel lymph nodes by magnetic resonance and near infrared fluorescence imaging

PubMed Central

Zhou, Zhengyang; Chen, Hongwei; Lipowska, Malgorzata; Wang, Liya; Yu, Qiqi; Yang, Xiaofeng; Tiwari, Diana; Yang, Lily; Mao, Hui

2016-01-01

The ability to reliably detect sentinel lymph nodes for sentinel lymph node biopsy and lymphadenectomy is important in clinical management of patients with metastatic cancers. However, the traditional sentinel lymph node mapping with visible dyes is limited by the penetration depth of light and fast clearance of the dyes. On the other hand, sentinel lymph node mapping with radionucleotide technique has intrinsically low spatial resolution and does not provide anatomic details in the sentinel lymph node mapping procedure. This work reports the development of a dual modality imaging probe with magnetic resonance and near infrared imaging capabilities for sentinel lymph node mapping using magnetic iron oxide nanoparticles (10 nm core size) conjugated with a near infrared molecule with emission at 830 nm. Accumulation of magnetic iron oxide nanoparticles in sentinel lymph nodes leads to strong T2 weighted magnetic resonance imaging contrast that can be potentially used for preoperative localization of sentinel lymph nodes, while conjugated near infrared molecules provide optical imaging tracking of lymph nodes with a high signal to background ratio. The new magnetic nanoparticle based dual imaging probe exhibits a significant longer lymph node retention time. Near infrared signals from nanoparticle conjugated near infrared dyes last up to 60 min in sentinel lymph node compared to that of 25 min for the free near infrared dyes in a mouse model. Furthermore, axillary lymph nodes, in addition to sentinel lymph nodes, can be also visualized with this probe, given its slow clearance and sufficient sensitivity. Therefore, this new dual modality imaging probe with the tissue penetration and sensitive detection of sentinel lymph nodes can be applied for preoperative survey of lymph nodes with magnetic resonance imaging and allows intraoperative sentinel lymph node mapping using near infrared optical devices. PMID:23812946

An Analytical Integration of the Averaged Equations of Variation due to Sun-Moon Perturbations and its Application.

DTIC Science & Technology

1979-10-01

the lngituddV .a rh - L .\\tJd f lh1. ;I,.s( , n n node crossing of the satellite, XANX , repeats evvry Q rev(,lutions,, or 2N7T a (t NP) + X -Qu( NP)2...7 at ANX 0 Q with N 0, 1, 2 ....... to =epoch time when the ascending node crossing occurs at longitude XANX P = nodal period aG = right ascension of...Greenwich S2 right ascension of the ascending node UPPER m BOUND XANX ANX LOWER axANX BOUND to tI t2 t4 Fig. 11 Schematic Drawing of the Time

Real-Time Spaceborne Synthetic Aperture Radar Float-Point Imaging System Using Optimized Mapping Methodology and a Multi-Node Parallel Accelerating Technique

PubMed Central

Li, Bingyi; Chen, Liang; Yu, Wenyue; Xie, Yizhuang; Bian, Mingming; Zhang, Qingjun; Pang, Long

2018-01-01

With the development of satellite load technology and very large-scale integrated (VLSI) circuit technology, on-board real-time synthetic aperture radar (SAR) imaging systems have facilitated rapid response to disasters. A key goal of the on-board SAR imaging system design is to achieve high real-time processing performance under severe size, weight, and power consumption constraints. This paper presents a multi-node prototype system for real-time SAR imaging processing. We decompose the commonly used chirp scaling (CS) SAR imaging algorithm into two parts according to the computing features. The linearization and logic-memory optimum allocation methods are adopted to realize the nonlinear part in a reconfigurable structure, and the two-part bandwidth balance method is used to realize the linear part. Thus, float-point SAR imaging processing can be integrated into a single Field Programmable Gate Array (FPGA) chip instead of relying on distributed technologies. A single-processing node requires 10.6 s and consumes 17 W to focus on 25-km swath width, 5-m resolution stripmap SAR raw data with a granularity of 16,384 × 16,384. The design methodology of the multi-FPGA parallel accelerating system under the real-time principle is introduced. As a proof of concept, a prototype with four processing nodes and one master node is implemented using a Xilinx xc6vlx315t FPGA. The weight and volume of one single machine are 10 kg and 32 cm × 24 cm × 20 cm, respectively, and the power consumption is under 100 W. The real-time performance of the proposed design is demonstrated on Chinese Gaofen-3 stripmap continuous imaging. PMID:29495637

BridgeRank: A novel fast centrality measure based on local structure of the network

NASA Astrophysics Data System (ADS)

Salavati, Chiman; Abdollahpouri, Alireza; Manbari, Zhaleh

2018-04-01

Ranking nodes in complex networks have become an important task in many application domains. In a complex network, influential nodes are those that have the most spreading ability. Thus, identifying influential nodes based on their spreading ability is a fundamental task in different applications such as viral marketing. One of the most important centrality measures to ranking nodes is closeness centrality which is efficient but suffers from high computational complexity O(n3) . This paper tries to improve closeness centrality by utilizing the local structure of nodes and presents a new ranking algorithm, called BridgeRank centrality. The proposed method computes local centrality value for each node. For this purpose, at first, communities are detected and the relationship between communities is completely ignored. Then, by applying a centrality in each community, only one best critical node from each community is extracted. Finally, the nodes are ranked based on computing the sum of the shortest path length of nodes to obtained critical nodes. We have also modified the proposed method by weighting the original BridgeRank and selecting several nodes from each community based on the density of that community. Our method can find the best nodes with high spread ability and low time complexity, which make it applicable to large-scale networks. To evaluate the performance of the proposed method, we use the SIR diffusion model. Finally, experiments on real and artificial networks show that our method is able to identify influential nodes so efficiently, and achieves better performance compared to other recent methods.

Space-Time Processing for Tactical Mobile Ad Hoc Networks

DTIC Science & Technology

2007-08-01

rates in mobile ad hoc networks. In addition, he has considered the design of a cross-layer multi-user resource allocation framework using a... framework for many-to-one communication. In this context, multiple nodes cooperate to transmit their packets simultaneously to a single node using multi...spatially multiplexed signals transmitted from multiple nodes. Our goal is to form a framework that activates different sets of communication links

A prospective investigation of fluorescence imaging to detect sentinel lymph nodes at robotic-assisted endometrial cancer staging.

PubMed

Paley, Pamela J; Veljovich, Dan S; Press, Joshua Z; Isacson, Christina; Pizer, Ellen; Shah, Chirag

2016-07-01

The accuracy of sentinel lymph node mapping has been shown in endometrial cancer, but studies to date have primarily focused on cohorts at low risk for nodal involvement. In our practice, we acknowledge the lack of benefit of lymphadenectomy in the low-risk subgroup and omit lymph node removal in these patients. Thus, our aim was to evaluate the feasibility and accuracy of sentinel node mapping in women at sufficient risk for nodal metastasis warranting lymphadenectomy and in whom the potential benefit of avoiding nodal procurement could be realized. To evaluate the detection rate and accuracy of fluorescence-guided sentinel lymph node mapping in endometrial cancer patients undergoing robotic-assisted staging. One hundred twenty-three endometrial cancer patients undergoing sentinel lymph node sentinel node mapping using indocyanine green were prospectively evaluated. Two mL (1.0 mg/mL) of dye were injected into the cervical stroma divided between the 2-3 and 9-10 o'clock positions at the time of uterine manipulator placement. Before hysterectomy, the retroperitoneal spaces were developed and fluorescence imaging was used for sentinel node detection. Identified sentinel nodes were removed and submitted for touch prep intraoperatively, followed by permanent assessment with routine hematoxylin and eosin levels. Patients then underwent hysterectomy, bilateral salpingo-oophorectomy, and completion bilateral pelvic and periaortic lymphadenectomy based on intrauterine risk factors determined intraoperatively (tumor size >2 cm, >50% myometrial invasion, and grade 3 histology). Of 123 patients enrolled, at least 1 sentinel node was detected in 119 (96.7%). Ninety-nine patients (80%) had bilateral pelvic or periaortic sentinel nodes detected. A total of 85 patients met criteria warranting completion lymphadenectomy. In 14 patients (16%) periaortic lymphadenectomy was not feasible, and the mean number of pelvic nodes procured was 13 (6-22). Of the 71 patients undergoing pelvic and periaortic lymphadenectomy, the mean nodal count was 23.2 (8-51). Of patients undergoing lymphadenectomy, 10.6% had lymph node metastasis on final hematoxylin and eosin evaluation. Notably, the sentinel node was the only positive node in 44% of cases. There were no cases in which final pathology of the sentinel node was negative and metastatic disease was detected upon completion lymphadenectomy in the non-sentinel nodes (no false negatives), yielding a sensitivity of 100%. Of the 14 sentinel nodes ultimately found to harbor metastases, 3 were negative on touch prep, yielding a sensitivity of 78.6% for intraoperative detection of sentinel node involvement. In all 3 of the false-negative touch preps, final pathology detected a single micrometastasis (0.24 mm, 1.4 mm, 1.5 mm). As expected, there were no false-positive results, yielding a specificity of 100%. No complications related to sentinel node mapping or allergic reactions to the dye were encountered. Intraoperative sentinel node mapping using fluorescence imaging with indocyanine green in endometrial cancer patients is feasible and yields high detection rates. In our pilot study, sentinel node mapping identified all women with Stage IIIC disease. Low false-negative rates are encouraging, and if confirmed in multi-institutional trials, this approach would be anticipated to reduce the morbidity, operative times, and costs associated with complete pelvic and periaortic lymphadenectomy. Copyright © 2015 Elsevier Inc. All rights reserved.

Conformation and Dynamics of a Flexible Sheet in Solvent Media by Monte Carlo Simulations

NASA Astrophysics Data System (ADS)

Pandey, Ras; Anderson, Kelly; Heinz, Hendrik; Farmer, Barry

2005-03-01

Flexibility of the clay sheet is limited even in the ex-foliated state in some solvent media. A coarse grained model is used to investigate dynamics and conformation of a flexible sheet to model such a clay platelet in an effective solvent medium on a cubic lattice of size L^3 with lattice constant a. The undeformed sheet is described by a square lattice of size Ls^2, where, each node of the sheet is represented by the unit cube of the cubic lattice and 2a is the minimum distance between the nearest neighbor nodes to incorporate the excluded volume constraints. Additionally, each node interacts with neighboring nodes and solvent (empty) sites within a range ri. Each node execute their stochastic motion with the Metropolis algorithm subject to bond length fluctuation and excluded volume constraints. Mean square displacements of the center node and that of its center of mass are investigated as a function of time step for a set of these parameters. The radius of gyration (Rg) is also examined concurrently to understand its relaxation. Multi-scale segmental dynamics of the sheet is studied by identifying the power-law dependence in various time regimes. Relaxation of Rg and its dependence of temperature are planned to be discussed.

A game-theoretic approach to optimize ad hoc networks inspired by small-world network topology

NASA Astrophysics Data System (ADS)

Tan, Mian; Yang, Tinghong; Chen, Xing; Yang, Gang; Zhu, Guoqing; Holme, Petter; Zhao, Jing

2018-03-01

Nodes in ad hoc networks are connected in a self-organized manner. Limited communication radius makes information transmit in multi-hop mode, and each forwarding needs to consume the energy of nodes. Insufficient communication radius or exhaustion of energy may cause the absence of some relay nodes and links, further breaking network connectivity. On the other hand, nodes in the network may refuse to cooperate due to objective faulty or personal selfish, hindering regular communication in the network. This paper proposes a model called Repeated Game in Small World Networks (RGSWN). In this model, we first construct ad hoc networks with small-world feature by forming "communication shortcuts" between multiple-radio nodes. Small characteristic path length reduces average forwarding times in networks; meanwhile high clustering coefficient enhances network robustness. Such networks still maintain relative low global power consumption, which is beneficial to extend the network survival time. Then we use MTTFT strategy (Mend-Tolerance Tit-for-Tat) for repeated game as a rule for the interactions between neighbors in the small-world networks. Compared with other five strategies of repeated game, this strategy not only punishes the nodes' selfishness more reasonably, but also has the best tolerance to the network failure. This work is insightful for designing an efficient and robust ad hoc network.

Game of life on phyllosilicates: Gliders, oscillators and still life

NASA Astrophysics Data System (ADS)

Adamatzky, Andrew

2013-10-01

A phyllosilicate is a sheet of silicate tetrahedra bound by basal oxygens. A phyllosilicate automaton is a regular network of finite state machines - silicon nodes and oxygen nodes - which mimics structure of the phyllosilicate. A node takes states 0 and 1. Each node updates its state in discrete time depending on a sum of states of its three (silicon) or six (oxygen) neighbours. Phyllosilicate automata exhibit localisations attributed to Conway's Game of Life: gliders, oscillators, still lifes, and a glider gun. Configurations and behaviour of typical localisations, and interactions between the localisations are illustrated.

IoGET: Internet of Geophysical and Environmental Things

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mudunuru, Maruti Kumar

The objective of this project is to provide novel and fast reduced-order models for onboard computation at sensor nodes for real-time analysis. The approach will require that LANL perform high-fidelity numerical simulations, construct simple reduced-order models (ROMs) using machine learning and signal processing algorithms, and use real-time data analysis for ROMs and compressive sensing at sensor nodes.

Random Time Identity Based Firewall In Mobile Ad hoc Networks

NASA Astrophysics Data System (ADS)

Suman, Patel, R. B.; Singh, Parvinder

2010-11-01

A mobile ad hoc network (MANET) is a self-organizing network of mobile routers and associated hosts connected by wireless links. MANETs are highly flexible and adaptable but at the same time are highly prone to security risks due to the open medium, dynamically changing network topology, cooperative algorithms, and lack of centralized control. Firewall is an effective means of protecting a local network from network-based security threats and forms a key component in MANET security architecture. This paper presents a review of firewall implementation techniques in MANETs and their relative merits and demerits. A new approach is proposed to select MANET nodes at random for firewall implementation. This approach randomly select a new node as firewall after fixed time and based on critical value of certain parameters like power backup. This approach effectively balances power and resource utilization of entire MANET because responsibility of implementing firewall is equally shared among all the nodes. At the same time it ensures improved security for MANETs from outside attacks as intruder will not be able to find out the entry point in MANET due to the random selection of nodes for firewall implementation.

Clustering Financial Time Series by Network Community Analysis

NASA Astrophysics Data System (ADS)

Piccardi, Carlo; Calatroni, Lisa; Bertoni, Fabio

In this paper, we describe a method for clustering financial time series which is based on community analysis, a recently developed approach for partitioning the nodes of a network (graph). A network with N nodes is associated to the set of N time series. The weight of the link (i, j), which quantifies the similarity between the two corresponding time series, is defined according to a metric based on symbolic time series analysis, which has recently proved effective in the context of financial time series. Then, searching for network communities allows one to identify groups of nodes (and then time series) with strong similarity. A quantitative assessment of the significance of the obtained partition is also provided. The method is applied to two distinct case-studies concerning the US and Italy Stock Exchange, respectively. In the US case, the stability of the partitions over time is also thoroughly investigated. The results favorably compare with those obtained with the standard tools typically used for clustering financial time series, such as the minimal spanning tree and the hierarchical tree.

A Random Walk Approach to Query Informative Constraints for Clustering.

PubMed

Abin, Ahmad Ali

2017-08-09

This paper presents a random walk approach to the problem of querying informative constraints for clustering. The proposed method is based on the properties of the commute time, that is the expected time taken for a random walk to travel between two nodes and return, on the adjacency graph of data. Commute time has the nice property of that, the more short paths connect two given nodes in a graph, the more similar those nodes are. Since computing the commute time takes the Laplacian eigenspectrum into account, we use this property in a recursive fashion to query informative constraints for clustering. At each recursion, the proposed method constructs the adjacency graph of data and utilizes the spectral properties of the commute time matrix to bipartition the adjacency graph. Thereafter, the proposed method benefits from the commute times distance on graph to query informative constraints between partitions. This process iterates for each partition until the stop condition becomes true. Experiments on real-world data show the efficiency of the proposed method for constraints selection.

Fuzzy Logic-Based Guaranteed Lifetime Protocol for Real-Time Wireless Sensor Networks

PubMed Central

Shah, Babar; Iqbal, Farkhund; Abbas, Ali; Kim, Ki-Il

2015-01-01

Few techniques for guaranteeing a network lifetime have been proposed despite its great impact on network management. Moreover, since the existing schemes are mostly dependent on the combination of disparate parameters, they do not provide additional services, such as real-time communications and balanced energy consumption among sensor nodes; thus, the adaptability problems remain unresolved among nodes in wireless sensor networks (WSNs). To solve these problems, we propose a novel fuzzy logic model to provide real-time communication in a guaranteed WSN lifetime. The proposed fuzzy logic controller accepts the input descriptors energy, time and velocity to determine each node’s role for the next duration and the next hop relay node for real-time packets. Through the simulation results, we verified that both the guaranteed network’s lifetime and real-time delivery are efficiently ensured by the new fuzzy logic model. In more detail, the above-mentioned two performance metrics are improved up to 8%, as compared to our previous work, and 14% compared to existing schemes, respectively. PMID:26295238

Topology control algorithm for wireless sensor networks based on Link forwarding

NASA Astrophysics Data System (ADS)

Pucuo, Cairen; Qi, Ai-qin

2018-03-01

The research of topology control could effectively save energy and increase the service life of network based on wireless sensor. In this paper, a arithmetic called LTHC (link transmit hybrid clustering) based on link transmit is proposed. It decreases expenditure of energy by changing the way of cluster-node’s communication. The idea is to establish a link between cluster and SINK node when the cluster is formed, and link-node must be non-cluster. Through the link, cluster sends information to SINK nodes. For the sake of achieving the uniform distribution of energy on the network, prolongate the network survival time, and improve the purpose of communication, the communication will cut down much more expenditure of energy for cluster which away from SINK node. In the two aspects of improving the traffic and network survival time, we find that the LTCH is far superior to the traditional LEACH by experiments.

Distributed Synchronization Technique for OFDMA-Based Wireless Mesh Networks Using a Bio-Inspired Algorithm

PubMed Central

Kim, Mi Jeong; Maeng, Sung Joon; Cho, Yong Soo

2015-01-01

In this paper, a distributed synchronization technique based on a bio-inspired algorithm is proposed for an orthogonal frequency division multiple access (OFDMA)-based wireless mesh network (WMN) with a time difference of arrival. The proposed time- and frequency-synchronization technique uses only the signals received from the neighbor nodes, by considering the effect of the propagation delay between the nodes. It achieves a fast synchronization with a relatively low computational complexity because it is operated in a distributed manner, not requiring any feedback channel for the compensation of the propagation delays. In addition, a self-organization scheme that can be effectively used to construct 1-hop neighbor nodes is proposed for an OFDMA-based WMN with a large number of nodes. The performance of the proposed technique is evaluated with regard to the convergence property and synchronization success probability using a computer simulation. PMID:26225974

Distributed Synchronization Technique for OFDMA-Based Wireless Mesh Networks Using a Bio-Inspired Algorithm.

PubMed

Kim, Mi Jeong; Maeng, Sung Joon; Cho, Yong Soo

2015-07-28

In this paper, a distributed synchronization technique based on a bio-inspired algorithm is proposed for an orthogonal frequency division multiple access (OFDMA)-based wireless mesh network (WMN) with a time difference of arrival. The proposed time- and frequency-synchronization technique uses only the signals received from the neighbor nodes, by considering the effect of the propagation delay between the nodes. It achieves a fast synchronization with a relatively low computational complexity because it is operated in a distributed manner, not requiring any feedback channel for the compensation of the propagation delays. In addition, a self-organization scheme that can be effectively used to construct 1-hop neighbor nodes is proposed for an OFDMA-based WMN with a large number of nodes. The performance of the proposed technique is evaluated with regard to the convergence property and synchronization success probability using a computer simulation.

Robust pinning control of heterogeneous complex networks with jointly connected topologies and time-varying parametric uncertainty

NASA Astrophysics Data System (ADS)

Manfredi, Sabato

2018-05-01

The pinning/leader control problems provide the design of the leader or pinning controller in order to guide a complex network to a desired trajectory or target (synchronisation or consensus). Let a time-invariant complex network, pinning/leader control problems include the design of the leader or pinning controller gain and number of nodes to pin in order to guide a network to a desired trajectory (synchronization or consensus). Usually, lower is the number of pinned nodes larger is the pinning gain required to assess network synchronisation. On the other side, realistic application scenario of complex networks is characterised by switching topologies, time-varying node coupling strength and link weight that make hard to solve the pinning/leader control problem. Additionally, the system dynamics at nodes can be heterogeneous. In this paper, we derive robust stabilisation conditions of time-varying heterogeneous complex networks with jointly connected topologies when coupling strength and link weight interactions are affected by time-varying uncertainties. By employing Lyapunov stability theory and linear matrix inequality (LMI) technique, we formulate low computationally demanding stabilisability conditions to design a pinning/leader control gain for robust network synchronisation. The effectiveness of the proposed approach is shown by several design examples applied to a paradigmatic well-known complex network composed of heterogeneous Chua's circuits.

Looking into the crystal ball: future device learning using hybrid e-beam and optical lithography (Keynote Paper)

NASA Astrophysics Data System (ADS)

Steen, S. E.; McNab, S. J.; Sekaric, L.; Babich, I.; Patel, J.; Bucchignano, J.; Rooks, M.; Fried, D. M.; Topol, A. W.; Brancaccio, J. R.; Yu, R.; Hergenrother, J. M.; Doyle, J. P.; Nunes, R.; Viswanathan, R. G.; Purushothaman, S.; Rothwell, M. B.

2005-05-01

Semiconductor process development teams are faced with increasing process and integration complexity while the time between lithographic capability and volume production has remained more or less constant over the last decade. Lithography tools have often gated the volume checkpoint of a new device node on the ITRS roadmap. The processes have to be redeveloped after the tooling capability for the new groundrule is obtained since straight scaling is no longer sufficient. In certain cases the time window that the process development teams have is actually decreasing. In the extreme, some forecasts are showing that by the time the 45nm technology node is scheduled for volume production, the tooling vendors will just begin shipping the tools required for this technology node. To address this time pressure, IBM has implemented a hybrid-lithography strategy that marries the advantages of optical lithography (high throughput) with electron beam direct write lithography (high resolution and alignment capability). This hybrid-lithography scheme allows for the timely development of semiconductor processes for the 32nm node, and beyond. In this paper we will describe how hybrid lithography has enabled early process integration and device learning and how IBM applied e-beam & optical hybrid lithography to create the world's smallest working SRAM cell.

Calibrated birth-death phylogenetic time-tree priors for bayesian inference.

PubMed

Heled, Joseph; Drummond, Alexei J

2015-05-01

Here we introduce a general class of multiple calibration birth-death tree priors for use in Bayesian phylogenetic inference. All tree priors in this class separate ancestral node heights into a set of "calibrated nodes" and "uncalibrated nodes" such that the marginal distribution of the calibrated nodes is user-specified whereas the density ratio of the birth-death prior is retained for trees with equal values for the calibrated nodes. We describe two formulations, one in which the calibration information informs the prior on ranked tree topologies, through the (conditional) prior, and the other which factorizes the prior on divergence times and ranked topologies, thus allowing uniform, or any arbitrary prior distribution on ranked topologies. Although the first of these formulations has some attractive properties, the algorithm we present for computing its prior density is computationally intensive. However, the second formulation is always faster and computationally efficient for up to six calibrations. We demonstrate the utility of the new class of multiple-calibration tree priors using both small simulations and a real-world analysis and compare the results to existing schemes. The two new calibrated tree priors described in this article offer greater flexibility and control of prior specification in calibrated time-tree inference and divergence time dating, and will remove the need for indirect approaches to the assessment of the combined effect of calibration densities and tree priors in Bayesian phylogenetic inference. © The Author(s) 2014. Published by Oxford University Press, on behalf of the Society of Systematic Biologists.

Distributed Channel Allocation and Time Slot Optimization for Green Internet of Things.

PubMed

Ding, Kaiqi; Zhao, Haitao; Hu, Xiping; Wei, Jibo

2017-10-28

In sustainable smart cities, power saving is a severe challenge in the energy-constrained Internet of Things (IoT). Efficient utilization of limited multiple non-overlap channels and time resources is a promising solution to reduce the network interference and save energy consumption. In this paper, we propose a joint channel allocation and time slot optimization solution for IoT. First, we propose a channel ranking algorithm which enables each node to rank its available channels based on the channel properties. Then, we propose a distributed channel allocation algorithm so that each node can choose a proper channel based on the channel ranking and its own residual energy. Finally, the sleeping duration and spectrum sensing duration are jointly optimized to maximize the normalized throughput and satisfy energy consumption constraints simultaneously. Different from the former approaches, our proposed solution requires no central coordination or any global information that each node can operate based on its own local information in a total distributed manner. Also, theoretical analysis and extensive simulations have validated that when applying our solution in the network of IoT: (i) each node can be allocated to a proper channel based on the residual energy to balance the lifetime; (ii) the network can rapidly converge to a collision-free transmission through each node's learning ability in the process of the distributed channel allocation; and (iii) the network throughput is further improved via the dynamic time slot optimization.

Simulation of Detecting Damage in Composite Stiffened Panel Using Lamb Waves

NASA Technical Reports Server (NTRS)

Wang, John T.; Ross, Richard W.; Huang, Guo L.; Yuan, Fuh G.

2013-01-01

Lamb wave damage detection in a composite stiffened panel is simulated by performing explicit transient dynamic finite element analyses and using signal imaging techniques. This virtual test process does not need to use real structures, actuators/sensors, or laboratory equipment. Quasi-isotropic laminates are used for the stiffened panels. Two types of damage are studied. One type is a damage in the skin bay and the other type is a debond between the stiffener flange and the skin. Innovative approaches for identifying the damage location and imaging the damage were developed. The damage location is identified by finding the intersection of the damage locus and the path of the time reversal wave packet re-emitted from the sensor nodes. The damage locus is a circle that envelops the potential damage locations. Its center is at the actuator location and its radius is computed by multiplying the group velocity by the time of flight to damage. To create a damage image for estimating the size of damage, a group of nodes in the neighborhood of the damage location is identified for applying an image condition. The image condition, computed at a finite element node, is the zero-lag cross-correlation (ZLCC) of the time-reversed incident wave signal and the time reversal wave signal from the sensor nodes. This damage imaging process is computationally efficient since only the ZLCC values of a small amount of nodes in the neighborhood of the identified damage location are computed instead of those of the full model.

An efficient collaborative approach for black hole attack discovery and mitigating its impact in manet

NASA Astrophysics Data System (ADS)

Devipriya, K.; Ivy, B. Persis Urbana; Prabha, D.

2018-04-01

A mobile ad hoc network (MANET) is an assemblage of nodes composed of mobile devices coupled in various ways wirelessly which do not have any central administration. Each node in MANET cooperates in forwarding packets in the network. This type of collaboration incurs high cost but there exits nodes that declines to cooperate leading to selfish conduct of nodes which effects overall network performance. To discover the attacks caused by such nodes, a renowned mechanism using watchdog can be deployed. In infrastructure less network attack detection and reaction and high false positives, false negatives initiating black hole attack becomes major issue in watchdog. This paper put forward a collaborative approach for identifying such attacks in MANET. Through abstract analysis and extensive simulation of this approach, the detection time of misbehaved nodes is reduced and substantial enhancement in overhead and throughput is witnessed.

Model Checking a Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2011-01-01

This report presents the mechanical verification of a self-stabilizing distributed clock synchronization protocol for arbitrary digraphs in the absence of faults. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. The system under study is an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period.

Automatic detection of axillary lymphadenopathy on CT scans of untreated chronic lymphocytic leukemia patients

NASA Astrophysics Data System (ADS)

Liu, Jiamin; Hua, Jeremy; Chellappa, Vivek; Petrick, Nicholas; Sahiner, Berkman; Farooqui, Mohammed; Marti, Gerald; Wiestner, Adrian; Summers, Ronald M.

2012-03-01

Patients with chronic lymphocytic leukemia (CLL) have an increased frequency of axillary lymphadenopathy. Pretreatment CT scans can be used to upstage patients at the time of presentation and post-treatment CT scans can reduce the number of complete responses. In the current clinical workflow, the detection and diagnosis of lymph nodes is usually performed manually by examining all slices of CT images, which can be time consuming and highly dependent on the observer's experience. A system for automatic lymph node detection and measurement is desired. We propose a computer aided detection (CAD) system for axillary lymph nodes on CT scans in CLL patients. The lung is first automatically segmented and the patient's body in lung region is extracted to set the search region for lymph nodes. Multi-scale Hessian based blob detection is then applied to detect potential lymph nodes within the search region. Next, the detected potential candidates are segmented by fast level set method. Finally, features are calculated from the segmented candidates and support vector machine (SVM) classification is utilized for false positive reduction. Two blobness features, Frangi's and Li's, are tested and their free-response receiver operating characteristic (FROC) curves are generated to assess system performance. We applied our detection system to 12 patients with 168 axillary lymph nodes measuring greater than 10 mm. All lymph nodes are manually labeled as ground truth. The system achieved sensitivities of 81% and 85% at 2 false positives per patient for Frangi's and Li's blobness, respectively.

Identifying Nodes of Transmission in Disease Diffusion Through Social Media

NASA Astrophysics Data System (ADS)

Lamb, David Sebastian

The spread of infectious diseases can be described in terms of three interrelated components: interaction, movement, and scale. Transmission between individuals requires some form of interaction, which is dependent on the pathogen, to occur. Diseases spread through the movement of their hosts; they spread across many spatial scales from local neighborhoods to countries, or temporal scales from days to years, or periodic intervals. Prior research into the spread of disease have examined diffusion processes retrospectively at regional or country levels, or developed differential equation or simulation models of the dynamics of disease transmission. While some of the more recent models incorporate all three components, they are limited in the way they understand where interactions occur. The focus has been on home or work, including contact with family or coworkers. The models reflect a lack of knowledge about how transmissions are made at specific locations in time, so-called nodes of transmission. That is, how individuals' intersections in time and space function in disease transmission. This project sought to use the three factors of interaction, movement, and scale to better understand the spread of disease in terms of the place of interaction called the node of transmission. The overarching objective of this research was: how can nodes of transmission be identified through individual activity spaces incorporating the three factors of infectious disease spread: interaction, movement, and scale?. This objective fed into three main sub-objectives: defining nodes of transmission, developing an appropriate methodology to identifying nodes of transmission, and applying it using geotagged social media data from Twitter. To develop an appropriate framework, this research relied on time geography, and traditional disease. This particularly relied on the idea of bundling to create the nodes, and a nesting effect that integrated scale. The data source used to identify nodes of transmission was collected from Twitter for the Los Angeles County, USA, area from October 2015 to February 2016. Automated text classification was used to identify messages where users self-reported an influenza-like-illness. Different groupings were created that combined both the syndrome and the symptoms of influenza, and applied to the automated classification. The use of Twitter for small-area health analysis was evaluated along with different text classification methodologies. A space-time hierarchical clustering technique was adapted to be applied towards the twitter data in both identifying nodes of transmission and identifying spatiotemporal contact networks. This clustering data was applied to the classified Twitter data to look at where interaction between the classified users were occurring. This pointed to six nodes that were typically densely populated areas that saw the merging of large groups of people in Los Angeles (e.g. Disneyland and Hollywood Boulevard).The movement of these individuals were also examined by using a edit distance to compare their visits to different clusters and nodes.

A Hierarchical Bayesian Model for Calibrating Estimates of Species Divergence Times

PubMed Central

Heath, Tracy A.

2012-01-01

In Bayesian divergence time estimation methods, incorporating calibrating information from the fossil record is commonly done by assigning prior densities to ancestral nodes in the tree. Calibration prior densities are typically parametric distributions offset by minimum age estimates provided by the fossil record. Specification of the parameters of calibration densities requires the user to quantify his or her prior knowledge of the age of the ancestral node relative to the age of its calibrating fossil. The values of these parameters can, potentially, result in biased estimates of node ages if they lead to overly informative prior distributions. Accordingly, determining parameter values that lead to adequate prior densities is not straightforward. In this study, I present a hierarchical Bayesian model for calibrating divergence time analyses with multiple fossil age constraints. This approach applies a Dirichlet process prior as a hyperprior on the parameters of calibration prior densities. Specifically, this model assumes that the rate parameters of exponential prior distributions on calibrated nodes are distributed according to a Dirichlet process, whereby the rate parameters are clustered into distinct parameter categories. Both simulated and biological data are analyzed to evaluate the performance of the Dirichlet process hyperprior. Compared with fixed exponential prior densities, the hierarchical Bayesian approach results in more accurate and precise estimates of internal node ages. When this hyperprior is applied using Markov chain Monte Carlo methods, the ages of calibrated nodes are sampled from mixtures of exponential distributions and uncertainty in the values of calibration density parameters is taken into account. PMID:22334343

Occult lymph node metastasis and risk of regional recurrence in papillary thyroid cancer after bilateral prophylactic central neck dissection: A multi-institutional study.

PubMed

Lee, Young Chan; Na, Se Young; Park, Gi Cheol; Han, Ju Hyun; Kim, Seung Woo; Eun, Young Gyu

2017-02-01

The impact of occult lymph node metastasis on regional recurrence after prophylactic central neck dissection for preoperative, nodal-negative papillary thyroid cancer is controversial. We investigated risk factors for regional lymph node recurrence in papillary thyroid cancer patients who underwent total thyroidectomy and bilateral prophylactic central neck dissection. Analysis was according to clinicopathologic characteristics and occult lymph node metastasis patterns. This multicenter study enrolled 211 consecutive patients who underwent total thyroidectomy with bilateral prophylactic central neck dissection for papillary thyroid cancer without evidence of central lymph node metastasis on preoperative imaging. Clinicopathologic features and central lymph node metastasis patterns were analyzed for predicting regional recurrence. Multivariate Cox regression analysis was used to identify independent factors for recurrence. Median follow-up time was 43 months (24-95 months). Ten patients (4.7%) showed regional lymph node recurrence. The estimated 5-year, regional recurrence-free survival was 95.2%. Tumor size ≥1 cm, central lymph node metastasis, lymph node ratio, and prelaryngeal lymph node metastasis were associated with regional recurrence in univariate analysis (P < .05). In multivariate analysis, a lymph node ratio ≥ 0.26 was a significant risk factor for regional lymph node recurrence (odds ratio = 11.63, P = .003). Lymph node ratio ≥ 0.26 was an independent predictor of worse recurrence-free survival on Cox regression analysis (hazard ratio = 11.49, P = .002). Although no significant association was observed between the presence of occult lymph node metastasis and regional recurrence, lymph node ratio ≥ 0.26 was an independent predictor of regional lymph node recurrence in papillary thyroid cancer patients who underwent total thyroidectomy and bilateral prophylactic central neck dissection. Copyright © 2016 Elsevier Inc. All rights reserved.

Centrality measures in temporal networks with time series analysis

NASA Astrophysics Data System (ADS)

Huang, Qiangjuan; Zhao, Chengli; Zhang, Xue; Wang, Xiaojie; Yi, Dongyun

2017-05-01

The study of identifying important nodes in networks has a wide application in different fields. However, the current researches are mostly based on static or aggregated networks. Recently, the increasing attention to networks with time-varying structure promotes the study of node centrality in temporal networks. In this paper, we define a supra-evolution matrix to depict the temporal network structure. With using of the time series analysis, the relationships between different time layers can be learned automatically. Based on the special form of the supra-evolution matrix, the eigenvector centrality calculating problem is turned into the calculation of eigenvectors of several low-dimensional matrices through iteration, which effectively reduces the computational complexity. Experiments are carried out on two real-world temporal networks, Enron email communication network and DBLP co-authorship network, the results of which show that our method is more efficient at discovering the important nodes than the common aggregating method.

Temporal percolation of the susceptible network in an epidemic spreading.

PubMed

Valdez, Lucas Daniel; Macri, Pablo Alejandro; Braunstein, Lidia Adriana

2012-01-01

In this work, we study the evolution of the susceptible individuals during the spread of an epidemic modeled by the susceptible-infected-recovered (SIR) process spreading on the top of complex networks. Using an edge-based compartmental approach and percolation tools, we find that a time-dependent quantity ΦS(t), namely, the probability that a given neighbor of a node is susceptible at time t, is the control parameter of a node void percolation process involving those nodes on the network not-reached by the disease. We show that there exists a critical time t(c) above which the giant susceptible component is destroyed. As a consequence, in order to preserve a macroscopic connected fraction of the network composed by healthy individuals which guarantee its functionality, any mitigation strategy should be implemented before this critical time t(c). Our theoretical results are confirmed by extensive simulations of the SIR process.

Binocular Goggle Augmented Imaging and Navigation System provides real-time fluorescence image guidance for tumor resection and sentinel lymph node mapping

NASA Astrophysics Data System (ADS)

B. Mondal, Suman; Gao, Shengkui; Zhu, Nan; Sudlow, Gail P.; Liang, Kexian; Som, Avik; Akers, Walter J.; Fields, Ryan C.; Margenthaler, Julie; Liang, Rongguang; Gruev, Viktor; Achilefu, Samuel

2015-07-01

The inability to identify microscopic tumors and assess surgical margins in real-time during oncologic surgery leads to incomplete tumor removal, increases the chances of tumor recurrence, and necessitates costly repeat surgery. To overcome these challenges, we have developed a wearable goggle augmented imaging and navigation system (GAINS) that can provide accurate intraoperative visualization of tumors and sentinel lymph nodes in real-time without disrupting normal surgical workflow. GAINS projects both near-infrared fluorescence from tumors and the natural color images of tissue onto a head-mounted display without latency. Aided by tumor-targeted contrast agents, the system detected tumors in subcutaneous and metastatic mouse models with high accuracy (sensitivity = 100%, specificity = 98% ± 5% standard deviation). Human pilot studies in breast cancer and melanoma patients using a near-infrared dye show that the GAINS detected sentinel lymph nodes with 100% sensitivity. Clinical use of the GAINS to guide tumor resection and sentinel lymph node mapping promises to improve surgical outcomes, reduce rates of repeat surgery, and improve the accuracy of cancer staging.

A Monitoring System for Vegetable Greenhouses based on a Wireless Sensor Network

PubMed Central

Li, Xiu-hong; Cheng, Xiao; Yan, Ke; Gong, Peng

2010-01-01

A wireless sensor network-based automatic monitoring system is designed for monitoring the life conditions of greenhouse vegetatables. The complete system architecture includes a group of sensor nodes, a base station, and an internet data center. For the design of wireless sensor node, the JN5139 micro-processor is adopted as the core component and the Zigbee protocol is used for wireless communication between nodes. With an ARM7 microprocessor and embedded ZKOS operating system, a proprietary gateway node is developed to achieve data influx, screen display, system configuration and GPRS based remote data forwarding. Through a Client/Server mode the management software for remote data center achieves real-time data distribution and time-series analysis. Besides, a GSM-short-message-based interface is developed for sending real-time environmental measurements, and for alarming when a measurement is beyond some pre-defined threshold. The whole system has been tested for over one year and satisfactory results have been observed, which indicate that this system is very useful for greenhouse environment monitoring. PMID:22163391

Optimal Quantum Spatial Search on Random Temporal Networks

NASA Astrophysics Data System (ADS)

Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

2017-12-01

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G (n ,p ), where p is the probability that any two given nodes are connected: After every time interval τ , a new graph G (n ,p ) replaces the previous one. We prove analytically that, for any given p , there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O (√{n }), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

Whole-body nonenhanced PET/MR versus PET/CT in the staging and restaging of cancers: preliminary observations.

PubMed

Huellner, Martin W; Appenzeller, Philippe; Kuhn, Félix P; Husmann, Lars; Pietsch, Carsten M; Burger, Irene A; Porto, Miguel; Delso, Gaspar; von Schulthess, Gustav K; Veit-Haibach, Patrick

2014-12-01

To assess the diagnostic performance of whole-body non-contrast material-enhanced positron emission tomography (PET)/magnetic resonance (MR) imaging and PET/computed tomography (CT) for staging and restaging of cancers and provide guidance for modality and sequence selection. This study was approved by the institutional review board and national government authorities. One hundred six consecutive patients (median age, 68 years; 46 female and 60 male patients) referred for staging or restaging of oncologic malignancies underwent whole-body imaging with a sequential trimodality PET/CT/MR system. The MR protocol included short inversion time inversion-recovery ( STIR short inversion time inversion-recovery ), Dixon-type liver accelerated volume acquisition ( LAVA liver accelerated volume acquisition ; GE Healthcare, Waukesha, Wis), and respiratory-gated periodically rotated overlapping parallel lines with enhanced reconstruction ( PROPELLER periodically rotated overlapping parallel lines with enhanced reconstruction ; GE Healthcare) sequences. Primary tumors (n = 43), local lymph node metastases (n = 74), and distant metastases (n = 66) were evaluated for conspicuity (scored 0-4), artifacts (scored 0-2), and reader confidence on PET/CT and PET/MR images. Subanalysis for lung lesions (n = 46) was also performed. Relevant incidental findings with both modalities were compared. Interreader agreement was analyzed with intraclass correlation coefficients and κ statistics. Lesion conspicuity, image artifacts, and incidental findings were analyzed with nonparametric tests. Primary tumors were less conspicuous on STIR short inversion time inversion-recovery (3.08, P = .016) and LAVA liver accelerated volume acquisition (2.64, P = .002) images than on CT images (3.49), while findings with the PROPELLER periodically rotated overlapping parallel lines with enhanced reconstruction sequence (3.70, P = .436) were comparable to those at CT. In distant metastases, the PROPELLER periodically rotated overlapping parallel lines with enhanced reconstruction sequence (3.84) yielded better results than CT (2.88, P < .001). Subanalysis for lung lesions yielded similar results (primary lung tumors: CT, 3.71; STIR short inversion time inversion-recovery , 3.32 [P = .014]; LAVA liver accelerated volume acquisition , 2.52 [P = .002]; PROPELLER periodically rotated overlapping parallel lines with enhanced reconstruction , 3.64 [P = .546]). Readers classified lesions more confidently with PET/MR than PET/CT. However, PET/CT showed more incidental findings than PET/MR (P = .039), especially in the lung (P < .001). MR images had more artifacts than CT images. PET/MR performs comparably to PET/CT in whole-body oncology and neoplastic lung disease, with the use of appropriate sequences. Further studies are needed to define regionalized PET/MR protocols with sequences tailored to specific tumor entities. © RSNA, 2014 Online supplemental material is available for this article.

Application Level Processing for Long-Lived and Information Rich Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Wilkins, R.; Gaura, E.; Brusey, J.

2013-12-01

A primary design goal in Wireless Sensor Networks (WSNs) is to ensure the longest possible node lifetime with the available power budget while still meeting application requirements. Since radio transmissions often consume the most power in WSN devices, it follows that a node should aim to maximise its lifetime by transmitting only the data or information required to enable the motivating application. Full raw data streams are often not required since summaries of data are sufficient to meet application needs summaries are often performed at a central point after collection). When raw data is not a requirement, it makes sense to perform as much application-specific processing on-node as possible to minimise the amount of transmissions a node must make. For example, in home environment monitoring, the amount of time a room spends within an acceptable temperature range is more important than the raw stream of temperature measurements. The work presents Bare Necessities (BN) which implements the calculation of application-specific summaries on-node. In the case of knowing the amount time a room spends within an acceptable temperature range, BN encodes the raw signal as a distribution over bins (e.g. a bin might comprise temperatures between 18 °C and 22 °C). BN conserves power by only transmitting when changes to the distribution occur only sending the bare necessities of information the end user is interested in (thus the algorithm name). In the case of home monitoring it has been shown that BN can lead to a packet transmission reduction of 99.98%, increasing a nodes lifetime by a factor of 14 when compared to sense-and-send nodes. A summary of the Bare Necessities process at the node.

Analytic Modeling of Pressurization and Cryogenic Propellant

NASA Technical Reports Server (NTRS)

Corpening, Jeremy H.

2010-01-01

An analytic model for pressurization and cryogenic propellant conditions during all mission phases of any liquid rocket based vehicle has been developed and validated. The model assumes the propellant tanks to be divided into five nodes and also implements an empirical correlation for liquid stratification if desired. The five nodes include a tank wall node exposed to ullage gas, an ullage gas node, a saturated propellant vapor node at the liquid-vapor interface, a liquid node, and a tank wall node exposed to liquid. The conservation equations of mass and energy are then applied across all the node boundaries and, with the use of perfect gas assumptions, explicit solutions for ullage and liquid conditions are derived. All fluid properties are updated real time using NIST Refprop.1 Further, mass transfer at the liquid-vapor interface is included in the form of evaporation, bulk boiling of liquid propellant, and condensation given the appropriate conditions for each. Model validation has proven highly successful against previous analytic models and various Saturn era test data and reasonably successful against more recent LH2 tank self pressurization ground test data. Finally, this model has been applied to numerous design iterations for the Altair Lunar Lander, Ares V Core Stage, and Ares V Earth Departure Stage in order to characterize Helium and autogenous pressurant requirements, propellant lost to evaporation and thermodynamic venting to maintain propellant conditions, and non-uniform tank draining in configurations utilizing multiple LH2 or LO2 propellant tanks. In conclusion, this model provides an accurate and efficient means of analyzing multiple design configurations for any cryogenic propellant tank in launch, low-acceleration coast, or in-space maneuvering and supplies the user with pressurization requirements, unusable propellants from evaporation and liquid stratification, and general ullage gas, liquid, and tank wall conditions as functions of time.

Near-Infrared Lymphatic Mapping of the Recurrent Laryngeal Nerve Nodes in T1 Esophageal Cancer.

PubMed

Park, Seong Yong; Suh, Jee Won; Kim, Dae Joon; Park, Jun Chul; Kim, Eun Hye; Lee, Chang Young; Lee, Jin Gu; Paik, Hyo Chae; Chung, Kyoung Young

2018-06-01

It is still unclear that dissection of recurrent laryngeal nerve nodes is mandatory in patients with cT1 middle or lower thoracic esophageal squamous cell carcinoma when the nodes are negative in preoperative staging workup. We aimed to evaluate the feasibility of near-infrared image-guided lymphatic mapping of bilateral recurrent laryngeal nerve nodes. The day before operation, we injected indocyanine green (ICG) into the submucosal layer by endoscopy. At the time of upper mediastinal dissection, ICG-stained basins were identified along the bilateral recurrent laryngeal nerves and retrieved under guidance of the Firefly system. After the operation, remnant ICG-unstained basins were dissected from the specimen to assess the presence of metastasis. Of 29 patients enrolled, ICG-stained basins could be identified in 25 patients (86.2%), and 6 of them (24.0%) had nodal metastasis; 4 in the right recurrent laryngeal nerve chain, 1 in the left recurrent laryngeal nerve chain, and 1 in both recurrent laryngeal nerve chains. On pathologic examination of 345 recurrent laryngeal nerve nodes, two metastatic nodes were identified in ICG-unstained basins along the left recurrent laryngeal nerve in a patient who had lymph node metastases in ICG-stained basins along both recurrent laryngeal nerves. Negative predictive value in detection of nodal metastasis was 100% for the right recurrent laryngeal nerve chain and 98.2% for the left recurrent laryngeal nerve chain. Real-time assessment of recurrent laryngeal nerve nodes with near-infrared image was technically feasible, and we could detect lymphatic basins that most likely have nodal metastasis. Our technique might be useful in determining the optimal extent of lymphadenectomy. Copyright © 2018 The Society of Thoracic Surgeons. Published by Elsevier Inc. All rights reserved.

Brain Network Changes and Memory Decline in Aging

PubMed Central

Beason-Held, Lori L.; Hohman, Timothy J.; Venkatraman, Vijay; An, Yang; Resnick, Susan M.

2016-01-01

One theory of age-related cognitive decline proposes that changes within the default mode network (DMN) of the brain impact the ability to successfully perform cognitive operations. To investigate this theory, we examined functional covariance within brain networks using regional cerebral blood flow data, measured by 15O-water PET, from 99 participants (mean baseline age 68.6 ±7.5) in the Baltimore Longitudinal Study of Aging collected over a 7.4 year period. The sample was divided in tertiles based on longitudinal performance on a verbal recognition memory task administered during scanning, and functional covariance was compared between the upper (improvers) and lower (decliners) tertile groups. The DMN and verbal memory networks (VMN) were then examined during the verbal memory scan condition. For each network, group differences in node-to-network coherence and individual node-to-node covariance relationships were assessed at baseline and in change over time. Compared with improvers, decliners showed differences in node-to-network coherence and in node-to-node relationships in the DMN but not the VMN during verbal memory. These DMN differences reflected greater covariance with better task performance at baseline and both increasing and declining covariance with declining task performance over time for decliners. When examined during the resting state alone, the direction of change in DMN covariance was similar to that seen during task performance, but node-to-node relationships differed from those observed during the task condition. These results suggest that disengagement of DMN components during task performance is not essential for successful cognitive performance as previously proposed. Instead, a proper balance in network processes may be needed to support optimal task performance. PMID:27319002

Energy-Efficient Querying of Wireless Sensor Networks

DTIC Science & Technology

2007-09-01

will fail to locate the desired information. Depending on the rate of node movement , this data exchange will be costly in terms of total network...nodes is best accomplished using a small time window to reduce errors introduced by the node’s movement (i.e., older measurements are less likely to...embedded processor or input from upper layer applications,” nodes which detect their own movement transmit an alert signal over a “wake-up” channel

TRIO: Burst Buffer Based I/O Orchestration

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wang, Teng; Oral, H Sarp; Pritchard, Michael

The growing computing power on leadership HPC systems is often accompanied by ever-escalating failure rates. Checkpointing is a common defensive mechanism used by scientific applications for failure recovery. However, directly writing the large and bursty checkpointing dataset to parallel filesystem can incur significant I/O contention on storage servers. Such contention in turn degrades the raw bandwidth utilization of storage servers and prolongs the average job I/O time of concurrent applications. Recently burst buffer has been proposed as an intermediate layer to absorb the bursty I/O traffic from compute nodes to storage backend. But an I/O orchestration mechanism is still desiredmore » to efficiently move checkpointing data from bursty buffers to storage backend. In this paper, we propose a burst buffer based I/O orchestration framework, named TRIO, to intercept and reshape the bursty writes for better sequential write traffic to storage severs. Meanwhile, TRIO coordinates the flushing orders among concurrent burst buffers to alleviate the contention on storage server bandwidth. Our experimental results reveal that TRIO can deliver 30.5% higher bandwidth and reduce the average job I/O time by 37% on average for data-intensive applications in various checkpointing scenarios.« less

The application of enhanced recovery after surgery (ERAS)/fast-track surgery in gastrectomy for gastric cancer: a systematic review and meta-analysis

PubMed Central

Ding, Jie; Sun, Benlong; Song, Peng; Liu, Song; Chen, Hong; Feng, Min; Guan, Wenxian

2017-01-01

Background The study aimed to compare the safety and effectiveness of Enhanced recovery after surgery (ERAS) with conventional care in gastrectomy for gastric cancer. Methods Search strategy from Pubmed, Embase, Web of science, Cochrane library and reference lists was performed. The collected studies were randomized controlled trials and published only in English, and undergoing ERAS in gastrectomy for gastric cancer from January 1994 to August 2016. Results A total of eight studies including 801 patients were included. There were 399 cases in the ERAS and 402 cases in the conventional care groups. Meta-analysis showed that time to first passage of flatus (weighted mean difference (WMD) -14.57; 95% confidence interval (CI) -20.31 to -8.83, p<0.00001), level of C-reaction protein (WMD -19.46; 95 % CI -21.74 to -17.18, p<0.00001) and interleukin-6 (WMD-32.16; 95 % CI -33.86 to -30.46,p<0.00001) on postoperative days, postoperative hospital stay (WMD -1.85; 95 % CI -2.35 to -1.35, p<0.00001), hospital charge (WMD −0.94, 95 % CI, −1.40 to 0.49, p<0.0001) were significantly decreased for ERAS, but increased readmission rates (odds ratio (OR), 3.42, 95 % CI, 1.43 to 8.21, P=0.006). There were no statistically significant differences in intraoperative blood loss, operation time, number of retrieved lymph nodes, duration of foley catheter and postoperative complications (p>0.05). Conclusions ERAS is considered to be safe and effective in gastrectomy for gastric cancer. Further larger, multicenter and randomized trials were needed to beresearched. PMID:29088903

Node, Node-Link, and Node-Link-Group Diagrams: An Evaluation.

PubMed

Saket, Bahador; Simonetto, Paolo; Kobourov, Stephen; Börner, Katy

2014-12-01

Effectively showing the relationships between objects in a dataset is one of the main tasks in information visualization. Typically there is a well-defined notion of distance between pairs of objects, and traditional approaches such as principal component analysis or multi-dimensional scaling are used to place the objects as points in 2D space, so that similar objects are close to each other. In another typical setting, the dataset is visualized as a network graph, where related nodes are connected by links. More recently, datasets are also visualized as maps, where in addition to nodes and links, there is an explicit representation of groups and clusters. We consider these three Techniques, characterized by a progressive increase of the amount of encoded information: node diagrams, node-link diagrams and node-link-group diagrams. We assess these three types of diagrams with a controlled experiment that covers nine different tasks falling broadly in three categories: node-based tasks, network-based tasks and group-based tasks. Our findings indicate that adding links, or links and group representations, does not negatively impact performance (time and accuracy) of node-based tasks. Similarly, adding group representations does not negatively impact the performance of network-based tasks. Node-link-group diagrams outperform the others on group-based tasks. These conclusions contradict results in other studies, in similar but subtly different settings. Taken together, however, such results can have significant implications for the design of standard and domain snecific visualizations tools.

Breast cancer sentinel node scintigraphy: differences between imaging results 1 and 2 h after injection.

PubMed

Wondergem, Maurits; Hobbelink, Monique G G; Witkamp, Arjen J; van Hillegersberg, Richard; de Keizer, Bart

2012-11-01

Timing of image acquisition in breast cancer sentinel node scintigraphy remains a subject of debate. Therefore, the performance of our protocol in which images are acquired 1 and 2 h after injection was evaluated. The results of sentinel node scintigraphy 1 and 2 h after injection were compared with regard to the sentinel lymph nodes visualized. We studied 132 patients who were consecutively referred for sentinel lymph node biopsy. 99mTc-albumine nanocolloid (120 MBq) was injected peritumourally into patients with palpable tumours and intratumourally into patients with nonpalpable tumours. All scintigraphic images taken for the sentinel node procedure were evaluated. The number of sentinel nodes per anatomic localization and the interpretability of the images were scored. A total of 132 patients underwent sentinel node scintigraphy 1 h after injection. Of these, 117 patients also underwent sentinel node scintigraphy 2 h after injection. An axillary sentinel node was visualized in 79.5 and 95.7% of patients, respectively, 1 and 2 h after injection. In 20.5% of the patients the images acquired 1 h after injection did not show a sentinel node. Furthermore, in all procedures, the images 1 h after injection were of no added value to those acquired 2 h after injection. Scintigraphic imaging 2 h after a single peritumoural or intratumoural administration of about 120 MBq 99mTc-albumine nanocolloid yields an axillary sentinel node in over 95% of cases. Imaging 1 h after injection is of no additional value and can be omitted.

Indocyanine green SPY elite-assisted sentinel lymph node biopsy in cutaneous melanoma.

PubMed

Korn, Jason M; Tellez-Diaz, Alejandra; Bartz-Kurycki, Marisa; Gastman, Brian

2014-04-01

Sentinel lymph node biopsy is the standard of care for intermediate-depth and high-risk thin melanomas. Recently, indocyanine green and near-infrared imaging have been used to aid in sentinel node biopsy. The present study aimed to determine the feasibility of sentinel lymph node biopsy with indocyanine green SPY Elite navigation and to critically evaluate the technique compared with the standard modalities. A retrospective review of 90 consecutive cutaneous melanoma patients who underwent sentinel lymph node biopsy was performed. Two cohorts were formed: group A, which had sentinel lymph node biopsy performed with blue dye and radioisotope; and group B, which had sentinel lymph node biopsy performed with radioisotope and indocyanine green SPY Elite navigation. The cohorts were compared to assess for differences in localization rates, sensitivity and specificity of sentinel node identification, and length of surgery. The sentinel lymph node localization rate was 79.4 percent using the blue dye method, 98.0 percent using the indocyanine green fluorescence method, and 97.8 percent using the radioisotope/handheld gamma probe method. Indocyanine green fluorescence detected more sentinel lymph nodes than the vital dye method alone (p = 0.020). A trend toward a reduction in length of surgery was noted in the SPY Elite cohort. Sentinel lymph node mapping and localization in cutaneous melanoma with the indocyanine green SPY Elite navigation system is technically feasible and may offer several advantages over current modalities, including higher sensitivity and specificity, decreased number of lymph nodes sampled, decreased operative time, and potentially lower false-negative rates. Diagnostic, II.

Community detection using preference networks

NASA Astrophysics Data System (ADS)

Tasgin, Mursel; Bingol, Haluk O.

2018-04-01

Community detection is the task of identifying clusters or groups of nodes in a network where nodes within the same group are more connected with each other than with nodes in different groups. It has practical uses in identifying similar functions or roles of nodes in many biological, social and computer networks. With the availability of very large networks in recent years, performance and scalability of community detection algorithms become crucial, i.e. if time complexity of an algorithm is high, it cannot run on large networks. In this paper, we propose a new community detection algorithm, which has a local approach and is able to run on large networks. It has a simple and effective method; given a network, algorithm constructs a preference network of nodes where each node has a single outgoing edge showing its preferred node to be in the same community with. In such a preference network, each connected component is a community. Selection of the preferred node is performed using similarity based metrics of nodes. We use two alternatives for this purpose which can be calculated in 1-neighborhood of nodes, i.e. number of common neighbors of selector node and its neighbors and, the spread capability of neighbors around the selector node which is calculated by the gossip algorithm of Lind et.al. Our algorithm is tested on both computer generated LFR networks and real-life networks with ground-truth community structure. It can identify communities accurately in a fast way. It is local, scalable and suitable for distributed execution on large networks.

Extraperitoneal lymph node dissection in locally advanced cervical cancer; the prognostic factors associated with survival

PubMed Central

Köse, Mehmet Faruk; Kiseli, Mine; Kimyon, Günsu; Öcalan, Reyhan; Yenen, Müfit Cemal; Tulunay, Gökhan; Turan, Ahmet Taner; Üreyen, Işın; Boran, Nurettin

2017-01-01

Objective: Surgical staging was recently recommended for the decision of treatment in locally advanced cervical cancer. We aimed to investigate clinical outcomes as well as factors associated with overall survival (OS) in patients with locally advanced cervical cancer who had undergone extraperitoneal lymph node dissection and were managed according to their lymph node status. Material and Methods: The medical records of 233 women with stage IIb-IVa cervical cancer who were clinically staged and underwent extraperitoneal lymph node dissection were retrospectively reviewed. Paraaortic lymph node status determined the appropriate radiotherapeutic treatment field. Surgery-related complications and clinical outcomes were evaluated. Results: The median age of the patients was 52 years (range, 26-88 years) and the median follow-up time was 28.4 months (range, 3-141 months). Thirty-one patients had laparoscopic extraperitoneal lymph node dissection and 202 patients underwent laparotomy. The number of paraaortic lymph nodes extracted was similar for both techniques. Sixty-two (27%) of the 233 patients had paraaortic lymph node metastases. The 3-year and 5-year OS rates were 55.1% and 46.5%, respectively. The stage of disease, number of metastatic paraaortic lymph nodes, tumor type, and paraaortic lymph node status were associated with OS. In multivariate Cox regression analyses, tumor type, stage, and presence of paraaortic lymph node metastases were the independent prognostic factors of OS. Conclusion: Paraaortic lymph node metastasis is the most important prognostic factor affecting survival. Surgery would give hints about the prognosis and treatment planning of the patient. PMID:28400350

T cells in the lesion of experimental autoimmune encephalomyelitis. Enrichment for reactivities to myelin basic protein and to heat shock proteins.

PubMed Central

Mor, F; Cohen, I R

1992-01-01

To characterize the cellular immune response in an autoimmune lesion, we investigated the accumulation of specific T cells in the central nervous system in actively induced experimental autoimmune encephalomyelitis (EAE) in Lewis rats, using a limiting dilution analysis (LDA) assay for T cells that proliferate in response to antigens. Lymphocytes isolated from the spinal cord infiltrate were compared with cells from the popliteal lymph nodes with respect to frequency of cells responding to basic protein (BP), mycobacterium tuberculosis (MT), the 65-kD heat shock protein (hsp65), allogeneic brown norway spleen cells, and concanavalin A. Additionally, we compared the BP frequency in acute EAE of cells from the spinal cord, peripheral blood, spleen and lymph nodes, and the spinal cord and lymph node after recovery from EAE. We found that acute EAE was associated with marked enrichment of BP-reactive T cells in the spinal cord relative to their frequency in the lymphoid organs and peripheral blood. The infiltrate was also enriched for T cells responding to hsp65; alloreactive T cells, in contrast, were not enriched. The frequency of BP reactive T cells in the spinal cord was highest at the peak of paralysis; however, BP-reactive T cells could still be detected at moderate frequencies after clinical recovery. We established BP- and Mycobacteria-reactive T cell lines from the spinal infiltrates that were CD4+ and TcR alpha beta +. Most of the BP lines were found to react to the major encephalitogenic epitope of guinea pig BP for rats (amino acids 71-90); these lines were found to mediate EAE in naive recipients. T cell lines recognizing other epitopes of BP were not encephalitogenic. All of the lines responsive to Mycobacteria recognized hsp65 or hsp70. These results indicating that the immune infiltrate in active EAE is enriched with cells responding to the autoantigen and to hsp65 were confirmed in EAE adoptively transferred by anti-BP T cell clone. Images PMID:1281835

Color Filtering Localization for Three-Dimensional Underwater Acoustic Sensor Networks

PubMed Central

Liu, Zhihua; Gao, Han; Wang, Wuling; Chang, Shuai; Chen, Jiaxing

2015-01-01

Accurate localization of mobile nodes has been an important and fundamental problem in underwater acoustic sensor networks (UASNs). The detection information returned from a mobile node is meaningful only if its location is known. In this paper, we propose two localization algorithms based on color filtering technology called PCFL and ACFL. PCFL and ACFL aim at collaboratively accomplishing accurate localization of underwater mobile nodes with minimum energy expenditure. They both adopt the overlapping signal region of task anchors which can communicate with the mobile node directly as the current sampling area. PCFL employs the projected distances between each of the task projections and the mobile node, while ACFL adopts the direct distance between each of the task anchors and the mobile node. The proportion factor of distance is also proposed to weight the RGB values. By comparing the nearness degrees of the RGB sequences between the samples and the mobile node, samples can be filtered out. The normalized nearness degrees are considered as the weighted standards to calculate the coordinates of the mobile nodes. The simulation results show that the proposed methods have excellent localization performance and can localize the mobile node in a timely way. The average localization error of PCFL is decreased by about 30.4% compared to the AFLA method. PMID:25774706

Automated Construction of Node Software Using Attributes in a Ubiquitous Sensor Network Environment

PubMed Central

Lee, Woojin; Kim, Juil; Kang, JangMook

2010-01-01

In sensor networks, nodes must often operate in a demanding environment facing restrictions such as restricted computing resources, unreliable wireless communication and power shortages. Such factors make the development of ubiquitous sensor network (USN) applications challenging. To help developers construct a large amount of node software for sensor network applications easily and rapidly, this paper proposes an approach to the automated construction of node software for USN applications using attributes. In the proposed technique, application construction proceeds by first developing a model for the sensor network and then designing node software by setting the values of the predefined attributes. After that, the sensor network model and the design of node software are verified. The final source codes of the node software are automatically generated from the sensor network model. We illustrate the efficiency of the proposed technique by using a gas/light monitoring application through a case study of a Gas and Light Monitoring System based on the Nano-Qplus operating system. We evaluate the technique using a quantitative metric—the memory size of execution code for node software. Using the proposed approach, developers are able to easily construct sensor network applications and rapidly generate a large number of node softwares at a time in a ubiquitous sensor network environment. PMID:22163678

Automated construction of node software using attributes in a ubiquitous sensor network environment.

PubMed

Lee, Woojin; Kim, Juil; Kang, JangMook

2010-01-01

In sensor networks, nodes must often operate in a demanding environment facing restrictions such as restricted computing resources, unreliable wireless communication and power shortages. Such factors make the development of ubiquitous sensor network (USN) applications challenging. To help developers construct a large amount of node software for sensor network applications easily and rapidly, this paper proposes an approach to the automated construction of node software for USN applications using attributes. In the proposed technique, application construction proceeds by first developing a model for the sensor network and then designing node software by setting the values of the predefined attributes. After that, the sensor network model and the design of node software are verified. The final source codes of the node software are automatically generated from the sensor network model. We illustrate the efficiency of the proposed technique by using a gas/light monitoring application through a case study of a Gas and Light Monitoring System based on the Nano-Qplus operating system. We evaluate the technique using a quantitative metric-the memory size of execution code for node software. Using the proposed approach, developers are able to easily construct sensor network applications and rapidly generate a large number of node softwares at a time in a ubiquitous sensor network environment.

Information loss method to measure node similarity in networks

NASA Astrophysics Data System (ADS)

Li, Yongli; Luo, Peng; Wu, Chong

2014-09-01

Similarity measurement for the network node has been paid increasing attention in the field of statistical physics. In this paper, we propose an entropy-based information loss method to measure the node similarity. The whole model is established based on this idea that less information loss is caused by seeing two more similar nodes as the same. The proposed new method has relatively low algorithm complexity, making it less time-consuming and more efficient to deal with the large scale real-world network. In order to clarify its availability and accuracy, this new approach was compared with some other selected approaches on two artificial examples and synthetic networks. Furthermore, the proposed method is also successfully applied to predict the network evolution and predict the unknown nodes' attributions in the two application examples.

Preferential attachment in evolutionary earthquake networks

NASA Astrophysics Data System (ADS)

Rezaei, Soghra; Moghaddasi, Hanieh; Darooneh, Amir Hossein

2018-04-01

Earthquakes as spatio-temporal complex systems have been recently studied using complex network theory. Seismic networks are dynamical networks due to addition of new seismic events over time leading to establishing new nodes and links to the network. Here we have constructed Iran and Italy seismic networks based on Hybrid Model and testified the preferential attachment hypothesis for the connection of new nodes which states that it is more probable for newly added nodes to join the highly connected nodes comparing to the less connected ones. We showed that the preferential attachment is present in the case of earthquakes network and the attachment rate has a linear relationship with node degree. We have also found the seismic passive points, the most probable points to be influenced by other seismic places, using their preferential attachment values.

Prediction-based Dynamic Energy Management in Wireless Sensor Networks

PubMed Central

Wang, Xue; Ma, Jun-Jie; Wang, Sheng; Bi, Dao-Wei

2007-01-01

Energy consumption is a critical constraint in wireless sensor networks. Focusing on the energy efficiency problem of wireless sensor networks, this paper proposes a method of prediction-based dynamic energy management. A particle filter was introduced to predict a target state, which was adopted to awaken wireless sensor nodes so that their sleep time was prolonged. With the distributed computing capability of nodes, an optimization approach of distributed genetic algorithm and simulated annealing was proposed to minimize the energy consumption of measurement. Considering the application of target tracking, we implemented target position prediction, node sleep scheduling and optimal sensing node selection. Moreover, a routing scheme of forwarding nodes was presented to achieve extra energy conservation. Experimental results of target tracking verified that energy-efficiency is enhanced by prediction-based dynamic energy management.

Timing of Locomotor Recovery from Anoxia Modulated by the white Gene in Drosophila

PubMed Central

Xiao, Chengfeng; Robertson, R. Meldrum

2016-01-01

Locomotor recovery from anoxia follows the restoration of disordered ion distributions and neuronal excitability. The time taken for locomotor recovery after 30 sec anoxia (around 10 min) is longer than the time for the propagation of action potentials to be restored (<1 min) in Drosophila wild type. We report here that the white (w) gene modulates the timing of locomotor recovery. Wild-type flies displayed fast and consistent recovery of locomotion from anoxia, whereas mutants of w showed significantly delayed and more variable recovery. Genetic analysis including serial backcrossing revealed a strong association between the w locus and the timing of locomotor recovery, and haplo-insufficient function of w+ in promoting fast recovery. The locomotor recovery phenotype was independent of classic eye pigmentation, although both are associated with the w gene. Introducing up to four copies of mini-white (mw+) into w1118 was insufficient to promote fast and consistent locomotor recovery. However, flies carrying w+ duplicated to the Y chromosome showed wild-type-like fast locomotor recovery. Furthermore, Knockdown of w by RNA interference (RNAi) in neurons but not glia delayed locomotor recovery, and specifically, knockdown of w in subsets of serotonin neurons was sufficient to delay the locomotor recovery. These data reveal an additional role for w in modulating the timing of locomotor recovery from anoxia. PMID:27029736

Optimal resource diffusion for suppressing disease spreading in multiplex networks

NASA Astrophysics Data System (ADS)

Chen, Xiaolong; Wang, Wei; Cai, Shimin; Stanley, H. Eugene; Braunstein, Lidia A.

2018-05-01

Resource diffusion is a ubiquitous phenomenon, but how it impacts epidemic spreading has received little study. We propose a model that couples epidemic spreading and resource diffusion in multiplex networks. The spread of disease in a physical contact layer and the recovery of the infected nodes are both strongly dependent upon resources supplied by their counterparts in the social layer. The generation and diffusion of resources in the social layer are in turn strongly dependent upon the state of the nodes in the physical contact layer. Resources diffuse preferentially or randomly in this model. To quantify the degree of preferential diffusion, a bias parameter that controls the resource diffusion is proposed. We conduct extensive simulations and find that the preferential resource diffusion can change phase transition type of the fraction of infected nodes. When the degree of interlayer correlation is below a critical value, increasing the bias parameter changes the phase transition from double continuous to single continuous. When the degree of interlayer correlation is above a critical value, the phase transition changes from multiple continuous to first discontinuous and then to hybrid. We find hysteresis loops in the phase transition. We also find that there is an optimal resource strategy at each fixed degree of interlayer correlation under which the threshold reaches a maximum and the disease can be maximally suppressed. In addition, the optimal controlling parameter increases as the degree of inter-layer correlation increases.

Subepidermal vesiculobullous filarial dermatitis in free-ranging American badgers (Taxidea taxus).

PubMed

O'Toole, D; Williams, E S; Welch, V; Nunamaker, C E; Lynn, C

1993-07-01

Skin and superficial lymph nodes from the 65 juvenile (< 1 year old) and adult free-ranging American badgers (Taxidea taxus) of both sexes that were killed from late July to late October 1991 as part of the recovery program for the endangered black-footed ferret (Mustela nigripes) were examined for evidence of Filaria taxideae. Fifty-one badgers (51/64, 80%) were infected. Both adult badgers (30/32, 94%) and juvenile badgers (21/32, 67%) were infected by adult filarial worms, which occurred most commonly in subcutaneous tissues of the inguinal area, proximal thigh, and ventral abdomen. Sections of formalin-fixed skin and, from many badgers, subcutaneous lymph nodes were stained with hematoxylin and eosin, Jones' methenamine silver (for basement membrane), and an avidin biotin peroxidase complex method (for factor VIII-related antigen). Superficial dermatitis attributable to embryonated filarial ova and larvae was present in 26/64 badgers (41%), all of them adult (> 1 year old). Acute lesions consisted of multifocal vesiculobullous dermoepidermal separation and superficial perivascular dermatitis. Ultrastructural examination and Jones' silver-stained sections revealed separation between basal keratinocytes and the basal lamina (subepidermal vesiculation). Older lesions consisted of ulcerative superficial granulomatous dermatitis associated with ova and larvae. Multifocal granulomatous endolymphangitis, which involved afferent lymphatics of subcutaneous lymph nodes, was associated with viable as well as degenerative ova and larvae. Adult filarial worms were found in the subcutis alone and did not provoke an inflammatory reaction.

Hybrid Computational Architecture for Multi-Scale Modeling of Materials and Devices

DTIC Science & Technology

2016-01-03

Equivalent: Total Number: Sub Contractors (DD882) Names of Faculty Supported Names of Under Graduate students supported Names of Personnel receiving masters...GHz, 20 cores (40 with hyper-threading ( HT )) Single node performance Node # of cores Total CPU time User CPU time System CPU time Elapsed time...INTEL20 40 (with HT ) 534.785 529.984 4.800 541.179 20 468.873 466.119 2.754 476.878 10 671.798 669.653 2.145 680.510 8 772.269 770.256 2.013

Adaptive multi-node multiple input and multiple output (MIMO) transmission for mobile wireless multimedia sensor networks.

PubMed

Cho, Sunghyun; Choi, Ji-Woong; You, Cheolwoo

2013-10-02

Mobile wireless multimedia sensor networks (WMSNs), which consist of mobile sink or sensor nodes and use rich sensing information, require much faster and more reliable wireless links than static wireless sensor networks (WSNs). This paper proposes an adaptive multi-node (MN) multiple input and multiple output (MIMO) transmission to improve the transmission reliability and capacity of mobile sink nodes when they experience spatial correlation. Unlike conventional single-node (SN) MIMO transmission, the proposed scheme considers the use of transmission antennas from more than two sensor nodes. To find an optimal antenna set and a MIMO transmission scheme, a MN MIMO channel model is introduced first, followed by derivation of closed-form ergodic capacity expressions with different MIMO transmission schemes, such as space-time transmit diversity coding and spatial multiplexing. The capacity varies according to the antenna correlation and the path gain from multiple sensor nodes. Based on these statistical results, we propose an adaptive MIMO mode and antenna set switching algorithm that maximizes the ergodic capacity of mobile sink nodes. The ergodic capacity of the proposed scheme is compared with conventional SN MIMO schemes, where the gain increases as the antenna correlation and path gain ratio increase.

Adaptive Multi-Node Multiple Input and Multiple Output (MIMO) Transmission for Mobile Wireless Multimedia Sensor Networks

PubMed Central

Cho, Sunghyun; Choi, Ji-Woong; You, Cheolwoo

2013-01-01

Mobile wireless multimedia sensor networks (WMSNs), which consist of mobile sink or sensor nodes and use rich sensing information, require much faster and more reliable wireless links than static wireless sensor networks (WSNs). This paper proposes an adaptive multi-node (MN) multiple input and multiple output (MIMO) transmission to improve the transmission reliability and capacity of mobile sink nodes when they experience spatial correlation. Unlike conventional single-node (SN) MIMO transmission, the proposed scheme considers the use of transmission antennas from more than two sensor nodes. To find an optimal antenna set and a MIMO transmission scheme, a MN MIMO channel model is introduced first, followed by derivation of closed-form ergodic capacity expressions with different MIMO transmission schemes, such as space-time transmit diversity coding and spatial multiplexing. The capacity varies according to the antenna correlation and the path gain from multiple sensor nodes. Based on these statistical results, we propose an adaptive MIMO mode and antenna set switching algorithm that maximizes the ergodic capacity of mobile sink nodes. The ergodic capacity of the proposed scheme is compared with conventional SN MIMO schemes, where the gain increases as the antenna correlation and path gain ratio increase. PMID:24152920

An improved global dynamic routing strategy for scale-free network with tunable clustering

NASA Astrophysics Data System (ADS)

Sun, Lina; Huang, Ning; Zhang, Yue; Bai, Yannan

2016-08-01

An efficient routing strategy can deliver packets quickly to improve the network capacity. Node congestion and transmission path length are inevitable real-time factors for a good routing strategy. Existing dynamic global routing strategies only consider the congestion of neighbor nodes and the shortest path, which ignores other key nodes’ congestion on the path. With the development of detection methods and techniques, global traffic information is readily available and important for the routing choice. Reasonable use of this information can effectively improve the network routing. So, an improved global dynamic routing strategy is proposed, which considers the congestion of all nodes on the shortest path and incorporates the waiting time of the most congested node into the path. We investigate the effectiveness of the proposed routing for scale-free network with different clustering coefficients. The shortest path routing strategy and the traffic awareness routing strategy only considering the waiting time of neighbor node are analyzed comparatively. Simulation results show that network capacity is greatly enhanced compared with the shortest path; congestion state increase is relatively slow compared with the traffic awareness routing strategy. Clustering coefficient increase will not only reduce the network throughput, but also result in transmission average path length increase for scale-free network with tunable clustering. The proposed routing is favorable to ease network congestion and network routing strategy design.

A novel end-to-end fault detection and localization protocol for wavelength-routed WDM networks

NASA Astrophysics Data System (ADS)

Zeng, Hongqing; Vukovic, Alex; Huang, Changcheng

2005-09-01

Recently the wavelength division multiplexing (WDM) networks are becoming prevalent for telecommunication networks. However, even a very short disruption of service caused by network faults may lead to high data loss in such networks due to the high date rates, increased wavelength numbers and density. Therefore, the network survivability is critical and has been intensively studied, where fault detection and localization is the vital part but has received disproportional attentions. In this paper we describe and analyze an end-to-end lightpath fault detection scheme in data plane with the fault notification in control plane. The endeavor is focused on reducing the fault detection time. In this protocol, the source node of each lightpath keeps sending hello packets to the destination node exactly following the path for data traffic. The destination node generates an alarm once a certain number of consecutive hello packets are missed within a given time period. Then the network management unit collects all alarms and locates the faulty source based on the network topology, as well as sends fault notification messages via control plane to either the source node or all upstream nodes along the lightpath. The performance evaluation shows such a protocol can achieve fast fault detection, and at the same time, the overhead brought to the user data by hello packets is negligible.

Detecting unknown attacks in wireless sensor networks that contain mobile nodes.

PubMed

Banković, Zorana; Fraga, David; Moya, José M; Vallejo, Juan Carlos

2012-01-01

As wireless sensor networks are usually deployed in unattended areas, security policies cannot be updated in a timely fashion upon identification of new attacks. This gives enough time for attackers to cause significant damage. Thus, it is of great importance to provide protection from unknown attacks. However, existing solutions are mostly concentrated on known attacks. On the other hand, mobility can make the sensor network more resilient to failures, reactive to events, and able to support disparate missions with a common set of sensors, yet the problem of security becomes more complicated. In order to address the issue of security in networks with mobile nodes, we propose a machine learning solution for anomaly detection along with the feature extraction process that tries to detect temporal and spatial inconsistencies in the sequences of sensed values and the routing paths used to forward these values to the base station. We also propose a special way to treat mobile nodes, which is the main novelty of this work. The data produced in the presence of an attacker are treated as outliers, and detected using clustering techniques. These techniques are further coupled with a reputation system, in this way isolating compromised nodes in timely fashion. The proposal exhibits good performances at detecting and confining previously unseen attacks, including the cases when mobile nodes are compromised.

Hypereosinophilia and acute bilateral facial palsy: an unusual presentation of a common disease.

PubMed

Webb, Alastair John Stewart; Conlon, Chris; Briley, Dennis

2012-10-01

A 60-year-old man presented with an acute, pruritic, erythematous rash associated with marked hypereosinophilia (2.34×10(9)/l (0.04-0.40)). There was eosinophilic infiltration on hepatic, bone marrow and lymph node biopsies, with multiple lung nodules and mild splenomegaly. However, extensive investigation excluded parasitic or bacterial causes, specific allergens or the Fip1L1 mutation seen in myeloproliferative hypereosinophilia. Six months into the illness, he developed an acute, left, complete lower motor neurone facial palsy over hours, and an acute right lower motor neurone facial palsy 2 weeks later, without recovery. Over the subsequent 3 months, he developed complex partial seizures, a transient 72-h non-epileptic encephalopathy and episodic vertigo with ataxia. Further investigation showed bilateral enhancement of the VII nerves and labyrinthis on gadolinium-enhanced MR brain scan, cerebrospinal fluid lymphocytosis and neurophysiological evidence of polyradicolopathy. His eosinophil count fell with corticosteroids, hydroxycarbamide, imatinib and ultimately mepolezumab, but without symptomatic improvement. Repeat lymph node biopsy showed Kaposi's sarcoma, leading to a diagnosis of HIV-1 infection with a modestly reduced CD4 count of 413×10(6)/l (430-1690). Hypereosinophila and eosinophilic folliculitis are recognised features of advanced HIV infection, and transient bilateral facial palsy occasionally occurs at the time of seroconversion. This is the first report of a chronic bilateral facial palsy likely due to primary HIV infection, not occurring during seroconversion and in association with hypereosinophilia. This case emphasises the protean manifestations of HIV infection and the need for routine testing in atypical clinical presentations.

Scalable Failure Masking for Stencil Computations using Ghost Region Expansion and Cell to Rank Remapping

DOE PAGES

Gamell, Marc; Teranishi, Keita; Kolla, Hemanth; ...

2017-10-26

In order to achieve exascale systems, application resilience needs to be addressed. Some programming models, such as task-DAG (directed acyclic graphs) architectures, currently embed resilience features whereas traditional SPMD (single program, multiple data) and message-passing models do not. Since a large part of the community's code base follows the latter models, it is still required to take advantage of application characteristics to minimize the overheads of fault tolerance. To that end, this paper explores how recovering from hard process/node failures in a local manner is a natural approach for certain applications to obtain resilience at lower costs in faulty environments.more » In particular, this paper targets enabling online, semitransparent local recovery for stencil computations on current leadership-class systems as well as presents programming support and scalable runtime mechanisms. Also described and demonstrated in this paper is the effect of failure masking, which allows the effective reduction of impact on total time to solution due to multiple failures. Furthermore, we discuss, implement, and evaluate ghost region expansion and cell-to-rank remapping to increase the probability of failure masking. To conclude, this paper shows the integration of all aforementioned mechanisms with the S3D combustion simulation through an experimental demonstration (using the Titan system) of the ability to tolerate high failure rates (i.e., node failures every five seconds) with low overhead while sustaining performance at large scales. In addition, this demonstration also displays the failure masking probability increase resulting from the combination of both ghost region expansion and cell-to-rank remapping.« less

Scalable Failure Masking for Stencil Computations using Ghost Region Expansion and Cell to Rank Remapping

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gamell, Marc; Teranishi, Keita; Kolla, Hemanth

In order to achieve exascale systems, application resilience needs to be addressed. Some programming models, such as task-DAG (directed acyclic graphs) architectures, currently embed resilience features whereas traditional SPMD (single program, multiple data) and message-passing models do not. Since a large part of the community's code base follows the latter models, it is still required to take advantage of application characteristics to minimize the overheads of fault tolerance. To that end, this paper explores how recovering from hard process/node failures in a local manner is a natural approach for certain applications to obtain resilience at lower costs in faulty environments.more » In particular, this paper targets enabling online, semitransparent local recovery for stencil computations on current leadership-class systems as well as presents programming support and scalable runtime mechanisms. Also described and demonstrated in this paper is the effect of failure masking, which allows the effective reduction of impact on total time to solution due to multiple failures. Furthermore, we discuss, implement, and evaluate ghost region expansion and cell-to-rank remapping to increase the probability of failure masking. To conclude, this paper shows the integration of all aforementioned mechanisms with the S3D combustion simulation through an experimental demonstration (using the Titan system) of the ability to tolerate high failure rates (i.e., node failures every five seconds) with low overhead while sustaining performance at large scales. In addition, this demonstration also displays the failure masking probability increase resulting from the combination of both ghost region expansion and cell-to-rank remapping.« less

Relationship of Topology, Multiscale Phase Synchronization, and State Transitions in Human Brain Networks

PubMed Central

Kim, Minkyung; Kim, Seunghwan; Mashour, George A.; Lee, UnCheol

2017-01-01

How the brain reconstitutes consciousness and cognition after a major perturbation like general anesthesia is an important question with significant neuroscientific and clinical implications. Recent empirical studies in animals and humans suggest that the recovery of consciousness after anesthesia is not random but ordered. Emergence patterns have been classified as progressive and abrupt transitions from anesthesia to consciousness, with associated differences in duration and electroencephalogram (EEG) properties. We hypothesized that the progressive and abrupt emergence patterns from the unconscious state are associated with, respectively, continuous and discontinuous synchronization transitions in functional brain networks. The discontinuous transition is explainable with the concept of explosive synchronization, which has been studied almost exclusively in network science. We used the Kuramato model, a simple oscillatory network model, to simulate progressive and abrupt transitions in anatomical human brain networks acquired from diffusion tensor imaging (DTI) of 82 brain regions. To facilitate explosive synchronization, distinct frequencies for hub nodes with a large frequency disassortativity (i.e., higher frequency nodes linking with lower frequency nodes, or vice versa) were applied to the brain network. In this simulation study, we demonstrated that both progressive and abrupt transitions follow distinct synchronization processes at the individual node, cluster, and global network levels. The characteristic synchronization patterns of brain regions that are “progressive and earlier” or “abrupt but delayed” account for previously reported behavioral responses of gradual and abrupt emergence from the unconscious state. The characteristic network synchronization processes observed at different scales provide new insights into how regional brain functions are reconstituted during progressive and abrupt emergence from the unconscious state. This theoretical approach also offers a principled explanation of how the brain reconstitutes consciousness and cognitive functions after physiologic (sleep), pharmacologic (anesthesia), and pathologic (coma) perturbations. PMID:28713258

Relationship of Topology, Multiscale Phase Synchronization, and State Transitions in Human Brain Networks.

PubMed

Kim, Minkyung; Kim, Seunghwan; Mashour, George A; Lee, UnCheol

2017-01-01

How the brain reconstitutes consciousness and cognition after a major perturbation like general anesthesia is an important question with significant neuroscientific and clinical implications. Recent empirical studies in animals and humans suggest that the recovery of consciousness after anesthesia is not random but ordered. Emergence patterns have been classified as progressive and abrupt transitions from anesthesia to consciousness, with associated differences in duration and electroencephalogram (EEG) properties. We hypothesized that the progressive and abrupt emergence patterns from the unconscious state are associated with, respectively, continuous and discontinuous synchronization transitions in functional brain networks. The discontinuous transition is explainable with the concept of explosive synchronization, which has been studied almost exclusively in network science. We used the Kuramato model, a simple oscillatory network model, to simulate progressive and abrupt transitions in anatomical human brain networks acquired from diffusion tensor imaging (DTI) of 82 brain regions. To facilitate explosive synchronization, distinct frequencies for hub nodes with a large frequency disassortativity (i.e., higher frequency nodes linking with lower frequency nodes, or vice versa) were applied to the brain network. In this simulation study, we demonstrated that both progressive and abrupt transitions follow distinct synchronization processes at the individual node, cluster, and global network levels. The characteristic synchronization patterns of brain regions that are "progressive and earlier" or "abrupt but delayed" account for previously reported behavioral responses of gradual and abrupt emergence from the unconscious state. The characteristic network synchronization processes observed at different scales provide new insights into how regional brain functions are reconstituted during progressive and abrupt emergence from the unconscious state. This theoretical approach also offers a principled explanation of how the brain reconstitutes consciousness and cognitive functions after physiologic (sleep), pharmacologic (anesthesia), and pathologic (coma) perturbations.

Scalable and responsive event processing in the cloud

PubMed Central

Suresh, Visalakshmi; Ezhilchelvan, Paul; Watson, Paul

2013-01-01

Event processing involves continuous evaluation of queries over streams of events. Response-time optimization is traditionally done over a fixed set of nodes and/or by using metrics measured at query-operator levels. Cloud computing makes it easy to acquire and release computing nodes as required. Leveraging this flexibility, we propose a novel, queueing-theory-based approach for meeting specified response-time targets against fluctuating event arrival rates by drawing only the necessary amount of computing resources from a cloud platform. In the proposed approach, the entire processing engine of a distinct query is modelled as an atomic unit for predicting response times. Several such units hosted on a single node are modelled as a multiple class M/G/1 system. These aspects eliminate intrusive, low-level performance measurements at run-time, and also offer portability and scalability. Using model-based predictions, cloud resources are efficiently used to meet response-time targets. The efficacy of the approach is demonstrated through cloud-based experiments. PMID:23230164

A Constant-Factor Approximation Algorithm for the Link Building Problem

NASA Astrophysics Data System (ADS)

Olsen, Martin; Viglas, Anastasios; Zvedeniouk, Ilia

In this work we consider the problem of maximizing the PageRank of a given target node in a graph by adding k new links. We consider the case that the new links must point to the given target node (backlinks). Previous work [7] shows that this problem has no fully polynomial time approximation schemes unless P = NP. We present a polynomial time algorithm yielding a PageRank value within a constant factor from the optimal. We also consider the naive algorithm where we choose backlinks from nodes with high PageRank values compared to the outdegree and show that the naive algorithm performs much worse on certain graphs compared to the constant factor approximation scheme.

High-order finite difference formulations for the incompressible Navier-Stokes equations on the CM-5

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tafti, D.

1995-12-01

The paper describes the features and implementation of a general purpose high-order accurate finite difference computer program for direct and large-eddy simulations of turbulence on the CM-5 in the data parallel mode. Benchmarking studies for a direct simulation of turbulent channel flow are discussed. Performance of up to 8.8 GFLOPS is obtained for the high-order formulations on 512 processing nodes of the CM-5. The execution time for a simulation with 24 million nodes in a domain with two periodic directions is in the range of 0.2 {mu}secs/time-step/degree of freedom on 512 processing nodes of the CM-5.

Wireless Data-Acquisition System for Testing Rocket Engines

NASA Technical Reports Server (NTRS)

Lin, Chujen; Lonske, Ben; Hou, Yalin; Xu, Yingjiu; Gang, Mei

2007-01-01

A prototype wireless data-acquisition system has been developed as a potential replacement for a wired data-acquisition system heretofore used in testing rocket engines. The traditional use of wires to connect sensors, signal-conditioning circuits, and data acquisition circuitry is time-consuming and prone to error, especially when, as is often the case, many sensors are used in a test. The system includes one master and multiple slave nodes. The master node communicates with a computer via an Ethernet connection. The slave nodes are powered by rechargeable batteries and are packaged in weatherproof enclosures. The master unit and each of the slave units are equipped with a time-modulated ultra-wide-band (TMUWB) radio transceiver, which spreads its RF energy over several gigahertz by transmitting extremely low-power and super-narrow pulses. In this prototype system, each slave node can be connected to as many as six sensors: two sensors can be connected directly to analog-to-digital converters (ADCs) in the slave node and four sensors can be connected indirectly to the ADCs via signal conditioners. The maximum sampling rate for streaming data from any given sensor is about 5 kHz. The bandwidth of one channel of the TM-UWB radio communication system is sufficient to accommodate streaming of data from five slave nodes when they are fully loaded with data collected through all possible sensor connections. TM-UWB radios have a much higher spatial capacity than traditional sinusoidal wave-based radios. Hence, this TM-UWB wireless data-acquisition can be scaled to cover denser sensor setups for rocket engine test stands. Another advantage of TM-UWB radios is that it will not interfere with existing wireless transmission. The maximum radio-communication range between the master node and a slave node for this prototype system is about 50 ft (15 m) when the master and slave transceivers are equipped with small dipole antennas. The range can be increased by changing to larger antennas and/or greater transmission power. The battery life of a slave node ranges from about six hours during operation at full capacity to as long as three days when the system is in a "sleep" mode used to conserve battery charge during times between setup and rocket-engine testing. Batteries can be added to prolong operational lifetimes. The radio transceiver dominates the power consumption.

When did anoles diverge? An analysis of multiple dating strategies.

PubMed

Román-Palacios, Cristian; Tavera, Jose; Del Rosario Castañeda, María

2018-06-12

Whereas most of the studies that discuss the evolutionary divergence of Anolis lizards have dated the clade's crown group in between 31-64 Ma, a single study has recovered a significantly older age for the same node (87 Ma). These differences also entail notable consequences on the preferred biogeographical hypothesis for the whole clade. Here we analyze a total of seven dating strategies by combining three calibration sources in independent BEAST runs to infer the most probable divergence timing for anole lizards (a mitochondrial rate for ND2 gene, the Anolis dominicanus fossil, and a group of fossils assigned to the Priscagamines, Iguanines, and Idontosaurus clades). Based on the estimated timing, we also addressed whether chronograms differ the most in deeper or shallower nodes by exploring the trend in the standard deviation of mean ages between chronograms across time. Next, we focus on the pattern for a single shallow node by hypothesizing the biogeography of the island-endemic Malpelo anole (Anolis agassizi), and evaluating the temporal congruence between the species' divergence and the island geology. The estimated set of ages suggests that anoles most likely diverged 72 Ma (71-73 Ma), with the crown group established around 58 Ma (51-65 Ma). Dispersal is therefore supported as the major driver in the biogeography of the group (and in Caribbean lineages in particular). Our analyses also indicated that (1) rate-based analyses pulled dates toward younger ages, (2) the differences in node ages between chronograms decrease towards the tips regardless of the position of the constrained node, and that (3) the estimated age for deep nodes (e.g. Anolis stem) is highly influenced when deep nodes are also constrained. The latter two results imply that the estimated age for shallower nodes is largely unaffected by the used temporal constraint. The congruence of all chronograms for the Malpelo anole also support this finding. Anolis agassizi was found to have diverged before the emergence of Malpelo island in each analysis (anole: 19-31 Ma vs. Malpelo island: 16-17 Ma). We recommend when performing absolute dating analyses to first test for sequence saturation in the analyzed dataset (especially when calibrations are based on molecular rates). Our study also points out the importance of using of multiple node constraints, especially when placed deeply in the tree, for fossil-based divergence dating analyses. Copyright © 2018. Published by Elsevier Inc.

Towards Accurate Node-Based Detection of P2P Botnets

PubMed Central

2014-01-01

Botnets are a serious security threat to the current Internet infrastructure. In this paper, we propose a novel direction for P2P botnet detection called node-based detection. This approach focuses on the network characteristics of individual nodes. Based on our model, we examine node's flows and extract the useful features over a given time period. We have tested our approach on real-life data sets and achieved detection rates of 99-100% and low false positives rates of 0–2%. Comparison with other similar approaches on the same data sets shows that our approach outperforms the existing approaches. PMID:25089287

MEMS tracking mirror system for a bidirectional free-space optical link.

PubMed

Jeon, Sungho; Toshiyoshi, Hiroshi

2017-08-20

We report on a bidirectional free-space optical system that is capable of automatic connection and tracking of an optical link between two nodes. A piezoelectric micro-electro-mechanical systems (MEMS) optical scanner is used to steer a laser beam of two wavelengths superposed to visually present a communication zone, to search for the position of the remote node by means of the retro-reflector optics, and to transmit the data between the nodes. A feedback system is developed to control the MEMS scanner to dynamically establish the optical link within a 10-ms transition time and to keep track of the moving node.

Partially entangled states bridge in quantum teleportation

NASA Astrophysics Data System (ADS)

Cai, Xiao-Fei; Yu, Xu-Tao; Shi, Li-Hui; Zhang, Zai-Chen

2014-10-01

The traditional method for information transfer in a quantum communication system using partially entangled state resource is quantum distillation or direct teleportation. In order to reduce the waiting time cost in hop-by-hop transmission and execute independently in each node, we propose a quantum bridging method with partially entangled states to teleport quantum states from source node to destination node. We also prove that the designed specific quantum bridging circuit is feasible for partially entangled states teleportation across multiple intermediate nodes. Compared to two traditional ways, our partially entanglement quantum bridging method uses simpler logic gates, has better security, and can be used in less quantum resource situation.

A Novel Connectionist Network for Solving Long Time-Lag Prediction Tasks

NASA Astrophysics Data System (ADS)

Johnson, Keith; MacNish, Cara

Traditional Recurrent Neural Networks (RNNs) perform poorly on learning tasks involving long time-lag dependencies. More recent approaches such as LSTM and its variants significantly improve on RNNs ability to learn this type of problem. We present an alternative approach to encoding temporal dependencies that associates temporal features with nodes rather than state values, where the nodes explicitly encode dependencies over variable time delays. We show promising results comparing the network's performance to LSTM variants on an extended Reber grammar task.

EUV tools: hydrogen gas purification and recovery strategies

NASA Astrophysics Data System (ADS)

Landoni, Cristian; Succi, Marco; Applegarth, Chuck; Riddle Vogt, Sarah

2015-03-01

The technological challenges that have been overcome to make extreme ultraviolet lithography (EUV) a reality have been enormous1. This vacuum driven technology poses significant purity challenges for the gases employed for purging and cleaning the scanner EUV chamber and source. Hydrogen, nitrogen, argon and ultra-high purity compressed dry air (UHPCDA) are the most common gases utilized at the scanner and source level. Purity requirements are tighter than for previous technology node tools. In addition, specifically for hydrogen, EUV tool users are facing not only gas purity challenges but also the need for safe disposal of the hydrogen at the tool outlet. Recovery, reuse or recycling strategies could mitigate the disposal process and reduce the overall tool cost of operation. This paper will review the types of purification technologies that are currently available to generate high purity hydrogen suitable for EUV applications. Advantages and disadvantages of each purification technology will be presented. Guidelines on how to select the most appropriate technology for each application and experimental conditions will be presented. A discussion of the most common approaches utilized at the facility level to operate EUV tools along with possible hydrogen recovery strategies will also be reported.

Assembly Mechanism of the Contractile Ring for Cytokinesis by Fission Yeast

NASA Astrophysics Data System (ADS)

Vavylonis, Dimitrios; Wu, Jian-Qiu; Huang, Xiaolei; O'Shaughnessy, Ben; Pollard, Thomas

2008-03-01

Animals and fungi assemble a contractile ring of actin filaments and the motor protein myosin to separate into individual daughter cells during cytokinesis. We studied the mechanism of contractile ring assembly in fission yeast with high time resolution confocal microscopy, computational image analysis methods, and numerical simulations. Approximately 63 nodes containing myosin, broadly distributed around the cell equator, assembled into a ring through stochastic motions, making many starts, stops, and changes of direction as they condense into a ring. Estimates of node friction coefficients from the mean square displacement of stationary nodes imply forces for node movement are greater than ˜ 4 pN, similarly to forces by a few molecular motors. Skeletonization and topology analysis of images of cells expressing fluorescent actin filament markers showed transient linear elements extending in all directions from myosin nodes and establishing connections among them. We propose a model with traction between nodes depending on transient connections established by stochastic search and capture (``search, capture, pull and release''). Numerical simulations of the model using parameter values obtained from experiment succesfully condense nodes into a continuous ring.

Synchronous Parallel Emulation and Discrete Event Simulation System with Self-Contained Simulation Objects and Active Event Objects

NASA Technical Reports Server (NTRS)

Steinman, Jeffrey S. (Inventor)

1998-01-01

The present invention is embodied in a method of performing object-oriented simulation and a system having inter-connected processor nodes operating in parallel to simulate mutual interactions of a set of discrete simulation objects distributed among the nodes as a sequence of discrete events changing state variables of respective simulation objects so as to generate new event-defining messages addressed to respective ones of the nodes. The object-oriented simulation is performed at each one of the nodes by assigning passive self-contained simulation objects to each one of the nodes, responding to messages received at one node by generating corresponding active event objects having user-defined inherent capabilities and individual time stamps and corresponding to respective events affecting one of the passive self-contained simulation objects of the one node, restricting the respective passive self-contained simulation objects to only providing and receiving information from die respective active event objects, requesting information and changing variables within a passive self-contained simulation object by the active event object, and producing corresponding messages specifying events resulting therefrom by the active event objects.

A Hybrid MPI/OpenMP Approach for Parallel Groundwater Model Calibration on Multicore Computers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tang, Guoping; D'Azevedo, Ed F; Zhang, Fan

2010-01-01

Groundwater model calibration is becoming increasingly computationally time intensive. We describe a hybrid MPI/OpenMP approach to exploit two levels of parallelism in software and hardware to reduce calibration time on multicore computers with minimal parallelization effort. At first, HydroGeoChem 5.0 (HGC5) is parallelized using OpenMP for a uranium transport model with over a hundred species involving nearly a hundred reactions, and a field scale coupled flow and transport model. In the first application, a single parallelizable loop is identified to consume over 97% of the total computational time. With a few lines of OpenMP compiler directives inserted into the code,more » the computational time reduces about ten times on a compute node with 16 cores. The performance is further improved by selectively parallelizing a few more loops. For the field scale application, parallelizable loops in 15 of the 174 subroutines in HGC5 are identified to take more than 99% of the execution time. By adding the preconditioned conjugate gradient solver and BICGSTAB, and using a coloring scheme to separate the elements, nodes, and boundary sides, the subroutines for finite element assembly, soil property update, and boundary condition application are parallelized, resulting in a speedup of about 10 on a 16-core compute node. The Levenberg-Marquardt (LM) algorithm is added into HGC5 with the Jacobian calculation and lambda search parallelized using MPI. With this hybrid approach, compute nodes at the number of adjustable parameters (when the forward difference is used for Jacobian approximation), or twice that number (if the center difference is used), are used to reduce the calibration time from days and weeks to a few hours for the two applications. This approach can be extended to global optimization scheme and Monte Carol analysis where thousands of compute nodes can be efficiently utilized.« less

Real-Time System Verification by Kappa-Induction

NASA Technical Reports Server (NTRS)

Pike, Lee S.

2005-01-01

We report the first formal verification of a reintegration protocol for a safety-critical, fault-tolerant, real-time distributed embedded system. A reintegration protocol increases system survivability by allowing a node that has suffered a fault to regain state consistent with the operational nodes. The protocol is verified in the Symbolic Analysis Laboratory (SAL), where bounded model checking and decision procedures are used to verify infinite-state systems by k-induction. The protocol and its environment are modeled as synchronizing timeout automata. Because k-induction is exponential with respect to k, we optimize the formal model to reduce the size of k. Also, the reintegrator's event-triggered behavior is conservatively modeled as time-triggered behavior to further reduce the size of k and to make it invariant to the number of nodes modeled. A corollary is that a clique avoidance property is satisfied.

Parallel consistent labeling algorithms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Samal, A.; Henderson, T.

Mackworth and Freuder have analyzed the time complexity of several constraint satisfaction algorithms. Mohr and Henderson have given new algorithms, AC-4 and PC-3, for arc and path consistency, respectively, and have shown that the arc consistency algorithm is optimal in time complexity and of the same order space complexity as the earlier algorithms. In this paper, they give parallel algorithms for solving node and arc consistency. They show that any parallel algorithm for enforcing arc consistency in the worst case must have O(na) sequential steps, where n is number of nodes, and a is the number of labels per node.more » They give several parallel algorithms to do arc consistency. It is also shown that they all have optimal time complexity. The results of running the parallel algorithms on a BBN Butterfly multiprocessor are also presented.« less

Connectivity Restoration in Wireless Sensor Networks via Space Network Coding.

PubMed

Uwitonze, Alfred; Huang, Jiaqing; Ye, Yuanqing; Cheng, Wenqing

2017-04-20

The problem of finding the number and optimal positions of relay nodes for restoring the network connectivity in partitioned Wireless Sensor Networks (WSNs) is Non-deterministic Polynomial-time hard (NP-hard) and thus heuristic methods are preferred to solve it. This paper proposes a novel polynomial time heuristic algorithm, namely, Relay Placement using Space Network Coding (RPSNC), to solve this problem, where Space Network Coding, also called Space Information Flow (SIF), is a new research paradigm that studies network coding in Euclidean space, in which extra relay nodes can be introduced to reduce the cost of communication. Unlike contemporary schemes that are often based on Minimum Spanning Tree (MST), Euclidean Steiner Minimal Tree (ESMT) or a combination of MST with ESMT, RPSNC is a new min-cost multicast space network coding approach that combines Delaunay triangulation and non-uniform partitioning techniques for generating a number of candidate relay nodes, and then linear programming is applied for choosing the optimal relay nodes and computing their connection links with terminals. Subsequently, an equilibrium method is used to refine the locations of the optimal relay nodes, by moving them to balanced positions. RPSNC can adapt to any density distribution of relay nodes and terminals, as well as any density distribution of terminals. The performance and complexity of RPSNC are analyzed and its performance is validated through simulation experiments.

Impact of Lean on patient cycle and waiting times at a rural district hospital in KwaZulu-Natal

PubMed Central

Naidoo, Logandran

2016-01-01

Background Prolonged waiting time is a source of patient dissatisfaction with health care and is negatively associated with patient satisfaction. Prolonged waiting times in many district hospitals result in many dissatisfied patients, overworked and frustrated staff, and poor quality of care because of the perceived increased workload. Aim The aim of the study was to determine the impact of Lean principles techniques, and tools on the operational efficiency in the outpatient department (OPD) of a rural district hospital. Setting The study was conducted at the Catherine Booth Hospital (CBH) – a rural district hospital in KwaZulu-Natal, South Africa. Methods This was an action research study with pre-, intermediate-, and post-implementation assessments. Cycle and waiting times were measured by direct observation on two occasions before, approximately two-weekly during, and on two occasions after Lean implementation. A standardised data collection tool was completed by the researcher at each of the six key service nodes in the OPD to capture the waiting times and cycle times. Results All six service nodes showed a reduction in cycle times and waiting times between the baseline assessment and post-Lean implementation measurement. Significant reduction was achieved in cycle times (27%; p < 0.05) and waiting times (from 11.93 to 10 min; p = 0.03) at the Investigations node. Although the target reduction was not achieved for the Consulting Room node, there was a significant reduction in waiting times from 80.95 to 74.43 min, (p < 0.001). The average efficiency increased from 16.35% (baseline) to 20.13% (post-intervention). Conclusion The application of Lean principles, tools and techniques provides hospital managers with an evidence-based management approach to resolving problems and improving quality indicators. PMID:27543283

Reliability Evaluation for Clustered WSNs under Malware Propagation.

PubMed

Shen, Shigen; Huang, Longjun; Liu, Jianhua; Champion, Adam C; Yu, Shui; Cao, Qiying

2016-06-10

We consider a clustered wireless sensor network (WSN) under epidemic-malware propagation conditions and solve the problem of how to evaluate its reliability so as to ensure efficient, continuous, and dependable transmission of sensed data from sensor nodes to the sink. Facing the contradiction between malware intention and continuous-time Markov chain (CTMC) randomness, we introduce a strategic game that can predict malware infection in order to model a successful infection as a CTMC state transition. Next, we devise a novel measure to compute the Mean Time to Failure (MTTF) of a sensor node, which represents the reliability of a sensor node continuously performing tasks such as sensing, transmitting, and fusing data. Since clustered WSNs can be regarded as parallel-serial-parallel systems, the reliability of a clustered WSN can be evaluated via classical reliability theory. Numerical results show the influence of parameters such as the true positive rate and the false positive rate on a sensor node's MTTF. Furthermore, we validate the method of reliability evaluation for a clustered WSN according to the number of sensor nodes in a cluster, the number of clusters in a route, and the number of routes in the WSN.

Impact of degree heterogeneity on the behavior of trapping in Koch networks

NASA Astrophysics Data System (ADS)

Zhang, Zhongzhi; Gao, Shuyang; Xie, Wenlei

2010-12-01

Previous work shows that the mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) in uncorrelated random scale-free networks is closely related to the exponent γ of power-law degree distribution P(k )˜k-γ, which describes the extent of heterogeneity of scale-free network structure. However, extensive empirical research indicates that real networked systems also display ubiquitous degree correlations. In this paper, we address the trapping issue on the Koch networks, which is a special random walk with one trap fixed at a hub node. The Koch networks are power-law with the characteristic exponent γ in the range between 2 and 3, they are either assortative or disassortative. We calculate exactly the MFPT that is the average of first-passage time from all other nodes to the trap. The obtained explicit solution shows that in large networks the MFPT varies lineally with node number N, which is obviously independent of γ and is sharp contrast to the scaling behavior of MFPT observed for uncorrelated random scale-free networks, where γ influences qualitatively the MFPT of trapping problem.

Recent Performance Results of VPIC on Trinity

NASA Astrophysics Data System (ADS)

Nystrom, W. D.; Bergen, B.; Bird, R. F.; Bowers, K. J.; Daughton, W. S.; Guo, F.; Le, A.; Li, H.; Nam, H.; Pang, X.; Stark, D. J.; Rust, W. N., III; Yin, L.; Albright, B. J.

2017-10-01

Trinity is a new DOE compute resource now in production at Los Alamos National Laboratory. Trinity has several new and unique features including two compute partitions, one with dual socket Intel Haswell Xeon compute nodes and one with Intel Knights Landing (KNL) Xeon Phi compute nodes, use of on package high bandwidth memory (HBM) for KNL nodes, ability to configure KNL nodes with respect to HBM model and on die network topology in a variety of operational modes at run time, and use of solid state storage via burst buffer technology to reduce time required to perform I/O. An effort is in progress to optimize VPIC on Trinity by taking advantage of these new architectural features. Results of work will be presented on performance of VPIC on Haswell and KNL partitions for single node runs and runs at scale. Results include use of burst buffers at scale to optimize I/O, comparison of strategies for using MPI and threads, performance benefits using HBM and effectiveness of using intrinsics for vectorization. Work performed under auspices of U.S. Dept. of Energy by Los Alamos National Security, LLC Los Alamos National Laboratory under contract DE-AC52-06NA25396 and supported by LANL LDRD program.