Methods of visualizing graphs

DOEpatents

Wong, Pak C.; Mackey, Patrick S.; Perrine, Kenneth A.; Foote, Harlan P.; Thomas, James J.

2008-12-23

Methods for visualizing a graph by automatically drawing elements of the graph as labels are disclosed. In one embodiment, the method comprises receiving node information and edge information from an input device and/or communication interface, constructing a graph layout based at least in part on that information, wherein the edges are automatically drawn as labels, and displaying the graph on a display device according to the graph layout. In some embodiments, the nodes are automatically drawn as labels instead of, or in addition to, the label-edges.

ESTminer: a Web interface for mining EST contig and cluster databases.

PubMed

Huang, Yecheng; Pumphrey, Janie; Gingle, Alan R

2005-03-01

ESTminer is a Web application and database schema for interactive mining of expressed sequence tag (EST) contig and cluster datasets. The Web interface contains a query frame that allows the selection of contigs/clusters with specific cDNA library makeup or a threshold number of members. The results are displayed as color-coded tree nodes, where the color indicates the fractional size of each cDNA library component. The nodes are expandable, revealing library statistics as well as EST or contig members, with links to sequence data, GenBank records or user configurable links. Also, the interface allows 'queries within queries' where the result set of a query is further filtered by the subsequent query. ESTminer is implemented in Java/JSP and the package, including MySQL and Oracle schema creation scripts, is available from http://cggc.agtec.uga.edu/Data/download.asp agingle@uga.edu.

Identifying Node Role in Social Network Based on Multiple Indicators

PubMed Central

Huang, Shaobin; Lv, Tianyang; Zhang, Xizhe; Yang, Yange; Zheng, Weimin; Wen, Chao

2014-01-01

It is a classic topic of social network analysis to evaluate the importance of nodes and identify the node that takes on the role of core or bridge in a network. Because a single indicator is not sufficient to analyze multiple characteristics of a node, it is a natural solution to apply multiple indicators that should be selected carefully. An intuitive idea is to select some indicators with weak correlations to efficiently assess different characteristics of a node. However, this paper shows that it is much better to select the indicators with strong correlations. Because indicator correlation is based on the statistical analysis of a large number of nodes, the particularity of an important node will be outlined if its indicator relationship doesn't comply with the statistical correlation. Therefore, the paper selects the multiple indicators including degree, ego-betweenness centrality and eigenvector centrality to evaluate the importance and the role of a node. The importance of a node is equal to the normalized sum of its three indicators. A candidate for core or bridge is selected from the great degree nodes or the nodes with great ego-betweenness centrality respectively. Then, the role of a candidate is determined according to the difference between its indicators' relationship with the statistical correlation of the overall network. Based on 18 real networks and 3 kinds of model networks, the experimental results show that the proposed methods perform quite well in evaluating the importance of nodes and in identifying the node role. PMID:25089823

Improved targeted immunization strategies based on two rounds of selection

NASA Astrophysics Data System (ADS)

Xia, Ling-Ling; Song, Yu-Rong; Li, Chan-Chan; Jiang, Guo-Ping

2018-04-01

In the case of high degree targeted immunization where the number of vaccine is limited, when more than one node associated with the same degree meets the requirement of high degree centrality, how can we choose a certain number of nodes from those nodes, so that the number of immunized nodes will not exceed the limit? In this paper, we introduce a new idea derived from the selection process of second-round exam to solve this problem and then propose three improved targeted immunization strategies. In these proposed strategies, the immunized nodes are selected through two rounds of selection, where we increase the quotas of first-round selection according the evaluation criterion of degree centrality and then consider another characteristic parameter of node, such as node's clustering coefficient, betweenness and closeness, to help choose targeted nodes in the second-round selection. To validate the effectiveness of the proposed strategies, we compare them with the degree immunizations including the high degree targeted and the high degree adaptive immunizations using two metrics: the size of the largest connected component of immunized network and the number of infected nodes. Simulation results demonstrate that the proposed strategies based on two rounds of sorting are effective for heterogeneous networks and their immunization effects are better than that of the degree immunizations.

Sentinel lymph node biopsy from the vantage point of an oncologic surgeon.

PubMed

Wilson, Lori L

2009-01-01

Sentinel lymph node biopsy has greatly influenced the surgical management of clinically localized primary melanoma. Lymphatic mapping and sentinel lymph node biopsy have been used for the selective management of the draining regional lymph node basin of primary cutaneous melanoma. Oncologic surgeons have adopted this procedure to selectively identify occult nodal status in melanoma patients who are at a higher risk of regional metastasis. The current standard of treatment of tumor-positive sentinel lymph node metastasis is immediate completion lymphadenectomy, but considerable debate surrounds the utility of this procedure. This contribution reviews development, technical aspects, selective management of the lymph node basin, and sentinel lymph node biopsy techniques.

Secure relay selection based on learning with negative externality in wireless networks

NASA Astrophysics Data System (ADS)

Zhao, Caidan; Xiao, Liang; Kang, Shan; Chen, Guiquan; Li, Yunzhou; Huang, Lianfen

2013-12-01

In this paper, we formulate relay selection into a Chinese restaurant game. A secure relay selection strategy is proposed for a wireless network, where multiple source nodes send messages to their destination nodes via several relay nodes, which have different processing and transmission capabilities as well as security properties. The relay selection utilizes a learning-based algorithm for the source nodes to reach their best responses in the Chinese restaurant game. In particular, the relay selection takes into account the negative externality of relay sharing among the source nodes, which learn the capabilities and security properties of relay nodes according to the current signals and the signal history. Simulation results show that this strategy improves the user utility and the overall security performance in wireless networks. In addition, the relay strategy is robust against the signal errors and deviations of some user from the desired actions.

Diagnosable structured logic array

NASA Technical Reports Server (NTRS)

Whitaker, Sterling (Inventor); Miles, Lowell (Inventor); Gambles, Jody (Inventor); Maki, Gary K. (Inventor)

2009-01-01

A diagnosable structured logic array and associated process is provided. A base cell structure is provided comprising a logic unit comprising a plurality of input nodes, a plurality of selection nodes, and an output node, a plurality of switches coupled to the selection nodes, where the switches comprises a plurality of input lines, a selection line and an output line, a memory cell coupled to the output node, and a test address bus and a program control bus coupled to the plurality of input lines and the selection line of the plurality of switches. A state on each of the plurality of input nodes is verifiably loaded and read from the memory cell. A trusted memory block is provided. The associated process is provided for testing and verifying a plurality of truth table inputs of the logic unit.

Method for nonlinear optimization for gas tagging and other systems

DOEpatents

Chen, Ting; Gross, Kenny C.; Wegerich, Stephan

1998-01-01

A method and system for providing nuclear fuel rods with a configuration of isotopic gas tags. The method includes selecting a true location of a first gas tag node, selecting initial locations for the remaining n-1 nodes using target gas tag compositions, generating a set of random gene pools with L nodes, applying a Hopfield network for computing on energy, or cost, for each of the L gene pools and using selected constraints to establish minimum energy states to identify optimal gas tag nodes with each energy compared to a convergence threshold and then upon identifying the gas tag node continuing this procedure until establishing the next gas tag node until all remaining n nodes have been established.

Method for nonlinear optimization for gas tagging and other systems

DOEpatents

Chen, T.; Gross, K.C.; Wegerich, S.

1998-01-06

A method and system are disclosed for providing nuclear fuel rods with a configuration of isotopic gas tags. The method includes selecting a true location of a first gas tag node, selecting initial locations for the remaining n-1 nodes using target gas tag compositions, generating a set of random gene pools with L nodes, applying a Hopfield network for computing on energy, or cost, for each of the L gene pools and using selected constraints to establish minimum energy states to identify optimal gas tag nodes with each energy compared to a convergence threshold and then upon identifying the gas tag node continuing this procedure until establishing the next gas tag node until all remaining n nodes have been established. 6 figs.

EM-ANIMATE - COMPUTER PROGRAM FOR DISPLAYING AND ANIMATING THE STEADY-STATE TIME-HARMONIC ELECTROMAGNETIC NEAR FIELD AND SURFACE-CURRENT SOLUTIONS

NASA Technical Reports Server (NTRS)

Hom, K. W.

1994-01-01

The EM-ANIMATE program is a specialized visualization program that displays and animates the near-field and surface-current solutions obtained from an electromagnetics program, in particular, that from MOM3D (LAR-15074). The EM-ANIMATE program is windows based and contains a user-friendly, graphical interface for setting viewing options, case selection, file manipulation, etc. EM-ANIMATE displays the field and surface-current magnitude as smooth shaded color fields (color contours) ranging from a minimum contour value to a maximum contour value for the fields and surface currents. The program can display either the total electric field or the scattered electric field in either time-harmonic animation mode or in the root mean square (RMS) average mode. The default setting is initially set to the minimum and maximum values within the field and surface current data and can be optionally set by the user. The field and surface-current value are animated by calculating and viewing the solution at user selectable radian time increments between 0 and 2pi. The surface currents can also be displayed in either time-harmonic animation mode or in RMS average mode. In RMS mode, the color contours do not vary with time, but show the constant time averaged field and surface-current magnitude solution. The electric field and surface-current directions can be displayed as scaled vector arrows which have a length proportional to the magnitude at each field grid point or surface node point. These vector properties can be viewed separately or concurrently with the field or surface-current magnitudes. Animation speed is improved by turning off the display of the vector arrows. In RMS modes, the direction vectors are still displayed as varying with time since the time averaged direction vectors would be zero length vectors. Other surface properties can optionally be viewed. These include the surface grid, the resistance value assigned to each element of the grid, and the power dissipation of each element which has an assigned resistance value. The EM-ANIMATE program will accept up to 10 different surface current cases each consisting of up to 20,000 node points and 10,000 triangle definitions and will animate one of these cases. The capability is used to compare surface-current distribution due to various initial excitation directions or electric field orientations. The program can accept up to 50 planes of field data consisting of a grid of 100 by 100 field points. These planes of data are user selectable and can be viewed individually or concurrently. With these preset limits, the program requires 55 megabytes of core memory to run. These limits can be changed in the header files to accommodate the available core memory of an individual workstation. An estimate of memory required can be made as follows: approximate memory in bytes equals (number of nodes times number of surfaces times 14 variables times bytes per word, typically 4 bytes per floating point) plus (number of field planes times number of nodes per plane times 21 variables times bytes per word). This gives the approximate memory size required to store the field and surface-current data. The total memory size is approximately 400,000 bytes plus the data memory size. The animation calculations are performed in real time at any user set time step. For Silicon Graphics Workstations that have multiple processors, this program has been optimized to perform these calculations on multiple processors to increase animation rates. The optimized program uses the SGI PFA (Power FORTRAN Accelerator) library. On single processor machines, the parallelization directives are seen as comments to the program and will have no effect on compilation or execution. EM-ANIMATE is written in FORTRAN 77 for implementation on SGI IRIS workstations running IRIX 3.0 or later. A minimum of 55Mb of RAM is required for execution of this program; however, the code may be modified to accommodate the available memory of an individual workstation. For program execution, twenty-four bit, double-buffered color capability is suggested, but not required. Sample input and output files and a sample executable are provided on the distribution medium. Electronic documentation is provided in PostScript format and in the form of IRIX man pages. The standard distribution medium for EM-ANIMATE is a .25 inch streaming magnetic IRIX tape cartridge in UNIX tar format. EM-ANIMATE is also available as part of a bundled package, COS-10048 that includes MOM3D, an IRIS program that produces electromagnetic near field and surface current solutions. This program was developed in 1993.

Characteristics of breast cancer in Central China, literature review and comparison with USA.

PubMed

Chen, Chuang; Sun, Si; Yuan, Jing-Ping; Wang, Yao-Huai; Cao, Tian-Ze; Zheng, Hong-Mei; Jiang, Xue-Qing; Gong, Yi-Ping; Tu, Yi; Yao, Feng; Hu, Ming-Bai; Li, Juan-Juan; Sun, Sheng-Rong; Wei, Wen

2016-12-01

This work was to analyze characteristics of breast cancer (BC) in Central China, summarize main characteristics in China and compare with USA. BC main characteristics from four hospitals in Central China from 2002 to 2012 were collected and analyzed. All the single and large-scale clinical reports covering at least ten years were selected and summarized to calculate the BC characteristics of China. BC Characteristics in USA were selected based on the database from Surveillance, Epidemiology, and End Results (SEER) Program. Age distribution in Central China was normal with one age peak at 45-49 years, displaying differences from USA and Chinese American with two age peaks. BC characteristics in Central China displayed distinct features from USA and Chinese American, including significant younger onset age, lower proportion of patients with stage I, lymph node negative, small tumor size and ER positive. A total ten long-term and large-scale clinical reports were selected for BC characteristics of Mainland China analysis. A total of 53,571 BC patients were enrolled from 1995 to 2012. The main characteristics of BC in Mainland China were similar as that in Central China, but were significant different from developed regions of China (Hong Kong and Taiwan), USA and Chinese American. BC characteristics in Central China displayed representative patterns of Mainland China, while showed distinct patterns from Chinese patients in other developed areas and USA. Copyright © 2016 Elsevier Ltd. All rights reserved.

Message communications of particular message types between compute nodes using DMA shadow buffers

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

Blocksome, Michael A.; Parker, Jeffrey J.

Message communications of particular message types between compute nodes using DMA shadow buffers includes: receiving a buffer identifier specifying an application buffer having a message of a particular type for transmission to a target compute node through a network; selecting one of a plurality of shadow buffers for a DMA engine on the compute node for storing the message, each shadow buffer corresponding to a slot of an injection FIFO buffer maintained by the DMA engine; storing the message in the selected shadow buffer; creating a data descriptor for the message stored in the selected shadow buffer; injecting the datamore » descriptor into the slot of the injection FIFO buffer corresponding to the selected shadow buffer; selecting the data descriptor from the injection FIFO buffer; and transmitting the message specified by the selected data descriptor through the data communications network to the target compute node.« less

Service-Oriented Node Scheduling Scheme for Wireless Sensor Networks Using Markov Random Field Model

PubMed Central

Cheng, Hongju; Su, Zhihuang; Lloret, Jaime; Chen, Guolong

2014-01-01

Future wireless sensor networks are expected to provide various sensing services and energy efficiency is one of the most important criterions. The node scheduling strategy aims to increase network lifetime by selecting a set of sensor nodes to provide the required sensing services in a periodic manner. In this paper, we are concerned with the service-oriented node scheduling problem to provide multiple sensing services while maximizing the network lifetime. We firstly introduce how to model the data correlation for different services by using Markov Random Field (MRF) model. Secondly, we formulate the service-oriented node scheduling issue into three different problems, namely, the multi-service data denoising problem which aims at minimizing the noise level of sensed data, the representative node selection problem concerning with selecting a number of active nodes while determining the services they provide, and the multi-service node scheduling problem which aims at maximizing the network lifetime. Thirdly, we propose a Multi-service Data Denoising (MDD) algorithm, a novel multi-service Representative node Selection and service Determination (RSD) algorithm, and a novel MRF-based Multi-service Node Scheduling (MMNS) scheme to solve the above three problems respectively. Finally, extensive experiments demonstrate that the proposed scheme efficiently extends the network lifetime. PMID:25384005

Epithelial–mesenchymal transition biomarkers and support vector machine guided model in preoperatively predicting regional lymph node metastasis for rectal cancer

PubMed Central

Fan, X-J; Wan, X-B; Huang, Y; Cai, H-M; Fu, X-H; Yang, Z-L; Chen, D-K; Song, S-X; Wu, P-H; Liu, Q; Wang, L; Wang, J-P

2012-01-01

Background: Current imaging modalities are inadequate in preoperatively predicting regional lymph node metastasis (RLNM) status in rectal cancer (RC). Here, we designed support vector machine (SVM) model to address this issue by integrating epithelial–mesenchymal-transition (EMT)-related biomarkers along with clinicopathological variables. Methods: Using tissue microarrays and immunohistochemistry, the EMT-related biomarkers expression was measured in 193 RC patients. Of which, 74 patients were assigned to the training set to select the robust variables for designing SVM model. The SVM model predictive value was validated in the testing set (119 patients). Results: In training set, eight variables, including six EMT-related biomarkers and two clinicopathological variables, were selected to devise SVM model. In testing set, we identified 63 patients with high risk to RLNM and 56 patients with low risk. The sensitivity, specificity and overall accuracy of SVM in predicting RLNM were 68.3%, 81.1% and 72.3%, respectively. Importantly, multivariate logistic regression analysis showed that SVM model was indeed an independent predictor of RLNM status (odds ratio, 11.536; 95% confidence interval, 4.113–32.361; P<0.0001). Conclusion: Our SVM-based model displayed moderately strong predictive power in defining the RLNM status in RC patients, providing an important approach to select RLNM high-risk subgroup for neoadjuvant chemoradiotherapy. PMID:22538975

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.

Spectrum of walk matrix for Koch network and its application

NASA Astrophysics Data System (ADS)

Xie, Pinchen; Lin, Yuan; Zhang, Zhongzhi

2015-06-01

Various structural and dynamical properties of a network are encoded in the eigenvalues of walk matrix describing random walks on the network. In this paper, we study the spectra of walk matrix of the Koch network, which displays the prominent scale-free and small-world features. Utilizing the particular architecture of the network, we obtain all the eigenvalues and their corresponding multiplicities. Based on the link between the eigenvalues of walk matrix and random target access time defined as the expected time for a walker going from an arbitrary node to another one selected randomly according to the steady-state distribution, we then derive an explicit solution to the random target access time for random walks on the Koch network. Finally, we corroborate our computation for the eigenvalues by enumerating spanning trees in the Koch network, using the connection governing eigenvalues and spanning trees, where a spanning tree of a network is a subgraph of the network, that is, a tree containing all the nodes.

Thread selection according to power characteristics during context switching on compute nodes

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

Archer, Charles J.; Blocksome, Michael A.; Randles, Amanda E.

Methods, apparatus, and products are disclosed for thread selection during context switching on a plurality of compute nodes that includes: executing, by a compute node, an application using a plurality of threads of execution, including executing one or more of the threads of execution; selecting, by the compute node from a plurality of available threads of execution for the application, a next thread of execution in dependence upon power characteristics for each of the available threads; determining, by the compute node, whether criteria for a thread context switch are satisfied; and performing, by the compute node, the thread context switchmore » if the criteria for a thread context switch are satisfied, including executing the next thread of execution.« less

Thread selection according to predefined power characteristics during context switching on compute nodes

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

None, None

Methods, apparatus, and products are disclosed for thread selection during context switching on a plurality of compute nodes that includes: executing, by a compute node, an application using a plurality of threads of execution, including executing one or more of the threads of execution; selecting, by the compute node from a plurality of available threads of execution for the application, a next thread of execution in dependence upon power characteristics for each of the available threads; determining, by the compute node, whether criteria for a thread context switch are satisfied; and performing, by the compute node, the thread context switchmore » if the criteria for a thread context switch are satisfied, including executing the next thread of execution.« less

Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

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

Archer, Charles J.; Faraj, Daniel A.; Inglett, Todd A.

Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selectedmore » link to the adjacent compute node connected to the compute node through the selected link.« less

A Distributed and Energy-Efficient Algorithm for Event K-Coverage in Underwater Sensor Networks.

PubMed

Jiang, Peng; Xu, Yiming; Liu, Jun

2017-01-19

For event dynamic K-coverage algorithms, each management node selects its assistant node by using a greedy algorithm without considering the residual energy and situations in which a node is selected by several events. This approach affects network energy consumption and balance. Therefore, this study proposes a distributed and energy-efficient event K-coverage algorithm (DEEKA). After the network achieves 1-coverage, the nodes that detect the same event compete for the event management node with the number of candidate nodes and the average residual energy, as well as the distance to the event. Second, each management node estimates the probability of its neighbor nodes' being selected by the event it manages with the distance level, the residual energy level, and the number of dynamic coverage event of these nodes. Third, each management node establishes an optimization model that uses expectation energy consumption and the residual energy variance of its neighbor nodes and detects the performance of the events it manages as targets. Finally, each management node uses a constrained non-dominated sorting genetic algorithm (NSGA-II) to obtain the Pareto set of the model and the best strategy via technique for order preference by similarity to an ideal solution (TOPSIS). The algorithm first considers the effect of harsh underwater environments on information collection and transmission. It also considers the residual energy of a node and a situation in which the node is selected by several other events. Simulation results show that, unlike the on-demand variable sensing K-coverage algorithm, DEEKA balances and reduces network energy consumption, thereby prolonging the network's best service quality and lifetime.

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.

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

Multimode and multistate ladder oscillator and frequency recognition device

NASA Technical Reports Server (NTRS)

Aumann, Herbert M. (Inventor)

1976-01-01

A ladder oscillator composed of capacitive and inductive impedances connected together to form a ladder network which has a chosen number N oscillation modes at N different frequencies. Each oscillation mode is characterized by a unique standing wave voltage pattern along the nodes of the ladder oscillator, with the mode in which the ladder oscillator is oscillating being determinable from the amplitudes or phase of the oscillations at the nodes. A logic circuit may be connected to the nodes of the oscillator to compare the phases of selected nodes and thereby determine which mode the oscillator is oscillating in. A ladder oscillator composed of passive capacitive and inductive impedances can be utilized as a frequency recognition device, since the passive ladder oscillator will display the characteristic standing wave patterns if an input signal impressed upon the ladder oscillator is close to one of the mode frequencies of the oscillator. A CL ladder oscillator having series capacitive impedances and shunt inductive impedances can exhibit sustained and autonomous oscillations if active nonlinear devices are connected in parallel with the shunt inductive impedances. The active CL ladder oscillator can be synchronized to input frequencies impressed upon the oscillator, and will continue to oscillate after the input signal has been removed at a mode frequency which is, in general, nearest to the input signal frequency. Autonomous oscillations may also be obtained as desired from the active CL ladder oscillator at the mode frequencies.

A Distributed and Energy-Efficient Algorithm for Event K-Coverage in Underwater Sensor Networks

PubMed Central

Jiang, Peng; Xu, Yiming; Liu, Jun

2017-01-01

For event dynamic K-coverage algorithms, each management node selects its assistant node by using a greedy algorithm without considering the residual energy and situations in which a node is selected by several events. This approach affects network energy consumption and balance. Therefore, this study proposes a distributed and energy-efficient event K-coverage algorithm (DEEKA). After the network achieves 1-coverage, the nodes that detect the same event compete for the event management node with the number of candidate nodes and the average residual energy, as well as the distance to the event. Second, each management node estimates the probability of its neighbor nodes’ being selected by the event it manages with the distance level, the residual energy level, and the number of dynamic coverage event of these nodes. Third, each management node establishes an optimization model that uses expectation energy consumption and the residual energy variance of its neighbor nodes and detects the performance of the events it manages as targets. Finally, each management node uses a constrained non-dominated sorting genetic algorithm (NSGA-II) to obtain the Pareto set of the model and the best strategy via technique for order preference by similarity to an ideal solution (TOPSIS). The algorithm first considers the effect of harsh underwater environments on information collection and transmission. It also considers the residual energy of a node and a situation in which the node is selected by several other events. Simulation results show that, unlike the on-demand variable sensing K-coverage algorithm, DEEKA balances and reduces network energy consumption, thereby prolonging the network’s best service quality and lifetime. PMID:28106837

Reducing power consumption while performing collective operations on a plurality of compute nodes

DOEpatents

Archer, Charles J [Rochester, MN; Blocksome, Michael A [Rochester, MN; Peters, Amanda E [Rochester, MN; Ratterman, Joseph D [Rochester, MN; Smith, Brian E [Rochester, MN

2011-10-18

Methods, apparatus, and products are disclosed for reducing power consumption while performing collective operations on a plurality of compute nodes that include: receiving, by each compute node, instructions to perform a type of collective operation; selecting, by each compute node from a plurality of collective operations for the collective operation type, a particular collective operation in dependence upon power consumption characteristics for each of the plurality of collective operations; and executing, by each compute node, the selected collective operation.

Providing Common Access Mechanisms for Dissimilar Network Interconnection Nodes

DTIC Science & Technology

1991-02-01

Network management involves both maintaining adequate data transmission capabilities in the face of growing and changing needs and keeping the network...Display Only tools are able to obtain information from an IN or a set of INs and display this information, but are not able to change the...configuration or state of an IN. 2. Display and Control tools have the same capabilities as Display Only tools, but in addition are capable of changing the

Perceptual grouping effects on cursor movement expectations.

PubMed

Dorneich, Michael C; Hamblin, Christopher J; Lancaster, Jeff A; Olofinboba, Olu

2014-05-01

Two studies were conducted to develop an understanding of factors that drive user expectations when navigating between discrete elements on a display via a limited degree-of-freedom cursor control device. For the Orion Crew Exploration Vehicle spacecraft, a free-floating cursor with a graphical user interface (GUI) would require an unachievable level of accuracy due to expected acceleration and vibration conditions during dynamic phases of flight. Therefore, Orion program proposed using a "caged" cursor to "jump" from one controllable element (node) on the GUI to another. However, nodes are not likely to be arranged on a rectilinear grid, and so movements between nodes are not obvious. Proximity between nodes, direction of nodes relative to each other, and context features may all contribute to user cursor movement expectations. In an initial study, we examined user expectations based on the nodes themselves. In a second study, we examined the effect of context features on user expectations. The studies established that perceptual grouping effects influence expectations to varying degrees. Based on these results, a simple rule set was developed to support users in building a straightforward mental model that closely matches their natural expectations for cursor movement. The results will help designers of display formats take advantage of the natural context-driven cursor movement expectations of users to reduce navigation errors, increase usability, and decrease access time. The rules set and guidelines tie theory to practice and can be applied in environments where vibration or acceleration are significant, including spacecraft, aircraft, and automobiles.

Analytical network process based optimum cluster head selection in wireless sensor network.

PubMed

Farman, Haleem; Javed, Huma; Jan, Bilal; Ahmad, Jamil; Ali, Shaukat; Khalil, Falak Naz; Khan, Murad

2017-01-01

Wireless Sensor Networks (WSNs) are becoming ubiquitous in everyday life due to their applications in weather forecasting, surveillance, implantable sensors for health monitoring and other plethora of applications. WSN is equipped with hundreds and thousands of small sensor nodes. As the size of a sensor node decreases, critical issues such as limited energy, computation time and limited memory become even more highlighted. In such a case, network lifetime mainly depends on efficient use of available resources. Organizing nearby nodes into clusters make it convenient to efficiently manage each cluster as well as the overall network. In this paper, we extend our previous work of grid-based hybrid network deployment approach, in which merge and split technique has been proposed to construct network topology. Constructing topology through our proposed technique, in this paper we have used analytical network process (ANP) model for cluster head selection in WSN. Five distinct parameters: distance from nodes (DistNode), residual energy level (REL), distance from centroid (DistCent), number of times the node has been selected as cluster head (TCH) and merged node (MN) are considered for CH selection. The problem of CH selection based on these parameters is tackled as a multi criteria decision system, for which ANP method is used for optimum cluster head selection. Main contribution of this work is to check the applicability of ANP model for cluster head selection in WSN. In addition, sensitivity analysis is carried out to check the stability of alternatives (available candidate nodes) and their ranking for different scenarios. The simulation results show that the proposed method outperforms existing energy efficient clustering protocols in terms of optimum CH selection and minimizing CH reselection process that results in extending overall network lifetime. This paper analyzes that ANP method used for CH selection with better understanding of the dependencies of different components involved in the evaluation process.

Analytical network process based optimum cluster head selection in wireless sensor network

PubMed Central

Javed, Huma; Jan, Bilal; Ahmad, Jamil; Ali, Shaukat; Khalil, Falak Naz; Khan, Murad

2017-01-01

Wireless Sensor Networks (WSNs) are becoming ubiquitous in everyday life due to their applications in weather forecasting, surveillance, implantable sensors for health monitoring and other plethora of applications. WSN is equipped with hundreds and thousands of small sensor nodes. As the size of a sensor node decreases, critical issues such as limited energy, computation time and limited memory become even more highlighted. In such a case, network lifetime mainly depends on efficient use of available resources. Organizing nearby nodes into clusters make it convenient to efficiently manage each cluster as well as the overall network. In this paper, we extend our previous work of grid-based hybrid network deployment approach, in which merge and split technique has been proposed to construct network topology. Constructing topology through our proposed technique, in this paper we have used analytical network process (ANP) model for cluster head selection in WSN. Five distinct parameters: distance from nodes (DistNode), residual energy level (REL), distance from centroid (DistCent), number of times the node has been selected as cluster head (TCH) and merged node (MN) are considered for CH selection. The problem of CH selection based on these parameters is tackled as a multi criteria decision system, for which ANP method is used for optimum cluster head selection. Main contribution of this work is to check the applicability of ANP model for cluster head selection in WSN. In addition, sensitivity analysis is carried out to check the stability of alternatives (available candidate nodes) and their ranking for different scenarios. The simulation results show that the proposed method outperforms existing energy efficient clustering protocols in terms of optimum CH selection and minimizing CH reselection process that results in extending overall network lifetime. This paper analyzes that ANP method used for CH selection with better understanding of the dependencies of different components involved in the evaluation process. PMID:28719616

Archiving Spectral Libraries in the Planetary Data System

NASA Astrophysics Data System (ADS)

Slavney, S.; Guinness, E. A.; Scholes, D.; Zastrow, A.

2017-12-01

Spectral libraries are becoming popular candidates for archiving in PDS. With the increase in the number of individual investigators funded by programs such as NASA's PDART, the PDS Geosciences Node is receiving many requests for support from proposers wishing to archive various forms of laboratory spectra. To accommodate the need for a standardized approach to archiving spectra, the Geosciences Node has designed the PDS Spectral Library Data Dictionary, which contains PDS4 classes and attributes specifically for labeling spectral data, including a classification scheme for samples. The Reflectance Experiment Laboratory (RELAB) at Brown University, which has long been a provider of spectroscopy equipment and services to the science community, has provided expert input into the design of the dictionary. Together the Geosciences Node and RELAB are preparing the whole of the RELAB Spectral Library, consisting of many thousands of spectra collected over the years, to be archived in PDS. An online interface for searching, displaying, and downloading selected spectra is planned, using the Spectral Library metadata recorded in the PDS labels. The data dictionary and online interface will be extended to include spectral libraries submitted by other data providers. The Spectral Library Data Dictionary is now available from PDS at https://pds.nasa.gov/pds4/schema/released/. It can be used in PDS4 labels for reflectance spectra as well as for Raman, XRF, XRD, LIBS, and other types of spectra. Ancillary data such as images, chemistry, and abundance data are also supported. To help generate PDS4-compliant labels for spectra, the Geosciences Node provides a label generation program called MakeLabels (http://pds-geosciences.wustl.edu/tools/makelabels.html) which creates labels from a template, and which can be used for any kind of PDS4 label. For information, contact the Geosciences Node at geosci@wunder.wustl.edu.

Drupal Contributed Modules

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

Fries, Samuel B.; French, Shelane

2014-10-01

These Drupal Modules extend the functionality of Drupal by including specific styles for dates and tabs, publishing options for scheduled and immediate publication of content modes, field visibility in content forms, keyword block filters (taxonomy based), adding content nodes to a specified queue for display in views, and status display of workflow settings.

Methods, apparatus and system for selective duplication of subtasks

DOEpatents

Andrade Costa, Carlos H.; Cher, Chen-Yong; Park, Yoonho; Rosenburg, Bryan S.; Ryu, Kyung D.

2016-03-29

A method for selective duplication of subtasks in a high-performance computing system includes: monitoring a health status of one or more nodes in a high-performance computing system, where one or more subtasks of a parallel task execute on the one or more nodes; identifying one or more nodes as having a likelihood of failure which exceeds a first prescribed threshold; selectively duplicating the one or more subtasks that execute on the one or more nodes having a likelihood of failure which exceeds the first prescribed threshold; and notifying a messaging library that one or more subtasks were duplicated.

Fault tolerant hypercube computer system architecture

NASA Technical Reports Server (NTRS)

Madan, Herb S. (Inventor); Chow, Edward (Inventor)

1989-01-01

A fault-tolerant multiprocessor computer system of the hypercube type comprising a hierarchy of computers of like kind which can be functionally substituted for one another as necessary is disclosed. Communication between the working nodes is via one communications network while communications between the working nodes and watch dog nodes and load balancing nodes higher in the structure is via another communications network separate from the first. A typical branch of the hierarchy reporting to a master node or host computer comprises, a plurality of first computing nodes; a first network of message conducting paths for interconnecting the first computing nodes as a hypercube. The first network provides a path for message transfer between the first computing nodes; a first watch dog node; and a second network of message connecting paths for connecting the first computing nodes to the first watch dog node independent from the first network, the second network provides an independent path for test message and reconfiguration affecting transfers between the first computing nodes and the first switch watch dog node. There is additionally, a plurality of second computing nodes; a third network of message conducting paths for interconnecting the second computing nodes as a hypercube. The third network provides a path for message transfer between the second computing nodes; a fourth network of message conducting paths for connecting the second computing nodes to the first watch dog node independent from the third network. The fourth network provides an independent path for test message and reconfiguration affecting transfers between the second computing nodes and the first watch dog node; and a first multiplexer disposed between the first watch dog node and the second and fourth networks for allowing the first watch dog node to selectively communicate with individual ones of the computing nodes through the second and fourth networks; as well as, a second watch dog node operably connected to the first multiplexer whereby the second watch dog node can selectively communicate with individual ones of the computing nodes through the second and fourth networks. The branch is completed by a first load balancing node; and a second multiplexer connected between the first load balancing node and the first and second watch dog nodes, allowing the first load balancing node to selectively communicate with the first and second watch dog nodes.

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.

Distributed Transforms for Efficient Data Gathering in Sensor Networks

NASA Technical Reports Server (NTRS)

Ortega, Antonio (Inventor); Shen, Godwin (Inventor); Narang, Sunil K. (Inventor); Perez-Trufero, Javier (Inventor)

2014-01-01

Devices, systems, and techniques for data collecting network such as wireless sensors are disclosed. A described technique includes detecting one or more remote nodes included in the wireless sensor network using a local power level that controls a radio range of the local node. The technique includes transmitting a local outdegree. The local outdegree can be based on a quantity of the one or more remote nodes. The technique includes receiving one or more remote outdegrees from the one or more remote nodes. The technique includes determining a local node type of the local node based on detecting a node type of the one or more remote nodes, using the one or more remote outdegrees, and using the local outdegree. The technique includes adjusting characteristics, including an energy usage characteristic and a data compression characteristic, of the wireless sensor network by selectively modifying the local power level and selectively changing the local node type.

The role of CEUS in characterization of superficial lymph nodes: a single center prospective study

PubMed Central

de Stefano, Giorgio; Scognamiglio, Umberto; Di Martino, Filomena; Parrella, Roberto; Scarano, Francesco; Signoriello, Giuseppe; Farella, Nunzia

2016-01-01

Accurate lymph node characterization is important in a large number of clinical settings. We evaluated the usefulness of Contrast Enhanced Ultrasound (CEUS) in distinguishing between benign and malignant lymph nodes compared with conventional ultrasonography in the differential diagnosis of superficial lymphadenopathy. We present our experience for 111 patients enrolled in a single center. 111 superficial lymph nodes were selected and only 1 lymph node per patient underwent CEUS. A definitive diagnosis for all lymph nodes was obtained by ultrasonographically guided biopsy and/or excision biopsy. The size of the lymph nodes, the site (neck, axilla, inguinal region) being easily accessible for biopsy, and the US and color Doppler US characteristics guided us in selecting the nodes to be evaluated by CEUS. In our study we identified different enhancement patterns in benign and malignant lymph nodes, with a high degree of diagnostic accuracy for superficial lymphadenopathy in comparison with conventional US. PMID:27191746

Zone routing in a torus network

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

Chen, Dong; Heidelberger, Philip; Kumar, Sameer

A system for routing data in a network comprising a network logic device at a sending node for determining a path between the sending node and a receiving node, wherein the network logic device sets one or more selection bits and one or more hint bits within the data packet, a control register for storing one or more masks, wherein the network logic device uses the one or more selection bits to select a mask from the control register and the network logic device applies the selected mask to the hint bits to restrict routing of the data packet tomore » one or more routing directions for the data packet within the network and selects one of the restricted routing directions from the one or more routing directions and sends the data packet along a link in the selected routing direction toward the receiving node.« less

Novel insights into the distribution of cardiac HCN channels: an expression study in the mouse heart.

PubMed

Herrmann, Stefan; Layh, Beate; Ludwig, Andreas

2011-12-01

HCN pacemaker channels (I(f) channels) are believed to contribute to important functions in the heart; thus these channels became an attractive target for generating transgenic mouse mutants to elucidate their role in physiological and pathophysiological cardiac conditions. A full understanding of cardiac I(f) and the interpretation of studies using HCN mouse mutants require detailed information about the expression profile of the individual HCN subunits. Here we investigate the cardiac expression pattern of the HCN isoforms at the mRNA as well as at the protein level. The specificity of antibodies used was strictly confirmed by the use of HCN1, HCN2 and HCN4 knockout animals. We find a low, but highly differential HCN expression profile outside the cardiac conduction pathway including left and right atria and ventricles. Additionally HCN distribution was investigated in tissue slices of the sinoatrial node, the atrioventricular node, the bundle of His and the bundle branches. The conduction system was marked by acetylcholine esterase staining. HCN4 was confirmed as the predominant isoform of the primary pacemaker followed by a distinct expression of HCN1. In contrast HCN2 shows only a confined expression to individual pacemaker cells. Immunolabeling of the AV-node reveals also a pronounced specificity for HCN1 and HCN4. Compared to the SN and AVN we found a low but selective expression of HCN4 as the only isoform in the atrioventricular bundle. However in the bundle branches HCN1, HCN4 and also HCN2 show a prominent and selective expression pattern. Our results display a characteristic distribution of individual HCN isoforms in several cardiac compartments and reveal that beside HCN4, HCN1 represents the isoform which is selectively expressed in most parts of the conduction system suggesting a substantial contribution of HCN1 to pacemaking. 2011 Elsevier Ltd. All rights reserved.

Multi Robot Path Planning for Budgeted Active Perception with Self-Organising Maps

DTIC Science & Technology

2016-10-04

Multi- Robot Path Planning for Budgeted Active Perception with Self-Organising Maps Graeme Best1, Jan Faigl2 and Robert Fitch1 Abstract— We propose a...optimise paths for a multi- robot team that aims to maximally observe a set of nodes in the environment. The selected nodes are observed by visiting...regions, each node has an observation reward, and the robots are constrained by travel budgets. The SOM algorithm jointly selects and allocates nodes

A review of contemporary methods for the presentation of scientific uncertainty.

PubMed

Makinson, K A; Hamby, D M; Edwards, J A

2012-12-01

Graphic methods for displaying uncertainty are often the most concise and informative way to communicate abstract concepts. Presentation methods currently in use for the display and interpretation of scientific uncertainty are reviewed. Numerous subjective and objective uncertainty display methods are presented, including qualitative assessments, node and arrow diagrams, standard statistical methods, box-and-whisker plots,robustness and opportunity functions, contribution indexes, probability density functions, cumulative distribution functions, and graphical likelihood functions.

Final Report: Computer-aided Human Centric Cyber Situation Awareness

DTIC Science & Technology

2016-03-20

logs, OS audit trails, vulnerability reports, and packet dumps ), weeding out the false positives, grouping the related indicators so that different...short time duration of each visual stimulus in an fMRI study, we have designed “network security analysis cards ” that require the subject to...determine whether alerts in the cards indicate malicious events. Two types of visual displays of alerts (i.e., tabular display and node-link display) are

[Pay attention to the selective lateral pelvic lymph node dissection in mid-low rectal cancer].

PubMed

Meng, Wenjian; Wang, Ziqiang

2017-03-25

Lateral pelvic lymph node metastasis is an important metastatic mode and a major cause of locoregional recurrence of mid-low rectal cancer. Recently, there is an East-West discrepancy in regard to the diagnosis, clinical significance, treatment and prognosis of lateral pelvic lymph node metastasis. In the West, lateral nodal involvement may represent systemic disease and preoperative chemoradiotherapy can sterilize clinically suspected lateral nodes. Thus, in many Western countries, the standard therapy for lower rectal cancer is total mesorectal excision with chemoradiotherapy, and pelvic sidewall dissection is rarely performed. In the East, and Japan in particular, however, there is a positive attitude in regard to lateral pelvic lymph node dissection (LPND). They consider that lateral pelvic lymph node metastasis is as regional metastasis, and the clinically suspected lateral nodes can not be removed by neoadjuvant chemoradiotherapy. The selective LPND after neoadjuvant chemoradiotherapy may be found to be promising treatment for the improvement of therapeutic benefits in these patients. Therefore, the large-scale prospective studies are urgently required to improve selection criteria for LPND and neoadjuvant treatment to prevent overtreatment in the near future. Selective LPND after neoadjuvant treatment based on modern imaging techniques is expected to reduce locoregional recurrence and improve long-term survival in patients with mid-low rectal cancer.

Endometrial Cancer and the Role of Lymphadenectomy.

PubMed

Clark, Leslie H; Soper, John T

2016-06-01

The role of lymph node dissection in early-stage endometrial cancer is highly debated, but staging and prognosis are dependent on knowledge of lymph node metastasis. We sought to review the available data on the use of lymph node assessment in presumed early-stage endometrial cancer. A comprehensive literature review was performed using MEDLINE, the Cochrane Collaborative Database, and PubMed. There is limited retrospective data that suggest a therapeutic benefit to lymphadenectomy. Prospective randomized trials have not shown a benefit to lymphadenectomy in low-risk patients, but found significant morbidity in patients undergoing lymphadenectomy. Selective lymph node assessment should be used in low-risk endometrial cancer. Sentinel lymph node assessment is emerging as a potential strategy for lymph node assessment. Selective use of lymphadenectomy in early-stage endometrial cancer can reduce the morbidity associated with lymph node dissection without compromising clinical outcomes. Multiple strategies are available including sentinel lymph nodes and risk factor based lymphadenectomy.

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.

System and method for modeling and analyzing complex scenarios

DOEpatents

Shevitz, Daniel Wolf

2013-04-09

An embodiment of the present invention includes a method for analyzing and solving possibility tree. A possibility tree having a plurality of programmable nodes is constructed and solved with a solver module executed by a processor element. The solver module executes the programming of said nodes, and tracks the state of at least a variable through a branch. When a variable of said branch is out of tolerance with a parameter, the solver disables remaining nodes of the branch and marks the branch as an invalid solution. The valid solutions are then aggregated and displayed as valid tree solutions.

Visualizing weighted networks: a performance comparison of adjacency matrices versus node-link diagrams

NASA Astrophysics Data System (ADS)

McIntire, John P.; Osesina, O. Isaac; Bartley, Cecilia; Tudoreanu, M. Eduard; Havig, Paul R.; Geiselman, Eric E.

2012-06-01

Ensuring the proper and effective ways to visualize network data is important for many areas of academia, applied sciences, the military, and the public. Fields such as social network analysis, genetics, biochemistry, intelligence, cybersecurity, neural network modeling, transit systems, communications, etc. often deal with large, complex network datasets that can be difficult to interact with, study, and use. There have been surprisingly few human factors performance studies on the relative effectiveness of different graph drawings or network diagram techniques to convey information to a viewer. This is particularly true for weighted networks which include the strength of connections between nodes, not just information about which nodes are linked to other nodes. We describe a human factors study in which participants performed four separate network analysis tasks (finding a direct link between given nodes, finding an interconnected node between given nodes, estimating link strengths, and estimating the most densely interconnected nodes) on two different network visualizations: an adjacency matrix with a heat-map versus a node-link diagram. The results should help shed light on effective methods of visualizing network data for some representative analysis tasks, with the ultimate goal of improving usability and performance for viewers of network data displays.

Visual search and the aging brain: discerning the effects of age-related brain volume shrinkage on alertness, feature binding, and attentional control.

PubMed

Müller-Oehring, Eva M; Schulte, Tilman; Rohlfing, Torsten; Pfefferbaum, Adolf; Sullivan, Edith V

2013-01-01

Decline in visuospatial abilities with advancing age has been attributed to a demise of bottom-up and top-down functions involving sensory processing, selective attention, and executive control. These functions may be differentially affected by age-related volume shrinkage of subcortical and cortical nodes subserving the dorsal and ventral processing streams and the corpus callosum mediating interhemispheric information exchange. Fifty-five healthy adults (25-84 years) underwent structural MRI and performed a visual search task to test perceptual and attentional demands by combining feature-conjunction searches with "gestalt" grouping and attentional cueing paradigms. Poorer conjunction, but not feature, search performance was related to older age and volume shrinkage of nodes in the dorsolateral processing stream. When displays allowed perceptual grouping through distractor homogeneity, poorer conjunction-search performance correlated with smaller ventrolateral prefrontal cortical and callosal volumes. An alerting cue attenuated age effects on conjunction search, and the alertness benefit was associated with thalamic, callosal, and temporal cortex volumes. Our results indicate that older adults can capitalize on early parallel stages of visual information processing, whereas age-related limitations arise at later serial processing stages requiring self-guided selective attention and executive control. These limitations are explained in part by age-related brain volume shrinkage and can be mitigated by external cues.

An Energy-Efficient Approach to Enhance Virtual Sensors Provisioning in Sensor Clouds Environments

PubMed Central

Filho, Raimir Holanda; Rabêlo, Ricardo de Andrade L.; de Carvalho, Carlos Giovanni N.; Mendes, Douglas Lopes de S.; Costa, Valney da Gama

2018-01-01

Virtual sensors provisioning is a central issue for sensors cloud middleware since it is responsible for selecting physical nodes, usually from Wireless Sensor Networks (WSN) of different owners, to handle user’s queries or applications. Recent works perform provisioning by clustering sensor nodes based on the correlation measurements and then selecting as few nodes as possible to preserve WSN energy. However, such works consider only homogeneous nodes (same set of sensors). Therefore, those works are not entirely appropriate for sensor clouds, which in most cases comprises heterogeneous sensor nodes. In this paper, we propose ACxSIMv2, an approach to enhance the provisioning task by considering heterogeneous environments. Two main algorithms form ACxSIMv2. The first one, ACASIMv1, creates multi-dimensional clusters of sensor nodes, taking into account the measurements correlations instead of the physical distance between nodes like most works on literature. Then, the second algorithm, ACOSIMv2, based on an Ant Colony Optimization system, selects an optimal set of sensors nodes from to respond user’s queries while attending all parameters and preserving the overall energy consumption. Results from initial experiments show that the approach reduces significantly the sensor cloud energy consumption compared to traditional works, providing a solution to be considered in sensor cloud scenarios. PMID:29495406

An Energy-Efficient Approach to Enhance Virtual Sensors Provisioning in Sensor Clouds Environments.

PubMed

Lemos, Marcus Vinícius de S; Filho, Raimir Holanda; Rabêlo, Ricardo de Andrade L; de Carvalho, Carlos Giovanni N; Mendes, Douglas Lopes de S; Costa, Valney da Gama

2018-02-26

Virtual sensors provisioning is a central issue for sensors cloud middleware since it is responsible for selecting physical nodes, usually from Wireless Sensor Networks (WSN) of different owners, to handle user's queries or applications. Recent works perform provisioning by clustering sensor nodes based on the correlation measurements and then selecting as few nodes as possible to preserve WSN energy. However, such works consider only homogeneous nodes (same set of sensors). Therefore, those works are not entirely appropriate for sensor clouds, which in most cases comprises heterogeneous sensor nodes. In this paper, we propose ACxSIMv2, an approach to enhance the provisioning task by considering heterogeneous environments. Two main algorithms form ACxSIMv2. The first one, ACASIMv1, creates multi-dimensional clusters of sensor nodes, taking into account the measurements correlations instead of the physical distance between nodes like most works on literature. Then, the second algorithm, ACOSIMv2, based on an Ant Colony Optimization system, selects an optimal set of sensors nodes from to respond user's queries while attending all parameters and preserving the overall energy consumption. Results from initial experiments show that the approach reduces significantly the sensor cloud energy consumption compared to traditional works, providing a solution to be considered in sensor cloud scenarios.

EANM-EORTC general recommendations for sentinel node diagnostics in melanoma.

PubMed

Chakera, Annette H; Hesse, Birger; Burak, Zeynep; Ballinger, James R; Britten, Allan; Caracò, Corrado; Cochran, Alistair J; Cook, Martin G; Drzewiecki, Krzysztof T; Essner, Richard; Even-Sapir, Einat; Eggermont, Alexander M M; Stopar, Tanja Gmeiner; Ingvar, Christian; Mihm, Martin C; McCarthy, Stanley W; Mozzillo, Nicola; Nieweg, Omgo E; Scolyer, Richard A; Starz, Hans; Thompson, John F; Trifirò, Giuseppe; Viale, Giuseppe; Vidal-Sicart, Sergi; Uren, Roger; Waddington, Wendy; Chiti, Arturo; Spatz, Alain; Testori, Alessandro

2009-10-01

The accurate diagnosis of a sentinel node in melanoma includes a sequence of procedures from different medical specialities (nuclear medicine, surgery, oncology, and pathology). The items covered are presented in 11 sections and a reference list: (1) definition of a sentinel node, (2) clinical indications, (3) radiopharmaceuticals and activity injected, (4) dosimetry, (5) injection technique, (6) image acquisition and interpretation, (7) report and display, (8) use of dye, (9) gamma probe detection, (10) surgical techniques in sentinel node biopsy, and (11) pathological evaluation of melanoma-draining sentinel lymph nodes. If specific recommendations given cannot be based on evidence from original, scientific studies, referral is given to "general consensus" and similar expressions. The recommendations are designed to assist in the practice of referral to, performance, interpretation and reporting of all steps of the sentinel node procedure in the hope of setting state-of-the-art standards for good-quality evaluation of possible spread to the lymphatic system in intermediate-to-high risk melanoma without clinical signs of dissemination.

Semi-automatic central-chest lymph-node definition from 3D MDCT images

NASA Astrophysics Data System (ADS)

Lu, Kongkuo; Higgins, William E.

2010-03-01

Central-chest lymph nodes play a vital role in lung-cancer staging. The three-dimensional (3D) definition of lymph nodes from multidetector computed-tomography (MDCT) images, however, remains an open problem. This is because of the limitations in the MDCT imaging of soft-tissue structures and the complicated phenomena that influence the appearance of a lymph node in an MDCT image. In the past, we have made significant efforts toward developing (1) live-wire-based segmentation methods for defining 2D and 3D chest structures and (2) a computer-based system for automatic definition and interactive visualization of the Mountain central-chest lymph-node stations. Based on these works, we propose new single-click and single-section live-wire methods for segmenting central-chest lymph nodes. The single-click live wire only requires the user to select an object pixel on one 2D MDCT section and is designed for typical lymph nodes. The single-section live wire requires the user to process one selected 2D section using standard 2D live wire, but it is more robust. We applied these methods to the segmentation of 20 lymph nodes from two human MDCT chest scans (10 per scan) drawn from our ground-truth database. The single-click live wire segmented 75% of the selected nodes successfully and reproducibly, while the success rate for the single-section live wire was 85%. We are able to segment the remaining nodes, using our previously derived (but more interaction intense) 2D live-wire method incorporated in our lymph-node analysis system. Both proposed methods are reliable and applicable to a wide range of pulmonary lymph nodes.

Magnetic Resonance Lymphography-Guided Selective High-Dose Lymph Node Irradiation in Prostate Cancer

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

Meijer, Hanneke J.M., E-mail: H.Meijer@rther.umcn.nl; Debats, Oscar A.; Kunze-Busch, Martina

2012-01-01

Purpose: To demonstrate the feasibility of magnetic resonance lymphography (MRL) -guided delineation of a boost volume and an elective target volume for pelvic lymph node irradiation in patients with prostate cancer. The feasibility of irradiating these volumes with a high-dose boost to the MRL-positive lymph nodes in conjunction with irradiation of the prostate using intensity-modulated radiotherapy (IMRT) was also investigated. Methods and Materials: In 4 prostate cancer patients with a high risk of lymph node involvement but no enlarged lymph nodes on CT and/or MRI, MRL detected pathological lymph nodes in the pelvis. These lymph nodes were identified and delineatedmore » on a radiotherapy planning CT to create a boost volume. Based on the location of the MRL-positive lymph nodes, the standard elective pelvic target volume was individualized. An IMRT plan with a simultaneous integrated boost (SIB) was created with dose prescriptions of 42 Gy to the pelvic target volume, a boost to 60 Gy to the MRL-positive lymph nodes, and 72 Gy to the prostate. Results: All MRL-positive lymph nodes could be identified on the planning CT. This information could be used to delineate a boost volume and to individualize the pelvic target volume for elective irradiation. IMRT planning delivered highly acceptable radiotherapy plans with regard to the prescribed dose levels and the dose to the organs at risk (OARs). Conclusion: MRL can be used to select patients with limited lymph node involvement for pelvic radiotherapy. MRL-guided delineation of a boost volume and an elective pelvic target volume for selective high-dose lymph node irradiation with IMRT is feasible. Whether this approach will result in improved outcome for these patients needs to be investigated in further clinical studies.« less

Structure and Dynamics of Zr6O8 Metal-Organic Framework Node Surfaces Probed with Ethanol Dehydration as a Catalytic Test Reaction.

PubMed

Yang, Dong; Ortuño, Manuel A; Bernales, Varinia; Cramer, Christopher J; Gagliardi, Laura; Gates, Bruce C

2018-03-14

Some metal-organic frameworks (MOFs) incorporate nodes that are metal oxide clusters such as Zr 6 O 8 . Vacancies on the node surfaces, accidental or by design, act as catalytic sites. Here, we report elucidation of the chemistry of Zr 6 O 8 nodes in the MOFs UiO-66 and UiO-67 having used infrared and nuclear magnetic resonance spectroscopies to determine the ligands on the node surfaces originating from the solvents and modifiers used in the syntheses and having elucidated the catalytic properties of the nodes for ethanol dehydration, which takes place selectively to make diethyl ether but not ethylene at 473-523 K. Density functional theory calculations show that the key to the selective catalysis is the breaking of node-linker bonds (or the accidental adjacency of open/defect sites) that allows catalytically fruitful bonding of the reactant ethanol to neighboring sites on the nodes, facilitating the bimolecular ether formation through an S N 2 mechanism.

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.

Computational lymphatic node models in pediatric and adult hybrid phantoms for radiation dosimetry

NASA Astrophysics Data System (ADS)

Lee, Choonsik; Lamart, Stephanie; Moroz, Brian E.

2013-03-01

We developed models of lymphatic nodes for six pediatric and two adult hybrid computational phantoms to calculate the lymphatic node dose estimates from external and internal radiation exposures. We derived the number of lymphatic nodes from the recommendations in International Commission on Radiological Protection (ICRP) Publications 23 and 89 at 16 cluster locations for the lymphatic nodes: extrathoracic, cervical, thoracic (upper and lower), breast (left and right), mesentery (left and right), axillary (left and right), cubital (left and right), inguinal (left and right) and popliteal (left and right), for different ages (newborn, 1-, 5-, 10-, 15-year-old and adult). We modeled each lymphatic node within the voxel format of the hybrid phantoms by assuming that all nodes have identical size derived from published data except narrow cluster sites. The lymph nodes were generated by the following algorithm: (1) selection of the lymph node site among the 16 cluster sites; (2) random sampling of the location of the lymph node within a spherical space centered at the chosen cluster site; (3) creation of the sphere or ovoid of tissue representing the node based on lymphatic node characteristics defined in ICRP Publications 23 and 89. We created lymph nodes until the pre-defined number of lymphatic nodes at the selected cluster site was reached. This algorithm was applied to pediatric (newborn, 1-, 5-and 10-year-old male, and 15-year-old males) and adult male and female ICRP-compliant hybrid phantoms after voxelization. To assess the performance of our models for internal dosimetry, we calculated dose conversion coefficients, called S values, for selected organs and tissues with Iodine-131 distributed in six lymphatic node cluster sites using MCNPX2.6, a well validated Monte Carlo radiation transport code. Our analysis of the calculations indicates that the S values were significantly affected by the location of the lymph node clusters and that the values increased for smaller phantoms due to the shorter inter-organ distances compared to the bigger phantoms. By testing sensitivity of S values to random sampling and voxel resolution, we confirmed that the lymph node model is reasonably stable and consistent for different random samplings and voxel resolutions.

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

Optimizing real-time Web-based user interfaces for observatories

NASA Astrophysics Data System (ADS)

Gibson, J. Duane; Pickering, Timothy E.; Porter, Dallan; Schaller, Skip

2008-08-01

In using common HTML/Ajax approaches for web-based data presentation and telescope control user interfaces at the MMT Observatory (MMTO), we rapidly were confronted with web browser performance issues. Much of the operational data at the MMTO is highly dynamic and is constantly changing during normal operations. Status of telescope subsystems must be displayed with minimal latency to telescope operators and other users. A major motivation of migrating toward web-based applications at the MMTO is to provide easy access to current and past observatory subsystem data for a wide variety of users on their favorite operating system through a familiar interface, their web browser. Performance issues, especially for user interfaces that control telescope subsystems, led to investigations of more efficient use of HTML/Ajax and web server technologies as well as other web-based technologies, such as Java and Flash/Flex. The results presented here focus on techniques for optimizing HTML/Ajax web applications with near real-time data display. This study indicates that direct modification of the contents or "nodeValue" attribute of text nodes is the most efficient method of updating data values displayed on a web page. Other optimization techniques are discussed for web-based applications that display highly dynamic data.

Tau burden and the functional connectome in Alzheimer's disease and progressive supranuclear palsy.

PubMed

Cope, Thomas E; Rittman, Timothy; Borchert, Robin J; Jones, P Simon; Vatansever, Deniz; Allinson, Kieren; Passamonti, Luca; Vazquez Rodriguez, Patricia; Bevan-Jones, W Richard; O'Brien, John T; Rowe, James B

2018-02-01

Alzheimer's disease and progressive supranuclear palsy (PSP) represent neurodegenerative tauopathies with predominantly cortical versus subcortical disease burden. In Alzheimer's disease, neuropathology and atrophy preferentially affect 'hub' brain regions that are densely connected. It was unclear whether hubs are differentially affected by neurodegeneration because they are more likely to receive pathological proteins that propagate trans-neuronally, in a prion-like manner, or whether they are selectively vulnerable due to a lack of local trophic factors, higher metabolic demands, or differential gene expression. We assessed the relationship between tau burden and brain functional connectivity, by combining in vivo PET imaging using the ligand AV-1451, and graph theoretic measures of resting state functional MRI in 17 patients with Alzheimer's disease, 17 patients with PSP, and 12 controls. Strongly connected nodes displayed more tau pathology in Alzheimer's disease, independently of intrinsic connectivity network, validating the predictions of theories of trans-neuronal spread but not supporting a role for metabolic demands or deficient trophic support in tau accumulation. This was not a compensatory phenomenon, as the functional consequence of increasing tau burden in Alzheimer's disease was a progressive weakening of the connectivity of these same nodes, reducing weighted degree and local efficiency and resulting in weaker 'small-world' properties. Conversely, in PSP, unlike in Alzheimer's disease, those nodes that accrued pathological tau were those that displayed graph metric properties associated with increased metabolic demand and a lack of trophic support rather than strong functional connectivity. Together, these findings go some way towards explaining why Alzheimer's disease affects large scale connectivity networks throughout cortex while neuropathology in PSP is concentrated in a small number of subcortical structures. Further, we demonstrate that in PSP increasing tau burden in midbrain and deep nuclei was associated with strengthened cortico-cortical functional connectivity. Disrupted cortico-subcortical and cortico-brainstem interactions meant that information transfer took less direct paths, passing through a larger number of cortical nodes, reducing closeness centrality and eigenvector centrality in PSP, while increasing weighted degree, clustering, betweenness centrality and local efficiency. Our results have wide-ranging implications, from the validation of models of tau trafficking in humans to understanding the relationship between regional tau burden and brain functional reorganization. © The Author(s) (2018). Published by Oxford University Press on behalf of the Guarantors of Brain.

Exploratory Visual Analytics of a Dynamically Built Network of Nodes in a WebGL-Enabled Browser

DTIC Science & Technology

2014-01-01

dimensionality reduction, feature extraction, high-dimensional data, t-distributed stochastic neighbor embedding, neighbor retrieval visualizer, visual...WebGL-enabled rendering is supported natively by browsers such as the latest Mozilla Firefox , Google Chrome, and Microsoft Internet Explorer 11. At the...appropriate names. The resultant 26-node network is displayed in a Mozilla Firefox browser in figure 2 (also see appendix B). 3 Figure 1. The

Dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job

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

Budnik, Thomas A; Knudson, Brant L; Megerian, Mark G

Methods, systems, and products for dynamically reassigning a connected node to a block of compute nodes for re-launching a failed job that include: identifying that a job failed to execute on the block of compute nodes because connectivity failed between a compute node assigned as at least one of the connected nodes for the block of compute nodes and its supporting I/O node; and re-launching the job, including selecting an alternative connected node that is actively coupled for data communications with an active I/O node; and assigning the alternative connected node as the connected node for the block of computemore » nodes running the re-launched job.« less

Beyond the Briganti nomogram: Individualisation of lymphadenectomy using selective sentinel node biopsy during radical prostatectomy for prostate cancer.

PubMed

Monserrat-Monfort, J J; Martinez-Sarmiento, M; Vera-Donoso, C D; Vera-Pinto, V; Sopena-Novales, P; Bello-Arqués, P; Boronat-Tormo, F

To validate the technique of selective sentinel node biopsy for diagnosing and staging intermediate to high-risk prostate cancer by comparing the technique with conventional extended lymphadenectomy (eLFD) in a prospective, longitudinal comparative study. We applied the technique to 45 patients. After an intraprostatic injection of 99m Tc-nanocolloid and preoperative single-photon emission computed tomography (SPECT/CT), we extracted the sentinel lymph nodes, guided by a portable Sentinella® gamma camera and a laparoscopic gamma-ray detection probe. The eLFD was completed to establish the negative predictive value of the technique. SPECT/CT showed radiotracer deposits outside the eLFD territory in 73% of the patients and the laparoscopic gamma probe in 60%. The mean number of active foci per patient was 4.3 in the SPECT/CT and 3.2 in the laparoscopic gamma probe. The mean number of extracted sentinel lymph nodes was 4.3 (0-14), with 26% outside the eLFD territory. The lymph nodes were metastatic in 10 patients (22%), 6/40 (15%) when the prostatectomy was the primary treatment. In all cases with metastatic lymph nodes, there was at least one positive sentinel node. Metastatic sentinel lymph nodes were found outside the eLFD territory in 3/10 patients (30%). The sensitivity was 100%, the specificity was 94.73%, the positive predictive value was 81.81%, and the negative predictive value was 100%. Selective sentinel node biopsy is superior to eLFD for diagnosing lymph node involvement and can avoid eLFD when metastatic sentinel lymph nodes are not found (85%), with the consequent functional advantages. Copyright © 2016 AEU. Publicado por Elsevier España, S.L.U. All rights reserved.

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

An enhanced performance through agent-based secure approach for mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Bisen, Dhananjay; Sharma, Sanjeev

2018-01-01

This paper proposes an agent-based secure enhanced performance approach (AB-SEP) for mobile ad hoc network. In this approach, agent nodes are selected through optimal node reliability as a factor. This factor is calculated on the basis of node performance features such as degree difference, normalised distance value, energy level, mobility and optimal hello interval of node. After selection of agent nodes, a procedure of malicious behaviour detection is performed using fuzzy-based secure architecture (FBSA). To evaluate the performance of the proposed approach, comparative analysis is done with conventional schemes using performance parameters such as packet delivery ratio, throughput, total packet forwarding, network overhead, end-to-end delay and percentage of malicious detection.

Systems and methods for optimal power flow on a radial network

DOEpatents

Low, Steven H.; Peng, Qiuyu

2018-04-24

Node controllers and power distribution networks in accordance with embodiments of the invention enable distributed power control. One embodiment includes a node controller including a distributed power control application; a plurality of node operating parameters describing the operating parameter of a node and a set of at least one node selected from the group consisting of an ancestor node and at least one child node; wherein send node operating parameters to nodes in the set of at least one node; receive operating parameters from the nodes in the set of at least one node; calculate a plurality of updated node operating parameters using an iterative process to determine the updated node operating parameters using the node operating parameters that describe the operating parameters of the node and the set of at least one node, where the iterative process involves evaluation of a closed form solution; and adjust node operating parameters.

Solving a Hamiltonian Path Problem with a bacterial computer

PubMed Central

Baumgardner, Jordan; Acker, Karen; Adefuye, Oyinade; Crowley, Samuel Thomas; DeLoache, Will; Dickson, James O; Heard, Lane; Martens, Andrew T; Morton, Nickolaus; Ritter, Michelle; Shoecraft, Amber; Treece, Jessica; Unzicker, Matthew; Valencia, Amanda; Waters, Mike; Campbell, A Malcolm; Heyer, Laurie J; Poet, Jeffrey L; Eckdahl, Todd T

2009-01-01

Background The Hamiltonian Path Problem asks whether there is a route in a directed graph from a beginning node to an ending node, visiting each node exactly once. The Hamiltonian Path Problem is NP complete, achieving surprising computational complexity with modest increases in size. This challenge has inspired researchers to broaden the definition of a computer. DNA computers have been developed that solve NP complete problems. Bacterial computers can be programmed by constructing genetic circuits to execute an algorithm that is responsive to the environment and whose result can be observed. Each bacterium can examine a solution to a mathematical problem and billions of them can explore billions of possible solutions. Bacterial computers can be automated, made responsive to selection, and reproduce themselves so that more processing capacity is applied to problems over time. Results We programmed bacteria with a genetic circuit that enables them to evaluate all possible paths in a directed graph in order to find a Hamiltonian path. We encoded a three node directed graph as DNA segments that were autonomously shuffled randomly inside bacteria by a Hin/hixC recombination system we previously adapted from Salmonella typhimurium for use in Escherichia coli. We represented nodes in the graph as linked halves of two different genes encoding red or green fluorescent proteins. Bacterial populations displayed phenotypes that reflected random ordering of edges in the graph. Individual bacterial clones that found a Hamiltonian path reported their success by fluorescing both red and green, resulting in yellow colonies. We used DNA sequencing to verify that the yellow phenotype resulted from genotypes that represented Hamiltonian path solutions, demonstrating that our bacterial computer functioned as expected. Conclusion We successfully designed, constructed, and tested a bacterial computer capable of finding a Hamiltonian path in a three node directed graph. This proof-of-concept experiment demonstrates that bacterial computing is a new way to address NP-complete problems using the inherent advantages of genetic systems. The results of our experiments also validate synthetic biology as a valuable approach to biological engineering. We designed and constructed basic parts, devices, and systems using synthetic biology principles of standardization and abstraction. PMID:19630940

An energy efficient distance-aware routing algorithm with multiple mobile sinks for wireless sensor networks.

PubMed

Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk

2014-08-18

Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.

An Energy Efficient Distance-Aware Routing Algorithm with Multiple Mobile Sinks for Wireless Sensor Networks

PubMed Central

Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk

2014-01-01

Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption. PMID:25196015

Quantitative methods of identifying the key nodes in the illegal wildlife trade network

PubMed Central

Patel, Nikkita Gunvant; Rorres, Chris; Joly, Damien O.; Brownstein, John S.; Boston, Ray; Levy, Michael Z.; Smith, Gary

2015-01-01

Innovative approaches are needed to combat the illegal trade in wildlife. Here, we used network analysis and a new database, HealthMap Wildlife Trade, to identify the key nodes (countries) that support the illegal wildlife trade. We identified key exporters and importers from the number of shipments a country sent and received and from the number of connections a country had to other countries over a given time period. We used flow betweenness centrality measurements to identify key intermediary countries. We found the set of nodes whose removal from the network would cause the maximum disruption to the network. Selecting six nodes would fragment 89.5% of the network for elephants, 92.3% for rhinoceros, and 98.1% for tigers. We then found sets of nodes that would best disseminate an educational message via direct connections through the network. We would need to select 18 nodes to reach 100% of the elephant trade network, 16 nodes for rhinoceros, and 10 for tigers. Although the choice of locations for interventions should be customized for the animal and the goal of the intervention, China was the most frequently selected country for network fragmentation and information dissemination. Identification of key countries will help strategize illegal wildlife trade interventions. PMID:26080413

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.

An Effective and Robust Decentralized Target Tracking Scheme in Wireless Camera Sensor Networks.

PubMed

Fu, Pengcheng; Cheng, Yongbo; Tang, Hongying; Li, Baoqing; Pei, Jun; Yuan, Xiaobing

2017-03-20

In this paper, we propose an effective and robust decentralized tracking scheme based on the square root cubature information filter (SRCIF) to balance the energy consumption and tracking accuracy in wireless camera sensor networks (WCNs). More specifically, regarding the characteristics and constraints of camera nodes in WCNs, some special mechanisms are put forward and integrated in this tracking scheme. First, a decentralized tracking approach is adopted so that the tracking can be implemented energy-efficiently and steadily. Subsequently, task cluster nodes are dynamically selected by adopting a greedy on-line decision approach based on the defined contribution decision (CD) considering the limited energy of camera nodes. Additionally, we design an efficient cluster head (CH) selection mechanism that casts such selection problem as an optimization problem based on the remaining energy and distance-to-target. Finally, we also perform analysis on the target detection probability when selecting the task cluster nodes and their CH, owing to the directional sensing and observation limitations in field of view (FOV) of camera nodes in WCNs. From simulation results, the proposed tracking scheme shows an obvious improvement in balancing the energy consumption and tracking accuracy over the existing methods.

An Effective and Robust Decentralized Target Tracking Scheme in Wireless Camera Sensor Networks

PubMed Central

Fu, Pengcheng; Cheng, Yongbo; Tang, Hongying; Li, Baoqing; Pei, Jun; Yuan, Xiaobing

2017-01-01

In this paper, we propose an effective and robust decentralized tracking scheme based on the square root cubature information filter (SRCIF) to balance the energy consumption and tracking accuracy in wireless camera sensor networks (WCNs). More specifically, regarding the characteristics and constraints of camera nodes in WCNs, some special mechanisms are put forward and integrated in this tracking scheme. First, a decentralized tracking approach is adopted so that the tracking can be implemented energy-efficiently and steadily. Subsequently, task cluster nodes are dynamically selected by adopting a greedy on-line decision approach based on the defined contribution decision (CD) considering the limited energy of camera nodes. Additionally, we design an efficient cluster head (CH) selection mechanism that casts such selection problem as an optimization problem based on the remaining energy and distance-to-target. Finally, we also perform analysis on the target detection probability when selecting the task cluster nodes and their CH, owing to the directional sensing and observation limitations in field of view (FOV) of camera nodes in WCNs. From simulation results, the proposed tracking scheme shows an obvious improvement in balancing the energy consumption and tracking accuracy over the existing methods. PMID:28335537

An Energy Balanced and Lifetime Extended Routing Protocol for Underwater Sensor Networks.

PubMed

Wang, Hao; Wang, Shilian; Zhang, Eryang; Lu, Luxi

2018-05-17

Energy limitation is an adverse problem in designing routing protocols for underwater sensor networks (UWSNs). To prolong the network lifetime with limited battery power, an energy balanced and efficient routing protocol, called energy balanced and lifetime extended routing protocol (EBLE), is proposed in this paper. The proposed EBLE not only balances traffic loads according to the residual energy, but also optimizes data transmissions by selecting low-cost paths. Two phases are operated in the EBLE data transmission process: (1) candidate forwarding set selection phase and (2) data transmission phase. In candidate forwarding set selection phase, nodes update candidate forwarding nodes by broadcasting the position and residual energy level information. The cost value of available nodes is calculated and stored in each sensor node. Then in data transmission phase, high residual energy and relatively low-cost paths are selected based on the cost function and residual energy level information. We also introduce detailed analysis of optimal energy consumption in UWSNs. Numerical simulation results on a variety of node distributions and data load distributions prove that EBLE outperforms other routing protocols (BTM, BEAR and direct transmission) in terms of network lifetime and energy efficiency.

Predicting Node Degree Centrality with the Node Prominence Profile

PubMed Central

Yang, Yang; Dong, Yuxiao; Chawla, Nitesh V.

2014-01-01

Centrality of a node measures its relative importance within a network. There are a number of applications of centrality, including inferring the influence or success of an individual in a social network, and the resulting social network dynamics. While we can compute the centrality of any node in a given network snapshot, a number of applications are also interested in knowing the potential importance of an individual in the future. However, current centrality is not necessarily an effective predictor of future centrality. While there are different measures of centrality, we focus on degree centrality in this paper. We develop a method that reconciles preferential attachment and triadic closure to capture a node's prominence profile. We show that the proposed node prominence profile method is an effective predictor of degree centrality. Notably, our analysis reveals that individuals in the early stage of evolution display a distinctive and robust signature in degree centrality trend, adequately predicted by their prominence profile. We evaluate our work across four real-world social networks. Our findings have important implications for the applications that require prediction of a node's future degree centrality, as well as the study of social network dynamics. PMID:25429797

Aggregating job exit statuses of a plurality of compute nodes executing a parallel application

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

Aho, Michael E.; Attinella, John E.; Gooding, Thomas M.

Aggregating job exit statuses of a plurality of compute nodes executing a parallel application, including: identifying a subset of compute nodes in the parallel computer to execute the parallel application; selecting one compute node in the subset of compute nodes in the parallel computer as a job leader compute node; initiating execution of the parallel application on the subset of compute nodes; receiving an exit status from each compute node in the subset of compute nodes, where the exit status for each compute node includes information describing execution of some portion of the parallel application by the compute node; aggregatingmore » each exit status from each compute node in the subset of compute nodes; and sending an aggregated exit status for the subset of compute nodes in the parallel computer.« less

Sentinel lymph node biopsy for early oral cancers: Westmead Hospital experience.

PubMed

Abdul-Razak, Muzib; Chung, Hsiang; Wong, Eva; Palme, Carsten; Veness, Michael; Farlow, David; Coleman, Hedley; Morgan, Gary

2017-01-01

Sentinel lymph node biopsy (SLNB) has become an alternative option to elective neck dissection (END) for early oral cavity squamous cell carcinoma (OCSCC) outside of Australia. We sought to assess the technical feasibility of SLNB and validate its accuracy against that of END in an Australian setting. We performed a prospective cohort study consisting of 30 consecutive patients with cT 1 - 2 N 0 OCSCC referred to the Head and Neck Cancer Service, Westmead Hospital, Sydney, between 2011 and 2014. All patients underwent SLNB followed by immediate selective neck dissection (levels I-III). A total of 30 patients were diagnosed with an early clinically node-negative OCSCC (seven cT1 and 23 cT2), with the majority located on the oral tongue. A median of three (range: 1-14) sentinel nodes were identified on lymphoscintigraphy, and all sentinel nodes were successfully retrieved, with 50% having a pathologically positive sentinel node. No false-negative sentinel nodes were identified using selective neck dissection as the gold standard. The negative predictive value (NPV) of SLNB was 100%, with 40% having a sentinel node identified outside the field of planned neck dissection on lymphoscintigraphy. Of these, one patient had a positive sentinel node outside of the ipsilateral supraomohyoid neck dissection template. SLNB for early OCSCC is technically feasible in an Australian setting. It has a high NPV and can potentially identify at-risk lymphatic basins outside the traditional selective neck dissection levels even in well-lateralized lesions. © 2016 Royal Australasian College of Surgeons.

Some scale-free networks could be robust under selective node attacks

NASA Astrophysics Data System (ADS)

Zheng, Bojin; Huang, Dan; Li, Deyi; Chen, Guisheng; Lan, Wenfei

2011-04-01

It is a mainstream idea that scale-free network would be fragile under the selective attacks. Internet is a typical scale-free network in the real world, but it never collapses under the selective attacks of computer viruses and hackers. This phenomenon is different from the deduction of the idea above because this idea assumes the same cost to delete an arbitrary node. Hence this paper discusses the behaviors of the scale-free network under the selective node attack with different cost. Through the experiments on five complex networks, we show that the scale-free network is possibly robust under the selective node attacks; furthermore, the more compact the network is, and the larger the average degree is, then the more robust the network is; with the same average degrees, the more compact the network is, the more robust the network is. This result would enrich the theory of the invulnerability of the network, and can be used to build robust social, technological and biological networks, and also has the potential to find the target of drugs.

Hybrid wireless sensor network for rescue site monitoring after earthquake

NASA Astrophysics Data System (ADS)

Wang, Rui; Wang, Shuo; Tang, Chong; Zhao, Xiaoguang; Hu, Weijian; Tan, Min; Gao, Bowei

2016-07-01

This paper addresses the design of a low-cost, low-complexity, and rapidly deployable wireless sensor network (WSN) for rescue site monitoring after earthquakes. The system structure of the hybrid WSN is described. Specifically, the proposed hybrid WSN consists of two kinds of wireless nodes, i.e., the monitor node and the sensor node. Then the mechanism and the system configuration of the wireless nodes are detailed. A transmission control protocol (TCP)-based request-response scheme is proposed to allow several monitor nodes to communicate with the monitoring center. UDP-based image transmission algorithms with fast recovery have been developed to meet the requirements of in-time delivery of on-site monitor images. In addition, the monitor node contains a ZigBee module that used to communicate with the sensor nodes, which are designed with small dimensions to monitor the environment by sensing different physical properties in narrow spaces. By building a WSN using these wireless nodes, the monitoring center can display real-time monitor images of the monitoring area and visualize all collected sensor data on geographic information systems. In the end, field experiments were performed at the Training Base of Emergency Seismic Rescue Troops of China and the experimental results demonstrate the feasibility and effectiveness of the monitor system.

Evaluation of a Web-Based App Demonstrating an Exclusionary Algorithmic Approach to TNM Cancer Staging

PubMed Central

2015-01-01

Background TNM staging plays a critical role in the evaluation and management of a range of different types of cancers. The conventional combinatorial approach to the determination of an anatomic stage relies on the identification of distinct tumor (T), node (N), and metastasis (M) classifications to generate a TNM grouping. This process is inherently inefficient due to the need for scrupulous review of the criteria specified for each classification to ensure accurate assignment. An exclusionary approach to TNM staging based on sequential constraint of options may serve to minimize the number of classifications that need to be reviewed to accurately determine an anatomic stage. Objective Our aim was to evaluate the usability and utility of a Web-based app configured to demonstrate an exclusionary approach to TNM staging. Methods Internal medicine residents, surgery residents, and oncology fellows engaged in clinical training were asked to evaluate a Web-based app developed as an instructional aid incorporating (1) an exclusionary algorithm that polls tabulated classifications and sorts them into ranked order based on frequency counts, (2) reconfiguration of classification criteria to generate disambiguated yes/no questions that function as selection and exclusion prompts, and (3) a selectable grid of TNM groupings that provides dynamic graphic demonstration of the effects of sequentially selecting or excluding specific classifications. Subjects were asked to evaluate the performance of this app after completing exercises simulating the staging of different types of cancers encountered during training. Results Survey responses indicated high levels of agreement with statements supporting the usability and utility of this app. Subjects reported that its user interface provided a clear display with intuitive controls and that the exclusionary approach to TNM staging it demonstrated represented an efficient process of assignment that helped to clarify distinctions between tumor, node, and metastasis classifications. High overall usefulness ratings were bolstered by supplementary comments suggesting that this app might be readily adopted for use in clinical practice. Conclusions A Web-based app that utilizes an exclusionary algorithm to prompt the assignment of tumor, node, and metastasis classifications may serve as an effective instructional aid demonstrating an efficient and informative approach to TNM staging. PMID:28410163

FuGeF: A Resource Bound Secure Forwarding Protocol for Wireless Sensor Networks

PubMed Central

Umar, Idris Abubakar; Mohd Hanapi, Zurina; Sali, A.; Zulkarnain, Zuriati A.

2016-01-01

Resource bound security solutions have facilitated the mitigation of spatio-temporal attacks by altering protocol semantics to provide minimal security while maintaining an acceptable level of performance. The Dynamic Window Secured Implicit Geographic Forwarding (DWSIGF) routing protocol for Wireless Sensor Network (WSN) has been proposed to achieve a minimal selection of malicious nodes by introducing a dynamic collection window period to the protocol’s semantics. However, its selection scheme suffers substantial packet losses due to the utilization of a single distance based parameter for node selection. In this paper, we propose a Fuzzy-based Geographic Forwarding protocol (FuGeF) to minimize packet loss, while maintaining performance. The FuGeF utilizes a new form of dynamism and introduces three selection parameters: remaining energy, connectivity cost, and progressive distance, as well as a Fuzzy Logic System (FLS) for node selection. These introduced mechanisms ensure the appropriate selection of a non-malicious node. Extensive simulation experiments have been conducted to evaluate the performance of the proposed FuGeF protocol as compared to DWSIGF variants. The simulation results show that the proposed FuGeF outperforms the two DWSIGF variants (DWSIGF-P and DWSIGF-R) in terms of packet delivery. PMID:27338411

FuGeF: A Resource Bound Secure Forwarding Protocol for Wireless Sensor Networks.

PubMed

Umar, Idris Abubakar; Mohd Hanapi, Zurina; Sali, A; Zulkarnain, Zuriati A

2016-06-22

Resource bound security solutions have facilitated the mitigation of spatio-temporal attacks by altering protocol semantics to provide minimal security while maintaining an acceptable level of performance. The Dynamic Window Secured Implicit Geographic Forwarding (DWSIGF) routing protocol for Wireless Sensor Network (WSN) has been proposed to achieve a minimal selection of malicious nodes by introducing a dynamic collection window period to the protocol's semantics. However, its selection scheme suffers substantial packet losses due to the utilization of a single distance based parameter for node selection. In this paper, we propose a Fuzzy-based Geographic Forwarding protocol (FuGeF) to minimize packet loss, while maintaining performance. The FuGeF utilizes a new form of dynamism and introduces three selection parameters: remaining energy, connectivity cost, and progressive distance, as well as a Fuzzy Logic System (FLS) for node selection. These introduced mechanisms ensure the appropriate selection of a non-malicious node. Extensive simulation experiments have been conducted to evaluate the performance of the proposed FuGeF protocol as compared to DWSIGF variants. The simulation results show that the proposed FuGeF outperforms the two DWSIGF variants (DWSIGF-P and DWSIGF-R) in terms of packet delivery.

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.

Heuristic Strategies for Persuader Selection in Contagions on Complex Networks.

PubMed

Wang, Peng; Zhang, Li-Jie; Xu, Xin-Jian; Xiao, Gaoxi

2017-01-01

Individual decision to accept a new idea or product is often driven by both self-adoption and others' persuasion, which has been simulated using a double threshold model [Huang et al., Scientific Reports 6, 23766 (2016)]. We extend the study to consider the case with limited persuasion. That is, a set of individuals is chosen from the population to be equipped with persuasion capabilities, who may succeed in persuading their friends to take the new entity when certain conditions are satisfied. Network node centrality is adopted to characterize each node's influence, based on which three heuristic strategies are applied to pick out persuaders. We compare these strategies for persuader selection on both homogeneous and heterogeneous networks. Two regimes of the underline networks are identified in which the system exhibits distinct behaviors: when networks are sufficiently sparse, selecting persuader nodes in descending order of node centrality achieves the best performance; when networks are sufficiently dense, however, selecting nodes with medium centralities to serve as the persuaders performs the best. Under respective optimal strategies for different types of networks, we further probe which centrality measure is most suitable for persuader selection. It turns out that for the first regime, degree centrality offers the best measure for picking out persuaders from homogeneous networks; while in heterogeneous networks, betweenness centrality takes its place. In the second regime, there is no significant difference caused by centrality measures in persuader selection for homogeneous network; while for heterogeneous networks, closeness centrality offers the best measure.

Joint Information Theoretic and Differential Geometrical Approach for Robust Automated Target Recognition

DTIC Science & Technology

2012-02-29

surface and Swiss roll) and real-world data sets (UCI Machine Learning Repository [12] and USPS digit handwriting data). In our experiments, we use...less than µn ( say µ = 0.8), we can first use screening technique to select µn candidate nodes, and then apply BIPS on them for further selection and...identified from node j to node i. So we can say the probability for the existence of this connection is approximately 82%. Given the probability matrix

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.

Biological Ablation of Sentinel Lymph Node Metastasis in Submucosally Invaded Early Gastrointestinal Cancer

PubMed Central

Kikuchi, Satoru; Kishimoto, Hiroyuki; Tazawa, Hiroshi; Hashimoto, Yuuri; Kuroda, Shinji; Nishizaki, Masahiko; Nagasaka, Takeshi; Shirakawa, Yasuhiro; Kagawa, Shunsuke; Urata, Yasuo; Hoffman, Robert M; Fujiwara, Toshiyoshi

2015-01-01

Currently, early gastrointestinal cancers are treated endoscopically, as long as there are no lymph node metastases. However, once a gastrointestinal cancer invades the submucosal layer, the lymph node metastatic rate rises to higher than 10%. Therefore, surgery is still the gold standard to remove regional lymph nodes containing possible metastases. Here, to avoid prophylactic surgery, we propose a less-invasive biological ablation of lymph node metastasis in submucosally invaded gastrointestinal cancer patients. We have established an orthotopic early rectal cancer xenograft model with spontaneous lymph node metastasis by implantation of green fluorescent protein (GFP)-labeled human colon cancer cells into the submucosal layer of the murine rectum. A solution containing telomerase-specific oncolytic adenovirus was injected into the peritumoral submucosal space, followed by excision of the primary rectal tumors mimicking the endoscopic submucosal dissection (ESD) technique. Seven days after treatment, GFP signals had completely disappeared indicating that sentinel lymph node metastasis was selectively eradicated. Moreover, biologically treated mice were confirmed to be relapse-free even 4 weeks after treatment. These results indicate that virus-mediated biological ablation selectively targets lymph node metastasis and provides a potential alternative to surgery for submucosal invasive gastrointestinal cancer patients. PMID:25523761

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.

A Game-Theoretic Response Strategy for Coordinator Attack in Wireless Sensor Networks

PubMed Central

Liu, Jianhua; Yue, Guangxue; Shang, Huiliang; Li, Hongjie

2014-01-01

The coordinator is a specific node that controls the whole network and has a significant impact on the performance in cooperative multihop ZigBee wireless sensor networks (ZWSNs). However, the malicious node attacks coordinator nodes in an effort to waste the resources and disrupt the operation of the network. Attacking leads to a failure of one round of communication between the source nodes and destination nodes. Coordinator selection is a technique that can considerably defend against attack and reduce the data delivery delay, and increase network performance of cooperative communications. In this paper, we propose an adaptive coordinator selection algorithm using game and fuzzy logic aiming at both minimizing the average number of hops and maximizing network lifetime. The proposed game model consists of two interrelated formulations: a stochastic game for dynamic defense and a best response policy using evolutionary game formulation for coordinator selection. The stable equilibrium best policy to response defense is obtained from this game model. It is shown that the proposed scheme can improve reliability and save energy during the network lifetime with respect to security. PMID:25105171

A game-theoretic response strategy for coordinator attack in wireless sensor networks.

PubMed

Liu, Jianhua; Yue, Guangxue; Shen, Shigen; Shang, Huiliang; Li, Hongjie

2014-01-01

The coordinator is a specific node that controls the whole network and has a significant impact on the performance in cooperative multihop ZigBee wireless sensor networks (ZWSNs). However, the malicious node attacks coordinator nodes in an effort to waste the resources and disrupt the operation of the network. Attacking leads to a failure of one round of communication between the source nodes and destination nodes. Coordinator selection is a technique that can considerably defend against attack and reduce the data delivery delay, and increase network performance of cooperative communications. In this paper, we propose an adaptive coordinator selection algorithm using game and fuzzy logic aiming at both minimizing the average number of hops and maximizing network lifetime. The proposed game model consists of two interrelated formulations: a stochastic game for dynamic defense and a best response policy using evolutionary game formulation for coordinator selection. The stable equilibrium best policy to response defense is obtained from this game model. It is shown that the proposed scheme can improve reliability and save energy during the network lifetime with respect to security.

Soybean (Glycine max) transformation using mature cotyledonary node explants.

PubMed

Olhoft, Paula M; Donovan, Christopher M; Somers, David A

2006-01-01

Agrobacterium tumefaciens-mediated transformation of soybeans has been steadily improved since its development in 1988. Soybean transformation is now possible in a range of genotypes from different maturity groups using different explants as sources of regenerable cells, various selectable marker genes and selective agents, and different A. tumefaciens strains. The cotyledonary-node method has been extensively investigated and across a number of laboratories yields on average greater than 1% transformation efficiency (one Southern-positive, independent event per 100 cotyledonary-node explants). Continued improvements in the cotyledonary-node method concomitant with further increases in transformation efficiency will enhance broader adoption of this already productive transformation method for use in crop improvement and functional genomics research efforts.

Key node selection in minimum-cost control of complex networks

NASA Astrophysics Data System (ADS)

Ding, Jie; Wen, Changyun; Li, Guoqi

2017-11-01

Finding the key node set that is connected with a given number of external control sources for driving complex networks from initial state to any predefined state with minimum cost, known as minimum-cost control problem, is critically important but remains largely open. By defining an importance index for each node, we propose revisited projected gradient method extension (R-PGME) in Monte-Carlo scenario to determine key node set. It is found that the importance index of a node is strongly correlated to occurrence rate of that node to be selected as a key node in Monte-Carlo realizations for three elementary topologies, Erdős-Rényi and scale-free networks. We also discover the distribution patterns of key nodes when the control cost reaches its minimum. Specifically, the importance indices of all nodes in an elementary stem show a quasi-periodic distribution with high peak values in the beginning and end of a quasi-period while they approach to a uniform distribution in an elementary cycle. We further point out that an elementary dilation can be regarded as two elementary stems whose lengths are the closest, and the importance indices in each stem present similar distribution as in an elementary stem. Our results provide a better understanding and deep insight of locating the key nodes in different topologies with minimum control cost.

Lymphatic Mapping and Sentinel Lymph Node Biopsy in Women With Squamous Cell Carcinoma of the Vulva: A Gynecologic Oncology Group Study

PubMed Central

Levenback, Charles F.; Ali, Shamshad; Coleman, Robert L.; Gold, Michael A.; Fowler, Jeffrey M.; Judson, Patricia L.; Bell, Maria C.; De Geest, Koen; Spirtos, Nick M.; Potkul, Ronald K.; Leitao, Mario M.; Bakkum-Gamez, Jamie N.; Rossi, Emma C.; Lentz, Samuel S.; Burke, James J.; Van Le, Linda; Trimble, Cornelia L.

2012-01-01

Purpose To determine the safety of sentinel lymph node biopsy as a replacement for inguinal femoral lymphadenectomy in selected women with vulvar cancer. Patients and Methods Eligible women had squamous cell carcinoma, at least 1-mm invasion, and tumor size ≥ 2 cm and ≤ 6 cm. The primary tumor was limited to the vulva, and there were no groin lymph nodes that were clinically suggestive of cancer. All women underwent intraoperative lymphatic mapping, sentinel lymph node biopsy, and inguinal femoral lymphadenectomy. Histologic ultra staging of the sentinel lymph node was prescribed. Results In all, 452 women underwent the planned procedures, and 418 had at least one sentinel lymph node identified. There were 132 node-positive women, including 11 (8.3%) with false-negative nodes. Twenty-three percent of the true-positive patients were detected by immunohistochemical analysis of the sentinel lymph node. The sensitivity was 91.7% (90% lower confidence bound, 86.7%) and the false-negative predictive value (1-negative predictive value) was 3.7% (90% upper confidence bound, 6.1%). In women with tumor less than 4 cm, the false-negative predictive value was 2.0% (90% upper confidence bound, 4.5%). Conclusion Sentinel lymph node biopsy is a reasonable alternative to inguinal femoral lymphadenectomy in selected women with squamous cell carcinoma of the vulva. PMID:22753905

[Application of digital 3D technique combined with nanocarbon-aided navigation in endoscopic sentinel lymph node biopsy for breast cancer].

PubMed

Zhang, Pu-Sheng; Luo, Yun-Feng; Yu, Jin-Long; Fang, Chi-Hua; Shi, Fu-Jun; Deng, Jian-Wen

2016-08-20

To study the clinical value of digital 3D technique combined with nanocarbon-aided navigation in endoscopic sentinel lymph node biopsy for breast cancer. Thirty-nine female patients with stage I/II breast cancer admitted in our hospital between September 2014 and September 2015 were recruited. CT lymphography data of the patients were segmented to reconstruct digital 3D models, which were imported into FreeForm Modeling Surgical System Platform for visual simulation surgery before operation. Endoscopic sentinel lymph node biopsy and endoscopic axillary lymph node dissection were then carried out, and the accuracy and clinical value of digital 3D technique in endoscopic sentinel lymph node biopsy were analyzed. s The 3D models faithfully represented the surgical anatomy of the patients and clearly displayed the 3D relationship among the sentinel lymph nodes, axillary lymph nodes, axillary vein, pectoralis major, pectoralis minor muscle and latissimus dorsi. In the biopsy, the detection rate of sentinel lymph nodes was 100% in the patients with a coincidence rate of 87.18% (34/39), a sensitivity of 91.67% (11/12), and a false negative rate of 8.33% (1/12). Complications such as limb pain, swelling, wound infection, and subcutaneouseroma were not found in these patients 6 months after the operation. Endoscopic sentinel lymph node biopsy assisted by digital 3D technique and nanocarbon-aided navigation allows a high detection rate of sentinel lymph nodes with a high sensitivity and a low false negative rate and can serve as a new method for sentinel lymph node biopsy for breast cancer.

Subcarinal lymph node in upper lobe non-small cell lung cancer patients: is selective lymph node dissection valid?

PubMed

Aokage, Keiju; Yoshida, Junji; Ishii, Genichiro; Hishida, Tomoyuki; Nishimura, Mitsuyo; Nagai, Kanji

2010-11-01

Little is known about selective lymph node dissection in non-small cell lung cancer (NSCLC) patients. We sought to gain insight into subcarinal node involvement for its frequency and impact on outcome to evaluate whether it is valid to omit subcarinal lymph node dissection in upper lobe NSCLC patients. We reviewed node metastases distribution according to node region, tumor location, and histology among 1099 patients with upper lobe NSCLC. We paid special attention to subcarinal metastases patients without superior mediastinal node metastases, because their pathological stages would have been underdiagnosed if subcarinal node dissection had been omitted. We also assessed the outcome and the pattern of failure among subcarinal metastases patients. To identify subcarinal node involvement predictors, we analyzed 7 clinical factors. Subcarinal node metastases were found in 20 patients and were least frequent among squamous cell carcinoma patients (0.5%). Two of them were free from superior mediastinal metastases but died of the disease at 1 month and due to an unknown cause at 18 months, respectively. Seventeen of the 20 patients developed multi-site recurrence within 37 months. The 5-year survival rate of the 20 patients with subcarinal metastases was 9.0%, which was significantly lower than 32.0% of patients with only superior mediastinal metastases. Clinical diagnosis of node metastases was significantly predictive of subcarinal metastases. Subcarinal node metastases from upper lobe NSCLC were rare and predicted an extremely poor outcome. It appears valid to omit subcarinal node dissection in upper lobe NSCLC patients, especially in clinical N0 squamous cell carcinoma patients. Copyright © 2010 Elsevier Ireland Ltd. All rights reserved.

Hop Optimization and Relay Node Selection in Multi-hop Wireless Ad-Hoc Networks

NASA Astrophysics Data System (ADS)

Li, Xiaohua(Edward)

In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interference cancellation (SIC) and maximal ratio combining (MRC) to deal with mutual interference and to utilize all the received signal energy, we show that the signal-to-interference-plus-noise ratio (SINR) of a node is determined only by the nodes before it, not the nodes after it, along a packet forwarding path. Based on this observation, we propose an iterative procedure to select the relay nodes and to calculate the path SINR as well as capacity of an arbitrary multi-hop packet forwarding path. The complexity of the algorithm is extremely low, and scaling well with network size. The algorithm is applicable in arbitrarily large networks. Its performance is demonstrated as desirable by simulations. The algorithm can be helpful in analyzing the performance of multi-hop wireless networks.

Multi-Layer Approach for the Detection of Selective Forwarding Attacks

PubMed Central

Alajmi, Naser; Elleithy, Khaled

2015-01-01

Security breaches are a major threat in wireless sensor networks (WSNs). WSNs are increasingly used due to their broad range of important applications in both military and civilian domains. WSNs are prone to several types of security attacks. Sensor nodes have limited capacities and are often deployed in dangerous locations; therefore, they are vulnerable to different types of attacks, including wormhole, sinkhole, and selective forwarding attacks. Security attacks are classified as data traffic and routing attacks. These security attacks could affect the most significant applications of WSNs, namely, military surveillance, traffic monitoring, and healthcare. Therefore, there are different approaches to detecting security attacks on the network layer in WSNs. Reliability, energy efficiency, and scalability are strong constraints on sensor nodes that affect the security of WSNs. Because sensor nodes have limited capabilities in most of these areas, selective forwarding attacks cannot be easily detected in networks. In this paper, we propose an approach to selective forwarding detection (SFD). The approach has three layers: MAC pool IDs, rule-based processing, and anomaly detection. It maintains the safety of data transmission between a source node and base station while detecting selective forwarding attacks. Furthermore, the approach is reliable, energy efficient, and scalable. PMID:26610499

Multi-Layer Approach for the Detection of Selective Forwarding Attacks.

PubMed

Alajmi, Naser; Elleithy, Khaled

2015-11-19

Security breaches are a major threat in wireless sensor networks (WSNs). WSNs are increasingly used due to their broad range of important applications in both military and civilian domains. WSNs are prone to several types of security attacks. Sensor nodes have limited capacities and are often deployed in dangerous locations; therefore, they are vulnerable to different types of attacks, including wormhole, sinkhole, and selective forwarding attacks. Security attacks are classified as data traffic and routing attacks. These security attacks could affect the most significant applications of WSNs, namely, military surveillance, traffic monitoring, and healthcare. Therefore, there are different approaches to detecting security attacks on the network layer in WSNs. Reliability, energy efficiency, and scalability are strong constraints on sensor nodes that affect the security of WSNs. Because sensor nodes have limited capabilities in most of these areas, selective forwarding attacks cannot be easily detected in networks. In this paper, we propose an approach to selective forwarding detection (SFD). The approach has three layers: MAC pool IDs, rule-based processing, and anomaly detection. It maintains the safety of data transmission between a source node and base station while detecting selective forwarding attacks. Furthermore, the approach is reliable, energy efficient, and scalable.

Cerium-Hydride Secondary Building Units in a Porous Metal–Organic Framework for Catalytic Hydroboration and Hydrophosphination

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

Ji, Pengfei; Sawano, Takahiro; Lin, Zekai

2016-11-16

We report the stepwise, quantitative transformation of CeIV6(μ3-O)4(μ3-OH)4(OH)6(OH2)6 nodes in a new Ce-BTC (BTC = trimesic acid) metal–organic framework (MOF) into the first CeIII6(μ3-O)4(μ3-OLi)4(H)6(THF)6Li6 metal-hydride nodes that effectively catalyze hydroboration and hydrophosphination reactions. CeH-BTC displays low steric hindrance and electron density compared to homogeneous organolanthanide catalysts, which likely accounts for the unique 1,4-regioselectivity for the hydroboration of pyridine derivatives. MOF nodes can thus be directly transformed into novel single-site solid catalysts without homogeneous counterparts for sustainable chemical synthesis.

Semantic Visualization of Wireless Sensor Networks for Elderly Monitoring

NASA Astrophysics Data System (ADS)

Stocklöw, Carsten; Kamieth, Felix

In the area of Ambient Intelligence, Wireless Sensor Networks are commonly used for user monitoring purposes like health monitoring and user localization. Existing work on visualization of wireless sensor networks focuses mainly on displaying individual nodes and logical, graph-based topologies. This way, the relation to the real-world deployment is lost. This paper presents a novel approach for visualization of wireless sensor networks and interaction with complex services on the nodes. The environment is realized as a 3D model, and multiple nodes, that are worn by a single individual, are grouped together to allow an intuitive interface for end users. We describe application examples and show that our approach allows easier access to network information and functionality by comparing it with existing solutions.

Cascading failures in complex networks with community structure

NASA Astrophysics Data System (ADS)

Lin, Guoqiang; di, Zengru; Fan, Ying

2014-12-01

Much empirical evidence shows that when attacked with cascading failures, scale-free or even random networks tend to collapse more extensively when the initially deleted node has higher betweenness. Meanwhile, in networks with strong community structure, high-betweenness nodes tend to be bridge nodes that link different communities, and the removal of such nodes will reduce only the connections among communities, leaving the networks fairly stable. Understanding what will affect cascading failures and how to protect or attack networks with strong community structure is therefore of interest. In this paper, we have constructed scale-free Community Networks (SFCN) and Random Community Networks (RCN). We applied these networks, along with the Lancichinett-Fortunato-Radicchi (LFR) benchmark, to the cascading-failure scenario to explore their vulnerability to attack and the relationship between cascading failures and the degree distribution and community structure of a network. The numerical results show that when the networks are of a power-law distribution, a stronger community structure will result in the failure of fewer nodes. In addition, the initial removal of the node with the highest betweenness will not lead to the worst cascading, i.e. the largest avalanche size. The Betweenness Overflow (BOF), an index that we developed, is an effective indicator of this tendency. The RCN, however, display a different result. In addition, the avalanche size of each node can be adopted as an index to evaluate the importance of the node.

XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme

NASA Astrophysics Data System (ADS)

Chebotko, Artem; Fu, Bin

Query evaluation in an XML database requires reconstructing XML subtrees rooted at nodes found by an XML query. Since XML subtree reconstruction can be expensive, one approach to improve query response time is to use reconstruction views - materialized XML subtrees of an XML document, whose nodes are frequently accessed by XML queries. For this approach to be efficient, the principal requirement is a framework for view selection. In this work, we are the first to formalize and study the problem of XML reconstruction view selection. The input is a tree T, in which every node i has a size c i and profit p i , and the size limitation C. The target is to find a subset of subtrees rooted at nodes i 1, ⋯ , i k respectively such that c_{i_1}+\\cdots +c_{i_k}le C, and p_{i_1}+\\cdots +p_{i_k} is maximal. Furthermore, there is no overlap between any two subtrees selected in the solution. We prove that this problem is NP-hard and present a fully polynomial-time approximation scheme (FPTAS) as a solution.

Minimally buffered data transfers between nodes in a data communications network

DOEpatents

Miller, Douglas R.

2015-06-23

Methods, apparatus, and products for minimally buffered data transfers between nodes in a data communications network are disclosed that include: receiving, by a messaging module on an origin node, a storage identifier, a origin data type, and a target data type, the storage identifier specifying application storage containing data, the origin data type describing a data subset contained in the origin application storage, the target data type describing an arrangement of the data subset in application storage on a target node; creating, by the messaging module, origin metadata describing the origin data type; selecting, by the messaging module from the origin application storage in dependence upon the origin metadata and the storage identifier, the data subset; and transmitting, by the messaging module to the target node, the selected data subset for storing in the target application storage in dependence upon the target data type without temporarily buffering the data subset.

Collectively loading an application in a parallel computer

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

Aho, Michael E.; Attinella, John E.; Gooding, Thomas M.

Collectively loading an application in a parallel computer, the parallel computer comprising a plurality of compute nodes, including: identifying, by a parallel computer control system, a subset of compute nodes in the parallel computer to execute a job; selecting, by the parallel computer control system, one of the subset of compute nodes in the parallel computer as a job leader compute node; retrieving, by the job leader compute node from computer memory, an application for executing the job; and broadcasting, by the job leader to the subset of compute nodes in the parallel computer, the application for executing the job.

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by dynamically adjusting local routing strategies

DOEpatents

Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

2010-03-16

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Each node implements a respective routing strategy for routing data through the network, the routing strategies not necessarily being the same in every node. The routing strategies implemented in the nodes are dynamically adjusted during application execution to shift network workload as required. Preferably, adjustment of routing policies in selective nodes is performed at synchronization points. The network may be dynamically monitored, and routing strategies adjusted according to detected network conditions.

A complementary graphical method for reducing and analyzing large data sets. Case studies demonstrating thresholds setting and selection.

PubMed

Jing, X; Cimino, J J

2014-01-01

Graphical displays can make data more understandable; however, large graphs can challenge human comprehension. We have previously described a filtering method to provide high-level summary views of large data sets. In this paper we demonstrate our method for setting and selecting thresholds to limit graph size while retaining important information by applying it to large single and paired data sets, taken from patient and bibliographic databases. Four case studies are used to illustrate our method. The data are either patient discharge diagnoses (coded using the International Classification of Diseases, Clinical Modifications [ICD9-CM]) or Medline citations (coded using the Medical Subject Headings [MeSH]). We use combinations of different thresholds to obtain filtered graphs for detailed analysis. The thresholds setting and selection, such as thresholds for node counts, class counts, ratio values, p values (for diff data sets), and percentiles of selected class count thresholds, are demonstrated with details in case studies. The main steps include: data preparation, data manipulation, computation, and threshold selection and visualization. We also describe the data models for different types of thresholds and the considerations for thresholds selection. The filtered graphs are 1%-3% of the size of the original graphs. For our case studies, the graphs provide 1) the most heavily used ICD9-CM codes, 2) the codes with most patients in a research hospital in 2011, 3) a profile of publications on "heavily represented topics" in MEDLINE in 2011, and 4) validated knowledge about adverse effects of the medication of rosiglitazone and new interesting areas in the ICD9-CM hierarchy associated with patients taking the medication of pioglitazone. Our filtering method reduces large graphs to a manageable size by removing relatively unimportant nodes. The graphical method provides summary views based on computation of usage frequency and semantic context of hierarchical terminology. The method is applicable to large data sets (such as a hundred thousand records or more) and can be used to generate new hypotheses from data sets coded with hierarchical terminologies.

Treelink: data integration, clustering and visualization of phylogenetic trees.

PubMed

Allende, Christian; Sohn, Erik; Little, Cedric

2015-12-29

Phylogenetic trees are central to a wide range of biological studies. In many of these studies, tree nodes need to be associated with a variety of attributes. For example, in studies concerned with viral relationships, tree nodes are associated with epidemiological information, such as location, age and subtype. Gene trees used in comparative genomics are usually linked with taxonomic information, such as functional annotations and events. A wide variety of tree visualization and annotation tools have been developed in the past, however none of them are intended for an integrative and comparative analysis. Treelink is a platform-independent software for linking datasets and sequence files to phylogenetic trees. The application allows an automated integration of datasets to trees for operations such as classifying a tree based on a field or showing the distribution of selected data attributes in branches and leafs. Genomic and proteonomic sequences can also be linked to the tree and extracted from internal and external nodes. A novel clustering algorithm to simplify trees and display the most divergent clades was also developed, where validation can be achieved using the data integration and classification function. Integrated geographical information allows ancestral character reconstruction for phylogeographic plotting based on parsimony and likelihood algorithms. Our software can successfully integrate phylogenetic trees with different data sources, and perform operations to differentiate and visualize those differences within a tree. File support includes the most popular formats such as newick and csv. Exporting visualizations as images, cluster outputs and genomic sequences is supported. Treelink is available as a web and desktop application at http://www.treelinkapp.com .

Management of recurrent and persistent metastatic lymph nodes in well-differentiated thyroid cancer: a multifactorial decision-making guide for the Thyroid Cancer Care Collaborative.

PubMed

Urken, Mark L; Milas, Mira; Randolph, Gregory W; Tufano, Ralph; Bergman, Donald; Bernet, Victor; Brett, Elise M; Brierley, James D; Cobin, Rhoda; Doherty, Gerard; Klopper, Joshua; Lee, Stephanie; Machac, Josef; Mechanick, Jeffrey I; Orloff, Lisa A; Ross, Douglas; Smallridge, Robert C; Terris, David J; Clain, Jason B; Tuttle, Michael

2015-04-01

Well-differentiated thyroid cancer (WDTC) recurs in up to 30% of patients. Guidelines from the American Thyroid Association (ATA) and the National Comprehensive Cancer Network (NCCN) provide valuable parameters for the management of recurrent disease, but fail to guide the clinician as to the multitude of factors that should be taken into account. The Thyroid Cancer Care Collaborative (TCCC) is a web-based repository of a patient's clinical information. Ten clinical decision-making modules (CDMMs) process this information and display individualized treatment recommendations. We conducted a review of the literature and analysis of the management of patients with recurrent/persistent WDTC. Surgery remains the most common treatment in recurrent/persistent WDTC and can be performed with limited morbidity in experienced hands. However, careful observation may be the recommended course in select patients. Reoperation yields biochemical remission rates between 21% and 66%. There is a reported 1.2% incidence of permanent unexpected nerve paralysis and a 3.5% incidence of permanent hypoparathyroidism. External beam radiotherapy and percutaneous ethanol ablation have been reported as therapeutic alternatives. Radioactive iodine as a primary therapy has been reported previously for metastatic lymph nodes, but is currently advocated by the ATA as an adjuvant to surgery. The management of recurrent lymph nodes is a multifactorial decision and is best determined by a multidisciplinary team. The CDMMs allow for easy adoption of contemporary knowledge, making this information accessible to both patient and clinician. © 2014 Wiley Periodicals, Inc.

Design of temperature monitoring system based on CAN bus

NASA Astrophysics Data System (ADS)

Zhang, Li

2017-10-01

The remote temperature monitoring system based on the Controller Area Network (CAN) bus is designed to collect the multi-node remote temperature. By using the STM32F103 as main controller and multiple DS18B20s as temperature sensors, the system achieves a master-slave node data acquisition and transmission based on the CAN bus protocol. And making use of the serial port communication technology to communicate with the host computer, the system achieves the function of remote temperature storage, historical data show and the temperature waveform display.

Extending Comprehensive Maritime Awareness to Disconnected Vessels and Users

DTIC Science & Technology

2007-09-01

system shall: 7. Provide flexible , scalable, and tailorable techniques, processes, and procedures that can be adapted rapidly and securely 8...PS (1 2- 21 ) SO W (2 2- 23 ) St ak eh ol de r C om m un ic at io ns (2 4) Provide secure connection of Node 5 to CMA Node 4 1,4,5 8 19 Provide...6 7 13,24 Provide flexible system - allow user display customization 6 7 13 Provide accurate data and info 2,3 16, 20, 24 Provide accurate local data

Strategy of Using Intratreatment Hypoxia Imaging to Selectively and Safely Guide Radiation Dose De-escalation Concurrent With Chemotherapy for Locoregionally Advanced Human Papillomavirus–Related Oropharyngeal Carcinoma

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

Lee, Nancy, E-mail: leen2@mskcc.org; Schoder, Heiko; Beattie, Brad

Purpose: To report a small substudy of an ongoing large, multi-arm study using functional imaging to assess pre-/intratreatment hypoxia for all head and neck cancer, in which we hypothesized that pre- and early-treatment hypoxia assessment using functional positron emission tomography (PET) imaging may help select which human papillomavirus (HPV)-positive (HPV{sup +}) oropharyngeal cancer (OPC) patients can safely receive radiation de-escalation without jeopardizing treatment outcomes. Methods and Materials: Patients with HPV{sup +} oropharyngeal carcinoma were enrolled on an institutional review board–approved prospective study of which de-escalation based on imaging response was done for node(s) only. Pretreatment {sup 18}F-fluorodeoxyglucose and dynamic {sup 18}F-FMISOmore » (fluoromisonidazole) positron emission tomography (PET) scans were performed. For patients with pretreatment hypoxia on{sup 18}F-FMISO PET (defined as a >1.2 tumor to muscle standard uptake value ratio), a repeat scan was done 1 week after chemoradiation. Patients without pretreatment hypoxia or with resolution of hypoxia on repeat scan received a 10-Gy dose reduction to metastatic lymph node(s). The 2-year local, regional, distant metastasis–free, and overall survival rates were estimated using the Kaplan-Meier product-limit method. A subset of patients had biopsy of a hypoxic node done under image guidance. Results: Thirty-three HPV{sup +} OPC patients were enrolled in this pilot study. One hundred percent showed pretreatment hypoxia (at primary site and/or node[s]), and among these, 48% resolved (at primary site and/or node[s]); 30% met criteria and received 10-Gy reduction to the lymph node(s). At the median follow-up of 32 months (range, 21-61 months), the 2-year locoregional control rate was 100%. One patient failed distantly with persistence of hypoxia on {sup 18}F-FMISO PET. The 2-year distant metastasis–free rate was 97%. The 2-year OS rate was 100%. Hypoxia on imaging was confirmed pathologically. Conclusions: Hypoxia is present in HPV{sup +} tumors but resolves within 1 week of treatment in 48% of cases either at the primary site and/or lymph node(s). Our 100% locoregional control rate suggests that intratreatment functional imaging used to selectively de-escalate node(s) to 60 Gy was confirmed safe using our stringent imaging criteria. Intratreatment functional imaging warrants further study to determine its ultimate role in de-escalation treatment strategies.« less

Strategy of Using Intratreatment Hypoxia Imaging to Selectively and Safely Guide Radiation Dose De-escalation Concurrent With Chemotherapy for Locoregionally Advanced Human Papillomavirus-Related Oropharyngeal Carcinoma.

PubMed

Lee, Nancy; Schoder, Heiko; Beattie, Brad; Lanning, Ryan; Riaz, Nadeem; McBride, Sean; Katabi, Nora; Li, Duan; Yarusi, Brett; Chan, Susie; Mitrani, Lindsey; Zhang, Zhigang; Pfister, David G; Sherman, Eric; Baxi, Shrujal; Boyle, Jay; Morris, Luc G T; Ganly, Ian; Wong, Richard; Humm, John

2016-09-01

To report a small substudy of an ongoing large, multi-arm study using functional imaging to assess pre-/intratreatment hypoxia for all head and neck cancer, in which we hypothesized that pre- and early-treatment hypoxia assessment using functional positron emission tomography (PET) imaging may help select which human papillomavirus (HPV)-positive (HPV(+)) oropharyngeal cancer (OPC) patients can safely receive radiation de-escalation without jeopardizing treatment outcomes. Patients with HPV(+) oropharyngeal carcinoma were enrolled on an institutional review board-approved prospective study of which de-escalation based on imaging response was done for node(s) only. Pretreatment (18)F-fluorodeoxyglucose and dynamic (18)F-FMISO (fluoromisonidazole) positron emission tomography (PET) scans were performed. For patients with pretreatment hypoxia on(18)F-FMISO PET (defined as a >1.2 tumor to muscle standard uptake value ratio), a repeat scan was done 1 week after chemoradiation. Patients without pretreatment hypoxia or with resolution of hypoxia on repeat scan received a 10-Gy dose reduction to metastatic lymph node(s). The 2-year local, regional, distant metastasis-free, and overall survival rates were estimated using the Kaplan-Meier product-limit method. A subset of patients had biopsy of a hypoxic node done under image guidance. Thirty-three HPV(+) OPC patients were enrolled in this pilot study. One hundred percent showed pretreatment hypoxia (at primary site and/or node[s]), and among these, 48% resolved (at primary site and/or node[s]); 30% met criteria and received 10-Gy reduction to the lymph node(s). At the median follow-up of 32 months (range, 21-61 months), the 2-year locoregional control rate was 100%. One patient failed distantly with persistence of hypoxia on (18)F-FMISO PET. The 2-year distant metastasis-free rate was 97%. The 2-year OS rate was 100%. Hypoxia on imaging was confirmed pathologically. Hypoxia is present in HPV(+) tumors but resolves within 1 week of treatment in 48% of cases either at the primary site and/or lymph node(s). Our 100% locoregional control rate suggests that intratreatment functional imaging used to selectively de-escalate node(s) to 60 Gy was confirmed safe using our stringent imaging criteria. Intratreatment functional imaging warrants further study to determine its ultimate role in de-escalation treatment strategies. Copyright © 2016 Elsevier Inc. All rights reserved.

Sparse feature selection for classification and prediction of metastasis in endometrial cancer.

PubMed

Ahsen, Mehmet Eren; Boren, Todd P; Singh, Nitin K; Misganaw, Burook; Mutch, David G; Moore, Kathleen N; Backes, Floor J; McCourt, Carolyn K; Lea, Jayanthi S; Miller, David S; White, Michael A; Vidyasagar, Mathukumalli

2017-03-27

Metastasis via pelvic and/or para-aortic lymph nodes is a major risk factor for endometrial cancer. Lymph-node resection ameliorates risk but is associated with significant co-morbidities. Incidence in patients with stage I disease is 4-22% but no mechanism exists to accurately predict it. Therefore, national guidelines for primary staging surgery include pelvic and para-aortic lymph node dissection for all patients whose tumor exceeds 2cm in diameter. We sought to identify a robust molecular signature that can accurately classify risk of lymph node metastasis in endometrial cancer patients. 86 tumors matched for age and race, and evenly distributed between lymph node-positive and lymph node-negative cases, were selected as a training cohort. Genomic micro-RNA expression was profiled for each sample to serve as the predictive feature matrix. An independent set of 28 tumor samples was collected and similarly characterized to serve as a test cohort. A feature selection algorithm was designed for applications where the number of samples is far smaller than the number of measured features per sample. A predictive miRNA expression signature was developed using this algorithm, which was then used to predict the metastatic status of the independent test cohort. A weighted classifier, using 18 micro-RNAs, achieved 100% accuracy on the training cohort. When applied to the testing cohort, the classifier correctly predicted 90% of node-positive cases, and 80% of node-negative cases (FDR = 6.25%). Results indicate that the evaluation of the quantitative sparse-feature classifier proposed here in clinical trials may lead to significant improvement in the prediction of lymphatic metastases in endometrial cancer patients.

[Historical outline on the nomenclature of neck lymph nodes as a basis of neck dissection classification].

PubMed

Werner, J A

2001-07-01

The neck dissection classification is based considerably on the organization of the lymph nodes of the neck. Terminology and anatomical allocation of nearly 300 cervicofacial lymph nodes repeatedly changed since the beginning of the 20th century. Analysis of the literature on neck lymph node organization with reference to the development of the neck dissection classification. The first fundamental nomenclature of the neck lymph nodes is founded on the work of Rouviére (1932). Suárez (1963) described the functional neck dissection on the basis of the fascial compartmentalization of the neck. Lindberg (1972) left the predominantly anatomically correlated grouping of the cervical lymph nodes as described by Rouviére and divided the lymphatic system of the neck on basis of pathophysiological mechanisms. The attention regarding the location of occult metastases led to the description of the selective neck dissection. Since the fundamental work of Shah et al. (1981) there was a multiplicity of more or less slight changes of the neck node regions. These changes were again basis for new neck dissection terminologies. A new classification was introduced in the year 2000 as the revised version of the American Head and Neck Society. The revised version of the neck dissection classification can reduce former controversies, particularly regarding an optimized intraoperative allocation of the lymph nodes and a simplified terminology of the selective neck dissection. With the goal of a standardization of the neck dissection forms it remains to be seen if the proponents of the functional neck dissection after Suárez consider the extent of the neck dissection in patients with N0 neck in favor of the selective neck dissection.

Effects of individual popularity on information spreading in complex networks

NASA Astrophysics Data System (ADS)

Gao, Lei; Li, Ruiqi; Shu, Panpan; Wang, Wei; Gao, Hui; Cai, Shimin

2018-01-01

In real world, human activities often exhibit preferential selection mechanism based on the popularity of individuals. However, this mechanism is seldom taken into account by previous studies about spreading dynamics on networks. Thus in this work, an information spreading model is proposed by considering the preferential selection based on individuals' current popularity, which is defined as the number of individuals' cumulative contacts with informed neighbors. A mean-field theory is developed to analyze the spreading model. Through systematically studying the information spreading dynamics on uncorrelated configuration networks as well as real-world networks, we find that the popularity preference has great impacts on the information spreading. On the one hand, the information spreading is facilitated, i.e., a larger final prevalence of information and a smaller outbreak threshold, if nodes with low popularity are preferentially selected. In this situation, the effective contacts between informed nodes and susceptible nodes are increased, and nodes almost have uniform probabilities of obtaining the information. On the other hand, if nodes with high popularity are preferentially selected, the final prevalence of information is reduced, the outbreak threshold is increased, and even the information cannot outbreak. In addition, the heterogeneity of the degree distribution and the structure of real-world networks do not qualitatively affect the results. Our research can provide some theoretical supports for the promotion of spreading such as information, health related behaviors, and new products, etc.

Immunization with tumor neoantigens displayed on T7 phage nanoparticles elicits plasma antibody and vaccine-draining lymph node B cell responses.

PubMed

Shukla, Girja S; Sun, Yu-Jing; Pero, Stephanie C; Sholler, Giselle S; Krag, David N

2018-06-12

The aim of this preclinical study was to evaluate T7 bacteriophage as a nanoparticle platform for expression of neoantigens that could allow rapid generation of vaccines for potential studies in human cancer patients. We have generated recombinant T7 phage vaccines carrying neoepitopes derived from mutated proteins of B16-F10 melanoma tumor cells. With the single mutated amino acid (AA) centered, peptides were expressed on the outer coat of T7 phage. All peptides with 11 and 34 AAs were successfully expressed. Trimers of the 11-AA peptides were successfully expressed in only 3 of 8 peptides. The 11-AA peptide was better in stimulating antibodies selective for the mutated region than the longer 34-AA peptide. We observed a dose response for vaccines which provides an initial framework of the minimum phage required for vaccination. A single injection with phage-peptide vaccines in both monomer and trimer formats produced significant immune responses in mice on day 21, as assessed by lymph node cell counts, next generation sequencing (NGS), and plasma titers against T7 phage and vaccine peptides. A trimer provided no additional serum response to the monomer format. Immunization of mice with a mixture of 8 different peptide vaccines resulted in antibodies to most of the peptides. It was encouraging that induced antibodies had higher binding to the mutated peptides compared to the corresponding normal peptides. The NGS of lymph node cells demonstrated a low B cell receptor diversity and clonal hyperpolarization in vaccine-draining lymph nodes in comparison to those in unvaccinated mice nodes. The NGS data also revealed phenomenal increase in IgG and other class-switched antibodies following vaccination. These results agree with the higher plasma titers of IgG antibodies against T7 phage and vaccine peptides. Antibodies bound whole B16-F10 cells, lysates and multiple bands on Western blot. This indicates that these vaccine peptides successfully induced antibodies that bind full proteins from which the vaccine peptides were derived. We demonstrate a preclinical platform for rapid production of vaccines that can deliver mutated peptides and stimulate an appropriate B cell response. We anticipate further research in utilizing the cells from a tumor or vaccine draining lymph node as a resource for therapeutic anticancer reagents. Copyright © 2017. Published by Elsevier B.V.

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.

History-based route selection for reactive ad hoc routing protocols

NASA Astrophysics Data System (ADS)

Medidi, Sirisha; Cappetto, Peter

2007-04-01

Ad hoc networks rely on cooperation in order to operate, but in a resource constrained environment not all nodes behave altruistically. Selfish nodes preserve their own resources and do not forward packets not in their own self interest. These nodes degrade the performance of the network, but judicious route selection can help maintain performance despite this behavior. Many route selection algorithms place importance on shortness of the route rather than its reliability. We introduce a light-weight route selection algorithm that uses past behavior to judge the quality of a route rather than solely on the length of the route. It draws information from the underlying routing layer at no extra cost and selects routes with a simple algorithm. This technique maintains this data in a small table, which does not place a high cost on memory. History-based route selection's minimalism suits the needs the portable wireless devices and is easy to implement. We implemented our algorithm and tested it in the ns2 environment. Our simulation results show that history-based route selection achieves higher packet delivery and improved stability than its length-based counterpart.

Interpolating between random walks and optimal transportation routes: Flow with multiple sources and targets

NASA Astrophysics Data System (ADS)

Guex, Guillaume

2016-05-01

In recent articles about graphs, different models proposed a formalism to find a type of path between two nodes, the source and the target, at crossroads between the shortest-path and the random-walk path. These models include a freely adjustable parameter, allowing to tune the behavior of the path toward randomized movements or direct routes. This article presents a natural generalization of these models, namely a model with multiple sources and targets. In this context, source nodes can be viewed as locations with a supply of a certain good (e.g. people, money, information) and target nodes as locations with a demand of the same good. An algorithm is constructed to display the flow of goods in the network between sources and targets. With again a freely adjustable parameter, this flow can be tuned to follow routes of minimum cost, thus displaying the flow in the context of the optimal transportation problem or, by contrast, a random flow, known to be similar to the electrical current flow if the random-walk is reversible. Moreover, a source-targetcoupling can be retrieved from this flow, offering an optimal assignment to the transportation problem. This algorithm is described in the first part of this article and then illustrated with case studies.

The Node Acquisition and Integration Technique: A Node-Link Based Teaching/Learning Strategy.

ERIC Educational Resources Information Center

Diekhoff, George M.

This paper presents the results of three experiments conducted in connection with development of a node-link based teaching/learning strategy. In experiment 1, subjects were instructed to either define concepts selected from a unit of introductory psychology or to describe the relationships existing between pairs of concepts. The cognitive…

Use of Indocyanine Green for Detecting the Sentinel Lymph Node in Breast Cancer Patients: From Preclinical Evaluation to Clinical Validation

PubMed Central

Chi, Chongwei; Ye, Jinzuo; Ding, Haolong; He, De; Huang, Wenhe; Zhang, Guo-Jun; Tian, Jie

2013-01-01

Assessment of the sentinel lymph node (SLN) in patients with early stage breast cancer is vital in selecting the appropriate surgical approach. However, the existing methods, including methylene blue and nuclides, possess low efficiency and effectiveness in mapping SLNs, and to a certain extent exert side effects during application. Indocyanine green (ICG), as a fluorescent dye, has been proved reliable usage in SLN detection by several other groups. In this paper, we introduce a novel surgical navigation system to detect SLN with ICG. This system contains two charge-coupled devices (CCD) to simultaneously capture real-time color and fluorescent video images through two different bands. During surgery, surgeons only need to follow the fluorescence display. In addition, the system saves data automatically during surgery enabling surgeons to find the registration point easily according to image recognition algorithms. To test our system, 5 mice and 10 rabbits were used for the preclinical setting and 22 breast cancer patients were utilized for the clinical evaluation in our experiments. The detection rate was 100% and an average of 2.7 SLNs was found in 22 patients. Our results show that the usage of our surgical navigation system with ICG to detect SLNs in breast cancer patients is technically feasible. PMID:24358319

ORA User’s Guide 2012

DTIC Science & Technology

2012-06-11

places, resources, knowledge sets or other common Node Classes*. 285 This example will use the Stargate dataset (SG-1). This dataset is included...create a new Meta-Network. Below is the NodeSet for Stargate with the original 16 node NodeSet. 376 From the main menu select, Actions > Add...measures by simply gauging their size visually and intuitively. First, visualize one of your networks. Below is the Stargate agent x event network to

Correlation, path analysis and heritability estimation for agronomic traits contribute to yield on soybean

NASA Astrophysics Data System (ADS)

Sulistyo, A.; Purwantoro; Sari, K. P.

2018-01-01

Selection is a routine activity in plant breeding programs that must be done by plant breeders in obtaining superior plant genotypes. The use of appropriate selection criteria will determine the effectiveness of selection activities. The purpose of this study was to analysis the inheritable agronomic traits that contribute to soybean yield. A total of 91 soybean lines were planted in Muneng Experimental Station, Probolinggo District, East Java Province, Indonesia in 2016. All soybean lines were arranged in randomized complete block design with two replicates. Correlation analysis, path analysis and heritability estimation were performed on days to flowering, days to maturing, plant height, number of branches, number of fertile nodes, number of filled pods, weight of 100 seeds, and yield to determine selection criteria on soybean breeding program. The results showed that the heritability value of almost all agronomic traits observed is high except for the number of fertile nodes with low heritability. The result of correlation analysis shows that days to flowering, plant height and number of fertile nodes have positive correlation with seed yield per plot (0.056, 0.444, and 0.100, respectively). In addition, path analysis showed that plant height and number of fertile nodes have highest positive direct effect on soybean yield. Based on this result, plant height can be selected as one of selection criteria in soybean breeding program to obtain high yielding soybean variety.

Focus-based filtering + clustering technique for power-law networks with small world phenomenon

NASA Astrophysics Data System (ADS)

Boutin, François; Thièvre, Jérôme; Hascoët, Mountaz

2006-01-01

Realistic interaction networks usually present two main properties: a power-law degree distribution and a small world behavior. Few nodes are linked to many nodes and adjacent nodes are likely to share common neighbors. Moreover, graph structure usually presents a dense core that is difficult to explore with classical filtering and clustering techniques. In this paper, we propose a new filtering technique accounting for a user-focus. This technique extracts a tree-like graph with also power-law degree distribution and small world behavior. Resulting structure is easily drawn with classical force-directed drawing algorithms. It is also quickly clustered and displayed into a multi-level silhouette tree (MuSi-Tree) from any user-focus. We built a new graph filtering + clustering + drawing API and report a case study.

Selective pinning control of the average disease transmissibility in an HIV contact network

NASA Astrophysics Data System (ADS)

du Toit, E. F.; Craig, I. K.

2015-07-01

Medication is applied to the HIV-infected nodes of high-risk contact networks with the aim of controlling the spread of disease to a predetermined maximum level. This intervention, known as pinning control, is performed both selectively and randomly in the network. These strategies are applied to 300 independent realizations per reference level of incidence on connected undirectional networks without isolated components and varying in size from 100 to 10 000 nodes per network. It is shown that a selective on-off pinning control strategy can control the networks studied with limited steady-state error and, comparing the medians of the doses from both strategies, uses 51.3% less medication than random pinning of all infected nodes. Selective pinning could possibly be used by public health specialists to identify the maximum level of HIV incidence in a population that can be achieved in a constrained funding environment.

Extreme events and event size fluctuations in biased random walks on networks.

PubMed

Kishore, Vimal; Santhanam, M S; Amritkar, R E

2012-05-01

Random walk on discrete lattice models is important to understand various types of transport processes. The extreme events, defined as exceedences of the flux of walkers above a prescribed threshold, have been studied recently in the context of complex networks. This was motivated by the occurrence of rare events such as traffic jams, floods, and power blackouts which take place on networks. In this work, we study extreme events in a generalized random walk model in which the walk is preferentially biased by the network topology. The walkers preferentially choose to hop toward the hubs or small degree nodes. In this setting, we show that extremely large fluctuations in event sizes are possible on small degree nodes when the walkers are biased toward the hubs. In particular, we obtain the distribution of event sizes on the network. Further, the probability for the occurrence of extreme events on any node in the network depends on its "generalized strength," a measure of the ability of a node to attract walkers. The generalized strength is a function of the degree of the node and that of its nearest neighbors. We obtain analytical and simulation results for the probability of occurrence of extreme events on the nodes of a network using a generalized random walk model. The result reveals that the nodes with a larger value of generalized strength, on average, display lower probability for the occurrence of extreme events compared to the nodes with lower values of generalized strength.

Mimotope-based vaccines of Leishmania infantum antigens and their protective efficacy against visceral leishmaniasis.

PubMed

Costa, Lourena Emanuele; Goulart, Luiz Ricardo; Pereira, Nathália Cristina de Jesus; Lima, Mayara Ingrid Sousa; Duarte, Mariana Costa; Martins, Vivian Tamietti; Lage, Paula Sousa; Menezes-Souza, Daniel; Ribeiro, Tatiana Gomes; Melo, Maria Norma; Fernandes, Ana Paula; Soto, Manuel; Tavares, Carlos Alberto Pereira; Chávez-Fumagalli, Miguel Angel; Coelho, Eduardo Antonio Ferraz

2014-01-01

The development of cost-effective prophylactic strategies to prevent leishmaniasis has become a high-priority. The present study has used the phage display technology to identify new immunogens, which were evaluated as vaccines in the murine model of visceral leishmaniasis (VL). Epitope-based immunogens, represented by phage-fused peptides that mimic Leishmania infantum antigens, were selected according to their affinity to antibodies from asymptomatic and symptomatic VL dogs' sera. Twenty phage clones were selected after three selection cycles, and were evaluated by means of in vitro assays of the immune stimulation of spleen cells derived from naive and chronically infected with L. infantum BALB/c mice. Clones that were able to induce specific Th1 immune response, represented by high levels of IFN-γ and low levels of IL-4 were selected, and based on their selectivity and specificity, two clones, namely B10 and C01, were further employed in the vaccination protocols. BALB/c mice vaccinated with clones plus saponin showed both a high and specific production of IFN-γ, IL-12, and GM-CSF after in vitro stimulation with individual clones or L. infantum extracts. Additionally, these animals, when compared to control groups (saline, saponin, wild-type phage plus saponin, or non-relevant phage clone plus saponin), showed significant reductions in the parasite burden in the liver, spleen, bone marrow, and paws' draining lymph nodes. Protection was associated with an IL-12-dependent production of IFN-γ, mainly by CD8+ T cells, against parasite proteins. These animals also presented decreased parasite-mediated IL-4 and IL-10 responses, and increased levels of parasite-specific IgG2a antibodies. This study describes two phage clones that mimic L. infantum antigens, which were directly used as immunogens in vaccines and presented Th1-type immune responses, and that significantly reduced the parasite burden. This is the first study that describes phage-displayed peptides as successful immunogens in vaccine formulations against VL.

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.

Analysis of complex network performance and heuristic node removal strategies

NASA Astrophysics Data System (ADS)

Jahanpour, Ehsan; Chen, Xin

2013-12-01

Removing important nodes from complex networks is a great challenge in fighting against criminal organizations and preventing disease outbreaks. Six network performance metrics, including four new metrics, are applied to quantify networks' diffusion speed, diffusion scale, homogeneity, and diameter. In order to efficiently identify nodes whose removal maximally destroys a network, i.e., minimizes network performance, ten structured heuristic node removal strategies are designed using different node centrality metrics including degree, betweenness, reciprocal closeness, complement-derived closeness, and eigenvector centrality. These strategies are applied to remove nodes from the September 11, 2001 hijackers' network, and their performance are compared to that of a random strategy, which removes randomly selected nodes, and the locally optimal solution (LOS), which removes nodes to minimize network performance at each step. The computational complexity of the 11 strategies and LOS is also analyzed. Results show that the node removal strategies using degree and betweenness centralities are more efficient than other strategies.

Overconfidence, preview, and probability in strategic planning

NASA Technical Reports Server (NTRS)

Wickens, Christopher D.; Pizarro, David; Bell, Brian

1991-01-01

The performance of eight subjects in a 'rescue' video game requiring choices as to which node they should fly to in order to rescue the simulated casualties is presently studied with a view to biases and display support criteria in strategic planning. After each choice, the subjects needed to fly a challenging tracking dynamic along a path to reach the next node. The results obtained indicate that the choices of the subjects were less optimal when full preview was offered, perhaps due to subjects' reliance on the simple strategy of choosing routes with the greatest number of casualties.

A Support Vector Learning-Based Particle Filter Scheme for Target Localization in Communication-Constrained Underwater Acoustic Sensor Networks

PubMed Central

Zhang, Chenglin; Yan, Lei; Han, Song; Guan, Xinping

2017-01-01

Target localization, which aims to estimate the location of an unknown target, is one of the key issues in applications of underwater acoustic sensor networks (UASNs). However, the constrained property of an underwater environment, such as restricted communication capacity of sensor nodes and sensing noises, makes target localization a challenging problem. This paper relies on fractional sensor nodes to formulate a support vector learning-based particle filter algorithm for the localization problem in communication-constrained underwater acoustic sensor networks. A node-selection strategy is exploited to pick fractional sensor nodes with short-distance pattern to participate in the sensing process at each time frame. Subsequently, we propose a least-square support vector regression (LSSVR)-based observation function, through which an iterative regression strategy is used to deal with the distorted data caused by sensing noises, to improve the observation accuracy. At the same time, we integrate the observation to formulate the likelihood function, which effectively update the weights of particles. Thus, the particle effectiveness is enhanced to avoid “particle degeneracy” problem and improve localization accuracy. In order to validate the performance of the proposed localization algorithm, two different noise scenarios are investigated. The simulation results show that the proposed localization algorithm can efficiently improve the localization accuracy. In addition, the node-selection strategy can effectively select the subset of sensor nodes to improve the communication efficiency of the sensor network. PMID:29267252

A Support Vector Learning-Based Particle Filter Scheme for Target Localization in Communication-Constrained Underwater Acoustic Sensor Networks.

PubMed

Li, Xinbin; Zhang, Chenglin; Yan, Lei; Han, Song; Guan, Xinping

2017-12-21

Target localization, which aims to estimate the location of an unknown target, is one of the key issues in applications of underwater acoustic sensor networks (UASNs). However, the constrained property of an underwater environment, such as restricted communication capacity of sensor nodes and sensing noises, makes target localization a challenging problem. This paper relies on fractional sensor nodes to formulate a support vector learning-based particle filter algorithm for the localization problem in communication-constrained underwater acoustic sensor networks. A node-selection strategy is exploited to pick fractional sensor nodes with short-distance pattern to participate in the sensing process at each time frame. Subsequently, we propose a least-square support vector regression (LSSVR)-based observation function, through which an iterative regression strategy is used to deal with the distorted data caused by sensing noises, to improve the observation accuracy. At the same time, we integrate the observation to formulate the likelihood function, which effectively update the weights of particles. Thus, the particle effectiveness is enhanced to avoid "particle degeneracy" problem and improve localization accuracy. In order to validate the performance of the proposed localization algorithm, two different noise scenarios are investigated. The simulation results show that the proposed localization algorithm can efficiently improve the localization accuracy. In addition, the node-selection strategy can effectively select the subset of sensor nodes to improve the communication efficiency of the sensor network.

Immunohistochemical expression study of proapoptotic BH3-only protein bad in canine nonneoplastic tissues and canine lymphomas.

PubMed

Dettwiler, M; Croci, M; Vaughan, L; Guscetti, F

2013-09-01

The BH3-only protein Bad is a proapoptotic Bcl-2 family member that acts as a sensitizer in intrinsic apoptosis by inactivating antiapoptotic members through heterodimer formation. Bad has been shown to contribute to tumorigenesis, including lymphoma formation in humans and mice, through alteration in expression or functional status. Here, its immunohistochemical expression was analyzed in canine nonneoplastic and lymphoma tissues using tissue microarrays. Bad was expressed in the cytoplasm of a wide range of nonneoplastic tissues, especially epithelial cells. Nonneoplastic lymph nodes displayed weak immunostaining in the follicular germinal centers only. Immunoblotting supported these observations but also revealed presence of nonspecific labeling in some organs. Of 81 lymphomas, 29 (35.8%) displayed moderate to strong immunohistochemical Bad labeling, and a significant expression increase was found in lymphomas (especially B cell and double negative) compared to nonneoplastic lymph nodes. These findings warrant further investigations of the functional status, the involvement of partner proteins, and a possible impact of Bad on prognosis in canine lymphoma.

Topological robustness analysis of protein interaction networks reveals key targets for overcoming chemotherapy resistance in glioma

NASA Astrophysics Data System (ADS)

Azevedo, Hátylas; Moreira-Filho, Carlos Alberto

2015-11-01

Biological networks display high robustness against random failures but are vulnerable to targeted attacks on central nodes. Thus, network topology analysis represents a powerful tool for investigating network susceptibility against targeted node removal. Here, we built protein interaction networks associated with chemoresistance to temozolomide, an alkylating agent used in glioma therapy, and analyzed their modular structure and robustness against intentional attack. These networks showed functional modules related to DNA repair, immunity, apoptosis, cell stress, proliferation and migration. Subsequently, network vulnerability was assessed by means of centrality-based attacks based on the removal of node fractions in descending orders of degree, betweenness, or the product of degree and betweenness. This analysis revealed that removing nodes with high degree and high betweenness was more effective in altering networks’ robustness parameters, suggesting that their corresponding proteins may be particularly relevant to target temozolomide resistance. In silico data was used for validation and confirmed that central nodes are more relevant for altering proliferation rates in temozolomide-resistant glioma cell lines and for predicting survival in glioma patients. Altogether, these results demonstrate how the analysis of network vulnerability to topological attack facilitates target prioritization for overcoming cancer chemoresistance.

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.

Global interrupt and barrier networks

DOEpatents

Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E; Heidelberger, Philip; Kopcsay, Gerard V.; Steinmacher-Burow, Burkhard D.; Takken, Todd E.

2008-10-28

A system and method for generating global asynchronous signals in a computing structure. Particularly, a global interrupt and barrier network is implemented that implements logic for generating global interrupt and barrier signals for controlling global asynchronous operations performed by processing elements at selected processing nodes of a computing structure in accordance with a processing algorithm; and includes the physical interconnecting of the processing nodes for communicating the global interrupt and barrier signals to the elements via low-latency paths. The global asynchronous signals respectively initiate interrupt and barrier operations at the processing nodes at times selected for optimizing performance of the processing algorithms. In one embodiment, the global interrupt and barrier network is implemented in a scalable, massively parallel supercomputing device structure comprising a plurality of processing nodes interconnected by multiple independent networks, with each node including one or more processing elements for performing computation or communication activity as required when performing parallel algorithm operations. One multiple independent network includes a global tree network for enabling high-speed global tree communications among global tree network nodes or sub-trees thereof. The global interrupt and barrier network may operate in parallel with the global tree network for providing global asynchronous sideband signals.

Complex networks in the Euclidean space of communicability distances

NASA Astrophysics Data System (ADS)

Estrada, Ernesto

2012-06-01

We study the properties of complex networks embedded in a Euclidean space of communicability distances. The communicability distance between two nodes is defined as the difference between the weighted sum of walks self-returning to the nodes and the weighted sum of walks going from one node to the other. We give some indications that the communicability distance identifies the least crowded routes in networks where simultaneous submission of packages is taking place. We define an index Q based on communicability and shortest path distances, which allows reinterpreting the “small-world” phenomenon as the region of minimum Q in the Watts-Strogatz model. It also allows the classification and analysis of networks with different efficiency of spatial uses. Consequently, the communicability distance displays unique features for the analysis of complex networks in different scenarios.

Axillary Ultrasound After Neoadjuvant Chemotherapy and Its Impact on Sentinel Lymph Node Surgery: Results From the American College of Surgeons Oncology Group Z1071 Trial (Alliance)

PubMed Central

Boughey, Judy C.; Ballman, Karla V.; Hunt, Kelly K.; McCall, Linda M.; Mittendorf, Elizabeth A.; Ahrendt, Gretchen M.; Wilke, Lee G.; Le-Petross, Huong T.

2015-01-01

Purpose The American College of Surgeons Oncology Group Z1071 trial reported a 12.6% false-negative rate (FNR) for sentinel lymph node (SLN) surgery after neoadjuvant chemotherapy (NAC) in cN1 disease. Patients were not selected for surgery based on response, but a secondary end point was to determine whether axillary ultrasound (AUS) after NAC after fine-needle aspiration cytology can identify abnormal nodes and guide patient selection for SLN surgery. Patients and Methods Patients with T0-4, N1-2, M0 breast cancer underwent AUS after neoadjuvant chemotherapy. AUS images were centrally reviewed and classified as normal or suspicious lymph nodes. AUS findings were tested for association with pathologic nodal status and SLN FNR. The impact of AUS results to select patients for SLN surgery to reduce the FNR was assessed. Results Postchemotherapy AUS images were reviewed for 611 patients. One hundred thirty (71.8%) of 181 AUS-suspicious patients were node positive at surgery compared with 243 (56.5%) of 430 AUS-normal patients (P < .001). Patients with AUS-suspicious nodes had a greater number of positive nodes and greater metastasis size (P < .001). The SLN FNR was not different based on AUS results; however, using a strategy where only patients with normal AUS undergo SLN surgery would potentially reduce the FNR in Z1071 patients with ≥ two SLNs removed from 12.6% to 9.8% when preoperative AUS results are considered as part of SLN surgery. Conclusion AUS is recommended after chemotherapy to guide axillary surgery. An FNR of 9.8% with the combination of AUS and SLN surgery would be acceptable for the adoption of SLN surgery for women with node-positive breast cancer treated with neoadjuvant chemotherapy. PMID:25646192

Axillary Ultrasound After Neoadjuvant Chemotherapy and Its Impact on Sentinel Lymph Node Surgery: Results From the American College of Surgeons Oncology Group Z1071 Trial (Alliance).

PubMed

Boughey, Judy C; Ballman, Karla V; Hunt, Kelly K; McCall, Linda M; Mittendorf, Elizabeth A; Ahrendt, Gretchen M; Wilke, Lee G; Le-Petross, Huong T

2015-10-20

The American College of Surgeons Oncology Group Z1071 trial reported a 12.6% false-negative rate (FNR) for sentinel lymph node (SLN) surgery after neoadjuvant chemotherapy (NAC) in cN1 disease. Patients were not selected for surgery based on response, but a secondary end point was to determine whether axillary ultrasound (AUS) after NAC after fine-needle aspiration cytology can identify abnormal nodes and guide patient selection for SLN surgery. Patients with T0-4, N1-2, M0 breast cancer underwent AUS after neoadjuvant chemotherapy. AUS images were centrally reviewed and classified as normal or suspicious lymph nodes. AUS findings were tested for association with pathologic nodal status and SLN FNR. The impact of AUS results to select patients for SLN surgery to reduce the FNR was assessed. Postchemotherapy AUS images were reviewed for 611 patients. One hundred thirty (71.8%) of 181 AUS-suspicious patients were node positive at surgery compared with 243 (56.5%) of 430 AUS-normal patients (P < .001). Patients with AUS-suspicious nodes had a greater number of positive nodes and greater metastasis size (P < .001). The SLN FNR was not different based on AUS results; however, using a strategy where only patients with normal AUS undergo SLN surgery would potentially reduce the FNR in Z1071 patients with ≥ two SLNs removed from 12.6% to 9.8% when preoperative AUS results are considered as part of SLN surgery. AUS is recommended after chemotherapy to guide axillary surgery. An FNR of 9.8% with the combination of AUS and SLN surgery would be acceptable for the adoption of SLN surgery for women with node-positive breast cancer treated with neoadjuvant chemotherapy. © 2015 by American Society of Clinical Oncology.

Assessing the risk of pelvic and para-aortic nodal involvement in apparent early-stage ovarian cancer: A predictors- and nomogram-based analyses.

PubMed

Bogani, Giorgio; Tagliabue, Elena; Ditto, Antonino; Signorelli, Mauro; Martinelli, Fabio; Casarin, Jvan; Chiappa, Valentina; Dondi, Giulia; Leone Roberti Maggiore, Umberto; Scaffa, Cono; Borghi, Chiara; Montanelli, Luca; Lorusso, Domenica; Raspagliesi, Francesco

2017-10-01

To estimate the prevalence of lymph node involvement in early-stage epithelial ovarian cancer in order to assess the prognostic value of lymph node dissection. Data of consecutive patients undergoing staging for early-stage epithelial ovarian cancer were retrospectively evaluated. Logistic regression and a nomogram-based analysis were used to assess the risk of lymph node involvement. Overall, 290 patients were included. All patients had lymph node dissection including pelvic and para-aortic lymphadenectomy. Forty-two (14.5%) patients were upstaged due to lymph node metastatic disease. Pelvic and para-aortic nodal metastases were observed in 22 (7.6%) and 42 (14.5%) patients. Lymph node involvement was observed in 18/95 (18.9%), 1/37 (2.7%), 4/29 (13.8%), 11/63 (17.4%), 3/41 (7.3%) and 5/24 (20.8%) patients with high-grade serous, low-grade-serous, endometrioid G1, endometrioid G2&3, clear cell and undifferentiated, histology, respectively (p=0.12, Chi-square test). We observed that high-grade serous histology was associated with an increased risk of pelvic node involvement; while, histology rather than low-grade serous and bilateral tumors were independently associated with para-aortic lymph node involvement (p<0.05). Nomograms displaying the risk of nodal involvement in the pelvic and para-aortic areas were built. High-grade serous histology and bilateral tumors are the main characteristics suggesting lymph node positivity. Our data suggested that high-grade serous and bilateral early-stage epithelial ovarian cancer are at high risk of having disease harboring in the lymphatic tissues of both pelvic and para-aortic area. After receiving external validation, our data will help to identify patients deserving comprehensive retroperitoneal staging. Copyright © 2017 Elsevier Inc. All rights reserved.

XML-based information system for planetary sciences

NASA Astrophysics Data System (ADS)

Carraro, F.; Fonte, S.; Turrini, D.

2009-04-01

EuroPlaNet (EPN in the following) has been developed by the planetological community under the "Sixth Framework Programme" (FP6 in the following), the European programme devoted to the improvement of the European research efforts through the creation of an internal market for science and technology. The goal of the EPN programme is the creation of a European network aimed to the diffusion of data produced by space missions dedicated to the study of the Solar System. A special place within the EPN programme is that of I.D.I.S. (Integrated and Distributed Information Service). The main goal of IDIS is to offer to the planetary science community a user-friendly access to the data and information produced by the various types of research activities, i.e. Earth-based observations, space observations, modeling, theory and laboratory experiments. During the FP6 programme IDIS development consisted in the creation of a series of thematic nodes, each of them specialized in a specific scientific domain, and a technical coordination node. The four thematic nodes are the Atmosphere node, the Plasma node, the Interiors & Surfaces node and the Small Bodies & Dust node. The main task of the nodes have been the building up of selected scientific cases related with the scientific domain of each node. The second work done by EPN nodes have been the creation of a catalogue of resources related to their main scientific theme. Both these efforts have been used as the basis for the development of the main IDIS goal, i.e. the integrated distributed service. An XML-based data model have been developed to describe resources using meta-data and to store the meta-data within an XML-based database called eXist. A search engine has been then developed in order to allow users to search resources within the database. Users can select the resource type and can insert one or more values or can choose a value among those present in a list, depending on selected resource. The system searches for all the resources containing the inserted values within the resources descriptions. An important facility of the IDIS search system is the multi-node search capability. This is due to the capacity of eXist to make queries on remote databases. This allows the system to show all resources which satisfy the search criteria on local node and to show how many resources are found on remote nodes, giving also a link to open the results page on remote nodes. During FP7 the development of the IDIS system will have the main goal to make the service Virtual Observatory compliant.

Comparison of the current AJCC-TNM numeric-based with a new anatomical location-based lymph node staging system for gastric cancer: A western experience.

PubMed

Galizia, Gennaro; Lieto, Eva; Auricchio, Annamaria; Cardella, Francesca; Mabilia, Andrea; Diana, Anna; Castellano, Paolo; De Vita, Ferdinando; Orditura, Michele

2017-01-01

In gastric cancer, the current AJCC numeric-based lymph node staging does not provide information on the anatomical extent of the disease and lymphadenectomy. A new anatomical location-based node staging, proposed by Choi, has shown better prognostic performance, thus soliciting Western world validation. Data from 284 gastric cancers undergoing radical surgery at the Second University of Naples from 2000 to 2014 were reviewed. The lymph nodes were reclassified into three groups (lesser and greater curvature, and extraperigastric nodes); presence of any metastatic lymph node in a given group was considered positive, prompting a new N and TNM stage classification. Receiver-operating-characteristic (ROC) curves for censored survival data and bootstrap methods were used to compare the capability of the two models to predict tumor recurrence. More than one third of node positive patients were reclassified into different N and TNM stages by the new system. Compared to the current staging system, the new classification significantly correlated with tumor recurrence rates and displayed improved indices of prognostic performance, such as the Bayesian information criterion and the Harrell C-index. Higher values at survival ROC analysis demonstrated a significantly better stratification of patients by the new system, mostly in the early phase of the follow-up, with a worse prognosis in more advanced new N stages, despite the same current N stage. This study suggests that the anatomical location-based classification of lymph node metastasis may be an important tool for gastric cancer prognosis and should be considered for future revision of the TNM staging system.

Improvement of the SEP protocol based on community structure of node degree

NASA Astrophysics Data System (ADS)

Li, Donglin; Wei, Suyuan

2017-05-01

Analyzing the Stable election protocol (SEP) in wireless sensor networks and aiming at the problem of inhomogeneous cluster-heads distribution and unreasonable cluster-heads selectivity and single hop transmission in the SEP, a SEP Protocol based on community structure of node degree (SEP-CSND) is proposed. In this algorithm, network node deployed by using grid deployment model, and the connection between nodes established by setting up the communication threshold. The community structure constructed by node degree, then cluster head is elected in the community structure. On the basis of SEP, the node's residual energy and node degree is added in cluster-heads election. The information is transmitted with mode of multiple hops between network nodes. The simulation experiments showed that compared to the classical LEACH and SEP, this algorithm balances the energy consumption of the entire network and significantly prolongs network lifetime.

Three-Dimensional Finite Element Analysis of Sheet-Pile Cellular Cofferdams

DTIC Science & Technology

1992-04-01

requirements were in selecting the shell element for this study: * Nodes only at the midsurface of the element. * Higher-order shape functions to...on orthogonal curvilinear coordinate (shell coordinates) system with the ref- erence surface of the element midsurface (Figure 4.13). The formulation...element was selected which allows for: * Nodes at the midsurface of the element only. 150 CHAPTER 4. ADDITIONS TO THE ELEMENT LIBRARY " Higher-order

The pea TCP transcription factor PsBRC1 acts downstream of Strigolactones to control shoot branching.

PubMed

Braun, Nils; de Saint Germain, Alexandre; Pillot, Jean-Paul; Boutet-Mercey, Stéphanie; Dalmais, Marion; Antoniadi, Ioanna; Li, Xin; Maia-Grondard, Alessandra; Le Signor, Christine; Bouteiller, Nathalie; Luo, Da; Bendahmane, Abdelhafid; Turnbull, Colin; Rameau, Catherine

2012-01-01

The function of PsBRC1, the pea (Pisum sativum) homolog of the maize (Zea mays) TEOSINTE BRANCHED1 and the Arabidopsis (Arabidopsis thaliana) BRANCHED1 (AtBRC1) genes, was investigated. The pea Psbrc1 mutant displays an increased shoot-branching phenotype, is able to synthesize strigolactone (SL), and does not respond to SL application. The level of pleiotropy of the SL-deficient ramosus1 (rms1) mutant is higher than in the Psbrc1 mutant, rms1 exhibiting a relatively dwarf phenotype and more extensive branching at upper nodes. The PsBRC1 gene is mostly expressed in the axillary bud and is transcriptionally up-regulated by direct application of the synthetic SL GR24 and down-regulated by the cytokinin (CK) 6-benzylaminopurine. The results suggest that PsBRC1 may have a role in integrating SL and CK signals and that SLs act directly within the bud to regulate its outgrowth. However, the Psbrc1 mutant responds to 6-benzylaminopurine application and decapitation by increasing axillary bud length, implicating a PsBRC1-independent component of the CK response in sustained bud growth. In contrast to other SL-related mutants, the Psbrc1 mutation does not cause a decrease in the CK zeatin riboside in the xylem sap or a strong increase in RMS1 transcript levels, suggesting that the RMS2-dependent feedback is not activated in this mutant. Surprisingly, the double rms1 Psbrc1 mutant displays a strong increase in numbers of branches at cotyledonary nodes, whereas branching at upper nodes is not significantly higher than the branching in rms1. This phenotype indicates a localized regulation of branching at these nodes specific to pea.

Cardiac rhythm and pacemaking abnormalities in patients affected by endemic pemphigus in Colombia may be the result of deposition of autoantibodies, complement, fibrinogen, and other molecules.

PubMed

Abreu Velez, Ana Maria; Howard, Michael S; Velazquez-Velez, Jorge Enrique

2018-05-01

We previously showed that one-third of patients affected by endemic pemphigus foliaceus in El Bagre, Colombia (El Bagre-EPF), display autoreactivity to the heart. The purpose of this study was to investigate rhythm disturbances with the presence of autoantibodies and correlate them with ECG changes in these patients. We performed a study comparing 30 patients and 30 controls from the endemic area, matched by demographics, including age, sex, weight, work activities, and comorbidities. ECG as well as direct and indirect immunofluorescence, immunohistochemistry, and confocal microscopic studies focusing on cardiac node abnormalities were performed. Autopsies of 7 patients also were reviewed. The main ECG abnormalities seen in the El Bagre-EPF patients were sinus bradycardia (in one-half), followed by left bundle branch block, left posterior fascicular block, and left anterior fascicular block compared with the controls. One-third of the patients displayed polyclonal autoantibodies against the sinoatrial and/or AV nodes and the His bundle correlating with rhythm anomalies and delays in the cardiac conduction system (P <.01). The patient antibodies colocalized with commercial antibodies to desmoplakins I and II, p0071, armadillo repeat gene deleted in velo-cardio-facial syndrome (ARVCF), and myocardium-enriched zonula occludens-1-associated protein (MYZAP; Progen Biotechnik) (P <.01). One-third of the patients affected by El Bagre-EPF have rhythm abnormalities that slow the conduction of impulses in cardiac nodes and the cardiac conduction system. These abnormalities likely occur as a result of deposition of autoantibodies, complement, and other inflammatory molecules. We show for the first time that MYZAP is present in cardiac nodes. Copyright © 2017 Heart Rhythm Society. Published by Elsevier Inc. All rights reserved.

Fixed-node diffusion Monte Carlo potential energy curve of the fluorine molecule F{sub 2} using selected configuration interaction trial wavefunctions

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

Giner, Emmanuel; Scemama, Anthony; Caffarel, Michel

2015-01-28

The potential energy curve of the F{sub 2} molecule is calculated with Fixed-Node Diffusion Monte Carlo (FN-DMC) using Configuration Interaction (CI)-type trial wavefunctions. To keep the number of determinants reasonable and thus make FN-DMC calculations feasible in practice, the CI expansion is restricted to those determinants that contribute the most to the total energy. The selection of the determinants is made using the CIPSI approach (Configuration Interaction using a Perturbative Selection made Iteratively). The trial wavefunction used in FN-DMC is directly issued from the deterministic CI program; no Jastrow factor is used and no preliminary multi-parameter stochastic optimization of themore » trial wavefunction is performed. The nodes of CIPSI wavefunctions are found to reduce significantly the fixed-node error and to be systematically improved upon increasing the number of selected determinants. To reduce the non-parallelism error of the potential energy curve, a scheme based on the use of a R-dependent number of determinants is introduced. Using Dunning’s cc-pVDZ basis set, the FN-DMC energy curve of F{sub 2} is found to be of a quality similar to that obtained with full configuration interaction/cc-pVQZ.« less

Three-dimensional simulation, surgical navigation and thoracoscopic lung resection

PubMed Central

Kanzaki, Masato; Kikkawa, Takuma; Sakamoto, Kei; Maeda, Hideyuki; Wachi, Naoko; Komine, Hiroshi; Oyama, Kunihiro; Murasugi, Masahide; Onuki, Takamasa

2013-01-01

This report describes a 3-dimensional (3-D) video-assisted thoracoscopic lung resection guided by a 3-D video navigation system having a patient-specific 3-D reconstructed pulmonary model obtained by preoperative simulation. A 78-year-old man was found to have a small solitary pulmonary nodule in the left upper lobe in chest computed tomography. By a virtual 3-D pulmonary model the tumor was found to be involved in two subsegments (S1 + 2c and S3a). Complete video-assisted thoracoscopic surgery bi-subsegmentectomy was selected in simulation and was performed with lymph node dissection. A 3-D digital vision system was used for 3-D thoracoscopic performance. Wearing 3-D glasses, the patient's actual reconstructed 3-D model on 3-D liquid-crystal displays was observed, and the 3-D intraoperative field and the picture of 3-D reconstructed pulmonary model were compared. PMID:24964426

Definition of architectural ideotypes for good yield capacity in Coffea canephora.

PubMed

Cilas, Christian; Bar-Hen, Avner; Montagnon, Christophe; Godin, Christophe

2006-03-01

Yield capacity is a target trait for selection of agronomically desirable lines; it is preferred to simple yields recorded over different harvests. Yield capacity is derived using certain architectural parameters used to measure the components of yield capacity. Observation protocols for describing architecture and yield capacity were applied to six clones of coffee trees (Coffea canephora) in a comparative trial. The observations were used to establish architectural databases, which were explored using AMAPmod, a software dedicated to the analyses of plant architecture data. The traits extracted from the database were used to identify architectural parameters for predicting the yield of the plant material studied. Architectural traits are highly heritable and some display strong genetic correlations with cumulated yield. In particular, the proportion of fruiting nodes at plagiotropic level 15 counting from the top of the tree proved to be a good predictor of yield over two fruiting cycles.

Complete Sequence and Comparative Analysis of the Chloroplast Genome of Coconut Palm (Cocos nucifera)

PubMed Central

Huang, Ya-Yi; Matzke, Antonius J. M.; Matzke, Marjori

2013-01-01

Coconut, a member of the palm family (Arecaceae), is one of the most economically important trees used by mankind. Despite its diverse morphology, coconut is recognized taxonomically as only a single species (Cocos nucifera L.). There are two major coconut varieties, tall and dwarf, the latter of which displays traits resulting from selection by humans. We report here the complete chloroplast (cp) genome of a dwarf coconut plant, and describe the gene content and organization, inverted repeat fluctuations, repeated sequence structure, and occurrence of RNA editing. Phylogenetic relationships of monocots were inferred based on 47 chloroplast protein-coding genes. Potential nodes for events of gene duplication and pseudogenization related to inverted repeat fluctuation were mapped onto the tree using parsimony criteria. We compare our findings with those from other palm species for which complete cp genome sequences are available. PMID:24023703

Complete sequence and comparative analysis of the chloroplast genome of coconut palm (Cocos nucifera).

PubMed

Huang, Ya-Yi; Matzke, Antonius J M; Matzke, Marjori

2013-01-01

Coconut, a member of the palm family (Arecaceae), is one of the most economically important trees used by mankind. Despite its diverse morphology, coconut is recognized taxonomically as only a single species (Cocos nucifera L.). There are two major coconut varieties, tall and dwarf, the latter of which displays traits resulting from selection by humans. We report here the complete chloroplast (cp) genome of a dwarf coconut plant, and describe the gene content and organization, inverted repeat fluctuations, repeated sequence structure, and occurrence of RNA editing. Phylogenetic relationships of monocots were inferred based on 47 chloroplast protein-coding genes. Potential nodes for events of gene duplication and pseudogenization related to inverted repeat fluctuation were mapped onto the tree using parsimony criteria. We compare our findings with those from other palm species for which complete cp genome sequences are available.

Communities and classes in symmetric fractals

NASA Astrophysics Data System (ADS)

Krawczyk, Małgorzata J.

2015-07-01

Two aspects of fractal networks are considered: the community structure and the class structure, where classes of nodes appear as a consequence of a local symmetry of nodes. The analyzed systems are the networks constructed for two selected symmetric fractals: the Sierpinski triangle and the Koch curve. Communities are searched for by means of a set of differential equations. Overlapping nodes which belong to two different communities are identified by adding some noise to the initial connectivity matrix. Then, a node can be characterized by a spectrum of probabilities of belonging to different communities. Our main goal is that the overlapping nodes with the same spectra belong to the same class.

CPAC: Energy-Efficient Data Collection through Adaptive Selection of Compression Algorithms for Sensor Networks

PubMed Central

Lee, HyungJune; Kim, HyunSeok; Chang, Ik Joon

2014-01-01

We propose a technique to optimize the energy efficiency of data collection in sensor networks by exploiting a selective data compression. To achieve such an aim, we need to make optimal decisions regarding two aspects: (1) which sensor nodes should execute compression; and (2) which compression algorithm should be used by the selected sensor nodes. We formulate this problem into binary integer programs, which provide an energy-optimal solution under the given latency constraint. Our simulation results show that the optimization algorithm significantly reduces the overall network-wide energy consumption for data collection. In the environment having a stationary sink from stationary sensor nodes, the optimized data collection shows 47% energy savings compared to the state-of-the-art collection protocol (CTP). More importantly, we demonstrate that our optimized data collection provides the best performance in an intermittent network under high interference. In such networks, we found that the selective compression for frequent packet retransmissions saves up to 55% energy compared to the best known protocol. PMID:24721763

Information Selection in Intelligence Processing

DTIC Science & Technology

2011-12-01

given. Edges connecting nodes representing irrelevant persons with either relevant or irrelevant persons are added randomly, as in an Erdos- Renyi ...graph (Erdos at Renyi , 1959): For each irrelevant node i , and another node j (either relevant or irrelevant) there is a predetermined probability that...statistics for engineering and the sciences (7th ed.). Boston: Duxbury Press. Erdos, P., & Renyi , A. (1959). “On Random Graphs,” Publicationes

Node Self-Deployment Algorithm Based on an Uneven Cluster with Radius Adjusting for Underwater Sensor Networks

PubMed Central

Jiang, Peng; Xu, Yiming; Wu, Feng

2016-01-01

Existing move-restricted node self-deployment algorithms are based on a fixed node communication radius, evaluate the performance based on network coverage or the connectivity rate and do not consider the number of nodes near the sink node and the energy consumption distribution of the network topology, thereby degrading network reliability and the energy consumption balance. Therefore, we propose a distributed underwater node self-deployment algorithm. First, each node begins the uneven clustering based on the distance on the water surface. Each cluster head node selects its next-hop node to synchronously construct a connected path to the sink node. Second, the cluster head node adjusts its depth while maintaining the layout formed by the uneven clustering and then adjusts the positions of in-cluster nodes. The algorithm originally considers the network reliability and energy consumption balance during node deployment and considers the coverage redundancy rate of all positions that a node may reach during the node position adjustment. Simulation results show, compared to the connected dominating set (CDS) based depth computation algorithm, that the proposed algorithm can increase the number of the nodes near the sink node and improve network reliability while guaranteeing the network connectivity rate. Moreover, it can balance energy consumption during network operation, further improve network coverage rate and reduce energy consumption. PMID:26784193

Evaluation of N-ratio in selecting patients for adjuvant chemoradiotherapy after d2-gastrectomy.

PubMed

Costa Junior, Wilson Luiz da; Coimbra, Felipe José Fernández; Batista, Thales Paulo; Ribeiro, Héber Salvador de Castro; Diniz, Alessandro Landskron

2013-01-01

Whether adjuvant chemoradiotherapy may contribute to improve survival outcomes after D2-gastrectomy remains controversial. To explore the clinical utility of N-Ratio in selecting gastric cancer patients for adjuvant chemoradiotherapy after D2-gastrectomy. A retrospective cohort study was carried out on gastric cancer patients who underwent D2-gastrectomy alone or D2-gastrectomy plus adjuvant chemoradiotherapy (INT-0116 protocol) at the Hospital A. C. Camargo from September 1998 to December 2008. Statistical analysis were performed using multiple conventional methods, such as c-statistic, adjusted Cox's regression and stratified survival analysis. Our analysis involved 128 patients. According to c-statistic, the N-Ratio (i.e., as a continuous variable) presented "area under ROC curve" (AUC) of 0.713, while the number of metastatic nodes presented AUC of 0.705. After categorization, the cut-offs provide by Marchet et al. displayed the highest discriminating power - AUC value of 0.702. This N-Ratio categorization was confirmed as an independent predictor of survival using multivariate analyses. There also was a trend of better survival by adding of adjuvant chemoradiotherapy only for patients with milder degrees of lymphatic spread - 5-year survival of 23.1% vs 66.9%, respectively (HR = 0.426, 95% CI 0.150-1.202; P = 0.092). This study confirms the N-Ratio as a tool to improve the lymph node metastasis staging in gastric cancer and suggests the cut-offs provided by Marchet et al. as the best way for its categorization after a D2-gastrectomy. In these settings, the N-Ratio appears a useful tool to select patients for adjuvant chemoradiotherapy, and the benefit of adding this type of adjuvancy to D2-gastrectomy is suggested to be limited to patients with milder degrees of lymphatic spread (i.e., NR2, 10%-25%).

A fast and accurate online sequential learning algorithm for feedforward networks.

PubMed

Liang, Nan-Ying; Huang, Guang-Bin; Saratchandran, P; Sundararajan, N

2006-11-01

In this paper, we develop an online sequential learning algorithm for single hidden layer feedforward networks (SLFNs) with additive or radial basis function (RBF) hidden nodes in a unified framework. The algorithm is referred to as online sequential extreme learning machine (OS-ELM) and can learn data one-by-one or chunk-by-chunk (a block of data) with fixed or varying chunk size. The activation functions for additive nodes in OS-ELM can be any bounded nonconstant piecewise continuous functions and the activation functions for RBF nodes can be any integrable piecewise continuous functions. In OS-ELM, the parameters of hidden nodes (the input weights and biases of additive nodes or the centers and impact factors of RBF nodes) are randomly selected and the output weights are analytically determined based on the sequentially arriving data. The algorithm uses the ideas of ELM of Huang et al. developed for batch learning which has been shown to be extremely fast with generalization performance better than other batch training methods. Apart from selecting the number of hidden nodes, no other control parameters have to be manually chosen. Detailed performance comparison of OS-ELM is done with other popular sequential learning algorithms on benchmark problems drawn from the regression, classification and time series prediction areas. The results show that the OS-ELM is faster than the other sequential algorithms and produces better generalization performance.

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.

Research on centrality of urban transport network nodes

NASA Astrophysics Data System (ADS)

Wang, Kui; Fu, Xiufen

2017-05-01

Based on the actual data of urban transport in Guangzhou, 19,150 bus stations in Guangzhou (as of 2014) are selected as nodes. Based on the theory of complex network, the network model of Guangzhou urban transport is constructed. By analyzing the degree centrality index, betweenness centrality index and closeness centrality index of nodes in the network, the level of centrality of each node in the network is studied. From a different point of view to determine the hub node of Guangzhou urban transport network, corresponding to the city's key sites and major transfer sites. The reliability of the network is determined by the stability of some key nodes (transport hub station). The research of network node centralization can provide a theoretical basis for the rational allocation of urban transport network sites and public transport system planning.

Complex network structure of musical compositions: Algorithmic generation of appealing music

NASA Astrophysics Data System (ADS)

Liu, Xiao Fan; Tse, Chi K.; Small, Michael

2010-01-01

In this paper we construct networks for music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes and their co-occurring connections. We analyze classical music from Bach, Mozart, Chopin, as well as other types of music such as Chinese pop music. We observe remarkably similar properties in all networks constructed from the selected compositions. We conjecture that preserving the universal network properties is a necessary step in artificial composition of music. Power-law exponents of node degree, node strength and/or edge weight distributions, mean degrees, clustering coefficients, mean geodesic distances, etc. are reported. With the network constructed, music can be composed artificially using a controlled random walk algorithm, which begins with a randomly chosen note and selects the subsequent notes according to a simple set of rules that compares the weights of the edges, weights of the nodes, and/or the degrees of nodes. By generating a large number of compositions, we find that this algorithm generates music which has the necessary qualities to be subjectively judged as appealing.

Synchronous Firefly Algorithm for Cluster Head Selection in WSN.

PubMed

Baskaran, Madhusudhanan; Sadagopan, Chitra

2015-01-01

Wireless Sensor Network (WSN) consists of small low-cost, low-power multifunctional nodes interconnected to efficiently aggregate and transmit data to sink. Cluster-based approaches use some nodes as Cluster Heads (CHs) and organize WSNs efficiently for aggregation of data and energy saving. A CH conveys information gathered by cluster nodes and aggregates/compresses data before transmitting it to a sink. However, this additional responsibility of the node results in a higher energy drain leading to uneven network degradation. Low Energy Adaptive Clustering Hierarchy (LEACH) offsets this by probabilistically rotating cluster heads role among nodes with energy above a set threshold. CH selection in WSN is NP-Hard as optimal data aggregation with efficient energy savings cannot be solved in polynomial time. In this work, a modified firefly heuristic, synchronous firefly algorithm, is proposed to improve the network performance. Extensive simulation shows the proposed technique to perform well compared to LEACH and energy-efficient hierarchical clustering. Simulations show the effectiveness of the proposed method in decreasing the packet loss ratio by an average of 9.63% and improving the energy efficiency of the network when compared to LEACH and EEHC.

A Multi-Hop Clustering Mechanism for Scalable IoT Networks.

PubMed

Sung, Yoonyoung; Lee, Sookyoung; Lee, Meejeong

2018-03-23

It is expected that up to 26 billion Internet of Things (IoT) equipped with sensors and wireless communication capabilities will be connected to the Internet by 2020 for various purposes. With a large scale IoT network, having each node connected to the Internet with an individual connection may face serious scalability issues. The scalability problem of the IoT network may be alleviated by grouping the nodes of the IoT network into clusters and having a representative node in each cluster connect to the Internet on behalf of the other nodes in the cluster instead of having a per-node Internet connection and communication. In this paper, we propose a multi-hop clustering mechanism for IoT networks to minimize the number of required Internet connections. Specifically, the objective of proposed mechanism is to select the minimum number of coordinators, which take the role of a representative node for the cluster, i.e., having the Internet connection on behalf of the rest of the nodes in the cluster and to map a partition of the IoT nodes onto the selected set of coordinators to minimize the total distance between the nodes and their respective coordinator under a certain constraint in terms of maximum hop count between the IoT nodes and their respective coordinator. Since this problem can be mapped into a set cover problem which is known as NP-hard, we pursue a heuristic approach to solve the problem and analyze the complexity of the proposed solution. Through a set of experiments with varying parameters, the proposed scheme shows 63-87.3% reduction of the Internet connections depending on the number of the IoT nodes while that of the optimal solution is 65.6-89.9% in a small scale network. Moreover, it is shown that the performance characteristics of the proposed mechanism coincide with expected performance characteristics of the optimal solution in a large-scale network.

A Multi-Hop Clustering Mechanism for Scalable IoT Networks

PubMed Central

2018-01-01

It is expected that up to 26 billion Internet of Things (IoT) equipped with sensors and wireless communication capabilities will be connected to the Internet by 2020 for various purposes. With a large scale IoT network, having each node connected to the Internet with an individual connection may face serious scalability issues. The scalability problem of the IoT network may be alleviated by grouping the nodes of the IoT network into clusters and having a representative node in each cluster connect to the Internet on behalf of the other nodes in the cluster instead of having a per-node Internet connection and communication. In this paper, we propose a multi-hop clustering mechanism for IoT networks to minimize the number of required Internet connections. Specifically, the objective of proposed mechanism is to select the minimum number of coordinators, which take the role of a representative node for the cluster, i.e., having the Internet connection on behalf of the rest of the nodes in the cluster and to map a partition of the IoT nodes onto the selected set of coordinators to minimize the total distance between the nodes and their respective coordinator under a certain constraint in terms of maximum hop count between the IoT nodes and their respective coordinator. Since this problem can be mapped into a set cover problem which is known as NP-hard, we pursue a heuristic approach to solve the problem and analyze the complexity of the proposed solution. Through a set of experiments with varying parameters, the proposed scheme shows 63–87.3% reduction of the Internet connections depending on the number of the IoT nodes while that of the optimal solution is 65.6–89.9% in a small scale network. Moreover, it is shown that the performance characteristics of the proposed mechanism coincide with expected performance characteristics of the optimal solution in a large-scale network. PMID:29570691

Selection of test paths for solder joint intermittent connection faults under DC stimulus

NASA Astrophysics Data System (ADS)

Huakang, Li; Kehong, Lv; Jing, Qiu; Guanjun, Liu; Bailiang, Chen

2018-06-01

The test path of solder joint intermittent connection faults under direct-current stimulus is examined in this paper. According to the physical structure of the circuit, a network model is established first. A network node is utilised to represent the test node. The path edge refers to the number of intermittent connection faults in the path. Then, the selection criteria of the test path based on the node degree index are proposed and the solder joint intermittent connection faults are covered using fewer test paths. Finally, three circuits are selected to verify the method. To test if the intermittent fault is covered by the test paths, the intermittent fault is simulated by a switch. The results show that the proposed method can detect the solder joint intermittent connection fault using fewer test paths. Additionally, the number of detection steps is greatly reduced without compromising fault coverage.

Risk Factors for Predicting Occult Lymph Node Metastasis in Patients with Clinical Stage I Non-small Cell Lung Cancer Staged by Integrated Fluorodeoxyglucose Positron Emission Tomography/Computed Tomography.

PubMed

Kaseda, Kaoru; Asakura, Keisuke; Kazama, Akio; Ozawa, Yukihiko

2016-12-01

Lymph nodes in patients with non-small cell lung cancer (NSCLC) are often staged using integrated 18F-fluorodeoxyglucose positron emission tomography/computed tomography (FDG-PET/CT). However, this modality has limited ability to detect micrometastases. We aimed to define risk factors for occult lymph node metastasis in patients with clinical stage I NSCLC diagnosed by preoperative integrated FDG-PET/CT. We retrospectively reviewed the records of 246 patients diagnosed with clinical stage I NSCLC based on integrated FDG-PET/CT between April 2007 and May 2015. All patients were treated by complete surgical resection. The prevalence of occult lymph node metastasis in patients with clinical stage I NSCLC was analysed according to clinicopathological factors. Risk factors for occult lymph node metastasis were defined using univariate and multivariate analyses. Occult lymph node metastasis was detected in 31 patients (12.6 %). Univariate analysis revealed CEA (P = 0.04), SUV max of the primary tumour (P = 0.031), adenocarcinoma (P = 0.023), tumour size (P = 0.002) and pleural invasion (P = 0.046) as significant predictors of occult lymph node metastasis. Multivariate analysis selected SUV max of the primary tumour (P = 0.049), adenocarcinoma (P = 0.003) and tumour size (P = 0.019) as independent predictors of occult lymph node metastasis. The SUV max of the primary tumour, adenocarcinoma and tumour size were risk factors for occult lymph node metastasis in patients with NSCLC diagnosed as clinical stage I by preoperative integrated FDG-PET/CT. These findings would be helpful in selecting candidates for mediastinoscopy or endobronchial ultrasound-guided transbronchial needle aspiration.

A Hybrid DV-Hop Algorithm Using RSSI for Localization in Large-Scale Wireless Sensor Networks.

PubMed

Cheikhrouhou, Omar; M Bhatti, Ghulam; Alroobaea, Roobaea

2018-05-08

With the increasing realization of the Internet-of-Things (IoT) and rapid proliferation of wireless sensor networks (WSN), estimating the location of wireless sensor nodes is emerging as an important issue. Traditional ranging based localization algorithms use triangulation for estimating the physical location of only those wireless nodes that are within one-hop distance from the anchor nodes. Multi-hop localization algorithms, on the other hand, aim at localizing the wireless nodes that can physically be residing at multiple hops away from anchor nodes. These latter algorithms have attracted a growing interest from research community due to the smaller number of required anchor nodes. One such algorithm, known as DV-Hop (Distance Vector Hop), has gained popularity due to its simplicity and lower cost. However, DV-Hop suffers from reduced accuracy due to the fact that it exploits only the network topology (i.e., number of hops to anchors) rather than the distances between pairs of nodes. In this paper, we propose an enhanced DV-Hop localization algorithm that also uses the RSSI values associated with links between one-hop neighbors. Moreover, we exploit already localized nodes by promoting them to become additional anchor nodes. Our simulations have shown that the proposed algorithm significantly outperforms the original DV-Hop localization algorithm and two of its recently published variants, namely RSSI Auxiliary Ranging and the Selective 3-Anchor DV-hop algorithm. More precisely, in some scenarios, the proposed algorithm improves the localization accuracy by almost 95%, 90% and 70% as compared to the basic DV-Hop, Selective 3-Anchor, and RSSI DV-Hop algorithms, respectively.

An Effective Delay Reduction Approach through a Portion of Nodes with a Larger Duty Cycle for Industrial WSNs

PubMed Central

Wu, Minrui; Wu, Yanhui; Liu, Chuyao; Cai, Zhiping; Ma, Ming

2018-01-01

For Industrial Wireless Sensor Networks (IWSNs), sending data with timely style to the stink (or control center, CC) that is monitored by sensor nodes is a challenging issue. However, in order to save energy, wireless sensor networks based on a duty cycle are widely used in the industrial field, which can bring great delay to data transmission. We observe that if the duty cycle of a small number of nodes in the network is set to 1, the sleep delay caused by the duty cycle can be effectively reduced. Thus, in this paper, a novel Portion of Nodes with Larger Duty Cycle (PNLDC) scheme is proposed to reduce delay and optimize energy efficiency for IWSNs. In the PNLDC scheme, a portion of nodes are selected to set their duty cycle to 1, and the proportion of nodes with the duty cycle of 1 is determined according to the energy abundance of the area in which the node is located. The more the residual energy in the region, the greater the proportion of the selected nodes. Because there are a certain proportion of nodes with the duty cycle of 1 in the network, the PNLDC scheme can effectively reduce delay in IWSNs. The performance analysis and experimental results show that the proposed scheme significantly reduces the delay for forwarding data by 8.9~26.4% and delay for detection by 2.1~24.6% without reducing the network lifetime when compared with the fixed duty cycle method. Meanwhile, compared with the dynamic duty cycle strategy, the proposed scheme has certain advantages in terms of energy utilization and delay reduction. PMID:29757236

An Effective Delay Reduction Approach through a Portion of Nodes with a Larger Duty Cycle for Industrial WSNs.

PubMed

Wu, Minrui; Wu, Yanhui; Liu, Chuyao; Cai, Zhiping; Xiong, Neal N; Liu, Anfeng; Ma, Ming

2018-05-12

For Industrial Wireless Sensor Networks (IWSNs), sending data with timely style to the stink (or control center, CC) that is monitored by sensor nodes is a challenging issue. However, in order to save energy, wireless sensor networks based on a duty cycle are widely used in the industrial field, which can bring great delay to data transmission. We observe that if the duty cycle of a small number of nodes in the network is set to 1, the sleep delay caused by the duty cycle can be effectively reduced. Thus, in this paper, a novel Portion of Nodes with Larger Duty Cycle (PNLDC) scheme is proposed to reduce delay and optimize energy efficiency for IWSNs. In the PNLDC scheme, a portion of nodes are selected to set their duty cycle to 1, and the proportion of nodes with the duty cycle of 1 is determined according to the energy abundance of the area in which the node is located. The more the residual energy in the region, the greater the proportion of the selected nodes. Because there are a certain proportion of nodes with the duty cycle of 1 in the network, the PNLDC scheme can effectively reduce delay in IWSNs. The performance analysis and experimental results show that the proposed scheme significantly reduces the delay for forwarding data by 8.9~26.4% and delay for detection by 2.1~24.6% without reducing the network lifetime when compared with the fixed duty cycle method. Meanwhile, compared with the dynamic duty cycle strategy, the proposed scheme has certain advantages in terms of energy utilization and delay reduction.

Method for gathering and summarizing internet information

DOEpatents

Potok, Thomas E.; Elmore, Mark Thomas; Reed, Joel Wesley; Treadwell, Jim N.; Samatova, Nagiza Faridovna

2010-04-06

A computer method of gathering and summarizing large amounts of information comprises collecting information from a plurality of information sources (14, 51) according to respective maps (52) of the information sources (14), converting the collected information from a storage format to XML-language documents (26, 53) and storing the XML-language documents in a storage medium, searching for documents (55) according to a search query (13) having at least one term and identifying the documents (26) found in the search, and displaying the documents as nodes (33) of a tree structure (32) having links (34) and nodes (33) so as to indicate similarity of the documents to each other.

System for gathering and summarizing internet information

DOEpatents

Potok, Thomas E.; Elmore, Mark Thomas; Reed, Joel Wesley; Treadwell, Jim N.; Samatova, Nagiza Faridovna

2006-07-04

A computer method of gathering and summarizing large amounts of information comprises collecting information from a plurality of information sources (14, 51) according to respective maps (52) of the information sources (14), converting the collected information from a storage format to XML-language documents (26, 53) and storing the XML-language documents in a storage medium, searching for documents (55) according to a search query (13) having at least one term and identifying the documents (26) found in the search, and displaying the documents as nodes (33) of a tree structure (32) having links (34) and nodes (33) so as to indicate similarity of the documents to each other.

Method for gathering and summarizing internet information

DOEpatents

Potok, Thomas E [Oak Ridge, TN; Elmore, Mark Thomas [Oak Ridge, TN; Reed, Joel Wesley [Knoxville, TN; Treadwell, Jim N [Louisville, TN; Samatova, Nagiza Faridovna [Oak Ridge, TN

2008-01-01

A computer method of gathering and summarizing large amounts of information comprises collecting information from a plurality of information sources (14, 51) according to respective maps (52) of the information sources (14), converting the collected information from a storage format to XML-language documents (26, 53) and storing the XML-language documents in a storage medium, searching for documents (55) according to a search query (13) having at least one term and identifying the documents (26) found in the search, and displaying the documents as nodes (33) of a tree structure (32) having links (34) and nodes (33) so as to indicate similarity of the documents to each other.

MTVis: tree exploration using a multitouch interface

NASA Astrophysics Data System (ADS)

Andrews, David; Teoh, Soon Tee

2010-01-01

We present MTVis, a multi-touch interactive tree visualization system. The multi-touch interface display hardware is built using the LED-LP technology, and the tree layout is based on RINGS, but enhanced with multitouch interactions. We describe the features of the system, and how the multi-touch interface enhances the user's experience in exploring the tree data structure. In particular, the multi-touch interface allows the user to simultaneously control two child nodes of the root, and rotate them so that some nodes are magnified, while preserving the layout of the tree. We also describe the other meaninful touch screen gestures the users can use to intuitively explore the tree.

A wearable wireless ECG monitoring system with dynamic transmission power control for long-term homecare.

PubMed

Wang, Yishan; Doleschel, Sammy; Wunderlich, Ralf; Heinen, Stefan

2015-03-01

This paper presents a wearable wireless ECG monitoring system based on novel 3-Lead electrode placements for long-term homecare. The experiment for novel 3-Lead electrode placements is carried out, and the results show that the distance between limb electrodes can be significantly reduced. Based on the new electrode position, a small size sensor node, which is powered by a rechargeable battery, is designed to detect, amplify, filter and transmit the ECG signals. The coordinator receives the data and sends it to PC. Finally the signals are displayed on the GUI. In order to control the power consumption of sensor node, a dynamic power adjustment method is applied to automatically adjust the transmission power of the sensor node according to the received signal strength indicator (RSSI), which is related to the distance and obstacle between sensor node and coordinator. The system is evaluated when the user, who wears the sensor, is walking and running. A promising performance is achieved even under body motion. The power consumption can be significantly reduced with this dynamic power adjustment method.

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.

EdgeMaps: visualizing explicit and implicit relations

NASA Astrophysics Data System (ADS)

Dörk, Marian; Carpendale, Sheelagh; Williamson, Carey

2011-01-01

In this work, we introduce EdgeMaps as a new method for integrating the visualization of explicit and implicit data relations. Explicit relations are specific connections between entities already present in a given dataset, while implicit relations are derived from multidimensional data based on shared properties and similarity measures. Many datasets include both types of relations, which are often difficult to represent together in information visualizations. Node-link diagrams typically focus on explicit data connections, while not incorporating implicit similarities between entities. Multi-dimensional scaling considers similarities between items, however, explicit links between nodes are not displayed. In contrast, EdgeMaps visualize both implicit and explicit relations by combining and complementing spatialization and graph drawing techniques. As a case study for this approach we chose a dataset of philosophers, their interests, influences, and birthdates. By introducing the limitation of activating only one node at a time, interesting visual patterns emerge that resemble the aesthetics of fireworks and waves. We argue that the interactive exploration of these patterns may allow the viewer to grasp the structure of a graph better than complex node-link visualizations.

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

SPACEBAR: Kinematic design by computer graphics

NASA Technical Reports Server (NTRS)

Ricci, R. J.

1975-01-01

The interactive graphics computer program SPACEBAR, conceived to reduce the time and complexity associated with the development of kinematic mechanisms on the design board, was described. This program allows the direct design and analysis of mechanisms right at the terminal screen. All input variables, including linkage geometry, stiffness, and applied loading conditions, can be fed into or changed at the terminal and may be displayed in three dimensions. All mechanism configurations can be cycled through their range of travel and viewed in their various geometric positions. Output data includes geometric positioning in orthogonal coordinates of each node point in the mechanism, velocity and acceleration of the node points, and internal loads and displacements of the node points and linkages. All analysis calculations take at most a few seconds to complete. Output data can be viewed at the scope and also printed at the discretion of the user.

Conformist-contrarian interactions and amplitude dependence in the Kuramoto model

NASA Astrophysics Data System (ADS)

Lohe, M. A.

2014-11-01

We derive exact formulas for the frequency of synchronized oscillations in Kuramoto models with conformist-contrarian interactions, and determine necessary conditions for synchronization to occur. Numerical computations show that for certain parameters repulsive nodes behave as conformists, and that in other cases attractive nodes can display frustration, being neither conformist nor contrarian. The signs of repulsive couplings can be placed equivalently outside the sum, as proposed in Hong and Strogatz (2011 Phys. Rev. Lett. 106 054102), or inside the sum as in Hong and Strogatz (2012 Phys. Rev. E 85 056210), but the two models have different characteristics for small magnitudes of the coupling constants. In the latter case we show that the distributed coupling constants can be viewed as oscillator amplitudes which are constant in time, with the property that oscillators of small amplitude couple only weakly to connected nodes. Such models provide a means of investigating the effect of amplitude variations on synchronization properties.

Development of esMOCA Biomechanic, Motion Capture Instrumentation for Biomechanics Analysis

NASA Astrophysics Data System (ADS)

Arendra, A.; Akhmad, S.

2018-01-01

This study aims to build motion capture instruments using inertial measurement unit sensors to assist in the analysis of biomechanics. Sensors used are accelerometer and gyroscope. Estimation of orientation sensors is done by digital motion processing in each sensor nodes. There are nine sensor nodes attached to the upper limbs. This sensor is connected to the pc via a wireless sensor network. The development of kinematics and inverse dynamamic models of the upper limb is done in simulink simmechanic. The kinematic model receives streaming data of sensor nodes mounted on the limbs. The output of the kinematic model is the pose of each limbs and visualized on display. The dynamic inverse model outputs the reaction force and reaction moment of each joint based on the limb motion input. Model validation in simulink with mathematical model of mechanical analysis showed results that did not differ significantly

An Intuitive Dashboard for Bayesian Network Inference

NASA Astrophysics Data System (ADS)

Reddy, Vikas; Charisse Farr, Anna; Wu, Paul; Mengersen, Kerrie; Yarlagadda, Prasad K. D. V.

2014-03-01

Current Bayesian network software packages provide good graphical interface for users who design and develop Bayesian networks for various applications. However, the intended end-users of these networks may not necessarily find such an interface appealing and at times it could be overwhelming, particularly when the number of nodes in the network is large. To circumvent this problem, this paper presents an intuitive dashboard, which provides an additional layer of abstraction, enabling the end-users to easily perform inferences over the Bayesian networks. Unlike most software packages, which display the nodes and arcs of the network, the developed tool organises the nodes based on the cause-and-effect relationship, making the user-interaction more intuitive and friendly. In addition to performing various types of inferences, the users can conveniently use the tool to verify the behaviour of the developed Bayesian network. The tool has been developed using QT and SMILE libraries in C++.

Lipid nanoparticle vectorization of indocyanine green improves fluorescence imaging for tumor diagnosis and lymph node resection.

PubMed

Navarro, Fabrice P; Berger, Michel; Guillermet, Stéphanie; Josserand, Véronique; Guyon, Laurent; Neumann, Emmanuelle; Vinet, Françoise; Texier, Isabelle

2012-10-01

Fluorescence imaging is opening a new era in image-guided surgery and other medical applications. The only FDA approved contrast agent in the near infrared is IndoCyanine Green (ICG), which despites its low toxicity, displays poor chemical and optical properties for long-term and sensitive imaging applications in human. Lipid nanoparticles are investigated for improving ICG optical properties and in vivo fluorescence imaging sensitivity. 30 nm diameter lipid nanoparticles (LNP) are loaded with ICG. Their characterization and use for tumor and lymph node imaging are described. Nano-formulation benefits dye optical properties (6 times improved brightness) and chemical stability (>6 months at 4 degrees C in aqueous buffer). More importantly, LNP vectorization allows never reported sensitive and prolonged (>1 day) labeling of tumors and lymph nodes. Composed of human-use approved ingredients, this novel ICG nanometric formulation is foreseen to expand rapidly the field of clinical fluorescence imaging applications.

Enhancing the Selection of Backoff Interval Using Fuzzy Logic over Wireless Ad Hoc Networks

PubMed Central

Ranganathan, Radha; Kannan, Kathiravan

2015-01-01

IEEE 802.11 is the de facto standard for medium access over wireless ad hoc network. The collision avoidance mechanism (i.e., random binary exponential backoff—BEB) of IEEE 802.11 DCF (distributed coordination function) is inefficient and unfair especially under heavy load. In the literature, many algorithms have been proposed to tune the contention window (CW) size. However, these algorithms make every node select its backoff interval between [0, CW] in a random and uniform manner. This randomness is incorporated to avoid collisions among the nodes. But this random backoff interval can change the optimal order and frequency of channel access among competing nodes which results in unfairness and increased delay. In this paper, we propose an algorithm that schedules the medium access in a fair and effective manner. This algorithm enhances IEEE 802.11 DCF with additional level of contention resolution that prioritizes the contending nodes according to its queue length and waiting time. Each node computes its unique backoff interval using fuzzy logic based on the input parameters collected from contending nodes through overhearing. We evaluate our algorithm against IEEE 802.11, GDCF (gentle distributed coordination function) protocols using ns-2.35 simulator and show that our algorithm achieves good performance. PMID:25879066

Greedy Gossip With Eavesdropping

NASA Astrophysics Data System (ADS)

Ustebay, Deniz; Oreshkin, Boris N.; Coates, Mark J.; Rabbat, Michael G.

2010-07-01

This paper presents greedy gossip with eavesdropping (GGE), a novel randomized gossip algorithm for distributed computation of the average consensus problem. In gossip algorithms, nodes in the network randomly communicate with their neighbors and exchange information iteratively. The algorithms are simple and decentralized, making them attractive for wireless network applications. In general, gossip algorithms are robust to unreliable wireless conditions and time varying network topologies. In this paper we introduce GGE and demonstrate that greedy updates lead to rapid convergence. We do not require nodes to have any location information. Instead, greedy updates are made possible by exploiting the broadcast nature of wireless communications. During the operation of GGE, when a node decides to gossip, instead of choosing one of its neighbors at random, it makes a greedy selection, choosing the node which has the value most different from its own. In order to make this selection, nodes need to know their neighbors' values. Therefore, we assume that all transmissions are wireless broadcasts and nodes keep track of their neighbors' values by eavesdropping on their communications. We show that the convergence of GGE is guaranteed for connected network topologies. We also study the rates of convergence and illustrate, through theoretical bounds and numerical simulations, that GGE consistently outperforms randomized gossip and performs comparably to geographic gossip on moderate-sized random geometric graph topologies.

Knowledge diffusion of dynamical network in terms of interaction frequency.

PubMed

Liu, Jian-Guo; Zhou, Qing; Guo, Qiang; Yang, Zhen-Hua; Xie, Fei; Han, Jing-Ti

2017-09-07

In this paper, we present a knowledge diffusion (SKD) model for dynamic networks by taking into account the interaction frequency which always used to measure the social closeness. A set of agents, which are initially interconnected to form a random network, either exchange knowledge with their neighbors or move toward a new location through an edge-rewiring procedure. The activity of knowledge exchange between agents is determined by a knowledge transfer rule that the target node would preferentially select one neighbor node to transfer knowledge with probability p according to their interaction frequency instead of the knowledge distance, otherwise, the target node would build a new link with its second-order neighbor preferentially or select one node in the system randomly with probability 1 - p. The simulation results show that, comparing with the Null model defined by the random selection mechanism and the traditional knowledge diffusion (TKD) model driven by knowledge distance, the knowledge would spread more fast based on SKD driven by interaction frequency. In particular, the network structure of SKD would evolve as an assortative one, which is a fundamental feature of social networks. This work would be helpful for deeply understanding the coevolution of the knowledge diffusion and network structure.

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.

Selection Strategies for Social Influence in the Threshold Model

NASA Astrophysics Data System (ADS)

Karampourniotis, Panagiotis; Szymanski, Boleslaw; Korniss, Gyorgy

The ubiquity of online social networks makes the study of social influence extremely significant for its applications to marketing, politics and security. Maximizing the spread of influence by strategically selecting nodes as initiators of a new opinion or trend is a challenging problem. We study the performance of various strategies for selection of large fractions of initiators on a classical social influence model, the Threshold model (TM). Under the TM, a node adopts a new opinion only when the fraction of its first neighbors possessing that opinion exceeds a pre-assigned threshold. The strategies we study are of two kinds: strategies based solely on the initial network structure (Degree-rank, Dominating Sets, PageRank etc.) and strategies that take into account the change of the states of the nodes during the evolution of the cascade, e.g. the greedy algorithm. We find that the performance of these strategies depends largely on both the network structure properties, e.g. the assortativity, and the distribution of the thresholds assigned to the nodes. We conclude that the optimal strategy needs to combine the network specifics and the model specific parameters to identify the most influential spreaders. Supported in part by ARL NS-CTA, ARO, and ONR.

Review of the role of sentinel node biopsy in cutaneous head and neck melanoma.

PubMed

Roy, Jennifer M; Whitfield, Robert J; Gill, P Grantley

2016-05-01

Sentinel node biopsy (SNB) is recommended for selected melanoma patients in many parts of the world. This review examines the evidence surrounding the accuracy and prognostic value of SNB and completion neck dissection in head and neck melanoma. Sentinel nodes were identified in an average of 94.7% of head and neck cases compared with 95.3-100% in all melanoma cases. More false-negative sentinel nodes were found in head and neck cases. A positive sentinel node was associated with both lower disease-free survival (53.4 versus 83.2%) and overall survival (40 versus 84%). We conclude that SNB should be offered to all patients with intermediate and high-risk melanomas in the head and neck area. To date, evidence does not exist to demonstrate the safety of avoiding completion lymph node dissection in sentinel node-positive patients with head and neck melanoma. © 2015 Royal Australasian College of Surgeons.

The history of sentinel node biopsy in head and neck cancer: From visualization of lymphatic vessels to sentinel nodes.

PubMed

de Bree, Remco; Nieweg, Omgo E

2015-09-01

The aim of this report is to describe the history of sentinel node biopsy in head and neck cancer. Sentinel node biopsy is a minimally invasive technique to select patients for treatment of metastatic lymph nodes in the neck. Although this procedure has only recently been accepted for early oral cancer, the first studies on visualization of the cervical lymphatic vessels were reported in the 1960s. In the 1980s mapping of lymphatic drainage from specific head and neck sites was introduced. Sentinel node biopsy was further developed in the 1990s and after validation in this century the procedure is routinely performed in early oral cancer in several head and neck centers. New techniques may improve the accuracy of sentinel node biopsy further, particularly in difficult subsites like the floor of mouth. Copyright © 2015 Elsevier Ltd. All rights reserved.

Collectively loading programs in a multiple program multiple data environment

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

Aho, Michael E.; Attinella, John E.; Gooding, Thomas M.

Techniques are disclosed for loading programs efficiently in a parallel computing system. In one embodiment, nodes of the parallel computing system receive a load description file which indicates, for each program of a multiple program multiple data (MPMD) job, nodes which are to load the program. The nodes determine, using collective operations, a total number of programs to load and a number of programs to load in parallel. The nodes further generate a class route for each program to be loaded in parallel, where the class route generated for a particular program includes only those nodes on which the programmore » needs to be loaded. For each class route, a node is selected using a collective operation to be a load leader which accesses a file system to load the program associated with a class route and broadcasts the program via the class route to other nodes which require the program.« less

Comparison of the current AJCC-TNM numeric-based with a new anatomical location-based lymph node staging system for gastric cancer: A western experience

PubMed Central

Auricchio, Annamaria; Cardella, Francesca; Mabilia, Andrea; Diana, Anna; Castellano, Paolo; De Vita, Ferdinando; Orditura, Michele

2017-01-01

Background In gastric cancer, the current AJCC numeric-based lymph node staging does not provide information on the anatomical extent of the disease and lymphadenectomy. A new anatomical location-based node staging, proposed by Choi, has shown better prognostic performance, thus soliciting Western world validation. Study design Data from 284 gastric cancers undergoing radical surgery at the Second University of Naples from 2000 to 2014 were reviewed. The lymph nodes were reclassified into three groups (lesser and greater curvature, and extraperigastric nodes); presence of any metastatic lymph node in a given group was considered positive, prompting a new N and TNM stage classification. Receiver-operating-characteristic (ROC) curves for censored survival data and bootstrap methods were used to compare the capability of the two models to predict tumor recurrence. Results More than one third of node positive patients were reclassified into different N and TNM stages by the new system. Compared to the current staging system, the new classification significantly correlated with tumor recurrence rates and displayed improved indices of prognostic performance, such as the Bayesian information criterion and the Harrell C-index. Higher values at survival ROC analysis demonstrated a significantly better stratification of patients by the new system, mostly in the early phase of the follow-up, with a worse prognosis in more advanced new N stages, despite the same current N stage. Conclusions This study suggests that the anatomical location-based classification of lymph node metastasis may be an important tool for gastric cancer prognosis and should be considered for future revision of the TNM staging system. PMID:28380037

Can Melan-A replace S-100 and HMB-45 in the evaluation of sentinel lymph nodes from patients with malignant melanoma?

PubMed

Kucher, Cynthia; Zhang, Paul J; Acs, Geza; Roberts, Shelley; Xu, Xiaowei

2006-09-01

The sentinel lymph node (SLN) biopsy has become an increasingly important procedure used in the primary staging of malignant melanoma. However, micrometastases in a lymph node can be easily missed on routine H&E-stained sections. Therefore, S-100 and HMB-45 IHC stains are standardly performed on grossly negative SLNs for detection of metastatic melanoma. Each of these IHC markers, however, is not ideal. The authors investigated whether the newer IHC marker Melan-A would improve the detection of metastatic melanoma in SLN biopsies. Forty lymph nodes previously diagnosed with metastatic melanoma were retrospectively evaluated for S-100, HMB-45, and Melan-A expression. In addition, 42 SLN biopsies for metastatic melanoma detection were prospectively collected and evaluated for S-100, HMB-45, and Melan-A expression. All lymph nodes with metastatic melanoma from the retrospective study demonstrated S-100 reactivity. Five of the lymph nodes with metastatic melanoma from the retrospective study failed to express either HMB-45 or Melan-A, all of which displayed a desmoplastic morphology. One of the metastases positive for S-100 and HMB-45 failed to show reactivity with Melan-A (3%). The prospective study found 10 lymph nodes from 42 cases to be positive for metastatic melanoma, which were positive for S-100 (100%). Nine of the involved lymph nodes were positive for HMB-45(90%), and nine were positive for Melan-A (90%). Melan-A, although very specific, cannot replace the use of S-100 and HMB-45 for the detection of metastatic melanoma in SLNs. It can, however, substitute for HMB-45 with equally good results.

[Correlation factors of lymph node metastasis in patients with clinical stage T1a non-small cell lung cancer].

PubMed

Ruochuan, Zang; Shugeng, Guo; Jie, He; Yousheng, Mao; Qi, Xue; Dali, Wang; Juwei, Mu; Jun, Zhao; Yonggang, Wang; Xiangyang, Liu; Fengwei, Tan; Gefei, Zhao; Qian, Zhang; Moyan, Zhang; Peng, Song

2015-04-01

To explore the relationship between the lymph node metastasis and clinicopathological features in patients with clinical stage T1a non-small cell lung cancer (NSCLC). Clinicopathological data of a total of 418 patients who underwent lobectomy and systematic lymph node dissection were retrospectively analyzed. Logistic regression was used to analyze the relationship between lymph node metastasis and clinicopathological features. Lymph node metastasis was observed in 25 patients. There were 122 patients who were diagnosed as ground glass opacity with no lymph node metastasis. 399 patients had subcarinal dissection, among them 7 patients were found to have lymph node metastasis. Univariate analysis showed that gender, smoking history, diameter of lymph node, ground glass opacity (GGO), differentiation of the tumor and tumor site were the factors affecting lymph node metastasis (all P < 0.05). Logistic regression analysis showed that diameter of lymph node, differentiation of the tumor and the site of lesion were independent risk factors for lymph node metastasis of NSCLC. Tumor in the left lung, poor differentiation, and diameter of lymph nodes ≥ 1 cm on the preoperative CT image are independent risk factors for lymph node metastasis of NSCLC, hence we should pay attention before surgery and systematic lymph node dissection should be done. For patients with poor differentiation and lymph nodes ≥ 1 cm, subcarinal lymph nodes dissection is recommended for the sake of higher possibility of lymph node metastasis. For patients with ground glass opacity ≤ 2 cm, the lymph node metastasis is extremely rare, therefore, selective lymph node dissection is reconmmended.

BrainNet Viewer: a network visualization tool for human brain connectomics.

PubMed

Xia, Mingrui; Wang, Jinhui; He, Yong

2013-01-01

The human brain is a complex system whose topological organization can be represented using connectomics. Recent studies have shown that human connectomes can be constructed using various neuroimaging technologies and further characterized using sophisticated analytic strategies, such as graph theory. These methods reveal the intriguing topological architectures of human brain networks in healthy populations and explore the changes throughout normal development and aging and under various pathological conditions. However, given the huge complexity of this methodology, toolboxes for graph-based network visualization are still lacking. Here, using MATLAB with a graphical user interface (GUI), we developed a graph-theoretical network visualization toolbox, called BrainNet Viewer, to illustrate human connectomes as ball-and-stick models. Within this toolbox, several combinations of defined files with connectome information can be loaded to display different combinations of brain surface, nodes and edges. In addition, display properties, such as the color and size of network elements or the layout of the figure, can be adjusted within a comprehensive but easy-to-use settings panel. Moreover, BrainNet Viewer draws the brain surface, nodes and edges in sequence and displays brain networks in multiple views, as required by the user. The figure can be manipulated with certain interaction functions to display more detailed information. Furthermore, the figures can be exported as commonly used image file formats or demonstration video for further use. BrainNet Viewer helps researchers to visualize brain networks in an easy, flexible and quick manner, and this software is freely available on the NITRC website (www.nitrc.org/projects/bnv/).

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.

Design of Deformation Monitoring System for Volcano Mitigation

NASA Astrophysics Data System (ADS)

Islamy, M. R. F.; Salam, R. A.; Munir, M. M.; Irsyam, M.; Khairurrijal

2016-08-01

Indonesia has many active volcanoes that are potentially disastrous. It needs good mitigation systems to prevent victims and to reduce casualties from potential disaster caused by volcanoes eruption. Therefore, the system to monitor the deformation of volcano was built. This system employed telemetry with the combination of Radio Frequency (RF) communications of XBEE and General Packet Radio Service (GPRS) communication of SIM900. There are two types of modules in this system, first is the coordinator as a parent and second is the node as a child. Each node was connected to coordinator forming a Wireless Sensor Network (WSN) with a star topology and it has an inclinometer based sensor, a Global Positioning System (GPS), and an XBEE module. The coordinator collects data to each node, one a time, to prevent collision data between nodes, save data to SD Card and transmit data to web server via GPRS. Inclinometer was calibrated with self-built in calibrator and tested in high temperature environment to check the durability. The GPS was tested by displaying its position in web server via Google Map Application Protocol Interface (API v.3). It was shown that the coordinator can receive and transmit data from every node to web server very well and the system works well in a high temperature environment.

Parotid gland sparing in patients undergoing bilateral head and neck irradiation: techniques and early results.

PubMed

Eisbruch, A; Ship, J A; Martel, M K; Ten Haken, R K; Marsh, L H; Wolf, G T; Esclamado, R M; Bradford, C R; Terrell, J E; Gebarski, S S; Lichter, A S

1996-09-01

To minimize xerostomia in patients receiving bilateral head and neck irradiation (RT) by using conformal RT planning to spare a significant volume of one parotid gland from radiation. The study involved 15 patients with head and neck tumors in whom bilateral neck radiation was indicated. The major salivary glands and the targets (tumor, surgical bed, metastases to lymph nodes, and the locations of lymph nodes at risk for metastases) were outlined on axial computed tomography images. Beam's-eye view (BEV) displays were used to construct conformal beams that delivered the prescribed doses to the targets while sparing from direct radiation most of one parotid gland. The gland that was planned to be spared resided in the neck side that was judged in each patient to be at a lesser risk of metastatic disease. Major salivary gland flow rates and the responses to a subjective xerostomia questionnaire were assessed before, during, and after radiation. Radiation planning for patients with central oropharyngeal tumors required the generation of multiple axial nonopposed beams. The resulting isodoses encompassed the targets, including the retropharyngeal nodes and the jugular nodes up to the base of skull bilaterally, while limiting the dose to the oral cavity, spinal cord, and one parotid gland. For patients with lateralized tumors, the ipsilateral neck side was treated up to the base of the skull; in the contralateral neck side, the treatment included the subdigastric nodes but excluded the jugular nodes at the base of the skull and most of the parotid gland. This was accomplished by a moderate gantry angle that was chosen using the BEV displays. Three months following the completion of radiation, the spared parotid glands retained on average 50% of their unstimulated and stimulated flows. In contrast, no saliva flow was measured from the unspared glands in any of the patients. Subjective xerostomia was absent, mild, or not different from that reported before radiation in 10 of 15 patients (67%). Partial parotid gland sparing is feasible by using three-dimensional planning in patients undergoing bilateral head and neck radiation. Approximately 50% of the saliva flow from the spared glands may be retained, and most patients thus treated have no or mild xerostomia in the early period after the completion of radiation. Whether tumor control and late complications are comparable to standard radiation will be assessed as more experience is gained.

Expression of proliferation marker Ki67 correlates to occurrence of metastasis and prognosis, histological subtypes and HPV DNA detection in penile carcinomas.

PubMed

Protzel, C; Knoedel, J; Zimmermann, U; Woenckhaus, C; Poetsch, M; Giebel, J

2007-11-01

Clinical outcome of penile squamous cell carcinoma (PSCC) largely depends on the presence of lymph node metastasis. In search of a valuable marker predicting the risk for metastasis, the expression of Ki67 was investigated immunohistochemically in primary tumors and compared to presence of inguinal lymph node metastasis. As human papilloma virus (HPV) is thought to affect Ki67 expression, we evaluated whether occurrence of HPV DNA correlates to Ki67 score or metastatic potential. Samples originated from patients subjected to resection of invasive SCC of penis. Immunohistochemistry was done on paraffin-embedded sections using a monoclonal antibody against Ki67. After DNA isolation from paraffin embedded tissue the presence of HPV 6/11, HPV 16 and HPV 18 DNA was analyzed by PCR. Statistical analysis was done using two tail unpaired t test and Chi-square test. Four of 28 patients showed a weak Ki67 expression, without displaying lymph node metastasis. Among 17 patients showing an intermediate Ki67 index, eight exhibited metastases while in all seven patients with a strong expression of Ki67 lymph node metastases were found. The median Ki67 expression in metastastic lesions was significantly different (50.3%) from tumors without lymph node metastasis (31.8%) (p=0.024). Furthermore, a correlation between presence of HPV DNA and strong Ki67 expression was determined (p=0.009). Since our study demonstrated a strong Ki67 labeling index significantly associated to positive lymph nodes, we suggest Ki67 expression as a prognostic marker for lymph node metastasis in penile squamous carcinoma.

Clinical utility of routine pre-operative axillary ultrasound and fine needle aspiration cytology in patient selection for sentinel lymph node biopsy.

PubMed

Rattay, T; Muttalib, M; Khalifa, E; Duncan, A; Parker, S J

2012-04-01

In patients with operable breast cancer, pre-operative evaluation of the axilla may be of use in the selection of appropriate axillary surgery. Pre-operative axillary ultrasound (US) and fine needle aspiration cytology (FNAC) assessments have become routine practice in many breast units, although the evidence base is still gathering. This study assessed the clinical utility of US+/-FNAC in patient selection for either axillary node clearance (ANC) or sentinel lymph node biopsy (SLNB) in patients undergoing surgery for operable breast cancer. Over a two-year period, 348 patients with a clinically negative axilla underwent axillary US. 67 patients with suspicious nodes on US also underwent FNAC. The sensitivity and specificity of axillary investigations to determine nodal involvement were 56% (confidence interval: 47-64%) and 90% (84-93%) for US alone, and 76% (61-87%) and 100% (65-100%) for FNAC combined with US, respectively. With a positive US, the post-test probability was 78%. A negative US carried a post-test probability of 25%. When FNAC was positive, the post-test probability was greater than unity. A negative FNAC yielded a post-test probability of 52%. All patients with positive FNAC and most patients with suspicious US were listed for axillary node clearance (ANC) after consideration at the multi-disciplinary team (MDT) meeting. With pre-operative axillary US+/-FNAC, 20% of patients were saved a potential second axillary procedure, facilitating a reduction in the overall re-operation rate to 12%. In this study, a positive pre-operative US+/-FNAC directs patients towards ANC. When the result is negative, other clinico-pathological factors need to be taken into account in the selection of the appropriate axillary procedure. Copyright © 2011 Elsevier Ltd. All rights reserved.

A new clustering strategy

NASA Astrophysics Data System (ADS)

Feng, Jian-xin; Tang, Jia-fu; Wang, Guang-xing

2007-04-01

On the basis of the analysis of clustering algorithm that had been proposed for MANET, a novel clustering strategy was proposed in this paper. With the trust defined by statistical hypothesis in probability theory and the cluster head selected by node trust and node mobility, this strategy can realize the function of the malicious nodes detection which was neglected by other clustering algorithms and overcome the deficiency of being incapable of implementing the relative mobility metric of corresponding nodes in the MOBIC algorithm caused by the fact that the receiving power of two consecutive HELLO packet cannot be measured. It's an effective solution to cluster MANET securely.

Genetic control of phyllotaxy phase shift in juvenile vines in a rootstock hybrid population

USDA-ARS?s Scientific Manuscript database

Grapevine seedlings initially display spiral phyllotaxy of true leaves, then undergo a shift to alternate phyllotaxy with the production of the first lateral meristems (typically tendrils). The node at which the shift from spiral to alternate phyllotaxy occurs varies from about the 4th to about the...

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.

Energy Efficient and Stable Weight Based Clustering for Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Bouk, Safdar H.; Sasase, Iwao

Recently several weighted clustering algorithms have been proposed, however, to the best of our knowledge; there is none that propagates weights to other nodes without weight message for leader election, normalizes node parameters and considers neighboring node parameters to calculate node weights. In this paper, we propose an Energy Efficient and Stable Weight Based Clustering (EE-SWBC) algorithm that elects cluster heads without sending any additional weight message. It propagates node parameters to its neighbors through neighbor discovery message (HELLO Message) and stores these parameters in neighborhood list. Each node normalizes parameters and efficiently calculates its own weight and the weights of neighboring nodes from that neighborhood table using Grey Decision Method (GDM). GDM finds the ideal solution (best node parameters in neighborhood list) and calculates node weights in comparison to the ideal solution. The node(s) with maximum weight (parameters closer to the ideal solution) are elected as cluster heads. In result, EE-SWBC fairly selects potential nodes with parameters closer to ideal solution with less overhead. Different performance metrics of EE-SWBC and Distributed Weighted Clustering Algorithm (DWCA) are compared through simulations. The simulation results show that EE-SWBC maintains fewer average numbers of stable clusters with minimum overhead, less energy consumption and fewer changes in cluster structure within network compared to DWCA.

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

Lymphoscintigraphy Can Select Breast Cancer Patients for Internal Mammary Chain Radiotherapy

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

Hindie, Elif, E-mail: elif.hindie@sls.aphp.fr; Department of Nuclear Medicine, CHU de Bordeaux, University of Bordeaux-Segalen, Bordeaux; Groheux, David

2012-07-15

Purpose: Given the risk of undesired toxicity, prophylactic internal mammary (IM) chain irradiation should be offered only to patients at high risk of occult involvement. Lymphoscintigraphy for axillary sentinel node biopsy might help in selecting these patients. Methods and Materials: We reviewed published studies with the following selection criteria: {>=}300 breast cancer patients referred for axilla sentinel node biopsy; scintigraphy performed after peritumoral or intratumoral tracer injection; IM biopsy in the case of IM drainage; and axilla staged routinely independent of IM status. Results: Six prospective studies, for a total of 3,876 patients, fulfilled the inclusion criteria. Parasternal drainage wasmore » present in 792 patients (20.4%). IM biopsy was performed in 644 patients and was positive in 111 (17.2%). Of the positive IM biopsies, 40% were associated with tumors in the lateral breast quadrants. A major difference in the IM positivity rate was found according to the axilla sentinel node status. In patients with negative axilla, the IM biopsy was positive in 7.8% of cases. In patients with positive axilla, however, the IM biopsy was positive in 41% (p < .00001). Because biopsy of multiple IM hot nodes is difficult, the true risk could be even greater, probably close to 50%. Conclusions: Patients with IM drainage on lymphoscintigraphy and a positive axilla sentinel node have a high risk of occult IM involvement. These women should be considered for IM radiotherapy.« less

[Changes of heart electrophysiological parameters after destruction of epicardial subplexuses that innervate sinoatrial node].

PubMed

Kulboka, Arūnas; Veikutis, Vincentas; Pauza, Dainius Haroldas; Lekas, Raimundas

2003-01-01

The aims of present study were to verify the topography of the intracardiac nerve subplexuses (INS) by using electrophysiological methods, its relations with sinoatrial (SA) node function and to investigate possibility of selective surgical SA node denervation. Fifteen mongrel dogs of either sex weighing 8 to 15 kg were used for electrophysiological studies. Both cervical vagosympathetic trunks were isolated and crushed by tight ligatures. Nervus subplexuses destructions were performed by cryocoagulation in three zones located around the right superior vena cava: ventral, lateral and dorsal. The sinus rhythm, SA node function recovery time, AV node conductivity, AV node and atrial effective refractory period were measured. Five experiments in each of three zones were performed. Experimental data show that destruction of the epicardial nerves has different effect on electrophysiological parameters. After destruction of the anterior zone of the right atrium the sinus rhythm decreased on an average by 11.6%; SA node function recovery time prolonged by 7.2%; AV node conductivity decreased by 13.1%; AV node effective refractory period prolonged by 12.9% and atrial effective refractory period, by 10.9 %. Measurements of electrophysiological parameters after intravenous injection of atropine sulphate show that sinus rhythm decreased on an average by 23.4%; SA node function recovery time increased by 9.1%; the conductivity of AV node decreased by 10.2%; AV node effective refractory period prolonged by 15.4% and atrial effective refractory period, by 13.2%. After destruction of the intracardiac nerves of the lateral zone, the sinus rhythm decreased by 15.7%; SA node function recovery time increased by 16.3%; AV node conductivity decreased by 8.3%; AV node effective refractory period and atrial effective refractory period prolonged by 11.9% and 10.0%, respectively. After the atropine sulphate intravenous injection, the sinus rhythm decreased on an average by 7.1%, SA node function recovery time prolonged by 7.1%, AV conductivity decreased by 9.1%, AV node effective refractory period increased by 12.4%, and atrial effective refractory period prolonged by 12.5%. After destruction of the nerves in the dorsal zone the changes of electrophysiological parameters were opposite to those obtained after destruction of the nerve tracts in the anterior or lateral zones: the sinus rhythm increased on an average by 4.3%; SA node function recovery time shortened by 8.8%; AV conductivity increased by 9.7%; AV node and atrial effective refractory period decreased by 12.3% and 12.1%, respectively. After intravenous atropine sulphate infusion, sinus rhythm decreased on an average by 8.3%; SA node function recovery time prolonged by 9.6%; AV node conductivity decreased by 5%; AV node and atrial effective refractory period prolonged by 4.2% and 5.2%, respectively. The average changes of electrophysiological parameters before and after INS destruction shows that cryocoagulation of ventral and lateral zones eliminates the effects of sympathetic tone to SA and AV nodal activity. Cryocoagulation of dorsal zone eliminates the effects of nervus vagus to both nodal structures. These findings shows the possibility alter or correct SA node function by making selective surgical SA node denervation.

Massively parallel processor networks with optical express channels

DOEpatents

Deri, R.J.; Brooks, E.D. III; Haigh, R.E.; DeGroot, A.J.

1999-08-24

An optical method for separating and routing local and express channel data comprises interconnecting the nodes in a network with fiber optic cables. A single fiber optic cable carries both express channel traffic and local channel traffic, e.g., in a massively parallel processor (MPP) network. Express channel traffic is placed on, or filtered from, the fiber optic cable at a light frequency or a color different from that of the local channel traffic. The express channel traffic is thus placed on a light carrier that skips over the local intermediate nodes one-by-one by reflecting off of selective mirrors placed at each local node. The local-channel-traffic light carriers pass through the selective mirrors and are not reflected. A single fiber optic cable can thus be threaded throughout a three-dimensional matrix of nodes with the x,y,z directions of propagation encoded by the color of the respective light carriers for both local and express channel traffic. Thus frequency division multiple access is used to hierarchically separate the local and express channels to eliminate the bucket brigade latencies that would otherwise result if the express traffic had to hop between every local node to reach its ultimate destination. 3 figs.

Massively parallel processor networks with optical express channels

DOEpatents

Deri, Robert J.; Brooks, III, Eugene D.; Haigh, Ronald E.; DeGroot, Anthony J.

1999-01-01

An optical method for separating and routing local and express channel data comprises interconnecting the nodes in a network with fiber optic cables. A single fiber optic cable carries both express channel traffic and local channel traffic, e.g., in a massively parallel processor (MPP) network. Express channel traffic is placed on, or filtered from, the fiber optic cable at a light frequency or a color different from that of the local channel traffic. The express channel traffic is thus placed on a light carrier that skips over the local intermediate nodes one-by-one by reflecting off of selective mirrors placed at each local node. The local-channel-traffic light carriers pass through the selective mirrors and are not reflected. A single fiber optic cable can thus be threaded throughout a three-dimensional matrix of nodes with the x,y,z directions of propagation encoded by the color of the respective light carriers for both local and express channel traffic. Thus frequency division multiple access is used to hierarchically separate the local and express channels to eliminate the bucket brigade latencies that would otherwise result if the express traffic had to hop between every local node to reach its ultimate destination.

Synchronous Firefly Algorithm for Cluster Head Selection in WSN

PubMed Central

Baskaran, Madhusudhanan; Sadagopan, Chitra

2015-01-01

Wireless Sensor Network (WSN) consists of small low-cost, low-power multifunctional nodes interconnected to efficiently aggregate and transmit data to sink. Cluster-based approaches use some nodes as Cluster Heads (CHs) and organize WSNs efficiently for aggregation of data and energy saving. A CH conveys information gathered by cluster nodes and aggregates/compresses data before transmitting it to a sink. However, this additional responsibility of the node results in a higher energy drain leading to uneven network degradation. Low Energy Adaptive Clustering Hierarchy (LEACH) offsets this by probabilistically rotating cluster heads role among nodes with energy above a set threshold. CH selection in WSN is NP-Hard as optimal data aggregation with efficient energy savings cannot be solved in polynomial time. In this work, a modified firefly heuristic, synchronous firefly algorithm, is proposed to improve the network performance. Extensive simulation shows the proposed technique to perform well compared to LEACH and energy-efficient hierarchical clustering. Simulations show the effectiveness of the proposed method in decreasing the packet loss ratio by an average of 9.63% and improving the energy efficiency of the network when compared to LEACH and EEHC. PMID:26495431

A General Self-Organized Tree-Based Energy-Balance Routing Protocol for Wireless Sensor Network

NASA Astrophysics Data System (ADS)

Han, Zhao; Wu, Jie; Zhang, Jie; Liu, Liefeng; Tian, Kaiyun

2014-04-01

Wireless sensor network (WSN) is a system composed of a large number of low-cost micro-sensors. This network is used to collect and send various kinds of messages to a base station (BS). WSN consists of low-cost nodes with limited battery power, and the battery replacement is not easy for WSN with thousands of physically embedded nodes, which means energy efficient routing protocol should be employed to offer a long-life work time. To achieve the aim, we need not only to minimize total energy consumption but also to balance WSN load. Researchers have proposed many protocols such as LEACH, HEED, PEGASIS, TBC and PEDAP. In this paper, we propose a General Self-Organized Tree-Based Energy-Balance routing protocol (GSTEB) which builds a routing tree using a process where, for each round, BS assigns a root node and broadcasts this selection to all sensor nodes. Subsequently, each node selects its parent by considering only itself and its neighbors' information, thus making GSTEB a dynamic protocol. Simulation results show that GSTEB has a better performance than other protocols in balancing energy consumption, thus prolonging the lifetime of WSN.

Most Undirected Random Graphs Are Amplifiers of Selection for Birth-Death Dynamics, but Suppressors of Selection for Death-Birth Dynamics.

PubMed

Hindersin, Laura; Traulsen, Arne

2015-11-01

We analyze evolutionary dynamics on graphs, where the nodes represent individuals of a population. The links of a node describe which other individuals can be displaced by the offspring of the individual on that node. Amplifiers of selection are graphs for which the fixation probability is increased for advantageous mutants and decreased for disadvantageous mutants. A few examples of such amplifiers have been developed, but so far it is unclear how many such structures exist and how to construct them. Here, we show that almost any undirected random graph is an amplifier of selection for Birth-death updating, where an individual is selected to reproduce with probability proportional to its fitness and one of its neighbors is replaced by that offspring at random. If we instead focus on death-Birth updating, in which a random individual is removed and its neighbors compete for the empty spot, then the same ensemble of graphs consists of almost only suppressors of selection for which the fixation probability is decreased for advantageous mutants and increased for disadvantageous mutants. Thus, the impact of population structure on evolutionary dynamics is a subtle issue that will depend on seemingly minor details of the underlying evolutionary process.

Sentinel Lymph Nodes for Breast Carcinoma: A Paradigm Shift.

PubMed

Maguire, Aoife; Brogi, Edi

2016-08-01

-Sentinel lymph node biopsy has been established as the new standard of care for axillary staging in most patients with invasive breast carcinoma. Historically, all patients with a positive sentinel lymph node biopsy result underwent axillary lymph node dissection. Recent trials show that axillary lymph node dissection can be safely omitted in women with clinically node negative, T1 or T2 invasive breast cancer treated with breast-conserving surgery and whole-breast radiotherapy. This change in practice also has implications on the pathologic examination and reporting of sentinel lymph nodes. -To review recent clinical and pathologic studies of sentinel lymph nodes and explore how these findings influence the pathologic evaluation of sentinel lymph nodes. -Sources were published articles from peer-reviewed journals in PubMed (US National Library of Medicine) and published guidelines from the American Joint Committee on Cancer, the Union for International Cancer Control, the American Society of Clinical Oncology, and the National Comprehensive Cancer Network. -The main goal of sentinel lymph node examination should be to detect all macrometastases (>2 mm). Grossly sectioning sentinel lymph nodes at 2-mm intervals and evaluation of one hematoxylin-eosin-stained section from each block is the preferred method of pathologic evaluation. Axillary lymph node dissection can be safely omitted in clinically node-negative patients with negative sentinel lymph nodes, as well as in a selected group of patients with limited sentinel lymph node involvement. The pathologic features of the primary carcinoma and its sentinel lymph node metastases contribute to estimate the extent of non-sentinel lymph node involvement. This information is important to decide on further axillary treatment.

Beyond Helper Phage: Using "Helper Cells" to Select Peptide Affinity Ligands.

PubMed

Phipps, M Lisa; Lillo, Antoinetta M; Shou, Yulin; Schmidt, Emily N; Paavola, Chad D; Naranjo, Leslie; Bemdich, Sara; Swanson, Basil I; Bradbury, Andrew R M; Martinez, Jennifer S

2016-01-01

Peptides are important affinity ligands for microscopy, biosensing, and targeted delivery. However, because they can have low affinity for their targets, their selection from large naïve libraries can be challenging. When selecting peptidic ligands from display libraries, it is important to: 1) ensure efficient display; 2) maximize the ability to select high affinity ligands; and 3) minimize the effect of the display context on binding. The "helper cell" packaging system has been described as a tool to produce filamentous phage particles based on phagemid constructs with varying display levels, while remaining free of helper phage contamination. Here we report on the first use of this system for peptide display, including the systematic characterization and optimization of helper cells, their inefficient use in antibody display and their use in creating and selecting from a set of phage display peptide libraries. Our libraries were analyzed with unprecedented precision by standard or deep sequencing, and shown to be superior in quality than commercial gold standards. Using our helper cell libraries, we have obtained ligands recognizing Yersinia pestis surface antigen F1V and L-glutamine-binding periplasmic protein QBP. In the latter case, unlike any of the peptide library selections described so far, we used a combination of phage and yeast display to select intriguing peptide ligands. Based on the success of our selections we believe that peptide libraries obtained with helper cells are not only suitable, but preferable to traditional phage display libraries for selection of peptidic ligands.

Pilot-Configurable Information on a Display Unit

NASA Technical Reports Server (NTRS)

Bell, Charles Frederick (Inventor); Ametsitsi, Julian (Inventor); Che, Tan Nhat (Inventor); Shafaat, Syed Tahir (Inventor)

2017-01-01

A small thin display unit that can be installed in the flight deck for displaying only flight crew-selected tactical information needed for the task at hand. The flight crew can select the tactical information to be displayed by means of any conventional user interface. Whenever the flight crew selects tactical information for processes the request, including periodically retrieving measured current values or computing current values for the requested tactical parameters and returning those current tactical parameter values to the display unit for display.

Role of sentinel lymph node biopsy in oral cancer.

PubMed

Calabrese, L; Bruschini, R; Ansarin, M; Giugliano, G; De Cicco, C; Ionna, F; Paganelli, G; Maffini, F; Werner, J A; Soutar, D

2006-12-01

Squamous cell carcinoma of the oral cavity represents about 2% of all malignant neoplasms and 47% of those developing in the head and neck area. The tongue is the most common site involved, and this incidence is increasing mainly in young people, possibly related to human papilloma virus infections. Prognosis depends on the stage: the 5-year survival rate of tongue squamous cell carcinoma, whatever the T stage, is 73% in pN0 cases, 40% in patients with positive nodes without extracapsular spread (pNl ECS-), and 29% when nodes are metastatic with extracapsular spread (pNl ECS+: p > or = 0.0001). Nodal micrometastases (cN0 pN1) are found in up to 50% of cN0 tongue squamous cell carcinoma patients operated on the neck. At present, no clinical, imaging staging modalities or biological markers are available to diagnose nodal micrometastases. The sentinel node biopsy has been tested since 1996 in order to find a solution to this problem. The sentinel node is the first node reached by the lymphatic stream, assuming an orderly and sequential drainage from the tumour site, and should be predictive of the nodal stage. According to the literature, sentinel node biopsy is a reliable technique in selected cN0 cases, but the procedure is still experimental and should not be performed outside validation trials. Successful application of sentinel node biopsy in the head and neck region requires surgical experience and specific technical devices, including pre-operative lymphoscintigraphy and intra-operative gamma-probe. Moreover, dynamic lymphoscintigraphy seems to be able to show the lymphatic stream from the primary tumour and could allow a selective neck dissection to be tailored thus reducing the related morbidity.

Predicting axillary lymph node metastasis from kinetic statistics of DCE-MRI breast images

NASA Astrophysics Data System (ADS)

Ashraf, Ahmed B.; Lin, Lilie; Gavenonis, Sara C.; Mies, Carolyn; Xanthopoulos, Eric; Kontos, Despina

2012-03-01

The presence of axillary lymph node metastases is the most important prognostic factor in breast cancer and can influence the selection of adjuvant therapy, both chemotherapy and radiotherapy. In this work we present a set of kinetic statistics derived from DCE-MRI for predicting axillary node status. Breast DCE-MRI images from 69 women with known nodal status were analyzed retrospectively under HIPAA and IRB approval. Axillary lymph nodes were positive in 12 patients while 57 patients had no axillary lymph node involvement. Kinetic curves for each pixel were computed and a pixel-wise map of time-to-peak (TTP) was obtained. Pixels were first partitioned according to the similarity of their kinetic behavior, based on TTP values. For every kinetic curve, the following pixel-wise features were computed: peak enhancement (PE), wash-in-slope (WIS), wash-out-slope (WOS). Partition-wise statistics for every feature map were calculated, resulting in a total of 21 kinetic statistic features. ANOVA analysis was done to select features that differ significantly between node positive and node negative women. Using the computed kinetic statistic features a leave-one-out SVM classifier was learned that performs with AUC=0.77 under the ROC curve, outperforming the conventional kinetic measures, including maximum peak enhancement (MPE) and signal enhancement ratio (SER), (AUCs of 0.61 and 0.57 respectively). These findings suggest that our DCE-MRI kinetic statistic features can be used to improve the prediction of axillary node status in breast cancer patients. Such features could ultimately be used as imaging biomarkers to guide personalized treatment choices for women diagnosed with breast cancer.

PHACK: An Efficient Scheme for Selective Forwarding Attack Detection in WSNs.

PubMed

Liu, Anfeng; Dong, Mianxiong; Ota, Kaoru; Long, Jun

2015-12-09

In this paper, a Per-Hop Acknowledgement (PHACK)-based scheme is proposed for each packet transmission to detect selective forwarding attacks. In our scheme, the sink and each node along the forwarding path generate an acknowledgement (ACK) message for each received packet to confirm the normal packet transmission. The scheme, in which each ACK is returned to the source node along a different routing path, can significantly increase the resilience against attacks because it prevents an attacker from compromising nodes in the return routing path, which can otherwise interrupt the return of nodes' ACK packets. For this case, the PHACK scheme also has better potential to detect abnormal packet loss and identify suspect nodes as well as better resilience against attacks. Another pivotal issue is the network lifetime of the PHACK scheme, as it generates more acknowledgements than previous ACK-based schemes. We demonstrate that the network lifetime of the PHACK scheme is not lower than that of other ACK-based schemes because the scheme just increases the energy consumption in non-hotspot areas and does not increase the energy consumption in hotspot areas. Moreover, the PHACK scheme greatly simplifies the protocol and is easy to implement. Both theoretical and simulation results are given to demonstrate the effectiveness of the proposed scheme in terms of high detection probability and the ability to identify suspect nodes.

Mimotope-Based Vaccines of Leishmania infantum Antigens and Their Protective Efficacy against Visceral Leishmaniasis

PubMed Central

Costa, Lourena Emanuele; Goulart, Luiz Ricardo; Pereira, Nathália Cristina de Jesus; Lima, Mayara Ingrid Sousa; Duarte, Mariana Costa; Martins, Vivian Tamietti; Lage, Paula Sousa; Menezes-Souza, Daniel; Ribeiro, Tatiana Gomes; Melo, Maria Norma; Fernandes, Ana Paula; Soto, Manuel; Tavares, Carlos Alberto Pereira; Chávez-Fumagalli, Miguel Angel; Coelho, Eduardo Antonio Ferraz

2014-01-01

Background The development of cost-effective prophylactic strategies to prevent leishmaniasis has become a high-priority. The present study has used the phage display technology to identify new immunogens, which were evaluated as vaccines in the murine model of visceral leishmaniasis (VL). Epitope-based immunogens, represented by phage-fused peptides that mimic Leishmania infantum antigens, were selected according to their affinity to antibodies from asymptomatic and symptomatic VL dogs' sera. Methodology/Main Findings Twenty phage clones were selected after three selection cycles, and were evaluated by means of in vitro assays of the immune stimulation of spleen cells derived from naive and chronically infected with L. infantum BALB/c mice. Clones that were able to induce specific Th1 immune response, represented by high levels of IFN-γ and low levels of IL-4 were selected, and based on their selectivity and specificity, two clones, namely B10 and C01, were further employed in the vaccination protocols. BALB/c mice vaccinated with clones plus saponin showed both a high and specific production of IFN-γ, IL-12, and GM-CSF after in vitro stimulation with individual clones or L. infantum extracts. Additionally, these animals, when compared to control groups (saline, saponin, wild-type phage plus saponin, or non-relevant phage clone plus saponin), showed significant reductions in the parasite burden in the liver, spleen, bone marrow, and paws' draining lymph nodes. Protection was associated with an IL-12-dependent production of IFN-γ, mainly by CD8+ T cells, against parasite proteins. These animals also presented decreased parasite-mediated IL-4 and IL-10 responses, and increased levels of parasite-specific IgG2a antibodies. Conclusions/Significance This study describes two phage clones that mimic L. infantum antigens, which were directly used as immunogens in vaccines and presented Th1-type immune responses, and that significantly reduced the parasite burden. This is the first study that describes phage-displayed peptides as successful immunogens in vaccine formulations against VL. PMID:25333662

Extent of surgery for papillary thyroid cancer: preoperative imaging and role of prophylactic and therapeutic neck dissection.

PubMed

Cisco, Robin M; Shen, Wen T; Gosnell, Jessica E

2012-03-01

Papillary thyroid cancer (PTC) has an excellent prognosis, yet lymph node metastases are common. Most authors agree that central and/or lateral lymph node dissection should be undertaken in patients with abnormal lymph nodes detected on ultrasound, physical examination or intraoperative inspection. However the appropriate extent of prophylactic lymph node dissection for clinically node-negative patients remains the subject of controversy. There have been no randomized trials to date to offer guidance on this issue. The 2006 guidelines of the American Thyroid Association recommended consideration of prophylactic bilateral central lymph node dissection (CLND) for all patients undergoing thyroidectomy for PTC. However, the absence of compelling evidence for a benefit in terms of recurrence or survival, and the potential for increased morbidity, have led many, including our institution, to take an approach of selective central lymph node dissection. This approach is guided by the detection of abnormal lymph nodes on preoperative ultrasound, on physical examination, or during surgery. Postoperatively, ultrasound by an experienced ultrasonographer is the mainstay of evaluation for lymph node recurrence and is combined with monitoring of thyroglobulin and antithyroglobulin antibody levels. Reoperative lymph node dissection is typically undertaken upon detection and fine needle aspiration (FNA) of involved lymph nodes 0.8 cm or greater in size.

A Real-Time Monitoring System of Industry Carbon Monoxide Based on Wireless Sensor Networks.

PubMed

Yang, Jiachen; Zhou, Jianxiong; Lv, Zhihan; Wei, Wei; Song, Houbing

2015-11-20

Carbon monoxide (CO) burns or explodes at over-standard concentration. Hence, in this paper, a Wifi-based, real-time monitoring of a CO system is proposed for application in the construction industry, in which a sensor measuring node is designed by low-frequency modulation method to acquire CO concentration reliably, and a digital filtering method is adopted for noise filtering. According to the triangulation, the Wifi network is constructed to transmit information and determine the position of nodes. The measured data are displayed on a computer or smart phone by a graphical interface. The experiment shows that the monitoring system obtains excellent accuracy and stability in long-term continuous monitoring.

Effect of preoperative injection of carbon nanoparticle suspension on the outcomes of selected patients with mid-low rectal cancer.

PubMed

Zhang, Xing-Mao; Liang, Jian-Wei; Wang, Zheng; Kou, Jian-tao; Zhou, Zhi-Xiang

2016-04-04

Carbon nanoparticles show significant lymphatic tropism and can be used to identify lymph nodes surrounding mid-low rectal tumors. In this study, we analyzed the effect of trans anal injection of a carbon nanoparticle suspension on the outcomes of patients with mid-low rectal cancer who underwent laparoscopic resection. We collected the data of 87 patients with mid-low rectal cancer who underwent laparoscopic resection between November 2014 and March 2015 at Cancer Hospital, Chinese Academy of Medical Sciences & Peking Union Medical College. For 35 patients in the experimental group, the carbon nanoparticle suspension was injected transanally into the submucosa of the rectum around the tumor 30 min before the operation; 52 patients in the control group underwent the operation directly without the injection of carbon nanoparticle suspension. We then compared the operation outcomes between the two groups. In the experimental group, the rate of incomplete mesorectal excision was lower than that in the control group, but no significant difference was found (2.9% vs. 7.7%, P = 0.342). The distance between the tumor and the circumferential resection margin was 5.8 ± 1.4 mm in the experimental group and 4.8 ± 1.1 mm in the control group (P = 0.001). The mean number of lymph nodes removed was 28.2 ± 9.4 in the experimental group and 22.7 ± 7.3 in the control group (P = 0.003); the mean number of lymph nodes smaller than 5 mm in diameter was 10.1 ± 7.5 and 4.5 ± 3.7, respectively (P < 0.001). Three patients in the experimental group received lateral lymph node resection. Among the three patients, we retrieved three nodes (one stained node) from the first patient, three nodes (two stained nodes) from the second patient, and two nodes (no stained nodes) from the third patient. Injecting a carbon nanoparticle suspension improved the outcomes of patients who underwent laparoscopic resection for mid-low rectal cancer; it also improved the accuracy of pathologic staging. Moreover, for selected patients, this technique narrowed the scope of lateral lymph node dissection.

Pollinator-mediated selection on floral display and flowering time in the perennial herb Arabidopsis lyrata.

PubMed

Sandring, Saskia; Agren, Jon

2009-05-01

The evolution of floral display and flowering time in animal-pollinated plants is commonly attributed to pollinator-mediated selection. Yet, the causes of selection on flowering phenology and traits contributing to floral display have rarely been tested experimentally in natural populations. We quantified phenotypic selection on morphological and phenological characters in the perennial, outcrossing herb Arabidopsis lyrata in two years using female reproductive success as a proxy of fitness. To determine whether selection on floral display and flowering phenology can be attributed to interactions with pollinators, selection was quantified both for open-pollinated controls and for plants receiving supplemental hand-pollination. We documented directional selection for many flowers, large petals, late start of flowering, and early end of flowering. Seed output was pollen-limited in both years and supplemental hand-pollination reduced the magnitude of selection on number of flowers, and reversed the direction of selection on end of flowering. The results demonstrate that interactions with pollinators may affect the strength of selection on floral display and the direction of selection on phenology of flowering in natural plant populations. They thus support the contention that pollinators can drive the evolution of both floral display and flowering time.

Social power and opinion formation in complex networks

NASA Astrophysics Data System (ADS)

Jalili, Mahdi

2013-02-01

In this paper we investigate the effects of social power on the evolution of opinions in model networks as well as in a number of real social networks. A continuous opinion formation model is considered and the analysis is performed through numerical simulation. Social power is given to a proportion of agents selected either randomly or based on their degrees. As artificial network structures, we consider scale-free networks constructed through preferential attachment and Watts-Strogatz networks. Numerical simulations show that scale-free networks with degree-based social power on the hub nodes have an optimal case where the largest number of the nodes reaches a consensus. However, given power to a random selection of nodes could not improve consensus properties. Introducing social power in Watts-Strogatz networks could not significantly change the consensus profile.

Parallel selection of antibody libraries on phage and yeast surfaces via a cross-species display.

PubMed

Patel, Chirag A; Wang, Jinqing; Wang, Xinwei; Dong, Feng; Zhong, Pingyu; Luo, Peter P; Wang, Kevin C

2011-09-01

We created a cross-species display system that allows the display of the same antibody libraries on both prokaryotic phage and eukaryotic yeast without the need for molecular cloning. Using this cross-display system, a large, diverse library can be constructed once and subsequently used for display and selection in both phage and yeast systems. In this article, we performed the parallel phage and yeast selection of an antibody maturation library using this cross-display platform. This parallel selection allowed us to isolate more unique hits than single-species selection, with 162 unique clones from phage and 107 unique clones from yeast. In addition, we were able to shuttle yeast hits back to Escherichia coli cells for affinity characterization at a higher throughput.

Adaptive consensus of scale-free multi-agent system by randomly selecting links

NASA Astrophysics Data System (ADS)

Mou, Jinping; Ge, Huafeng

2016-06-01

This paper investigates an adaptive consensus problem for distributed scale-free multi-agent systems (SFMASs) by randomly selecting links, where the degree of each node follows a power-law distribution. The randomly selecting links are based on the assumption that every agent decides to select links among its neighbours according to the received data with a certain probability. Accordingly, a novel consensus protocol with the range of the received data is developed, and each node updates its state according to the protocol. By the iterative method and Cauchy inequality, the theoretical analysis shows that all errors among agents converge to zero, and in the meanwhile, several criteria of consensus are obtained. One numerical example shows the reliability of the proposed methods.

Application of a hybrid generation/utility assessment heuristic to a class of scheduling problems

NASA Technical Reports Server (NTRS)

Heyward, Ann O.

1989-01-01

A two-stage heuristic solution approach for a class of multiobjective, n-job, 1-machine scheduling problems is described. Minimization of job-to-job interference for n jobs is sought. The first stage generates alternative schedule sequences by interchanging pairs of schedule elements. The set of alternative sequences can represent nodes of a decision tree; each node is reached via decision to interchange job elements. The second stage selects the parent node for the next generation of alternative sequences through automated paired comparison of objective performance for all current nodes. An application of the heuristic approach to communications satellite systems planning is presented.

The Role of Node Restriction on Cadmium Accumulation in the Brown Rice of 12 Chinese Rice (Oryza sativa L.) Cultivars.

PubMed

Huang, Gaoxiang; Ding, Changfeng; Guo, Fuyu; Li, Xiaogang; Zhou, Zhigao; Zhang, Taolin; Wang, Xingxiang

2017-11-29

For selection or breeding of rice (Oryza sativa L.) cultivars with low Cd affinity, the role of node Cd restriction on Cd accumulation in brown rice was studied. A pot experiment was conducted to investigate the concentration of Cd in different sections of 12 Chinese rice cultivars. The results indicated that the Cd accumulation in the brown rice was mainly dependent on the root or shoot Cd concentration. Among the cultivars with nearly equal shoot Cd concentrations, Cd accumulation in brown rice was mainly dependent on the transport of Cd in the shoot. However, the Cd transport in the shoot was significantly restricted by the nodes, especially by the first node. Furthermore, the area of the diffuse vascular bundle in the junctional region of the flag leaf and the first node was a key contributor to the variations in Cd restriction by the nodes.

A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks.

PubMed

Dao, Thi-Nga; Yoon, Seokhoon; Kim, Jangyoung

2016-01-05

Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR.

A Deadline-Aware Scheduling and Forwarding Scheme in Wireless Sensor Networks

PubMed Central

Dao, Thi-Nga; Yoon, Seokhoon; Kim, Jangyoung

2016-01-01

Many applications in wireless sensor networks (WSNs) require energy consumption to be minimized and the data delivered to the sink within a specific delay. A usual solution for reducing energy consumption is duty cycling, in which nodes periodically switch between sleep and active states. By increasing the duty cycle interval, consumed energy can be reduced more. However, a large duty cycle interval causes a long end-to-end (E2E) packet delay. As a result, the requirement of a specific delay bound for packet delivery may not be satisfied. In this paper, we aim at maximizing the duty cycle while still guaranteeing that the packets arrive at the sink with the required probability, i.e., the required delay-constrained success ratio (DCSR) is achieved. In order to meet this objective, we propose a novel scheduling and forwarding scheme, namely the deadline-aware scheduling and forwarding (DASF) algorithm. In DASF, the E2E delay distribution with the given network model and parameters is estimated in order to determine the maximum duty cycle interval, with which the required DCSR is satisfied. Each node independently selects a wake-up time using the selected interval, and packets are forwarded to a node in the potential forwarding set, which is determined based on the distance between nodes and the sink. DASF does not require time synchronization between nodes, and a node does not need to maintain neighboring node information in advance. Simulation results show that the proposed scheme can satisfy a required delay-constrained success ratio and outperforms existing algorithms in terms of E2E delay and DCSR. PMID:26742046

Serving by local consensus in the public service location game.

PubMed

Sun, Yi-Fan; Zhou, Hai-Jun

2016-09-02

We discuss the issue of distributed and cooperative decision-making in a network game of public service location. Each node of the network can decide to host a certain public service incurring in a construction cost and serving all the neighboring nodes and itself. A pure consumer node has to pay a tax, and the collected tax is evenly distributed to all the hosting nodes to remedy their construction costs. If all nodes make individual best-response decisions, the system gets trapped in an inefficient situation of high tax level. Here we introduce a decentralized local-consensus selection mechanism which requires nodes to recommend their neighbors of highest local impact as candidate servers, and a node may become a server only if all its non-server neighbors give their assent. We demonstrate that although this mechanism involves only information exchange among neighboring nodes, it leads to socially efficient solutions with tax level approaching the lowest possible value. Our results may help in understanding and improving collective problem-solving in various networked social and robotic systems.

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.

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

Serving by local consensus in the public service location game

PubMed Central

Sun, Yi-Fan; Zhou, Hai-Jun

2016-01-01

We discuss the issue of distributed and cooperative decision-making in a network game of public service location. Each node of the network can decide to host a certain public service incurring in a construction cost and serving all the neighboring nodes and itself. A pure consumer node has to pay a tax, and the collected tax is evenly distributed to all the hosting nodes to remedy their construction costs. If all nodes make individual best-response decisions, the system gets trapped in an inefficient situation of high tax level. Here we introduce a decentralized local-consensus selection mechanism which requires nodes to recommend their neighbors of highest local impact as candidate servers, and a node may become a server only if all its non-server neighbors give their assent. We demonstrate that although this mechanism involves only information exchange among neighboring nodes, it leads to socially efficient solutions with tax level approaching the lowest possible value. Our results may help in understanding and improving collective problem-solving in various networked social and robotic systems. PMID:27586793

Serving by local consensus in the public service location game

NASA Astrophysics Data System (ADS)

Sun, Yi-Fan; Zhou, Hai-Jun

2016-09-01

We discuss the issue of distributed and cooperative decision-making in a network game of public service location. Each node of the network can decide to host a certain public service incurring in a construction cost and serving all the neighboring nodes and itself. A pure consumer node has to pay a tax, and the collected tax is evenly distributed to all the hosting nodes to remedy their construction costs. If all nodes make individual best-response decisions, the system gets trapped in an inefficient situation of high tax level. Here we introduce a decentralized local-consensus selection mechanism which requires nodes to recommend their neighbors of highest local impact as candidate servers, and a node may become a server only if all its non-server neighbors give their assent. We demonstrate that although this mechanism involves only information exchange among neighboring nodes, it leads to socially efficient solutions with tax level approaching the lowest possible value. Our results may help in understanding and improving collective problem-solving in various networked social and robotic systems.

Beyond helper phage: Using "helper cells" to select peptide affinity ligands

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

Phipps, Mary Lisa; Lillo, Antoinetta M.; Shou, Yulin

Peptides are important affinity ligands for microscopy, biosensing, and targeted delivery. However, because they can have low affinity for their targets, their selection from large naïve libraries can be challenging. When selecting peptidic ligands from display libraries, it is important to: 1) ensure efficient display; 2) maximize the ability to select high affinity ligands; and 3) minimize the effect of the display context on binding. The “helper cell” packaging system has been described as a tool to produce filamentous phage particles based on phagemid constructs with varying display levels, while remaining free of helper phage contamination. Here we report onmore » the first use of this system for peptide display, including the systematic characterization and optimization of helper cells, their inefficient use in antibody display and their use in creating and selecting from a set of phage display peptide libraries. Our libraries were analyzed with unprecedented precision by standard or deep sequencing, and shown to be superior in quality than commercial gold standards. Using our helper cell libraries, we have obtained ligands recognizing Yersinia pestis surface antigen F1V and L-glutamine-binding periplasmic protein QBP. In the latter case, unlike any of the peptide library selections described so far, we used a combination of phage and yeast display to select intriguing peptide ligands. Here, based on the success of our selections we believe that peptide libraries obtained with helper cells are not only suitable, but preferable to traditional phage display libraries for selection of peptidic ligands.« less

Beyond helper phage: Using "helper cells" to select peptide affinity ligands

DOE PAGES

Phipps, Mary Lisa; Lillo, Antoinetta M.; Shou, Yulin; ...

2016-09-14

Peptides are important affinity ligands for microscopy, biosensing, and targeted delivery. However, because they can have low affinity for their targets, their selection from large naïve libraries can be challenging. When selecting peptidic ligands from display libraries, it is important to: 1) ensure efficient display; 2) maximize the ability to select high affinity ligands; and 3) minimize the effect of the display context on binding. The “helper cell” packaging system has been described as a tool to produce filamentous phage particles based on phagemid constructs with varying display levels, while remaining free of helper phage contamination. Here we report onmore » the first use of this system for peptide display, including the systematic characterization and optimization of helper cells, their inefficient use in antibody display and their use in creating and selecting from a set of phage display peptide libraries. Our libraries were analyzed with unprecedented precision by standard or deep sequencing, and shown to be superior in quality than commercial gold standards. Using our helper cell libraries, we have obtained ligands recognizing Yersinia pestis surface antigen F1V and L-glutamine-binding periplasmic protein QBP. In the latter case, unlike any of the peptide library selections described so far, we used a combination of phage and yeast display to select intriguing peptide ligands. Here, based on the success of our selections we believe that peptide libraries obtained with helper cells are not only suitable, but preferable to traditional phage display libraries for selection of peptidic ligands.« less

Binocular Goggle Augmented Imaging and Navigation System provides real-time fluorescence image guidance for tumor resection and sentinel lymph node mapping

PubMed Central

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-01-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. PMID:26179014

Bacteriophage vehicles for phage display: biology, mechanism, and application.

PubMed

Ebrahimizadeh, Walead; Rajabibazl, Masoumeh

2014-08-01

The phage display technique is a powerful tool for selection of various biological agents. This technique allows construction of large libraries from the antibody repertoire of different hosts and provides a fast and high-throughput selection method. Specific antibodies can be isolated based on distinctive characteristics from a library consisting of millions of members. These features made phage display technology preferred method for antibody selection and engineering. There are several phage display methods available and each has its unique merits and application. Selection of appropriate display technique requires basic knowledge of available methods and their mechanism. In this review, we describe different phage display techniques, available bacteriophage vehicles, and their mechanism.

Sentinel Lymph Nodes for Breast Carcinoma A Paradigm Shift

PubMed Central

Maguire, Aoife; Brogi, Edi

2016-01-01

Context Sentinel lymph node biopsy has been established as the new standard of care for axillary staging in most patients with invasive breast carcinoma. Historically, all patients with a positive sentinel lymph node biopsy result underwent axillary lymph node dissection. Recent trials show that axillary lymph node dissection can be safely omitted in women with clinically node negative, T1 or T2 invasive breast cancer treated with breast-conserving surgery and whole-breast radiotherapy. This change in practice also has implications on the pathologic examination and reporting of sentinel lymph nodes. Objective To review recent clinical and pathologic studies of sentinel lymph nodes and explore how these findings influence the pathologic evaluation of sentinel lymph nodes. Data Sources Sources were published articles from peer-reviewed journals in PubMed (US National Library of Medicine) and published guidelines from the American Joint Committee on Cancer, the Union for International Cancer Control, the American Society of Clinical Oncology, and the National Comprehensive Cancer Network. Conclusions The main goal of sentinel lymph node examination should be to detect all macrometastases (>2 mm). Grossly sectioning sentinel lymph nodes at 2-mm intervals and evaluation of one hematoxylin-eosin–stained section from each block is the preferred method of pathologic evaluation. Axillary lymph node dissection can be safely omitted in clinically node-negative patients with negative sentinel lymph nodes, as well as in a selected group of patients with limited sentinel lymph node involvement. The pathologic features of the primary carcinoma and its sentinel lymph node metastases contribute to estimate the extent of non–sentinel lymph node involvement. This information is important to decide on further axillary treatment. PMID:27472237

Combining Phage and Yeast Cell Surface Antibody Display to Identify Novel Cell Type-Selective Internalizing Human Monoclonal Antibodies.

PubMed

Bidlingmaier, Scott; Su, Yang; Liu, Bin

2015-01-01

Using phage antibody display, large libraries can be generated and screened to identify monoclonal antibodies with affinity for target antigens. However, while library size and diversity is an advantage of the phage display method, there is limited ability to quantitatively enrich for specific binding properties such as affinity. One way of overcoming this limitation is to combine the scale of phage display selections with the flexibility and quantitativeness of FACS-based yeast surface display selections. In this chapter we describe protocols for generating yeast surface antibody display libraries using phage antibody display selection outputs as starting material and FACS-based enrichment of target antigen-binding clones from these libraries. These methods should be widely applicable for the identification of monoclonal antibodies with specific binding properties.

New Scheduling Algorithms for Agile All-Photonic Networks

NASA Astrophysics Data System (ADS)

Mehri, Mohammad Saleh; Ghaffarpour Rahbar, Akbar

2017-12-01

An optical overlaid star network is a class of agile all-photonic networks that consists of one or more core node(s) at the center of the star network and a number of edge nodes around the core node. In this architecture, a core node may use a scheduling algorithm for transmission of traffic through the network. A core node is responsible for scheduling optical packets that arrive from edge nodes and switching them toward their destinations. Nowadays, most edge nodes use virtual output queue (VOQ) architecture for buffering client packets to achieve high throughput. This paper presents two efficient scheduling algorithms called discretionary iterative matching (DIM) and adaptive DIM. These schedulers find maximum matching in a small number of iterations and provide high throughput and incur low delay. The number of arbiters in these schedulers and the number of messages exchanged between inputs and outputs of a core node are reduced. We show that DIM and adaptive DIM can provide better performance in comparison with iterative round-robin matching with SLIP (iSLIP). SLIP means the act of sliding for a short distance to select one of the requested connections based on the scheduling algorithm.

A critical review of variables affecting the accuracy and false-negative rate of sentinel node biopsy procedures in early breast cancer.

PubMed

Vijayakumar, Vani; Boerner, Philip S; Jani, Ashesh B; Vijayakumar, Srinivasan

2005-05-01

Radionuclide sentinel lymph node localization and biopsy is a staging procedure that is being increasingly used to evaluate patients with invasive breast cancer who have clinically normal axillary nodes. The most important prognostic indicator in patients with invasive breast cancer is the axillary node status, which must also be known for correct staging, and influences the selection of adjuvant therapies. The accuracy of sentinel lymph node localization depends on a number of factors, including the injection method, the operating surgeon's experience and the hospital setting. The efficacy of sentinel lymph node mapping can be determined by two measures: the sentinel lymph node identification rate and the false-negative rate. Of these, the false-negative rate is the most important, based on a review of 92 studies. As sentinel lymph node procedures vary widely, nuclear medicine physicians and radiologists must be acquainted with the advantages and disadvantages of the various techniques. In this review, the factors that influence the success of different techniques are examined, and studies which have investigated false-negative rates and/or sentinel lymph node identification rates are summarized.

Near-infrared fluorescence goggle system with complementary metal–oxide–semiconductor imaging sensor and see-through display

PubMed Central

Liu, Yang; Njuguna, Raphael; Matthews, Thomas; Akers, Walter J.; Sudlow, Gail P.; Mondal, Suman; Tang, Rui

2013-01-01

Abstract. We have developed a near-infrared (NIR) fluorescence goggle system based on the complementary metal–oxide–semiconductor active pixel sensor imaging and see-through display technologies. The fluorescence goggle system is a compact wearable intraoperative fluorescence imaging and display system that can guide surgery in real time. The goggle is capable of detecting fluorescence of indocyanine green solution in the picomolar range. Aided by NIR quantum dots, we successfully used the fluorescence goggle to guide sentinel lymph node mapping in a rat model. We further demonstrated the feasibility of using the fluorescence goggle in guiding surgical resection of breast cancer metastases in the liver in conjunction with NIR fluorescent probes. These results illustrate the diverse potential use of the goggle system in surgical procedures. PMID:23728180

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by semi-randomly varying routing policies for different packets

DOEpatents

Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

2010-11-23

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Nodes vary a choice of routing policy for routing data in the network in a semi-random manner, so that similarly situated packets are not always routed along the same path. Semi-random variation of the routing policy tends to avoid certain local hot spots of network activity, which might otherwise arise using more consistent routing determinations. Preferably, the originating node chooses a routing policy for a packet, and all intermediate nodes in the path route the packet according to that policy. Policies may be rotated on a round-robin basis, selected by generating a random number, or otherwise varied.

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.

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.

Successful resection of metachronous para-aortic, Virchow lymph node and liver metastatic recurrence of rectal cancer.

PubMed

Takeshita, Nobuyoshi; Fukunaga, Toru; Kimura, Masayuki; Sugamoto, Yuji; Tasaki, Kentaro; Hoshino, Isamu; Ota, Takumi; Maruyama, Tetsuro; Tamachi, Tomohide; Hosokawa, Takashi; Asai, Yo; Matsubara, Hisahiro

2015-11-28

A 66-year-old female presented with the main complaint of defecation trouble and abdominal distention. With diagnosis of rectal cancer, cSS, cN0, cH0, cP0, cM0 cStage II, Hartmann's operation with D3 lymph node dissection was performed and a para-aortic lymph node and a disseminated node near the primary tumor were resected. Histological examination showed moderately differentiated adenocarcinoma, pSS, pN3, pH0, pP1, pM1 (para-aortic lymph node, dissemination) fStage IV. After the operation, the patient received chemotherapy with FOLFIRI regimen. After 12 cycles of FOLFIRI regimen, computed tomography (CT) detected an 11 mm of liver metastasis in the postero-inferior segment of right hepatic lobe. With diagnosis of liver metastatic recurrence, we performed partial hepatectomy. Histological examination revealed moderately differentiated adenocarcinoma as a metastatic rectal cancer with cut end microscopically positive. After the second operation, the patient received chemotherapy with TS1 alone for 2 years. Ten months after the break, CT detected a 20 mm of para-aortic lymph node metastasis and a 10 mm of lymph node metastasis at the hepato-duodenal ligament. With diagnosis of lymph node metastatic recurrences, we performed lymph node dissection. Histological examination revealed moderately differentiated adenocarcinoma as metastatic rectal cancer in para-aortic and hepato-duodenal ligament areas. After the third operation, we started chemotherapy with modified FOLFOX6 regimen. After 2 cycles of modified FOLFOX6 regimen, due to the onset of neutropenia and liver dysfunction, we switched to capecitabine alone and continued it for 6 mo and then stopped. Eleven months after the break, CT detected two swelling 12 mm of lymph nodes at the left supraclavicular region. With diagnosis of Virchow lymph node metastatic recurrence, we started chemotherapy with capecitabine plus bevacizumab regimen. Due to the onset of neutropenia and hand foot syndrome (Grade 3), we managed to continue capecitabine administration with extension of interval period and dose reduction. After 2 years and 2 mo from starting capecitabine plus bevacizumab regimen, Virchow lymph nodes had slowly grown up to 17 mm. Because no recurrence had been detected besides Virchow lymph nodes for this follow up period, considering the side effects and quality of life, surgical resection was selected. We performed left supraclavicular lymph node dissection. Histological examination revealed moderately differentiated adenocarcinoma as a metastatic rectal cancer. After the fourth operation, the patient selected follow up without chemotherapy. Now we follow up her without recurrence and keep her quality of life high.

Quality assessment of lymph node sampling in rhabdomyosarcoma: A surveillance, epidemiology, and end results (SEER) program study.

PubMed

Lobeck, Inna; Dupree, Phylicia; Karns, Rebekah; Rodeberg, David; von Allmen, Daniel; Dasgupta, Roshni

2017-04-01

Lymph node sampling is integral in the management of extremity and paratesticular rhabdomyosarcoma (RMS). The aim of this study was to determine overall surgical compliance with treatment protocols and impact of nodal sampling outcomes in these tumors. A query of the surveillance, epidemiology, and end results program (SEER) database was performed from 2003 to 2008 for patients <19years of age with RMS. Data obtained included demographics, five-year survival and rate of nodal sampling. Analysis was performed utilizing chi-squared, Kaplan-Meier and hazard ratio modeling. Of 537 patients with extremity RMS, nodal sampling was performed in 25.7% (n=138). This lack of nodal sampling had a negative outcome on survival (p=0.004). Sixty five patients with paratesticular RMS aged greater than 10 were identified and also displayed low rates of lymph node sampling (47.7%, n=31). For paratesticular patients, a similar increase in survival was seen in patients who underwent nodal evaluation (p=0.024). Lymph node sampling is the standard of care in RMS. However, surgical compliance with treatment protocols is poor. Nodal evaluation correlated significantly with overall survival. These findings suggest a need for improved education among surgeons and oncologists regarding the need lymph node assessment in pediatric oncology patients. Evidence rating/classification: Prognosis study, Level III. Copyright © 2017 Elsevier Inc. All rights reserved.

Evaluation of a toxicogenomic approach to the local lymph node assay (LLNA).

PubMed

Boverhof, Darrell R; Gollapudi, B Bhaskar; Hotchkiss, Jon A; Osterloh-Quiroz, Mandy; Woolhiser, Michael R

2009-02-01

Genomic technologies have the potential to enhance and complement existing toxicology endpoints; however, assessment of these approaches requires a systematic evaluation including a robust experimental design with genomic endpoints anchored to traditional toxicology endpoints. The present study was conducted to assess the sensitivity of genomic responses when compared with the traditional local lymph node assay (LLNA) endpoint of lymph node cell proliferation and to evaluate the responses for their ability to provide insights into mode of action. Female BALB/c mice were treated with the sensitizer trimellitic anhydride (TMA), following the standard LLNA dosing regimen, at doses of 0.1, 1, or 10% and traditional tritiated thymidine ((3)HTdR) incorporation and gene expression responses were monitored in the auricular lymph nodes. Additional mice dosed with either vehicle or 10% TMA and sacrificed on day 4 or 10, were also included to examine temporal effects on gene expression. Analysis of (3)HTdR incorporation revealed TMA-induced stimulation indices of 2.8, 22.9, and 61.0 relative to vehicle with an EC(3) of 0.11%. Examination of the dose-response gene expression responses identified 9, 833, and 2122 differentially expressed genes relative to vehicle for the 0.1, 1, and 10% TMA dose groups, respectively. Calculation of EC(3) values for differentially expressed genes did not identify a response that was more sensitive than the (3)HTdR value, although a number of genes displayed comparable sensitivity. Examination of temporal responses revealed 1760, 1870, and 953 differentially expressed genes at the 4-, 6-, and 10-day time points respectively. Functional analysis revealed many responses displayed dose- and time-specific induction patterns within the functional categories of cellular proliferation and immune response, including numerous immunoglobin genes which were highly induced at the day 10 time point. Overall, these experiments have systematically illustrated the potential utility of genomic endpoints to enhance the LLNA and support further exploration of this approach through examination of a more diverse array of chemicals.

Identifying highly connected counties compensates for resource limitations when evaluating national spread of an invasive pathogen.

PubMed

Sutrave, Sweta; Scoglio, Caterina; Isard, Scott A; Hutchinson, J M Shawn; Garrett, Karen A

2012-01-01

Surveying invasive species can be highly resource intensive, yet near-real-time evaluations of invasion progress are important resources for management planning. In the case of the soybean rust invasion of the United States, a linked monitoring, prediction, and communication network saved U.S. soybean growers approximately $200 M/yr. Modeling of future movement of the pathogen (Phakopsora pachyrhizi) was based on data about current disease locations from an extensive network of sentinel plots. We developed a dynamic network model for U.S. soybean rust epidemics, with counties as nodes and link weights a function of host hectarage and wind speed and direction. We used the network model to compare four strategies for selecting an optimal subset of sentinel plots, listed here in order of increasing performance: random selection, zonal selection (based on more heavily weighting regions nearer the south, where the pathogen overwinters), frequency-based selection (based on how frequently the county had been infected in the past), and frequency-based selection weighted by the node strength of the sentinel plot in the network model. When dynamic network properties such as node strength are characterized for invasive species, this information can be used to reduce the resources necessary to survey and predict invasion progress.

Visualizing Ecosystem Energy Flow in Complex Food Web Networks: A Comparison of Three Alaskan Large Marine Ecosystems

NASA Astrophysics Data System (ADS)

Kearney, K.; Aydin, K.

2016-02-01

Oceanic food webs are often depicted as network graphs, with the major organisms or functional groups displayed as nodes and the fluxes of between them as the edges. However, the large number of nodes and edges and high connectance of many management-oriented food webs coupled with graph layout algorithms poorly-suited to certain desired characteristics of food web visualizations often lead to hopelessly tangled diagrams that convey little information other than, "It's complex." Here, I combine several new graph visualization techniques- including a new node layout alorithm based on a trophic similarity (quantification of shared predator and prey) and trophic level, divided edge bundling for edge routing, and intelligent automated placement of labels- to create a much clearer visualization of the important fluxes through a food web. The technique will be used to highlight the differences in energy flow within three Alaskan Large Marine Ecosystems (the Bering Sea, Gulf of Alaska, and Aleutian Islands) that include very similar functional groups but unique energy pathways.

PCLIPS: Parallel CLIPS

NASA Technical Reports Server (NTRS)

Hall, Lawrence O.; Bennett, Bonnie H.; Tello, Ivan

1994-01-01

A parallel version of CLIPS 5.1 has been developed to run on Intel Hypercubes. The user interface is the same as that for CLIPS with some added commands to allow for parallel calls. A complete version of CLIPS runs on each node of the hypercube. The system has been instrumented to display the time spent in the match, recognize, and act cycles on each node. Only rule-level parallelism is supported. Parallel commands enable the assertion and retraction of facts to/from remote nodes working memory. Parallel CLIPS was used to implement a knowledge-based command, control, communications, and intelligence (C(sup 3)I) system to demonstrate the fusion of high-level, disparate sources. We discuss the nature of the information fusion problem, our approach, and implementation. Parallel CLIPS has also be used to run several benchmark parallel knowledge bases such as one to set up a cafeteria. Results show from running Parallel CLIPS with parallel knowledge base partitions indicate that significant speed increases, including superlinear in some cases, are possible.

A conceptual model for site-level ecology of the giant gartersnake (Thamnophis gigas) in the Sacramento Valley, California

USGS Publications Warehouse

Halstead, Brian J.; Wylie, Glenn D.; Casazza, Michael L.; Hansen, Eric C.; Scherer, Rick D.; Patterson, Laura C.

2015-08-14

Bayesian networks further provide a clear visual display of the model that facilitates understanding among various stakeholders (Marcot and others, 2001; Uusitalo , 2007). Empirical data and expert judgment can be combined, as continuous or categorical variables, to update knowledge about the system (Marcot and others, 2001; Uusitalo , 2007). Importantly, Bayesian network models allow inference from causes to consequences, but also from consequences to causes, so that data can inform the states of nodes (values of different random variables) in either direction (Marcot and others, 2001; Uusitalo , 2007). Because they can incorporate both decision nodes that represent management actions and utility nodes that quantify the costs and benefits of outcomes, Bayesian networks are ideally suited to risk analysis and adaptive management (Nyberg and others, 2006; Howes and others, 2010). Thus, Bayesian network models are useful in situations where empirical data are not available, such as questions concerning the responses of giant gartersnakes to management.

Digital system for structural dynamics simulation

NASA Technical Reports Server (NTRS)

Krauter, A. I.; Lagace, L. J.; Wojnar, M. K.; Glor, C.

1982-01-01

State-of-the-art digital hardware and software for the simulation of complex structural dynamic interactions, such as those which occur in rotating structures (engine systems). System were incorporated in a designed to use an array of processors in which the computation for each physical subelement or functional subsystem would be assigned to a single specific processor in the simulator. These node processors are microprogrammed bit-slice microcomputers which function autonomously and can communicate with each other and a central control minicomputer over parallel digital lines. Inter-processor nearest neighbor communications busses pass the constants which represent physical constraints and boundary conditions. The node processors are connected to the six nearest neighbor node processors to simulate the actual physical interface of real substructures. Computer generated finite element mesh and force models can be developed with the aid of the central control minicomputer. The control computer also oversees the animation of a graphics display system, disk-based mass storage along with the individual processing elements.

Saccharide substituted zinc phthalocyanines: optical properties, interaction with bovine serum albumin and near infrared fluorescence imaging for sentinel lymph nodes.

PubMed

Lu, Li; Lv, Feng; Cao, Bo; He, Xujun; Liu, Tianjun

2014-01-03

Saccharide-substituted zinc phthalocyanines, [2,9(10),16(17),23(24)-tetrakis((1-(β-D-glucose-2-yl)-1H-1,2,3-triazol-4-yl)methoxy)phthalocyaninato]zinc(II) and [2,9(10), 16(17),23(24)-tetrakis((1-(β-D-lactose-2-yl)-1H-1,2,3-triazol-4-yl)methoxy)phthalocyaninato] zinc(II), were evaluated as novel near infrared fluorescence agents. Their interaction with bovine serum albumin was investigated by fluorescence and circular dichroism spectroscopy and isothermal titration calorimetry. Near infrared imaging for sentinel lymph nodes in vivo was performed using nude mice as models. Results show that saccharide- substituted zinc phthalocyanines have favourable water solubility, good optical stability and high emission ability in the near infrared region. The interaction of lactose-substituted phthalocyanine with bovine serum albumin displays obvious differences to that of glucose- substituted phthalocyanine. Moreover, lactose-substituted phthalocyanine possesses obvious imaging effects for sentinel lymph nodes in vivo.

Assortativity and leadership emerge from anti-preferential attachment in heterogeneous networks.

PubMed

Sendiña-Nadal, I; Danziger, M M; Wang, Z; Havlin, S; Boccaletti, S

2016-02-18

Real-world networks have distinct topologies, with marked deviations from purely random networks. Many of them exhibit degree-assortativity, with nodes of similar degree more likely to link to one another. Though microscopic mechanisms have been suggested for the emergence of other topological features, assortativity has proven elusive. Assortativity can be artificially implanted in a network via degree-preserving link permutations, however this destroys the graph's hierarchical clustering and does not correspond to any microscopic mechanism. Here, we propose the first generative model which creates heterogeneous networks with scale-free-like properties in degree and clustering distributions and tunable realistic assortativity. Two distinct populations of nodes are incrementally added to an initial network by selecting a subgraph to connect to at random. One population (the followers) follows preferential attachment, while the other population (the potential leaders) connects via anti-preferential attachment: they link to lower degree nodes when added to the network. By selecting the lower degree nodes, the potential leader nodes maintain high visibility during the growth process, eventually growing into hubs. The evolution of links in Facebook empirically validates the connection between the initial anti-preferential attachment and long term high degree. In this way, our work sheds new light on the structure and evolution of social networks.

Assortativity and leadership emerge from anti-preferential attachment in heterogeneous networks

NASA Astrophysics Data System (ADS)

Sendiña-Nadal, I.; Danziger, M. M.; Wang, Z.; Havlin, S.; Boccaletti, S.

2016-02-01

Real-world networks have distinct topologies, with marked deviations from purely random networks. Many of them exhibit degree-assortativity, with nodes of similar degree more likely to link to one another. Though microscopic mechanisms have been suggested for the emergence of other topological features, assortativity has proven elusive. Assortativity can be artificially implanted in a network via degree-preserving link permutations, however this destroys the graph’s hierarchical clustering and does not correspond to any microscopic mechanism. Here, we propose the first generative model which creates heterogeneous networks with scale-free-like properties in degree and clustering distributions and tunable realistic assortativity. Two distinct populations of nodes are incrementally added to an initial network by selecting a subgraph to connect to at random. One population (the followers) follows preferential attachment, while the other population (the potential leaders) connects via anti-preferential attachment: they link to lower degree nodes when added to the network. By selecting the lower degree nodes, the potential leader nodes maintain high visibility during the growth process, eventually growing into hubs. The evolution of links in Facebook empirically validates the connection between the initial anti-preferential attachment and long term high degree. In this way, our work sheds new light on the structure and evolution of social networks.

Knowledge diffusion in the collaboration hypernetwork

NASA Astrophysics Data System (ADS)

Yang, Guang-Yong; Hu, Zhao-Long; Liu, Jian-Guo

2015-02-01

As knowledge constitutes a primary productive force, it is important to understand the performance of knowledge diffusion. In this paper, we present a knowledge diffusion model based on the local-world non-uniform hypernetwork, which introduces the preferential diffusion mechanism and the knowledge absorptive capability αj, where αj is correlated with the hyperdegree dH(j) of node j. At each time step, we randomly select a node i as the sender; a receiver node is selected from the set of nodes that the sender i has published with previously, with probability proportional to the number of papers they have published together. Applying the average knowledge stock V bar(t) , the variance σ2(t) and the variance coefficient c(t) of knowledge stock to measure the growth and diffusion of knowledge and the adequacy of knowledge diffusion, we have made 3 groups of comparative experiments to investigate how different network structures, hypernetwork sizes and knowledge evolution mechanisms affect the knowledge diffusion, respectively. As the diffusion mechanisms based on the hypernetwork combine with the hyperdegree of node, the hypernetwork is more suitable for investigating the performance of knowledge diffusion. Therefore, the proposed model could be helpful for deeply understanding the process of the knowledge diffusion in the collaboration hypernetwork.

Isolated perifacial lymph node metastasis in oral squamous cell carcinoma with clinically node-negative neck.

PubMed

Agarwal, Sangeet Kumar; Arora, Sowrabh Kumar; Kumar, Gopal; Sarin, Deepak

2016-10-01

The incidence of occult perifacial nodal disease in oral cavity squamous cell carcinoma is not well reported. The purpose of this study was to evaluate the incidence of isolated perifacial lymph node metastasis in patients with oral squamous cell carcinoma with a clinically node-negative neck. The study will shed light on current controversies and will provide valuable clinical and pathological information in the practice of routine comprehensive removal of these lymph node pads in selective neck dissection in the node-negative neck. Prospective analysis. This study was started in August 2011 when intraoperatively we routinely separated the lymph node levels from the main specimen for evaluation of the metastatic rate to different lymph node levels in 231 patients of oral squamous cell cancer with a clinically node-negative neck. The current study demonstrated that 19 (8.22%) out of 231 patients showed ipsilateral isolated perifacial lymph node involvement. The incidence of isolated perifacial nodes did not differ significantly between the oral tongue (7.14%) and buccal mucosa (7.75%). Incidence was statistically significant in cases with lower age group (<45 years), advanced T stage, and higher depth of tumor invasion. Isolated perifacial node metastasis is high in oral squamous cell carcinoma with a clinically node-negative neck. The incidence of isolated perifacial involvement is high in cases of buccal mucosal and tongue cancers. A meticulous dissection of the perifacial nodes seems prudent when treating the neck in oral cavity squamous cell carcinoma. 4 Laryngoscope, 126:2252-2256, 2016. © 2016 The American Laryngological, Rhinological and Otological Society, Inc.

Rate-Compatible Protograph LDPC Codes

NASA Technical Reports Server (NTRS)

Nguyen, Thuy V. (Inventor); Nosratinia, Aria (Inventor); Divsalar, Dariush (Inventor)

2014-01-01

Digital communication coding methods resulting in rate-compatible low density parity-check (LDPC) codes built from protographs. Described digital coding methods start with a desired code rate and a selection of the numbers of variable nodes and check nodes to be used in the protograph. Constraints are set to satisfy a linear minimum distance growth property for the protograph. All possible edges in the graph are searched for the minimum iterative decoding threshold and the protograph with the lowest iterative decoding threshold is selected. Protographs designed in this manner are used in decode and forward relay channels.

Association between split selection instability and predictive error in survival trees.

PubMed

Radespiel-Tröger, M; Gefeller, O; Rabenstein, T; Hothorn, T

2006-01-01

To evaluate split selection instability in six survival tree algorithms and its relationship with predictive error by means of a bootstrap study. We study the following algorithms: logrank statistic with multivariate p-value adjustment without pruning (LR), Kaplan-Meier distance of survival curves (KM), martingale residuals (MR), Poisson regression for censored data (PR), within-node impurity (WI), and exponential log-likelihood loss (XL). With the exception of LR, initial trees are pruned by using split-complexity, and final trees are selected by means of cross-validation. We employ a real dataset from a clinical study of patients with gallbladder stones. The predictive error is evaluated using the integrated Brier score for censored data. The relationship between split selection instability and predictive error is evaluated by means of box-percentile plots, covariate and cutpoint selection entropy, and cutpoint selection coefficients of variation, respectively, in the root node. We found a positive association between covariate selection instability and predictive error in the root node. LR yields the lowest predictive error, while KM and MR yield the highest predictive error. The predictive error of survival trees is related to split selection instability. Based on the low predictive error of LR, we recommend the use of this algorithm for the construction of survival trees. Unpruned survival trees with multivariate p-value adjustment can perform equally well compared to pruned trees. The analysis of split selection instability can be used to communicate the results of tree-based analyses to clinicians and to support the application of survival trees.

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

Node Depth Adjustment Based Target Tracking in UWSNs Using Improved Harmony Search.

PubMed

Liu, Meiqin; Zhang, Duo; Zhang, Senlin; Zhang, Qunfei

2017-12-04

Underwater wireless sensor networks (UWSNs) can provide a promising solution to underwater target tracking. Due to the limited computation and bandwidth resources, only a small part of nodes are selected to track the target at each interval. How to improve tracking accuracy with a small number of nodes is a key problem. In recent years, a node depth adjustment system has been developed and applied to issues of network deployment and routing protocol. As far as we know, all existing tracking schemes keep underwater nodes static or moving with water flow, and node depth adjustment has not been utilized for underwater target tracking yet. This paper studies node depth adjustment method for target tracking in UWSNs. Firstly, since a Fisher Information Matrix (FIM) can quantify the estimation accuracy, its relation to node depth is derived as a metric. Secondly, we formulate the node depth adjustment as an optimization problem to determine moving depth of activated node, under the constraint of moving range, the value of FIM is used as objective function, which is aimed to be minimized over moving distance of nodes. Thirdly, to efficiently solve the optimization problem, an improved Harmony Search (HS) algorithm is proposed, in which the generating probability is modified to improve searching speed and accuracy. Finally, simulation results are presented to verify performance of our scheme.

Node Depth Adjustment Based Target Tracking in UWSNs Using Improved Harmony Search

PubMed Central

Zhang, Senlin; Zhang, Qunfei

2017-01-01

Underwater wireless sensor networks (UWSNs) can provide a promising solution to underwater target tracking. Due to the limited computation and bandwidth resources, only a small part of nodes are selected to track the target at each interval. How to improve tracking accuracy with a small number of nodes is a key problem. In recent years, a node depth adjustment system has been developed and applied to issues of network deployment and routing protocol. As far as we know, all existing tracking schemes keep underwater nodes static or moving with water flow, and node depth adjustment has not been utilized for underwater target tracking yet. This paper studies node depth adjustment method for target tracking in UWSNs. Firstly, since a Fisher Information Matrix (FIM) can quantify the estimation accuracy, its relation to node depth is derived as a metric. Secondly, we formulate the node depth adjustment as an optimization problem to determine moving depth of activated node, under the constraint of moving range, the value of FIM is used as objective function, which is aimed to be minimized over moving distance of nodes. Thirdly, to efficiently solve the optimization problem, an improved Harmony Search (HS) algorithm is proposed, in which the generating probability is modified to improve searching speed and accuracy. Finally, simulation results are presented to verify performance of our scheme. PMID:29207541

A Lifetime Maximization Relay Selection Scheme in Wireless Body Area Networks.

PubMed

Zhang, Yu; Zhang, Bing; Zhang, Shi

2017-06-02

Network Lifetime is one of the most important metrics in Wireless Body Area Networks (WBANs). In this paper, a relay selection scheme is proposed under the topology constrains specified in the IEEE 802.15.6 standard to maximize the lifetime of WBANs through formulating and solving an optimization problem where relay selection of each node acts as optimization variable. Considering the diversity of the sensor nodes in WBANs, the optimization problem takes not only energy consumption rate but also energy difference among sensor nodes into account to improve the network lifetime performance. Since it is Non-deterministic Polynomial-hard (NP-hard) and intractable, a heuristic solution is then designed to rapidly address the optimization. The simulation results indicate that the proposed relay selection scheme has better performance in network lifetime compared with existing algorithms and that the heuristic solution has low time complexity with only a negligible performance degradation gap from optimal value. Furthermore, we also conduct simulations based on a general WBAN model to comprehensively illustrate the advantages of the proposed algorithm. At the end of the evaluation, we validate the feasibility of our proposed scheme via an implementation discussion.

Methods for Selecting Phage Display Antibody Libraries.

PubMed

Jara-Acevedo, Ricardo; Diez, Paula; Gonzalez-Gonzalez, Maria; Degano, Rosa Maria; Ibarrola, Nieves; Gongora, Rafael; Orfao, Alberto; Fuentes, Manuel

2016-01-01

The selection process aims sequential enrichment of phage antibody display library in clones that recognize the target of interest or antigen as the library undergoes successive rounds of selection. In this review, selection methods most commonly used for phage display antibody libraries have been comprehensively described. Copyright© Bentham Science Publishers; For any queries, please email at epub@benthamscience.org.

Composing Music with Complex Networks

NASA Astrophysics Data System (ADS)

Liu, Xiaofan; Tse, Chi K.; Small, Michael

In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes and their co-occurrences. We analyze sample compositions from Bach, Mozart, Chopin, as well as other types of music including Chinese pop music. We observe remarkably similar properties in all networks constructed from the selected compositions. Power-law exponents of degree distributions, mean degrees, clustering coefficients, mean geodesic distances, etc. are reported. With the network constructed, music can be created by using a biased random walk algorithm, which begins with a randomly chosen note and selects the subsequent notes according to a simple set of rules that compares the weights of the edges, weights of the nodes, and/or the degrees of nodes. The newly created music from complex networks will be played in the presentation.

a Weighted Local-World Evolving Network Model Based on the Edge Weights Preferential Selection

NASA Astrophysics Data System (ADS)

Li, Ping; Zhao, Qingzhen; Wang, Haitang

2013-05-01

In this paper, we use the edge weights preferential attachment mechanism to build a new local-world evolutionary model for weighted networks. It is different from previous papers that the local-world of our model consists of edges instead of nodes. Each time step, we connect a new node to two existing nodes in the local-world through the edge weights preferential selection. Theoretical analysis and numerical simulations show that the scale of the local-world affect on the weight distribution, the strength distribution and the degree distribution. We give the simulations about the clustering coefficient and the dynamics of infectious diseases spreading. The weight dynamics of our network model can portray the structure of realistic networks such as neural network of the nematode C. elegans and Online Social Network.

[B lymphocyte clonal evolution of human reactive lymph nodes revealed by lineage tree analysis].

PubMed

Tabibian-Keissar, Hilla; Schiby, Ginette; Azogui-Rosenthal, Noemie; Hazanov, Helena; Rakovsky, Aviya Shapira; Michaeli, Miri; Rosenblatt, Kinneret; Mehr, Ramit; Barshack, Iris

2013-06-01

Hypermutation and selection processes, characterizing T-dependent B cell responses taking place in germinal centers of lymph nodes, lead to B cell receptor affinity maturation. Those immune responses lead to the development of memory B cells and plasma cells that secrete high amounts of antibody molecules. The dynamics of B cell clonal evolution during affinity maturation has significant importance in infectious and autoimmune diseases, malignancies and aging. Immunoglobulin (Ig) gene mutational Lineage tree construction by comparing variable regions of Ig-gene sequences to the Ig germline gene is an interesting approach for studying B cell cLonal evolution. Lineage tree shapes and Ig gene mutations can be evaluated not only qualitatively and intuitively, but also quantitatively, and thus reveal important information related to hypermutation and selection. In this paper we describe the experimental protocols that we used for PCR amplification of Igvariable region genes from human formalin fixed paraffin embedded reactive lymph node tissues and the subsequent bioinformatical analyses of sequencing data using Ig mutational lineage trees. B cell populations of three out of four reactive Lymph node tissues were composed of several clones. Most of the Ig gene mutational lineage trees were small and narrow. Significant differences were not detected by quantification of Lineage trees. B lymphocyte clones that were detected in human reactive lymph node tissues represent major responding clones in normal polyclonal immune response. This result is in line with the polyclonal profile of B Lymphocyte populations that reside in reactive lymph node tissues.

Foliar application with nano-silicon reduced cadmium accumulation in grains by inhibiting cadmium translocation in rice plants.

PubMed

Chen, Rui; Zhang, Changbo; Zhao, Yanling; Huang, Yongchun; Liu, Zhongqi

2018-01-01

Nano-silicon (Si) may be more effective than regular fertilizers in protecting plants from cadmium (Cd) stress. A field experiment was conducted to study the effects of nano-Si on Cd accumulation in grains and other organs of rice plants (Oryza sativa L. cv. Xiangzaoxian 45) grown in Cd-contaminated farmland. Foliar application with 5~25 mM nano-Si at anthesis stage reduced Cd concentrations in grains and rachises at maturity stage by 31.6~64.9 and 36.1~60.8%, respectively. Meanwhile, nano-Si application significantly increased concentrations of potassium (K), magnesium (Mg), and iron (Fe) in grains and rachises, but imposed little effect on concentrations of calcium (Ca), zinc (Zn), and manganese (Mn) in them. Uppermost nodes under panicles displayed much higher Cd concentration (4.50~5.53 mg kg -1 ) than other aerial organs. After foliar application with nano-Si, translocation factors (TFs) of Cd ions from the uppermost nodes to rachises significantly declined, but TFs of K, Mg, and Fe from the uppermost nodes to rachises increased significantly. High dose of nano-Si (25 mM) was more effective than low dose of nano-Si in reducing TFs of Cd from roots to the uppermost nodes and from the uppermost nodes to rachises. These findings indicate that nano-Si supply reduces Cd accumulation in grains by inhibiting translocation of Cd and, meanwhile, promoting translocation of K, Mg, and Fe from the uppermost nodes to rachises in rice plants.

Clinical implementation and failure mode and effects analysis of HDR skin brachytherapy using Valencia and Leipzig surface applicators.

PubMed

Sayler, Elaine; Eldredge-Hindy, Harriet; Dinome, Jessie; Lockamy, Virginia; Harrison, Amy S

2015-01-01

The planning procedure for Valencia and Leipzig surface applicators (VLSAs) (Nucletron, Veenendaal, The Netherlands) differs substantially from CT-based planning; the unfamiliarity could lead to significant errors. This study applies failure modes and effects analysis (FMEA) to high-dose-rate (HDR) skin brachytherapy using VLSAs to ensure safety and quality. A multidisciplinary team created a protocol for HDR VLSA skin treatments and applied FMEA. Failure modes were identified and scored by severity, occurrence, and detectability. The clinical procedure was then revised to address high-scoring process nodes. Several key components were added to the protocol to minimize risk probability numbers. (1) Diagnosis, prescription, applicator selection, and setup are reviewed at weekly quality assurance rounds. Peer review reduces the likelihood of an inappropriate treatment regime. (2) A template for HDR skin treatments was established in the clinic's electronic medical record system to standardize treatment instructions. This reduces the chances of miscommunication between the physician and planner as well as increases the detectability of an error. (3) A screen check was implemented during the second check to increase detectability of an error. (4) To reduce error probability, the treatment plan worksheet was designed to display plan parameters in a format visually similar to the treatment console display, facilitating data entry and verification. (5) VLSAs are color coded and labeled to match the electronic medical record prescriptions, simplifying in-room selection and verification. Multidisciplinary planning and FMEA increased detectability and reduced error probability during VLSA HDR brachytherapy. This clinical model may be useful to institutions implementing similar procedures. Copyright © 2015 American Brachytherapy Society. Published by Elsevier Inc. All rights reserved.

Bermudagrass (Cynodon spp.).

PubMed

Ge, Yaxin; Wang, Zeng-Yu

2006-01-01

Bermudagrass is an important warm-season forage and turf species widely grown in the southern United States. This chapter describes a rapid and efficient protocol that allows for the generation of a large number of transgenic bermudagrass plants, bypassing the callus formation phase. Stolon nodes are infected and co-cultivated with Agrobacterium tumefaciens harboring pCAMBIA binary vectors. Hygromycin phosphotransferase gene (hph) is used as the selectable marker and hygromycin is used as the selection agent. Green shoots are directly produced from infected stolon nodes 4 to 5 wk after hygromycin selection. Without callus formation and with minimum tissue culture, this procedure allowed us to obtain well-rooted transgenic plantlets in only 7 wk and greenhouse-grown plants in only 9 wk.

Gibbon genome and the fast karyotype evolution of small apes.

PubMed

Carbone, Lucia; Harris, R Alan; Gnerre, Sante; Veeramah, Krishna R; Lorente-Galdos, Belen; Huddleston, John; Meyer, Thomas J; Herrero, Javier; Roos, Christian; Aken, Bronwen; Anaclerio, Fabio; Archidiacono, Nicoletta; Baker, Carl; Barrell, Daniel; Batzer, Mark A; Beal, Kathryn; Blancher, Antoine; Bohrson, Craig L; Brameier, Markus; Campbell, Michael S; Capozzi, Oronzo; Casola, Claudio; Chiatante, Giorgia; Cree, Andrew; Damert, Annette; de Jong, Pieter J; Dumas, Laura; Fernandez-Callejo, Marcos; Flicek, Paul; Fuchs, Nina V; Gut, Ivo; Gut, Marta; Hahn, Matthew W; Hernandez-Rodriguez, Jessica; Hillier, LaDeana W; Hubley, Robert; Ianc, Bianca; Izsvák, Zsuzsanna; Jablonski, Nina G; Johnstone, Laurel M; Karimpour-Fard, Anis; Konkel, Miriam K; Kostka, Dennis; Lazar, Nathan H; Lee, Sandra L; Lewis, Lora R; Liu, Yue; Locke, Devin P; Mallick, Swapan; Mendez, Fernando L; Muffato, Matthieu; Nazareth, Lynne V; Nevonen, Kimberly A; O'Bleness, Majesta; Ochis, Cornelia; Odom, Duncan T; Pollard, Katherine S; Quilez, Javier; Reich, David; Rocchi, Mariano; Schumann, Gerald G; Searle, Stephen; Sikela, James M; Skollar, Gabriella; Smit, Arian; Sonmez, Kemal; ten Hallers, Boudewijn; Terhune, Elizabeth; Thomas, Gregg W C; Ullmer, Brygg; Ventura, Mario; Walker, Jerilyn A; Wall, Jeffrey D; Walter, Lutz; Ward, Michelle C; Wheelan, Sarah J; Whelan, Christopher W; White, Simon; Wilhelm, Larry J; Woerner, August E; Yandell, Mark; Zhu, Baoli; Hammer, Michael F; Marques-Bonet, Tomas; Eichler, Evan E; Fulton, Lucinda; Fronick, Catrina; Muzny, Donna M; Warren, Wesley C; Worley, Kim C; Rogers, Jeffrey; Wilson, Richard K; Gibbs, Richard A

2014-09-11

Gibbons are small arboreal apes that display an accelerated rate of evolutionary chromosomal rearrangement and occupy a key node in the primate phylogeny between Old World monkeys and great apes. Here we present the assembly and analysis of a northern white-cheeked gibbon (Nomascus leucogenys) genome. We describe the propensity for a gibbon-specific retrotransposon (LAVA) to insert into chromosome segregation genes and alter transcription by providing a premature termination site, suggesting a possible molecular mechanism for the genome plasticity of the gibbon lineage. We further show that the gibbon genera (Nomascus, Hylobates, Hoolock and Symphalangus) experienced a near-instantaneous radiation ∼5 million years ago, coincident with major geographical changes in southeast Asia that caused cycles of habitat compression and expansion. Finally, we identify signatures of positive selection in genes important for forelimb development (TBX5) and connective tissues (COL1A1) that may have been involved in the adaptation of gibbons to their arboreal habitat.

DKIST visible broadband imager data processing pipeline

NASA Astrophysics Data System (ADS)

Beard, Andrew; Cowan, Bruce; Ferayorni, Andrew

2014-07-01

The Daniel K. Inouye Solar Telescope (DKIST) Data Handling System (DHS) provides the technical framework and building blocks for developing on-summit instrument quality assurance and data reduction pipelines. The DKIST Visible Broadband Imager (VBI) is a first light instrument that alone will create two data streams with a bandwidth of 960 MB/s each. The high data rate and data volume of the VBI require near-real time processing capability for quality assurance and data reduction, and will be performed on-summit using Graphics Processing Unit (GPU) technology. The VBI data processing pipeline (DPP) is the first designed and developed using the DKIST DHS components, and therefore provides insight into the strengths and weaknesses of the framework. In this paper we lay out the design of the VBI DPP, examine how the underlying DKIST DHS components are utilized, and discuss how integration of the DHS framework with GPUs was accomplished. We present our results of the VBI DPP alpha release implementation of the calibration, frame selection reduction, and quality assurance display processing nodes.

Effective Social Relationship Measurement and Cluster Based Routing in Mobile Opportunistic Networks †

PubMed Central

Zeng, Feng; Zhao, Nan; Li, Wenjia

2017-01-01

In mobile opportunistic networks, the social relationship among nodes has an important impact on data transmission efficiency. Motivated by the strong share ability of “circles of friends” in communication networks such as Facebook, Twitter, Wechat and so on, we take a real-life example to show that social relationships among nodes consist of explicit and implicit parts. The explicit part comes from direct contact among nodes, and the implicit part can be measured through the “circles of friends”. We present the definitions of explicit and implicit social relationships between two nodes, adaptive weights of explicit and implicit parts are given according to the contact feature of nodes, and the distributed mechanism is designed to construct the “circles of friends” of nodes, which is used for the calculation of the implicit part of social relationship between nodes. Based on effective measurement of social relationships, we propose a social-based clustering and routing scheme, in which each node selects the nodes with close social relationships to form a local cluster, and the self-control method is used to keep all cluster members always having close relationships with each other. A cluster-based message forwarding mechanism is designed for opportunistic routing, in which each node only forwards the copy of the message to nodes with the destination node as a member of the local cluster. Simulation results show that the proposed social-based clustering and routing outperforms the other classic routing algorithms. PMID:28498309

Effective Social Relationship Measurement and Cluster Based Routing in Mobile Opportunistic Networks.

PubMed

Zeng, Feng; Zhao, Nan; Li, Wenjia

2017-05-12

In mobile opportunistic networks, the social relationship among nodes has an important impact on data transmission efficiency. Motivated by the strong share ability of "circles of friends" in communication networks such as Facebook, Twitter, Wechat and so on, we take a real-life example to show that social relationships among nodes consist of explicit and implicit parts. The explicit part comes from direct contact among nodes, and the implicit part can be measured through the "circles of friends". We present the definitions of explicit and implicit social relationships between two nodes, adaptive weights of explicit and implicit parts are given according to the contact feature of nodes, and the distributed mechanism is designed to construct the "circles of friends" of nodes, which is used for the calculation of the implicit part of social relationship between nodes. Based on effective measurement of social relationships, we propose a social-based clustering and routing scheme, in which each node selects the nodes with close social relationships to form a local cluster, and the self-control method is used to keep all cluster members always having close relationships with each other. A cluster-based message forwarding mechanism is designed for opportunistic routing, in which each node only forwards the copy of the message to nodes with the destination node as a member of the local cluster. Simulation results show that the proposed social-based clustering and routing outperforms the other classic routing algorithms.

Approximating frustration scores in complex networks via perturbed Laplacian spectra

NASA Astrophysics Data System (ADS)

Savol, Andrej J.; Chennubhotla, Chakra S.

2015-12-01

Systems of many interacting components, as found in physics, biology, infrastructure, and the social sciences, are often modeled by simple networks of nodes and edges. The real-world systems frequently confront outside intervention or internal damage whose impact must be predicted or minimized, and such perturbations are then mimicked in the models by altering nodes or edges. This leads to the broad issue of how to best quantify changes in a model network after some type of perturbation. In the case of node removal there are many centrality metrics which associate a scalar quantity with the removed node, but it can be difficult to associate the quantities with some intuitive aspect of physical behavior in the network. This presents a serious hurdle to the application of network theory: real-world utility networks are rarely altered according to theoretic principles unless the kinetic impact on the network's users are fully appreciated beforehand. In pursuit of a kinetically interpretable centrality score, we discuss the f-score, or frustration score. Each f-score quantifies whether a selected node accelerates or inhibits global mean first passage times to a second, independently selected target node. We show that this is a natural way of revealing the dynamical importance of a node in some networks. After discussing merits of the f-score metric, we combine spectral and Laplacian matrix theory in order to quickly approximate the exact f-score values, which can otherwise be expensive to compute. Following tests on both synthetic and real medium-sized networks, we report f-score runtime improvements over exact brute force approaches in the range of 0 to 400 % with low error (<3 % ).

Use of generalized regression tree models to characterize vegetation favoring Anopheles albimanus breeding.

PubMed

Hernandez, J E; Epstein, L D; Rodriguez, M H; Rodriguez, A D; Rejmankova, E; Roberts, D R

1997-03-01

We propose the use of generalized tree models (GTMs) to analyze data from entomological field studies. Generalized tree models can be used to characterize environments with different mosquito breeding capacity. A GTM simultaneously analyzes a set of predictor variables (e.g., vegetation coverage) in relation to a response variable (e.g., counts of Anopheles albimanus larvae), and how it varies with respect to a set of criterion variables (e.g., presence of predators). The algorithm produces a treelike graphical display with its root at the top and 2 branches stemming down from each node. At each node, conditions on the value of predictors partition the observations into subgroups (environments) in which the relation between response and criterion variables is most homogeneous.

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

Dmitriev, Alexander S.; Yemelyanov, Ruslan Yu.; Moscow Institute of Physics and Technology

The paper deals with a new multi-element processor platform assigned for modelling the behaviour of interacting dynamical systems, i.e., active wireless network. Experimentally, this ensemble is implemented in an active network, the active nodes of which include direct chaotic transceivers and special actuator boards containing microcontrollers for modelling the dynamical systems and an information display unit (colored LEDs). The modelling technique and experimental results are described and analyzed.

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.

A Routing Path Construction Method for Key Dissemination Messages in Sensor Networks

PubMed Central

Moon, Soo Young; Cho, Tae Ho

2014-01-01

Authentication is an important security mechanism for detecting forged messages in a sensor network. Each cluster head (CH) in dynamic key distribution schemes forwards a key dissemination message that contains encrypted authentication keys within its cluster to next-hop nodes for the purpose of authentication. The forwarding path of the key dissemination message strongly affects the number of nodes to which the authentication keys in the message are actually distributed. We propose a routing method for the key dissemination messages to increase the number of nodes that obtain the authentication keys. In the proposed method, each node selects next-hop nodes to which the key dissemination message will be forwarded based on secret key indexes, the distance to the sink node, and the energy consumption of its neighbor nodes. The experimental results show that the proposed method can increase by 50–70% the number of nodes to which authentication keys in each cluster are distributed compared to geographic and energy-aware routing (GEAR). In addition, the proposed method can detect false reports earlier by using the distributed authentication keys, and it consumes less energy than GEAR when the false traffic ratio (FTR) is ≥10%. PMID:25136649

High vertical resolution crosswell seismic imaging

DOEpatents

Lazaratos, Spyridon K.

1999-12-07

A method for producing high vertical resolution seismic images from crosswell data is disclosed. In accordance with one aspect of the disclosure, a set of vertically spaced, generally horizontally extending continuous layers and associated nodes are defined within a region between two boreholes. The specific number of nodes is selected such that the value of a particular characteristic of the subterranean region at each of the nodes is one which can be determined from the seismic data. Once values are established at the nodes, values of the particular characteristic are assigned to positions between the node points of each layer based on the values at node within that layer and without regard to the values at node points within any other layer. A seismic map is produced using the node values and the assigned values therebetween. In accordance with another aspect of the disclosure, an approximate model of the region is established using direct arrival traveltime data. Thereafter, the approximate model is adjusted using reflected arrival data. In accordance with still another aspect of the disclosure, correction is provided for well deviation. An associated technique which provides improvements in ray tracing is also disclosed.

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

Dendritic cells control fibroblastic reticular network tension and lymph node expansion.

PubMed

Acton, Sophie E; Farrugia, Aaron J; Astarita, Jillian L; Mourão-Sá, Diego; Jenkins, Robert P; Nye, Emma; Hooper, Steven; van Blijswijk, Janneke; Rogers, Neil C; Snelgrove, Kathryn J; Rosewell, Ian; Moita, Luis F; Stamp, Gordon; Turley, Shannon J; Sahai, Erik; Reis e Sousa, Caetano

2014-10-23

After immunogenic challenge, infiltrating and dividing lymphocytes markedly increase lymph node cellularity, leading to organ expansion. Here we report that the physical elasticity of lymph nodes is maintained in part by podoplanin (PDPN) signalling in stromal fibroblastic reticular cells (FRCs) and its modulation by CLEC-2 expressed on dendritic cells. We show in mouse cells that PDPN induces actomyosin contractility in FRCs via activation of RhoA/C and downstream Rho-associated protein kinase (ROCK). Engagement by CLEC-2 causes PDPN clustering and rapidly uncouples PDPN from RhoA/C activation, relaxing the actomyosin cytoskeleton and permitting FRC stretching. Notably, administration of CLEC-2 protein to immunized mice augments lymph node expansion. In contrast, lymph node expansion is significantly constrained in mice selectively lacking CLEC-2 expression in dendritic cells. Thus, the same dendritic cells that initiate immunity by presenting antigens to T lymphocytes also initiate remodelling of lymph nodes by delivering CLEC-2 to FRCs. CLEC-2 modulation of PDPN signalling permits FRC network stretching and allows for the rapid lymph node expansion--driven by lymphocyte influx and proliferation--that is the critical hallmark of adaptive immunity.

The optimal community detection of software based on complex networks

NASA Astrophysics Data System (ADS)

Huang, Guoyan; Zhang, Peng; Zhang, Bing; Yin, Tengteng; Ren, Jiadong

2016-02-01

The community structure is important for software in terms of understanding the design patterns, controlling the development and the maintenance process. In order to detect the optimal community structure in the software network, a method Optimal Partition Software Network (OPSN) is proposed based on the dependency relationship among the software functions. First, by analyzing the information of multiple execution traces of one software, we construct Software Execution Dependency Network (SEDN). Second, based on the relationship among the function nodes in the network, we define Fault Accumulation (FA) to measure the importance of the function node and sort the nodes with measure results. Third, we select the top K(K=1,2,…) nodes as the core of the primal communities (only exist one core node). By comparing the dependency relationships between each node and the K communities, we put the node into the existing community which has the most close relationship. Finally, we calculate the modularity with different initial K to obtain the optimal division. With experiments, the method OPSN is verified to be efficient to detect the optimal community in various softwares.

47 CFR 11.33 - EAS Decoder.

Code of Federal Regulations, 2010 CFR

2010-10-01

... decoders manufactured after August 1, 2003 must provide a means to permit the selective display and logging... upgrade their decoders on an optional basis to include a selective display and logging capability for EAS... decoders after February 1, 2004 must install decoders that provide a means to permit the selective display...

DRDT: distributed and reliable data transmission with cooperative nodes for lossy wireless sensor networks.

PubMed

Seo, Jaewan; Kim, Moonseong; Hur, In; Choi, Wook; Choo, Hyunseung

2010-01-01

Recent studies have shown that in realistic wireless sensor network environments links are extremely unreliable. To recover from corrupted packets, most routing schemes with an assumption of ideal radio environments use a retransmission mechanism, which may cause unnecessary retransmissions. Therefore, guaranteeing energy-efficient reliable data transmission is a fundamental routing issue in wireless sensor networks. However, it is not encouraged to propose a new reliable routing scheme in the sense that every existing routing scheme cannot be replaced with the new one. This paper proposes a Distributed and Reliable Data Transmission (DRDT) scheme with a goal to efficiently guarantee reliable data transmission. In particular, this is based on a pluggable modular approach so that it can be extended to existing routing schemes. DRDT offers reliable data transmission using neighbor nodes, i.e., helper nodes. A helper node is selected among the neighbor nodes of the receiver node which overhear the data packet in a distributed manner. DRDT effectively reduces the number of retransmissions by delegating the retransmission task from the sender node to the helper node that has higher link quality to the receiver node when the data packet reception fails due to the low link quality between the sender and the receiver nodes. Comprehensive simulation results show that DRDT improves end-to-end transmission cost by up to about 45% and reduces its delay by about 40% compared to existing schemes.

An Efficient Next Hop Selection Algorithm for Multi-Hop Body Area Networks

PubMed Central

Ayatollahitafti, Vahid; Ngadi, Md Asri; Mohamad Sharif, Johan bin; Abdullahi, Mohammed

2016-01-01

Body Area Networks (BANs) consist of various sensors which gather patient’s vital signs and deliver them to doctors. One of the most significant challenges faced, is the design of an energy-efficient next hop selection algorithm to satisfy Quality of Service (QoS) requirements for different healthcare applications. In this paper, a novel efficient next hop selection algorithm is proposed in multi-hop BANs. This algorithm uses the minimum hop count and a link cost function jointly in each node to choose the best next hop node. The link cost function includes the residual energy, free buffer size, and the link reliability of the neighboring nodes, which is used to balance the energy consumption and to satisfy QoS requirements in terms of end to end delay and reliability. Extensive simulation experiments were performed to evaluate the efficiency of the proposed algorithm using the NS-2 simulator. Simulation results show that our proposed algorithm provides significant improvement in terms of energy consumption, number of packets forwarded, end to end delay and packet delivery ratio compared to the existing routing protocol. PMID:26771586

Localization Algorithm with On-line Path Loss Estimation and Node Selection

PubMed Central

Bel, Albert; Vicario, José López; Seco-Granados, Gonzalo

2011-01-01

RSS-based localization is considered a low-complexity algorithm with respect to other range techniques such as TOA or AOA. The accuracy of RSS methods depends on the suitability of the propagation models used for the actual propagation conditions. In indoor environments, in particular, it is very difficult to obtain a good propagation model. For that reason, we present a cooperative localization algorithm that dynamically estimates the path loss exponent by using RSS measurements. Since the energy consumption is a key point in sensor networks, we propose a node selection mechanism to limit the number of neighbours of a given node that are used for positioning purposes. Moreover, the selection mechanism is also useful to discard bad links that could negatively affect the performance accuracy. As a result, we derive a practical solution tailored to the strict requirements of sensor networks in terms of complexity, size and cost. We present results based on both computer simulations and real experiments with the Crossbow MICA2 motes showing that the proposed scheme offers a good trade-off in terms of position accuracy and energy efficiency. PMID:22163992

Path scheduling for multiple mobile actors in wireless sensor network

NASA Astrophysics Data System (ADS)

Trapasiya, Samir D.; Soni, Himanshu B.

2017-05-01

In wireless sensor network (WSN), energy is the main constraint. In this work we have addressed this issue for single as well as multiple mobile sensor actor network. In this work, we have proposed Rendezvous Point Selection Scheme (RPSS) in which Rendezvous Nodes are selected by set covering problem approach and from that, Rendezvous Points are selected in a way to reduce the tour length. The mobile actors tour is scheduled to pass through those Rendezvous Points as per Travelling Salesman Problem (TSP). We have also proposed novel rendezvous node rotation scheme for fair utilisation of all the nodes. We have compared RPSS with Stationery Actor scheme as well as RD-VT, RD-VT-SMT and WRP-SMT for performance metrics like energy consumption, network lifetime, route length and found the better outcome in all the cases for single actor. We have also applied RPSS for multiple mobile actor case like Multi-Actor Single Depot (MASD) termination and Multi-Actor Multiple Depot (MAMD) termination and observed by extensive simulation that MAMD saves the network energy in optimised way and enhance network lifetime compared to all other schemes.

A Distributed Data-Gathering Protocol Using AUV in Underwater Sensor Networks.

PubMed

Khan, Jawaad Ullah; Cho, Ho-Shin

2015-08-06

In this paper, we propose a distributed data-gathering scheme using an autonomous underwater vehicle (AUV) working as a mobile sink to gather data from a randomly distributed underwater sensor network where sensor nodes are clustered around several cluster headers. Unlike conventional data-gathering schemes where the AUV visits either every node or every cluster header, the proposed scheme allows the AUV to visit some selected nodes named path-nodes in a way that reduces the overall transmission power of the sensor nodes. Monte Carlo simulations are performed to investigate the performance of the proposed scheme compared with several preexisting techniques employing the AUV in terms of total amount of energy consumption, standard deviation of each node's energy consumption, latency to gather data at a sink, and controlling overhead. Simulation results show that the proposed scheme not only reduces the total energy consumption but also distributes the energy consumption more uniformly over the network, thereby increasing the lifetime of the network.

Use of sentinel lymph node biopsy to select patients for local–regional therapy after neoadjuvant chemotherapy

PubMed Central

Erdahl, Lillian M.; Boughey, Judy C.

2014-01-01

Use of sentinel lymph node biopsy for axillary staging of patients with breast cancer treated with neoadjuvant chemotherapy has been widely debated. Questions arise regarding the accuracy of sentinel lymph node biopsy in axillary staging for these patients and its use to determine further local–regional therapy, including surgery and radiation therapy. For patients who are clinically node-negative at presentation, sentinel lymph node biopsy enables accurate staging of the axilla after neoadjuvant chemotherapy, and determination of which patients should go on to further axillary surgery and regional nodal radiation therapy. Importantly, performing axillary staging after completion of chemotherapy, rather than before chemotherapy, enables assessment of response to chemotherapy and the extent of residual disease. This information can assist the planning of adjuvant treatment. Recent data indicate that sentinel node biopsy can also be used to assess disease response after neoadjuvant chemotherapy for patients with clinical N1 disease at presentation. PMID:24683440

An improved PRoPHET routing protocol in delay tolerant network.

PubMed

Han, Seung Deok; Chung, Yun Won

2015-01-01

In delay tolerant network (DTN), an end-to-end path is not guaranteed and packets are delivered from a source node to a destination node via store-carry-forward based routing. In DTN, a source node or an intermediate node stores packets in buffer and carries them while it moves around. These packets are forwarded to other nodes based on predefined criteria and finally are delivered to a destination node via multiple hops. In this paper, we improve the dissemination speed of PRoPHET (probability routing protocol using history of encounters and transitivity) protocol by employing epidemic protocol for disseminating message m, if forwarding counter and hop counter values are smaller than or equal to the threshold values. The performance of the proposed protocol was analyzed from the aspect of delivery probability, average delay, and overhead ratio. Numerical results show that the proposed protocol can improve the delivery probability, average delay, and overhead ratio of PRoPHET protocol by appropriately selecting the threshold forwarding counter and threshold hop counter values.

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

Yang, Dr. Li; Cui, Xiaohui; Cemerlic, Alma

Ad hoc networks are very helpful in situations when no fixed network infrastructure is available, such as natural disasters and military conflicts. In such a network, all wireless nodes are equal peers simultaneously serving as both senders and routers for other nodes. Therefore, how to route packets through reliable paths becomes a fundamental problems when behaviors of certain nodes deviate from wireless ad hoc routing protocols. We proposed a novel Dirichlet reputation model based on Bayesian inference theory which evaluates reliability of each node in terms of packet delivery. Our system offers a way to predict and select a reliablemore » path through combination of first-hand observation and second-hand reputation reports. We also proposed moving window mechanism which helps to adjust ours responsiveness of our system to changes of node behaviors. We integrated the Dirichlet reputation into routing protocol of wireless ad hoc networks. Our extensive simulation indicates that our proposed reputation system can improve good throughput of the network and reduce negative impacts caused by misbehaving nodes.« less

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.

A Collaborative Secure Localization Algorithm Based on Trust Model in Underwater Wireless Sensor Networks

PubMed Central

Han, Guangjie; Liu, Li; Jiang, Jinfang; Shu, Lei; Rodrigues, Joel J.P.C.

2016-01-01

Localization is one of the hottest research topics in Underwater Wireless Sensor Networks (UWSNs), since many important applications of UWSNs, e.g., event sensing, target tracking and monitoring, require location information of sensor nodes. Nowadays, a large number of localization algorithms have been proposed for UWSNs. How to improve location accuracy are well studied. However, few of them take location reliability or security into consideration. In this paper, we propose a Collaborative Secure Localization algorithm based on Trust model (CSLT) for UWSNs to ensure location security. Based on the trust model, the secure localization process can be divided into the following five sub-processes: trust evaluation of anchor nodes, initial localization of unknown nodes, trust evaluation of reference nodes, selection of reference node, and secondary localization of unknown node. Simulation results demonstrate that the proposed CSLT algorithm performs better than the compared related works in terms of location security, average localization accuracy and localization ratio. PMID:26891300

Lymph node detection in IASLC-defined zones on PET/CT images

NASA Astrophysics Data System (ADS)

Song, Yihua; Udupa, Jayaram K.; Odhner, Dewey; Tong, Yubing; Torigian, Drew A.

2016-03-01

Lymph node detection is challenging due to the low contrast between lymph nodes as well as surrounding soft tissues and the variation in nodal size and shape. In this paper, we propose several novel ideas which are combined into a system to operate on positron emission tomography/ computed tomography (PET/CT) images to detect abnormal thoracic nodes. First, our previous Automatic Anatomy Recognition (AAR) approach is modified where lymph node zones predominantly following International Association for the Study of Lung Cancer (IASLC) specifications are modeled as objects arranged in a hierarchy along with key anatomic anchor objects. This fuzzy anatomy model built from diagnostic CT images is then deployed on PET/CT images for automatically recognizing the zones. A novel globular filter (g-filter) to detect blob-like objects over a specified range of sizes is designed to detect the most likely locations and sizes of diseased nodes. Abnormal nodes within each automatically localized zone are subsequently detected via combined use of different items of information at various scales: lymph node zone model poses found at recognition indicating the geographic layout at the global level of node clusters, g-filter response which hones in on and carefully selects node-like globular objects at the node level, and CT and PET gray value but within only the most plausible nodal regions for node presence at the voxel level. The models are built from 25 diagnostic CT scans and refined for an object hierarchy based on a separate set of 20 diagnostic CT scans. Node detection is tested on an additional set of 20 PET/CT scans. Our preliminary results indicate node detection sensitivity and specificity at around 90% and 85%, respectively.

Selection dynamic of Escherichia coli host in M13 combinatorial peptide phage display libraries.

PubMed

Zanconato, Stefano; Minervini, Giovanni; Poli, Irene; De Lucrezia, Davide

2011-01-01

Phage display relies on an iterative cycle of selection and amplification of random combinatorial libraries to enrich the initial population of those peptides that satisfy a priori chosen criteria. The effectiveness of any phage display protocol depends directly on library amino acid sequence diversity and the strength of the selection procedure. In this study we monitored the dynamics of the selective pressure exerted by the host organism on a random peptide library in the absence of any additional selection pressure. The results indicate that sequence censorship exerted by Escherichia coli dramatically reduces library diversity and can significantly impair phage display effectiveness.

Real-time graphics for the Space Station Freedom cupola, developed in the Systems Engineering Simulator

NASA Technical Reports Server (NTRS)

Red, Michael T.; Hess, Philip W.

1989-01-01

Among the Lyndon B. Johnson Space Center's responsibilities for Space Station Freedom is the cupola. Attached to the resource node, the cupola is a windowed structure that will serve as the space station's secondary control center. From the cupola, operations involving the mobile service center and orbital maneuvering vehicle will be conducted. The Systems Engineering Simulator (SES), located in building 16, activated a real-time man-in-the-loop cupola simulator in November 1987. The SES cupola is an engineering tool with the flexibility to evolve in both hardware and software as the final cupola design matures. Two workstations are simulated with closed-circuit television monitors, rotational and translational hand controllers, programmable display pushbuttons, and graphics display with trackball and keyboard. The displays and controls of the SES cupola are driven by a Silicon Graphics Integrated Raster Imaging System (IRIS) 4D/70 GT computer. Through the use of an interactive display builder program, SES, cupola display pages consisting of two dimensional and three dimensional graphics are constructed. These display pages interact with the SES via the IRIS real-time graphics interface. The focus is on the real-time graphics interface applications software developed on the IRIS.

[Spatial domain display for interference image dataset].

PubMed

Wang, Cai-Ling; Li, Yu-Shan; Liu, Xue-Bin; Hu, Bing-Liang; Jing, Juan-Juan; Wen, Jia

2011-11-01

The requirements of imaging interferometer visualization is imminent for the user of image interpretation and information extraction. However, the conventional researches on visualization only focus on the spectral image dataset in spectral domain. Hence, the quick show of interference spectral image dataset display is one of the nodes in interference image processing. The conventional visualization of interference dataset chooses classical spectral image dataset display method after Fourier transformation. In the present paper, the problem of quick view of interferometer imager in image domain is addressed and the algorithm is proposed which simplifies the matter. The Fourier transformation is an obstacle since its computation time is very large and the complexion would be even deteriorated with the size of dataset increasing. The algorithm proposed, named interference weighted envelopes, makes the dataset divorced from transformation. The authors choose three interference weighted envelopes respectively based on the Fourier transformation, features of interference data and human visual system. After comparing the proposed with the conventional methods, the results show the huge difference in display time.

Exploring virtual reality technology and the Oculus Rift for the examination of digital pathology slides.

PubMed

Farahani, Navid; Post, Robert; Duboy, Jon; Ahmed, Ishtiaque; Kolowitz, Brian J; Krinchai, Teppituk; Monaco, Sara E; Fine, Jeffrey L; Hartman, Douglas J; Pantanowitz, Liron

2016-01-01

Digital slides obtained from whole slide imaging (WSI) platforms are typically viewed in two dimensions using desktop personal computer monitors or more recently on mobile devices. To the best of our knowledge, we are not aware of any studies viewing digital pathology slides in a virtual reality (VR) environment. VR technology enables users to be artificially immersed in and interact with a computer-simulated world. Oculus Rift is among the world's first consumer-targeted VR headsets, intended primarily for enhanced gaming. Our aim was to explore the use of the Oculus Rift for examining digital pathology slides in a VR environment. An Oculus Rift Development Kit 2 (DK2) was connected to a 64-bit computer running Virtual Desktop software. Glass slides from twenty randomly selected lymph node cases (ten with benign and ten malignant diagnoses) were digitized using a WSI scanner. Three pathologists reviewed these digital slides on a 27-inch 5K display and with the Oculus Rift after a 2-week washout period. Recorded endpoints included concordance of final diagnoses and time required to examine slides. The pathologists also rated their ease of navigation, image quality, and diagnostic confidence for both modalities. There was 90% diagnostic concordance when reviewing WSI using a 5K display and Oculus Rift. The time required to examine digital pathology slides on the 5K display averaged 39 s (range 10-120 s), compared to 62 s with the Oculus Rift (range 15-270 s). All pathologists confirmed that digital pathology slides were easily viewable in a VR environment. The ratings for image quality and diagnostic confidence were higher when using the 5K display. Using the Oculus Rift DK2 to view and navigate pathology whole slide images in a virtual environment is feasible for diagnostic purposes. However, image resolution using the Oculus Rift device was limited. Interactive VR technologies such as the Oculus Rift are novel tools that may be of use in digital pathology.

Sentinel lymph node biopsy as a prognostic factor in non-metastatic colon cancer: a prospective study.

PubMed

Estrada, O; Pulido, L; Admella, C; Hidalgo, L-A; Clavé, P; Suñol, X

2017-04-01

Around a third of node-negative patients with colon cancer experience a recurrence after surgery, suggesting poor staging. Sentinel lymph node techniques combined with immunochemistry could improve colon cancer staging. We prospectively assessed the effect of Sentinel node mapping on staging and survival in patients with non-metastatic colon cancer. An observational and prospective study was designed. 105 patients with colon cancer were selected. Patients were classified according to node involvement as: N1, with node invasion detected by the conventional techniques; up-staged, with node invasion detected only by sentinel node mapping; and N0, with negative lymph node involvement by both techniques. Five-year survival and disease-free survival rates were analysed. Multivariate regression analyses were performed to identify prognostic factors for disease-free and overall survival. Sentinel node mapping was successfully applied in 78 patients: 33 % were N1; 24.5 % were up-staged (18 patients with isolated tumour cells and 1 patient with micrometastases); and 42.5 % were N0. N1 patients had the poorest overall 5-year survival (65.4 %) and 5-year disease-free survival (69.2 %) rates compared with the other two groups. No significant 5-year survival differences were observed between N0 patients (87.9 %) and up-staged patients (84.2 %). Patients up-staged after sentinel node mapping do not have a poorer prognosis than patients without node involvement. Detection of isolated cancer cells was not a poor prognosis factor in these patients.

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.

Synthesis of a novel polyamidoamine dendrimer conjugating with alkali blue as a lymphatic tracer and study on the lymphatic targeting in vivo.

PubMed

Yang, Rui; Xia, Suxia; Ye, Tiantian; Yao, Jianhua; Zhang, Ruizhi; Wang, Shujun; Wang, Siling

2016-09-01

In this study, a novel lymphatic tracer polyamidoamin-alkali blue (PAMAM-AB) was synthesized in order to evaluate the intra-lymphatic targeting ability and lymphatic tropism of PAMAM-AB after subcutaneous administration. UV-Vis, FT-IR, NMR and HPLC characterization were performed to prove the successful synthesis of PAMAM-AB. The calculated AB payload of PAMAM-AB conjugate was seven per dendrimer molecule (27.16% by weight). Hydrolysis stability of PAMAM-AB in vitro was evaluated, which was stable in PBS and human plasma. Lymphatic tracing were studied to determine the blue-stained intensity of PAMAM-AB in right popliteral lymph nodes (PLNs), iliac lymph nodes (ILNs) and para-aortic lymph nodes (PALNs) after subcutaneous administration. The pharmacokinetics and biodistribution of PAMAM-AB in mice were investigated. PLNs, ILNs and PALNs could be obviously blue-stained within 10 min after PAMAM-AB administration, and displayed a more rapid lymphatic absorption, a higher AUC value in lymph nodes and a longer lymph nodes residence time compared with methylene blue solution (MB-S), MB water-in-oil microemulsion (MB-ME), MB multiple microemulsion (MB-MME). Enhanced lymphatic drainage from the injection site and uptake into lymph of PAMAM-AB indicated that PAMAM-AB possesses the double function of lymphatic tracing and lymphatic targeting, and suggested the potential for the development of lymphatic targeting vectors or as a lymphatic tracer in its own right.

A Novel Risk Stratification to Predict Local-Regional Failures in Urothelial Carcinoma of the Bladder After Radical Cystectomy

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

Baumann, Brian C.; Guzzo, Thomas J.; He Jiwei

2013-01-01

Purpose: Local-regional failures (LF) following radical cystectomy (RC) plus pelvic lymph node dissection (PLND) with or without chemotherapy for invasive urothelial bladder carcinoma are more common than previously reported. Adjuvant radiation therapy (RT) could reduce LF but currently has no defined role because of previously reported morbidity. Modern techniques with improved normal tissue sparing have rekindled interest in RT. We assessed the risk of LF and determined those factors that predict recurrence to facilitate patient selection for future adjuvant RT trials. Methods and Materials: From 1990-2008, 442 patients with urothelial bladder carcinoma at University of Pennsylvania were prospectively followed aftermore » RC plus PLND with or without chemotherapy with routine pelvic computed tomography (CT) or magnetic resonance imaging (MRI). One hundred thirty (29%) patients received chemotherapy. LF was any pelvic failure detected before or within 3 months of distant failure. Competing risk analyses identified factors predicting increased LF risk. Results: On univariate analysis, pathologic stage {>=}pT3, <10 nodes removed, positive margins, positive nodes, hydronephrosis, lymphovascular invasion, and mixed histology significantly predicted LF; node density was marginally predictive, but use of chemotherapy, number of positive nodes, type of surgical diversion, age, gender, race, smoking history, and body mass index were not. On multivariate analysis, only stage {>=}pT3 and <10 nodes removed were significant independent LF predictors with hazard ratios of 3.17 and 2.37, respectively (P<.01). Analysis identified 3 patient subgroups with significantly different LF risks: low-risk ({<=}pT2), intermediate-risk ({>=}pT3 and {>=}10 nodes removed), and high-risk ({>=}pT3 and <10 nodes) with 5-year LF rates of 8%, 23%, and 42%, respectively (P<.01). Conclusions: This series using routine CT and MRI surveillance to detect LF confirms that such failures are relatively common in cases of locally advanced disease and provides a rubric based on pathological stage and number of nodes removed that stratifies patients into 3 groups with significantly different LF risks to simplify patient selection for future adjuvant radiation therapy trials.« less

Optimized scalable network switch

DOEpatents

Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Steinmacher-Burow, Burkhard D [Mount Kisco, NY; Takken, Todd E [Mount Kisco, NY; Vranas, Pavlos M [Bedford Hills, NY

2007-12-04

In a massively parallel computing system having a plurality of nodes configured in m multi-dimensions, each node including a computing device, a method for routing packets towards their destination nodes is provided which includes generating at least one of a 2m plurality of compact bit vectors containing information derived from downstream nodes. A multilevel arbitration process in which downstream information stored in the compact vectors, such as link status information and fullness of downstream buffers, is used to determine a preferred direction and virtual channel for packet transmission. Preferred direction ranges are encoded and virtual channels are selected by examining the plurality of compact bit vectors. This dynamic routing method eliminates the necessity of routing tables, thus enhancing scalability of the switch.

Optimized scalable network switch

DOEpatents

Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.

2010-02-23

In a massively parallel computing system having a plurality of nodes configured in m multi-dimensions, each node including a computing device, a method for routing packets towards their destination nodes is provided which includes generating at least one of a 2m plurality of compact bit vectors containing information derived from downstream nodes. A multilevel arbitration process in which downstream information stored in the compact vectors, such as link status information and fullness of downstream buffers, is used to determine a preferred direction and virtual channel for packet transmission. Preferred direction ranges are encoded and virtual channels are selected by examining the plurality of compact bit vectors. This dynamic routing method eliminates the necessity of routing tables, thus enhancing scalability of the switch.

Browsing schematics: Query-filtered graphs with context nodes

NASA Technical Reports Server (NTRS)

Ciccarelli, Eugene C.; Nardi, Bonnie A.

1988-01-01

The early results of a research project to create tools for building interfaces to intelligent systems on the NASA Space Station are reported. One such tool is the Schematic Browser which helps users engaged in engineering problem solving find and select schematics from among a large set. Users query for schematics with certain components, and the Schematic Browser presents a graph whose nodes represent the schematics with those components. The query greatly reduces the number of choices presented to the user, filtering the graph to a manageable size. Users can reformulate and refine the query serially until they locate the schematics of interest. To help users maintain orientation as they navigate a large body of data, the graph also includes nodes that are not matches but provide global and local context for the matching nodes. Context nodes include landmarks, ancestors, siblings, children and previous matches.

Phylogenetic incongruence in the Drosophila melanogaster species group

PubMed Central

Wong, Alex; Jensen, Jeffrey D.; Pool, John E.; Aquadro, Charles F.

2007-01-01

Drosophila melanogaster and its close relatives are used extensively in comparative biology. Despite the importance of phylogenetic information for such studies, relationships between some melanogaster species group members are unclear due to conflicting phylogenetic signals at different loci. In this study, we use twelve nuclear loci (eleven coding and one non-coding) to assess the degree of phylogenetic incongruence in this model system. We focus on two nodes: (1) The node joining the D. erecta-D. orena, D. melanogaster-D. simulans, and D. yakuba-D. teissieri lineages, and (2) The node joining the lineages leading to the melanogaster, takahashii, and eugracilis subgroups. We find limited evidence for incongruence at the first node; our data, as well as those of several previous studies, strongly support monophyly of a clade consisting of D. erecta-D. orena and D. yakuba-D. teissieri. By contrast, using likelihood based tests of congruence, we find robust evidence for topological incongruence at the second node. Different loci support different relationships among the melanogaster, takahashii and eugracilis subgroups, and the observed incongruence is not easily attributable to homoplasy, non-equilibrium base composition, or positive selection on a subset of loci. We argue that lineage sorting in the common ancestor of these three subgroups is the most plausible explanation for our observations. Such lineage sorting may lead to biased estimation of tree topology and evolutionary rates, and may confound inferences of positive selection. PMID:17071113

Data management routines for reproducible research using the G-Node Python Client library

PubMed Central

Sobolev, Andrey; Stoewer, Adrian; Pereira, Michael; Kellner, Christian J.; Garbers, Christian; Rautenberg, Philipp L.; Wachtler, Thomas

2014-01-01

Structured, efficient, and secure storage of experimental data and associated meta-information constitutes one of the most pressing technical challenges in modern neuroscience, and does so particularly in electrophysiology. The German INCF Node aims to provide open-source solutions for this domain that support the scientific data management and analysis workflow, and thus facilitate future data access and reproducible research. G-Node provides a data management system, accessible through an application interface, that is based on a combination of standardized data representation and flexible data annotation to account for the variety of experimental paradigms in electrophysiology. The G-Node Python Library exposes these services to the Python environment, enabling researchers to organize and access their experimental data using their familiar tools while gaining the advantages that a centralized storage entails. The library provides powerful query features, including data slicing and selection by metadata, as well as fine-grained permission control for collaboration and data sharing. Here we demonstrate key actions in working with experimental neuroscience data, such as building a metadata structure, organizing recorded data in datasets, annotating data, or selecting data regions of interest, that can be automated to large degree using the library. Compliant with existing de-facto standards, the G-Node Python Library is compatible with many Python tools in the field of neurophysiology and thus enables seamless integration of data organization into the scientific data workflow. PMID:24634654

Data management routines for reproducible research using the G-Node Python Client library.

PubMed

Sobolev, Andrey; Stoewer, Adrian; Pereira, Michael; Kellner, Christian J; Garbers, Christian; Rautenberg, Philipp L; Wachtler, Thomas

2014-01-01

Structured, efficient, and secure storage of experimental data and associated meta-information constitutes one of the most pressing technical challenges in modern neuroscience, and does so particularly in electrophysiology. The German INCF Node aims to provide open-source solutions for this domain that support the scientific data management and analysis workflow, and thus facilitate future data access and reproducible research. G-Node provides a data management system, accessible through an application interface, that is based on a combination of standardized data representation and flexible data annotation to account for the variety of experimental paradigms in electrophysiology. The G-Node Python Library exposes these services to the Python environment, enabling researchers to organize and access their experimental data using their familiar tools while gaining the advantages that a centralized storage entails. The library provides powerful query features, including data slicing and selection by metadata, as well as fine-grained permission control for collaboration and data sharing. Here we demonstrate key actions in working with experimental neuroscience data, such as building a metadata structure, organizing recorded data in datasets, annotating data, or selecting data regions of interest, that can be automated to large degree using the library. Compliant with existing de-facto standards, the G-Node Python Library is compatible with many Python tools in the field of neurophysiology and thus enables seamless integration of data organization into the scientific data workflow.

PHACK: An Efficient Scheme for Selective Forwarding Attack Detection in WSNs

PubMed Central

Liu, Anfeng; Dong, Mianxiong; Ota, Kaoru; Long, Jun

2015-01-01

In this paper, a Per-Hop Acknowledgement (PHACK)-based scheme is proposed for each packet transmission to detect selective forwarding attacks. In our scheme, the sink and each node along the forwarding path generate an acknowledgement (ACK) message for each received packet to confirm the normal packet transmission. The scheme, in which each ACK is returned to the source node along a different routing path, can significantly increase the resilience against attacks because it prevents an attacker from compromising nodes in the return routing path, which can otherwise interrupt the return of nodes’ ACK packets. For this case, the PHACK scheme also has better potential to detect abnormal packet loss and identify suspect nodes as well as better resilience against attacks. Another pivotal issue is the network lifetime of the PHACK scheme, as it generates more acknowledgements than previous ACK-based schemes. We demonstrate that the network lifetime of the PHACK scheme is not lower than that of other ACK-based schemes because the scheme just increases the energy consumption in non-hotspot areas and does not increase the energy consumption in hotspot areas. Moreover, the PHACK scheme greatly simplifies the protocol and is easy to implement. Both theoretical and simulation results are given to demonstrate the effectiveness of the proposed scheme in terms of high detection probability and the ability to identify suspect nodes. PMID:26690178

Efficacy of Sentinel Lymph Node Biopsy in Detecting Axillary Metastasis in Breast Cancer Using Methylene Blue.

PubMed

Nandu, Vipul V; Chaudhari, Milind S

2017-06-01

Breast cancer is the leading malignancy and the second leading cause of cancer-related deaths. Axillary lymph node status is a very important prognostic factor in breast cancer patients; nodal evaluation is therefore a critical part of breast cancer management. Axillary lymph node dissection results in significant morbidity. Sentinel lymph node biopsy (SLNB) is being used in many centers to stage the axilla in planning axillary dissection management of patients and hence plays an important part in reducing morbidity among patients with carcinoma breast. The objectives of this paper is to study the (1) efficacy of sentinel lymph node biopsy in detecting axillary metastasis, (2) location of sentinel lymph node in the axilla, (3) rate of involvement of sentinel lymph nodes, and (4) incidence of skip metastasis. Thirty-five patients with breast cancer with clinically node-negative axilla were selected for the study. Methylene blue dye was injected intralesional and perilesional 20 min prior to surgery. All patients underwent modified radical mastectomy with sentinel lymph node biopsy and axillary dissection and after pathological examination diagnostic statics, namely sensitivity, specificity, positive predictive value (PPV), negative predictive value (NPV), and accuracy were computed. Sentinel lymph node was identified in all of these patients. Sixty percent patients had pathologically positive lymph nodes in the axilla. 90.48% patients of these had sentinel lymph nodes positive for malignant cells. Incidence of skip metastasis is 9.52%. 88.57% patients had sentinel lymph node mapped to level I lymph nodes. Sensitivity of SLNB is 90.48%, specificity is 85.71%, PPV of is 90.48%, NPV is 85.71%, and accuracy is 88.57%. Sentinel lymph node biopsy is an effective method of staging the axilla and deciding on axillary clearance in patients of carcinoma breast. Unnecessary axillary dissection and associated complications can be prevented in most of patients due to sentinel lymph node biopsy.

Eukaryotic ribosome display with in situ DNA recovery.

PubMed

He, Mingyue; Edwards, Bryan M; Kastelic, Damjana; Taussig, Michael J

2012-01-01

Ribosome display is a cell-free display technology for in vitro selection and optimisation of proteins from large diversified libraries. It operates through the formation of stable protein-ribosome-mRNA (PRM) complexes and selection of ligand-binding proteins, followed by DNA recovery from the selected genetic information. Both prokaryotic and eukaryotic ribosome display systems have been developed. In this chapter, we describe the eukaryotic rabbit reticulocyte method in which a distinct in situ single-primer RT-PCR procedure is used to recover DNA from the selected PRM complexes without the need for prior disruption of the ribosome.

Masked Proportional Routing

NASA Technical Reports Server (NTRS)

Wolpert, David H. (Inventor)

2003-01-01

Distributed approach for determining a path connecting adjacent network nodes, for probabilistically or deterministically transporting an entity, with entity characteristic mu from a source node to a destination node. Each node i is directly connected to an arbitrary number J(mu) of nodes, labeled or numbered j=jl, j2, .... jJ(mu). In a deterministic version, a J(mu)-component baseline proportion vector p(i;mu) is associated with node i. A J(mu)-component applied proportion vector p*(i;mu) is determined from p(i;mu) to preclude an entity visiting a node more than once. Third and fourth J(mu)-component vectors, with components iteratively determined by Target(i;n(mu);mu),=alpha(mu).Target(i;n(mu)-1;mu)j+beta(mu).p* (i;mu)j and Actual(i;n(mu);+a(mu)j. Actual(i;n(mu)-l;mu)j+beta(mu).Sent(i;j'(mu);n(mu)-1;mu)j, are computed, where n(mu) is an entity sequence index and alpha(mu) and beta(mu) are selected numbers. In one embodiment, at each node i, the node j=j'(mu) with the largest vector component difference, Target(i;n(mu);mu)j'- Actual (i;n(mu);mu)j'. is chosen for the next link for entity transport, except in special gap circumstances, where the same link is optionally used for transporting consecutively arriving entities. The network nodes may be computer-controlled routers that switch collections of packets, frames, cells or other information units. Alternatively, the nodes may be waypoints for movement of physical items in a network or for transformation of a physical item. The nodes may be states of an entity undergoing state transitions, where allowed transitions are specified by the network and/or the destination node.

Modeling Environmental Impacts on Cognitive Performance for Artificially Intelligent Entities

DTIC Science & Technology

2017-06-01

of the agent behavior model is presented in a military-relevant virtual game environment. We then outline a quantitative approach to test the agent...relevant virtual game environment. We then outline a quantitative approach to test the agent behavior model within the virtual environment. Results show...x Game View of Hot Environment Condition Displaying Total “f” Cost for Each Searched Waypoint Node

Tradespace and Affordability - Phase 2

DTIC Science & Technology

2013-12-31

infrastructure capacity. Figure 15 locates the thirteen feasible configurations in survivability- mobility capability space (capability levels are scaled...battery power, or display size decreases. Other quantities may be applicable, such as the number of nodes in a scalable-up mobile network or the...limited size of a scalable-down mobile platform. Versatility involves the range of capabilities provided by a system as it is currently configured. A

Through their eyes: selective attention in peahens during courtship

PubMed Central

Yorzinski, Jessica L.; Patricelli, Gail L.; Babcock, Jason S.; Pearson, John M.; Platt, Michael L.

2013-01-01

SUMMARY Conspicuous, multicomponent ornamentation in male animals can be favored by female mate choice but we know little about the cognitive processes females use to evaluate these traits. Sexual selection may favor attention mechanisms allowing the choosing females to selectively and efficiently acquire relevant information from complex male display traits and, in turn, may favor male display traits that effectively capture and hold female attention. Using a miniaturized telemetric gaze-tracker, we show that peahens (Pavo cristatus) selectively attend to specific components of peacock courtship displays and virtually ignore other, highly conspicuous components. Females gazed at the lower train but largely ignored the head, crest and upper train. When the lower train was obscured, however, females spent more time gazing at the upper train and approached the upper train from a distance. Our results suggest that peahens mainly evaluate the lower train during close-up courtship but use the upper train as a long-distance attraction signal. Furthermore, we found that behavioral display components (train rattling and wing shaking) captured and maintained female attention, indicating that interactions between display components may promote the evolution of multicomponent displays. Taken together, these findings suggest that selective attention plays a crucial role in sexual selection and likely influences the evolution of male display traits. PMID:23885088

Expanding the versatility of phage display II: improved affinity selection of folded domains on protein VII and IX of the filamentous phage.

PubMed

Løset, Geir Åge; Roos, Norbert; Bogen, Bjarne; Sandlie, Inger

2011-02-24

Phage display is a leading technology for selection of binders with affinity for specific target molecules. Polypeptides are normally displayed as fusions to the major coat protein VIII (pVIII) or the minor coat protein III (pIII). Whereas pVIII display suffers from drawbacks such as heterogeneity in display levels and polypeptide fusion size limitations, toxicity and infection interference effects have been described for pIII display. Thus, display on other coat proteins such as pVII or pIX might be more attractive. Neither pVII nor pIX display have gained widespread use or been characterized in detail like pIII and pVIII display. Here we present a side-by-side comparison of display on pIII with display on pVII and pIX. Polypeptides of interest (POIs) are fused to pVII or pIX. The N-terminal periplasmic signal sequence, which is required for phage integration of pIII and pVIII and that has been added to pVII and pIX in earlier studies, is omitted altogether. Although the POI display level on pIII is higher than on pVII and pIX, affinity selection with pVII and pIX display libraries is shown to be particularly efficient. Display through pVII and/or pIX represent platforms with characteristics that differ from those of the pIII platform. We have explored this to increase the performance and expand the use of phage display. In the paper, we describe effective affinity selection of folded domains displayed on pVII or pIX. This makes both platforms more attractive alternatives to conventional pIII and pVIII display than they were before.

Engineering dihydropteroate synthase (DHPS) for efficient expression on M13 phage.

PubMed

Brockmann, Eeva-Christine; Lamminmäki, Urpo; Saviranta, Petri

2005-06-20

Phage display is a commonly used selection technique in protein engineering, but not all proteins can be expressed on phage. Here, we describe the expression of a cytoplasmic homodimeric enzyme dihydropteroate synthetase (DHPS) on M13 phage, established by protein engineering of DHPS. The strategy included replacement of cysteine residues and screening for periplasmic expression followed by random mutagenesis and phage display selection with a conformation-specific anti-DHPS antibody. Cysteine replacement alone resulted in a 12-fold improvement in phage display of DHPS, but after random mutagenesis and three rounds of phage display selection, phage display efficiency of the library had improved 280-fold. Most of the selected clones had a common Asp96Asn mutation that was largely responsible for the efficient phage display of DHPS. Asp96Asn affected synergistically with the cysteine replacing mutations that were needed to remove the denaturing effect of potential wrong disulfide bridging in phage display. Asp96Asn alone resulted in a 1.8-fold improvement in phage display efficiency, but in combination with the cysteine replacing mutations, a total of 130-fold improvement in phage display efficiency of DHPS was achieved.

Leukaemia Evoked with 7,8,12-Trimethylbenz(a)Anthracene in Rat. III. Changes in Lymphoid Tissues

PubMed Central

Bird, C. C.; Mainzer, K.

1972-01-01

Profound changes in the level of certain dehydrogenase enzymes were observed in lymphoid tissues of rats involved by erythroblastic stem cell leukaemia. In lymphoid tissues free of leukaemic involvement, activity of malate dehydrogenase (MDH) always exceeded that of lactate dehydrogenase (LDH). In those which contained substantial infiltrates of leukaemic cells, activity of LDH was increased while MDH activity was reduced. In leukaemic spleen significant changes were observed in the molecular forms of LDH; the proportion of LDH-5 (muscle-type LDH) was greatly increased while the other molecular forms were reduced. The spleen of rats with leukaemia exhibited a marked increase in the normal level of aerobic and anaerobic glycolysis but the rate of respiration was unchanged. The terminal stages of stem cell leukaemia in the rat are characterized by wide-spread leukaemic infiltration of liver and other tissues. Lymph node involvement, however, was found to be selective. Coeliac lymph nodes greatly exceeded other lymph node groups in their incidence of leukaemic involvement. It is considered that the selective nature of lymph node involvement in stem cell leukaemia derives from topographical considerations. PMID:5085676

Coinfection and vertical transmission of Brucella and Morbillivirus in a neonatal sperm whale (Physeter macrocephalus) in Hawaii, USA.

PubMed

West, Kristi L; Levine, Gregg; Jacob, Jessica; Jensen, Brenda; Sanchez, Susan; Colegrove, Kathleen; Rotstein, David

2015-01-01

The viral genus Morbillivirus and the bacterial genus Brucella have emerged as important groups of pathogens that are known to affect cetacean health on a global scale, but neither pathogen has previously been reported from endangered sperm whales (Physeter macrocephalus). A female neonate sperm whale stranded alive and died near Laie on the island of Oahu, Hawaii, US, in May of 2011. Congestion of the cerebrum and enlarged lymph nodes were noted on the gross necropsy. Microscopic findings included lymphoid depletion, chronic meningitis, and pneumonia, suggesting an in utero infection. Cerebrum, lung, umbilicus, and select lymph nodes (tracheobronchial and mediastinal) were positive for Brucella by PCR. Brucella sp. was also cultured from the cerebrum and from mediastinal and tracheobronchial lymph nodes. Twelve different tissues were screened for Morbillivirus by reverse-transcriptase (RT)-PCR and select tissues by immunohistochemistry, but only the tracheobronchial lymph node and spleen were positive by RT-PCR. Pathologic findings observed were likely a result of Brucella, but Morbillivirus may have played a key role in immune suppression of the mother and calf. The in utero infection in this individual strongly supports vertical transmission of both pathogens.

[Selective biopsy of the sentinel lymph node in breast cancer: without axillary recurrences after a mean follow-up of 4.5 years].

PubMed

Bañuelos Andrío, Luis; Rodríguez Caravaca, Gil; Argüelles Pintos, Miguel; Mitjavilla Casanova, Mercedes

2014-01-01

To analyze the rate of axillary recurrences (AR) in patients with early breast cancer who had not undergone an axillary node dissection (ALND) because of a negative sentinel lymph node biopsy (SLNB). The study includes 173 patients operated on for breast cancer and selective node biopsy. In 32 patients the SLNB was positive and undergone subsequent ALND. We followed up 141 patients with negative SLNB without LDN, with a median follow up of 55 months (range 74-36). The detection rate of SLN was of 99.42%. After a median follow-up of 4.5 years, there were no axillary recurrences. Two patients developed local recurrence, other two patients developed distant metastases and four patients developed a metachronous tumor. Four patients died, none of them because of breast cancer. The results obtained support the SLNB as an accurate technique in the axillary stratification of patients with breast cancer, offering in the cases of negative SLNB a safe axillary control after 4.5 year follow-up. Copyright © 2013 Elsevier España, S.L.U. and SEMNIM. All rights reserved.

Protein and Antibody Engineering by Phage Display

PubMed Central

Frei, J.C.; Lai, J.R.

2017-01-01

Phage display is an in vitro selection technique that allows for the rapid isolation of proteins with desired properties including increased affinity, specificity, stability, and new enzymatic activity. The power of phage display relies on the phenotype-to-genotype linkage of the protein of interest displayed on the phage surface with the encoding DNA packaged within the phage particle, which allows for selective enrichment of library pools and high-throughput screening of resulting clones. As an in vitro method, the conditions of the binding selection can be tightly controlled. Due to the high-throughput nature, rapidity, and ease of use, phage display is an excellent technological platform for engineering antibody or proteins with enhanced properties. Here, we describe methods for synthesis, selection, and screening of phage libraries with particular emphasis on designing humanizing antibody libraries and combinatorial scanning mutagenesis libraries. We conclude with a brief section on troubleshooting for all stages of the phage display process. PMID:27586328

Selection of stable scFv antibodies by phage display.

PubMed

Brockmann, Eeva-Christine

2012-01-01

ScFv fragments are popular recombinant antibody formats but often suffer from limited stability. Phage display is a powerful tool in antibody engineering and applicable also for stability selection. ScFv variants with improved stability can be selected from large randomly mutated phage displayed libraries with a specific antigen after the unstable variants have been inactivated by heat or GdmCl. Irreversible scFv denaturation, which is a prerequisite for efficient selection, is achieved by combining denaturation with reduction of the intradomain disulfide bonds. Repeated selection cycles of increasing stringency result in enrichment of stabilized scFv fragments. Procedures for constructing a randomly mutated scFv library by error-prone PCR and phage display selection for enrichment of stable scFv antibodies from the library are described here.

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.

Moving target tracking through distributed clustering in directional sensor networks.

PubMed

Enayet, Asma; Razzaque, Md Abdur; Hassan, Mohammad Mehedi; Almogren, Ahmad; Alamri, Atif

2014-12-18

The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works.

Moving Target Tracking through Distributed Clustering in Directional Sensor Networks

PubMed Central

Enayet, Asma; Razzaque, Md. Abdur; Hassan, Mohammad Mehedi; Almogren, Ahmad; Alamri, Atif

2014-01-01

The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works. PMID:25529205

Event Coverage Detection and Event Source Determination in Underwater Wireless Sensor Networks.

PubMed

Zhou, Zhangbing; Xing, Riliang; Duan, Yucong; Zhu, Yueqin; Xiang, Jianming

2015-12-15

With the advent of the Internet of Underwater Things, smart things are deployed in the ocean space and establish underwater wireless sensor networks for the monitoring of vast and dynamic underwater environments. When events are found to have possibly occurred, accurate event coverage should be detected, and potential event sources should be determined for the enactment of prompt and proper responses. To address this challenge, a technique that detects event coverage and determines event sources is developed in this article. Specifically, the occurrence of possible events corresponds to a set of neighboring sensor nodes whose sensory data may deviate from a normal sensing range in a collective fashion. An appropriate sensor node is selected as the relay node for gathering and routing sensory data to sink node(s). When sensory data are collected at sink node(s), the event coverage is detected and represented as a weighted graph, where the vertices in this graph correspond to sensor nodes and the weight specified upon the edges reflects the extent of sensory data deviating from a normal sensing range. Event sources are determined, which correspond to the barycenters in this graph. The results of the experiments show that our technique is more energy efficient, especially when the network topology is relatively steady.

Event Coverage Detection and Event Source Determination in Underwater Wireless Sensor Networks

PubMed Central

Zhou, Zhangbing; Xing, Riliang; Duan, Yucong; Zhu, Yueqin; Xiang, Jianming

2015-01-01

With the advent of the Internet of Underwater Things, smart things are deployed in the ocean space and establish underwater wireless sensor networks for the monitoring of vast and dynamic underwater environments. When events are found to have possibly occurred, accurate event coverage should be detected, and potential event sources should be determined for the enactment of prompt and proper responses. To address this challenge, a technique that detects event coverage and determines event sources is developed in this article. Specifically, the occurrence of possible events corresponds to a set of neighboring sensor nodes whose sensory data may deviate from a normal sensing range in a collective fashion. An appropriate sensor node is selected as the relay node for gathering and routing sensory data to sink node(s). When sensory data are collected at sink node(s), the event coverage is detected and represented as a weighted graph, where the vertices in this graph correspond to sensor nodes and the weight specified upon the edges reflects the extent of sensory data deviating from a normal sensing range. Event sources are determined, which correspond to the barycenters in this graph. The results of the experiments show that our technique is more energy efficient, especially when the network topology is relatively steady. PMID:26694394

Dosimetric evaluation of the feasibility of stereotactic body radiotherapy for primary lung cancer with lobe-specific selective elective nodal irradiation

PubMed Central

Komatsu, Tetsuya; Kunieda, Etsuo; Kitahara, Tadashi; Akiba, Takeshi; Nagao, Ryuta; Fukuzawa, Tsuyoshi

2016-01-01

More than 10% of all patients treated with stereotactic body radiotherapy (SBRT) for primary lung cancer develop regional lymph node recurrence. We evaluated the dosimetric feasibility of SBRT with lobe-specific selective elective nodal irradiation (ENI) on dose–volume histograms. A total of 21 patients were treated with SBRT for Stage I primary lung cancer between January 2010 and June 2012 at our institution. The extents of lobe-specific selective ENI fields were determined with reference to prior surgical reports. The ENI fields included lymph node stations (LNS) 3 + 4 + 11 for the right upper lobe tumors, LNS 7 + 11 for the right middle or lower lobe tumors, LNS 5 + 11 for the left upper lobe tumors, and LNS 7 + 11 for the left lower lobe tumors. A composite plan was generated by combining the ENI plan and the SBRT plan and recalculating for biologically equivalent doses of 2 Gy per fraction, using a linear quadratic model. The V20 of the lung, D1cm3 of the spinal cord, D1cm3 and D10cm3 of the esophagus and D10cm3 of the tracheobronchial wall were evaluated. Of the 21 patients, nine patients (43%) could not fulfill the dose constraints. In all these patients, the distance between the planning target volume (PTV) of ENI (PTVeni) and the PTV of SBRT (PTVsrt) was ≤2.0 cm. Of the three patients who developed regional metastasis, two patients had isolated lymph node failure, and the lymph node metastasis was included within the ENI field. When the distance between the PTVeni and PTVsrt is >2.0 cm, SBRT with selective ENI may therefore dosimetrically feasible. PMID:26566656

Complex behavior in chains of nonlinear oscillators.

PubMed

Alonso, Leandro M

2017-06-01

This article outlines sufficient conditions under which a one-dimensional chain of identical nonlinear oscillators can display complex spatio-temporal behavior. The units are described by phase equations and consist of excitable oscillators. The interactions are local and the network is poised to a critical state by balancing excitation and inhibition locally. The results presented here suggest that in networks composed of many oscillatory units with local interactions, excitability together with balanced interactions is sufficient to give rise to complex emergent features. For values of the parameters where complex behavior occurs, the system also displays a high-dimensional bifurcation where an exponentially large number of equilibria are borne in pairs out of multiple saddle-node bifurcations.

PRay - A graphical user interface for interactive visualization and modification of rayinvr models

NASA Astrophysics Data System (ADS)

Fromm, T.

2016-01-01

PRay is a graphical user interface for interactive displaying and editing of velocity models for seismic refraction. It is optimized for editing rayinvr models but can also be used as a dynamic viewer for ray tracing results from other software. The main features are the graphical editing of nodes and fast adjusting of the display (stations and phases). It can be extended by user-defined shell scripts and links to phase picking software. PRay is open source software written in the scripting language Perl, runs on Unix-like operating systems including Mac OS X and provides a version controlled source code repository for community development (https://sourceforge.net/projects/pray-plot-rayinvr/).

Energy Efficient Real-Time Scheduling Using DPM on Mobile Sensors with a Uniform Multi-Cores

PubMed Central

Kim, Youngmin; Lee, Chan-Gun

2017-01-01

In wireless sensor networks (WSNs), sensor nodes are deployed for collecting and analyzing data. These nodes use limited energy batteries for easy deployment and low cost. The use of limited energy batteries is closely related to the lifetime of the sensor nodes when using wireless sensor networks. Efficient-energy management is important to extending the lifetime of the sensor nodes. Most effort for improving power efficiency in tiny sensor nodes has focused mainly on reducing the power consumed during data transmission. However, recent emergence of sensor nodes equipped with multi-cores strongly requires attention to be given to the problem of reducing power consumption in multi-cores. In this paper, we propose an energy efficient scheduling method for sensor nodes supporting a uniform multi-cores. We extend the proposed T-Ler plane based scheduling for global optimal scheduling of a uniform multi-cores and multi-processors to enable power management using dynamic power management. In the proposed approach, processor selection for a scheduling and mapping method between the tasks and processors is proposed to efficiently utilize dynamic power management. Experiments show the effectiveness of the proposed approach compared to other existing methods. PMID:29240695

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.

Pervasive Radio Mapping of Industrial Environments Using a Virtual Reality Approach

PubMed Central

Nedelcu, Adrian-Valentin; Machedon-Pisu, Mihai; Talaba, Doru

2015-01-01

Wireless communications in industrial environments are seriously affected by reliability and performance issues, due to the multipath nature of obstacles within such environments. Special attention needs to be given to planning a wireless industrial network, so as to find the optimum spatial position for each of the nodes within the network, and especially for key nodes such as gateways or cluster heads. The aim of this paper is to present a pervasive radio mapping system which captures (senses) data regarding the radio spectrum, using low-cost wireless sensor nodes. This data is the input of radio mapping algorithms that generate electromagnetic propagation profiles. Such profiles are used for identifying obstacles within the environment and optimum propagation pathways. With the purpose of further optimizing the radio planning process, the authors propose a novel human-network interaction (HNI) paradigm that uses 3D virtual environments in order to display the radio maps in a natural, easy-to-perceive manner. The results of this approach illustrate its added value to the field of radio resource planning of industrial communication systems. PMID:26167533

Pervasive Radio Mapping of Industrial Environments Using a Virtual Reality Approach.

PubMed

Nedelcu, Adrian-Valentin; Machedon-Pisu, Mihai; Duguleana, Mihai; Talaba, Doru

2015-01-01

Wireless communications in industrial environments are seriously affected by reliability and performance issues, due to the multipath nature of obstacles within such environments. Special attention needs to be given to planning a wireless industrial network, so as to find the optimum spatial position for each of the nodes within the network, and especially for key nodes such as gateways or cluster heads. The aim of this paper is to present a pervasive radio mapping system which captures (senses) data regarding the radio spectrum, using low-cost wireless sensor nodes. This data is the input of radio mapping algorithms that generate electromagnetic propagation profiles. Such profiles are used for identifying obstacles within the environment and optimum propagation pathways. With the purpose of further optimizing the radio planning process, the authors propose a novel human-network interaction (HNI) paradigm that uses 3D virtual environments in order to display the radio maps in a natural, easy-to-perceive manner. The results of this approach illustrate its added value to the field of radio resource planning of industrial communication systems.

Superficial EWSR1-negative undifferentiated small round cell sarcoma with CIC/DUX4 gene fusion: a new variant of Ewing-like tumors with locoregional lymph node metastasis.

PubMed

Machado, Isidro; Cruz, Julia; Lavernia, Javier; Rubio, Luis; Campos, Jorge; Barrios, María; Grison, Camille; Chene, Virginie; Pierron, Gaelle; Delattre, Olivier; Llombart-Bosch, Antonio

2013-12-01

The present study describes a new case of EWSR1-negative undifferentiated sarcoma with CIC/DUX4 gene fusion. This case is similar to tumors described as primitive undifferentiated round cell sarcomas that occur mainly in the trunk and display an aggressive behavior. To our knowledge, this is the first report of such a tumor presenting locoregional lymph node metastasis. In view of previous studies that prove the existence of a particular variant of undifferentiated sarcoma with Ewing-like morphology and CIC/DUX-4 gene fusion, a search for this gene fusion in all undifferentiated round cell sarcomas should be considered if a conclusive diagnosis cannot be reached following other conventional studies. Although additional cases with more extensive follow-up studies are needed, we believe that EWSR1-negative undifferentiated small round cell sarcoma with CIC/DUX4 gene fusion should be added to the list of new sarcoma variants with the possibility of lymph node metastasis.

Spreading dynamics in complex networks

NASA Astrophysics Data System (ADS)

Pei, Sen; Makse, Hernán A.

2013-12-01

Searching for influential spreaders in complex networks is an issue of great significance for applications across various domains, ranging from epidemic control, innovation diffusion, viral marketing, and social movement to idea propagation. In this paper, we first display some of the most important theoretical models that describe spreading processes, and then discuss the problem of locating both the individual and multiple influential spreaders respectively. Recent approaches in these two topics are presented. For the identification of privileged single spreaders, we summarize several widely used centralities, such as degree, betweenness centrality, PageRank, k-shell, etc. We investigate the empirical diffusion data in a large scale online social community—LiveJournal. With this extensive dataset, we find that various measures can convey very distinct information of nodes. Of all the users in the LiveJournal social network, only a small fraction of them are involved in spreading. For the spreading processes in LiveJournal, while degree can locate nodes participating in information diffusion with higher probability, k-shell is more effective in finding nodes with a large influence. Our results should provide useful information for designing efficient spreading strategies in reality.

Tuning the properties of metal–organic framework nodes as supports of single-site iridium catalysts: node modification by atomic layer deposition of aluminium

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

Yang, Dong; Momeni, Mohammad R.; Demir, Hakan

The metal–organic framework NU-1000, with Zr 6-oxo, hydroxo, and aqua nodes, was modified by incorporation of hydroxylated Al(iii) ions by ALD-like chemistry with [Al(CH 3) 2(iso-propoxide)] 2followed by steam (ALD = atomic layer deposition). Al ions were installed to the extent of approximately 7 per node. Single-site iridium diethylene complexes were anchored to the nodes of the modified and unmodified MOFs by reaction with Ir(C 2H 4) 2(acac) (acac = acetylacetonate) and converted to Ir(CO) 2complexes by treatment with CO. Infrared spectra of these supported complexes show that incorporation of Al weakened the electron donor tendency of the MOF. Correspondingly,more » the catalytic activity of the initial supported iridium complexes for ethylene hydrogenation increased, as did the selectivity for ethylene dimerization. The results of density functional theory calculations with a simplified model of the nodes incorporating Al(iii) ions are in qualitative agreement with some catalyst performance data.« less

Review of the role of the sentinel node biopsy in neoadjuvant chemotherapy in women with breast cancer and negative or positive axillary node at diagnosis.

PubMed

Ruano Pérez, R; Rebollo Aguirre, A C; García-Talavera San Miguel, P; Díaz Expósito, R; Vidal-Sicart, S; Cordero García, J M; Carrera Salazar, D; Rioja Martín, M E

The role of the selective sentinel node biopsy (SNB) is increasing in relevance in breast cancer women with indication of neoadjuvant chemotherapy (NAC). The Radiosurgery Working Group of the SEMNIM is aware of the necessity of establishing the need for SNB before or after NAC, and also how to manage patients with axillary node-negative or node-positive. There is sufficient data to assess that the SNB with radioisotope techniques are feasible and safe in all these scenarios. An adequate axilla evaluation prior to surgery and the possibility of marking prior to NAC the nodes infiltrated must be the two main pillars to guarantee the success of the SNB. It has been shown that to incorporate the SNB in breast cancer women with indication of NAC increases the rate of a conservative treatment of the axilla that will be a clear benefit for these patients. Copyright © 2017 Elsevier España, S.L.U. y SEMNIM. All rights reserved.

Concurrent communication among multi-transceiver stations over shared media. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Birk, Yitzhak

1987-01-01

In order to increase a local-area network's throughput beyond a single bus data rate without using dedicated switching nodes, multiple buses and multitransceiver stations are required. The design space of single-hop interconnections is explored among such stations. Interconnections are presented whose throughput can grow quadratically with the number of transmitters and receivers per station. These are referred to as selective broadcast interconnections (SBIs). The performance of various SBIs are studied. A spread-spectrum channel can accommodate several current successful transmission, and a single-transceiver node can thus utilize only a small fraction of the channel capacity. In order to allocate the appropriate fraction of capacity to a busy node, it is proposed to equip it with several transmitters and receivers, thereby turning it into a supernode. Several architectures and operation policies for supernodes are suggested and compared. It is shown that a supernode can significantly outperform a collection of independent conventional nodes with the same total numbers of transmitters and receivers. Packet-radio networks with half-duplex nodes, as well as networks with full-duplex nodes, are considered.

Joint Energy Supply and Routing Path Selection for Rechargeable Wireless Sensor Networks.

PubMed

Tang, Liangrui; Cai, Jinqi; Yan, Jiangyu; Zhou, Zhenyu

2018-06-17

The topic of network lifetime has been attracting much research attention because of its importance in prolonging the standing operation of battery-restricted wireless sensor networks, and the rechargeable wireless sensor network has emerged as a promising solution. In this paper, we propose a joint energy supply and routing path selection algorithm to extend the network lifetime based on an initiative power supply. We develop a two-stage energy replenishment strategy to supplement the energy consumption of nodes as much as possible. Furthermore, the influence of charging factors on the selection of next-hop nodes in data routing is considered. The simulation results show that our algorithm effectively prolong the network lifetime, and different demands of network delay and energy consumption can be obtained by dynamically adjusting parameters.

An Analysis of the Space Transportation System Launch Rate Capability Utilizing Q-GERT Simulation Techniques.

DTIC Science & Technology

1982-12-01

VAPE was modeled to determine this launch rate and to determine the processing times for an Orbiter at VAPe . This informa- 21 tion was then used in the...year (node 79 and activity ?1). ETa are then selected to be sent to either KSC or VAPE (node 80). This decision is made (using Ur 8) on the basis of

Sentinel Lymph Node Dissection to Select Clinically Node-negative Prostate Cancer Patients for Pelvic Radiation Therapy: Effect on Biochemical Recurrence and Systemic Progression

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

Grivas, Nikolaos, E-mail: n.grivas@nki.nl; Wit, Esther; Pos, Floris

Purpose: To assess the efficacy of robotic-assisted laparoscopic sentinel lymph node (SLN) dissection (SLND) to select those patients with prostate cancer (PCa) who would benefit from additional pelvic external beam radiation therapy and long-term androgen deprivation therapy (ADT). Methods and Materials: Radioisotope-guided SLND was performed in 224 clinically node-negative patients scheduled to undergo external beam radiation therapy. Patients with histologically positive SLNs (pN1) were also offered radiation therapy to the pelvic lymph nodes, combined with 3 years of ADT. Biochemical recurrence (BCR), overall survival, and metastasis-free (including pelvic and nonregional lymph nodes) survival (MFS) rates were retrospectively calculated. The Briganti andmore » Kattan nomogram predictions were compared with the observed pN status and BCR. Results: The median prostate-specific antigen (PSA) value was 15.4 ng/mL (interquartile range [IQR] 8-29). A total number of 834 SLNs (median 3 per patient; IQR 2-5) were removed. Nodal metastases were diagnosed in 42% of the patients, with 150 SLNs affected (median 1; IQR 1-2). The 5-year BCR-free and MFS rates for pN0 patients were 67.9% and 87.8%, respectively. The corresponding values for pN1 patients were 43% and 66.6%. The PSA level and number of removed SLNs were independent predictors of BCR and MFS, and pN status was an additional independent predictor of BCR. The 5-year overall survival rate was 97.6% and correlated only with pN status. The predictive accuracy of the Briganti nomogram was 0.665. Patients in the higher quartiles of Kattan nomogram prediction of BCR had better than expected outcomes. The complication rate from SLND was 8.9%. Conclusions: For radioisotope-guided SLND, the high staging accuracy is accompanied by low morbidity. The better than expected outcomes observed in the lower quartiles of BCR prediction suggest a role for SLN biopsy as a potential selection tool for the addition of pelvic radiation therapy and ADT intensification in pN1 patients.« less

Infrared Sensor Readout Design

DTIC Science & Technology

1975-11-01

Line Replaceable Unit LT Level Translator MRT Minimum Resolvable Temperature MTF Modulation Transfer Function PC Printed Circuit SCCCD Surface...reduced, not only will the aliased noise increase, but signal aliasing will also start to occur. Atlbe display level this means that sharp edges could...converted from a quantity ol charge to a voltage- level shift by the action ol the precharge pulse that presets the potential on the output diode node to

Randomized Trial of Asprin as Adjuvant Therapy for Node-Positive Breast Cancer

DTIC Science & Technology

2016-10-01

subject to any penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. PLEASE DO...within the proposed time frame. 15. SUBJECT TERMS Breast cancer, adjuvant treatment, aspirin, randomized controlled trial 16. SECURITY...propose a randomized controlled trial to test that promise. There is compelling epidemiologic, in-vitro, and in-vivo, evidence of aspirin’s potential

A near-infrared fluorescence-based surgical navigation system imaging software for sentinel lymph node detection

NASA Astrophysics Data System (ADS)

Ye, Jinzuo; Chi, Chongwei; Zhang, Shuang; Ma, Xibo; Tian, Jie

2014-02-01

Sentinel lymph node (SLN) in vivo detection is vital in breast cancer surgery. A new near-infrared fluorescence-based surgical navigation system (SNS) imaging software, which has been developed by our research group, is presented for SLN detection surgery in this paper. The software is based on the fluorescence-based surgical navigation hardware system (SNHS) which has been developed in our lab, and is designed specifically for intraoperative imaging and postoperative data analysis. The surgical navigation imaging software consists of the following software modules, which mainly include the control module, the image grabbing module, the real-time display module, the data saving module and the image processing module. And some algorithms have been designed to achieve the performance of the software, for example, the image registration algorithm based on correlation matching. Some of the key features of the software include: setting the control parameters of the SNS; acquiring, display and storing the intraoperative imaging data in real-time automatically; analysis and processing of the saved image data. The developed software has been used to successfully detect the SLNs in 21 cases of breast cancer patients. In the near future, we plan to improve the software performance and it will be extensively used for clinical purpose.

Stable J-aggregation enabled dual photoacoustic and fluorescence nanoparticles for intraoperative cancer imaging

NASA Astrophysics Data System (ADS)

Shakiba, Mojdeh; Ng, Kenneth K.; Huynh, Elizabeth; Chan, Harley; Charron, Danielle M.; Chen, Juan; Muhanna, Nidal; Foster, F. Stuart; Wilson, Brian C.; Zheng, Gang

2016-06-01

J-aggregates display nanoscale optical properties which enable their use in fluorescence and photoacoustic imaging applications. However, control over their optical properties in an in vivo setting is hampered by the conformational lability of the J-aggregate structure in complex biological environments. J-aggregating nanoparticles (JNP) formed by self-assembly of bacteriopheophorbide-lipid (Bchl-lipid) in lipid nanovesicles represents a novel strategy to stabilize J-aggregates for in vivo bioimaging applications. We find that 15 mol% Bchl-lipid embedded within a saturated phospholipid bilayer vesicle was optimal in terms of maximizing Bchl-lipid dye loading, while maintaining a spherical nanoparticle morphology and retaining spectral properties characteristic of J-aggregates. The addition of cholesterol maintains the stability of the J-aggregate absorption band for up to 6 hours in the presence of 90% FBS. In a proof-of-concept experiment, we successfully applied JNPs as a fluorescence contrast agent for real-time intraoperative detection of metastatic lymph nodes in a rabbit head-and-neck cancer model. Lymph node metastasis delineation was further verified by visualizing the JNP within the excised lymph node using photoacoustic imaging. Using JNPs, we demonstrate the possibility of using J-aggregates as fluorescence and photoacoustic contrast agents and may potentially spur the development of other nanomaterials that can stably induce J-aggregation for in vivo cancer bioimaging applications.J-aggregates display nanoscale optical properties which enable their use in fluorescence and photoacoustic imaging applications. However, control over their optical properties in an in vivo setting is hampered by the conformational lability of the J-aggregate structure in complex biological environments. J-aggregating nanoparticles (JNP) formed by self-assembly of bacteriopheophorbide-lipid (Bchl-lipid) in lipid nanovesicles represents a novel strategy to stabilize J-aggregates for in vivo bioimaging applications. We find that 15 mol% Bchl-lipid embedded within a saturated phospholipid bilayer vesicle was optimal in terms of maximizing Bchl-lipid dye loading, while maintaining a spherical nanoparticle morphology and retaining spectral properties characteristic of J-aggregates. The addition of cholesterol maintains the stability of the J-aggregate absorption band for up to 6 hours in the presence of 90% FBS. In a proof-of-concept experiment, we successfully applied JNPs as a fluorescence contrast agent for real-time intraoperative detection of metastatic lymph nodes in a rabbit head-and-neck cancer model. Lymph node metastasis delineation was further verified by visualizing the JNP within the excised lymph node using photoacoustic imaging. Using JNPs, we demonstrate the possibility of using J-aggregates as fluorescence and photoacoustic contrast agents and may potentially spur the development of other nanomaterials that can stably induce J-aggregation for in vivo cancer bioimaging applications. Electronic supplementary information (ESI) available. See DOI: 10.1039/C5NR08165C

Optimization of pressure gauge locations for water distribution systems using entropy theory.

PubMed

Yoo, Do Guen; Chang, Dong Eil; Jun, Hwandon; Kim, Joong Hoon

2012-12-01

It is essential to select the optimal pressure gauge location for effective management and maintenance of water distribution systems. This study proposes an objective and quantified standard for selecting the optimal pressure gauge location by defining the pressure change at other nodes as a result of demand change at a specific node using entropy theory. Two cases are considered in terms of demand change: that in which demand at all nodes shows peak load by using a peak factor and that comprising the demand change of the normal distribution whose average is the base demand. The actual pressure change pattern is determined by using the emitter function of EPANET to reflect the pressure that changes practically at each node. The optimal pressure gauge location is determined by prioritizing the node that processes the largest amount of information it gives to (giving entropy) and receives from (receiving entropy) the whole system according to the entropy standard. The suggested model is applied to one virtual and one real pipe network, and the optimal pressure gauge location combination is calculated by implementing the sensitivity analysis based on the study results. These analysis results support the following two conclusions. Firstly, the installation priority of the pressure gauge in water distribution networks can be determined with a more objective standard through the entropy theory. Secondly, the model can be used as an efficient decision-making guide for gauge installation in water distribution systems.

Portable widefield imaging device for ICG-detection of the sentinel lymph node

NASA Astrophysics Data System (ADS)

Govone, Angelo Biasi; Gómez-García, Pablo Aurelio; Carvalho, André Lopes; Capuzzo, Renato de Castro; Magalhães, Daniel Varela; Kurachi, Cristina

2015-06-01

Metastasis is one of the major cancer complications, since the malignant cells detach from the primary tumor and reaches other organs or tissues. The sentinel lymph node (SLN) is the first lymphatic structure to be affected by the malignant cells, but its location is still a great challenge for the medical team. This occurs due to the fact that the lymph nodes are located between the muscle fibers, making it visualization difficult. Seeking to aid the surgeon in the detection of the SLN, the present study aims to develop a widefield fluorescence imaging device using the indocyanine green as fluorescence marker. The system is basically composed of a 780nm illumination unit, optical components for 810nm fluorescence detection, two CCD cameras, a laptop, and dedicated software. The illumination unit has 16 diode lasers. A dichroic mirror and bandpass filters select and deliver the excitation light to the interrogated tissue, and select and deliver the fluorescence light to the camera. One camera is responsible for the acquisition of visible light and the other one for the acquisition of the ICG fluorescence. The software developed at the LabVIEW® platform generates a real time merged image where it is possible to observe the fluorescence spots, related to the lymph nodes, superimposed at the image under white light. The system was tested in a mice model, and a first patient with tongue cancer was imaged. Both results showed the potential use of the presented fluorescence imaging system assembled for sentinel lymph node detection.

Mechanism for generation of left isomerism in Ccdc40 mutant embryos

PubMed Central

Sugrue, Kelsey F.

2017-01-01

Leftward fluid flow in the mouse node is generated by cilia and is critical for initiating asymmetry of the left-right axis. Coiled-coil domain containing-40 (Ccdc40) plays an evolutionarily conserved role in the assembly of motile cilia and establishment of the left-right axis. Approximately one-third of Ccdc40lnks mutant embryos display situs defects and here we investigate the underlying mechanism. Ccdc40lnks mutants show delayed induction of markers of the left-lateral plate mesoderm (L-LPM) including Lefty1, Lefty2 and Nodal. Consistent with defective cilia motility compromising fluid flow across the node, initiation of asymmetric perinodal Cerberus like-2 (Cerl2) expression is delayed and then randomized. This is followed by delayed and then randomized asymmetric Nodal expression around the node. We propose a model to explain how left isomerism arises in a proportion of Ccdc40lnks mutants. We postulate that with defective motile cilia, Cerl2 expression remains symmetric and Nodal is antagonized equally on both sides of the node. This effectively reduces Nodal activation bilaterally, leading to reduced and delayed activation of Nodal and its antagonists in the LPM. This model is further supported by the failure to establish Nodal expression in the left-LPM with reduced Nodal gene dosage in Ccdc40lnks/lnks;NodalLacZ/+ mutants causing a predominance of right not left isomerism. Together these results suggest a model where cilia generated fluid flow in the node functions to ensure robust Nodal activation and a timely left-sided developmental program in the LPM. PMID:28182636

DeltaPhage—a novel helper phage for high-valence pIX phagemid display

PubMed Central

Nilssen, Nicolay R.; Frigstad, Terje; Pollmann, Sylvie; Roos, Norbert; Bogen, Bjarne; Sandlie, Inger; Løset, Geir Å.

2012-01-01

Phage display has been instrumental in discovery of novel binding peptides and folded domains for the past two decades. We recently reported a novel pIX phagemid display system that is characterized by a strong preference for phagemid packaging combined with low display levels, two key features that support highly efficient affinity selection. However, high diversity in selected repertoires are intimately coupled to high display levels during initial selection rounds. To incorporate this additional feature into the pIX display system, we have developed a novel helper phage termed DeltaPhage that allows for high-valence display on pIX. This was obtained by inserting two amber mutations close to the pIX start codon, but after the pVII translational stop, conditionally inactivating the helper phage encoded pIX. Until now, the general notion has been that display on pIX is dependent on wild-type complementation, making high-valence display unachievable. However, we found that DeltaPhage does facilitate high-valence pIX display when used with a non-suppressor host. Here, we report a side-by-side comparison with pIII display, and we find that this novel helper phage complements existing pIX phagemid display systems to allow both low and high-valence display, making pIX display a complete and efficient alternative to existing pIII phagemid display systems. PMID:22539265

DeltaPhage--a novel helper phage for high-valence pIX phagemid display.

PubMed

Nilssen, Nicolay R; Frigstad, Terje; Pollmann, Sylvie; Roos, Norbert; Bogen, Bjarne; Sandlie, Inger; Løset, Geir Å

2012-09-01

Phage display has been instrumental in discovery of novel binding peptides and folded domains for the past two decades. We recently reported a novel pIX phagemid display system that is characterized by a strong preference for phagemid packaging combined with low display levels, two key features that support highly efficient affinity selection. However, high diversity in selected repertoires are intimately coupled to high display levels during initial selection rounds. To incorporate this additional feature into the pIX display system, we have developed a novel helper phage termed DeltaPhage that allows for high-valence display on pIX. This was obtained by inserting two amber mutations close to the pIX start codon, but after the pVII translational stop, conditionally inactivating the helper phage encoded pIX. Until now, the general notion has been that display on pIX is dependent on wild-type complementation, making high-valence display unachievable. However, we found that DeltaPhage does facilitate high-valence pIX display when used with a non-suppressor host. Here, we report a side-by-side comparison with pIII display, and we find that this novel helper phage complements existing pIX phagemid display systems to allow both low and high-valence display, making pIX display a complete and efficient alternative to existing pIII phagemid display systems.

MOM3D/EM-ANIMATE - MOM3D WITH ANIMATION CODE

NASA Technical Reports Server (NTRS)

Shaeffer, J. F.

1994-01-01

MOM3D (LAR-15074) is a FORTRAN method-of-moments electromagnetic analysis algorithm for open or closed 3-D perfectly conducting or resistive surfaces. Radar cross section with plane wave illumination is the prime analysis emphasis; however, provision is also included for local port excitation for computing antenna gain patterns and input impedances. The Electric Field Integral Equation form of Maxwell's equations is solved using local triangle couple basis and testing functions with a resultant system impedance matrix. The analysis emphasis is not only for routine RCS pattern predictions, but also for phenomenological diagnostics: bistatic imaging, currents, and near scattered/total electric fields. The images, currents, and near fields are output in form suitable for animation. MOM3D computes the full backscatter and bistatic radar cross section polarization scattering matrix (amplitude and phase), body currents and near scattered and total fields for plane wave illumination. MOM3D also incorporates a new bistatic k space imaging algorithm for computing down range and down/cross range diagnostic images using only one matrix inversion. MOM3D has been made memory and cpu time efficient by using symmetric matrices, symmetric geometry, and partitioned fixed and variable geometries suitable for design iteration studies. MOM3D may be run interactively or in batch mode on 486 IBM PCs and compatibles, UNIX workstations or larger computers. A 486 PC with 16 megabytes of memory has the potential to solve a 30 square wavelength (containing 3000 unknowns) symmetric configuration. Geometries are described using a triangular mesh input in the form of a list of spatial vertex points and a triangle join connection list. The EM-ANIMATE (LAR-15075) program is a specialized visualization program that displays and animates the near-field and surface-current solutions obtained from an electromagnetics program, in particular, that from MOM3D. The EM-ANIMATE program is windows based and contains a user-friendly, graphical interface for setting viewing options, case selection, file manipulation, etc. EM-ANIMATE displays the field and surface-current magnitude as smooth shaded color fields (color contours) ranging from a minimum contour value to a maximum contour value for the fields and surface currents. The program can display either the total electric field or the scattered electric field in either time-harmonic animation mode or in the root mean square (RMS) average mode. The default setting is initially set to the minimum and maximum values within the field and surface current data and can be optionally set by the user. The field and surface-current value are animated by calculating and viewing the solution at user selectable radian time increments between 0 and 2pi. The surface currents can also be displayed in either time-harmonic animation mode or in RMS average mode. In RMS mode, the color contours do not vary with time, but show the constant time averaged field and surface-current magnitude solution. The electric field and surface-current directions can be displayed as scaled vector arrows which have a length proportional to the magnitude at each field grid point or surface node point. These vector properties can be viewed separately or concurrently with the field or surface-current magnitudes. Animation speed is improved by turning off the display of the vector arrows. In RMS modes, the direction vectors are still displayed as varying with time since the time averaged direction vectors would be zero length vectors. Other surface properties can optionally be viewed. These include the surface grid, the resistance value assigned to each element of the grid, and the power dissipation of each element which has an assigned resistance value. The EM-ANIMATE program will accept up to 10 different surface current cases each consisting of up to 20,000 node points and 10,000 triangle definitions and will animate one of these cases. The capability is used to compare surface-current distribution due to various initial excitation directions or electric field orientations. The program can accept up to 50 planes of field data consisting of a grid of 100 by 100 field points. These planes of data are user selectable and can be viewed individually or concurrently. With these preset limits, the program requires 55 megabytes of core memory to run. These limits can be changed in the header files to accommodate the available core memory of an individual workstation. An estimate of memory required can be made as follows: approximate memory in bytes equals (number of nodes times number of surfaces times 14 variables times bytes per word, typically 4 bytes per floating point) plus (number of field planes times number of nodes per plane times 21 variables times bytes per word). This gives the approximate memory size required to store the field and surface-current data. The total memory size is approximately 400,000 bytes plus the data memory size. The animation calculations are performed in real time at any user set time step. For Silicon Graphics Workstations that have multiple processors, this program has been optimized to perform these calculations on multiple processors to increase animation rates. The optimized program uses the SGI PFA (Power FORTRAN Accelerator) library. On single processor machines, the parallelization directives are seen as comments to the program and will have no effect on compilation or execution. MOM3D and EM-ANIMATE are written in FORTRAN 77 for interactive or batch execution on SGI series computers running IRIX 3.0 or later. The RAM requirements for these programs vary with the size of the problem being solved. A minimum of 30Mb of RAM is required for execution of EM-ANIMATE; however, the code may be modified to accommodate the available memory of an individual workstation. For EM-ANIMATE, twenty-four bit, double-buffered color capability is suggested, but not required. Sample executables and sample input and output files are provided. Electronic documentation is provided for both EM-ANIMATE and MOM3D in PostScript format. Documentation for EM-ANIMATE is also provided in the form of IRIX man pages. The standard distribution medium for COS-10048 is a .25 inch streaming magnetic IRIX tape cartridge in UNIX tar format. MOM3D and EM-ANIMATE are also available separately as LAR-15074 and LAR-15075, respectively. MOM3D was developed in 1992. EM-ANIMATE was developed in 1993.

Protein and Antibody Engineering by Phage Display.

PubMed

Frei, J C; Lai, J R

2016-01-01

Phage display is an in vitro selection technique that allows for the rapid isolation of proteins with desired properties including increased affinity, specificity, stability, and new enzymatic activity. The power of phage display relies on the phenotype-to-genotype linkage of the protein of interest displayed on the phage surface with the encoding DNA packaged within the phage particle, which allows for selective enrichment of library pools and high-throughput screening of resulting clones. As an in vitro method, the conditions of the binding selection can be tightly controlled. Due to the high-throughput nature, rapidity, and ease of use, phage display is an excellent technological platform for engineering antibody or proteins with enhanced properties. Here, we describe methods for synthesis, selection, and screening of phage libraries with particular emphasis on designing humanizing antibody libraries and combinatorial scanning mutagenesis libraries. We conclude with a brief section on troubleshooting for all stages of the phage display process. © 2016 Elsevier Inc. All rights reserved.

Composite video and graphics display for multiple camera viewing system in robotics and teleoperation

NASA Technical Reports Server (NTRS)

Diner, Daniel B. (Inventor); Venema, Steven C. (Inventor)

1991-01-01

A system for real-time video image display for robotics or remote-vehicle teleoperation is described that has at least one robot arm or remotely operated vehicle controlled by an operator through hand-controllers, and one or more television cameras and optional lighting element. The system has at least one television monitor for display of a television image from a selected camera and the ability to select one of the cameras for image display. Graphics are generated with icons of cameras and lighting elements for display surrounding the television image to provide the operator information on: the location and orientation of each camera and lighting element; the region of illumination of each lighting element; the viewed region and range of focus of each camera; which camera is currently selected for image display for each monitor; and when the controller coordinate for said robot arms or remotely operated vehicles have been transformed to correspond to coordinates of a selected or nonselected camera.

Composite video and graphics display for camera viewing systems in robotics and teleoperation

NASA Technical Reports Server (NTRS)

Diner, Daniel B. (Inventor); Venema, Steven C. (Inventor)

1993-01-01

A system for real-time video image display for robotics or remote-vehicle teleoperation is described that has at least one robot arm or remotely operated vehicle controlled by an operator through hand-controllers, and one or more television cameras and optional lighting element. The system has at least one television monitor for display of a television image from a selected camera and the ability to select one of the cameras for image display. Graphics are generated with icons of cameras and lighting elements for display surrounding the television image to provide the operator information on: the location and orientation of each camera and lighting element; the region of illumination of each lighting element; the viewed region and range of focus of each camera; which camera is currently selected for image display for each monitor; and when the controller coordinate for said robot arms or remotely operated vehicles have been transformed to correspond to coordinates of a selected or nonselected camera.

[The related factors of head and neck mocosal melanoma with lymph node metastasis].

PubMed

Yin, G F; Guo, W; Chen, X H; Huang, Z G

2017-12-05

Objective: To investigate the related factors of mucosal melanoma of head and neck with lymph node metastasis for early diagnosis and further treatments. Method: A retrospective analysis of 117 cases of head and neck mucosal malignant melanoma patients which received surgical treatment was performed. Eleven cases of patients with pathologically confirmed lymph node metastasis and 33 cases without lymph node metastasis (1∶3) were randomly selected to analyze. The related factors of lymph node metastasis of head and neck mucosal melanoma patients including age, gender, whether the existence of recurrence, bone invasion, lesion location were analyzed. The single factor and logistic regression analysis were performed, P <0.05 difference was statistically significant. Result: The lymph node metastasis rate of head and neck mucosal melanoma was 9.40%(11/117), the single factor analysis showed that there were 3 factors to be associated with lymph node metastasis, which was recurrence ( P =0.0000), bone invasion ( P =0.001), primary position ( P =0.007). Recurrence ( P =0.021) was a risk factor for lymph node metastasis according to the Logistic regression analysis, and the impact of bone invasion ( P =0.487) and primary location ( P =0.367) remained to be further explored. Conclusion: The patients of head and neck mucosal melanoma with the presence of recurrent usually accompanied by a further progression of the disease, such as lymph node metastasis, so for recurrent patients should pay special attention to the situation of lymph node and choose the reasonable treatment. Copyright© by the Editorial Department of Journal of Clinical Otorhinolaryngology Head and Neck Surgery.

Description and User Manual for a Web-Based Interface to a Transit-Loss Accounting Program for Monument and Fountain Creeks, El Paso and Pueblo Counties, Colorado

USGS Publications Warehouse

Kuhn, Gerhard; Krammes, Gary S.; Beal, Vivian J.

2007-01-01

The U.S. Geological Survey, in cooperation with Colorado Springs Utilities, the Colorado Water Conservation Board, and the El Paso County Water Authority, began a study in 2004 with the following objectives: (1) Apply a stream-aquifer model to Monument Creek, (2) use the results of the modeling to develop a transit-loss accounting program for Monument Creek, (3) revise an existing accounting program for Fountain Creek to easily incorporate ongoing and future changes in management of return flows of reusable water, and (4) integrate the two accounting programs into a single program and develop a Web-based interface to the integrated program that incorporates simple and reliable data entry that is automated to the fullest extent possible. This report describes the results of completing objectives (2), (3), and (4) of that study. The accounting program for Monument Creek was developed first by (1) using the existing accounting program for Fountain Creek as a prototype, (2) incorporating the transit-loss results from a stream-aquifer modeling analysis of Monument Creek, and (3) developing new output reports. The capabilities of the existing accounting program for Fountain Creek then were incorporated into the program for Monument Creek and the output reports were expanded to include Fountain Creek. A Web-based interface to the new transit-loss accounting program then was developed that provided automated data entry. An integrated system of 34 nodes and 33 subreaches was integrated by combining the independent node and subreach systems used in the previously completed stream-aquifer modeling studies for the Monument and Fountain Creek reaches. Important operational criteria that were implemented in the new transit-loss accounting program for Monument and Fountain Creeks included the following: (1) Retain all the reusable water-management capabilities incorporated into the existing accounting program for Fountain Creek; (2) enable daily accounting and transit-loss computations for a variable number of reusable return flows discharged into Monument Creek at selected locations; (3) enable diversion of all or a part of a reusable return flow at any selected node for purposes of storage in off-stream reservoirs or other similar types of reusable water management; (4) and provide flexibility in the accounting program to change the number of return-flow entities, the locations at which the return flows discharge into Monument or Fountain Creeks, or the locations to which the return flows are delivered. The primary component of the Web-based interface is a data-entry form that displays data stored in the accounting program input file; the data-entry form allows for entry and modification of new data, which then is rewritten to the input file. When the data-entry form is displayed, up-to-date discharge data for each station are automatically computed and entered on the data-entry form. Data for native return flows, reusable return flows, reusable return flow diversions, and native diversions also are entered automatically or manually, if needed. In computing the estimated quantities of reusable return flow and the associated transit losses, the accounting program uses two sets of computations. The first set of computations is made between any two adjacent streamflow-gaging stations (termed 'stream-segment loop'); the primary purpose of the stream-segment loop is to estimate the loss or gain in native discharge between the two adjacent streamflow-gaging stations. The second set of computations is made between any two adjacent nodes (termed 'subreach loop'); the actual transit-loss computations are made in the subreach loop, using the result from the stream-segment loop. The stream-segment loop is completed for a stream segment, and then the subreach loop is completed for each subreach within the segment. When the subreach loop is completed for all subreaches within a stream segment, the stream-segment loop is initiated for the ne

[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.

A Differential Evolution-Based Routing Algorithm for Environmental Monitoring Wireless Sensor Networks

PubMed Central

Li, Xiaofang; Xu, Lizhong; Wang, Huibin; Song, Jie; Yang, Simon X.

2010-01-01

The traditional Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol is a clustering-based protocol. The uneven selection of cluster heads results in premature death of cluster heads and premature blind nodes inside the clusters, thus reducing the overall lifetime of the network. With a full consideration of information on energy and distance distribution of neighboring nodes inside the clusters, this paper proposes a new routing algorithm based on differential evolution (DE) to improve the LEACH routing protocol. To meet the requirements of monitoring applications in outdoor environments such as the meteorological, hydrological and wetland ecological environments, the proposed algorithm uses the simple and fast search features of DE to optimize the multi-objective selection of cluster heads and prevent blind nodes for improved energy efficiency and system stability. Simulation results show that the proposed new LEACH routing algorithm has better performance, effectively extends the working lifetime of the system, and improves the quality of the wireless sensor networks. PMID:22219670

A Distributed Data-Gathering Protocol Using AUV in Underwater Sensor Networks

PubMed Central

Khan, Jawaad Ullah; Cho, Ho-Shin

2015-01-01

In this paper, we propose a distributed data-gathering scheme using an autonomous underwater vehicle (AUV) working as a mobile sink to gather data from a randomly distributed underwater sensor network where sensor nodes are clustered around several cluster headers. Unlike conventional data-gathering schemes where the AUV visits either every node or every cluster header, the proposed scheme allows the AUV to visit some selected nodes named path-nodes in a way that reduces the overall transmission power of the sensor nodes. Monte Carlo simulations are performed to investigate the performance of the proposed scheme compared with several preexisting techniques employing the AUV in terms of total amount of energy consumption, standard deviation of each node’s energy consumption, latency to gather data at a sink, and controlling overhead. Simulation results show that the proposed scheme not only reduces the total energy consumption but also distributes the energy consumption more uniformly over the network, thereby increasing the lifetime of the network. PMID:26287189

Complex networks under dynamic repair model

NASA Astrophysics Data System (ADS)

Chaoqi, Fu; Ying, Wang; Kun, Zhao; Yangjun, Gao

2018-01-01

Invulnerability is not the only factor of importance when considering complex networks' security. It is also critical to have an effective and reasonable repair strategy. Existing research on network repair is confined to the static model. The dynamic model makes better use of the redundant capacity of repaired nodes and repairs the damaged network more efficiently than the static model; however, the dynamic repair model is complex and polytropic. In this paper, we construct a dynamic repair model and systematically describe the energy-transfer relationships between nodes in the repair process of the failure network. Nodes are divided into three types, corresponding to three structures. We find that the strong coupling structure is responsible for secondary failure of the repaired nodes and propose an algorithm that can select the most suitable targets (nodes or links) to repair the failure network with minimal cost. Two types of repair strategies are identified, with different effects under the two energy-transfer rules. The research results enable a more flexible approach to network repair.

Management of the Regional Lymph Nodes Following Breast-Conservation Therapy for Early-Stage Breast Cancer: An Evolving Paradigm

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

Warren, Laura E.G.; Punglia, Rinaa S.; Wong, Julia S.

2014-11-15

Radiation therapy to the breast following breast conservation surgery has been the standard of care since randomized trials demonstrated equivalent survival compared to mastectomy and improved local control and survival compared to breast conservation surgery alone. Recent controversies regarding adjuvant radiation therapy have included the potential role of additional radiation to the regional lymph nodes. This review summarizes the evolution of regional nodal management focusing on 2 topics: first, the changing paradigm with regard to surgical evaluation of the axilla; second, the role for regional lymph node irradiation and optimal design of treatment fields. Contemporary data reaffirm prior studies showingmore » that complete axillary dissection may not provide additional benefit relative to sentinel lymph node biopsy in select patient populations. Preliminary data also suggest that directed nodal radiation therapy to the supraclavicular and internal mammary lymph nodes may prove beneficial; publication of several studies are awaited to confirm these results and to help define subgroups with the greatest likelihood of benefit.« less

Optimal Deployment of Sensor Nodes Based on Performance Surface of Underwater Acoustic Communication

PubMed Central

Choi, Jee Woong

2017-01-01

The underwater acoustic sensor network (UWASN) is a system that exchanges data between numerous sensor nodes deployed in the sea. The UWASN uses an underwater acoustic communication technique to exchange data. Therefore, it is important to design a robust system that will function even in severely fluctuating underwater communication conditions, along with variations in the ocean environment. In this paper, a new algorithm to find the optimal deployment positions of underwater sensor nodes is proposed. The algorithm uses the communication performance surface, which is a map showing the underwater acoustic communication performance of a targeted area. A virtual force-particle swarm optimization algorithm is then used as an optimization technique to find the optimal deployment positions of the sensor nodes, using the performance surface information to estimate the communication radii of the sensor nodes in each generation. The algorithm is evaluated by comparing simulation results between two different seasons (summer and winter) for an area located off the eastern coast of Korea as the selected targeted area. PMID:29053569

Expanding the Versatility of Phage Display II: Improved Affinity Selection of Folded Domains on Protein VII and IX of the Filamentous Phage

PubMed Central

Løset, Geir Åge; Roos, Norbert; Bogen, Bjarne; Sandlie, Inger

2011-01-01

Background Phage display is a leading technology for selection of binders with affinity for specific target molecules. Polypeptides are normally displayed as fusions to the major coat protein VIII (pVIII) or the minor coat protein III (pIII). Whereas pVIII display suffers from drawbacks such as heterogeneity in display levels and polypeptide fusion size limitations, toxicity and infection interference effects have been described for pIII display. Thus, display on other coat proteins such as pVII or pIX might be more attractive. Neither pVII nor pIX display have gained widespread use or been characterized in detail like pIII and pVIII display. Methodology/Principal Findings Here we present a side-by-side comparison of display on pIII with display on pVII and pIX. Polypeptides of interest (POIs) are fused to pVII or pIX. The N-terminal periplasmic signal sequence, which is required for phage integration of pIII and pVIII and that has been added to pVII and pIX in earlier studies, is omitted altogether. Although the POI display level on pIII is higher than on pVII and pIX, affinity selection with pVII and pIX display libraries is shown to be particularly efficient. Conclusions/Significance Display through pVII and/or pIX represent platforms with characteristics that differ from those of the pIII platform. We have explored this to increase the performance and expand the use of phage display. In the paper, we describe effective affinity selection of folded domains displayed on pVII or pIX. This makes both platforms more attractive alternatives to conventional pIII and pVIII display than they were before. PMID:21390283

A Novel Cooperative Opportunistic Routing Scheme for Underwater Sensor Networks.

PubMed

Ghoreyshi, Seyed Mohammad; Shahrabi, Alireza; Boutaleb, Tuleen

2016-02-26

Increasing attention has recently been devoted to underwater sensor networks (UWSNs) because of their capabilities in the ocean monitoring and resource discovery. UWSNs are faced with different challenges, the most notable of which is perhaps how to efficiently deliver packets taking into account all of the constraints of the available acoustic communication channel. The opportunistic routing provides a reliable solution with the aid of intermediate nodes' collaboration to relay a packet toward the destination. In this paper, we propose a new routing protocol, called opportunistic void avoidance routing (OVAR), to address the void problem and also the energy-reliability trade-off in the forwarding set selection. OVAR takes advantage of distributed beaconing, constructs the adjacency graph at each hop and selects a forwarding set that holds the best trade-off between reliability and energy efficiency. The unique features of OVAR in selecting the candidate nodes in the vicinity of each other leads to the resolution of the hidden node problem. OVAR is also able to select the forwarding set in any direction from the sender, which increases its flexibility to bypass any kind of void area with the minimum deviation from the optimal path. The results of our extensive simulation study show that OVAR outperforms other protocols in terms of the packet delivery ratio, energy consumption, end-to-end delay, hop count and traversed distance.

A Gaussian Mixture Model-based continuous Boundary Detection for 3D sensor networks.

PubMed

Chen, Jiehui; Salim, Mariam B; Matsumoto, Mitsuji

2010-01-01

This paper proposes a high precision Gaussian Mixture Model-based novel Boundary Detection 3D (BD3D) scheme with reasonable implementation cost for 3D cases by selecting a minimum number of Boundary sensor Nodes (BNs) in continuous moving objects. It shows apparent advantages in that two classes of boundary and non-boundary sensor nodes can be efficiently classified using the model selection techniques for finite mixture models; furthermore, the set of sensor readings within each sensor node's spatial neighbors is formulated using a Gaussian Mixture Model; different from DECOMO [1] and COBOM [2], we also formatted a BN Array with an additional own sensor reading to benefit selecting Event BNs (EBNs) and non-EBNs from the observations of BNs. In particular, we propose a Thick Section Model (TSM) to solve the problem of transition between 2D and 3D. It is verified by simulations that the BD3D 2D model outperforms DECOMO and COBOM in terms of average residual energy and the number of BNs selected, while the BD3D 3D model demonstrates sound performance even for sensor networks with low densities especially when the value of the sensor transmission range (r) is larger than the value of Section Thickness (d) in TSM. We have also rigorously proved its correctness for continuous geometric domains and full robustness for sensor networks over 3D terrains.

Evaluation of delivered dose for a clinical daily adaptive plan selection strategy for bladder cancer radiotherapy.

PubMed

Lutkenhaus, Lotte J; Visser, Jorrit; de Jong, Rianne; Hulshof, Maarten C C M; Bel, Arjan

2015-07-01

To account for variable bladder size during bladder cancer radiotherapy, a daily plan selection strategy was implemented. The aim of this study was to calculate the actually delivered dose using an adaptive strategy, compared to a non-adaptive approach. Ten patients were treated to the bladder and lymph nodes with an adaptive full bladder strategy. Interpolated delineations of bladder and tumor on a full and empty bladder CT scan resulted in five PTVs for which VMAT plans were created. Daily cone beam CT (CBCT) scans were used for plan selection. Bowel, rectum and target volumes were delineated on these CBCTs, and delivered dose for these was calculated using both the adaptive plan, and a non-adaptive plan. Target coverage for lymph nodes improved using an adaptive strategy. The full bladder strategy spared the healthy part of the bladder from a high dose. Average bowel cavity V30Gy and V40Gy significantly reduced with 60 and 69ml, respectively (p<0.01). Other parameters for bowel and rectum remained unchanged. Daily plan selection compared to a non-adaptive strategy yielded similar bladder coverage and improved coverage for lymph nodes, with a significant reduction in bowel cavity V30Gy and V40Gy only, while other sparing was limited. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

Analysis of a dynamic model of guard cell signaling reveals the stability of signal propagation

NASA Astrophysics Data System (ADS)

Gan, Xiao; Albert, RéKa

Analyzing the long-term behaviors (attractors) of dynamic models of biological systems can provide valuable insight into biological phenotypes and their stability. We identified the long-term behaviors of a multi-level, 70-node discrete dynamic model of the stomatal opening process in plants. We reduce the model's huge state space by reducing unregulated nodes and simple mediator nodes, and by simplifying the regulatory functions of selected nodes while keeping the model consistent with experimental observations. We perform attractor analysis on the resulting 32-node reduced model by two methods: 1. converting it into a Boolean model, then applying two attractor-finding algorithms; 2. theoretical analysis of the regulatory functions. We conclude that all nodes except two in the reduced model have a single attractor; and only two nodes can admit oscillations. The multistability or oscillations do not affect the stomatal opening level in any situation. This conclusion applies to the original model as well in all the biologically meaningful cases. We further demonstrate the robustness of signal propagation by showing that a large percentage of single-node knockouts does not affect the stomatal opening level. Thus, we conclude that the complex structure of this signal transduction network provides multiple information propagation pathways while not allowing extensive multistability or oscillations, resulting in robust signal propagation. Our innovative combination of methods offers a promising way to analyze multi-level models.

Residual energy level based clustering routing protocol for wireless sensor networks

NASA Astrophysics Data System (ADS)

Yuan, Xu; Zhong, Fangming; Chen, Zhikui; Yang, Deli

2015-12-01

The wireless sensor networks, which nodes prone to premature death, with unbalanced energy consumption and a short life time, influenced the promotion and application of this technology in internet of things in agriculture. This paper proposes a clustering routing protocol based on the residual energy level (RELCP). RELCP includes three stages: the selection of cluster head, establishment of cluster and data transmission. RELCP considers the remaining energy level and distance to base station, while election of cluster head nodes and data transmitting. Simulation results demonstrate that the protocol can efficiently balance the energy dissipation of all nodes, and prolong the network lifetime.

Design of the micro pressure multi-node measuring system for micro-fluidic chip

NASA Astrophysics Data System (ADS)

Mu, Lili; Guo, Shuheng; Rong, Li; Yin, Ke

2016-01-01

An online multi-node microfludic pressure measuring system was designed in the paper. The research focused on the design of pressure test circuit system and methods on dealing with pressure data collecting. The MPXV7002 micro-pressure sensor was selected to measure the chip inside channel pressure and installed by a silicone tube on different micro-channel measured nodes. The pressure transmission loss was estimated in the paper, and corrected by the filtering and smoothing method. The pressure test experiment was carried out and the data were analyzed. Finally, the measuring system was calibrated. The results showed that the measuring system had high testing precision.

Radiolabeled mannosylated dextran derivatives bearing an NIR-fluorophore for sentinel lymph node imaging.

PubMed

Morais, Maurício; Campello, Maria P C; Xavier, Catarina; Heemskerk, Johannes; Correia, João D G; Lahoutte, Tony; Caveliers, Vicky; Hernot, Sophie; Santos, Isabel

2014-11-19

Current methods for sentinel lymph node (SLN) mapping involve the use of radioactivity detection with technetium-99m sulfur colloid and/or visually guided identification using a blue dye. To overcome the kinetic variations of two individual imaging agents through the lymphatic system, we report herein on two multifunctional macromolecules, 5a and 6a, that contain a radionuclide ((99m)Tc or (68)Ga) and a near-infrared (NIR) reporter for pre- and/or intraoperative SLN mapping by nuclear and NIR optical imaging techniques. Both bimodal probes are dextran-based polymers (10 kDa) functionalized with pyrazole-diamine (Pz) or 1,4,7,10-tetraazacyclododecane-1,4,7,10-tetraacetic acid (DOTA) chelating units for labeling with fac-[(99m)Tc(CO)3](+) or (68)Ga(III), respectively, mannose units for receptor targeting, and NIR fluorophore units for optical imaging. The probes allowed a clear visualization of the popliteal node by single-photon emission computed tomography (SPECT/CT) or positron emission tomography (PET/CT), as well as real-time optically guided excision. Biodistribution studies confirmed that both macromolecules present a significant accumulation in the popliteal node (5a: 3.87 ± 0.63% IA/organ; 6a: 1.04 ± 0.26% IA/organ), with minimal spread to other organs. The multifunctional nanoplatforms display a popliteal extraction efficiency >90%, highlighting their potential to be further explored as dual imaging agents.

Categorization and identification of simultaneous targets.

PubMed

Theeuwes, J

1991-02-01

Early and late selection theories of visual attention disagree about whether identification occurs before or after selection. Studies showing the category effect, i.e., the time to detect a letter is hardly affected by the number of digits present in the display, are taken as evidence for late selection theories since these studies suggest parallel identification of all items in the display. As an extension of previous studies, in the present study two categorically different targets were presented simultaneously among a variable number of nontargets. Subjects were shown brief displays of two target letters among either 2, 4 or 6 nontarget digits. Subjects responded 'same' when the two letters were identical and 'different' otherwise. Since the 'same-different' response reflects the combined outcome of the simultaneous targets, late-selection theory predicts that the time to match the target letters is independent of the number of nontarget digits. Alternatively, early-selection theory predicts a linear increase of reaction time with display size since the presence of more than one target disrupts parallel preattentive processing, leading to a serial search through all items in the display. The results provide evidence for the early-selection view since reaction time increased linearly with the number of categorically different nontargets. A control experiment revealed that none of the alternative explanations could account for the display size effect.

A Combined HIPPARCOS and Multichannel Astrometric Photometer Study of the Proposed Planetary System of Rho Coronae Borealis

NASA Technical Reports Server (NTRS)

Gatewood, George; Han, Inwoo; Black, David C.

2001-01-01

Hipparcos and Multichannel Astrometric Photometer (MAP) observations of rho Coronae Borealis independently display astrometric motion at the period of the proposed extrasolar planetary companion to the star. Individual least-squares fits to each astrometric data set yield independent estimates of the semimajor axis, inclination, and node angle that are in excellent agreement. A combined solution of the Hipparcos and MAP data yields an inclination of 0.5 deg, a node at 30.5 +/- 12.4, and a semimajor axis of 1.66 +/- 0.35 mas, indicating a companion mass of 0.14 +/- 0.05 solar masses over two orders of magnitude greater than the minimum mass for the companion as determined by radial velocity studies. This mass is approximately that of an M dwarf star, the companion cannot be a planetary object.

Local lymph node assay (LLNA): comparison of different protocols by testing skin-sensitizing epoxy resin system components.

PubMed

Gamer, Armin O; Nies, Eberhard; Vohr, Hans-Werner

2008-12-01

Thirteen epoxy resin system components were tested in the LLNA with regard to their sensitizing potency. Lymph node stimulation was quantified not only by measuring the incorporation of [3H]-thymidine into the ear lymph nodes but also the counts of cells recovered from these organs. Equivalent figures were obtained with both endpoints used for the evaluation of lymph node cell proliferation if the reference stimulation indices were adjusted. When dissolved in acetone, all test substances showed skin-sensitizing potential, mainly on the boundary between "strong" and "moderate" according to common potency evaluation schemes. Replacing acetone with acetone/olive oil (4:1) as a vehicle for four selected test items, resulted in considerably lower estimated concentrations for sensitization induction. The challenges in comparing the results obtained by different LLNA variations are discussed.

Dynamic Hop Service Differentiation Model for End-to-End QoS Provisioning in Multi-Hop Wireless Networks

NASA Astrophysics Data System (ADS)

Youn, Joo-Sang; Seok, Seung-Joon; Kang, Chul-Hee

This paper presents a new QoS model for end-to-end service provisioning in multi-hop wireless networks. In legacy IEEE 802.11e based multi-hop wireless networks, the fixed assignment of service classes according to flow's priority at every node causes priority inversion problem when performing end-to-end service differentiation. Thus, this paper proposes a new QoS provisioning model called Dynamic Hop Service Differentiation (DHSD) to alleviate the problem and support effective service differentiation between end-to-end nodes. Many previous works for QoS model through the 802.11e based service differentiation focus on packet scheduling on several service queues with different service rate and service priority. Our model, however, concentrates on a dynamic class selection scheme, called Per Hop Class Assignment (PHCA), in the node's MAC layer, which selects a proper service class for each packet, in accordance with queue states and service requirement, in every node along the end-to-end route of the packet. The proposed QoS solution is evaluated using the OPNET simulator. The simulation results show that the proposed model outperforms both best-effort and 802.11e based strict priority service models in mobile ad hoc environments.

Effects of multiple spreaders in community networks

NASA Astrophysics Data System (ADS)

Hu, Zhao-Long; Ren, Zhuo-Ming; Yang, Guang-Yong; Liu, Jian-Guo

2014-12-01

Human contact networks exhibit the community structure. Understanding how such community structure affects the epidemic spreading could provide insights for preventing the spreading of epidemics between communities. In this paper, we explore the spreading of multiple spreaders in community networks. A network based on the clustering preferential mechanism is evolved, whose communities are detected by the Girvan-Newman (GN) algorithm. We investigate the spreading effectiveness by selecting the nodes as spreaders in the following ways: nodes with the largest degree in each community (community hubs), the same number of nodes with the largest degree from the global network (global large-degree) and randomly selected one node within each community (community random). The experimental results on the SIR model show that the spreading effectiveness based on the global large-degree and community hubs methods is the same in the early stage of the infection and the method of community random is the worst. However, when the infection rate exceeds the critical value, the global large-degree method embodies the worst spreading effectiveness. Furthermore, the discrepancy of effectiveness for the three methods will decrease as the infection rate increases. Therefore, we should immunize the hubs in each community rather than those hubs in the global network to prevent the outbreak of epidemics.

An artificial immune system approach with secondary response for misbehavior detection in mobile ad hoc networks.

PubMed

Sarafijanović, Slavisa; Le Boudec, Jean-Yves

2005-09-01

In mobile ad hoc networks, nodes act both as terminals and information relays, and they participate in a common routing protocol, such as dynamic source routing (DSR). The network is vulnerable to routing misbehavior, due to faulty or malicious nodes. Misbehavior detection systems aim at removing this vulnerability. In this paper, we investigate the use of an artificial immune system (AIS) to detect node misbehavior in a mobile ad hoc network using DSR. The system is inspired by the natural immune system (IS) of vertebrates. Our goal is to build a system that, like its natural counterpart, automatically learns, and detects new misbehavior. We describe our solution for the classification task of the AIS; it employs negative selection and clonal selection, the algorithms for learning and adaptation used by the natural IS. We define how we map the natural IS concepts such as self, antigen, and antibody to a mobile ad hoc network and give the resulting algorithm for classifying nodes as misbehaving. We implemented the system in the network simulator Glomosim; we present detection results and discuss how the system parameters affect the performance of primary and secondary response. Further steps will extend the design by using an analogy to the innate system, danger signal, and memory cells.

A Secure Region-Based Geographic Routing Protocol (SRBGR) for Wireless Sensor Networks

PubMed Central

Adnan, Ali Idarous; Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad

2017-01-01

Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole. PMID:28121992

A Secure Region-Based Geographic Routing Protocol (SRBGR) for Wireless Sensor Networks.

PubMed

Adnan, Ali Idarous; Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad

2017-01-01

Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole.

Sentinel lymph node biopsy in periocular merkel cell carcinoma: a case report.

PubMed

Filitis, Dan C; Paragh, Gyorgy; Samie, Faramarz H; Zeitouni, Nathalie C

2017-09-20

The National Comprehensive Cancer Network guidelines for Merkel cell carcinoma recommend performance of the sentinel lymph node biopsy in all patients with clinically negative nodal disease for staging and treatment. Nevertheless, sentinel lymph node biopsy in the periocular region is debated as tumors are typically smaller and lymphatic variability can make performance procedurally problematic. We present a case of a Caucasian patient in their seventies who presented with a 1.0 cm periocular Merkel cell carcinoma, who underwent Mohs surgery with a Tenzel flap repair, that was found to have a positive sentinel lymph node biopsy, but who, despite parotidectomy, selective neck dissection, and radiation, succumbed to the disease. Evidence in both the site-specific and non-specific literature demonstrates: (1) Worsening prognosis with extent of lymph node burden, (2) improvements in our abilities to perform lymphoscintigraphy, (3) locoregional and distant metastatic disease in patients with tumor sizes ≤1 cm, and (4) significant rates of sentinel lymph node positivity in patients with tumor sizes ≤1 cm. Our case supports that sentinel lymph node biopsy should be considered in all clinically nodal negative periocular Merkel cell carcinoma, regardless of size, and despite limited site-specific studies on the subject.

Densification and structural transitions in networks that grow by node copying

NASA Astrophysics Data System (ADS)

Bhat, U.; Krapivsky, P. L.; Lambiotte, R.; Redner, S.

2016-12-01

We introduce a growing network model, the copying model, in which a new node attaches to a randomly selected target node and, in addition, independently to each of the neighbors of the target with copying probability p . When p <1/2 , this algorithm generates sparse networks, in which the average node degree is finite. A power-law degree distribution also arises, with a nonuniversal exponent whose value is determined by a transcendental equation in p . In the sparse regime, the network is "normal," e.g., the relative fluctuations in the number of links are asymptotically negligible. For p ≥1/2 , the emergent networks are dense (the average degree increases with the number of nodes N ), and they exhibit intriguing structural behaviors. In particular, the N dependence of the number of m cliques (complete subgraphs of m nodes) undergoes m -1 transitions from normal to progressively more anomalous behavior at an m -dependent critical values of p . Different realizations of the network, which start from the same initial state, exhibit macroscopic fluctuations in the thermodynamic limit: absence of self-averaging. When linking to second neighbors of the target node can occur, the number of links asymptotically grows as N2 as N →∞ , so that the network is effectively complete as N →∞ .

Acute Toxoplasma gondii infection in children with reactive hyperplasia of the cervical lymph nodes.

PubMed

Bilal, Jalal A; Alsammani, Mohamed A; Ahmed, Mohamed I

2014-07-01

To determine the seroprevalence of Toxoplasma gondii (T. gondii) in children with reactive hyperplasia of the cervical lymph nodes. This cross-sectional prospective study was conducted in Khartoum Children Emergency Hospital, Khartoum, Sudan between January 2010 and April 2011. Eighty children with cervical lymphadenopathy were selected using random sampling. Their lymph nodes were aspirated for cytology, and a blood sample was collected from all patients for routine laboratory analysis and T. gondii IgG and IgM antibodies. Among 80 children with cervical lymphadenopathy, 60 (75%) had non-specific reactive hyperplasia. The seroprevalence of T. gondii among children with cervical lymphadenopathy was 27.5% (n=22), and the seropositivity of acute T. gondii among those with reactive hyperplasia was 36.7% (n=22/60). Lymph nodes in the T. gondii positive group were mobile and warm (p<0.05). The clinical features and laboratory tests were insignificant predictors of acute T. gondii infection with reactive hyperplasia of the cervical lymph nodes. The prevalence of acute T. gondii infection is high among children with non-specific reactive hyperplasia of the cervical lymph nodes. Routine laboratory studies are not helpful in the diagnosis of T. gondii infection with reactive hyperplasia of the lymph nodes however, serological studies may be requested prior to invasive procedures.

AES based secure low energy adaptive clustering hierarchy for WSNs

NASA Astrophysics Data System (ADS)

Kishore, K. R.; Sarma, N. V. S. N.

2013-01-01

Wireless sensor networks (WSNs) provide a low cost solution in diversified application areas. The wireless sensor nodes are inexpensive tiny devices with limited storage, computational capability and power. They are being deployed in large scale in both military and civilian applications. Security of the data is one of the key concerns where large numbers of nodes are deployed. Here, an energy-efficient secure routing protocol, secure-LEACH (Low Energy Adaptive Clustering Hierarchy) for WSNs based on the Advanced Encryption Standard (AES) is being proposed. This crypto system is a session based one and a new session key is assigned for each new session. The network (WSN) is divided into number of groups or clusters and a cluster head (CH) is selected among the member nodes of each cluster. The measured data from the nodes is aggregated by the respective CH's and then each CH relays this data to another CH towards the gateway node in the WSN which in turn sends the same to the Base station (BS). In order to maintain confidentiality of data while being transmitted, it is necessary to encrypt the data before sending at every hop, from a node to the CH and from the CH to another CH or to the gateway node.

An open and transparent process to select ELIXIR Node Services as implemented by ELIXIR-UK.

PubMed

Hancock, John M; Game, Alf; Ponting, Chris P; Goble, Carole A

2016-01-01

ELIXIR is the European infrastructure established specifically for the sharing and sustainability of life science data. To provide up-to-date resources and services, ELIXIR needs to undergo a continuous process of refreshing the services provided by its national Nodes. Here we present the approach taken by ELIXIR-UK to address the advice by the ELIXIR Scientific Advisory Board that Nodes need to develop " mechanisms to ensure that each Node continues to be representative of the Bioinformatics efforts within the country". ELIXIR-UK put in place an open and transparent process to identify potential ELIXIR resources within the UK during late 2015 and early to mid-2016. Areas of strategic strength were identified and Expressions of Interest in these priority areas were requested from the UK community. Criteria were established, in discussion with the ELIXIR Hub, and prospective ELIXIR-UK resources were assessed by an independent committee set up by the Node for this purpose. Of 19 resources considered, 14 were judged to be immediately ready to be included in the UK ELIXIR Node's portfolio. A further five were placed on the Node's roadmap for future consideration for inclusion. ELIXIR-UK expects to repeat this process regularly to ensure its portfolio continues to reflect its community's strengths.

Ribosome display: next-generation display technologies for production of antibodies in vitro.

PubMed

He, Mingyue; Khan, Farid

2005-06-01

Antibodies represent an important and growing class of biologic research reagents and biopharmaceutical products. They can be used as therapeutics in a variety of diseases. With the rapid expansion of proteomic studies and biomarker discovery, there is a need for the generation of highly specific binding reagents to study the vast number of proteins encoded by the genome. Display technologies provide powerful tools for obtaining antibodies. Aside from the preservation of natural antibody repertoires, they are capable of exploiting diversity by DNA recombination to create very large libraries for selection of novel molecules. In contrast to in vivo immunization processes, display technologies allow selection of antibodies under in vitro-defined selection condition(s), resulting in enrichment of antibodies with desired properties from large populations. In addition, in vitro selection enables the isolation of antibodies against difficult antigens including self-antigens, and this can be applied to the generation of human antibodies against human targets. Display technologies can also be combined with DNA mutagenesis for antibody evolution in vitro. Some methods are amenable to automation, permitting high-throughput generation of antibodies. Ribosome display is considered as representative of the next generation of display technologies since it overcomes the limitations of cell-based display methods by using a cell-free system, offering advantages of screening larger libraries and continuously expanding new diversity during selection. Production of display-derived antibodies can be achieved by choosing one of a variety of prokaryotic and eukaryotic cell-based expression systems. In the near future, cell-free protein synthesis may be developed as an alternative for large-scale generation of antibodies.

DOW-PR DOlphin and Whale Pods Routing Protocol for Underwater Wireless Sensor Networks (UWSNs).

PubMed

Wadud, Zahid; Ullah, Khadem; Hussain, Sajjad; Yang, Xiaodong; Qazi, Abdul Baseer

2018-05-12

Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime.

Identification of novel tumor antigens with patient-derived immune-selected antibodies

PubMed Central

Rodriguez-Pinto, Daniel; Sparkowski, Jason; Keough, Martin P.; Phoenix, Kathryn N.; Vumbaca, Frank; Han, David K.; Gundelfinger, Eckart D.; Beesley, Philip

2010-01-01

The identification of tumor antigens capable of eliciting an immune response in vivo may be an effective method to identify therapeutic cancer targets. We have developed a method to identify such antigens using frozen tumor-draining lymph node samples from breast cancer patients. Immune responses in tumor-draining lymph nodes were identified by immunostaining lymph node sections for B-cell markers (CD20&CD23) and Ki67 which revealed cell proliferation in germinal center zones. Antigen-dependent somatic hypermutation (SH) and clonal expansion (CE) were present in heavy chain variable (VH) domain cDNA clones obtained from these germinal centers, but not from Ki67 negative germinal centers. Recombinant VH single-domain antibodies were used to screen tumor proteins and affinity select potential tumor antigens. Neuroplastin (NPTN) was identified as a candidate breast tumor antigen using proteomic identification of affinity selected tumor proteins with a recombinant VH single chain antibody. NPTN was found to be highly expressed in approximately 20% of invasive breast carcinomas and 50% of breast carcinomas with distal metastasis using a breast cancer tissue array. Additionally, NPTN over-expression in a breast cancer cell line resulted in a significant increase in tumor growth and angiogenesis in vivo which was related to increased VEGF production in the transfected cells. These results validate NPTN as a tumor-associated antigen which could promote breast tumor growth and metastasis if aberrantly expressed. These studies also demonstrate that humoral immune responses in tumor-draining lymph nodes can provide antibody reagents useful in identifying tumor antigens with applications for biomarker screening, diagnostics and therapeutic interventions. PMID:18568347

DOW-PR DOlphin and Whale Pods Routing Protocol for Underwater Wireless Sensor Networks (UWSNs)

PubMed Central

Wadud, Zahid; Ullah, Khadem; Hussain, Sajjad; Yang, Xiaodong; Qazi, Abdul Baseer

2018-01-01

Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime. PMID:29757208

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

Abe Lederman

This report contains the comprehensive summary of the work performed on the SBIR Phase II project (“Distributed Relevance Ranking in Heterogeneous Document Collections”) at Deep Web Technologies (http://www.deepwebtech.com). We have successfully completed all of the tasks defined in our SBIR Proposal work plan (See Table 1 - Phase II Tasks Status). The project was completed on schedule and we have successfully deployed an initial production release of the software architecture at DOE-OSTI for the Science.gov Alliance's search portal (http://www.science.gov). We have implemented a set of grid services that supports the extraction, filtering, aggregation, and presentation of search results from numerousmore » heterogeneous document collections. Illustration 3 depicts the services required to perform QuickRank™ filtering of content as defined in our architecture documentation. Functionality that has been implemented is indicated by the services highlighted in green. We have successfully tested our implementation in a multi-node grid deployment both within the Deep Web Technologies offices, and in a heterogeneous geographically distributed grid environment. We have performed a series of load tests in which we successfully simulated 100 concurrent users submitting search requests to the system. This testing was performed on deployments of one, two, and three node grids with services distributed in a number of different configurations. The preliminary results from these tests indicate that our architecture will scale well across multi-node grid deployments, but more work will be needed, beyond the scope of this project, to perform testing and experimentation to determine scalability and resiliency requirements. We are pleased to report that a production quality version (1.4) of the science.gov Alliance's search portal based on our grid architecture was released in June of 2006. This demonstration portal is currently available at http://science.gov/search30 . The portal allows the user to select from a number of collections grouped by category and enter a query expression (See Illustration 1 - Science.gov 3.0 Search Page). After the user clicks “search” a results page is displayed that provides a list of results from the selected collections ordered by relevance based on the query expression the user provided. Our grid based solution to deep web search and document ranking has already gained attention within DOE, other Government Agencies and a fortune 50 company. We are committed to the continued development of grid based solutions to large scale data access, filtering, and presentation problems within the domain of Information Retrieval and the more general categories of content management, data mining and data analysis.« less

Distinguishing Different Strategies of Across-Dimension Attentional Selection

ERIC Educational Resources Information Center

Huang, Liqiang; Pashler, Harold

2012-01-01

Selective attention in multidimensional displays has usually been examined using search tasks requiring the detection of a single target. We examined the ability to perceive a spatial structure in multi-item subsets of a display that were defined either conjunctively or disjunctively. Observers saw two adjacent displays and indicated whether the…

A Graph Analytic Metric for Mitigating Advanced Persistent Threat

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

Johnson, John R.; Hogan, Emilie A.

2013-06-04

This paper introduces a novel graph analytic metric that can be used to measure the potential vulnerability of a cyber network to specific types of attacks that use lateral movement and privilege escalation such as the well known Pass The Hash, (PTH). The metric is computed from an oriented subgraph of the underlying cyber network induced by selecting only those edges for which a given property holds between the two vertices of the edge. The metric with respect to a select node on the subgraph is defined as the likelihood that the select node is reachable from another arbitrary nodemore » in the graph. This metric can be calculated dynamically from the authorization and auditing layers during the network security authorization phase and will potentially enable predictive deterrence against attacks such as PTH.« less

Weight optimization of plane truss using genetic algorithm

NASA Astrophysics Data System (ADS)

Neeraja, D.; Kamireddy, Thejesh; Santosh Kumar, Potnuru; Simha Reddy, Vijay

2017-11-01

Optimization of structure on basis of weight has many practical benefits in every engineering field. The efficiency is proportionally related to its weight and hence weight optimization gains prime importance. Considering the field of civil engineering, weight optimized structural elements are economical and easier to transport to the site. In this study, genetic optimization algorithm for weight optimization of steel truss considering its shape, size and topology aspects has been developed in MATLAB. Material strength and Buckling stability have been adopted from IS 800-2007 code of construction steel. The constraints considered in the present study are fabrication, basic nodes, displacements, and compatibility. Genetic programming is a natural selection search technique intended to combine good solutions to a problem from many generations to improve the results. All solutions are generated randomly and represented individually by a binary string with similarities of natural chromosomes, and hence it is termed as genetic programming. The outcome of the study is a MATLAB program, which can optimise a steel truss and display the optimised topology along with element shapes, deflections, and stress results.

Phage display on the base of filamentous bacteriophages: application for recombinant antibodies selection.

PubMed

Tikunova, N V; Morozova, V V

2009-10-01

The display of peptides and proteins on the surface of filamentous bacteriophage is a powerful methodology for selection of peptides and protein domains, including antibodies. An advantage of this methodology is the direct physical link between the phenotype and the genotype, as an analyzed polypeptide and its encoding DNA fragment exist in one phage particle. Development of phage display antibody libraries provides repertoires of phage particles exposing antibody fragments of great diversity. The biopanning procedure facilitates selection of antibodies with high affinity and specificity for almost any target. This review is an introduction to phage display methodology. It presents recombinant antibodies display in more details:, construction of phage libraries of antibody fragments and different strategies for the biopanning procedure.

Antibody VH and VL recombination using phage and ribosome display technologies reveals distinct structural routes to affinity improvements with VH-VL interface residues providing important structural diversity

PubMed Central

Groves, Maria AT; Amanuel, Lily; Campbell, Jamie I; Rees, D Gareth; Sridharan, Sudharsan; Finch, Donna K; Lowe, David C; Vaughan, Tristan J

2014-01-01

In vitro selection technologies are an important means of affinity maturing antibodies to generate the optimal therapeutic profile for a particular disease target. Here, we describe the isolation of a parent antibody, KENB061 using phage display and solution phase selections with soluble biotinylated human IL-1R1. KENB061 was affinity matured using phage display and targeted mutagenesis of VH and VL CDR3 using NNS randomization. Affinity matured VHCDR3 and VLCDR3 library blocks were recombined and selected using phage and ribosome display protocol. A direct comparison of the phage and ribosome display antibodies generated was made to determine their functional characteristics. PMID:24256948

Randomized Trial of Asprin as Adjuvant Therapy for Node-Positive Breast Cancer

DTIC Science & Technology

2017-10-01

Department of the Army position, policy or decision unless so designated by other documentation. REPORT DOCUMENTATION PAGE Form Approved OMB No. 0704...penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. PLEASE DO NOT RETURN YOUR...TERMS Breast cancer, adjuvant treatment, aspirin, randomized controlled trial 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT 18. NUMBER OF

Coupled macrospins: Mode dynamics in symmetric and asymmetric vertices

NASA Astrophysics Data System (ADS)

Bang, Wonbae; Jungfleisch, Matthias B.; Montoncello, Federico; Farmer, Barry W.; Lapa, Pavel N.; Hoffmann, Axel; Giovannini, Loris; De Long, Lance E.; Ketterson, John B.

2018-05-01

We report the microwave response of symmetric and asymmetric threefold clusters with nearly contacting segments that can serve as the node in a Kagome artificial spin ice lattice. The structures are patterned on a coplanar waveguide and consist of elongated and nearly-contacting ellipses with uniform thickness. Branches of the ferromagnetic resonance spectra display mode softening that correlates well with the calculations, whereas agreement between the measured and simulated static magnetization is more qualitative.

The Model Analyst’s Toolkit: Scientific Model Development, Analysis, and Validation

DTIC Science & Technology

2014-05-20

but there can still be many recommendations generated. Therefore, the recommender results are displayed in a sortable table where each row is a...reporting period. Since the synthesis graph can be complex and have many dependencies, the system must determine the order of evaluation of nodes, and...validation failure, if any. 3.1. Automatic Feature Extraction In many domains, causal models can often be more readily described as patterns of

Basic Lessons in *ORA and Automap 2009

DTIC Science & Technology

2009-06-01

screen capture showing the visualization of the agent x event graph from the Stargate Summit Meta-Network. The visualization displays the connections...for the Stargate dataset. 25.2 lessons - 201-207 A step by step run through of creating the Meta-Network from working with Excel, exporting data to...For the purpose of creating the Stargate MetaNetwork the two-episode story arc (Summit / Last Stand) was choosen as the basis for all the nodes

Coupled macrospins: Mode dynamics in symmetric and asymmetric vertices

DOE PAGES

Bang, Wonbae; Jungfleisch, Matthias B.; Montoncello, Federico; ...

2017-12-29

We report the microwave response of symmetric and asymmetric threefold clusters with nearly contacting segments that can serve as the node in a Kagome artificial spin ice lattice. The structures are patterned on a coplanar waveguide and consist of elongated and nearly-contacting ellipses with uniform thickness. Branches of the ferromagnetic resonance spectra display mode softening that correlates well with the calculations, whereas agreement between the measured and simulated static magnetization is more qualitative.

Charges drive selection of specific antibodies by phage display.

PubMed

Persson, Helena; Persson, Jonas; Danielsson, Lena; Ohlin, Mats

2010-02-28

Phage display technology has emerged as a leading approach to select proteins with improved properties for many different types of applications. The selection typically selects not only for improved binding properties but also for other factors such as efficiency of protein production and folding in Escherichia coli, the host in which the proteins and the phage are produced. Furthermore, the selection methodology is likely to influence the character of retrieved variants. We have now defined the extent whereby the charge of the displayed proteins influence the selection process, resulting in an increased average positive charge among selected proteins in comparison to the proteins that are harbored in the library before selection. Implications of and possible routes to minimize this effect are discussed. 2009 Elsevier B.V. All rights reserved.

A Power-Optimized Cooperative MAC Protocol for Lifetime Extension in Wireless Sensor Networks.

PubMed

Liu, Kai; Wu, Shan; Huang, Bo; Liu, Feng; Xu, Zhen

2016-10-01

In wireless sensor networks, in order to satisfy the requirement of long working time of energy-limited nodes, we need to design an energy-efficient and lifetime-extended medium access control (MAC) protocol. In this paper, a node cooperation mechanism that one or multiple nodes with higher channel gain and sufficient residual energy help a sender relay its data packets to its recipient is employed to achieve this objective. We first propose a transmission power optimization algorithm to prolong network lifetime by optimizing the transmission powers of the sender and its cooperative nodes to maximize their minimum residual energy after their data packet transmissions. Based on it, we propose a corresponding power-optimized cooperative MAC protocol. A cooperative node contention mechanism is designed to ensure that the sender can effectively select a group of cooperative nodes with the lowest energy consumption and the best channel quality for cooperative transmissions, thus further improving the energy efficiency. Simulation results show that compared to typical MAC protocol with direct transmissions and energy-efficient cooperative MAC protocol, the proposed cooperative MAC protocol can efficiently improve the energy efficiency and extend the network lifetime.

A Power-Optimized Cooperative MAC Protocol for Lifetime Extension in Wireless Sensor Networks

PubMed Central

Liu, Kai; Wu, Shan; Huang, Bo; Liu, Feng; Xu, Zhen

2016-01-01

In wireless sensor networks, in order to satisfy the requirement of long working time of energy-limited nodes, we need to design an energy-efficient and lifetime-extended medium access control (MAC) protocol. In this paper, a node cooperation mechanism that one or multiple nodes with higher channel gain and sufficient residual energy help a sender relay its data packets to its recipient is employed to achieve this objective. We first propose a transmission power optimization algorithm to prolong network lifetime by optimizing the transmission powers of the sender and its cooperative nodes to maximize their minimum residual energy after their data packet transmissions. Based on it, we propose a corresponding power-optimized cooperative MAC protocol. A cooperative node contention mechanism is designed to ensure that the sender can effectively select a group of cooperative nodes with the lowest energy consumption and the best channel quality for cooperative transmissions, thus further improving the energy efficiency. Simulation results show that compared to typical MAC protocol with direct transmissions and energy-efficient cooperative MAC protocol, the proposed cooperative MAC protocol can efficiently improve the energy efficiency and extend the network lifetime. PMID:27706079

Self-adaptive trust based ABR protocol for MANETs using Q-learning.

PubMed

Kumar, Anitha Vijaya; Jeyapal, Akilandeswari

2014-01-01

Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed. Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques, Q-learning achieves optimal results. Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show that Q-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation.

Self-Adaptive Trust Based ABR Protocol for MANETs Using Q-Learning

PubMed Central

Jeyapal, Akilandeswari

2014-01-01

Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed. Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques, Q-learning achieves optimal results. Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show that Q-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation. PMID:25254243

A spread willingness computing-based information dissemination model.

PubMed

Huang, Haojing; Cui, Zhiming; Zhang, Shukui

2014-01-01

This paper constructs a kind of spread willingness computing based on information dissemination model for social network. The model takes into account the impact of node degree and dissemination mechanism, combined with the complex network theory and dynamics of infectious diseases, and further establishes the dynamical evolution equations. Equations characterize the evolutionary relationship between different types of nodes with time. The spread willingness computing contains three factors which have impact on user's spread behavior: strength of the relationship between the nodes, views identity, and frequency of contact. Simulation results show that different degrees of nodes show the same trend in the network, and even if the degree of node is very small, there is likelihood of a large area of information dissemination. The weaker the relationship between nodes, the higher probability of views selection and the higher the frequency of contact with information so that information spreads rapidly and leads to a wide range of dissemination. As the dissemination probability and immune probability change, the speed of information dissemination is also changing accordingly. The studies meet social networking features and can help to master the behavior of users and understand and analyze characteristics of information dissemination in social network.

A local immunization strategy for networks with overlapping community structure

NASA Astrophysics Data System (ADS)

Taghavian, Fatemeh; Salehi, Mostafa; Teimouri, Mehdi

2017-02-01

Since full coverage treatment is not feasible due to limited resources, we need to utilize an immunization strategy to effectively distribute the available vaccines. On the other hand, the structure of contact network among people has a significant impact on epidemics of infectious diseases (such as SARS and influenza) in a population. Therefore, network-based immunization strategies aim to reduce the spreading rate by removing the vaccinated nodes from contact network. Such strategies try to identify more important nodes in epidemics spreading over a network. In this paper, we address the effect of overlapping nodes among communities on epidemics spreading. The proposed strategy is an optimized random-walk based selection of these nodes. The whole process is local, i.e. it requires contact network information in the level of nodes. Thus, it is applicable to large-scale and unknown networks in which the global methods usually are unrealizable. Our simulation results on different synthetic and real networks show that the proposed method outperforms the existing local methods in most cases. In particular, for networks with strong community structures, high overlapping membership of nodes or small size communities, the proposed method shows better performance.

A Spread Willingness Computing-Based Information Dissemination Model

PubMed Central

Cui, Zhiming; Zhang, Shukui

2014-01-01

This paper constructs a kind of spread willingness computing based on information dissemination model for social network. The model takes into account the impact of node degree and dissemination mechanism, combined with the complex network theory and dynamics of infectious diseases, and further establishes the dynamical evolution equations. Equations characterize the evolutionary relationship between different types of nodes with time. The spread willingness computing contains three factors which have impact on user's spread behavior: strength of the relationship between the nodes, views identity, and frequency of contact. Simulation results show that different degrees of nodes show the same trend in the network, and even if the degree of node is very small, there is likelihood of a large area of information dissemination. The weaker the relationship between nodes, the higher probability of views selection and the higher the frequency of contact with information so that information spreads rapidly and leads to a wide range of dissemination. As the dissemination probability and immune probability change, the speed of information dissemination is also changing accordingly. The studies meet social networking features and can help to master the behavior of users and understand and analyze characteristics of information dissemination in social network. PMID:25110738

Availability of sentinel lymph node biopsy for cutaneous squamous cell carcinoma.

PubMed

Maruyama, Hiroshi; Tanaka, Ryota; Fujisawa, Yasuhiro; Nakamura, Yasuhiro; Ito, Shusaku; Fujimoto, Manabu

2017-04-01

Cutaneous squamous cell carcinoma is the second common cutaneous cancer, especially in the elderly. Sentinel lymph node biopsy is generally performed in breast cancers and cutaneous melanomas to detect occult nodal metastases. The benefit of sentinel lymph node biopsy in improving cutaneous squamous cell carcinoma prognosis is doubtful. One hundred and sixty-nine patients who underwent treatment for cutaneous squamous cell carcinoma between 2004 and 2015, and who were followed up for at least 6 months or developed metastases within the follow-up period were included. Forty-nine patients underwent sentinel lymph node biopsy, whereas 120 patients did not, including 13 who exhibited clinical lymph node metastases before treatment. Of these 49 patients, nine (18.4%) presented with sentinel lymph node metastasis, which occurred after treatment in three (6.1%) of them (false-negative). Among the 107 patients who did not undergo lymph node biopsy, 12 (11.2%) developed post-treatment metastases. The metastasis-free and disease-specific survival rates were not significantly different in those who did or did not undergo sentinel lymph node biopsy. Patients with clinical lymph node metastases had a higher risk compared with those without. Patients with T2-T4 tumors had a higher risk compared with those with T1 tumors. When selecting for those with T2 tumors or greater, the same lack of relationship was observed. In conclusion, in this small retrospective cohort, in patients with cutaneous squamous cell carcinoma, there were no significant differences in metastasis-free and disease-specific survival rates between those who did or did not undergo sentinel lymph node biopsy, regardless of T staging. © 2016 Japanese Dermatological Association.

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

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.

Prognostic Value of Lymph Node Yield and Density in Head and Neck Malignancies.

PubMed

Cheraghlou, Shayan; Otremba, Michael; Kuo Yu, Phoebe; Agogo, George O; Hersey, Denise; Judson, Benjamin L

2018-06-01

Objective Studies have suggested that the lymph node yield and lymph node density from selective or elective neck dissections are predictive of patient outcomes and may be used for patient counseling, treatment planning, or quality measurement. Our objective was to systematically review the literature and conduct a meta-analysis of studies that investigated the prognostic significance of lymph node yield and/or lymph node density after neck dissection for patients with head and neck cancer. Data Sources The Ovid/Medline, Ovid/Embase, and NLM PubMed databases were systematically searched on January 23, 2017, for articles published between January 1, 1946, and January 23, 2017. Review Methods We reviewed English-language original research that included survival analysis of patients undergoing neck dissection for a head and neck malignancy stratified by lymph node yield and/or lymph node density. Study data were extracted by 2 independent researchers (S.C. and M.O.). We utilized the DerSimonian and Laird random effects model to account for heterogeneity of studies. Results Our search yielded 350 nonduplicate articles, with 23 studies included in the final synthesis. Pooled results demonstrated that increased lymph node yield was associated with a significant improvement in survival (hazard ratio, 0.833; 95% CI, 0.790-0.879). Additionally, we found that increased lymph node density was associated with poorer survival (hazard ratio, 1.916; 95% CI, 1.637-2.241). Conclusions Increased nodal yield portends improved outcomes and may be a valuable quality indicator for neck dissections, while increased lymph node density is associated with diminished survival and may be used for postsurgical counseling and planning for adjuvant therapy.

Availability of tissue rinse liquid-based cytology for the rapid diagnosis of sentinel lymph node metastasis and improved bilateral detection by photodynamic eye camera.

PubMed

Kato, Hidenori; Ohba, Yoko; Yamazaki, Hiroyuki; Minobe, Shin-Ichiro; Sudo, Satoko; Todo, Yukiharu; Okamoto, Kazuhira; Yamashiro, Katsushige

2015-08-01

On sentinel lymph node navigation surgery for early invasive cervical cancers, to gain high sensitivity and specificity, the sentinel nodes should be detected bilaterally and pathological diagnosis should be sensitive to detect micrometastasis. To improve these problems, we tried tissue rinse liquid-based cytology and the photodynamic eye. From 2005 to 2013, 102 patients with Stage Ib1 uterine cervical cancer were subjected to sentinel lymph node navigation surgery with Technetium-99 m colloid and blue dye. For the recent 11 patients with whom bilateral sentinel node detection was not available, the photodynamic eye was selectively examined. The detected sentinel node was cut along the minor axis into 2 mm slices, soaked in 10 ml CytoRich red and then subjected to tissue rinse liquid-based cytology at the time of surgery. With the accumulation of 102 Ib1 patients subjected to sentinel lymph node navigation surgery, the bilateral sentinel node detection rate was 67.7%. The photodynamic eye was examined for the recent 11 patients who did not have bilateral signals. Out of the 11, 10 patients obtained bilateral signals successfully. During the period of examining the photodynamic eye, a total of 34 patients were subjected to sentinel lymph node navigation surgery. Thus, the overall bilateral detection rate increased to 97% in this subset. Two hundred and five lymph nodes were available as sentinel nodes. The sensitivity of tissue rinse liquid-based cytology was 91.7%, and the specificity was 100%. False positivity was 0% and false negativity was 8.3%. Detection failure was observed only with one micrometastasis and one case of isolated tumor cells. Combination of photodynamic eye detection and tissue rinse liquid-based cytology pathology can be a promising method for more rewarding sentinel node detection. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

Competing contact processes in the Watts-Strogatz network

NASA Astrophysics Data System (ADS)

Rybak, Marcin; Malarz, Krzysztof; Kułakowski, Krzysztof

2016-06-01

We investigate two competing contact processes on a set of Watts-Strogatz networks with the clustering coefficient tuned by rewiring. The base for network construction is one-dimensional chain of N sites, where each site i is directly linked to nodes labelled as i ± 1 and i ± 2. So initially, each node has the same degree k i = 4. The periodic boundary conditions are assumed as well. For each node i the links to sites i + 1 and i + 2 are rewired to two randomly selected nodes so far not-connected to node i. An increase of the rewiring probability q influences the nodes degree distribution and the network clusterization coefficient 𝓒. For given values of rewiring probability q the set 𝓝(q)={𝓝1,𝓝2,...,𝓝 M } of M networks is generated. The network's nodes are decorated with spin-like variables s i ∈ { S,D }. During simulation each S node having a D-site in its neighbourhood converts this neighbour from D to S state. Conversely, a node in D state having at least one neighbour also in state D-state converts all nearest-neighbours of this pair into D-state. The latter is realized with probability p. We plot the dependence of the nodes S final density n S T on initial nodes S fraction n S 0. Then, we construct the surface of the unstable fixed points in (𝓒, p, n S 0) space. The system evolves more often toward n S T for (𝓒, p, n S 0) points situated above this surface while starting simulation with (𝓒, p, n S 0) parameters situated below this surface leads system to n S T =0. The points on this surface correspond to such value of initial fraction n S * of S nodes (for fixed values 𝓒 and p) for which their final density is n S T=1/2.

Combining yeast display and competitive FACS to select rare hapten-specific clones from recombinant antibody libraries

DOE PAGES

Sun, Yue; Ban, Bhupal; Bradbury, Andrew; ...

2016-08-29

The development of antibodies to low molecular weight haptens remains challenging due to both the low immunogenicity of many haptens and the cross-reactivity of the protein carriers used to generate the immune response. Recombinant antibodies and novel display technologies have greatly advanced antibody development; however, new techniques are still required to select rare hapten-specific antibodies from large recombinant libraries. In the present study, we used a combination of phage and yeast display to screen an immune antibody library (size, 4.4 × 10 6 ) against hapten markers for petroleum contamination (phenanthrene and methylphenanthrenes). Selection via phage display was used firstmore » to enrich the library between 20- and 100- fold for clones that bound to phenanthrene-protein conjugates. The enriched libraries were subsequently transferred to a yeast display system and a newly developed competitive FACS procedure was employed to select rare hapten-specific clones. Competitive FACS increased the frequency of hapten-specific scFvs in our yeast-displayed scFvs from 0.025 to 0.005% in the original library to between 13 and 35% in selected pools. The presence of hapten-specific scFvs was confirmed by competitive ELISA using periplasmic protein. Three distinct antibody clones that recognize phenanthrene and methylphenanthrenes were selected, and their distinctive binding properties were characterized. To our knowledge, these are first antibodies that can distinguish between methylated (petrogenic) versus unmethylated (pyrogenic) phenanthrenes; such antibodies will be useful in detecting the sources of environmental contamination. Furthermore, this selection method could be generally adopted in the selection of other hapten-specific recombinant antibodies.« less

Combining yeast display and competitive FACS to select rare hapten-specific clones from recombinant antibody libraries

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

Sun, Yue; Ban, Bhupal; Bradbury, Andrew

The development of antibodies to low molecular weight haptens remains challenging due to both the low immunogenicity of many haptens and the cross-reactivity of the protein carriers used to generate the immune response. Recombinant antibodies and novel display technologies have greatly advanced antibody development; however, new techniques are still required to select rare hapten-specific antibodies from large recombinant libraries. In the present study, we used a combination of phage and yeast display to screen an immune antibody library (size, 4.4 × 10 6 ) against hapten markers for petroleum contamination (phenanthrene and methylphenanthrenes). Selection via phage display was used firstmore » to enrich the library between 20- and 100- fold for clones that bound to phenanthrene-protein conjugates. The enriched libraries were subsequently transferred to a yeast display system and a newly developed competitive FACS procedure was employed to select rare hapten-specific clones. Competitive FACS increased the frequency of hapten-specific scFvs in our yeast-displayed scFvs from 0.025 to 0.005% in the original library to between 13 and 35% in selected pools. The presence of hapten-specific scFvs was confirmed by competitive ELISA using periplasmic protein. Three distinct antibody clones that recognize phenanthrene and methylphenanthrenes were selected, and their distinctive binding properties were characterized. To our knowledge, these are first antibodies that can distinguish between methylated (petrogenic) versus unmethylated (pyrogenic) phenanthrenes; such antibodies will be useful in detecting the sources of environmental contamination. Furthermore, this selection method could be generally adopted in the selection of other hapten-specific recombinant antibodies.« less

Runaway sexual selection leads to good genes.

PubMed

Chandler, Christopher H; Ofria, Charles; Dworkin, Ian

2013-01-01

Mate choice and sexual displays are widespread in nature, but their evolutionary benefits remain controversial. Theory predicts these traits can be favored by runaway sexual selection, in which preference and display reinforce one another due to genetic correlation; or by good genes benefits, in which mate choice is advantageous because extreme displays indicate a well-adapted genotype. However, these hypotheses are not mutually exclusive, and the adaptive benefits underlying mate choice can themselves evolve. In particular, examining how and why sexual displays become indicators of good genes is challenging in natural systems. Here, we use experimental evolution in "digital organisms" to demonstrate the origins of condition-dependent indicator displays following their spread due to a runaway process. Surprisingly, handicap-like costs are not necessary for displays to become indicators of male viability. Instead, a pleiotropic genetic architecture underlies both displays and viability. Runaway sexual selection and good genes benefits should thus be viewed as interacting mechanisms that reinforce one another. © 2012 The Author(s). Evolution© 2012 The Society for the Study of Evolution.

Online Exhibits & Concept Maps

NASA Astrophysics Data System (ADS)

Douma, M.

2009-12-01

Presenting the complexity of geosciences to the public via the Internet poses a number of challenges. For example, utilizing various - and sometimes redundant - Web 2.0 tools can quickly devour limited time. Do you tweet? Do you write press releases? Do you create an exhibit or concept map? The presentation will provide participants with a context for utilizing Web 2.0 tools by briefly highlighting methods of online scientific communication across several dimensions. It will address issues of: * breadth and depth (e.g. from narrow topics to well-rounded views), * presentation methods (e.g. from text to multimedia, from momentary to enduring), * sources and audiences (e.g. for experts or for the public, content developed by producers to that developed by users), * content display (e.g. from linear to non-linear, from instructive to entertaining), * barriers to entry (e.g. from an incumbent advantage to neophyte accessible, from amateur to professional), * cost and reach (e.g. from cheap to expensive), and * impact (e.g. the amount learned, from anonymity to brand awareness). Against this backdrop, the presentation will provide an overview of two methods of online information dissemination, exhibits and concept maps, using the WebExhibits online museum (www.webexhibits.org) and SpicyNodes information visualization tool (www.spicynodes.org) as examples, with tips on how geoscientists can use either to communicate their science. Richly interactive online exhibits can serve to engage a large audience, appeal to visitors with multiple learning styles, prompt exploration and discovery, and present a topic’s breadth and depth. WebExhibits, which was among the first online museums, delivers interactive information, virtual experiments, and hands-on activities to the public. While large, multidisciplinary exhibits on topics like “Color Vision and Art” or “Calendars Through the Ages” require teams of scholars, user interface experts, professional writers and editors, teachers, artists, and web designers, a smaller scale collaborative effort can result in an effective mini-exhibit. Online concept maps can present a large quantity of information in bite-size chunks, demonstrating interrelationships between pieces of information without inundating visitors. SpicyNodes uses radial mapping technology to enable visitors to learn about a topic or search for information in intuitive and organic ways. This online concept mapping tool can be used as a portal to invite exploration into topics, or as a means of displaying hierarchies of information. With nodes that contain text, audio, video, and links, interactive online concept maps especially engage visual, kinesthetic, and nonlinear learners. SpicyNodes is also useful for scientists who wish to complement papers, chapters, and books with an online interface that is especially appealing to nonlinear learners. Essentially, SpicyNodes shifts the burden of discovery from the reader to the author. For example, the author may create a nodemap on climate change with hundreds of nodes, but as visitors drill through the nodemap for information (e.g. from climate change to atmospheric gases to carbon dioxide), they see only a few nodes at a time and are not overwhelmed.

The Role of Central Neck Lymph Node Dissection in the Management of Papillary Thyroid Cancer.

PubMed

Shirley, Lawrence A; Jones, Natalie B; Phay, John E

2017-01-01

Papillary thyroid cancer (PTC) is the most common thyroid malignancy, and cervical nodal metastases are frequent at presentation. The most common site for nodal metastases from PTC is the central compartment of the ipsilateral neck in the paratracheal and pretracheal regions. The decision to resect these lymph nodes at the time of thyroidectomy often depends on if nodes with suspected malignancy can be identified preoperatively. If nodal spread to the central neck nodes is known, then the consensus is to remove all nodes in this area. However, there remains significant controversy regarding the utility of removing central neck lymph nodes for prophylactic reasons. Herein, we review the potential utility of central neck lymph node dissection as well as the risks of performing this procedure. As well, we review the potential of molecular testing to stratify patients who would most benefit from this procedure. We advocate a selective approach in which patients undergo clinical neck examination coupled with ultrasound to detect any concerning lymph nodes that warrant additional evaluation with either fine needle aspiration or excisional biopsy in the operating room. In lieu of clinical lymphadenopathy, we suggest the use of patient and disease characteristics as identified by multiple groups, such as the American Thyroid Association and European Society of Endocrine Surgeons, which include extremes of ages, large primary tumor size, and male gender, when deciding to perform central neck lymph node dissection. Patients should be educated on the potential long-terms risks versus the lack of known long-term benefits.

All-Direction Random Routing for Source-Location Privacy Protecting against Parasitic Sensor Networks.

PubMed

Wang, Na; Zeng, Jiwen

2017-03-17

Wireless sensor networks are deployed to monitor the surrounding physical environments and they also act as the physical environments of parasitic sensor networks, whose purpose is analyzing the contextual privacy and obtaining valuable information from the original wireless sensor networks. Recently, contextual privacy issues associated with wireless communication in open spaces have not been thoroughly addressed and one of the most important challenges is protecting the source locations of the valuable packages. In this paper, we design an all-direction random routing algorithm (ARR) for source-location protecting against parasitic sensor networks. For each package, the routing process of ARR is divided into three stages, i.e., selecting a proper agent node, delivering the package to the agent node from the source node, and sending it to the final destination from the agent node. In ARR, the agent nodes are randomly chosen in all directions by the source nodes using only local decisions, rather than knowing the whole topology of the networks. ARR can control the distributions of the routing paths in a very flexible way and it can guarantee that the routing paths with the same source and destination are totally different from each other. Therefore, it is extremely difficult for the parasitic sensor nodes to trace the packages back to the source nodes. Simulation results illustrate that ARR perfectly confuses the parasitic nodes and obviously outperforms traditional routing-based schemes in protecting source-location privacy, with a marginal increase in the communication overhead and energy consumption. In addition, ARR also requires much less energy than the cloud-based source-location privacy protection schemes.

Adaptive sampling in behavioral surveys.

PubMed

Thompson, S K

1997-01-01

Studies of populations such as drug users encounter difficulties because the members of the populations are rare, hidden, or hard to reach. Conventionally designed large-scale surveys detect relatively few members of the populations so that estimates of population characteristics have high uncertainty. Ethnographic studies, on the other hand, reach suitable numbers of individuals only through the use of link-tracing, chain referral, or snowball sampling procedures that often leave the investigators unable to make inferences from their sample to the hidden population as a whole. In adaptive sampling, the procedure for selecting people or other units to be in the sample depends on variables of interest observed during the survey, so the design adapts to the population as encountered. For example, when self-reported drug use is found among members of the sample, sampling effort may be increased in nearby areas. Types of adaptive sampling designs include ordinary sequential sampling, adaptive allocation in stratified sampling, adaptive cluster sampling, and optimal model-based designs. Graph sampling refers to situations with nodes (for example, people) connected by edges (such as social links or geographic proximity). An initial sample of nodes or edges is selected and edges are subsequently followed to bring other nodes into the sample. Graph sampling designs include network sampling, snowball sampling, link-tracing, chain referral, and adaptive cluster sampling. A graph sampling design is adaptive if the decision to include linked nodes depends on variables of interest observed on nodes already in the sample. Adjustment methods for nonsampling errors such as imperfect detection of drug users in the sample apply to adaptive as well as conventional designs.

Short-term monitoring of benzene air concentration in an urban area: a preliminary study of application of Kruskal-Wallis non-parametric test to assess pollutant impact on global environment and indoor.

PubMed

Mura, Maria Chiara; De Felice, Marco; Morlino, Roberta; Fuselli, Sergio

2010-01-01

In step with the need to develop statistical procedures to manage small-size environmental samples, in this work we have used concentration values of benzene (C6H6), concurrently detected by seven outdoor and indoor monitoring stations over 12 000 minutes, in order to assess the representativeness of collected data and the impact of the pollutant on indoor environment. Clearly, the former issue is strictly connected to sampling-site geometry, which proves critical to correctly retrieving information from analysis of pollutants of sanitary interest. Therefore, according to current criteria for network-planning, single stations have been interpreted as nodes of a set of adjoining triangles; then, a) node pairs have been taken into account in order to estimate pollutant stationarity on triangle sides, as well as b) node triplets, to statistically associate data from air-monitoring with the corresponding territory area, and c) node sextuplets, to assess the impact probability of the outdoor pollutant on indoor environment for each area. Distributions from the various node combinations are all non-Gaussian, in the consequently, Kruskal-Wallis (KW) non-parametric statistics has been exploited to test variability on continuous density function from each pair, triplet and sextuplet. Results from the above-mentioned statistical analysis have shown randomness of site selection, which has not allowed a reliable generalization of monitoring data to the entire selected territory, except for a single "forced" case (70%); most important, they suggest a possible procedure to optimize network design.

Downhole drilling network using burst modulation techniques

DOEpatents

Hall,; David R. , Fox; Joe, [Spanish Fork, UT

2007-04-03

A downhole drilling system is disclosed in one aspect of the present invention as including a drill string and a transmission line integrated into the drill string. Multiple network nodes are installed at selected intervals along the drill string and are adapted to communicate with one another through the transmission line. In order to efficiently allocate the available bandwidth, the network nodes are configured to use any of numerous burst modulation techniques to transmit data.

Selection of Single Domain Antibodies from Immune Libraries Displayed on the Surface of E. coli Cells with Two β-Domains of Opposite Topologies

PubMed Central

Martínez-Arteaga, Rocio; Ruano-Gallego, David; Fraile, Sofía; Margolles, Yago; Teira, Xema; Gutierrez, Carlos; Bodelón, Gustavo; Fernández, Luis Ángel

2013-01-01

Screening of antibody (Ab) libraries by direct display on the surface of E. coli cells is hampered by the presence of the outer membrane (OM). In this work we demonstrate that the native β-domains of EhaA autotransporter and intimin, two proteins from enterohemorrhagic E. coli O157:H7 (EHEC) with opposite topologies in the OM, are effective systems for the display of immune libraries of single domain Abs (sdAbs) from camelids (nanobodies or VHH) on the surface of E. coli K-12 cells and for the selection of high affinity sdAbs using magnetic cell sorting (MACS). We analyzed the capacity of EhaA and intimin β-domains to display individual sdAbs and sdAb libraries obtained after immunization with the extracellular domain of the translocated intimin receptor from EHEC (TirMEHEC). We demonstrated that both systems displayed functional sdAbs on the surface of E. coli cells with little proteolysis and cellular toxicity, although E. coli cells displaying sdAbs with the β-domain of intimin showed higher antigen-binding capacity. Both E. coli display libraries were screened for TirMEHEC binding clones by MACS. High affinity binders were selected by both display systems, although more efficiently with the intimin β-domain. The specificity of the selected clones against TirMEHEC was demonstrated by flow cytometry of E. coli cells, along with ELISA and surface plasmon resonance with purified sdAbs. Finally, we employed the E. coli cell display systems to provide an estimation of the affinity of the selected sdAb by flow cytometry analysis under equilibrium conditions. PMID:24086454

Metabolic flux and nodes control analysis of brewer's yeasts under different fermentation temperature during beer brewing.

PubMed

Yu, Zhimin; Zhao, Haifeng; Zhao, Mouming; Lei, Hongjie; Li, Huiping

2012-12-01

The aim of this work was to further investigate the glycolysis performance of lager and ale brewer's yeasts under different fermentation temperature using a combined analysis of metabolic flux, glycolytic enzyme activities, and flux control. The results indicated that the fluxes through glycolytic pathway decreased with the change of the fermentation temperature from 15 °C to 10 °C, which resulted in the prolonged fermentation times. The maximum activities (V (max)) of hexokinase (HK), phosphofructokinase (PFK), and pyruvate kinase (PK) at key nodes of glycolytic pathway decreased with decreasing fermentation temperature, which was estimated to have different control extent (22-84 %) on the glycolytic fluxes in exponential or flocculent phase. Moreover, the decrease of V (max) of PFK or PK displayed the crucial role in down-regulation of flux in flocculent phase. In addition, the metabolic state of ale strain was more sensitive to the variation of temperature than that of lager strain. The results of the metabolic flux and nodes control analysis in brewer's yeasts under different fermentation temperature may provide an alternative approach to regulate glycolytic flux by changing V (max) and improve the production efficiency and beer quality.

An improved label propagation algorithm based on node importance and random walk for community detection

NASA Astrophysics Data System (ADS)

Ma, Tianren; Xia, Zhengyou

2017-05-01

Currently, with the rapid development of information technology, the electronic media for social communication is becoming more and more popular. Discovery of communities is a very effective way to understand the properties of complex networks. However, traditional community detection algorithms consider the structural characteristics of a social organization only, with more information about nodes and edges wasted. In the meanwhile, these algorithms do not consider each node on its merits. Label propagation algorithm (LPA) is a near linear time algorithm which aims to find the community in the network. It attracts many scholars owing to its high efficiency. In recent years, there are more improved algorithms that were put forward based on LPA. In this paper, an improved LPA based on random walk and node importance (NILPA) is proposed. Firstly, a list of node importance is obtained through calculation. The nodes in the network are sorted in descending order of importance. On the basis of random walk, a matrix is constructed to measure the similarity of nodes and it avoids the random choice in the LPA. Secondly, a new metric IAS (importance and similarity) is calculated by node importance and similarity matrix, which we can use to avoid the random selection in the original LPA and improve the algorithm stability. Finally, a test in real-world and synthetic networks is given. The result shows that this algorithm has better performance than existing methods in finding community structure.

Inhibition of c-Met reduces lymphatic metastasis in RIP-Tag2 transgenic mice

PubMed Central

Sennino, Barbara; Ishiguro-Oonuma, Toshina; Schriver, Brian J.; Christensen, James G.; McDonald, Donald M.

2013-01-01

Inhibition of vascular endothelial growth factor (VEGF) signaling can promote lymph node metastasis in preclinical models, but the mechanism is not fully understood, and successful methods of prevention have not been found. Signaling of hepatocyte growth factor (HGF) and its receptor c-Met can promote the growth of lymphatics and metastasis of some tumors. We sought to explore the contributions of c-Met signaling to lymph node metastasis after inhibition of VEGF signaling. In particular, we examined whether c-Met is upregulated in lymphatics in or near pancreatic neuroendocrine tumors in RIP-Tag2 transgenic mice and whether lymph node metastasis can be reduced by concurrent inhibition of VEGF and c-Met signaling. Inhibition of VEGF signaling by anti-VEGF antibody or sunitinib in mice from age 14 to 17 weeks was accompanied by more intratumoral lymphatics, more tumor cells inside lymphatics, and more lymph node metastases. Under these conditions, lymphatic endothelial cells - like tumor cells - had strong immunoreactivity for c-Met and phospho-c-Met. c-Met blockade by the selective inhibitor PF-04217903 significantly reduced metastasis to local lymph nodes. Together, these results indicate that inhibition of VEGF signaling in RIP-Tag2 mice upregulates c-Met expression in lymphatic endothelial cells, increases the number of intratumoral lymphatics and number of tumor cells within lymphatics, and promotes metastasis to local lymph nodes. Prevention of lymph node metastasis by PF-04217903 in this setting implicates c-Met signaling in tumor cell spread to lymph nodes. PMID:23576559

Structural Transitions in Densifying Networks

NASA Astrophysics Data System (ADS)

Lambiotte, R.; Krapivsky, P. L.; Bhat, U.; Redner, S.

2016-11-01

We introduce a minimal generative model for densifying networks in which a new node attaches to a randomly selected target node and also to each of its neighbors with probability p . The networks that emerge from this copying mechanism are sparse for p <1/2 and dense (average degree increasing with number of nodes N ) for p ≥1/2 . The behavior in the dense regime is especially rich; for example, individual network realizations that are built by copying are disparate and not self-averaging. Further, there is an infinite sequence of structural anomalies at p =2/3 , 3/4 , 4/5 , etc., where the N dependences of the number of triangles (3-cliques), 4-cliques, undergo phase transitions. When linking to second neighbors of the target can occur, the probability that the resulting graph is complete—all nodes are connected—is nonzero as N →∞ .

Optical characterization of ex-vivo axillary lymph nodes of breast-cancer patients using a custom-built spectrophotometer

NASA Astrophysics Data System (ADS)

Sampathkumar, Ashwin; Saegusa-Beecroft, Emi; Mamou, Jonathan; Chitnis, Parag V.; Machi, Junji; Feleppa, Ernest J.

2014-03-01

Quantitative photoacoustics is emerging as a new hybrid modality to investigate diseases and cells in human pathology and cytology studies. Optical absorption of light is the predominant mechanism behind the photoacoustic effect. Therefore, a need exits to characterize the optical properties of specimens and to identify the relevant operating wavelengths for photoacoustic imaging. We have developed a custom low-cost spectrophotometer to measure the optical properties of human axillary lymph nodes dissected for breast-cancer staging. Optical extinction curves of positive and negative nodes were determined in the spectral range of 400 to 1000 nm. We have developed a model to estimate tissue optical properties, taking into account the role of fat and saline. Our results enabled us to select the optimal optical wavelengths for maximizing the imaging contrast between metastatic and noncancerous tissue in axillary lymph nodes.

Embedding global and collective in a torus network with message class map based tree path selection

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

Chen, Dong; Coteus, Paul W.; Eisley, Noel A.

Embodiments of the invention provide a method, system and computer program product for embedding a global barrier and global interrupt network in a parallel computer system organized as a torus network. The computer system includes a multitude of nodes. In one embodiment, the method comprises taking inputs from a set of receivers of the nodes, dividing the inputs from the receivers into a plurality of classes, combining the inputs of each of the classes to obtain a result, and sending said result to a set of senders of the nodes. Embodiments of the invention provide a method, system and computermore » program product for embedding a collective network in a parallel computer system organized as a torus network. In one embodiment, the method comprises adding to a torus network a central collective logic to route messages among at least a group of nodes in a tree structure.« less

Stimulation of Mucosal Mast Cell Growth in Normal and Nude Rat Bone Marrow Cultures

NASA Astrophysics Data System (ADS)

Haig, David M.; McMenamin, Christine; Gunneberg, Christian; Woodbury, Richard; Jarrett, Ellen E. E.

1983-07-01

Mast cells with the morphological and biochemical properties of mucosal mast cells (MMC) appear and proliferate to form the predominant cell type in rat bone marrow cultures stimulated with factors from antigen- or mitogen-activated lymphocytes. Conditioned media causing a selective proliferation of MMC were derived from mesenteric lymph node cells of Nippostrongylus brasiliensis-infected rats restimulated in vitro with specific antigen or from normal or infected rat mesenteric lymph node cells stimulated with concanavalin A. MMC growth factor is not produced by T-cell-depleted mesenteric lymph node cells or by the mesenteric lymph node cells of athymic rats. By contrast, MMC precursors are present in the bone marrow of athymic rats and are normally receptive to the growth factor produced by the lymphocytes of thymus-intact rats. The thymus dependence of MMC hyperplasia is thus based on the requirement of a thymus-independent precursor for a T-cell-derived growth promoter.

Portable multi-node LQCD Monte Carlo simulations using OpenACC

NASA Astrophysics Data System (ADS)

Bonati, Claudio; Calore, Enrico; D'Elia, Massimo; Mesiti, Michele; Negro, Francesco; Sanfilippo, Francesco; Schifano, Sebastiano Fabio; Silvi, Giorgio; Tripiccione, Raffaele

This paper describes a state-of-the-art parallel Lattice QCD Monte Carlo code for staggered fermions, purposely designed to be portable across different computer architectures, including GPUs and commodity CPUs. Portability is achieved using the OpenACC parallel programming model, used to develop a code that can be compiled for several processor architectures. The paper focuses on parallelization on multiple computing nodes using OpenACC to manage parallelism within the node, and OpenMPI to manage parallelism among the nodes. We first discuss the available strategies to be adopted to maximize performances, we then describe selected relevant details of the code, and finally measure the level of performance and scaling-performance that we are able to achieve. The work focuses mainly on GPUs, which offer a significantly high level of performances for this application, but also compares with results measured on other processors.

Developing A Web-based User Interface for Semantic Information Retrieval

NASA Technical Reports Server (NTRS)

Berrios, Daniel C.; Keller, Richard M.

2003-01-01

While there are now a number of languages and frameworks that enable computer-based systems to search stored data semantically, the optimal design for effective user interfaces for such systems is still uncle ar. Such interfaces should mask unnecessary query detail from users, yet still allow them to build queries of arbitrary complexity without significant restrictions. We developed a user interface supporting s emantic query generation for Semanticorganizer, a tool used by scient ists and engineers at NASA to construct networks of knowledge and dat a. Through this interface users can select node types, node attribute s and node links to build ad-hoc semantic queries for searching the S emanticOrganizer network.

Development of a Wireless Network of Temperature Sensors for Yellowstone National Park (USA)

NASA Astrophysics Data System (ADS)

Munday, D. A.; Hutter, T.; Minolli, M.; Obraczka, K.; Manduchi, R.; Petersen, S.; Lowenstern, J. B.; Heasler, H.

2007-12-01

Temperature sensors deployed at Yellowstone clearly document that thermal features can vary in temperature on a variety of timescales and show regional correlations unrelated to meteorological variables such as air temperature. Yellowstone National Park (YNP) staff currently measures temperatures at over 40 thermal features and streams within the park, utilizing USGS stream gaging stations and portable data loggers deployed in geyser basins. The latter measure temperature every 1 to 15 minutes, and the data are physically downloaded after about 30 days. Installation of a wireless sensor network would: 1) save considerable time and effort in data retrieval, 2) minimize lost data due to equipment failure, and 3) provide a means to monitor thermal perturbations in near-real time. To meet this need, we developed a wireless sensor network capable of in-situ monitoring of air and water temperature. Temperature sensors are dispersed as nodes that communicate among themselves and through relays to a single base-station linked to the Internet. The small, weatherproof sensors operate unattended for over six months at temperatures as low as -40°C. Each uses an ultra-low-power Texas Instruments' MSP430 microcontroller and an SD card as mass storage. They are powered by 15Ah, 3.6 v, inert Li-ion batteries and transmit data via 900MHz radio modules with a 1-km range. The initial prototype consists of 4 nodes, and is designed to scale with additional nodes for finer spatial resolution and broader coverage. Temperature measurements are asynchronous from node to node, with intervals as frequent as 30 seconds. Data are stored internally to withstand temporary communication failures; underlying intelligent software is capable of re-routing data through alternative nodes to the base station and a MySQL data archiving system. We also developed a Google-Maps-based, front-end that displays the data, recent trends and sensor locations. The system was tested in the Santa Cruz Mountains and will be used at Yellowstone National Park during Fall 2007.

Dosimetric evaluation of the feasibility of stereotactic body radiotherapy for primary lung cancer with lobe-specific selective elective nodal irradiation.

PubMed

Komatsu, Tetsuya; Kunieda, Etsuo; Kitahara, Tadashi; Akiba, Takeshi; Nagao, Ryuta; Fukuzawa, Tsuyoshi

2016-01-01

More than 10% of all patients treated with stereotactic body radiotherapy (SBRT) for primary lung cancer develop regional lymph node recurrence. We evaluated the dosimetric feasibility of SBRT with lobe-specific selective elective nodal irradiation (ENI) on dose-volume histograms. A total of 21 patients were treated with SBRT for Stage I primary lung cancer between January 2010 and June 2012 at our institution. The extents of lobe-specific selective ENI fields were determined with reference to prior surgical reports. The ENI fields included lymph node stations (LNS) 3 + 4 + 11 for the right upper lobe tumors, LNS 7 + 11 for the right middle or lower lobe tumors, LNS 5 + 11 for the left upper lobe tumors, and LNS 7 + 11 for the left lower lobe tumors. A composite plan was generated by combining the ENI plan and the SBRT plan and recalculating for biologically equivalent doses of 2 Gy per fraction, using a linear quadratic model. The V20 of the lung, D(1cm3) of the spinal cord, D(1cm3) and D(10cm3) of the esophagus and D(10cm3) of the tracheobronchial wall were evaluated. Of the 21 patients, nine patients (43%) could not fulfill the dose constraints. In all these patients, the distance between the planning target volume (PTV) of ENI (PTVeni) and the PTV of SBRT (PTVsrt) was ≤2.0 cm. Of the three patients who developed regional metastasis, two patients had isolated lymph node failure, and the lymph node metastasis was included within the ENI field. When the distance between the PTVeni and PTVsrt is >2.0 cm, SBRT with selective ENI may therefore dosimetrically feasible. © The Author 2015. Published by Oxford University Press on behalf of The Japan Radiation Research Society and Japanese Society for Radiation Oncology.

Toward real-time Monte Carlo simulation using a commercial cloud computing infrastructure.

PubMed

Wang, Henry; Ma, Yunzhi; Pratx, Guillem; Xing, Lei

2011-09-07

Monte Carlo (MC) methods are the gold standard for modeling photon and electron transport in a heterogeneous medium; however, their computational cost prohibits their routine use in the clinic. Cloud computing, wherein computing resources are allocated on-demand from a third party, is a new approach for high performance computing and is implemented to perform ultra-fast MC calculation in radiation therapy. We deployed the EGS5 MC package in a commercial cloud environment. Launched from a single local computer with Internet access, a Python script allocates a remote virtual cluster. A handshaking protocol designates master and worker nodes. The EGS5 binaries and the simulation data are initially loaded onto the master node. The simulation is then distributed among independent worker nodes via the message passing interface, and the results aggregated on the local computer for display and data analysis. The described approach is evaluated for pencil beams and broad beams of high-energy electrons and photons. The output of cloud-based MC simulation is identical to that produced by single-threaded implementation. For 1 million electrons, a simulation that takes 2.58 h on a local computer can be executed in 3.3 min on the cloud with 100 nodes, a 47× speed-up. Simulation time scales inversely with the number of parallel nodes. The parallelization overhead is also negligible for large simulations. Cloud computing represents one of the most important recent advances in supercomputing technology and provides a promising platform for substantially improved MC simulation. In addition to the significant speed up, cloud computing builds a layer of abstraction for high performance parallel computing, which may change the way dose calculations are performed and radiation treatment plans are completed.

A multimodal image guiding system for Navigated Ultrasound Bronchoscopy (EBUS): A human feasibility study

PubMed Central

Hofstad, Erlend Fagertun; Amundsen, Tore; Langø, Thomas; Bakeng, Janne Beate Lervik; Leira, Håkon Olav

2017-01-01

Background Endobronchial ultrasound transbronchial needle aspiration (EBUS-TBNA) is the endoscopic method of choice for confirming lung cancer metastasis to mediastinal lymph nodes. Precision is crucial for correct staging and clinical decision-making. Navigation and multimodal imaging can potentially improve EBUS-TBNA efficiency. Aims To demonstrate the feasibility of a multimodal image guiding system using electromagnetic navigation for ultrasound bronchoschopy in humans. Methods Four patients referred for lung cancer diagnosis and staging with EBUS-TBNA were enrolled in the study. Target lymph nodes were predefined from the preoperative computed tomography (CT) images. A prototype convex probe ultrasound bronchoscope with an attached sensor for position tracking was used for EBUS-TBNA. Electromagnetic tracking of the ultrasound bronchoscope and ultrasound images allowed fusion of preoperative CT and intraoperative ultrasound in the navigation software. Navigated EBUS-TBNA was used to guide target lymph node localization and sampling. Navigation system accuracy was calculated, measured by the deviation between lymph node position in ultrasound and CT in three planes. Procedure time, diagnostic yield and adverse events were recorded. Results Preoperative CT and real-time ultrasound images were successfully fused and displayed in the navigation software during the procedures. Overall navigation accuracy (11 measurements) was 10.0 ± 3.8 mm, maximum 17.6 mm, minimum 4.5 mm. An adequate sample was obtained in 6/6 (100%) of targeted lymph nodes. No adverse events were registered. Conclusions Electromagnetic navigated EBUS-TBNA was feasible, safe and easy in this human pilot study. The clinical usefulness was clearly demonstrated. Fusion of real-time ultrasound, preoperative CT and electromagnetic navigational bronchoscopy provided a controlled guiding to level of target, intraoperative overview and procedure documentation. PMID:28182758

Selection and maturation of antibodies by phage display through fusion to pIX.

PubMed

Tornetta, Mark; Reddy, Ramachandra; Wheeler, John C

2012-09-01

Antibody discovery and optimization by M13 phage display have evolved significantly over the past twenty years. Multiple methods of antibody display and selection have been developed - direct display on pIII or indirect display through a Cysteine disulfide linkage or a coiled-coil adapter protein. Here we describe display of Fab libraries on the smaller pIX protein at the opposite end of the virion and its application to discovery of novel antibodies from naive libraries. Antibody selection based on pIX-mediated display produces results comparable to other in vitro methods and uses an efficient direct infection of antigen-bound phages, eliminating any chemical dissociation step(s). Additionally, some evidence suggests that pIX-mediated display can be more efficient than pIII-mediated display in affinity selections. Functional assessment of phage-derived antibodies can be hindered by insufficient affinities or lack of epitopic diversity. Here we describe an approach to managing primary hits from our Fab phage libraries into epitope bins and subsequent high-throughput maturation of clones to isolate epitope- and sequence-diverse panels of high affinity binders. Use of the Octet biosensor was done to examine Fab binding in a facile label-free method and determine epitope competition groups. A receptor extracellular domain and chemokine were subjected to this method of binning and affinity maturation. Parental clones demonstrated improvement in affinity from 1-100nM to 10-500pM. Copyright © 2012 Elsevier Inc. All rights reserved.

SU-C-BRD-02: A Team Focused Clinical Implementation and Failure Mode and Effects Analysis of HDR Skin Brachytherapy Using Valencia and Leipzig Surface Applicators

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

Sayler, E; Harrison, A; Eldredge-Hindy, H

Purpose: and Leipzig applicators (VLAs) are single-channel brachytherapy surface applicators used to treat skin lesions up to 2cm diameter. Source dwell times can be calculated and entered manually after clinical set-up or ultrasound. This procedure differs dramatically from CT-based planning; the novelty and unfamiliarity could lead to severe errors. To build layers of safety and ensure quality, a multidisciplinary team created a protocol and applied Failure Modes and Effects Analysis (FMEA) to the clinical procedure for HDR VLA skin treatments. Methods: team including physicists, physicians, nurses, therapists, residents, and administration developed a clinical procedure for VLA treatment. The procedure wasmore » evaluated using FMEA. Failure modes were identified and scored by severity, occurrence, and detection. The clinical procedure was revised to address high-scoring process nodes. Results: Several key components were added to the clinical procedure to minimize risk probability numbers (RPN): -Treatments are reviewed at weekly QA rounds, where physicians discuss diagnosis, prescription, applicator selection, and set-up. Peer review reduces the likelihood of an inappropriate treatment regime. -A template for HDR skin treatments was established in the clinical EMR system to standardize treatment instructions. This reduces the chances of miscommunication between the physician and planning physicist, and increases the detectability of an error during the physics second check. -A screen check was implemented during the second check to increase detectability of an error. -To reduce error probability, the treatment plan worksheet was designed to display plan parameters in a format visually similar to the treatment console display. This facilitates data entry and verification. -VLAs are color-coded and labeled to match the EMR prescriptions, which simplifies in-room selection and verification. Conclusion: Multidisciplinary planning and FMEA increased delectability and reduced error probability during VLA HDR Brachytherapy. This clinical model may be useful to institutions implementing similar procedures.« less

Antibody Fab display and selection through fusion to the pIX coat protein of filamentous phage.

PubMed

Tornetta, Mark; Baker, Scott; Whitaker, Brian; Lu, Jin; Chen, Qiang; Pisors, Eileen; Shi, Lei; Luo, Jinquan; Sweet, Raymond; Tsui, Ping

2010-08-31

Fab antibody display on filamentous phage is widely applied to de novo antibody discovery and engineering. Here we describe a phagemid system for the efficient display and affinity selection of Fabs through linkage to the minor coat protein pIX. Display was successful by fusion of either Fd or Lc through a short linker to the amino terminus of pIX and co-expression of the counter Lc or Fd as a secreted, soluble fragment. Assembly of functional Fab was confirmed by demonstration of antigen-specific binding using antibodies of known specificity. Phage displaying a Fab specific for RSV-F protein with Fd linked to pIX showed efficient, antigen-specific enrichment when mixed with phage displaying a different specificity. The functionality of this system for antibody engineering was evaluated in an optimization study. A RSV-F protein specific antibody with an affinity of about 2nM was randomized at 4 positions in light chain CDR1. Three rounds of selection with decreasing antigen concentration yielded Fabs with an affinity improvement up to 70-fold and showed a general correlation between enrichment frequency and affinity. We conclude that the pIX coat protein complements other display systems in filamentous phage as an efficient vehicle for low copy display and selection of Fab proteins. 2010 Elsevier B.V. All rights reserved.

Computer aided stress analysis of long bones utilizing computer tomography

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

Marom, S.A.

1986-01-01

A computer aided analysis method, utilizing computed tomography (CT) has been developed, which together with a finite element program determines the stress-displacement pattern in a long bone section. The CT data file provides the geometry, the density and the material properties for the generated finite element model. A three-dimensional finite element model of a tibial shaft is automatically generated from the CT file by a pre-processing procedure for a finite element program. The developed pre-processor includes an edge detection algorithm which determines the boundaries of the reconstructed cross-sectional images of the scanned bone. A mesh generation procedure than automatically generatesmore » a three-dimensional mesh of a user-selected refinement. The elastic properties needed for the stress analysis are individually determined for each model element using the radiographic density (CT number) of each pixel with the elemental borders. The elastic modulus is determined from the CT radiographic density by using an empirical relationship from the literature. The generated finite element model, together with applied loads, determined from existing gait analysis and initial displacements, comprise a formatted input for the SAP IV finite element program. The output of this program, stresses and displacements at the model elements and nodes, are sorted and displayed by a developed post-processor to provide maximum and minimum values at selected locations in the model.« less

SEASAT: A satellite scatterometer illumination times of selected in situ sites

NASA Technical Reports Server (NTRS)

Schroeder, L. C.; Goodridge, D. R.; Boberly, J. C.; Hughes, J. K.; Sweet, J. L.

1982-01-01

A list of times that the SEASAT A Satellite Scatterometer (SASS) illuminated from directly above or directly abeam, selected surface sites where in situ winds were measured is provided. The list is ordered by the Greenwich Mean Time (GMT) of the midpoint of the illumination period (hit time) for a given surface site. The site identification, the orbit number and the direction from the subtrack in which the truth lies are provided. The accuracy of these times depends in part upon the ascending node times, which are estimated to be within +.1 sec, and on the illumination time relative to the ascending node, which is estimated to be within +6 seconds. The uncertainties in the times provided were judged to be sufficiently small to allow efficient and accurate extraction of SASS and in situ data at the selected surface sites. The list contains approximately six thousand hit times from 61 geographically dispersed sites.

Method and apparatus for selectively harvesting multiple components of a plant material

DOEpatents

Hoskinson, Reed L.; Hess, Richard J.; Kenney, Kevin L.; Svoboda, John M.; Foust, Thomas D.

2004-05-04

A method and apparatus for selectively harvesting multiple components of a plant material. A grain component is separated from the plant material such as by processing the plant material through a primary threshing and separating mechanism. At least one additional component of the plant material is selectively harvested such as by subjecting the plant material to a secondary threshing and separating mechanism. For example, the stems of a plant material may be broken at a location adjacent one or more nodes thereof with the nodes and the internodal stem portions being subsequently separated for harvesting. The at least one additional component (e.g., the internodal stems) may then be consolidated and packaged for subsequent use or processing. The harvesting of the grain and of the at least one additional component may occur within a single harvesting machine, for example, during a single pass over a crop field.

The research of selection model based on LOD in multi-scale display of electronic map

NASA Astrophysics Data System (ADS)

Zhang, Jinming; You, Xiong; Liu, Yingzhen

2008-10-01

This paper proposes a selection model based on LOD to aid the display of electronic map. The ratio of display scale to map scale is regarded as a LOD operator. The categorization rule, classification rule, elementary rule and spatial geometry character rule of LOD operator setting are also concluded.

JuxtaView - A tool for interactive visualization of large imagery on scalable tiled displays

USGS Publications Warehouse

Krishnaprasad, N.K.; Vishwanath, V.; Venkataraman, S.; Rao, A.G.; Renambot, L.; Leigh, J.; Johnson, A.E.; Davis, B.

2004-01-01

JuxtaView is a cluster-based application for viewing ultra-high-resolution images on scalable tiled displays. We present in JuxtaView, a new parallel computing and distributed memory approach for out-of-core montage visualization, using LambdaRAM, a software-based network-level cache system. The ultimate goal of JuxtaView is to enable a user to interactively roam through potentially terabytes of distributed, spatially referenced image data such as those from electron microscopes, satellites and aerial photographs. In working towards this goal, we describe our first prototype implemented over a local area network, where the image is distributed using LambdaRAM, on the memory of all nodes of a PC cluster driving a tiled display wall. Aggressive pre-fetching schemes employed by LambdaRAM help to reduce latency involved in remote memory access. We compare LambdaRAM with a more traditional memory-mapped file approach for out-of-core visualization. ?? 2004 IEEE.

Clinical significance of prophylactic central compartment neck dissection in the treatment of clinically node-negative papillary thyroid cancer patients.

PubMed

Gambardella, Claudio; Tartaglia, Ernesto; Nunziata, Anna; Izzo, Graziella; Siciliano, Giuseppe; Cavallo, Fabio; Mauriello, Claudio; Napolitano, Salvatore; Thomas, Guglielmo; Testa, Domenico; Rossetti, Gianluca; Sanguinetti, Alessandro; Avenia, Nicola; Conzo, Giovanni

2016-09-19

Lymph nodal involvement is very common in differentiated thyroid cancer, and in addition, cervical lymph node micrometastases are observed in up to 80 % of papillary thyroid cancers. During the last decades, the role of routine central lymph node dissection (RCLD) in the treatment of papillary thyroid cancer (PTC) has been an object of research, and it is now still controversial. Nevertheless, many scientific societies and referral authors have definitely stated that even if in expert hands, RCLD is not associated to higher morbidity; it should be indicated only in selected cases. In order to better analyze the current role of prophylactic neck dissection in the surgical treatment of papillary thyroid cancers, an analysis of the most recent literature data was performed. Prophylactic or therapeutic lymph node dissection, selective, lateral or central lymph node dissection, modified radical neck dissection, and papillary thyroid cancer were used by the authors as keywords performing a PubMed database research. Literature reviews, PTCs large clinical series and the most recent guidelines of different referral endocrine societies, inhering neck dissection for papillary thyroid cancers, were also specifically evaluated. A higher PTC incidence was nowadays reported in differentiated thyroid cancer (DTC) clinical series. In addition, ultrasound guided fine-needle aspiration citology allowed a more precocious diagnosis in the early phases of disease. The role of prophylactic neck dissection in papillary thyroid cancer management remains controversial especially regarding indications, approach, and surgical extension. Even if morbidity rates seem to be similar to those reported after total thyroidectomy alone, RCLD impact on local recurrence and long-term survival is still a matter of research. Nevertheless, only a selective use in high-risk cases is supported by more and more scientific data. In the last years, higher papillary thyroid cancer incidence and more precocious diagnoses were worldwide reported. Among endocrine and neck surgeons, there is agreement about indications to prophylactic treatment of node-negative "high-risk" patients. A recent trend toward RCLD avoiding radioactive treatment is still debated, but nevertheless, prophylactic dissections in low-risk cases should be avoided. Prospective randomized trials are needed to evaluate the benefits of different approaches and allow to drawn definitive conclusions.

Distributed clone detection in static wireless sensor networks: random walk with network division.

PubMed

Khan, Wazir Zada; Aalsalem, Mohammed Y; Saad, N M

2015-01-01

Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads.

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.

Correlations in the degeneracy of structurally controllable topologies for networks

NASA Astrophysics Data System (ADS)

Campbell, Colin; Aucott, Steven; Ruths, Justin; Ruths, Derek; Shea, Katriona; Albert, Réka

2017-04-01

Many dynamic systems display complex emergent phenomena. By directly controlling a subset of system components (nodes) via external intervention it is possible to indirectly control every other component in the system. When the system is linear or can be approximated sufficiently well by a linear model, methods exist to identify the number and connectivity of a minimum set of external inputs (constituting a so-called minimal control topology, or MCT). In general, many MCTs exist for a given network; here we characterize a broad ensemble of empirical networks in terms of the fraction of nodes and edges that are always, sometimes, or never a part of an MCT. We study the relationships between the measures, and apply the methodology to the T-LGL leukemia signaling network as a case study. We show that the properties introduced in this report can be used to predict key components of biological networks, with potentially broad applications to network medicine.

Supercomputing 2002: NAS Demo Abstracts

NASA Technical Reports Server (NTRS)

Parks, John (Technical Monitor)

2002-01-01

The hyperwall is a new concept in visual supercomputing, conceived and developed by the NAS Exploratory Computing Group. The hyperwall will allow simultaneous and coordinated visualization and interaction of an array of processes, such as a the computations of a parameter study or the parallel evolutions of a genetic algorithm population. Making over 65 million pixels available to the user, the hyperwall will enable and elicit qualitatively new ways of leveraging computers to accomplish science. It is currently still unclear whether we will be able to transport the hyperwall to SC02. The crucial display frame still has not been completed by the metal fabrication shop, although they promised an August delivery. Also, we are still working the fragile node issue, which may require transplantation of the compute nodes from the present 2U cases into 3U cases. This modification will increase the present 3-rack configuration to 5 racks.

Near-infrared autofluorescence imaging to detect parathyroid glands in thyroid surgery.

PubMed

Ladurner, R; Al Arabi, N; Guendogar, U; Hallfeldt, Kkj; Stepp, H; Gallwas, Jks

2018-01-01

Objective To identify and save parathyroid glands during thyroidectomy by displaying their autofluorescence. Methods Autofluorescence imaging was carried out during thyroidectomy with and without central lymph node dissection. After visual recognition by the surgeon, the parathyroid glands and the surrounding tissue were exposed to near-infrared light with a wavelength of 690-770 nm using a modified Karl Storz near infrared/indocyanine green endoscopic system. Parathyroid tissue was expected to show near infrared autofluorescence at 820 nm, captured in the blue channel of the camera. Results We investigated 41 parathyroid glands from 20 patients; 37 glands were identified correctly based on near-infrared autofluorescence. Neither lymph nodes nor thyroid revealed substantial autofluorescence and nor did adipose tissue. Conclusions Parathyroid tissue is characterised by showing autofluorescence in the near-infrared spectrum. This effect can be used to identify and preserve parathyroid glands during thyroidectomy.

Cervical lymph node metastasis in adenoid cystic carcinoma of the major salivary glands.

PubMed

2017-02-01

To verify the prevalence of cervical lymph node metastasis in adenoid cystic carcinoma of major salivary glands, and to establish recommendations for elective neck treatment. A search was conducted of the US National Library of Medicine database. Appropriate articles were selected from the abstracts, and the original publications were obtained to extract data. Among 483 cases of major salivary gland adenoid cystic carcinoma, a total of 90 (18.6 per cent) had cervical metastasis. The prevalence of positive nodes from adenoid cystic carcinoma was 14.5 per cent for parotid gland, 22.5 per cent for submandibular gland and 24.7 per cent for sublingual gland. Cervical lymph node metastasis occurred more frequently in patients with primary tumour stage T3-4 adenoid cystic carcinoma, and was usually located in levels II and III in the neck. Adenoid cystic carcinoma of the major salivary glands is associated with a significant prevalence of cervical node metastasis, and elective neck treatment is indicated for T3 and T4 primary tumours, as well as tumours with other histological risk factors.

Current advances in diagnosis and surgical treatment of lymph node metastasis in head and neck cancer

PubMed Central

Teymoortash, A.; Werner, J. A.

2012-01-01

Still today, the status of the cervical lymph nodes is the most important prognostic factor for head and neck cancer. So the individual treatment concept of the lymphatic drainage depends on the treatment of the primary tumor as well as on the presence or absence of suspect lymph nodes in the imaging diagnosis. Neck dissection may have either a therapeutic objective or a diagnostic one. The selective neck dissection is currently the method of choice for the treatment of patients with advanced head and neck cancers and clinical N0 neck. For oncologic reasons, this procedure is generally recommended with acceptable functional and aesthetic results, especially under the aspect of the mentioned staging procedure. In this review article, current aspects on pre- and posttherapeutic staging of the cervical lymph nodes are described and the indication and the necessary extent of neck dissection for head and neck cancer is discussed. Additionally the critical question is discussed if the lymph node metastasis bears an intrinsic risk of metastatic development and thus its removal in a most possible early stage plays an important role. PMID:23320056

A New Random Walk for Replica Detection in WSNs.

PubMed

Aalsalem, Mohammed Y; Khan, Wazir Zada; Saad, N M; Hossain, Md Shohrab; Atiquzzaman, Mohammed; Khan, Muhammad Khurram

2016-01-01

Wireless Sensor Networks (WSNs) are vulnerable to Node Replication attacks or Clone attacks. Among all the existing clone detection protocols in WSNs, RAWL shows the most promising results by employing Simple Random Walk (SRW). More recently, RAND outperforms RAWL by incorporating Network Division with SRW. Both RAND and RAWL have used SRW for random selection of witness nodes which is problematic because of frequently revisiting the previously passed nodes that leads to longer delays, high expenditures of energy with lower probability that witness nodes intersect. To circumvent this problem, we propose to employ a new kind of constrained random walk, namely Single Stage Memory Random Walk and present a distributed technique called SSRWND (Single Stage Memory Random Walk with Network Division). In SSRWND, single stage memory random walk is combined with network division aiming to decrease the communication and memory costs while keeping the detection probability higher. Through intensive simulations it is verified that SSRWND guarantees higher witness node security with moderate communication and memory overheads. SSRWND is expedient for security oriented application fields of WSNs like military and medical.

A New Random Walk for Replica Detection in WSNs

PubMed Central

Aalsalem, Mohammed Y.; Saad, N. M.; Hossain, Md. Shohrab; Atiquzzaman, Mohammed; Khan, Muhammad Khurram

2016-01-01

Wireless Sensor Networks (WSNs) are vulnerable to Node Replication attacks or Clone attacks. Among all the existing clone detection protocols in WSNs, RAWL shows the most promising results by employing Simple Random Walk (SRW). More recently, RAND outperforms RAWL by incorporating Network Division with SRW. Both RAND and RAWL have used SRW for random selection of witness nodes which is problematic because of frequently revisiting the previously passed nodes that leads to longer delays, high expenditures of energy with lower probability that witness nodes intersect. To circumvent this problem, we propose to employ a new kind of constrained random walk, namely Single Stage Memory Random Walk and present a distributed technique called SSRWND (Single Stage Memory Random Walk with Network Division). In SSRWND, single stage memory random walk is combined with network division aiming to decrease the communication and memory costs while keeping the detection probability higher. Through intensive simulations it is verified that SSRWND guarantees higher witness node security with moderate communication and memory overheads. SSRWND is expedient for security oriented application fields of WSNs like military and medical. PMID:27409082

Node-controlled allocation of mineral elements in Poaceae.

PubMed

Yamaji, Naoki; Ma, Jian Feng

2017-10-01

Mineral elements taken up by the roots will be delivered to different organs and tissues depending on their requirements. In Poaceae, this selective distribution is mainly mediated in the nodes, which have highly developed and fully organized vascular systems. Inter-vascular transfer of mineral elements from enlarged vascular bundles to diffuse vascular bundles is required for their preferential distribution to developing tissues and reproductive organs. A number of transporters involved in this inter-vascular transfer processes have been identified mainly in rice. They are localized at the different cell layers and form an efficient machinery within the node. Furthermore, some these transporters show rapid response to the environmental changes of mineral elements at the protein level. In addition to the node-based transporters, distinct nodal structures including enlarged xylem area, folded plasma membrane of xylem transfer cells and presence of an apoplastic barrier are also required for the efficient inter-vascular transfer. Manipulation of node-based transporters will provide a novel breeding target to improve nutrient use efficiency, productivity, nutritional value and safety in cereal crops. Copyright © 2017 Elsevier Ltd. All rights reserved.

Solvable model for chimera states of coupled oscillators.

PubMed

Abrams, Daniel M; Mirollo, Rennie; Strogatz, Steven H; Wiley, Daniel A

2008-08-22

Networks of identical, symmetrically coupled oscillators can spontaneously split into synchronized and desynchronized subpopulations. Such chimera states were discovered in 2002, but are not well understood theoretically. Here we obtain the first exact results about the stability, dynamics, and bifurcations of chimera states by analyzing a minimal model consisting of two interacting populations of oscillators. Along with a completely synchronous state, the system displays stable chimeras, breathing chimeras, and saddle-node, Hopf, and homoclinic bifurcations of chimeras.

The C2 Workstation and Data Replication over Disadvantaged Tactical Communication Links

DTIC Science & Technology

2007-09-01

person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number...SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT UU 18. NUMBER OF PAGES 14 19a. NAME OF RESPONSIBLE PERSON a. REPORT unclassified b...PUBLIC RELEASE C2WS Physical Environment Zodiac Network Radio Network Combat Level Node (Vehicle) Radio Local Store Local Store Local Store To Other

Human Eosinophils Express Functional CCR7

PubMed Central

Ueki, Shigeharu; Estanislau, Jessica; Weller, Peter F.

2013-01-01

Human eosinophils display directed chemotactic activity toward an array of soluble chemokines. Eosinophils have been observed to migrate to draining lymph nodes in experimental models of allergic inflammation, yet it is unknown whether eosinophils express CCR7, a key chemokine receptor in coordinating leukocyte trafficking to lymph nodes. The purpose of this study is to demonstrate expression of CCR7 by human eosinophils and functional responses to CCL19 and CCL21, the known ligands of CCR7. Human eosinophils were purified by negative selection from healthy donors. CCR7 expression of freshly purified, unstimulated eosinophils and of IL-5–primed eosinophils was determined by flow cytometry and Western blot. Chemotaxis to CCL19 and CCL21 was measured in transwell assays. Shape changes to CCL19 and CCL21 were analyzed by flow cytometry and microscopy. Calcium fluxes of fluo-4 AM–loaded eosinophils were recorded by flow cytometry after chemokine stimulation. ERK phosphorylation of CCL19- and CCL21-stimulated eosinophils was measured by Western blot and Luminex assay. Human eosinophils expressed CCR7 as demonstrated by flow cytometry and Western blots. Eosinophils exhibited detectable cell surface expression of CCR7. IL-5–primed eosinophils exhibited chemotaxis toward CCL19 and CCL21 in a dose-dependent fashion. Upon stimulation with CCL19 or CCL21, IL-5–primed eosinophils demonstrated dose-dependent shape changes with polarization of F-actin and exhibited calcium influxes. Finally, primed eosinophils stimulated with CCL19 or CCL21 exhibited increased phosphorylation of ERK in response to both CCR7 ligands. We demonstrate that human eosinophils express CCR7 and have multipotent responses to the known ligands of CCR7. PMID:23449735

Looking for complexity in quantitative semiology of frontal and temporal lobe seizures using neuroethology and graph theory.

PubMed

Bertti, Poliana; Tejada, Julian; Martins, Ana Paula Pinheiro; Dal-Cól, Maria Luiza Cleto; Terra, Vera Cristina; de Oliveira, José Antônio Cortes; Velasco, Tonicarlo Rodrigues; Sakamoto, Américo Ceiki; Garcia-Cairasco, Norberto

2014-09-01

Epileptic syndromes and seizures are the expression of complex brain systems. Because no analysis of complexity has been applied to epileptic seizure semiology, our goal was to apply neuroethology and graph analysis to the study of the complexity of behavioral manifestations of epileptic seizures in human frontal lobe epilepsy (FLE) and temporal lobe epilepsy (TLE). We analyzed the video recordings of 120 seizures of 18 patients with FLE and 28 seizures of 28 patients with TLE. All patients were seizure-free >1 year after surgery (Engel Class I). All patients' behavioral sequences were analyzed by means of a glossary containing all behaviors and analyzed for neuroethology (Ethomatic software). The same series were used for graph analysis (CYTOSCAPE). Behaviors, displayed as nodes, were connected by edges to other nodes according to their temporal sequence of appearance. Using neuroethology analysis, we confirmed data in the literature such as in FLE: brief/frequent seizures, complex motor behaviors, head and eye version, unilateral/bilateral tonic posturing, speech arrest, vocalization, and rapid postictal recovery and in the case of TLE: presence of epigastric aura, lateralized dystonias, impairment of consciousness/speech during ictal and postictal periods, and development of secondary generalization. Using graph analysis metrics of FLE and TLE confirmed data from flowcharts. However, because of the algorithms we used, they highlighted more powerfully the connectivity and complex associations among behaviors in a quite selective manner, depending on the origin of the seizures. The algorithms we used are commonly employed to track brain connectivity from EEG and MRI sources, which makes our study very promising for future studies of complexity in this field. Copyright © 2014 Elsevier Inc. All rights reserved.

Nomogram for predicting the benefit of neoadjuvant chemoradiotherapy for patients with esophageal cancer: a SEER-Medicare analysis.

PubMed

Eil, Robert; Diggs, Brian S; Wang, Samuel J; Dolan, James P; Hunter, John G; Thomas, Charles R

2014-02-15

The survival impact of neoadjuvant chemoradiotherapy (CRT) on esophageal cancer remains difficult to establish for specific patients. The aim of the current study was to create a Web-based prediction tool providing individualized survival projections based on tumor and treatment data. Patients diagnosed with esophageal cancer between 1997 and 2005 were selected from the Surveillance, Epidemiology, and End Results (SEER)-Medicare database. The covariates analyzed were sex, T and N classification, histology, total number of lymph nodes examined, and treatment with esophagectomy or CRT followed by esophagectomy. After propensity score weighting, a log-logistic regression model for overall survival was selected based on the Akaike information criterion. A total of 824 patients with esophageal cancer who were treated with esophagectomy or trimodal therapy met the selection criteria. On multivariate analysis, age, sex, T and N classification, number of lymph nodes examined, treatment, and histology were found to be significantly associated with overall survival and were included in the regression analysis. Preoperative staging data and final surgical margin status were not available within the SEER-Medicare data set and therefore were not included. The model predicted that patients with T4 or lymph node disease benefitted from CRT. The internally validated concordance index was 0.72. The SEER-Medicare database of patients with esophageal cancer can be used to produce a survival prediction tool that: 1) serves as a counseling and decision aid to patients and 2) assists in risk modeling. Patients with T4 or lymph node disease appeared to benefit from CRT. This nomogram may underestimate the benefit of CRT due to its variable downstaging effect on pathologic stage. It is available at skynet.ohsu.edu/nomograms. © 2013 American Cancer Society.

Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

NASA Technical Reports Server (NTRS)

Segui, John S.; Jennings, Esther H.; Clare, Loren P.

2013-01-01

Contact Graph Routing (CGR) for Delay/Disruption Tolerant Networking (DTN) space-based networks makes use of the predictable nature of node contacts to make real-time routing decisions given unpredictable traffic patterns. The contact graph will have been disseminated to all nodes before the start of route computation. CGR was designed for space-based networking environments where future contact plans are known or are independently computable (e.g., using known orbital dynamics). For each data item (known as a bundle in DTN), a node independently performs route selection by examining possible paths to the destination. Route computation could conceivably run thousands of times a second, so computational load is important. This work refers to the simulation software model of Enhanced Contact Graph Routing (ECGR) for DTN Bundle Protocol in JPL's MACHETE simulation tool. The simulation model was used for performance analysis of CGR and led to several performance enhancements. The simulation model was used to demonstrate the improvements of ECGR over CGR as well as other routing methods in space network scenarios. ECGR moved to using earliest arrival time because it is a global monotonically increasing metric that guarantees the safety properties needed for the solution's correctness since route re-computation occurs at each node to accommodate unpredicted changes (e.g., traffic pattern, link quality). Furthermore, using earliest arrival time enabled the use of the standard Dijkstra algorithm for path selection. The Dijkstra algorithm for path selection has a well-known inexpensive computational cost. These enhancements have been integrated into the open source CGR implementation. The ECGR model is also useful for route metric experimentation and comparisons with other DTN routing protocols particularly when combined with MACHETE's space networking models and Delay Tolerant Link State Routing (DTLSR) model.

Tile-Image Merging and Delivering for Virtual Camera Services on Tiled-Display for Real-Time Remote Collaboration

NASA Astrophysics Data System (ADS)

Choe, Giseok; Nang, Jongho

The tiled-display system has been used as a Computer Supported Cooperative Work (CSCW) environment, in which multiple local (and/or remote) participants cooperate using some shared applications whose outputs are displayed on a large-scale and high-resolution tiled-display, which is controlled by a cluster of PC's, one PC per display. In order to make the collaboration effective, each remote participant should be aware of all CSCW activities on the titled display system in real-time. This paper presents a capturing and delivering mechanism of all activities on titled-display system to remote participants in real-time. In the proposed mechanism, the screen images of all PC's are periodically captured and delivered to the Merging Server that maintains separate buffers to store the captured images from the PCs. The mechanism selects one tile image from each buffer, merges the images to make a screen shot of the whole tiled-display, clips a Region of Interest (ROI), compresses and streams it to remote participants in real-time. A technical challenge in the proposed mechanism is how to select a set of tile images, one from each buffer, for merging so that the tile images displayed at the same time on the tiled-display can be properly merged together. This paper presents three selection algorithms; a sequential selection algorithm, a capturing time based algorithm, and a capturing time and visual consistency based algorithm. It also proposes a mechanism of providing several virtual cameras on tiled-display system to remote participants by concurrently clipping several different ROI's from the same merged tiled-display images, and delivering them after compressing with video encoders requested by the remote participants. By interactively changing and resizing his/her own ROI, a remote participant can check the activities on the tiled-display effectively. Experiments on a 3 × 2 tiled-display system show that the proposed merging algorithm can build a tiled-display image stream synchronously, and the ROI-based clipping and delivering mechanism can provide individual views on the tiled-display system to multiple remote participants in real-time.

Resting-State Network Topology Differentiates Task Signals across the Adult Life Span.

PubMed

Chan, Micaela Y; Alhazmi, Fahd H; Park, Denise C; Savalia, Neil K; Wig, Gagan S

2017-03-08

Brain network connectivity differs across individuals. For example, older adults exhibit less segregated resting-state subnetworks relative to younger adults (Chan et al., 2014). It has been hypothesized that individual differences in network connectivity impact the recruitment of brain areas during task execution. While recent studies have described the spatial overlap between resting-state functional correlation (RSFC) subnetworks and task-evoked activity, it is unclear whether individual variations in the connectivity pattern of a brain area (topology) relates to its activity during task execution. We report data from 238 cognitively normal participants (humans), sampled across the adult life span (20-89 years), to reveal that RSFC-based network organization systematically relates to the recruitment of brain areas across two functionally distinct tasks (visual and semantic). The functional activity of brain areas (network nodes) were characterized according to their patterns of RSFC: nodes with relatively greater connections to nodes in their own functional system ("non-connector" nodes) exhibited greater activity than nodes with relatively greater connections to nodes in other systems ("connector" nodes). This "activation selectivity" was specific to those brain systems that were central to each of the tasks. Increasing age was accompanied by less differentiated network topology and a corresponding reduction in activation selectivity (or differentiation) across relevant network nodes. The results provide evidence that connectional topology of brain areas quantified at rest relates to the functional activity of those areas during task. Based on these findings, we propose a novel network-based theory for previous reports of the "dedifferentiation" in brain activity observed in aging. SIGNIFICANCE STATEMENT Similar to other real-world networks, the organization of brain networks impacts their function. As brain network connectivity patterns differ across individuals, we hypothesized that individual differences in network connectivity would relate to differences in brain activity. Using functional MRI in a group of individuals sampled across the adult life span (20-89 years), we measured correlations at rest and related the functional connectivity patterns to measurements of functional activity during two independent tasks. Brain activity varied in relation to connectivity patterns revealed by large-scale network analysis. This relationship tracked the differences in connectivity patterns accompanied by older age, providing important evidence for a link between the topology of areal connectivity measured at rest and the functional recruitment of these areas during task performance. Copyright © 2017 Chan et al.

Exploring virtual reality technology and the Oculus Rift for the examination of digital pathology slides

PubMed Central

Farahani, Navid; Post, Robert; Duboy, Jon; Ahmed, Ishtiaque; Kolowitz, Brian J.; Krinchai, Teppituk; Monaco, Sara E.; Fine, Jeffrey L.; Hartman, Douglas J.; Pantanowitz, Liron

2016-01-01

Background: Digital slides obtained from whole slide imaging (WSI) platforms are typically viewed in two dimensions using desktop personal computer monitors or more recently on mobile devices. To the best of our knowledge, we are not aware of any studies viewing digital pathology slides in a virtual reality (VR) environment. VR technology enables users to be artificially immersed in and interact with a computer-simulated world. Oculus Rift is among the world's first consumer-targeted VR headsets, intended primarily for enhanced gaming. Our aim was to explore the use of the Oculus Rift for examining digital pathology slides in a VR environment. Methods: An Oculus Rift Development Kit 2 (DK2) was connected to a 64-bit computer running Virtual Desktop software. Glass slides from twenty randomly selected lymph node cases (ten with benign and ten malignant diagnoses) were digitized using a WSI scanner. Three pathologists reviewed these digital slides on a 27-inch 5K display and with the Oculus Rift after a 2-week washout period. Recorded endpoints included concordance of final diagnoses and time required to examine slides. The pathologists also rated their ease of navigation, image quality, and diagnostic confidence for both modalities. Results: There was 90% diagnostic concordance when reviewing WSI using a 5K display and Oculus Rift. The time required to examine digital pathology slides on the 5K display averaged 39 s (range 10–120 s), compared to 62 s with the Oculus Rift (range 15–270 s). All pathologists confirmed that digital pathology slides were easily viewable in a VR environment. The ratings for image quality and diagnostic confidence were higher when using the 5K display. Conclusion: Using the Oculus Rift DK2 to view and navigate pathology whole slide images in a virtual environment is feasible for diagnostic purposes. However, image resolution using the Oculus Rift device was limited. Interactive VR technologies such as the Oculus Rift are novel tools that may be of use in digital pathology. PMID:27217972

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.

[Analysis of the patterns of cervical lymph node recurrence in patients with cN0 papillary thyroid carcinoma after central neck lymph node dissection].

PubMed

Huang, Hui; Xu, Zhengang; Wang, Xiaolei; Wu, Yuehuang; Liu, Shaoyan

2015-10-01

To retrospectively analyze the long-term results of prophylactic central lymph node dissection in cN0 papillary thyroid carcinoma (PTC), and investigate the treatment method of the cervical lymph nodes for cN0 PTC. One hundred and thirty-six patients with cN0 PTC were treated by surgery at the Cancer Hospital of Chinese Academy of Medical Sciences from 2000 to 2006. Their clinicopathological characteristics, surgical procedures and survival outcomes were collected and analyzed. The occult lymph node metastasis rate in central compartment was 61.0%. The average number of positive lymph nodes was 2.47 (1-13), in which 54 patients had 1-2 and 29 patients had ≥ 3 positive lymph nodes. Multiple logistic regression analysis showed that age less than 45 (P=0.001, OR 3.571, 95% CI 1.681-7.587)and extracapsular spread (ECS) (P=0.015, OR 2.99, 95% CI 1.241-7.202)were independent risk factors for lymph node metastasis in the central compartment. The ten-year cumulative overall survival rate was 98.3% and cumulative lateral neck metastasis rate was 25.2%. Multivariate analysis with Cox regression model showed that ECS (P=0.001, OR 5.211, 95% CI1.884-14.411) and positive lymph nodes in the central compartment ≥ 3 (P=0.009, OR 4.005, 95% CI 1.419-11.307) were independent risk factors for lymph node recurrence in the lateral neck region. The distribution of recurrent lymph nodes: level IV (82.4%), level III (64.7%), level II (29.4%) and level V (11.8%). Routine central lymph node dissection, at least unilateral, should be conducted for cN0 papillary thyroid carcinoma. Attention should be paid to the treatment of lateral neck region in patients with cN0 papillary thyroid carcinoma. Selective neck dissection is suggested for cN0 PTC with ECS or positive central lymph nodes ≥ 3, or both. The range of dissection should include level III and IV at least.

Interval sentinel lymph nodes in melanoma: a digital pathology analysis of Ki67 expression and microvascular density.

PubMed

Marinaccio, Christian; Giudice, Giuseppe; Nacchiero, Eleonora; Robusto, Fabio; Opinto, Giuseppina; Lastilla, Gaetano; Maiorano, Eugenio; Ribatti, Domenico

2016-08-01

The presence of interval sentinel lymph nodes in melanoma is documented in several studies, but controversies still exist about the management of these lymph nodes. In this study, an immunohistochemical evaluation of tumor cell proliferation and neo-angiogenesis has been performed with the aim of establishing a correlation between these two parameters between positive and negative interval sentinel lymph nodes. This retrospective study reviewed data of 23 patients diagnosed with melanoma. Bioptic specimens of interval sentinel lymph node were retrieved, and immunohistochemical reactions on tissue sections were performed using Ki67 as a marker of proliferation and CD31 as a blood vessel marker for the study of angiogenesis. The entire stained tissue sections for each case were digitized using Aperio Scanscope Cs whole-slide scanning platform and stored as high-resolution images. Image analysis was carried out on three selected fields of equal area using IHC Nuclear and Microvessel analysis algorithms to determine positive Ki67 nuclei and vessel number. Patients were divided into positive and negative interval sentinel lymph node groups, and the positive interval sentinel lymph node group was further divided into interval positive with micrometastasis and interval positive with macrometastasis subgroups. The analysis revealed a significant difference between positive and negative interval sentinel lymph nodes in the percentage of Ki67-positive nuclei and mean vessel number suggestive of an increased cellular proliferation and angiogenesis in positive interval sentinel lymph nodes. Further analysis in the interval positive lymph node group showed a significant difference between micro- and macrometastasis subgroups in the percentage of Ki67-positive nuclei and mean vessel number. Percentage of Ki67-positive nuclei was increased in the macrometastasis subgroup, while mean vessel number was increased in the micrometastasis subgroup. The results of this study suggest that the correlation between tumor cell proliferation and neo-angiogenesis in interval sentinel lymph nodes in melanoma could be used as a good predictive marker to distinguish interval positive sentinel lymph nodes with micrometastasis from interval positive lymph nodes with macrometastasis subgroups.

LYMPHOCYTIC THYROIDITIS IS ASSOCIATED WITH INCREASED NUMBER OF BENIGN CERVICAL NODES AND FEWER CENTRAL NECK COMPARTMENT METASTATIC LYMPH NODES IN PATIENTS WITH DIFFERENTIATED THYROID CANCER.

PubMed

Donangelo, Ines; Walts, Ann E; Bresee, Catherine; Braunstein, Glenn D

2016-10-01

Whether or not autoimmune thyroid disease influences the progression of differentiated thyroid cancer (DTC) remains controversial. Findings of previous studies are influenced by lead time bias and/or procedure bias selection. These biases can be reduced by studying a single-institution patient population that underwent a similar extent of surgical resection. From a cohort of 660 patients with DTC who underwent thyroidectomy, we retrospectively studied 357 patients who underwent total thyroidectomy and central compartment node dissection (CCND) for DTC between 2003 and 2013. Forty-one percent (140/345) of study patients had lymphocytic thyroiditis (LT), and 30% (91/301) had serum positive for thyroglobulin antibody (TgAb). LT was reported in 78% of the TgAb-positive cases. Sixty percent (213/357) of cases had metastatic thyroid carcinoma in 1 or more neck lymph nodes (55% [198/357] central compartment, and 22% [77/356] lateral compartment). Patients with LT had fewer metastatic cervical lymph nodes than those with no LT (2.7 ± 4.7 vs 3.5 ± 4.8, respectively, P = .0285). Patients with positive TgAb and thyroiditis had a larger number of benign cervical lymph nodes removed than those with negative TgAb or no LT. No significant difference was observed in age, tumor size, multifocality, extrathyroidal extension, vascular invasion, or frequency of cervical lymph node metastasis between TgAb-negative and -positive cases or between cases with and without LT. Lymphocytic thyroiditis is associated with fewer central neck compartment metastatic lymph nodes and a larger number of excised reactive benign cervical lymph nodes. Whether this association indicates a protective role of thyroid autoimmunity in lymph node spreading remains unclear. CCND = central compartment node dissection DTC = differentiated thyroid cancer HT = Hashimoto thyroiditis LT = lymphocytic thyroiditis TgAb = thyroglobulin antibody TPO = thyroid peroxidase.

Preoperative 18F-FDG-PET/CT imaging and sentinel node biopsy in the detection of regional lymph node metastases in malignant melanoma.

PubMed

Singh, Baljinder; Ezziddin, Samer; Palmedo, Holger; Reinhardt, Michael; Strunk, Holger; Tüting, Thomas; Biersack, Hans-Jürgen; Ahmadzadehfar, Hojjat

2008-10-01

The objective of this study was to evaluate the role of preoperative 18F-fluorodeoxyglucose-positron emission tomography/computed tomography scanning, preoperative lymphoscintigraphy (LS), and sentinel lymph node biopsy in patients with malignant melanoma. Fifty-two patients (36 men: 16 women; mean age 55.0+/-13.0 years; median age 61 years; range 17-76 years) with malignant melanoma were selected. According to the latest version of the American Joint Committee on Cancer staging system, the disease in the study patients was initially classified as either stage I or II. The other primary tumor characteristics were mean Breslow depth=2.87 mm and median=2 mm; range 1-12.0 mm and Clarks levels III-V. None of the study patients had clinical or radiological evidence of regional lymph node metastatic disease. At least one sentinel node was identified in all patients. Preoperative LS detected a total of 111 sentinel lymph nodes (average 2.13 sentinel lymph node per patient) and demonstrated a single nodal draining basin in 38 (73%) patients and multiple (2-3 draining basins) in the remaining 14 (27%) patients. Fourteen out of the 52 patients (27%) had at least one involved sentinel node. Positron emission tomography was true positive in two patients with a sentinel node greater than 1 cm and false positive in two other patients. In this study, the detection of sentinel lymph node by LS and gamma probe had a sensitivity of 100%. In contrast, 18F-FDG-PET imaging demonstrated very low sensitivity (14.3%; 95% CI, 2.5 to 44%) and positive predictive value (50%; 95% CI, 9 to 90%) for localizing the subclinical nodal metastases. The specificity, net present value, and diagnostic accuracy were 94.7, 75, and 73%, respectively. Preoperative fluorodeoxyglucose-positron emission tomography/computed tomography imaging is not able to substitute LS/sentinel lymph node biopsy in patients at stage I or II.

Selective sentinel lymph node biopsy in male breast cancer.

PubMed

Martin-Marcuartu, J J; Alvarez-Perez, R M; Sousa Vaquero, J M; Jimenez-Hoyuela García, J M

To evaluate the reproducibility of the sentinel lymph node (SLN) technique in male breast cancer. We retrospectively analysed 21 male patients diagnosed with breast cancer in our hospital from 2008 to 2016 with, at least, 18 months follow-up. Fifteen patients underwent selective sentinel lymph node biopsy (SLNB) following the usual protocols with peritumoral injection of 18.5-111MBq of 99m Tc-nanocoloides and acquisition of planar images 2hours after the injection. In 2 cases it was necessary to perform a SPECT/CT to locate the SLN. Immunohistochemistry and molecular techniques (OSNA) were used for their analysis. Six patients did not undergo SLNB because they had pathological nodes or distant disease at the time of diagnosis. SLNB was performed in 15 patients. The SLN was negative in 6 patients and positive in the remaining 9. Three patients with positive SLNB did not need axillary lymphadenectomy because of the low number of copies by molecular analysis OSNA. Axillary lymphadenectomy was performed in the remaining 6 patients with the result of 4 positive axillary lymphadenectomies and 2 that did not show further extension of the disease. According to our experience, SLNB in males is a reproducible, useful, safe and reliable technique which avoids unnecessary axillary lymphadenectomy and prevents the appearance of undesirable effects. Copyright © 2017. Publicado por Elsevier España, S.L.U.

Modeling and Simulation of a Novel Relay Node Based Secure Routing Protocol Using Multiple Mobile Sink for Wireless Sensor Networks.

PubMed

Perumal, Madhumathy; Dhandapani, Sivakumar

2015-01-01

Data gathering and optimal path selection for wireless sensor networks (WSN) using existing protocols result in collision. Increase in collision further increases the possibility of packet drop. Thus there is a necessity to eliminate collision during data aggregation. Increasing the efficiency is the need of the hour with maximum security. This paper is an effort to come up with a reliable and energy efficient WSN routing and secure protocol with minimum delay. This technique is named as relay node based secure routing protocol for multiple mobile sink (RSRPMS). This protocol finds the rendezvous point for optimal transmission of data using a "splitting tree" technique in tree-shaped network topology and then to determine all the subsequent positions of a sink the "Biased Random Walk" model is used. In case of an event, the sink gathers the data from all sources, when they are in the sensing range of rendezvous point. Otherwise relay node is selected from its neighbor to transfer packets from rendezvous point to sink. A symmetric key cryptography is used for secure transmission. The proposed relay node based secure routing protocol for multiple mobile sink (RSRPMS) is experimented and simulation results are compared with Intelligent Agent-Based Routing (IAR) protocol to prove that there is increase in the network lifetime compared with other routing protocols.

Epidermal growth factor receptor (EGFr); results of a 6 year follow-up study in operable breast cancer with emphasis on the node negative subgroup.

PubMed Central

Nicholson, S.; Richard, J.; Sainsbury, C.; Halcrow, P.; Kelly, P.; Angus, B.; Wright, C.; Henry, J.; Farndon, J. R.; Harris, A. L.

1991-01-01

More accurate criteria are required for the selection of patients with node-negative breast cancer for systemic adjuvant therapy. Expression of epidermal growth factor receptor (EGFr) has been shown previously to be inversely related to oestrogen receptor (ER) in patients with operable breast cancer and to be associated with a poorer prognosis. Analysis of EGFr and ER was performed on tumour samples from 231 patients with operable breast cancer followed for up to 6 years after surgery. The median duration of follow-up in patients still alive at the time of analysis was 45 months. Thirty-five percent of patients (82) had tumours with greater than 10 fmol mg-1 I125-EGF binding (EGFr+) and 47% (109) and cystolic ER concentrations greater than 5 fmol mg-1 (ER+), with a marked inverse relationship between EGFr and ER (P less than 0.00001). In a univariate analysis EGFr was second only to axillary node status as a prognostic marker for all patients both in terms of relapse-free and overall survival (P less than 0.001, log rank). For patients with histologically negative axillary nodes EGFr was superior to ER in predicting relapse and survival (P less than 0.01 and P less than 0.005 respectively compared to P less than 0.1 and P less than 0.1, log rank). In a multivariate (Cox model) analysis only EGFr, out of EGFr, ER, size and grade, was predictive for either relapse-free or overall survival for patients with node-negative disease (P = 0.05 and P = 0.026 respectively). EGFr has been shown to be a marker of poor prognosis for patients with node-negative breast cancer. Since patients with EGFr+ tumours are unlikely to respond to hormone therapy it may be possible to select them for trials of systemic adjuvant chemotherapy. PMID:1846551

Epidermal growth factor receptor (EGFr); results of a 6 year follow-up study in operable breast cancer with emphasis on the node negative subgroup.

PubMed

Nicholson, S; Richard, J; Sainsbury, C; Halcrow, P; Kelly, P; Angus, B; Wright, C; Henry, J; Farndon, J R; Harris, A L

1991-01-01

More accurate criteria are required for the selection of patients with node-negative breast cancer for systemic adjuvant therapy. Expression of epidermal growth factor receptor (EGFr) has been shown previously to be inversely related to oestrogen receptor (ER) in patients with operable breast cancer and to be associated with a poorer prognosis. Analysis of EGFr and ER was performed on tumour samples from 231 patients with operable breast cancer followed for up to 6 years after surgery. The median duration of follow-up in patients still alive at the time of analysis was 45 months. Thirty-five percent of patients (82) had tumours with greater than 10 fmol mg-1 I125-EGF binding (EGFr+) and 47% (109) and cystolic ER concentrations greater than 5 fmol mg-1 (ER+), with a marked inverse relationship between EGFr and ER (P less than 0.00001). In a univariate analysis EGFr was second only to axillary node status as a prognostic marker for all patients both in terms of relapse-free and overall survival (P less than 0.001, log rank). For patients with histologically negative axillary nodes EGFr was superior to ER in predicting relapse and survival (P less than 0.01 and P less than 0.005 respectively compared to P less than 0.1 and P less than 0.1, log rank). In a multivariate (Cox model) analysis only EGFr, out of EGFr, ER, size and grade, was predictive for either relapse-free or overall survival for patients with node-negative disease (P = 0.05 and P = 0.026 respectively). EGFr has been shown to be a marker of poor prognosis for patients with node-negative breast cancer. Since patients with EGFr+ tumours are unlikely to respond to hormone therapy it may be possible to select them for trials of systemic adjuvant chemotherapy.

ZEA-TDMA: design and system level implementation of a TDMA protocol for anonymous wireless networks

NASA Astrophysics Data System (ADS)

Banerjee, Debasmit; Dong, Bo; Biswas, Subir

2013-05-01

Wireless sensor network used in military applications may be deployed in hostile environments, where privacy and security is of primary concern. This can lead to the formation of a trust-based sub-network among mutually-trusting nodes. However, designing a TDMA MAC protocol is very challenging in situations where such multiple sub-networks coexist, since TDMA protocols require node identity information for slot assignments. This paper introduces a novel distributed TDMA MAC protocol, ZEA-TDMA (Zero Exposure Anonymous TDMA), for anonymous wireless networks. ZEA-TDMA achieves slot allocation with strict anonymity constraints, i.e. without nodes having to exchange any identity revealing information. By using just the relative time of arrival of packets and a novel technique of wireless collision-detection and resolution for fixed packetsizes, ZEA-TDMA is able to achieve MAC slot-allocation which is described as follows. Initially, a newly joined node listens to its one-hop neighborhood channel usage and creates a slot allocation table based on its own relative time, and finally, selects a slot that is collision free within its one-hop neighborhood. The selected slot can however cause hidden collisions with a two-hop neighbor of the node. These collisions are resolved by a common neighbor of the colliding nodes, which first detects the collision, and then resolve them using an interrupt packet. ZEA-TDMA provides the following features: a) it is a TDMA protocol ideally suited for highly secure or strictly anonymous environments b) it can be used in heterogeneous environments where devices use different packet structures c) it does not require network time-synchronization, and d) it is insensitive to channel errors. We have implemented ZEA-TDMA on the MICA2 hardware platform running TinyOS and evaluated the protocol functionality and performance on a MICA2 test-bed.

CUFID-query: accurate network querying through random walk based network flow estimation.

PubMed

Jeong, Hyundoo; Qian, Xiaoning; Yoon, Byung-Jun

2017-12-28

Functional modules in biological networks consist of numerous biomolecules and their complicated interactions. Recent studies have shown that biomolecules in a functional module tend to have similar interaction patterns and that such modules are often conserved across biological networks of different species. As a result, such conserved functional modules can be identified through comparative analysis of biological networks. In this work, we propose a novel network querying algorithm based on the CUFID (Comparative network analysis Using the steady-state network Flow to IDentify orthologous proteins) framework combined with an efficient seed-and-extension approach. The proposed algorithm, CUFID-query, can accurately detect conserved functional modules as small subnetworks in the target network that are expected to perform similar functions to the given query functional module. The CUFID framework was recently developed for probabilistic pairwise global comparison of biological networks, and it has been applied to pairwise global network alignment, where the framework was shown to yield accurate network alignment results. In the proposed CUFID-query algorithm, we adopt the CUFID framework and extend it for local network alignment, specifically to solve network querying problems. First, in the seed selection phase, the proposed method utilizes the CUFID framework to compare the query and the target networks and to predict the probabilistic node-to-node correspondence between the networks. Next, the algorithm selects and greedily extends the seed in the target network by iteratively adding nodes that have frequent interactions with other nodes in the seed network, in a way that the conductance of the extended network is maximally reduced. Finally, CUFID-query removes irrelevant nodes from the querying results based on the personalized PageRank vector for the induced network that includes the fully extended network and its neighboring nodes. Through extensive performance evaluation based on biological networks with known functional modules, we show that CUFID-query outperforms the existing state-of-the-art algorithms in terms of prediction accuracy and biological significance of the predictions.

Contact Trees: Network Visualization beyond Nodes and Edges

PubMed Central

Sallaberry, Arnaud; Fu, Yang-chih; Ho, Hwai-Chung; Ma, Kwan-Liu

2016-01-01

Node-Link diagrams make it possible to take a quick glance at how nodes (or actors) in a network are connected by edges (or ties). A conventional network diagram of a “contact tree” maps out a root and branches that represent the structure of nodes and edges, often without further specifying leaves or fruits that would have grown from small branches. By furnishing such a network structure with leaves and fruits, we reveal details about “contacts” in our ContactTrees upon which ties and relationships are constructed. Our elegant design employs a bottom-up approach that resembles a recent attempt to understand subjective well-being by means of a series of emotions. Such a bottom-up approach to social-network studies decomposes each tie into a series of interactions or contacts, which can help deepen our understanding of the complexity embedded in a network structure. Unlike previous network visualizations, ContactTrees highlight how relationships form and change based upon interactions among actors, as well as how relationships and networks vary by contact attributes. Based on a botanical tree metaphor, the design is easy to construct and the resulting tree-like visualization can display many properties at both tie and contact levels, thus recapturing a key ingredient missing from conventional techniques of network visualization. We demonstrate ContactTrees using data sets consisting of up to three waves of 3-month contact diaries over the 2004-2012 period, and discuss how this design can be applied to other types of datasets. PMID:26784350